diff --git a/.codespell-ignore.txt b/.codespell-ignore.txt
index 7415d0c78e6..917f068e298 100644
--- a/.codespell-ignore.txt
+++ b/.codespell-ignore.txt
@@ -42,6 +42,7 @@ Udo
 Yau
 Mathes
 Smal
+Asai
 
 # Technical or code related terms
 aCount
@@ -98,3 +99,9 @@ ons
 sie
 tru
 ublication
+doubleclick
+
+# German glossary label
+Referenz
+pre-selected
+jus
diff --git a/.codespellrc b/.codespellrc
index 324ecf2ae0c..16ee12ffa9e 100644
--- a/.codespellrc
+++ b/.codespellrc
@@ -1,6 +1,6 @@
 [codespell]
 # Skip these files and directories
-skip = .git,*.png,*.jpg,*.jpeg,*.gif,*.svg,*.ico,*.woff,*.woff2,*.ttf,*.eot,*.min.js,*.min.css,themes,node_modules,public,resources,static/admin,static/newsletters,*.lock,package-lock.json,.hugo_build.lock,go.sum,*.json,*.css,*.scss,*.toml,content/glossary/german,content/glossary/portuguese,content/glossary/arabic,content/glossary/spanish,content/glossary/french,content/glossary/turkish,data,*.pdf,content/glossary/english/open_material.md
+skip = .git,assets/three,assets/three/*,scripts/rebrand/baseline,scripts/rebrand/baseline/*,*.png,*.jpg,*.jpeg,*.gif,*.svg,*.ico,*.woff,*.woff2,*.ttf,*.eot,*.min.js,*.bundle.js,*.min.css,themes,node_modules,public,resources,static/admin,static/newsletters,*.lock,package-lock.json,.hugo_build.lock,go.sum,*.json,*.css,*.scss,*.toml,content/glossary/german,content/glossary/portuguese,content/glossary/arabic,content/glossary/spanish,content/glossary/french,content/glossary/turkish,data,*.pdf,content/glossary/english/open_material.md
 
 # Ignore these words (project-specific terms and proper nouns)
 ignore-words = .codespell-ignore.txt
diff --git a/.github/workflows/README.md b/.github/workflows/README.md
index 3f64a1477ff..81134ada7dc 100644
--- a/.github/workflows/README.md
+++ b/.github/workflows/README.md
@@ -20,7 +20,7 @@ This document describes the GitHub Actions workflows used in the FORRT website r
 
 ## Deployment Workflows
 
-### [deploy.yaml](workflows/deploy.yaml)
+### [deploy.yaml](deploy.yaml)
 **Production deployment to forrt.org**
 
 | Trigger | Target | Schedule |
@@ -33,7 +33,7 @@ Builds the Hugo site and deploys to GitHub Pages (`gh-pages` branch).
 
 It uses the newest `data-artifact` and `announcements-artifact` from runs on `main` only. Runs of `data-processing.yml` or `create_announcements.yml` dispatched from another branch, for example to test a pipeline change, upload `*-preview` artifacts (#1030) that production never uses (#960). Staging can opt in to a branch's data artifact only; it never uses branch announcement artifacts. To stage branch data, run `data-processing.yml` on the branch, then dispatch `staging-aggregate.yaml` with `data_branch` set to that branch (combine with `single_pr` to stage only the PR that changes the pipeline). Production never uses it. If a branch other than `main` is named and has no data artifact, staging stops with an error rather than substituting `main`'s data (`data_branch: main` behaves like leaving it empty). For default staging runs and production, a missing data artifact makes the fallback dispatch `data-processing.yml` on `main`; a missing announcements artifact is not regenerated by these workflows.
 
-### [staging-aggregate.yaml](workflows/staging-aggregate.yaml)
+### [staging-aggregate.yaml](staging-aggregate.yaml)
 **Staging deployment for pull requests**
 
 | Trigger | Target | Schedule |
@@ -49,9 +49,23 @@ Features:
 - Queues builds instead of canceling (concurrency)
 - Auto-cleans old staging branches (keeps 2)
 
+### [rebrand-preview.yaml](rebrand-preview.yaml)
+**Preview of the Doors redesign, while it is in progress**
+
+| Trigger | Target | Schedule |
+|---------|--------|----------|
+| Push to `rebrand-doors` | forrt.org/rebrand-doors/ (`forrtproject/rebrand-doors`) | On push |
+| PR into `rebrand-doors` | Checks only, no deployment | On PR events |
+
+Features:
+- Uses the same data and announcement artifacts as `deploy.yaml`, with noindex and no analytics
+- Compares each build with its merge base with `main`: URL list, structured data, SEO tags and internal links. See `scripts/rebrand/README.md`
+- A failed check marks the run red but still updates the preview
+- Delete this workflow when the redesign launches
+
 ## Data Workflows
 
-### [data-processing.yml](workflows/data-processing.yml)
+### [data-processing.yml](data-processing.yml)
 **Fetches and processes external data sources**
 
 | Trigger | Schedule |
@@ -78,7 +92,7 @@ Triggers `deploy.yaml` after successful processing via `repository_dispatch`.
 
 ## Quality Checks
 
-### [spell-check.yaml](workflows/spell-check.yaml)
+### [spell-check.yaml](spell-check.yaml)
 **Spelling validation using codespell**
 
 | Trigger | Runs on |
@@ -94,7 +108,7 @@ Triggers `deploy.yaml` after successful processing via `repository_dispatch`.
 |---------|---------|
 | Pull requests changing the clusters data, parser or tests | PR branches |
 
-### [check_images.yaml](workflows/check_images.yaml)
+### [check_images.yaml](check_images.yaml)
 **Image validation in PRs**
 
 | Trigger | Runs on |
@@ -105,7 +119,7 @@ Validates image files and references.
 
 ## Repository Maintenance
 
-### [cleanup-branches.yml](workflows/cleanup-branches.yml)
+### [cleanup-branches.yml](cleanup-branches.yml)
 **Automated branch cleanup**
 
 | Trigger | Schedule |
diff --git a/.github/workflows/rebrand-preview.yaml b/.github/workflows/rebrand-preview.yaml
new file mode 100644
index 00000000000..158a0036269
--- /dev/null
+++ b/.github/workflows/rebrand-preview.yaml
@@ -0,0 +1,228 @@
+name: Doors preview
+
+# =======================
+# Doors Redesign Preview
+# =======================
+# Purpose: Builds the rebrand-doors branch and publishes it at forrt.org/rebrand-doors/
+# Triggers: Push to rebrand-doors, and PRs into it (checks only, no deployment)
+# Target: forrtproject/rebrand-doors, on GitHub Pages under the forrt.org domain
+# Checks: Every run also builds the merge base with main from the same data, then compares
+#         the two builds.
+#         A failed check shows on the run but does not hold back the preview.
+# Note: Uses the same data and announcement artifacts as deploy.yaml. Delete this
+#       workflow when the redesign launches.
+
+on:
+  push:
+    branches:
+      - rebrand-doors
+  pull_request:
+    branches:
+      - rebrand-doors
+
+env:
+  FORCE_JAVASCRIPT_ACTIONS_TO_NODE24: "true"
+
+concurrency:
+  group: rebrand-preview-${{ github.ref }}
+  cancel-in-progress: true
+
+jobs:
+  build:
+    name: Build and check
+    runs-on: ubuntu-22.04
+    # Fork PRs get no artifacts token and have no preview to update.
+    if: github.event_name != 'pull_request' || github.event.pull_request.head.repo.full_name == github.repository
+    permissions:
+      contents: read
+      actions: read  # Needed for artifact access
+    env:
+      HUGO_VERSION: "0.158.0"
+      HUGO_EXTENDED: true
+      PREVIEW_BASE: /rebrand-doors/
+      PREVIEW_URL: https://forrt.org/rebrand-doors/
+    outputs:
+      source-rules: ${{ steps.source-rules.outcome }}
+      compare: ${{ steps.compare.outcome }}
+      links: ${{ steps.links.outcome }}
+      seo: ${{ steps.seo.outcome }}
+      design: ${{ steps.design.outcome }}
+      axe: ${{ steps.axe.outcome }}
+    steps:
+      - name: Checkout repository
+        uses: actions/checkout@v6
+        with:
+          fetch-depth: 0
+
+      # See deploy.yaml: Git quotes non-ASCII paths unless this is off, and Hugo
+      # then finds no date for them.
+      - name: Let Git report non-ASCII paths unquoted
+        run: git config core.quotepath false
+
+      # The point where the branch last took main, not main's tip: otherwise anything landing
+      # on main shows up here as a change, until main is next merged in.
+      - name: Check out the merge base with main as the reference
+        run: git worktree add --detach "$RUNNER_TEMP/reference" "$(git merge-base origin/main HEAD)"
+
+      # =======================
+      # Artifacts, as in deploy.yaml
+      # =======================
+      - name: Download data artifact
+        uses: dawidd6/action-download-artifact@07ab29fd4a977ae4d2b275087cf67563dfdf0295
+        continue-on-error: true
+        with:
+          workflow: data-processing.yml
+          name: data-artifact
+          path: ${{ runner.temp }}/artifacts/data
+          github_token: ${{ secrets.GITHUB_TOKEN }}
+          search_artifacts: true
+          branch: main  # as in deploy.yaml: only main's runs, never a branch test run (#960)
+          if_no_artifact_found: warn
+
+      - name: Download announcements artifact
+        uses: dawidd6/action-download-artifact@07ab29fd4a977ae4d2b275087cf67563dfdf0295
+        continue-on-error: true
+        with:
+          workflow: create_announcements.yml
+          name: announcements-artifact
+          path: ${{ runner.temp }}/artifacts/announcements
+          github_token: ${{ secrets.GITHUB_TOKEN }}
+          search_artifacts: true
+          branch: main  # as in deploy.yaml: only main's runs, never a branch test run (#960)
+          if_no_artifact_found: warn
+
+      - name: Apply artifacts to both checkouts
+        run: |
+          for checkout in . "$RUNNER_TEMP/reference"; do
+            scripts/rebrand/apply_artifacts.sh "$checkout" \
+              "$RUNNER_TEMP/artifacts/data" "$RUNNER_TEMP/artifacts/announcements"
+          done
+
+      # =======================
+      # Builds
+      # =======================
+      - name: Setup Hugo
+        uses: peaceiris/actions-hugo@75d2e84710de30f6ff7268e08f310b60ef14033f
+        with:
+          hugo-version: ${{ env.HUGO_VERSION }}
+          extended: ${{ env.HUGO_EXTENDED }}
+
+      # HUGO_ENV=staging adds noindex and leaves out Google Analytics.
+      - name: Build the branch
+        run: hugo --gc --minify --cleanDestinationDir --destination public --baseURL "$PREVIEW_URL"
+        env:
+          HUGO_ENV: staging
+
+      - name: Build the reference from the same data
+        working-directory: ${{ runner.temp }}/reference
+        run: hugo --gc --minify --destination "$RUNNER_TEMP/public-reference" --baseURL "$PREVIEW_URL"
+        env:
+          HUGO_ENV: staging
+
+      - name: Point root-relative links at the subfolder
+        run: |
+          python3 scripts/rebrand/preview_paths.py public --base "$PREVIEW_BASE"
+          python3 scripts/rebrand/preview_paths.py "$RUNNER_TEMP/public-reference" --base "$PREVIEW_BASE"
+
+      # =======================
+      # Checks
+      # =======================
+      - name: Templates and generated paths
+        id: source-rules
+        continue-on-error: true
+        run: python3 scripts/rebrand/check_source_rules.py --base origin/main
+
+      - name: URL list, structured data and SEO tags against the reference
+        id: compare
+        continue-on-error: true
+        run: python3 scripts/rebrand/compare_builds.py "$RUNNER_TEMP/public-reference" public
+
+      - name: Internal links
+        id: links
+        continue-on-error: true
+        run: |
+          python3 scripts/rebrand/check_internal_links.py public --base "$PREVIEW_BASE" \
+            --reference "$RUNNER_TEMP/public-reference"
+
+      - name: Built HTML (headings, conditional assets, image alt and dimensions)
+        id: seo
+        continue-on-error: true
+        run: python3 scripts/check_seo_html.py public
+
+      - name: Designed screens in a browser (overflow, position, layout shift, pause, directory)
+        id: design
+        continue-on-error: true
+        run: |
+          pip install --quiet playwright==1.63.0 pillow
+          # The runner image already has Chromium's libraries; --with-deps adds fonts from the
+          # Ubuntu mirror. When the mirror is unreachable, install the browser without them.
+          playwright install --with-deps chromium || {
+            echo "::warning::Could not install Chromium's system packages; installing the browser without them"
+            playwright install chromium
+          }
+          python3 scripts/rebrand/check_design.py public --base "$PREVIEW_BASE"
+
+      - name: Accessibility rules in a browser (axe-core, by WCAG level)
+        id: axe
+        continue-on-error: true
+        run: |
+          curl -fsSL https://cdn.jsdelivr.net/npm/axe-core@4.11.1/axe.min.js -o "$RUNNER_TEMP/axe.min.js"
+          python3 scripts/rebrand/check_axe.py public --base "$PREVIEW_BASE" --axe "$RUNNER_TEMP/axe.min.js"
+
+      - name: Upload site artifact
+        if: github.event_name != 'pull_request'
+        uses: actions/upload-artifact@v7
+        with:
+          name: rebrand-preview-${{ github.run_number }}
+          path: public/
+          retention-days: 1
+          if-no-files-found: error
+
+  deploy:
+    name: Deploy preview
+    runs-on: ubuntu-22.04
+    needs: build
+    if: github.event_name != 'pull_request'
+    timeout-minutes: 15
+    steps:
+      - name: Download site artifact
+        uses: actions/download-artifact@v7
+        with:
+          name: rebrand-preview-${{ github.run_number }}
+          path: public
+
+      # No cname: the repository inherits the organisation site's forrt.org domain, which
+      # is what puts it at forrt.org/rebrand-doors/. force_orphan keeps one commit, so the
+      # repository does not grow by the size of the site on every push.
+      - name: Deploy to forrtproject/rebrand-doors
+        uses: peaceiris/actions-gh-pages@4f9cc6602d3f66b9c108549d475ec49e8ef4d45e
+        with:
+          personal_token: ${{ secrets.STAGING_GITHUB_TOKEN }}
+          external_repository: forrtproject/rebrand-doors
+          publish_dir: public
+          publish_branch: gh-pages
+          force_orphan: true
+
+  checks:
+    name: Check results
+    runs-on: ubuntu-22.04
+    needs: build
+    steps:
+      - name: Fail if any check failed
+        env:
+          SOURCE_RULES: ${{ needs.build.outputs.source-rules }}
+          COMPARE: ${{ needs.build.outputs.compare }}
+          LINKS: ${{ needs.build.outputs.links }}
+          SEO: ${{ needs.build.outputs.seo }}
+          DESIGN: ${{ needs.build.outputs.design }}
+          AXE: ${{ needs.build.outputs.axe }}
+        run: |
+          echo "Templates and generated paths: $SOURCE_RULES"
+          echo "URL list, structured data and SEO tags: $COMPARE"
+          echo "Internal links: $LINKS"
+          echo "Built HTML: $SEO"
+          echo "Designed screens: $DESIGN"
+          echo "Accessibility rules: $AXE"
+          for result in "$SOURCE_RULES" "$COMPARE" "$LINKS" "$SEO" "$DESIGN" "$AXE"; do
+            [ "$result" = "success" ] || exit 1
+          done
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
index fc615cdad71..8cfa0854da9 100644
--- a/CONTRIBUTING.md
+++ b/CONTRIBUTING.md
@@ -16,10 +16,12 @@ Please follow the [FORRT Code of Conduct](https://forrt.org/coc/) in issues, rev
 
 - [Questions, Ideas & Suggestions](#questions-ideas--suggestions)
 - [Edit content in your browser](#edit-content-in-your-browser)
+  - [Linking glossary terms](#linking-glossary-terms)
 - [Local Development Setup](#local-development-setup)
   - [Standard Setup](#standard-setup-git--hugo)
   - [RStudio Setup](#rstudio-setup)
 - [Contribution Workflow](#contribution-workflow)
+  - [Citing references](#citing-references)
   - [Contributing with AI tools](#contributing-with-ai-tools)
   - [Content, Licensing & Fact-Checking](#content-licensing--fact-checking)
 - [Deployment & Staging](#deployment--staging)
@@ -47,6 +49,12 @@ You do not need to install Git or Hugo to fix text or a broken link. Find the re
 
 Preserve the YAML/TOML front matter at the top of the file and existing Hugo shortcodes. Describe the affected page and link to it in your PR. Generated paths include `content/curated_resources/` (except `_index.md`), `content/glossary/`, `content/contributors/tenzing.md`, `content/contributor-analysis/`, `content/publications/citation_chart.webp`, announcement bundles in `content/post/`, `static/data/fred_citation.txt`, and generated files in `data/`. The manually maintained `data/publications.yaml` is editable; follow the [publication instructions](content/publications/README). Generated content is refreshed during deployment. Use the source submission form/sheet linked from the public page or open an issue rather than editing the generated output. Local previews use committed copies and can differ from production. For layout or code changes, use the local setup below.
 
+To set a short note beside the text, put `{{% callout title="A title" %}}Your note{{% /callout %}}` just before the paragraph it goes with. On articles and most other text pages it sits in the right-hand column on wide screens, and in the text on phones and on pages set to full width. `title` is optional, and `tone="example"` or `tone="warning"` changes its colour. Keep it short: a long note runs on past the text it goes with.
+
+### Linking glossary terms
+
+On hand-written pages, use `{{< term "Preregistration" >}}` to link an English glossary term. To match an existing inflection, use `{{< term "Preregistration" "preregistered" >}}`. Preserve the author's exact wording and spelling; add markup only, and skip an occurrence if it cannot be marked without changing the text. Titles are matched without regard to case. Mark only the first occurrence of each term on a page, and keep existing resource links intact. Hover, keyboard focus, or a first touch tap shows a short definition; the popover links to the full entry. A repeat tap on the open trigger, mouse clicks, and Enter follow the term link, which also works without JavaScript. Unknown terms render as plain text and produce a Hugo build warning; check the [English glossary](https://forrt.org/glossary/english/) for the exact title. Do not add these shortcodes to generated content.
+
 ## Local Development Setup
 
 Choose the setup method that suits your workflow.
@@ -145,6 +153,22 @@ All proposed changes must be made on a feature branch and submitted via a Pull R
 
 For more on Git, see the [official documentation](https://docs.github.com/en/get-started/using-git/about-git).
 
+### Citing references
+
+Hand-written pages can cite works in [`content/glossary/apa_lookup.json`](content/glossary/apa_lookup.json), the shared bibliography generated from the Glossary BibTeX Google Doc. Use its exact keys:
+
+```text
+{{< cite "Nosek2018" "Simmons2011" >}}
+{{< cite key="Nosek2018" narrative="true" >}}
+(e.g. Smith, 2019; {{< cite key="Nosek2018" bare="true" >}})
+```
+
+These render as “(Nosek et al., 2018; Simmons et al., 2011)”, “Nosek et al. (2018)” and “(e.g. Smith, 2019; Nosek et al., 2018)”. Use `bare` inside brackets you write yourself, for example alongside a work that isn't in the bibliography, so the author's wording stays as it was. Every page that cites must include `{{< references >}}` once, after its last citation, to add an alphabetical reference list. The built-HTML check fails citation links without matching reference entries. Clicking a citation opens its full APA reference with source and copy actions; without JavaScript it jumps to the reference list. Unknown keys produce a build warning and appear in square brackets.
+
+To ask readers to cite a work, show it as a card with a copy button: `{{< citation-card key="Asai2026OpenScholar" />}}` takes the reference from the bibliography, and `{{< citation-card >}}…{{< /citation-card >}}` takes one written out. In reference lists, cards and the “cite us” blocks, a reference with more than five authors shows the first three and “et al.”, with a button that shows the rest. Copying always gives the full reference.
+
+Do not edit the generated bibliography or glossary terms. Request additions to the Glossary BibTeX Doc through an issue; the bibliography generator supplies the APA text. Glossary definitions automatically link citations only when their first author and year identify exactly one of the term’s listed references and their author lists agree. Other citations stay plain text. Citations already linked to a source are left alone.
+
 ### Contributing with AI tools
 
 Contributions co-authored with AI agents are welcome, but only if you have **fully reviewed both the code and the content** yourself and can stand behind them.
diff --git a/assets/css/citations.css b/assets/css/citations.css
deleted file mode 100644
index 96b81498dab..00000000000
--- a/assets/css/citations.css
+++ /dev/null
@@ -1,357 +0,0 @@
-/* Reset and Base Styles */
-* {
-    margin: 0;
-    padding: 0;
-    box-sizing: border-box;
-}
-
-body {
-    /* font-family: -apple-system, BlinkMacSystemFont, 'Segoe UI', Roboto, Oxygen, Ubuntu, Cantarell, sans-serif; */
-    line-height: 1.6;
-    color: #333;
-    background-color: #f8fafc;
-}
-
-.container {
-    max-width: 1400px;
-    margin: 0 auto;
-    padding: 1rem 1rem;
-}
-
-/* Header Styles */
-.header {
-    text-align: center;
-    margin-bottom: 3rem;
-}
-
-.main-title {
-    font-size: 3rem;
-    font-weight: 700;
-    margin-bottom: 0.5rem;
-    background: linear-gradient(135deg, #3498db, #2c3e50);
-    -webkit-background-clip: text;
-    background-clip: text;
-    color: transparent;
-}
-
-.subtitle {
-    font-size: 1.1rem;
-    color: #6b7280;
-    max-width: 600px;
-    margin: 0 auto;
-}
-
-/* Main Layout */
-.main-layout {
-    display: flex;
-    flex-direction: column;
-    gap: 1rem;
-}
-
-.mobile-image {
-    display: flex;
-    justify-content: center;
-    margin-bottom: 1rem;
-}
-
-.center-column {
-    display: none;
-}
-
-.toolkit-image {
-    max-width: 100%;
-    height: auto;
-    border-radius: 12px;
-    box-shadow: 0 10px 30px rgba(0, 0, 0, 0.1);
-}
-
-/* Column Styles */
-.column {
-    flex: 1;
-}
-
-.right-column {
-    display: flex;
-    flex-direction: column;
-    gap: 2rem;
-}
-
-/* Stage Box Styles */
-.stage-box {
-    background: white;
-    border-radius: 12px;
-    box-shadow: 0 4px 20px rgba(0, 0, 0, 0.08);
-    padding: 0.7rem;
-    transition: all 0.3s ease;
-    border-top: 4px solid;
-    height: fit-content;
-}
-
-.stage-box:hover {
-    transform: translateY(-4px);
-    box-shadow: 0 8px 30px rgba(0, 0, 0, 0.15);
-}
-
-.stage-box.paper {
-    border-top-color: #e74c3c;
-}
-
-.stage-box.planning {
-    border-top-color: #ffc107;
-}
-
-.stage-box.project {
-    border-top-color: #019e74;
-}
-
-/* Stage Title Styles */
-h3 {
-    margin: 0.1rem;
-}
-.stage-title {
-    text-align: center;
-    color: white;
-    padding: 0.5rem 0.5rem;
-    border-radius: 8px;
-    margin-bottom: 1rem;
-    font-size: 1.1rem;
-    font-weight: 600;
-    box-shadow: 0 4px 10px rgba(0, 0, 0, 0.15);
-}
-
-.paper .stage-title {
-    background: linear-gradient(135deg, #d55e00, #d55e00);
-}
-
-.planning .stage-title {
-    background: linear-gradient(135deg, #ffc107, #ffc107);
-}
-
-.project .stage-title {
-    background: linear-gradient(135deg, #019e74, #019e74);
-}
-
-/* Content Styles */
-.section-title {
-    font-size: 0.9rem;
-    color: #2c3e50;
-    margin-bottom: 1rem;
-    padding-bottom: 0.5rem;
-    border-bottom: 2px dashed #ecf0f1;
-    font-weight: 500;
-}
-
-.tools-grid {
-    display: grid;
-    grid-template-columns: 1fr;
-    gap: 0.75rem;
-}
-
-/* Tool Box Styles */
-.tool-box {
-    background: white;
-    border: 1px solid #e5e7eb;
-    border-radius: 8px;
-    padding: 0.5rem;
-    transition: all 0.3s ease;
-    position: relative;
-    border-top: 3px solid;
-    min-height: 60px;
-    display: flex;
-    align-items: center;
-}
-
-.tool-box:hover {
-    transform: translateY(-2px);
-    box-shadow: 0 4px 15px rgba(160, 34, 69, 0.2);
-}
-
-.tool-box.tool {
-    border-top-color: #F9F4CB;
-    background: linear-gradient(to bottom,  #ffffff, #F9F4CB );
-}
-
-.tool-box.practice {
-    border-top-color: #E7E5E4;
-    background: linear-gradient(to bottom, #ffffff,  #E7E5E4);
-}
-
-.tool-box a {
-    text-decoration: none;
-    color: #374151;
-    font-weight: 500;
-    font-size: 0.85rem;
-    display: block;
-    width: 100%;
-}
-
-.tool-box a:hover {
-    color: #b3005a;
-}
-
-/* Category Badges */
-.tool-box::after {
-    content: attr(data-category);
-    position: absolute;
-    top: 1px;
-    right: 1px;
-    font-size: 0.5rem;
-    font-weight: 600;
-    padding: 1px 3px;
-    border-radius: 4px;
-    text-transform: uppercase;
-}
-
-.tool-box.tool::after {
-    content: "TOOL";
-    background-color: #f9f4cb;
-    color: #3e3e3e;
-}
-
-.tool-box.practice::after {
-    content: "PRACTICE";
-    background-color: #E7E5E4;
-    color: #3e3e3e;
-}
-
-/* Legend Styles */
-.legend {
-    margin-top: 3rem;
-    display: flex;
-    justify-content: center;
-    gap: 2rem;
-    background: white;
-    padding: 1rem 2rem;
-    border-radius: 50px;
-    box-shadow: 0 4px 20px rgba(0, 0, 0, 0.1);
-    max-width: 400px;
-    margin-left: auto;
-    margin-right: auto;
-    flex-wrap: wrap;
-}
-
-.legend-item {
-    display: flex;
-    align-items: center;
-    gap: 0.5rem;
-    font-weight: 500;
-    font-size: 0.9rem;
-}
-
-.legend-color {
-    width: 20px;
-    height: 20px;
-    border-radius: 4px;
-    border: 1px solid;
-}
-
-.legend-item.practice .legend-color {
-    background-color: #E7E5E4;
-    border-color: #E7E5E4;
-}
-
-.legend-item.tool .legend-color {
-    background-color: #f9f4cb;
-    border-color: #FEFDF6;
-}
-
-/* Large Screen Styles */
-@media (min-width: 1024px) {
-    .main-layout {
-        display: grid;
-        grid-template-columns: 1fr auto 1fr;
-        gap: 2rem;
-        align-items: start;
-    }
-
-    .mobile-image {
-        display: none;
-    }
-
-    .center-column {
-        display: flex;
-        justify-content: center;
-        align-items: flex-start;
-        padding: 0 1rem;
-    }
-
-    .center-column .toolkit-image {
-        max-width: 500px;
-        width: 100%;
-    }
-
-    .tools-grid {
-        grid-template-columns: repeat(auto-fit, minmax(200px, 1fr));
-    }
-
-    .main-title {
-        font-size: 4rem;
-    }
-}
-
-/* Medium Screen Styles */
-@media (min-width: 768px) and (max-width: 1023px) {
-    .tools-grid {
-        grid-template-columns: repeat(2, 1fr);
-    }
-
-    .main-title {
-        font-size: 3.5rem;
-    }
-}
-
-/* Small Screen Styles */
-@media (max-width: 767px) {
-    .container {
-        padding: 1rem;
-    }
-
-    .main-title {
-        font-size: 2.5rem;
-    }
-
-    .subtitle {
-        font-size: 1rem;
-    }
-
-    .legend {
-        flex-direction: column;
-        align-items: center;
-        gap: 1rem;
-        border-radius: 20px;
-        padding: 1.5rem;
-    }
-
-    .stage-box {
-        padding: 1.25rem;
-    }
-
-    .mobile-image .toolkit-image {
-        max-width: min(350px, 100%);
-    }
-}
-
-/* Animation */
-@keyframes fadeInUp {
-    from {
-        opacity: 0;
-        transform: translateY(30px);
-    }
-    to {
-        opacity: 1;
-        transform: translateY(0);
-    }
-}
-
-.stage-box {
-    animation: fadeInUp 0.6s ease-out forwards;
-}
-
-.stage-box:nth-child(1) { animation-delay: 0.1s; }
-.stage-box:nth-child(2) { animation-delay: 0.2s; }
-.stage-box:nth-child(3) { animation-delay: 0.3s; }
-
-.legend {
-    animation: fadeInUp 0.6s ease-out 0.4s forwards;
-    opacity: 0;
-}
diff --git a/assets/css/cite_us.css b/assets/css/cite_us.css
index 27e480fdd0b..039090c8973 100644
--- a/assets/css/cite_us.css
+++ b/assets/css/cite_us.css
@@ -1,64 +1,13 @@
-/* styles for the cite us  */
-    .cite-us-section {
-        margin-bottom: 1rem;
-    }
-
-    .section-title {
-        font-size: 1rem;
-        padding: 0.5rem;
-    }
-
-    .cite-us-item {
-        background: #f9fafb;
-        border: 1px solid #e5e7eb;
-        border-radius: 8px;
-        padding: 1rem;
-        margin-bottom: 1rem;
-        position: relative;
-    }
-
-    .cite-us-text {
-        font-family: Georgia, serif;
-        font-size: 0.95rem;
-        line-height: 1.7;
-        color: #374151;
-        margin-bottom: 1rem;
-    }
-
-    .copy-button {
-        position: absolute;
-        bottom: 0.5rem;
-        right: 0.5rem;
-        background: linear-gradient(to bottom,  #ffffff, #F9F4CB );
-        color: #374151;
-        border: none;
-        border-radius: 6px;
-        padding: 0.2rem 0.5rem;
-        font-size: 0.875rem;
-        font-weight: 500;
-        cursor: pointer;
-        transition: all 0.2s ease;
-        display: flex;
-        align-items: center;
-        gap: 0.5rem;
-    }
-
-    .copy-button:hover {
-        background: linear-gradient(to bottom, #ffffff,  #E7E5E4);
-        color:  #b3005a;
-        transform: translateY(-1px);
-    }
-
-    .copy-button.copied {
-        background: linear-gradient(to bottom,  #ffffff, #F9F4CB );
-    }
-
-    .copy-icon {
-        width: 16px;
-        height: 16px;
-    }
-
-    @media (max-width: 640px) {
-        .cite-us-text { padding-right: 0; margin-bottom: 3rem; }
-        .copy-button { position: static; margin-top: 1rem; width: 100%; justify-content: center; }
-    }
+/* The citation boxes on /about/cite_us/. */
+.cite-us-section{margin:0 0 28px}
+.cite-us-item{display:grid;grid-template-columns:minmax(0,1fr) auto;gap:12px;align-items:start;margin:0 0 12px;padding:14px 16px;background:var(--surface);border-radius:var(--r-small)}
+.cite-us-text{font-size:16px;line-height:1.5;color:var(--ink);overflow-wrap:anywhere}
+.article-layout .article-style .cite-us-section .section-title{margin:0 0 10px;font-size:21px}
+.copy-button{display:inline-flex;align-items:center;gap:6px;padding:5px 11px;background:#fff;border:1.5px solid var(--ink);border-radius:999px;color:var(--ink);font:600 15px/1.3 var(--text);cursor:pointer}
+.copy-button:hover{background:var(--ink);color:#fff}
+.copy-icon{width:14px;height:14px}
+@media(max-width:760px){.cite-us-item{grid-template-columns:minmax(0,1fr)}.copy-button{justify-self:start}}
+/* Reference text keeps to the reading measure, under 80 characters a line, whatever the page's width. */
+.cite-us-text p,.article-layout .article-style .cite-us-text p{max-width:28.4em;margin:0;font-size:inherit}
+.cite-us-text .ref-note,.article-layout .article-style .cite-us-text .ref-note{margin-top:8px}
+.disciplines-attribution .cite-us-item{max-width:640px;margin-inline:auto}
diff --git a/assets/css/doors/analysis.css b/assets/css/doors/analysis.css
new file mode 100644
index 00000000000..747c6305c84
--- /dev/null
+++ b/assets/css/doors/analysis.css
@@ -0,0 +1,134 @@
+/* The contributor analysis page: figures, charts and the network drawn by doors/network.js. */
+.analysis-page{padding:24px 0 56px}
+.analysis-head h1{font-size:clamp(36px,4.2vw,58px);line-height:1.06;letter-spacing:-.01em;margin:14px 0 0;text-wrap:balance}
+.analysis-standfirst{font:500 clamp(21px,1.9vw,25px)/1.4 var(--display);margin:18px 0 0;max-width:30em}
+.analysis-note{margin:0;font-size:16px;color:var(--soft);max-width:44em}
+.analysis-page :is(p,li) a{text-decoration:underline;text-underline-offset:3px}
+.analysis-page h2{font-size:clamp(27px,2.6vw,36px);line-height:1.15;margin:0}
+
+.stats{display:grid;grid-template-columns:repeat(auto-fit,minmax(min(10em,100%),1fr));gap:12px;margin:32px 0 14px}
+.stat{display:flex;flex-direction:column-reverse;justify-content:flex-end;gap:6px;background:var(--surface);border-radius:var(--r-large);padding:18px 20px;min-width:0}
+.stat dt{font:400 16px/1.3 var(--text);color:var(--ink)}
+.stat dd{margin:0;font:var(--display-weight) clamp(36px,4vw,52px)/1 var(--display);color:var(--ink)}
+
+.analysis-section{display:grid;grid-template-columns:minmax(0,1fr) minmax(0,2fr);gap:20px 56px;align-items:start;margin-top:56px;padding-top:28px;border-top:1px solid var(--line)}
+.analysis-intro p{margin:12px 0 0;max-width:30em}
+.analysis-chart{min-width:0}
+.analysis-summary{margin-top:24px}
+.analysis-summary p{max-width:42em}
+.analysis-summary img{display:block;width:100%;max-width:760px;height:auto;margin:20px 0}
+
+.bars{list-style:none;margin:0;padding:0}
+/* Wraps by the size of its text: name above, with the bar and number below, when they cannot share a line. */
+.bar{display:flex;flex-wrap:wrap;align-items:center;gap:3px 14px;padding:5px 0;font-size:17px;line-height:1.3}
+.bar-name{flex:0 1 18em;min-width:0;max-width:100%}
+.bar-track{flex:1 1 9em;order:1;display:block;height:12px}
+.bar-value{flex:0 0 3em;order:2;text-align:right;font-weight:600;font-variant-numeric:tabular-nums}
+.bar-fill{display:block;width:var(--share);min-width:2px;height:100%;background:var(--res);border-radius:0 4px 4px 0}
+
+.share-bar{display:flex;gap:2px;height:28px}
+.share-part{flex:0 1 0;min-width:3px;border-radius:4px}
+.share-0{background:#90bbd8}
+.share-1{background:#6aa3c9}
+.share-2{background:#4489b5}
+.share-3{background:#1f709f}
+.share-4{background:#005a87}
+.share-list{list-style:none;margin:14px 0 0;padding:0;display:grid;grid-template-columns:repeat(auto-fit,minmax(min(8em,100%),1fr));gap:12px}
+.share-list li{display:grid;grid-template-columns:14px minmax(0,1fr);gap:0 8px;align-items:baseline;line-height:1.3}
+.share-swatch{width:14px;height:14px;border-radius:4px;align-self:center}
+.share-label{font-size:16px}
+.share-number{grid-column:2;font:var(--display-weight) 28px/1.2 var(--display)}
+.share-people{grid-column:2;font-size:16px;color:var(--soft)}
+
+.analysis-more{margin-top:14px}
+.analysis-more>summary{font-weight:700;color:var(--link);cursor:pointer}
+.analysis-more[open]>summary{margin-bottom:10px}
+
+.analysis-network{margin-top:56px;padding-top:28px;border-top:1px solid var(--line)}
+.network-intro p,.network-intro .analysis-note{margin:12px 0 0;max-width:580px}
+.network-intro .analysis-note{margin-top:8px}
+.network-panel{display:grid;grid-template-columns:min(18em,45%) minmax(0,1fr);height:clamp(520px,calc(100vh - 48px),760px);margin-top:20px;background:var(--surface);border-radius:var(--r-large);overflow:hidden}
+.network-panel[hidden]{display:none}
+.network-controls{display:flex;flex-direction:column;gap:14px;padding:18px;min-height:0;min-width:0;overflow:auto}
+.network-field label{display:block;font-weight:700;margin-bottom:6px;line-height:1.3}
+.network-combo{position:relative}
+.network-input{width:100%;background:#fff;border:1.5px solid var(--soft);border-radius:var(--r-small);padding:10px 12px;font:400 17px/1.3 var(--text);color:var(--ink)}
+.network-input::placeholder{color:var(--soft);opacity:1}
+.network-options{position:fixed;z-index:20;max-height:280px;overflow:auto;margin:0;padding:4px;list-style:none;background:#fff;border:1.5px solid var(--soft);border-radius:var(--r-small);box-shadow:0 8px 24px rgba(38,45,53,.18)}
+.network-options[hidden]{display:none}
+.network-options li{display:flex;justify-content:space-between;gap:10px;padding:7px 9px;border-radius:5px;font-size:16px;line-height:1.3;cursor:pointer}
+.network-options li span:last-child{color:var(--soft);white-space:nowrap}
+.network-options li:hover,.network-options li[aria-selected=true]{background:var(--res-bg)}
+.network-chips{list-style:none;display:flex;flex-wrap:wrap;gap:6px;margin:8px 0 0;padding:0}
+.network-chips[hidden]{display:none}
+.network-chip{display:inline-flex;align-items:baseline;gap:7px;background:var(--res);border:1.5px solid var(--res);border-radius:999px;padding:5px 11px;font:400 15px/1.3 var(--text);color:#fff;text-align:start;cursor:pointer}
+.network-chip:hover{background:var(--ink);border-color:var(--ink)}
+.network-status{margin:0;font-weight:600;font-size:16px;line-height:1.35}
+.network-detail{min-height:0;font-size:16px;line-height:1.4}
+.network-detail[hidden]{display:none}
+.network-detail h3{font:var(--display-weight) 22px/1.2 var(--display);margin:0 0 6px}
+.network-detail h4{font:700 16px/1.3 var(--text);margin:12px 0 4px}
+.network-detail p{margin:0 0 6px}
+.network-detail ul{list-style:none;margin:0;padding:0}
+.network-detail li{padding:1px 0}
+.network-link{background:none;border:0;padding:0;font:400 16px/1.4 var(--text);color:var(--link);text-align:start;text-decoration:underline;text-underline-offset:3px;cursor:pointer}
+.network-link:hover{color:var(--ink)}
+.network-clear{font-weight:700}
+.network-guide h3{font:var(--display-weight) 20px/1.2 var(--display);margin:0 0 8px}
+.network-legend{list-style:none;margin:0;padding:0;font-size:16px;line-height:1.35}
+.network-legend li{display:grid;grid-template-columns:22px minmax(0,1fr);gap:8px;align-items:center;padding:3px 0}
+.legend-person{justify-self:center;width:10px;height:10px;border-radius:50%;background:var(--ink)}
+.legend-project{justify-self:center;width:14px;height:14px;border-radius:3px;background:var(--res)}
+.legend-line{justify-self:center;width:22px;height:0;border-top:1.5px solid var(--soft)}
+.network-hint{margin:10px 0 0;font-size:16px;line-height:1.4}
+.network-stage{position:relative;min-width:0;min-height:0;background:#fff}
+.network-canvas{display:block;width:100%;height:100%;cursor:grab;touch-action:pan-y}
+.network-canvas.dragging{cursor:grabbing}
+.network-canvas:focus-visible{outline:3px solid var(--ink);outline-offset:-3px}
+.network-tools{position:absolute;left:12px;bottom:12px;display:flex;gap:6px}
+.network-tool{min-width:40px;height:40px;padding:0 12px;background:#fff;border:1.5px solid var(--ink);border-radius:999px;font:600 16px/1 var(--text);color:var(--ink);cursor:pointer}
+.network-tool:hover{background:var(--ink);color:#fff}
+.network-tip{position:absolute;z-index:5;max-width:280px;padding:7px 10px;background:var(--ink);border-radius:var(--r-small);color:#fff;font-size:15px;line-height:1.3}
+.network-tip b{display:block;font-weight:700}
+.network-tip[hidden]{display:none}
+.network-list{margin-top:18px}
+.network-projects{list-style:none;margin:0;padding:0;columns:2;column-gap:32px}
+.network-projects>li{break-inside:avoid;padding:3px 0}
+.network-projects summary{cursor:pointer}
+.network-projects p{margin:4px 0 8px;font-size:16px;line-height:1.45}
+.network-count{color:var(--soft);font-size:16px;white-space:nowrap}
+
+.analysis-foot{margin-top:56px;padding-top:28px;border-top:1px solid var(--line)}
+.analysis-foot h2{margin-bottom:12px}
+.analysis-foot p{margin:0 0 10px;max-width:44em}
+
+@media(max-width:1000px){
+  .analysis-section{grid-template-columns:minmax(0,1fr)}
+  .network-projects{columns:1}
+}
+@media(max-width:860px){
+  /* The panel stacks: controls, then the drawing, then what the selection shows. */
+  .network-panel{display:flex;flex-direction:column;gap:14px;height:auto;padding:16px;overflow:visible}
+  .network-controls{display:contents}
+  .network-stage{order:1;height:min(62vh,440px);border-radius:var(--r-small);overflow:hidden}
+  .network-detail,.network-guide{order:2}
+}
+@media(max-width:760px){
+  .analysis-page{padding:18px 0 40px}
+  .stats{gap:10px;margin-top:24px}
+  .stat{padding:14px}
+  .stat dt{font-size:15px}
+  .analysis-section,.analysis-network,.analysis-foot{margin-top:36px;padding-top:22px}
+  .bar{gap:3px 10px;font-size:16px}
+  .bar-name{flex-basis:100%}
+  .bar-track{height:10px}
+  .share-list{grid-template-columns:minmax(0,1fr)}
+  .share-list li{display:flex;flex-wrap:wrap;align-items:baseline;gap:0 10px}
+  .share-label{flex:1 1 9em}
+  .share-number{font-size:20px}
+  .share-people{flex:0 0 auto;min-width:5.5em;text-align:right}
+  .network-stage{height:300px}
+  .network-canvas{cursor:default;touch-action:auto}
+  .network-tools{display:none}
+  .network-hint{display:none}
+}
diff --git a/assets/css/doors/article.css b/assets/css/doors/article.css
new file mode 100644
index 00000000000..4bfef085d22
--- /dev/null
+++ b/assets/css/doors/article.css
@@ -0,0 +1,459 @@
+/* Articles and plain content, every rule under .article-layout. Content here is Markdown written
+   for the old theme, so lists, tables and embeds are styled but not rebuilt. */
+.article-layout{display:grid;grid-template-columns:minmax(0,580px) 300px;justify-content:center;gap:64px;padding:32px 0 32px;align-items:start}
+.article-layout-single{grid-template-columns:minmax(0,580px)}
+.article-layout-wide{grid-template-columns:minmax(0,1fr)}
+.article-layout .reading{min-width:0}
+.article-layout .crumbs{margin-bottom:18px}
+.article-layout .article-head{margin-bottom:22px}
+.article-layout .article-head:has(.byline:empty){margin-bottom:0}
+.article-layout .article-meta{display:flex;flex-wrap:wrap;gap:8px;margin-bottom:18px;font-size:15px;font-weight:600}
+.article-layout .article-meta span{background:var(--surface);padding:3px 10px;border-radius:var(--r-small)}
+.article-layout .reading h1{font-size:clamp(36px,4.2vw,58px);line-height:1.06;letter-spacing:-.01em;margin:0;text-wrap:balance}
+/* In the narrow column a bigger screen must not mean a taller stack of title lines. */
+.article-layout:not(.article-layout-wide) .reading h1{font-size:clamp(34px,3.2vw,44px);line-height:1.1}
+.article-layout .reading h1.long-title{font-size:clamp(28px,3vw,40px);line-height:1.12}
+/* For long compounds. Not in English, where Safari hyphenates any word at a line end. */
+.article-layout .reading h1:lang(de),.article-layout .reading h1:lang(tr){hyphens:auto}
+.article-layout .standfirst{font:500 clamp(21px,1.9vw,23px)/1.4 var(--display);margin:18px 0 0;max-width:30em;color:var(--ink)}
+.article-layout .byline{display:flex;flex-wrap:wrap;gap:4px 18px;margin:16px 0 0;font-size:16px}
+.article-layout .byline a{color:var(--link);text-underline-offset:3px;text-decoration:underline}
+.article-layout .byline-authors>*{display:inline}
+.article-layout .article-image{margin:0 0 28px}
+.article-layout .article-image img{display:block;width:100%;height:auto;border-radius:var(--r-small)}
+.article-layout figcaption{margin-top:10px;font-size:15px;text-align:center}
+.article-layout .article-style{font-size:18px;line-height:1.6;color:var(--ink);text-align:start;overflow-wrap:break-word}
+.article-layout .article-style p,.article-layout .article-style li{font-size:inherit;line-height:inherit}
+/* Wide pages keep the reading width for their prose, and give the rest of the page to tables and charts. */
+.article-layout-wide .article-style p,.article-layout-wide .article-style li{max-width:29em}
+.article-layout .article-style p{margin:0 0 16px;max-width:28.4em}
+/* Under 80 characters a line (checked by check_design.py). The column is wider so pictures, tables and
+   embeds get the room; plain lists and reference lists keep to the text's measure plus their indent. */
+.article-layout:not(.article-layout-wide) .article-style :is(ul:not([class]),ol:not([class]),.references-list){max-width:29.8em}
+/* Old pages put <br> on its own line between blocks to add space under the previous theme. Between
+   blocks it only opens a gap (up to 1,600px on a page), so drop it. A <br> inside a paragraph, or one that
+   clears floats (Awards), is untouched. */
+.article-layout .article-style>br:not([clear],[style*="clear"]),.article-layout .article-style>.doc-section>br:not([clear],[style*="clear"]){display:none}
+.article-layout .article-style ul,.article-layout .article-style ol{margin:0 0 18px;padding-inline-start:1.4em}
+.article-layout .article-style li{margin-bottom:6px}
+.article-layout .article-style :is(h2,h3,h4){line-height:1.15;margin:34px 0 12px;text-align:start}
+.article-layout .article-style h2{font-size:28px}
+.article-layout .article-style h3{font-size:23px}
+.article-layout .article-style h4{font-size:20px}
+.article-layout .article-style a:not([class]){color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.article-layout .article-style a:not([class]):hover{color:var(--ink)}
+.article-layout .article-style blockquote{margin:28px 0;padding:18px 22px;background:var(--edu-bg);border:0;border-radius:var(--r-large);color:var(--ink);font-size:18px!important;max-width:600px}
+.article-layout .article-style blockquote p:last-child{margin-bottom:0}
+.article-layout .article-style figure{margin:28px 0}
+.article-layout .article-style img{max-width:100%;height:auto}
+.article-layout .article-style div[style*="display:flex"]{flex-wrap:wrap}
+.article-layout .article-style iframe,.article-layout .article-style video{max-width:100%}
+/* A hand-coloured red button in one lesson. Our red keeps its meaning and passes on the page. */
+.article-layout .article-style .btn[style*="color:red"]{color:var(--urgent)!important}
+.article-layout .article-style div.alert,.article-layout .article-style div.alert>div{font-size:inherit;color:var(--ink)}
+.article-layout .article-style div[style*="width"]{max-width:100%}
+.article-layout .article-style table{display:block;max-width:100%;overflow-x:auto;margin:0 0 18px;font-size:16px;line-height:1.45;border-collapse:collapse}
+.article-layout .article-style th,.article-layout .article-style td{padding:6px 10px;border-bottom:1px solid var(--line);text-align:start}
+.article-layout .article-style pre{max-width:100%;overflow-x:auto;font-size:15px}
+.article-layout .article-style code{font-size:max(15px,.9em)}
+main:lang(ar) .article-layout .article-style,main:lang(ar) .article-layout .article-style p,main:lang(ar) .article-layout .article-style li{font-size:21px}
+/* The theme's root size shrinks on phones, so rem and small-text rules from it and from older
+   Markdown come out as low as 10 px. */
+.article-layout .article-style :is(small,.small,[style*="font-size:."],[style*="font-size:0."]),.article-layout .article-style .btn:not([style*="font-size"]),.article-layout .btn-links .btn{font-size:15px!important;line-height:1.35}
+.article-layout .article-foot{margin-top:32px;font-size:16px}
+/* Two or more buttons in one paragraph keep a gap between them when they wrap onto separate lines. */
+.article-layout .article-style p:has(>.btn~.btn){display:flex;flex-wrap:wrap;gap:10px;align-items:center}
+.article-layout .article-style p:has(>.btn~.btn)>.btn{margin:0}
+.article-layout .share-link{margin:0 0 18px}
+.article-layout .copy-link{background:#fff;border:1.5px solid var(--ink);border-radius:999px;padding:8px 12px;font:600 15px/1.3 var(--text);color:var(--ink);cursor:pointer}
+.article-layout .copy-link:hover{background:var(--ink);color:#fff}
+.article-layout .article-tags .badge{background:var(--surface);color:var(--ink);font:600 15px/1.4 var(--text);padding:3px 10px;border-radius:var(--r-small);margin:0 6px 6px 0}
+.article-layout .article-widget h3{font-size:24px;margin:28px 0 10px}
+.article-layout .article-foot .meta-nav{font-size:15px;font-weight:700;letter-spacing:0;text-transform:none;color:var(--soft)}
+.article-layout .article-foot .post-nav-item p,.article-layout .article-foot .article-widget li{font-size:16px;line-height:1.4;margin:0}
+.article-layout .article-foot :is(.card-subtitle,.card-text){font-size:16px;max-width:30em}
+.article-layout .article-widget a{color:var(--link)}
+.article-layout .article-card{position:sticky;top:24px;max-height:calc(100vh - 48px - var(--banner,0px));overflow-y:auto;background:var(--surface);border-radius:var(--r-large);padding:22px;font-size:16px;line-height:1.45}
+.article-layout .article-card h2{font-size:23px;line-height:1.15;margin:0 0 8px}
+.article-layout .article-card dl{margin:0 0 20px}
+.article-layout .article-card dl:last-child{margin-bottom:0}
+.article-layout .article-card dt{font-weight:700;font-size:15px;margin-top:10px}
+.article-layout .article-card dt:first-child{margin-top:0}
+.article-layout .article-card dd{margin:1px 0 0}
+.article-layout .article-toc ul{list-style:none;margin:0;padding:0}
+.article-layout .article-toc ul ul{padding-inline-start:12px}
+.article-layout .article-toc #TableOfContents a{display:block;padding:5px 0;font-size:16px;line-height:1.35;color:var(--link);text-underline-offset:3px;text-decoration:underline}
+/* On a desktop the side card (contents, date, term list, profile) sits to the left of the text and the
+   pair is centred, so spare width goes to the outer margins. It may come after the text in the page;
+   the grid places it all the same. */
+@media(min-width:1001px){
+  .article-layout:not(.article-layout-wide){grid-template-columns:minmax(0,640px)}
+  .article-layout:not(.article-layout-wide):has(>.article-card){grid-template-columns:220px minmax(0,640px);column-gap:48px}
+  .article-layout:not(.article-layout-wide):has(>.article-card)>.reading{grid-column:2;grid-row:1}
+  .article-layout:not(.article-layout-wide)>.article-card{grid-column:1;grid-row:1;box-sizing:border-box;width:220px;padding:18px}
+}
+@media(max-width:1000px){
+  .article-layout{grid-template-columns:minmax(0,640px);gap:36px}
+  .article-layout-wide{grid-template-columns:minmax(0,1fr)}
+  .article-layout .article-card{position:static;max-height:none}
+}
+@media(max-width:760px){
+  .article-layout{padding:20px 0 24px}
+  .article-layout .article-style{font-size:17px}
+  main:lang(ar) .article-layout .article-style,main:lang(ar) .article-layout .article-style p,main:lang(ar) .article-layout .article-style li{font-size:20px}
+}
+/* Call-outs: in the text up to 1240px. On wider screens they float into a third column on the right,
+   where clear keeps them under each other; the contents card stays on the left and in view. */
+.article-layout .callout{box-sizing:border-box;margin:28px 0;padding:18px 20px;background:var(--res-bg);border-radius:var(--r-large);font-size:17px;line-height:1.5;color:var(--ink)}
+.article-layout .callout-example{background:var(--edu-bg)}
+.article-layout .callout-warning{background:var(--com-bg)}
+.article-layout .article-style .callout p,.article-layout .article-style .callout ul,.article-layout .article-style .callout ol{margin:0 0 10px;max-width:none}
+/* On a full-width page a call-out keeps to the reading width of the text around it. */
+.article-layout-wide .article-style .callout{max-width:34em}
+.article-layout .article-style .callout>:last-child{margin-bottom:0}
+.article-layout .article-style .callout-title{font:500 21px/1.2 var(--display)}
+@media(min-width:1240px){
+  .article-layout.article-layout-callouts{grid-template-columns:minmax(0,600px) 260px;column-gap:40px}
+  .article-layout.article-layout-callouts:has(>.article-card){grid-template-columns:220px minmax(0,600px) 260px}
+  .article-layout-callouts .callout{float:right;float:inline-end;clear:right;clear:inline-end;width:260px;margin:4px -300px 18px 0;margin-inline:0 -300px}
+  .article-layout-callouts .doc-section-tinted .callout{margin-inline-end:-324px}
+}
+@media(max-width:1000px){.article-layout .article-card{order:1}}
+/* Sections that open: the spoiler and expand shortcodes. */
+.article-layout .article-style .spoiler{margin:0 0 12px;background:var(--surface);border-radius:var(--r-small)}
+.article-layout .article-style .spoiler>summary{padding:10px 14px;font-weight:600;font-size:18px;line-height:1.35;color:var(--link);cursor:pointer}
+.article-layout .article-style .spoiler>summary:hover{color:var(--ink)}
+.article-layout .article-style .spoiler-body{padding:2px 14px 12px;font-size:18px;line-height:1.55}
+.article-layout .article-style .spoiler-body>:last-child{margin-bottom:0}
+/* Disclosures hold prose, so they stay at reading width unless a PDF is open inside one. */
+.article-layout-wide .article-style .spoiler:not([open]),.article-layout-wide .article-style .spoiler:not(:has(.pdf-viewer)){max-width:580px}
+.article-layout .article-style [style*="justify"]{text-align:start!important}
+/* A lesson's activity takes more room than the text around it, without growing to the full page. */
+.article-layout-wide .article-style>div[style*="padding-bottom"]:has(>.click-to-load,>iframe),.article-layout-wide .article-style :is(.video-poster,.video-frame){max-width:960px}
+.article-layout-wide .article-style>div[style*="padding-bottom"]:has(>iframe){height:auto!important;padding-bottom:0!important;aspect-ratio:3/2}
+/* Tables and text panels fit what they hold, so a wide page does not leave them mostly empty. */
+.article-layout-wide .article-style table{width:fit-content}
+.article-layout-wide .article-style>div[style*="border"]:not([style*="padding-bottom"]){max-width:640px;margin-inline:0!important;padding:14px 18px!important}
+.article-layout-wide .article-style blockquote{max-width:640px}
+.article-layout-wide .article-style>hr{max-width:580px;margin-inline:0}
+/* Buttons in Markdown keep their own colours, against the rule for links in text. */
+/* Glossary pages: the reading layout, with the list of terms in the side card. */
+.glossary-layout .language-switcher{margin:10px 0 14px;font-size:16px}
+.glossary-layout .language-switcher a{color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.glossary-layout .term-definition{padding:0 0 14px;border-bottom:1px solid var(--line)}
+.glossary-layout .article-style .term-line{margin-bottom:8px;font-size:18px;line-height:1.5}
+.glossary-layout .references-list,.glossary-layout .references-list li{font-size:18px!important}
+.glossary-layout .article-style .btn-group{display:flex;flex-wrap:wrap;gap:6px;margin:0 0 18px}
+.glossary-layout .article-style .btn-group .btn{margin:0!important;padding:7px 14px!important;background:#fff;border-radius:999px!important;font-size:16px!important;color:var(--link)}
+.glossary-layout .article-style .btn-group .btn.active{background:var(--ink);border-color:var(--ink);color:#fff}
+.glossary-card{display:flex;flex-direction:column;overflow:hidden!important}
+.glossary-card .form-control{flex:none;margin-bottom:10px}
+.term-list{flex:1;min-height:0;overflow-y:auto;margin-inline:-6px;padding-inline:6px;font-size:16px;line-height:1.3}
+.term-list ul{margin:0;padding:0;list-style:none}
+.term-list a{display:block;padding:5px 0;color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.term-list a:hover{color:var(--ink)}
+.term-list a[aria-current]{color:var(--ink);font-weight:700;text-decoration:none}
+@media(max-width:1000px){.term-list{max-height:340px}}
+.resource-open{display:flex;flex-wrap:wrap;align-items:center;gap:6px 14px;margin:0 0 24px}
+.resource-open .btn{padding:10px 22px;font-size:17px}
+.resource-open .btn .fa-external-link-alt{margin-inline-start:4px;font-size:14px}
+.resource-host{font-size:16px;color:var(--soft);overflow-wrap:anywhere}
+/* A resource entry: the entry, then its details card, then Previous and Next. On a desktop the card
+   sits in the left column beside both; the second row takes any extra height of a long card. */
+.article-layout .resource-kind{margin:0 0 12px;max-width:60ch;font-size:16px;font-weight:600;color:var(--soft)}
+.article-layout .byline-more{display:inline}
+.article-layout .byline-more>summary{display:inline-block;margin-inline-start:.3em;color:var(--link);font-weight:600;text-decoration:underline;text-underline-offset:3px;cursor:pointer}
+.article-layout .byline-more>summary:hover{color:var(--ink)}
+.article-layout .byline-more>p{margin:6px 0 0}
+.article-layout.article-layout-resource .resource-keywords{margin-top:24px}
+.article-layout-resource .article-card dd a{color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.article-layout-resource>.article-foot{margin-top:0}
+@media(min-width:1001px){
+  .article-layout-resource:not(.article-layout-wide){grid-template-rows:auto 1fr;row-gap:32px}
+  .article-layout-resource:not(.article-layout-wide)>.article-card{grid-row:1/span 2}
+  .article-layout-resource>.article-foot{grid-column:2;grid-row:2}
+}
+@media(max-width:1000px){
+  .article-layout-resource .article-card{order:0}
+  .article-layout-resource .article-card .resource-type{display:none}
+  .article-layout-resource .article-card .resource-type+dd+dt{margin-top:0}
+  .article-layout .byline-more>summary{min-height:44px;display:inline-flex;align-items:center}
+}
+.article-layout .article-tags{margin:0 0 18px}
+.article-layout .resource-keywords{max-width:32em;margin:0 0 18px;font-size:16px;line-height:1.6;color:var(--soft)}
+.article-layout .resource-keywords strong{margin-inline-end:6px;color:var(--ink)}
+.article-layout .resource-keywords a{color:var(--link);text-decoration:underline;text-underline-offset:3px}
+/* Author profiles: the person's details in the side card. */
+.profile-card .profile-photo{display:block;width:135px;height:135px;margin:0 0 12px;object-fit:cover;border-radius:50%}
+.profile-card .avatar-square{border-radius:var(--r-small)}
+.profile-card p{margin:0 0 6px}
+.profile-card .profile-role{font-weight:700}
+.profile-card a{color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.profile-card ul.network-icon a{text-decoration:none}
+.sc-page{padding:32px 0 40px}
+.sc-page h1{font-size:clamp(36px,4.2vw,58px);line-height:1.06;margin:0 0 18px}
+.sc-page .crumbs{margin-bottom:18px}
+.sc-page #sc-container{padding:0;font-family:var(--text);max-width:none}
+/* A team's name heads its own row, so it cannot end one row with its people starting the next. */
+.sc-page .sc-grid .sc-title-card{flex:0 0 100%;grid-column:1/-1;width:100%;aspect-ratio:auto;padding:10px 16px;flex-direction:row;align-items:baseline;justify-content:flex-start;gap:10px}
+.sc-page .sc-title-card :is(.sc-title-label,.sc-title-text){margin:0}
+.sc-page .sc-title-card .sc-title-text{font-size:17px}
+.sc-page .sc-title-card .sc-cbar{display:none}
+.sc-team{display:contents}
+@media(min-width:761px){
+  .sc-page .sc-grid{gap:28px 40px}
+  .sc-page .sc-team{display:flex;flex-wrap:wrap;align-content:flex-start;gap:1rem;width:calc(var(--sc-members)*190px + (var(--sc-members) - 1)*1rem);max-width:100%}
+  .sc-page .sc-grid .sc-card{width:190px}
+  .sc-page .sc-grid .sc-title-card{flex-wrap:wrap}
+}
+.article-layout .post-nav{display:flex;flex-wrap:wrap;justify-content:space-between;gap:12px 24px;margin:0 0 18px}
+.article-layout .post-nav-item{max-width:calc(50% - 12px);min-width:0}
+.article-layout .post-nav-item:only-child{max-width:none}
+.article-layout .post-nav-item:last-child:not(:first-child){text-align:end}
+.article-logo{float:inline-end;width:96px;height:96px;margin:0 0 12px 18px;border-radius:var(--r-small)}
+@media print{
+  .site-head,.site-foot,.article-foot,.skip,.cc-window,.article-toc,.article-card h2{display:none!important}
+  body{background:#fff;color:#000;font-size:12pt}
+  .wrap{width:100%}
+  .article-layout{display:block;padding:0}
+  .article-layout .article-card{position:static;max-height:none;background:none;padding:0}
+  .article-layout .article-style,.article-layout .article-style :is(p,li){font-size:12pt}
+  a{color:#000}
+}
+/* A video before it plays, the player after, and a section of a long summaries page. */
+.video-poster{position:relative;display:block;margin:0 0 18px;aspect-ratio:16/9;overflow:hidden;background:var(--surface);border-radius:var(--r-small)}
+.article-layout .article-style .video-poster img{display:block;width:100%;height:100%;object-fit:cover}
+.video-play{position:absolute;inset:50% auto auto 50%;display:flex;align-items:center;justify-content:center;width:64px;height:64px;margin:-32px 0 0 -32px;background:var(--ink);border-radius:50%;color:#fff;font-size:24px}
+.video-poster:hover .video-play,.video-poster:focus-visible .video-play{background:var(--hot);color:var(--ink)}
+.video-frame{display:block;width:100%;aspect-ratio:16/9;margin:0 0 18px;border:0;border-radius:var(--r-small)}
+.video-poster:has(+ .video-note){margin-bottom:6px}
+.video-note,.article-layout .article-style .video-note{margin:0 0 18px;color:var(--soft);font-size:16px;line-height:1.4}
+.video-note a{text-decoration:underline}
+.article-layout .article-style .summary-entry{margin:0;border-bottom:1px solid var(--line)}
+.article-layout .article-style .summary-entry>summary{padding:12px 0;cursor:pointer}
+.article-layout .article-style .summary-entry>summary h2{display:inline;margin:0;font-size:22px;line-height:1.25}
+.article-layout .article-foot .article-widget li{margin-bottom:8px}
+.doi-link,.cite-us-text a{text-decoration:underline;text-underline-offset:3px}
+.toc-phone{display:none}
+@media(max-width:1000px){
+  .toc-phone{display:block;margin:0 0 20px;padding:12px 16px;background:var(--surface);border-radius:var(--r-small)}
+  .toc-phone-label{margin:0 0 4px;font:700 15px/1.3 var(--text);letter-spacing:.05em;text-transform:uppercase;color:var(--soft)}
+  .toc-phone.is-short .toc-extra{display:none}
+  .toc-phone-more{margin:6px 0 0;padding:4px 0;border:0;background:none;font:600 16px/1.35 var(--text);color:var(--ink);text-decoration:underline;text-underline-offset:3px;cursor:pointer}
+  .toc-phone a{display:block;padding:5px 0;font-size:16px;line-height:1.35;color:var(--link);text-decoration:underline}
+  .article-layout:has(.toc-phone) .article-card :is(h2,.article-toc){display:none}
+  .article-layout:has(.toc-phone) .article-card:not(:has(dl)){display:none}
+  .glossary-index .reading{display:contents}
+  .glossary-index .article-head{order:-2;margin-bottom:0}
+  .glossary-index .term-list{max-height:220px}
+  .glossary-index .glossary-card{order:1}
+  .glossary-index .article-foot{order:2}
+}
+.summary-tools{margin:0 0 14px;padding:14px 18px;background:var(--surface);border-radius:var(--r-large)}
+.summary-tools label{display:block;margin:0;font-size:16px;font-weight:700}
+.summary-tools input{display:block;width:100%;margin-top:6px;padding:8px 14px;background:#fff;border:1.5px solid var(--soft);border-radius:999px;font:400 16px/1.3 var(--text)}
+.article-layout .article-style .summary-count{margin:8px 0 0;font-size:16px}
+.summary-more{margin-top:14px}
+.summary-more[hidden]{display:none}
+/* The list of entries is its own contents, so a second list beside it only repeats the titles. */
+.article-layout:has(.summary-entry) .article-card :is(h2,.article-toc){display:none}
+.dei-mark{padding:0 6px;background:var(--jus-bg);border-radius:var(--r-small);font:600 15px/1.3 var(--text);color:var(--ink);vertical-align:.1em}
+@media print{.toc-phone{display:none!important}}
+.glossary-feedback-header>*{min-width:0;overflow-wrap:anywhere}
+.glossary-feedback-header>:lang(de),.glossary-feedback-header>:lang(tr){hyphens:auto}
+
+/* Catalogues (Syllabus): groups of links flow in columns across a wide page. */
+.article-style .catalogue{columns:3 300px;column-gap:48px;margin-top:28px}
+.article-style .catalogue-group{break-inside:avoid-column;margin-bottom:28px}
+.article-style .catalogue-group h3{margin:0 0 10px;font-size:23px;line-height:1.2}
+.article-style .catalogue-group ul{margin:0;padding-inline-start:1.1em}
+.article-style .catalogue-group li{margin-bottom:8px;font-size:17px;line-height:1.4}
+/* A long group may run on into the next column rather than leave a gap. */
+.article-style .catalogue-group:has(li:nth-child(15)){break-inside:auto}
+.article-style .catalogue-group:has(li:nth-child(15)) h3{break-after:avoid-column}
+
+/* Lesson bank: one card per lesson, with its plan and texts. */
+.article-layout .article-style .lesson-grid{display:grid;grid-template-columns:repeat(auto-fill,minmax(min(100%,300px),1fr));gap:18px;margin:20px 0 40px;padding:0;list-style:none}
+.article-style .lesson-grid>.lesson-card{max-width:none;margin:0;padding:18px 20px;background:var(--surface);border-radius:var(--r-large)}
+.article-style .lesson-card .lesson-num{margin:0 0 4px;font-size:15px;font-weight:700;color:var(--soft)}
+.article-style .lesson-card h3{margin:0 0 10px;font-size:22px;line-height:1.2}
+.article-style .lesson-card .lesson-materials{margin:0;padding:0;list-style:none}
+.article-style .lesson-card .lesson-materials li{margin:0 0 4px;font-size:16px}
+.article-style .lesson-card .lesson-note{margin:0;font-size:16px;color:var(--soft)}
+
+/* A tool page's direct actions, under its title (doors/page_actions). */
+.article-layout .page-actions{display:flex;flex-wrap:wrap;gap:10px;margin:0 0 28px}
+.article-layout .page-actions .btn{padding:10px 22px;font-size:17px}
+/* On phones a tall cover image pushed the page's contents a screen down, so it is held to part of the screen. */
+@media(max-width:760px){.article-layout .article-image img{width:auto;max-width:100%;max-height:280px;margin-inline:auto}}
+/* Old pages put a rule under each heading (### Title, then ---) and at the very end. The heading already
+   separates the section, and the rule pushed it away from its text, so neither rule is drawn. */
+.article-style :is(h2,h3,h4)+hr,.article-style>hr:last-child{display:none}
+.article-layout .post-nav-next{margin-inline-start:auto;text-align:end}
+.post-nav .meta-nav>span{display:inline-block}
+[dir=rtl] .post-nav .meta-nav>span{transform:scaleX(-1)}
+/* Author profiles on a narrow screen: portrait, role and links under the name, in place of the side card. */
+.profile-head{display:none}
+@media(max-width:1000px){
+  .article-layout .profile-card{display:none}
+  .profile-head{display:flex;align-items:center;gap:14px;margin-top:14px}
+  .profile-head .profile-photo{width:72px;height:72px;border-radius:50%;object-fit:cover;flex:none}
+  .profile-head .avatar-square{border-radius:var(--r-small)}
+  .profile-head p{margin:0 0 4px;font-weight:700}
+}
+/* One primary button: old pages give theirs inline sizes, corners and full widths; all take the "Open this resource" pill. */
+.article-layout .article-style .btn-primary,.article-layout .article-style .btn-lg{padding:10px 22px!important;border-radius:999px!important;font-size:17px!important;line-height:1.3!important}
+.article-layout .article-style .btn-block{display:inline-block;width:auto}
+.booklet-open .btn{margin-inline-end:10px}
+@media(max-width:1000px){.profile-head .profile-org{font-weight:400}.profile-head ul.network-icon{margin:4px 0 0}.profile-head ul.network-icon a{text-decoration:none}}
+.article-layout .article-style .btn.btn-primary,.article-layout .article-style .btn.btn-lg{padding:10px 22px!important;font-size:17px!important}
+.byline-date{display:none}
+@media(max-width:1000px){.article-layout .byline-date{display:inline}}
+/* A search over a long list on the page (shortcodes/list_filter.html). */
+.article-layout .article-style .list-filter{max-width:520px;margin:8px 0 22px;padding:16px 18px;background:var(--surface);border-radius:var(--r-large)}
+.article-layout .article-style .list-filter label{display:block;margin:0 0 8px;font:600 17px/1.3 var(--text)}
+.article-layout .article-style .list-filter input{width:100%;box-sizing:border-box;padding:10px 16px;border:1.5px solid var(--ink);border-radius:999px;background:#fff;font:400 17px/1.3 var(--text);color:var(--ink)}
+.article-layout .article-style .list-filter-count{margin:8px 0 0;font-size:16px;color:var(--soft)}
+.article-layout .article-style [hidden]{display:none!important}
+/* A licence note is a quiet line with its badge, as the site's other notes, not a bordered, centred box. */
+.article-layout .article-style .license-note{margin:28px 0 0!important;padding:14px 18px!important;border:0!important;border-radius:var(--r-large)!important;background:var(--surface)!important;text-align:start!important}
+.article-layout .article-style .license-note .license-content{display:flex;flex-wrap:wrap;align-items:center;justify-content:space-between;gap:10px 18px}
+.article-layout .article-style .license-note p{margin:0!important;font-size:16px!important;text-align:start!important}
+/* AWoP: the supplemental materials read as a list: each title with its OSF link beside it, then what it is. */
+.article-layout .article-style .awop-material{display:grid;grid-template-columns:minmax(0,1fr) auto;column-gap:16px;margin:0;padding:14px 0 4px;border-bottom:1px solid var(--line)}
+.article-layout .article-style p+.awop-material{border-top:1px solid var(--line);margin-top:12px}
+.article-layout .article-style .awop-material>*{grid-column:1/-1}
+.article-layout .article-style .awop-material>p:first-child{grid-column:1;grid-row:1}
+.article-layout .article-style .awop-material>p:nth-child(3){grid-column:2;grid-row:1;white-space:nowrap}
+.article-layout .article-style .awop-material p{margin:0 0 8px}
+.article-layout .article-style .awop-material .spoiler{margin:0 0 10px;background:none}
+.article-layout .article-style .awop-material .spoiler>summary{padding:4px 0;font-size:16px}
+
+/* Starting points at the top of a page (shortcodes/action_cards.html). */
+/* Starting points (the action_cards shortcode and the Replication Hub's Start here): solid bricks with studs,
+   laid edge to edge like a short wall, in the area colours (below). The bricks are for a handful of actions; long lists are rows (hub.css). */
+/* A row runs through the four area colours, starting with its own area's (`area` on the shortcode), so a
+   page's bricks are related but not identical. */
+.action-cards{--c1:var(--res);--c2:var(--edu);--c3:var(--jus);--c4:var(--com)}
+.action-cards.area-edu{--c1:var(--edu);--c2:var(--res);--c3:var(--jus);--c4:var(--com)}
+.action-cards.area-jus{--c1:var(--jus);--c2:var(--res);--c3:var(--edu);--c4:var(--com)}
+.action-cards.area-com{--c1:var(--com);--c2:var(--res);--c3:var(--edu);--c4:var(--jus)}
+.action-cards li:nth-child(4n+1){--tone:var(--c1)}.action-cards li:nth-child(4n+2){--tone:var(--c2)}
+.action-cards li:nth-child(4n+3){--tone:var(--c3)}.action-cards li:nth-child(4n+4){--tone:var(--c4)}
+:is(.article-layout .article-style,.hub-start) .action-cards{display:grid;grid-template-columns:repeat(auto-fit,minmax(min(100%,190px),1fr));gap:16px 5px;list-style:none;margin:26px 0 32px;padding:0;max-width:none}
+:is(.article-layout .article-style,.hub-start) .action-cards li{position:relative;margin:0;--brick:var(--tone)}
+/* The studs: short blocks along the top edge, on a pseudo-element so the text sits on a plain fill. */
+:is(.article-layout .article-style,.hub-start) .action-cards li::before{content:"";position:absolute;left:14px;right:14px;top:-8px;height:8px;background:linear-gradient(90deg,transparent 6px,var(--brick) 6px 28px,transparent 28px) left top/34px 8px space no-repeat;border-radius:3px 3px 0 0;pointer-events:none}
+:is(.article-layout .article-style,.hub-start) .action-cards a{display:flex;flex-direction:column;gap:4px;height:100%;box-sizing:border-box;min-height:96px;padding:16px 18px 22px;background:var(--brick);border-radius:3px;box-shadow:inset 0 -6px 0 rgb(0 0 0/.24);color:#fff;text-decoration:none;-webkit-print-color-adjust:exact;print-color-adjust:exact}
+:is(.article-layout .article-style,.hub-start) .action-cards strong{font:500 24px/1.15 var(--display);color:#fff}
+:is(.article-layout .article-style,.hub-start) .action-cards span{font:400 17px/1.4 var(--text);color:#fff}
+:is(.article-layout .article-style,.hub-start) .action-cards a:hover strong{text-decoration:underline;text-decoration-thickness:1.5px;text-underline-offset:4px}
+:is(.article-layout .article-style,.hub-start) .action-cards a:focus-visible{outline:3px solid var(--ink);outline-offset:3px}
+@media(prefers-reduced-motion:no-preference){
+  :is(.article-layout .article-style,.hub-start) .action-cards li{transition:transform .15s}
+  :is(.article-layout .article-style,.hub-start) .action-cards li:hover{transform:translateY(-3px)}
+}
+/* A disclosure inside a list item (the effects on /reversals/) is a small toggle under the entry, not a full-width bar. */
+.article-layout .article-style li .spoiler{margin:4px 0 12px;background:none;border-radius:0}
+.article-layout .article-style li .spoiler>summary{display:inline-flex;padding:4px 0;font-size:15px;color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.article-layout .article-style li .spoiler[open]{padding:4px 14px 2px;background:var(--surface);border-radius:var(--r-small)}
+.article-layout .article-style li .spoiler[open]>summary{text-decoration:none}
+.article-layout .article-style li .spoiler{margin-top:0}
+.article-layout .article-style li .spoiler>summary::before{content:"▸";display:inline-block;margin-inline-end:6px;text-decoration:none;transition:transform .15s}
+.article-layout .article-style li .spoiler[open]>summary::before{transform:rotate(90deg)}
+.article-layout .article-style .btn.btn-outline-primary{padding:10px 22px!important;border-radius:999px!important;font-size:17px!important;line-height:1.3!important}
+/* Replication status beside an effect (site.js): tinted by outcome, dark text throughout. */
+.status-chip{display:inline-block;margin:0 2px 0 0;padding:1px 9px;border-radius:999px;font:600 15px/1.4 var(--text);color:var(--ink);background:var(--surface);vertical-align:1px}
+.status-replicated{background:var(--edu-bg)}
+.status-not-replicated{background:var(--com-bg)}
+.status-reversed{background:var(--jus-bg)}
+.status-mixed{background:var(--res-bg)}
+/* A list with a search over it (the effects on /reversals/) reads as rows: no bullets, a rule between entries. */
+.article-layout .article-style .list-filter~ul{list-style:none;padding-inline-start:0}
+.article-layout .article-style .list-filter~ul>li{margin:0;padding:12px 0 6px;border-bottom:1px solid var(--line)}
+.article-layout .article-style .list-filter~ul>li>p{margin:0 0 4px}
+.article-layout .article-style .list-filter-jump{display:flex;align-items:center;gap:8px;margin:10px 0 0;font:600 16px/1.3 var(--text)}
+.article-layout .article-style .list-filter-jump select{flex:1;padding:8px 10px;border:1.5px solid var(--line);border-radius:var(--r-small);background:#fff;font:400 16px/1.3 var(--text);color:var(--ink)}
+.article-layout .article-style .list-filter-status{display:flex;flex-wrap:wrap;gap:6px;margin:10px 0 0}
+.article-layout .article-style .list-filter-status button{border:1.5px solid transparent;cursor:pointer;padding:3px 10px}
+.article-layout .article-style .list-filter-status button[aria-pressed=true]{border-color:var(--ink)}
+.status-no-status{background:var(--surface);color:var(--soft)}
+
+/* A page's opening with its picture in view (partials/doors/page_hero.html: the AWoP and citation wheels, a banner): on a
+   desktop the title, lede and actions sit beside a large image and span the side card and text below;
+   on a phone the image follows the actions at a size that keeps them on the first screen. */
+.article-layout .page-hero{display:grid;grid-template-columns:minmax(0,1fr) minmax(0,400px);column-gap:48px;align-items:center}
+/* A full-width page (AI in Metascience) gives a landscape banner the width of the cards below it. */
+.article-layout-wide .page-hero{grid-template-columns:minmax(0,1fr) minmax(0,520px);column-gap:56px}
+.article-layout .page-hero h1{font-size:clamp(34px,3.2vw,44px);line-height:1.1;letter-spacing:-.01em;margin:0;text-wrap:balance}
+.article-layout .page-hero .page-actions{margin-bottom:0}
+.article-layout .page-hero-media{margin:0;text-align:center}
+.article-layout .page-hero-media img{display:block;width:100%;height:auto}
+.article-layout .page-hero-media a{display:block;border-radius:var(--r-small);overflow:hidden}
+.article-layout .page-hero-media p{margin:6px 0 0;font-size:15px}
+.article-layout .page-hero-media p a{display:inline;color:var(--link);text-decoration:underline;text-underline-offset:3px}
+@media(min-width:1001px){
+  .article-layout:has(>.page-hero){row-gap:40px}
+  .article-layout:not(.article-layout-wide)>.page-hero{grid-column:1/-1;grid-row:1}
+  .article-layout:not(.article-layout-wide):has(>.page-hero)>:is(.article-card,.reading){grid-row:2}
+}
+@media(max-width:1000px){
+  .article-layout:has(>.page-hero){row-gap:24px}
+  .article-layout .page-hero{grid-template-columns:minmax(0,1fr);row-gap:24px}
+  .article-layout .page-hero-media{width:min(100%,340px)}
+  .article-layout .page-hero-landscape .page-hero-media{width:100%}
+}
+@media(max-width:600px){
+  .article-layout .page-hero{row-gap:18px}
+  .article-layout .page-hero:not(.page-hero-landscape) .page-hero-media{width:min(100%,280px)}
+}
+
+/* /reversals/ (site.js): the search, outcome and Go to controls are one toolbar that stays at the top of the screen
+   while the effects scroll, up to the end of the list; on a phone only the search row and count stay. Rows reached
+   by Tab or Go to stop below it (the scroll padding is its measured height). The entries are rows, not prose, so
+   they keep the reading width of a paragraph, with the Statistics toggle inside it. */
+html:has(.list-filter-section){scroll-padding-top:calc(var(--list-filter-bar,0px) + 16px)}
+.article-layout .article-style .list-filter-section{max-width:27em}
+.article-layout .article-style .list-filter-section>ul{max-width:none}
+.article-layout .article-style .list-filter-section>.list-filter{position:sticky;top:0;z-index:6;display:flex;flex-wrap:wrap;align-items:center;gap:8px 12px;max-width:none;margin:8px 0 18px;padding:10px 14px;box-shadow:0 2px 0 var(--page)}
+/* The bar itself is square and page-coloured, with its rounded panel drawn behind the controls, so text scrolling
+   under the stuck bar does not show at its corners. */
+@media(min-width:761px){
+  .article-layout .article-style .list-filter-section>.list-filter{background:var(--page);border-radius:0}
+  .article-layout .article-style .list-filter-section>.list-filter::before{content:"";position:absolute;inset:0;z-index:-1;border-radius:var(--r-large);background:var(--surface)}
+}
+.article-layout .article-style .list-filter-section .list-filter-search{flex:1 1 300px;display:grid;grid-template-columns:auto minmax(0,1fr);align-items:center;column-gap:12px}
+.article-layout .article-style .list-filter-section .list-filter label{grid-row:1;margin:0;font-size:16px;line-height:1.2}
+.article-layout .article-style .list-filter-section .list-filter-count{grid-row:2;margin:0;font-size:15px;line-height:1.2;white-space:nowrap}
+.article-layout .article-style .list-filter-section .list-filter input{grid-column:2;grid-row:1/3;padding:7px 14px;font-size:16px}
+.article-layout .article-style .list-filter-section .list-filter-jump{margin:0;font-size:16px}
+.article-layout .article-style .list-filter-section .list-filter-jump select{flex:none;max-width:170px;padding:6px 8px;font-size:15px}
+.article-layout .article-style .list-filter-section .list-filter-status{flex:1 1 100%;gap:4px;margin:0}
+/* Beside the "On this page" card, which lists every section, the toolbar needs no Go to menu. */
+@media(min-width:1001px){.article-layout:has(>.article-card) .article-style .list-filter-section .list-filter-jump{display:none}}
+.article-layout .article-style .list-filter-section .list-filter-status button{padding:0 6px;font-size:15px}
+@media(max-width:760px){
+  .article-layout .article-style .list-filter-section>.list-filter{display:contents}
+  .article-layout .article-style .list-filter-section .list-filter-search{position:sticky;top:0;z-index:6;grid-template-columns:1fr auto;align-items:baseline;gap:4px 10px;margin:8px -20px 10px;padding:8px 20px;background:var(--surface);box-shadow:0 1px 0 var(--line)}
+  .article-layout .article-style .list-filter-section .list-filter label,.article-layout .article-style .list-filter-section .list-filter-count{grid-row:1}
+  .article-layout .article-style .list-filter-section .list-filter input{grid-column:1/-1;grid-row:2;padding:7px 14px}
+  .article-layout .article-style .list-filter-section .list-filter label.list-filter-jump{margin:4px 0 14px}
+  .article-layout .article-style .list-filter-section .list-filter-jump select{flex:1;max-width:none}
+  /* Below the sticky row there is room, so the outcome buttons get their usual size and spacing back. */
+  .article-layout .article-style .list-filter-section .list-filter-status{gap:8px;margin:0 0 24px}
+  .article-layout .article-style .list-filter-section .list-filter-status button{padding:3px 10px}
+}
+/* Each effect shows its first lines (three on a phone), with the Statistics toggle on the name's line and a
+   "more" button where the text runs longer; while a search is typed the matching effects show in full. */
+.article-layout .article-style .list-filter-section>ul>li{position:relative;--entry-lines:2}
+.article-layout .article-style .list-filter-section .entry-text{max-width:none;max-height:calc(var(--entry-lines) * 1.6em);max-height:calc(var(--entry-lines) * 1lh);overflow:hidden}
+.article-layout .article-style .list-filter-section .entry-text::before{content:"";float:inline-end;width:96px;height:1px}
+.article-layout .article-style .list-filter-section :is(.is-open,.is-searching li)>.entry-text{max-height:none}
+.article-layout .article-style .list-filter-section li:has(>.entry-text)>.spoiler>summary{position:absolute;top:14px;inset-inline-end:0}
+.article-layout .article-style .list-filter-section .entry-more{display:none}
+.article-layout .article-style .list-filter-section .is-long>.entry-more{display:block;position:absolute;top:calc(12px + (var(--entry-lines) - 1) * 1lh);inset-inline-end:0;padding:0;padding-inline-start:2.4em;border:0;background:linear-gradient(to right,transparent,var(--page) 2em);font:inherit;font-weight:600;color:var(--link);text-decoration:underline;text-underline-offset:3px;cursor:pointer}
+/* In right-to-left text the fade runs the other way. */
+.article-layout .article-style .list-filter-section .is-long>.entry-more:dir(rtl){background:linear-gradient(to left,transparent,var(--page) 2em)}
+.article-layout .article-style .list-filter-section .is-open>.entry-more{position:static;display:inline-block;margin:0 0 6px;padding:0;background:none;font-size:16px}
+.article-layout .article-style .list-filter-section.is-searching .entry-more{display:none}
+@media(max-width:760px){.article-layout .article-style .list-filter-section>ul>li{--entry-lines:3}}
diff --git a/assets/css/doors/base.css b/assets/css/doors/base.css
new file mode 100644
index 00000000000..fef2c5d3055
--- /dev/null
+++ b/assets/css/doors/base.css
@@ -0,0 +1,40 @@
+/* Site-wide type and colour. */
+body{margin-top:0;background:var(--page);color:var(--ink);font:400 var(--text-size)/1.6 var(--text);overflow-wrap:break-word}
+h1,h2,h3,h4,h5,h6,.h1,.h2,.h3,.h4,.h5,.h6{font-family:var(--display);font-weight:var(--display-weight);color:var(--ink)}
+/* When the window is narrow for its text size (below about 300px at normal text, or 600px with text at 200%, whether the whole page or only text is zoomed), long words in headings no longer fit; hyphenate them rather than break at any letter (#983). */
+@media (max-width:19em){h1,h2,h3,h4,h5,h6,.h1,.h2,.h3,.h4,.h5,.h6{hyphens:auto}}
+a{color:var(--link)}
+a:hover{color:var(--ink)}
+a:focus-visible,button:focus-visible,input:focus-visible,summary:focus-visible,select:focus-visible,table:focus-visible{outline:3px solid var(--ink);outline-offset:3px;border-radius:2px}
+main:focus{outline:none}
+/* The cookie banner sits over the foot of the screen until dismissed; site.js sets its height. */
+html{scroll-padding-block-end:var(--banner,0px)}
+/* The site's content in system fonts where the Doors faces have no glyphs (decision D18). */
+main:lang(ar),main:lang(zh){font-family:var(--text)}
+main:lang(ar){--display:'Newsreader','Noto Naskh Arabic','Geeza Pro','Traditional Arabic','Times New Roman',serif;--text:'Noto Sans Arabic','Segoe UI','Geeza Pro',Tahoma,sans-serif}
+main:lang(zh){--display:'Newsreader','Noto Serif CJK SC','Songti SC','STSong',SimSun,serif;--text:'Source Sans 3','Noto Sans CJK SC','PingFang SC','Microsoft YaHei','Hiragino Sans GB',sans-serif}
+
+/* Upright everywhere, with emphasis as semi-bold. Real italics only inside reference lists
+   (decision D15). Font Awesome's <i> icons set their own weight, so they are left alone. */
+*,*::before,*::after,.font-italic{font-style:normal!important}
+em,i:not([class]),dfn,cite,var{font-weight:600}
+.references-list :is(em,i),.references-page .article-style :is(em,i),
+:is(h2,h3,h4)[id^=references i]~:is(ul,ol,p) :is(em,i),.csl-bib-body :is(em,i),
+.ref-apa :is(em,i),.rl-detail-apa :is(em,i){font-style:italic!important;font-weight:400}
+/* Publication titles from those lists keep their journal names and species in italics, at the title's weight. */
+:is(.fr-title,.fc-title,.ref-popup-title,.rl-panel-item-title) i{font-style:italic!important;font-weight:inherit}
+
+.wrap{width:min(1280px,calc(100% - 96px));margin-inline:auto}
+.visually-hidden{position:absolute;width:1px;height:1px;overflow:hidden;clip-path:inset(50%);white-space:nowrap}
+/* Small capitals in publication titles from Crossref (<scp>), see clusters/rich_text.html */
+.scp{font-variant:small-caps}
+.skip{position:fixed;top:-100px;inset-inline-start:12px;z-index:1100;background:var(--ink);color:#fff;padding:12px 16px}
+.skip:focus,.skip:hover{top:8px;color:#fff}
+.crumbs{font-size:15px;line-height:1.4;color:var(--ink)}
+.crumbs a{color:inherit;text-decoration:underline;text-underline-offset:3px}
+.more{font-weight:700;color:var(--link);text-decoration:underline;text-decoration-thickness:2px;text-underline-offset:4px}
+.more:hover{color:var(--ink)}
+
+@media(max-width:1240px){.wrap{width:calc(100% - 64px)}}
+@media(max-width:760px){:root{--text-size:16px}.wrap{width:calc(100% - 40px)}}
+@media(prefers-reduced-motion:reduce){html{scroll-behavior:auto}*,*::before,*::after{transition:none!important;animation:none!important}}
diff --git a/assets/css/doors/chatbot.css b/assets/css/doors/chatbot.css
new file mode 100644
index 00000000000..0fa1c262aaf
--- /dev/null
+++ b/assets/css/doors/chatbot.css
@@ -0,0 +1,716 @@
+/* The JUST-OS chat window and full-page chat, loaded on demand: the first click on the launcher, or
+   the chatbot page. */
+/* The chat window — default: docked right panel */
+#just-os-window {
+  display: none;
+  position: fixed;
+  top: 0;
+  right: 0;
+  bottom: 0;
+  left: auto;
+  width: 33vw;
+  min-width: 320px;
+  background: white;
+  border-left: 2px solid var(--ink);
+  box-shadow: -4px 0 20px rgba(0, 0, 0, 0.15);
+  overflow: hidden;
+  flex-direction: column;
+  z-index: 10000;
+}
+
+/* Floating mode — centered, resizable */
+#just-os-window.floating {
+  top: 5vh;
+  right: auto;
+  bottom: auto;
+  left: 50%;
+  transform: translateX(-50%);
+  width: 60vw;
+  height: 80vh;
+  min-height: 300px;
+  border: 2px solid var(--ink);
+  border-radius: 12px;
+  box-shadow: 0 8px 30px rgba(0, 0, 0, 0.25);
+}
+
+/* Custom resize handle (bottom-left corner, floating only) */
+.just-os-resize-handle {
+  display: none;
+  position: absolute;
+  bottom: 0;
+  left: 0;
+  width: 18px;
+  height: 18px;
+  cursor: nesw-resize;
+  z-index: 10;
+}
+
+#just-os-window.floating .just-os-resize-handle {
+  display: block;
+}
+
+.just-os-resize-handle::after {
+  content: '';
+  position: absolute;
+  bottom: 3px;
+  left: 3px;
+  width: 10px;
+  height: 10px;
+  border-left: 2px solid #bbb;
+  border-bottom: 2px solid #bbb;
+}
+
+.just-os-resize-handle:hover::after {
+  border-color: var(--soft);
+}
+
+.chat-header {
+  background: var(--surface);
+  padding: 10px 15px;
+  display: flex;
+  justify-content: space-between;
+  align-items: center;
+  border-bottom: 1px solid #eee;
+  gap: 8px;
+}
+
+.chat-header span {
+  font-weight: bold;
+  color: var(--link);
+}
+
+.close-btn {
+  background: none;
+  border: none;
+  font-size: 1.5rem;
+  line-height: 1;
+  cursor: pointer;
+  color: var(--soft);
+}
+
+.close-btn:hover {
+  color: #000;
+}
+
+/* ---- Chat UI styles ---- */
+.just-os-messages {
+  flex: 1;
+  overflow-y: auto;
+  padding: 12px;
+  display: flex;
+  flex-direction: column;
+  gap: 10px;
+  min-height: 0;
+}
+
+.just-os-msg {
+  max-width: 85%;
+  position: relative;
+}
+
+.just-os-msg.user {
+  align-self: flex-end;
+}
+
+.just-os-msg.bot {
+  align-self: flex-start;
+}
+
+.just-os-bubble-content {
+  padding: 8px 12px;
+  border-radius: 12px;
+  line-height: 1.45;
+  font-size: 0.9rem;
+  word-wrap: break-word;
+  overflow-wrap: break-word;
+}
+
+.just-os-msg.user .just-os-bubble-content {
+  background: var(--link);
+  color: white;
+  border-bottom-right-radius: 4px;
+}
+
+.just-os-msg.bot .just-os-bubble-content {
+  background: var(--surface);
+  color: var(--ink);
+  border-bottom-left-radius: 4px;
+}
+
+.just-os-msg.bot .just-os-bubble-content p {
+  margin: 0 0 8px;
+}
+
+.just-os-msg.bot .just-os-bubble-content p:last-child {
+  margin-bottom: 0;
+}
+
+.just-os-msg.bot .just-os-bubble-content a {
+  color: var(--link);
+  text-decoration: underline;
+}
+
+/* Inline citation links open the supporting retrieved chunk */
+.just-os-msg.bot .just-os-bubble-content a.reference-link {
+  color: var(--link);
+  text-decoration: none;
+  cursor: pointer;
+  font-size: 0.85em;
+  font-weight: 600;
+}
+
+.just-os-msg.bot .just-os-bubble-content a.reference-link:hover {
+  text-decoration: underline;
+}
+
+.just-os-reference-tooltip {
+  position: fixed;
+  width: min(500px, calc(100vw - 24px));
+  max-height: min(420px, calc(100vh - 24px));
+  overflow-y: auto;
+  padding: 14px;
+  background: white;
+  border: 1px solid #d9dde3;
+  border-radius: 8px;
+  box-shadow: 0 4px 18px rgba(0, 0, 0, 0.18);
+  color: var(--ink);
+  font-size: 0.85rem;
+  line-height: 1.45;
+  z-index: 10001;
+}
+
+.just-os-reference-tooltip .title {
+  font-weight: 700;
+  margin-bottom: 4px;
+}
+
+.just-os-reference-tooltip .metadata {
+  color: var(--soft);
+  font-size: 0.8rem;
+  margin-bottom: 10px;
+}
+
+.just-os-reference-tooltip .content {
+  padding: 10px;
+  background: var(--surface);
+  border-radius: 6px;
+}
+
+/* Rendered markdown inside the supporting chunk — keep it compact so a
+   chunk heading doesn't dwarf the tooltip. */
+.just-os-reference-tooltip .content > :first-child {
+  margin-top: 0;
+}
+
+.just-os-reference-tooltip .content > :last-child {
+  margin-bottom: 0;
+}
+
+.just-os-reference-tooltip .content p {
+  margin: 0 0 8px;
+}
+
+.just-os-reference-tooltip .content h1,
+.just-os-reference-tooltip .content h2,
+.just-os-reference-tooltip .content h3,
+.just-os-reference-tooltip .content h4,
+.just-os-reference-tooltip .content h5,
+.just-os-reference-tooltip .content h6 {
+  margin: 10px 0 6px;
+  font-size: 0.95rem;
+  font-weight: 700;
+  line-height: 1.3;
+}
+
+.just-os-reference-tooltip .content ul,
+.just-os-reference-tooltip .content ol {
+  margin: 0 0 8px;
+  padding-left: 20px;
+}
+
+.just-os-reference-tooltip .content li {
+  margin-bottom: 2px;
+}
+
+.just-os-reference-tooltip .content a {
+  color: var(--link);
+  text-decoration: underline;
+}
+
+.just-os-reference-tooltip .content code {
+  background: #eceff3;
+  border-radius: 3px;
+  padding: 1px 4px;
+  font-size: 0.85em;
+}
+
+.just-os-reference-tooltip .source-link {
+  display: inline-block;
+  margin-top: 10px;
+  color: var(--link);
+  font-weight: 600;
+}
+
+.just-os-copy-btn {
+  display: block;
+  margin-top: 4px;
+  margin-left: auto;
+  background: none;
+  border: none;
+  cursor: pointer;
+  font-size: 0.85rem;
+  padding: 2px 4px;
+  color: #aaa;
+  border-radius: 4px;
+  opacity: 0;
+  transition: opacity 0.2s;
+  line-height: 1;
+}
+
+.just-os-msg.bot:hover .just-os-copy-btn,
+.just-os-msg.bot:focus-within .just-os-copy-btn {
+  opacity: 1;
+}
+
+.just-os-copy-btn:hover {
+  color: var(--soft);
+}
+
+.just-os-copy-btn svg {
+  width: 15px;
+  height: 15px;
+  display: block;
+}
+
+/* Feedback — always-visible row beneath bot message */
+.rating-bar {
+  display: flex;
+  align-items: center;
+  gap: 6px;
+  margin-top: 8px;
+}
+
+.rating-bar .rating-btn {
+  background: none;
+  border: 1px solid var(--link);
+  color: var(--link);
+  cursor: pointer;
+  font-size: 15px;
+  padding: 2px 8px;
+  line-height: 1.4;
+  border-radius: 12px;
+  font-weight: 500;
+  transition: background 0.15s, color 0.15s;
+}
+
+.rating-bar .rating-btn:hover {
+  background: var(--link);
+  color: #fff;
+}
+
+/* Info (i) — subtle disclosure of what feedback is stored, with instant tooltip */
+.rating-bar .rating-info {
+  position: relative;
+  display: inline-flex;
+  align-items: center;
+  color: #bbb;
+  cursor: help;
+  margin-left: 3px;
+}
+
+.rating-bar .rating-info svg {
+  width: 14px;
+  height: 14px;
+  display: block;
+}
+
+.rating-bar .rating-info:hover,
+.rating-bar .rating-info:focus {
+  color: var(--link);
+  outline: none;
+}
+
+.rating-bar .rating-tip {
+  position: absolute;
+  bottom: calc(100% + 7px);
+  /* Centre the tip over the (i) icon, which sits near the panel centre, so the
+     full text stays inside the narrow docked chat panel (its overflow clips). */
+  left: 50%;
+  transform: translateX(-50%) translateY(3px);
+  width: max-content;
+  max-width: 230px;
+  background: var(--link);
+  color: #fff;
+  font-size: 0.7rem;
+  font-style: normal;
+  font-weight: 400;
+  line-height: 1.4;
+  text-align: left;
+  padding: 7px 9px;
+  border-radius: 6px;
+  box-shadow: 0 2px 10px rgba(0, 0, 0, 0.2);
+  opacity: 0;
+  visibility: hidden;
+  transition: opacity 0.1s ease, transform 0.1s ease;
+  pointer-events: none;
+  white-space: normal;
+  z-index: 10;
+}
+
+/* small arrow pointing down to the icon */
+.rating-bar .rating-tip::after {
+  content: "";
+  position: absolute;
+  top: 100%;
+  left: 50%;
+  transform: translateX(-50%);
+  border: 5px solid transparent;
+  border-top-color: var(--link);
+}
+
+.rating-bar .rating-info:hover .rating-tip,
+.rating-bar .rating-info:focus .rating-tip,
+.rating-bar .rating-info:focus-within .rating-tip {
+  opacity: 1;
+  visibility: visible;
+  transform: translateX(-50%) translateY(0);
+}
+
+.rating-thanks {
+  font-size: 0.75rem;
+  color: #4caf50;
+  font-style: italic;
+}
+
+/* Comment box — appears after "Bad" rating */
+.comment-box {
+  margin-top: 5px;
+}
+
+.comment-box-inner {
+  display: flex;
+  align-items: center;
+  gap: 6px;
+}
+
+.comment-box-inner input[type="text"] {
+  flex: 1;
+  min-width: 0;
+  border: none;
+  border-bottom: 1px solid #ddd;
+  padding: 2px 4px;
+  font-size: 0.75rem;
+  font-family: inherit;
+  background: transparent;
+  outline: none;
+  color: var(--ink);
+}
+
+.comment-box-inner input[type="text"]:focus {
+  border-bottom-color: var(--link);
+}
+
+.comment-submit {
+  background: none;
+  border: none;
+  color: var(--link);
+  font-size: 15px;
+  cursor: pointer;
+  padding: 0;
+  white-space: nowrap;
+  font-weight: 500;
+  opacity: 0.8;
+}
+
+.comment-submit:hover {
+  opacity: 1;
+  text-decoration: underline;
+}
+
+/* References list below bot message */
+.just-os-references {
+  margin-top: 8px;
+  padding: 8px 10px;
+  background: var(--surface);
+  border-radius: 8px;
+  border: 1px solid #e8eaed;
+  font-size: 0.8rem;
+  line-height: 1.4;
+}
+
+.just-os-references summary {
+  cursor: pointer;
+  font-weight: 600;
+  color: var(--soft);
+  font-size: 0.8rem;
+  user-select: none;
+}
+
+.just-os-references ol {
+  margin: 6px 0 0;
+  padding-left: 18px;
+}
+
+.just-os-references li {
+  margin-bottom: 4px;
+  color: var(--soft);
+}
+
+.just-os-references li a {
+  color: var(--link);
+  text-decoration: none;
+}
+
+.just-os-references li a:hover {
+  text-decoration: underline;
+}
+
+.just-os-typing {
+  display: none;
+  padding: 6px 12px;
+  color: var(--soft);
+  font-size: 0.85rem;
+  font-style: italic;
+}
+
+.just-os-error {
+  color: #c0392b;
+  font-style: italic;
+}
+
+.just-os-input-area {
+  display: flex;
+  align-items: flex-end;
+  gap: 8px;
+  padding: 10px 12px;
+  border-top: 1px solid #eee;
+  background: #fafafa;
+}
+
+.just-os-input {
+  flex: 1;
+  border: 1px solid #ccc;
+  border-radius: 8px;
+  padding: 8px 10px;
+  font-size: 0.9rem;
+  resize: none;
+  max-height: 120px;
+  font-family: inherit;
+  line-height: 1.4;
+}
+
+.just-os-input:focus {
+  outline: 3px solid var(--ink);
+  outline-offset: 1px;
+  border-color: var(--link);
+}
+
+.just-os-send-btn {
+  background: var(--link);
+  color: white;
+  border: none;
+  border-radius: 8px;
+  padding: 8px 14px;
+  cursor: pointer;
+  font-size: 0.9rem;
+  white-space: nowrap;
+  flex-shrink: 0;
+}
+
+.just-os-send-btn:hover {
+  background: var(--ink);
+}
+
+.just-os-send-btn:disabled {
+  opacity: 0.5;
+  cursor: not-allowed;
+}
+
+/* New Chat / History buttons */
+.just-os-new-chat-btn,
+.just-os-history-btn {
+  background: none;
+  border: none;
+  cursor: pointer;
+  font-size: 0.8rem;
+  color: var(--soft);
+  padding: 4px 8px;
+  border-radius: 4px;
+}
+
+.just-os-new-chat-btn:hover,
+.just-os-history-btn:hover {
+  background: #eee;
+  color: var(--ink);
+}
+
+/* History button pushed to the right in the widget header */
+.chat-header .just-os-history-btn {
+  margin-left: auto;
+}
+
+/* History panel — overlays the chat area */
+.just-os-history-panel {
+  position: absolute;
+  inset: 0;
+  background: #fff;
+  z-index: 20;
+  flex-direction: column;
+  overflow: hidden;
+}
+
+.just-os-history-header {
+  display: flex;
+  align-items: center;
+  gap: 10px;
+  padding: 10px 15px;
+  border-bottom: 1px solid #eee;
+  background: var(--surface);
+  flex-shrink: 0;
+}
+
+.just-os-history-header span {
+  font-weight: bold;
+  color: var(--link);
+}
+
+.just-os-history-back {
+  background: none;
+  border: none;
+  cursor: pointer;
+  font-size: 0.9rem;
+  color: var(--link);
+  padding: 4px 6px;
+  border-radius: 4px;
+}
+
+.just-os-history-back:hover {
+  background: #eee;
+}
+
+.just-os-history-list {
+  flex: 1;
+  overflow-y: auto;
+  padding: 8px;
+  min-height: 0;
+}
+
+.just-os-history-empty {
+  color: var(--soft);
+  font-size: 0.85rem;
+  text-align: center;
+  margin: 24px 0;
+}
+
+.just-os-history-item {
+  display: flex;
+  align-items: stretch;
+  border-radius: 8px;
+  margin-bottom: 4px;
+}
+
+.just-os-history-item:hover {
+  background: var(--surface);
+}
+
+.just-os-history-item.active {
+  background: var(--res-bg);
+}
+
+.just-os-history-open {
+  flex: 1;
+  display: flex;
+  flex-direction: column;
+  align-items: flex-start;
+  gap: 2px;
+  background: none;
+  border: none;
+  cursor: pointer;
+  text-align: left;
+  padding: 8px 10px;
+  min-width: 0;
+}
+
+.just-os-history-title {
+  font-size: 0.88rem;
+  color: var(--ink);
+  white-space: nowrap;
+  overflow: hidden;
+  text-overflow: ellipsis;
+  max-width: 100%;
+}
+
+.just-os-history-meta {
+  font-size: 15px;
+  color: var(--soft);
+}
+
+.just-os-history-delete {
+  background: none;
+  border: none;
+  cursor: pointer;
+  color: #bbb;
+  font-size: 0.9rem;
+  padding: 0 10px;
+  border-radius: 8px;
+  flex-shrink: 0;
+}
+
+.just-os-history-delete:hover {
+  color: #c0392b;
+}
+
+/* Standalone page offline notice */
+.just-os-offline-page {
+  width: 100%;
+  max-width: 1200px;
+  margin: 0 auto;
+  padding: 48px 32px;
+  border: 1px solid #f1d6d2;
+  border-radius: 12px;
+  background: #fdf5f4;
+  box-shadow: 0 4px 12px rgba(0, 0, 0, 0.05);
+  display: flex;
+  flex-direction: column;
+  align-items: center;
+  text-align: center;
+  color: #4a1f1a;
+}
+
+.just-os-offline-page__icon {
+  width: 64px;
+  height: 64px;
+  color: #c0392b;
+  margin-bottom: 16px;
+}
+
+.just-os-offline-page__title {
+  font-size: 1.4rem;
+  font-weight: 700;
+  margin: 0 0 8px;
+  color: #c0392b;
+}
+
+.just-os-offline-page__body {
+  font-size: 1rem;
+  line-height: 1.5;
+  max-width: 640px;
+  margin: 0;
+}
+
+/* Responsive */
+@media (max-width: 768px) {
+  #just-os-window {
+    width: 100vw;
+  }
+
+  #just-os-window.floating {
+    width: 95vw;
+    height: 80vh;
+    top: 5vh;
+  }
+}
+/* Send is the site's primary pill. */
+.just-os-send-btn,#just-os-fullpage .just-os-send-btn{background:var(--link);border-radius:999px;padding:9px 18px;font:600 16px/1.3 var(--text)}
+.just-os-send-btn:hover,#just-os-fullpage .just-os-send-btn:hover{background:var(--ink)}
+.just-os-input{font-size:16px}
diff --git a/assets/css/doors/citations.css b/assets/css/doors/citations.css
new file mode 100644
index 00000000000..1ef82adb73a
--- /dev/null
+++ b/assets/css/doors/citations.css
@@ -0,0 +1,5 @@
+a.cite{color:inherit;text-decoration:underline dotted 1px var(--soft);text-underline-offset:3px}
+a.cite:hover,a.cite:focus{color:var(--link)}
+/* The button that shows a reference's full author list (layouts/partials/citations/authors.html). */
+.ref-authors-toggle{display:inline;margin:0 .15em;padding:0 .55em;background:#fff;border:1px solid var(--line);border-radius:999px;color:var(--link);font:600 15px/1.45 var(--text);white-space:nowrap;cursor:pointer;vertical-align:baseline}
+.ref-authors-toggle:hover{border-color:var(--link);text-decoration:underline}
diff --git a/assets/css/doors/clusters.css b/assets/css/doors/clusters.css
new file mode 100644
index 00000000000..c778c11b676
--- /dev/null
+++ b/assets/css/doors/clusters.css
@@ -0,0 +1,2408 @@
+/* Clusters and disciplines. Carried over from the theme-era stylesheet with Doors colours and type;
+   a bespoke redraw is left for after launch (migration plan, Phase 3 "Cut to fit"). */
+.clusters-head{padding:32px 0 8px}
+.clusters-head .crumbs{margin-bottom:18px}
+.clusters-head h1{font-size:clamp(36px,4.2vw,58px);line-height:1.06;letter-spacing:-.01em;margin:0}
+.clusters-head .standfirst{font:500 clamp(19px,1.6vw,22px)/1.35 var(--display);margin:12px 0 0;max-width:34em}
+.clusters-layout .row{margin-inline:0}
+.clusters-layout .row>*{padding-inline:0}
+@media(min-width:992px){.clusters-layout .row{flex-wrap:nowrap;gap:24px}.clusters-sidebar.col-lg-4,.clusters-sidebar.col-xl-3{flex:0 0 280px;width:280px}.clusters-content.col-lg-8,.clusters-content.col-xl-9{flex:1;width:auto;min-width:0}}
+@media(max-width:760px){.clusters-head{padding:20px 0 8px}}
+/* Clusters v4 page styles                            */
+/* -------------------------------------------------- */
+
+/* The site header doesn't travel with the page, so nothing sits above pinned parts. */
+.clusters-layout {
+  margin-top: 0.5rem;
+  --clusters-sticky-offset: 0px;
+  --clusters-sticky-gap: 0px;
+  --clusters-controls-height: 0px;
+}
+
+.clusters-controls {
+  position: sticky;
+  top: calc(var(--clusters-sticky-offset) + env(safe-area-inset-top, 0px) + var(--clusters-sticky-gap));
+  z-index: 1020;
+  display: grid;
+  gap: 0.45rem;
+  background: #fefdf6;
+  padding: 0.5rem;
+  border: 1px solid var(--surface);
+  border-radius: 8px;
+  box-shadow: 0 4px 10px rgba(0, 0, 0, 0.05);
+}
+
+/* ---- Mobile nav toggle ---- */
+.clusters-mobile-toggle {
+  width: 100%;
+  margin-top: 0;
+  text-align: left;
+  font-size: 0.9rem;
+  padding: 0.5rem 1rem;
+  border-radius: 6px;
+}
+
+.clusters-mobile-toggle.active {
+  background: var(--ink);
+  color: #fff;
+  border-color: var(--ink);
+}
+
+/* ---- Sidebar ---- */
+.clusters-sidebar {
+  display: none;
+}
+
+@media (min-width: 992px) {
+  .clusters-sidebar {
+    display: block;
+  }
+}
+
+.clusters-sidebar.sidebar-open {
+  display: block;
+}
+
+.clusters-sidebar-inner {
+  position: sticky;
+  top: calc(
+    var(--clusters-sticky-offset) +
+    env(safe-area-inset-top, 0px) +
+    var(--clusters-sticky-gap) +
+    var(--clusters-controls-height) +
+    8px
+  );
+  max-height: calc(
+    100vh - var(--clusters-sticky-offset) - var(--clusters-sticky-gap) -
+    var(--clusters-controls-height) - 24px - var(--banner, 0px)
+  );
+  overflow-y: auto;
+  padding: 0 0.75rem 0.75rem;
+  background: var(--surface);
+  border: 1px solid var(--surface);
+  border-radius: 8px;
+  font-size: 0.82rem;
+}
+
+.sidebar-header {
+  position: sticky;
+  top: 0;
+  z-index: 2;
+  background: var(--surface);
+  padding: 0;
+  border-bottom: 1px solid var(--surface);
+  font-size: 0.75rem;
+  font-weight: 700;
+  text-transform: uppercase;
+  letter-spacing: 0.5px;
+  color: var(--soft);
+  margin: 0;
+}
+
+/* No air between section label and cluster list (hub + subpages) */
+.clusters-sidebar-inner #cluster-nav {
+  margin: 0;
+  padding: 0;
+}
+
+/* First cluster row: remove top padding (main source of “gap” below header border) */
+.clusters-sidebar-inner #cluster-nav > .cluster-nav-group:first-child > .cluster-nav-heading {
+  padding-top: 0;
+}
+
+
+.cluster-nav-heading {
+  display: flex;
+  align-items: center;
+  gap: 0.3rem;
+  padding: 0.35rem 0.25rem;
+  font-weight: 600;
+  color: var(--ink);
+  text-decoration: none !important;
+  font-size: 0.82rem;
+  cursor: pointer;
+  border-radius: 4px;
+  line-height: 1.3;
+}
+
+.cluster-nav-heading:hover {
+  background: rgba(0,0,0,0.04);
+  color: #111;
+}
+
+/* Active cluster on subpages — no special styling, looks same as hub */
+
+.cluster-nav-toggle {
+  display: inline-block;
+  width: 1em;
+  flex-shrink: 0;
+  font-size: 0.9em;
+  transition: transform 0.15s;
+}
+
+.cluster-nav-subs {
+  list-style: none;
+  padding-left: 1.6rem;
+  margin: 0 0 0.25rem 0;
+}
+
+.cluster-nav-subs .nav-link {
+  padding: 0.2rem 0.35rem;
+  font-size: 0.78rem;
+  color: var(--soft);
+  display: flex;
+  justify-content: space-between;
+  align-items: baseline;
+  gap: 0.5rem;
+  line-height: 1.3;
+  border-radius: 3px;
+}
+
+.cluster-nav-subs .nav-link:hover {
+  background: rgba(0,0,0,0.04);
+  color: #111;
+  text-decoration: none;
+}
+
+.cluster-nav-subs .badge {
+  font-size: 15px;
+  font-weight: 400;
+  color: var(--soft);
+  background: transparent;
+  flex-shrink: 0;
+}
+
+/* ---- Cluster sections ---- */
+.cluster-section {
+  padding: 1.5rem 1.25rem;
+  margin-bottom: 0.75rem;
+  border-radius: 8px;
+  border: 1px solid rgba(0,0,0,0.06);
+}
+
+.cluster-header {
+  margin-bottom: 0.5rem;
+}
+
+.cluster-title {
+  font-size: 0.95rem;
+  font-weight: 600;
+  margin-bottom: 0.1rem;
+  display: flex;
+  align-items: center;
+  gap: 0.35rem;
+  line-height: 1.3;
+}
+
+.cluster-number {
+  display: inline-flex;
+  align-items: center;
+  justify-content: center;
+  width: 1.45em;
+  height: 1.45em;
+  border-radius: 50%;
+  background: rgba(0,0,0,0.1);
+  font-size: 0.75em;
+  flex-shrink: 0;
+}
+
+.cluster-stats {
+  font-size: 0.7rem;
+  color: var(--soft);
+}
+
+.cluster-description {
+  font-size: 0.8rem;
+  line-height: 1.5;
+  color: var(--soft);
+  margin-bottom: 0.75rem;
+}
+
+/* ---- Inline clusters list search (toolbar; not Algolia/site search) ---- */
+.clusters-inline-search {
+  position: relative;
+}
+
+.clusters-inline-search__row {
+  display: flex;
+  flex-wrap: wrap;
+  align-items: stretch;
+  gap: 0.4rem;
+  position: relative;
+  z-index: 2;
+  background: #fefdf6;
+  padding-bottom: 0.45rem;
+}
+
+.clusters-inline-search__input {
+  flex: 1 1 auto;
+  min-width: 0;
+  max-width: 22rem;
+  font-size: 0.88rem;
+  padding: 0.45rem 0.65rem;
+  border-radius: 6px;
+}
+
+.clusters-inline-search__submit {
+  flex: 0 0 auto;
+  display: inline-flex;
+  align-items: center;
+  justify-content: center;
+  min-width: 2.35rem;
+  padding: 0.35rem 0.55rem;
+  border-radius: 6px;
+}
+
+.clusters-inline-search__option-label {
+  display: inline-flex;
+  align-items: center;
+  gap: 0.35rem;
+  font-size: 0.78rem;
+  color: var(--soft);
+  cursor: pointer;
+  user-select: none;
+  margin: 0 0 0 0.5rem;
+  white-space: nowrap;
+}
+
+.clusters-inline-search__option-label input[type="checkbox"] {
+  margin: 0;
+  cursor: pointer;
+}
+
+.clusters-inline-search__hit-icon {
+  flex-shrink: 0;
+  color: var(--soft);
+  font-size: 0.7rem;
+  align-self: flex-start;
+  margin-top: 0.2rem;
+}
+
+.clusters-inline-search__toolbar {
+  display: flex;
+  align-items: center;
+  justify-content: space-between;
+  gap: 0.5rem;
+  padding: 0.35rem 0.5rem 0.35rem 0.75rem;
+}
+
+.clusters-inline-search__close {
+  flex-shrink: 0;
+  line-height: 1;
+  padding: 0.25rem 0.45rem !important;
+}
+
+/* Like browser Ctrl+F: flat highlight, no ring/border */
+.clusters-inline-search-highlight {
+  outline: none !important;
+  box-shadow: none !important;
+  background-color: rgba(255, 220, 0, 0.55) !important;
+  border-radius: 2px;
+  transition: background-color 0.35s ease;
+}
+
+/* Panel below input row: toolbar fixed, only hit list scrolls (no overlap with search box) */
+.clusters-inline-search__panel {
+  display: none;
+  flex-direction: column;
+  width: 100%;
+  max-height: 360px;
+  margin-top: 0.75rem;
+  background: #fff;
+  border: 1px solid var(--line);
+  border-radius: 6px;
+  box-shadow: 0 6px 20px rgba(0, 0, 0, 0.08);
+  overflow: hidden;
+  position: relative;
+  z-index: 1;
+}
+
+.clusters-inline-search__panel.clusters-inline-search__panel--open {
+  display: flex;
+}
+
+.clusters-inline-search__toolbar-host {
+  flex-shrink: 0;
+  border-bottom: 1px solid var(--line);
+  background: #fafafa;
+}
+
+.clusters-inline-search__results-body {
+  flex: 1 1 auto;
+  min-height: 0;
+  overflow-x: hidden;
+  overflow-y: auto;
+  -webkit-overflow-scrolling: touch;
+}
+
+.clusters-inline-search__count {
+  font-size: 15px;
+  color: var(--soft);
+  font-weight: 600;
+  margin: 0;
+}
+
+.clusters-inline-search__hit {
+  display: flex;
+  flex-direction: row;
+  align-items: flex-start;
+  gap: 0.4rem;
+  padding: 0.5rem 0.75rem;
+  border-bottom: 1px solid #f0f0f0;
+  color: var(--ink);
+  text-decoration: none;
+  font-size: 0.8rem;
+  text-align: left;
+}
+
+.clusters-inline-search__hit-text {
+  display: flex;
+  flex-direction: column;
+  gap: 0.15rem;
+  min-width: 0;
+}
+
+.clusters-inline-search__hit-label {
+  line-height: 1.35;
+}
+
+.clusters-inline-search__hit--publication .clusters-inline-search__hit-label {
+  font-size: 15px;
+}
+
+.clusters-inline-search__hit-meta {
+  font-size: 15px;
+  color: var(--soft);
+  line-height: 1.25;
+}
+
+.clusters-inline-search__hit:hover {
+  background: #f5f7fa;
+  text-decoration: none;
+  color: #111;
+}
+
+.clusters-inline-search__empty,
+.clusters-inline-search__more {
+  padding: 0.5rem 0.75rem;
+  font-size: 0.78rem;
+  color: var(--soft);
+}
+
+.clusters-cluster-lead {
+  max-width: 48rem;
+}
+
+/* ---- Accordion sub-cluster sections ---- */
+.acc-list {
+  margin-top: 0.25rem;
+}
+.acc-section + .acc-section {
+  border-top: 1px solid rgba(0,0,0,0.06);
+}
+.acc-header {
+  display: flex;
+  align-items: center;
+  gap: 0.35rem;
+  padding: 0.4rem 0.15rem;
+  cursor: pointer;
+  font-size: 0.76rem;
+  font-weight: 600;
+  color: var(--soft);
+  transition: color 0.15s;
+  user-select: none;
+}
+.acc-header:hover { color: var(--ink); }
+.acc-trigger { padding: 0; border: 0; background: none; color: inherit; font: inherit; text-align: start; cursor: pointer; }
+.acc-header--rec { color: #004055; }
+.acc-header--rec:hover { color: #00556e; }
+.acc-header.acc-disabled {
+  color: #bbb;
+  cursor: default;
+}
+.acc-header.acc-disabled:hover { color: #bbb; }
+.acc-chevron {
+  font-size: 0.55rem;
+  color: #bbb;
+  transition: transform 0.25s ease;
+  flex-shrink: 0;
+  display: inline-block;
+}
+.acc-chevron.acc-open { transform: rotate(90deg); color: var(--soft); }
+.acc-disabled .acc-chevron { color: var(--line); }
+.acc-label {
+  flex: 1;
+  min-width: 0;
+  line-height: 1.3;
+  /* Rendered as an <h3> for document semantics/SEO; strip heading defaults so it
+     reads as the compact accordion label (inherits .acc-header sizing/colour). */
+  margin: 0;
+  padding: 0;
+  font-size: inherit;
+  font-weight: inherit;
+  color: inherit;
+  font-family: inherit;
+}
+.acc-leads {
+  flex: 0 1 auto;
+  max-width: 42%;
+  padding: 0.12rem 0.4rem;
+  border-left: 2px solid rgba(0,0,0,0.12);
+  color: rgba(0,0,0,0.52);
+  font-size: 15px;
+  font-weight: 400;
+  line-height: 1.3;
+}
+.acc-leads__label {
+  color: rgba(0,0,0,0.66);
+  font-weight: 600;
+}
+.acc-leads p {
+  display: inline;
+  margin: 0;
+}
+.acc-count {
+  margin-left: auto;
+  font-size: 0.55rem;
+  font-weight: 400;
+  color: #bbb;
+  flex-shrink: 0;
+  white-space: nowrap;
+}
+.acc-copy-link {
+  position: relative;
+  flex-shrink: 0;
+  display: inline-flex;
+  align-items: center;
+  justify-content: center;
+  width: 1.4rem;
+  height: 1.4rem;
+  padding: 0;
+  margin-left: 0.15rem;
+  border: none;
+  background: none;
+  color: #bbb;
+  cursor: pointer;
+  border-radius: 3px;
+  opacity: 0.4;
+  transition: opacity 0.15s, color 0.15s, background 0.15s;
+}
+.acc-copy-link svg { width: 0.8rem; height: 0.8rem; }
+.acc-header:hover .acc-copy-link,
+.acc-header:focus-within .acc-copy-link { opacity: 1; }
+.acc-copy-link:hover { color: var(--soft); background: rgba(0,0,0,0.05); }
+.acc-copy-link:focus-visible { opacity: 1; outline: 2px solid rgba(0,0,0,0.25); outline-offset: 1px; }
+.acc-copy-link.is-copied { color: #2e7d32; opacity: 1; }
+.acc-copy-link.is-copied::after {
+  content: "Copied!";
+  position: absolute;
+  bottom: calc(100% + 4px);
+  right: 0;
+  background: #2e7d32;
+  color: #fff;
+  font-size: 0.55rem;
+  font-weight: 600;
+  line-height: 1;
+  padding: 0.25rem 0.4rem;
+  border-radius: 3px;
+  white-space: nowrap;
+  pointer-events: none;
+  z-index: 5;
+}
+.acc-body {
+  padding: 0 0.15rem 0.45rem 1rem;
+  overflow: hidden;
+  transition: max-height 0.3s ease, opacity 0.25s ease;
+}
+.acc-body.acc-collapsed {
+  max-height: 0 !important;
+  opacity: 0;
+  padding-top: 0;
+  padding-bottom: 0;
+}
+.acc-toggle-all {
+  font-family: inherit;
+  font-size: 0.58rem;
+  font-weight: 600;
+  color: var(--soft);
+  background: none;
+  border: 1px solid rgba(0,0,0,0.1);
+  border-radius: 3px;
+  padding: 0.15rem 0.45rem;
+  cursor: pointer;
+  transition: color 0.15s, border-color 0.15s;
+  float: right;
+  margin-top: 0.15rem;
+}
+.acc-toggle-all:hover { color: var(--soft); border-color: rgba(0,0,0,0.2); }
+
+/* ---- Sub-cluster heading & description (inside accordion body) ---- */
+.sc-heading {
+  font-size: 0.9rem;
+  font-weight: 600;
+  margin: 0.5rem 0 0.35rem;
+  line-height: 1.3;
+}
+
+.sc-description {
+  font-size: 0.75rem;
+  color: var(--soft);
+  margin-bottom: 0.45rem;
+  line-height: 1.45;
+}
+
+.sc-description p {
+  margin-bottom: 0.45rem;
+}
+
+.sc-description p:last-child {
+  margin-bottom: 0;
+}
+
+.sc-description__lede {
+  font-style: normal;
+  color: var(--ink);
+  margin-bottom: 0.25rem;
+}
+
+.sc-description a {
+  color: #1c7ed6;
+  word-break: break-word;
+}
+
+.sc-description a:hover {
+  color: #1264ab;
+}
+
+/* ---- Publication list ---- */
+.publication-list {
+  padding-left: 1.5rem;
+  margin: 0;
+}
+
+.publication-item {
+  padding: 0.35rem 0;
+  font-size: 0.82rem;
+  line-height: 1.5;
+  margin-bottom: 0.3rem;
+}
+
+.publication-item a {
+  color: #1c7ed6;
+  word-break: break-all;
+}
+
+.publication-item a:hover {
+  color: #1264ab;
+}
+
+/* ---- Responsive ---- */
+@media (max-width: 1199px) {
+  .clusters-controls {
+    padding: 0.4rem;
+  }
+
+  .clusters-inline-search__panel {
+    max-height: 320px;
+  }
+
+  .cluster-section {
+    padding: 1rem 0.75rem;
+  }
+
+}
+
+@media (max-width: 991px) {
+  /* Flush under sticky controls (no mb-3 gap) + drawer meets toggle bar */
+  .clusters-layout .clusters-controls {
+    margin-bottom: 0 !important;
+  }
+
+  /* In-flow sidebar hidden until open; when open use fixed drawer so it stays visible after page scroll */
+  .clusters-sidebar-inner {
+    position: static;
+    max-height: 50vh;
+    margin-bottom: 1rem;
+  }
+
+  .sidebar-header {
+    position: static;
+    border-bottom: 0;
+    padding: 0;
+  }
+
+  .clusters-sidebar.sidebar-open {
+    display: block;
+    position: fixed;
+    left: 0;
+    right: 0;
+    width: 100%;
+    max-width: 100vw;
+    margin: 0;
+    padding: 0 0.75rem calc(0.75rem + env(safe-area-inset-bottom, 0px));
+    box-sizing: border-box;
+    top: calc(
+      var(--clusters-sticky-offset) +
+      env(safe-area-inset-top, 0px) +
+      var(--clusters-sticky-gap) +
+      var(--clusters-controls-height)
+    );
+    bottom: 0;
+    /* Above .clusters-controls (z-index: 1020) so the open drawer fully covers
+       the sticky search bar instead of it showing through on top. */
+    z-index: 1030;
+    overflow-y: auto;
+    overflow-x: hidden;
+    -webkit-overflow-scrolling: touch;
+    overscroll-behavior: contain;
+    background: #fefdf6;
+    border-top: 1px solid var(--surface);
+    box-shadow: 0 -4px 24px rgba(0, 0, 0, 0.12);
+    border-radius: 0;
+  }
+
+  /* The JUST-OS chat widget (z-index: 9999, layouts/partials/chatbot.html) would
+     otherwise float on top of the open drawer regardless of the z-index above. */
+  body.clusters-mobile-nav-open #just-os-widget {
+    display: none;
+  }
+
+  .clusters-sidebar.sidebar-open .clusters-sidebar-inner {
+    position: static;
+    max-height: none;
+    margin-bottom: 0;
+    margin-top: 0;
+    overflow: visible;
+    padding-top: 0;
+    border-radius: 0;
+    border: none;
+    border-bottom: 1px solid var(--surface);
+  }
+
+  .clusters-sidebar.sidebar-open .sidebar-header {
+    position: sticky;
+    top: 0;
+    z-index: 1;
+    background: var(--surface);
+    padding: 0;
+    border-bottom: 1px solid var(--surface);
+    margin: 0;
+  }
+
+}
+
+@media (max-width: 768px) {
+  .clusters-controls {
+    border-radius: 6px;
+    box-shadow: 0 2px 8px rgba(0, 0, 0, 0.05);
+  }
+
+  .clusters-inline-search__input {
+    font-size: 0.86rem;
+    padding: 0.46rem 0.62rem;
+  }
+
+  .clusters-inline-search__panel {
+    max-height: 280px;
+  }
+
+  .cluster-section {
+    padding: 0.9rem 0.65rem;
+    border-radius: 7px;
+  }
+
+  .cluster-title {
+    align-items: flex-start;
+    gap: 0.35rem;
+  }
+
+  .cluster-number {
+    margin-top: 0.1rem;
+  }
+
+  .cluster-stats {
+    display: block;
+    margin-top: 0.2rem;
+  }
+
+  .publication-list {
+    padding-left: 1rem;
+  }
+
+  .publication-item {
+    margin-bottom: 0.2rem;
+  }
+}
+
+@media (max-width: 576px) {
+  .clusters-controls {
+    padding: 0.35rem;
+    margin-bottom: 0.6rem !important;
+    gap: 0.35rem;
+  }
+
+  .cluster-title {
+    font-size: 0.86rem;
+    line-height: 1.35;
+  }
+
+  .cluster-description {
+    font-size: 0.78rem;
+  }
+
+  .publication-item {
+    font-size: 0.75rem;
+    line-height: 1.45;
+  }
+
+}
+
+@media (max-width: 420px) {
+  .clusters-layout {
+    margin-top: 0.25rem;
+  }
+
+  .clusters-controls {
+    padding: 0.3rem;
+    border-radius: 5px;
+  }
+
+  .clusters-inline-search__input {
+    font-size: 0.82rem;
+    padding: 0.42rem 0.55rem;
+    max-width: 100%;
+  }
+
+  .clusters-inline-search__panel {
+    max-height: 240px;
+  }
+
+  .clusters-mobile-toggle {
+    font-size: 0.82rem;
+    padding: 0.45rem 0.8rem;
+  }
+
+  .cluster-section {
+    padding: 0.8rem 0.55rem;
+    margin-bottom: 0.6rem;
+  }
+
+  .cluster-title {
+    font-size: 0.8rem;
+  }
+
+  .cluster-number {
+    width: 1.35em;
+    height: 1.35em;
+  }
+
+  .cluster-stats {
+    font-size: 15px;
+  }
+
+  .sc-heading {
+    font-size: 0.88rem;
+  }
+}
+
+@media (max-width: 390px) {
+  .clusters-mobile-toggle {
+    margin-top: 0.45rem;
+  }
+
+  .publication-item {
+    font-size: 15px;
+    line-height: 1.4;
+  }
+
+  .clusters-back-to-top {
+    width: 2.35rem;
+    height: 2.35rem;
+    font-size: 0.85rem;
+  }
+}
+/* -------------------------------------------------- */
+/* Clusters Intro Section Styles                      */
+/* -------------------------------------------------- */
+
+.clusters-intro {
+  margin-bottom: 0;
+}
+
+/* Hero: text left, image right */
+.intro-hero {
+  display: flex;
+  align-items: center;
+  gap: 2rem;
+}
+
+.intro-hero-text {
+  flex: 1 1 60%;
+}
+
+.intro-hero-image {
+  flex: 0 0 auto;
+  max-width: 360px;
+}
+
+.intro-paragraph {
+  font-size: 0.95rem;
+  color: var(--ink);
+  margin-bottom: 0;
+  line-height: 1.7;
+}
+
+/* Partner logo beside the disciplines intro (plain image, no lightbox) */
+.disciplines-partner {
+  text-align: center;
+  max-width: 220px;
+  /* Sit beside the opening paragraph rather than centred against the whole column. */
+  align-self: flex-start;
+  margin-top: 1rem;
+}
+
+.disciplines-partner img {
+  width: 160px;
+  height: auto;
+}
+
+.disciplines-partner__caption {
+  font-size: 0.8rem;
+  color: var(--soft);
+  margin-bottom: 0.4rem;
+  white-space: nowrap;
+}
+
+/* Lead-in label in front of each citation in the disciplines "How to cite" box */
+.disciplines-cite-lead {
+  display: block;
+  font-weight: 600;
+  font-size: 0.82rem;
+  margin-bottom: 0.2rem;
+}
+
+/* Keep citation guidance discoverable without letting a growing author list
+ * dominate the page. The native details element is collapsed by default. */
+.disciplines-attribution {
+  margin: 0 0 1.25rem;
+}
+
+.disciplines-citation-summary {
+  cursor: pointer;
+  color: #b3005a;
+  font-size: 1.05rem;
+  font-weight: 700;
+  text-align: center;
+  padding: 0.6rem;
+  list-style-position: inside;
+}
+
+.disciplines-citation-summary:hover,
+.disciplines-citation-summary:focus-visible {
+  color: #8e0048;
+  text-decoration: underline;
+}
+
+.disciplines-attribution[open] .disciplines-citation-summary {
+  margin-bottom: 0.35rem;
+}
+
+.clusters-display-section > .wrap > .disciplines-attribution {
+  max-width: 760px;
+  margin: 1.5rem auto 0;
+}
+
+/* Discipline / field leads, shown on the coloured field background */
+.disciplines-leads {
+  font-size: 0.9rem;
+  margin: 0 0 0.55rem;
+}
+
+.disciplines-leads p {
+  margin: 0;
+  display: inline;
+}
+
+.disciplines-leads__label {
+  font-weight: 600;
+}
+
+@media (max-width: 600px) {
+  .acc-header {
+    flex-wrap: wrap;
+  }
+
+  .acc-leads {
+    flex-basis: 100%;
+    max-width: none;
+    margin-left: 1rem;
+    padding-top: 0;
+    padding-bottom: 0.1rem;
+    border-left: 0;
+  }
+}
+
+/* Clusters map: a mind map drawn by partials/clusters/map.html */
+.clusters-map { margin: 1.75rem 0 0.5rem; }
+.clusters-map__frame { overflow: hidden; }
+.clusters-map__art { display: block; width: 100%; height: auto; font-family: var(--text); }
+/* geometricPrecision: Chromium on Linux otherwise rounds each glyph to whole pixels, which sets the
+   text about 6% wider than the advance widths the build wraps it with (clusters/map_wrap.html). */
+.clusters-map__art text { fill: #fff; text-anchor: middle; pointer-events: none; text-rendering: geometricPrecision; }
+.clusters-map__line { fill: none; stroke: var(--soft); stroke-width: 2; stroke-linecap: round; }
+.clusters-map__seg path:first-of-type, .clusters-map__label rect, .clusters-map__pill rect { fill: var(--c); }
+.clusters-map__icon { fill: #fff; }
+.clusters-map__label text { font-size: 20px; font-weight: 700; }
+.clusters-map__pill text { font-size: 17px; font-weight: 400; }
+.clusters-map__disc { fill: #fff; stroke: var(--res); stroke-width: 7; }
+.clusters-map__cluster { transition: opacity 0.15s; }
+.clusters-map__art.is-pointing .clusters-map__cluster:not(.is-active) { opacity: 0.35; }
+.clusters-map__art a:hover rect { fill: color-mix(in srgb, var(--c) 80%, #000); }
+.clusters-map__caption { display: flex; flex-wrap: wrap; align-items: baseline; gap: 0.5rem 1.5rem; margin-top: 0.75rem; }
+.clusters-map__enlarge, .clusters-map__close {
+  font: inherit; font-size: 0.9rem; font-weight: 600; color: var(--ink); background: var(--page);
+  border: 1px solid var(--line); border-radius: var(--r-small); padding: 0.35rem 0.9rem; cursor: pointer;
+}
+.clusters-map__enlarge:hover, .clusters-map__close:hover { border-color: var(--ink); }
+.clusters-map__list { flex: 1 1 20rem; }
+.clusters-map__list summary { cursor: pointer; color: var(--link); font-size: 0.95rem; }
+.clusters-map__list ol { margin: 0.75rem 0 0; padding-left: 1.4rem; columns: 2 22rem; column-gap: 2rem; font-size: 0.95rem; }
+.clusters-map__list li { break-inside: avoid; margin-bottom: 0.5rem; }
+.clusters-map__list ul { margin: 0.2rem 0 0; padding-left: 1.1rem; font-size: 0.9rem; }
+.clusters-map__list ul li { margin: 0; }
+.clusters-map__list a { color: var(--ink); }
+.clusters-map__dialog { width: 96vw; max-width: none; height: 94vh; max-height: none; padding: 0; border: 0; border-radius: var(--r-large); background: var(--page); }
+.clusters-map__dialog::backdrop { background: rgba(38, 45, 53, 0.6); }
+.clusters-map__close { position: absolute; top: 0.75rem; right: 0.75rem; z-index: 1; box-shadow: 0 1px 4px rgba(38, 45, 53, 0.25); }
+.clusters-map__scroll { height: 100%; overflow: auto; }
+.clusters-map__scroll .clusters-map__art { width: auto; max-width: none; height: auto; margin: 0 auto; }
+.clusters-map__compact { display: none; }
+.clusters-map__hub { display: block; width: min(240px, 70%); margin: 0 auto 1rem; }
+.clusters-map__segment { fill: var(--c); }
+.clusters-map__chips { list-style: none; margin: 0; padding: 0; display: grid; gap: 0.5rem; }
+.clusters-map__chips a {
+  display: flex; align-items: center; gap: 0.8rem; padding: 0.55rem 0.9rem; border-radius: 12px;
+  background: var(--c); color: #fff; font-weight: 700; line-height: 1.25; text-decoration: none;
+}
+.clusters-map__chips svg { flex: 0 0 1.4rem; height: 1.4rem; fill: currentColor; }
+.clusters-map__chips small { display: block; font-size: 0.85rem; font-weight: 400; }
+/* Phones: the hub and the cluster labels; the pills are in the list and the full-size view. */
+@media (max-width: 760px) {
+  .clusters-map__frame { display: none; }
+  .clusters-map__compact { display: block; }
+}
+@media (forced-colors: active) {
+  .clusters-map__art text, .clusters-map__icon { fill: CanvasText; }
+  .clusters-map__seg path:first-of-type, .clusters-map__segment, .clusters-map__label rect, .clusters-map__pill rect { fill: Canvas; stroke: CanvasText; }
+  .clusters-map__chips a { border: 1px solid CanvasText; }
+}
+
+/* Stack on small screens */
+@media (max-width: 768px) {
+  .intro-hero {
+    flex-direction: column;
+    gap: 1.25rem;
+  }
+
+  .intro-hero-image {
+    max-width: 260px;
+  }
+
+  .disciplines-partner {
+    align-self: center;
+    margin-top: 0;
+  }
+
+  .intro-paragraph {
+    font-size: 0.9rem;
+  }
+
+}
+
+
+/* -------------------------------------------------- */
+/* Clusters Page Section Styles                       */
+/* -------------------------------------------------- */
+
+/* Full-width cluster layout */
+.cluster-full-width {
+  max-width: 100% !important;
+  padding: 15px !important;
+  margin-left: 15px !important;
+  margin-right: 15px !important;
+  margin-top: 0 !important;
+  margin-bottom: 0 !important;
+}
+
+
+.clusters-intro-section {
+  background: linear-gradient(to bottom, #fefdf6 0%, #f9f8f5 100%);
+  padding: 0.5rem 0 0.5rem;
+  margin: 0.15rem 0 0;
+}
+
+.clusters-display-section {
+  background: white;
+  padding: 0.75rem 0 2rem;
+  margin: 0 0 1.5rem;
+  border-top: 1px solid var(--surface);
+  border-bottom: 1px solid var(--surface);
+}
+
+/* Hub + /clusters/cluster-N/ — smaller than default Academic article H1 */
+h1.clusters-site-heading {
+  font-size: 1.45rem;
+  font-weight: 700;
+  line-height: 1.28;
+  margin-bottom: 0.35rem;
+  letter-spacing: -0.015em;
+}
+
+/* /clusters/ section index only — larger hero title (see layouts/clusters/single.html) */
+h1.clusters-site-heading.clusters-hub-page__title {
+  font-size: 2.35rem;
+  line-height: 1.18;
+  margin-bottom: 0.5rem;
+  letter-spacing: -0.02em;
+}
+
+/* Per-cluster page: FORRT clusters / Cluster N: Name — one flow (wraps on narrow screens) */
+.clusters-heading-row__crumbs {
+  display: flex;
+  flex-wrap: wrap;
+  align-items: baseline;
+  gap: 0.35rem 0.5rem;
+  margin: 0;
+  padding: 0;
+  list-style: none;
+}
+
+.clusters-heading-row__parent {
+  font-size: 1.45rem;
+  font-weight: 700;
+  line-height: 1.28;
+  letter-spacing: -0.015em;
+  color: #8b0000;
+  text-decoration: none;
+  flex-shrink: 0;
+}
+
+.clusters-heading-row__parent:hover {
+  text-decoration: underline;
+  color: #5a0000;
+}
+
+.clusters-heading-row__sep {
+  font-size: 1.45rem;
+  font-weight: 400;
+  line-height: 1.28;
+  color: #adb5bd;
+  flex-shrink: 0;
+  user-select: none;
+}
+
+.clusters-heading-row__title.clusters-site-heading {
+  margin: 0;
+  padding: 0;
+  font-size: 1.45rem;
+  flex: 1 1 14rem;
+  min-width: 0;
+}
+
+@media (max-width: 768px) {
+  h1.clusters-site-heading {
+    font-size: 1.28rem;
+  }
+
+  h1.clusters-site-heading.clusters-hub-page__title {
+    font-size: 1.95rem;
+    line-height: 1.2;
+    /* Reserve space for the fixed JUST-OS chat widget (top-right, ~80px wide +
+       20px offset), which sits at top: 80px at this breakpoint and otherwise
+       overlaps long titles that wrap to two lines here. */
+    padding-right: 104px;
+  }
+
+  .clusters-heading-row__parent,
+  .clusters-heading-row__sep,
+  .clusters-heading-row__title.clusters-site-heading {
+    font-size: 1.28rem;
+    line-height: 1.3;
+  }
+}
+
+@media (max-width: 576px) {
+  h1.clusters-site-heading {
+    font-size: 1.12rem;
+    line-height: 1.32;
+  }
+
+  h1.clusters-site-heading.clusters-hub-page__title {
+    font-size: 1.65rem;
+    line-height: 1.22;
+  }
+
+  .clusters-heading-row__parent,
+  .clusters-heading-row__sep,
+  .clusters-heading-row__title.clusters-site-heading {
+    font-size: 1.12rem;
+    line-height: 1.32;
+  }
+}
+
+.clusters-back-to-top {
+  position: fixed;
+  right: 1.25rem;
+  bottom: 1.25rem;
+  z-index: 1050;
+  display: inline-flex;
+  align-items: center;
+  justify-content: center;
+  border: none;
+  border-radius: 999px;
+  background: #2f3f66;
+  color: #fff;
+  width: 2.75rem;
+  height: 2.75rem;
+  padding: 0;
+  font-size: 1rem;
+  line-height: 1;
+  box-shadow: 0 8px 18px rgba(47, 63, 102, 0.3);
+  cursor: pointer;
+  opacity: 0;
+  visibility: hidden;
+  transform: translateY(8px);
+  transition: opacity 0.2s ease, transform 0.2s ease, visibility 0.2s ease, background 0.2s ease;
+}
+
+.clusters-back-to-top i {
+  line-height: 1;
+}
+
+.clusters-back-to-top:hover {
+  background: #233456;
+}
+
+.clusters-back-to-top:focus {
+  outline: 2px solid #1c7ed6;
+  outline-offset: 2px;
+}
+
+.clusters-back-to-top.is-visible {
+  opacity: 1;
+  visibility: visible;
+  transform: translateY(0);
+}
+
+@media (max-width: 768px) {
+  .clusters-back-to-top {
+    right: calc(0.85rem + env(safe-area-inset-right, 0px));
+    bottom: calc(0.85rem + env(safe-area-inset-bottom, 0px));
+    width: 2.5rem;
+    height: 2.5rem;
+    font-size: 0.92rem;
+  }
+}
+
+/* -------------------------------------------------- */
+/* Disciplines page styles                            */
+/* -------------------------------------------------- */
+.disciplines-category-badge {
+  font-size: 0.7rem;
+  font-weight: 600;
+  padding: 0.15em 0.5em;
+  border-radius: 3px;
+  margin-right: 0.4em;
+  vertical-align: middle;
+  white-space: nowrap;
+}
+
+.disciplines-resource-item {
+  margin-bottom: 0.35rem;
+  line-height: 1.5;
+}
+
+.disciplines-resource-item a {
+  word-break: break-word;
+}
+
+/* -------------------------------------------------- */
+/* Featured Resources: cards, filters, popups, lists  */
+/* -------------------------------------------------- */
+
+/* ---- Tags ---- */
+.tag {
+  display: inline-block;
+  font-size: 15px;
+  font-weight: 600;
+  padding: 0.15rem 0.55rem;
+  border-radius: 3px;
+  line-height: 1.4;
+  letter-spacing: 0.3px;
+  text-transform: uppercase;
+}
+.tag-focus { background: #004055; color: #fff; }
+.tag-type  { background: #b8336a; color: #fff; }
+
+/* ---- Featured tab accent ---- */
+.fr-featured-tab.active {
+  color: #004055 !important;
+  font-weight: 700;
+  border-bottom: 2px solid #004055;
+}
+
+/* ---- Sidebar "Recommended" link ---- */
+.fr-nav-featured {
+  font-weight: 600;
+  color: #004055 !important;
+}
+
+/* ---- Filter bar ---- */
+.fr-filter-bar {
+  display: flex;
+  flex-wrap: wrap;
+  gap: 0.75rem;
+  align-items: flex-start;
+  margin-bottom: 0.75rem;
+  padding: 0.65rem 0.75rem;
+  background: rgba(255,255,255,0.5);
+  border: 1px solid rgba(0,0,0,0.06);
+  border-radius: 6px;
+}
+.fr-filter-group {
+  display: flex;
+  align-items: center;
+  gap: 0.35rem;
+  flex-wrap: wrap;
+}
+.fr-filter-label {
+  font-size: 15px;
+  font-weight: 700;
+  text-transform: uppercase;
+  letter-spacing: 0.5px;
+  color: var(--soft);
+  flex-shrink: 0;
+}
+.fr-filter-tags {
+  display: flex;
+  flex-wrap: wrap;
+  gap: 0.25rem;
+}
+.fr-tag-btn {
+  font-family: inherit;
+  font-size: 15px;
+  font-weight: 600;
+  padding: 0.18rem 0.5rem;
+  border-radius: 3px;
+  border: 1px solid rgba(0,0,0,0.1);
+  background: transparent;
+  color: var(--soft);
+  cursor: pointer;
+  transition: background 0.15s, color 0.15s, border-color 0.15s;
+  text-transform: capitalize;
+}
+.fr-tag-btn:hover {
+  background: rgba(0,64,85,0.06);
+  color: #004055;
+  border-color: rgba(0,64,85,0.2);
+}
+.fr-tag-btn.active {
+  background: #004055;
+  color: #fff;
+  border-color: #004055;
+}
+.fr-specificity-toggle {
+  display: flex;
+  align-items: center;
+  gap: 0.3rem;
+  font-size: 15px;
+  color: var(--soft);
+  cursor: pointer;
+}
+.fr-specificity-toggle input {
+  margin: 0;
+}
+.fr-clear-btn {
+  margin-left: auto;
+  align-self: center;
+  font-family: inherit;
+  font-size: 15px;
+  font-weight: 600;
+  padding: 0.18rem 0.5rem;
+  border-radius: 3px;
+  border: 1px solid rgba(0,64,85,0.25);
+  background: transparent;
+  color: #004055;
+  cursor: pointer;
+  white-space: nowrap;
+  transition: background 0.15s, color 0.15s, border-color 0.15s;
+}
+.fr-clear-btn::before {
+  content: "\00d7";
+  margin-right: 0.3rem;
+  font-weight: 700;
+}
+.fr-clear-btn:hover {
+  background: #004055;
+  color: #fff;
+  border-color: #004055;
+}
+.fr-clear-btn[hidden] {
+  display: none;
+}
+
+/* ---- Search input ---- */
+.fr-search-wrap {
+  margin-bottom: 0.65rem;
+}
+.fr-search-input {
+  width: 100%;
+  font-family: inherit;
+  font-size: 0.78rem;
+  padding: 0.4rem 0.65rem;
+  border: 1px solid rgba(0,0,0,0.1);
+  border-radius: 5px;
+  background: #fff;
+  color: var(--ink);
+  outline: none;
+  transition: border-color 0.15s;
+}
+.fr-search-input:focus {
+  border-color: rgba(0,64,85,0.4);
+}
+.fr-search-input::placeholder {
+  color: #aaa;
+}
+
+/* ---- Side-by-side card (with testimonial) ---- */
+.fr-card {
+  display: grid;
+  grid-template-columns: 1fr 340px;
+  background: #fff;
+  border: 1px solid rgba(0,0,0,0.08);
+  border-radius: 6px;
+  overflow: hidden;
+  margin-bottom: 0.65rem;
+  transition: box-shadow 0.2s;
+}
+.fr-card:hover {
+  box-shadow: 0 3px 12px rgba(0,0,0,0.07);
+}
+.fr-resource {
+  padding: 0.85rem 1rem;
+}
+.fr-tags {
+  display: flex;
+  gap: 0.35rem;
+  margin-bottom: 0.4rem;
+}
+.fr-title {
+  font-size: 0.78rem;
+  font-weight: 600;
+  line-height: 1.35;
+  margin-bottom: 0.3rem;
+  color: #222;
+}
+.fr-summary {
+  font-size: 0.7rem;
+  color: var(--soft);
+  line-height: 1.55;
+  margin-bottom: 0.5rem;
+}
+.fr-actions {
+  display: flex;
+  align-items: center;
+  gap: 0.5rem;
+  margin-top: 0.15rem;
+}
+
+/* -- Testimonial carousel panel -- */
+.fr-testimonial {
+  background: rgba(0,64,85,0.04);
+  border-left: 3px solid #004055;
+  padding: 0.75rem 0.85rem;
+  display: flex;
+  flex-direction: column;
+  justify-content: center;
+  position: relative;
+  overflow: hidden;
+}
+.fr-rec-label {
+  font-size: 15px;
+  color: var(--soft);
+  text-transform: uppercase;
+  letter-spacing: 0.5px;
+  font-weight: 600;
+  margin-bottom: 0.35rem;
+}
+.fr-carousel {
+  position: relative;
+  overflow: hidden;
+  flex: 1;
+  display: flex;
+  flex-direction: column;
+  justify-content: center;
+}
+.fr-carousel-track {
+  display: flex;
+  transition: transform 0.35s cubic-bezier(0.25, 0.1, 0.25, 1);
+}
+.fr-carousel-slide {
+  flex: 0 0 100%;
+  min-width: 0;
+}
+.fr-rec-header {
+  display: flex;
+  align-items: center;
+  gap: 0.5rem;
+  margin-bottom: 0.3rem;
+}
+.fr-rec-name {
+  font-size: 0.7rem;
+  font-weight: 600;
+  color: #222;
+  line-height: 1.25;
+}
+.fr-rec-bio {
+  font-size: 15px;
+  color: var(--soft);
+  line-height: 1.25;
+  margin-top: 0.05rem;
+}
+.fr-rec-text {
+  font-size: 0.7rem;
+  color: var(--ink);
+  line-height: 1.5;
+  font-style: italic;
+}
+.fr-carousel-nav {
+  display: flex;
+  align-items: center;
+  gap: 0.3rem;
+  margin-top: 0.45rem;
+}
+.fr-carousel-dot {
+  width: 6px;
+  height: 6px;
+  border-radius: 50%;
+  background: rgba(0,0,0,0.12);
+  border: none;
+  padding: 0;
+  cursor: pointer;
+  transition: background 0.2s, transform 0.2s;
+}
+.fr-carousel-dot.active {
+  background: #004055;
+  transform: scale(1.35);
+}
+.fr-carousel-arrows {
+  margin-left: auto;
+  display: flex;
+  gap: 0.2rem;
+}
+.fr-carousel-arrow {
+  display: inline-flex;
+  align-items: center;
+  justify-content: center;
+  width: 20px;
+  height: 20px;
+  border-radius: 50%;
+  border: 1px solid rgba(0,0,0,0.12);
+  background: rgba(255,255,255,0.7);
+  cursor: pointer;
+  color: var(--soft);
+  font-size: 0.55rem;
+  font-family: inherit;
+  transition: background 0.15s, border-color 0.15s;
+  line-height: 1;
+}
+.fr-carousel-arrow:hover {
+  background: #fff;
+  border-color: rgba(0,0,0,0.25);
+  color: #222;
+}
+.fr-carousel-nav.single { display: none; }
+
+/* Avatars for recommenders */
+.avatar-photo {
+  width: 38px;
+  height: 38px;
+  object-fit: cover;
+  border-radius: 50%;
+  flex-shrink: 0;
+  border: 2px solid rgba(255,255,255,0.6);
+  box-shadow: 0 1px 4px rgba(0,0,0,0.1);
+}
+.avatar {
+  display: inline-flex;
+  align-items: center;
+  justify-content: center;
+  border-radius: 50%;
+  font-weight: 700;
+  color: #fff;
+  flex-shrink: 0;
+  line-height: 1;
+}
+.avatar-sm { width: 28px; height: 28px; font-size: 0.55rem; }
+.avatar-1 { background: #004055; }
+
+/* ---- Compact card ---- */
+.fc-card {
+  display: flex;
+  align-items: flex-start;
+  gap: 0.75rem;
+  background: #fff;
+  border: 1px solid rgba(0,0,0,0.08);
+  border-radius: 6px;
+  padding: 0.65rem 0.85rem;
+  margin-bottom: 0.45rem;
+  transition: box-shadow 0.2s;
+}
+.fc-card:hover {
+  box-shadow: 0 2px 10px rgba(0,0,0,0.06);
+}
+.fc-body {
+  flex: 1;
+  min-width: 0;
+}
+.fc-top-row {
+  display: flex;
+  align-items: flex-start;
+  gap: 0.5rem;
+  margin-bottom: 0.2rem;
+}
+.fc-tags {
+  display: flex;
+  gap: 0.25rem;
+  flex-shrink: 0;
+  margin-top: 0.05rem;
+}
+.fc-tags .tag {
+  font-size: 0.55rem;
+  padding: 0.1rem 0.4rem;
+}
+.fc-title {
+  font-size: 0.78rem;
+  font-weight: 600;
+  line-height: 1.35;
+  color: #222;
+  flex: 1;
+  min-width: 0;
+}
+.fc-summary {
+  font-size: 0.7rem;
+  color: var(--soft);
+  line-height: 1.5;
+  margin-bottom: 0.35rem;
+  display: -webkit-box;
+  -webkit-line-clamp: 2;
+  -webkit-box-orient: vertical;
+  overflow: hidden;
+}
+.fc-actions {
+  display: flex;
+  align-items: center;
+  gap: 0.5rem;
+}
+
+/* ---- Reference trigger button ---- */
+.fr-ref-trigger {
+  display: inline-flex;
+  align-items: center;
+  gap: 0.3rem;
+  font-family: inherit;
+  font-size: 15px;
+  color: #8e0000;
+  background: none;
+  border: none;
+  padding: 0;
+  cursor: pointer;
+  border-bottom: 1px dashed rgba(142,0,0,0.3);
+  transition: border-color 0.15s, color 0.15s;
+}
+.fr-ref-trigger:hover {
+  color: #b8336a;
+  border-bottom-color: rgba(184,51,106,0.4);
+}
+.fr-ref-trigger[aria-busy="true"] {
+  cursor: progress;
+}
+.fr-ref-trigger svg {
+  width: 11px;
+  height: 11px;
+  flex-shrink: 0;
+}
+
+/* ---- Vote button ---- */
+.fc-vote-btn {
+  display: inline-flex;
+  align-items: center;
+  gap: 0.25rem;
+  font-family: inherit;
+  font-size: 15px;
+  color: var(--soft);
+  background: none;
+  border: 1px solid rgba(0,0,0,0.1);
+  border-radius: 4px;
+  padding: 0.18rem 0.45rem;
+  cursor: pointer;
+  transition: color 0.15s, border-color 0.15s, background 0.15s;
+  line-height: 1.3;
+}
+.fc-vote-btn:hover {
+  color: #004055;
+  border-color: rgba(0,64,85,0.25);
+  background: rgba(0,64,85,0.04);
+}
+.fc-vote-btn.voted {
+  color: #004055;
+  border-color: rgba(0,64,85,0.3);
+  background: rgba(0,64,85,0.08);
+  cursor: default;
+  pointer-events: none;
+}
+.fc-vote-btn svg {
+  width: 13px;
+  height: 13px;
+}
+.fc-vote-count {
+  font-weight: 600;
+  font-size: 15px;
+  min-width: 0.8em;
+  text-align: center;
+}
+
+/* ---- Bookmark / Save button ---- */
+.fr-bookmark-btn {
+  display: inline-flex;
+  align-items: center;
+  gap: 0.25rem;
+  font-family: inherit;
+  font-size: 15px;
+  color: var(--soft);
+  background: none;
+  border: 1px solid rgba(0,0,0,0.1);
+  border-radius: 4px;
+  padding: 0.2rem 0.5rem;
+  cursor: pointer;
+  transition: color 0.15s, border-color 0.15s, background 0.15s;
+}
+.fr-bookmark-btn:hover {
+  color: #004055;
+  border-color: rgba(0,64,85,0.25);
+  background: rgba(0,64,85,0.04);
+}
+.fr-bookmark-btn.saved {
+  color: #004055;
+  border-color: rgba(0,64,85,0.3);
+  background: rgba(0,64,85,0.08);
+}
+.fr-bookmark-btn svg {
+  width: 12px;
+  height: 12px;
+}
+
+/* ---- No results message ---- */
+.fr-no-results {
+  text-align: center;
+  padding: 2rem 1rem;
+  font-size: 0.8rem;
+  color: var(--soft);
+  font-style: italic;
+}
+
+/* ---- Reference popup ---- */
+.ref-popup-backdrop {
+  display: none;
+  position: fixed;
+  inset: 0;
+  background: rgba(0,0,0,0.2);
+  backdrop-filter: blur(6px);
+  -webkit-backdrop-filter: blur(6px);
+  z-index: 2000;
+  align-items: center;
+  justify-content: center;
+  padding: 1.5rem;
+}
+.ref-popup-backdrop.open { display: flex; }
+
+.ref-popup {
+  background: #fff;
+  border-radius: 8px;
+  box-shadow: 0 12px 44px rgba(0,0,0,0.18);
+  max-width: 36rem;
+  width: 100%;
+  max-height: 85vh;
+  overflow-y: auto;
+  position: relative;
+}
+.ref-popup-close {
+  position: absolute;
+  top: 0.6rem;
+  right: 0.75rem;
+  background: none;
+  border: none;
+  font-size: 1.1rem;
+  color: var(--soft);
+  cursor: pointer;
+  line-height: 1;
+  font-family: inherit;
+  z-index: 1;
+}
+.ref-popup-close:hover { color: var(--ink); }
+
+.ref-popup-body {
+  padding: 1.25rem 1.35rem 1rem;
+}
+
+.ref-popup-tags {
+  display: flex;
+  gap: 0.35rem;
+  margin-bottom: 0.4rem;
+}
+.ref-popup-title {
+  font-size: 0.88rem;
+  font-weight: 600;
+  color: #222;
+  line-height: 1.35;
+  margin-bottom: 0.75rem;
+  padding-bottom: 0.65rem;
+  border-bottom: 1px solid rgba(0,0,0,0.06);
+}
+
+.ref-section {
+  margin-bottom: 0.85rem;
+}
+.ref-section-label {
+  font-size: 15px;
+  text-transform: uppercase;
+  letter-spacing: 0.6px;
+  font-weight: 700;
+  color: var(--soft);
+  margin-bottom: 0.3rem;
+}
+.ref-apa {
+  font-size: 0.78rem;
+  line-height: 1.6;
+  color: var(--ink);
+  padding: 0.6rem 0.75rem;
+  background: #f8f8f5;
+  border: 1px solid rgba(0,0,0,0.06);
+  border-radius: 4px;
+  position: relative;
+}
+.ref-copy-btn {
+  display: inline-flex;
+  align-items: center;
+  gap: 0.3rem;
+  font-family: inherit;
+  font-size: 15px;
+  font-weight: 600;
+  color: #004055;
+  background: rgba(0,64,85,0.08);
+  border: 1px solid rgba(0,64,85,0.15);
+  border-radius: 4px;
+  padding: 0.25rem 0.55rem;
+  cursor: pointer;
+  transition: background 0.15s, color 0.15s;
+  text-transform: uppercase;
+  letter-spacing: 0.3px;
+  margin-top: 0.35rem;
+}
+.ref-copy-btn:hover {
+  background: rgba(0,64,85,0.14);
+}
+.ref-copy-btn.copied {
+  background: #d4e4d9;
+  color: #2a6a3a;
+  border-color: rgba(42,106,58,0.2);
+}
+.ref-copy-btn svg {
+  width: 11px;
+  height: 11px;
+}
+.ref-copy-row {
+  display: flex;
+  gap: 0.4rem;
+  margin-top: 0.35rem;
+}
+.ref-abstract {
+  font-size: 0.75rem;
+  line-height: 1.65;
+  color: var(--ink);
+  font-style: italic;
+}
+.ref-doi-row {
+  display: flex;
+  align-items: center;
+  flex-wrap: wrap;
+  gap: 0.4rem;
+  margin-top: 0.2rem;
+  font-size: 0.75rem;
+}
+.ref-doi-link {
+  color: #1c7ed6;
+  word-break: break-all;
+  text-decoration: none;
+}
+.ref-doi-link:hover { text-decoration: underline; }
+
+.ref-oa-badge {
+  display: inline-flex;
+  align-items: center;
+  gap: 0.2rem;
+  font-size: 15px;
+  font-weight: 600;
+  padding: 0.1rem 0.45rem;
+  border-radius: 3px;
+  text-decoration: none;
+  transition: opacity 0.15s;
+}
+.ref-oa-badge:hover { opacity: 0.8; }
+.ref-oa-badge svg {
+  width: 12px;
+  height: 12px;
+}
+.ref-oa-badge.open {
+  background: rgba(42,106,58,0.1);
+  color: #2a6a3a;
+}
+.ref-oa-badge.closed {
+  background: rgba(0,0,0,0.06);
+  color: var(--soft);
+  cursor: default;
+}
+.ref-oa-link {
+  display: inline-flex;
+  align-items: center;
+  gap: 0.2rem;
+  font-size: 15px;
+  font-weight: 600;
+  color: #2a6a3a;
+  text-decoration: none;
+  border-bottom: 1px solid rgba(42,106,58,0.3);
+  transition: border-color 0.15s;
+}
+.ref-oa-link:hover { border-bottom-color: #2a6a3a; }
+.ref-oa-link svg {
+  width: 11px;
+  height: 11px;
+}
+.ref-divider {
+  height: 1px;
+  background: rgba(0,0,0,0.06);
+  margin: 0.65rem 0;
+}
+
+/* ---- Reading list: pill ---- */
+.rl-pill {
+  position: fixed;
+  top: 1rem;
+  right: 1.25rem;
+  z-index: 3000;
+  display: flex;
+  align-items: center;
+  gap: 0.4rem;
+  background: #004055;
+  color: #fff;
+  padding: 0.35rem 0.7rem 0.35rem 0.55rem;
+  border-radius: 20px;
+  box-shadow: 0 3px 14px rgba(0,0,0,0.18);
+  cursor: pointer;
+  font-size: 0.7rem;
+  font-weight: 600;
+  opacity: 0;
+  transform: translateY(-8px);
+  pointer-events: none;
+  transition: opacity 0.3s, transform 0.3s;
+}
+.rl-pill.visible {
+  opacity: 1;
+  transform: translateY(0);
+  pointer-events: auto;
+}
+.rl-pill:hover { background: #00556e; }
+.rl-pill svg {
+  width: 14px;
+  height: 14px;
+  flex-shrink: 0;
+}
+.rl-pill-count {
+  background: #b8336a;
+  color: #fff;
+  font-size: 0.58rem;
+  font-weight: 700;
+  min-width: 1.3em;
+  height: 1.3em;
+  border-radius: 50%;
+  display: inline-flex;
+  align-items: center;
+  justify-content: center;
+  line-height: 1;
+}
+
+/* ---- First-save tooltip ---- */
+.rl-tooltip {
+  position: fixed;
+  top: 3.2rem;
+  right: 1.25rem;
+  z-index: 3001;
+  background: #fff;
+  border: 1px solid rgba(0,0,0,0.1);
+  border-radius: 8px;
+  box-shadow: 0 6px 24px rgba(0,0,0,0.12);
+  padding: 0.75rem 1rem;
+  max-width: 16rem;
+  opacity: 0;
+  transform: translateY(-6px);
+  pointer-events: none;
+  transition: opacity 0.3s, transform 0.3s;
+}
+.rl-tooltip.visible {
+  opacity: 1;
+  transform: translateY(0);
+  pointer-events: auto;
+}
+.rl-tooltip::before {
+  content: '';
+  position: absolute;
+  top: -6px;
+  right: 1.5rem;
+  width: 10px;
+  height: 10px;
+  background: #fff;
+  border-left: 1px solid rgba(0,0,0,0.1);
+  border-top: 1px solid rgba(0,0,0,0.1);
+  transform: rotate(45deg);
+}
+.rl-tooltip-text {
+  font-size: 15px;
+  color: var(--ink);
+  line-height: 1.5;
+  margin-bottom: 0.45rem;
+}
+.rl-tooltip-dismiss {
+  font-family: inherit;
+  font-size: 15px;
+  font-weight: 600;
+  color: #004055;
+  background: rgba(0,64,85,0.08);
+  border: 1px solid rgba(0,64,85,0.15);
+  border-radius: 4px;
+  padding: 0.2rem 0.55rem;
+  cursor: pointer;
+  transition: background 0.15s;
+}
+.rl-tooltip-dismiss:hover { background: rgba(0,64,85,0.14); }
+
+/* ---- Reading list: panel / drawer ---- */
+.rl-panel-backdrop {
+  display: none;
+  position: fixed;
+  inset: 0;
+  background: rgba(0,0,0,0.15);
+  backdrop-filter: blur(3px);
+  -webkit-backdrop-filter: blur(3px);
+  z-index: 3500;
+}
+.rl-panel-backdrop.open { display: block; }
+.rl-panel {
+  position: fixed;
+  top: 0;
+  right: 0;
+  bottom: 0;
+  width: 22rem;
+  max-width: 90vw;
+  background: #fff;
+  box-shadow: -6px 0 30px rgba(0,0,0,0.12);
+  display: flex;
+  flex-direction: column;
+  overflow: hidden;
+  transform: translateX(100%);
+  transition: transform 0.3s cubic-bezier(0.25, 0.1, 0.25, 1);
+  z-index: 3501;
+}
+.rl-panel.open { transform: translateX(0); }
+.rl-panel-header {
+  padding: 0.85rem 1.1rem;
+  border-bottom: 1px solid rgba(0,0,0,0.06);
+  display: flex;
+  align-items: center;
+  justify-content: space-between;
+  flex-shrink: 0;
+}
+.rl-panel-title {
+  font-size: 0.85rem;
+  font-weight: 700;
+  color: #004055;
+}
+.rl-panel-note {
+  font-size: 15px;
+  color: var(--soft);
+  line-height: 1.45;
+  padding: 0.5rem 1.1rem;
+  border-bottom: 1px solid rgba(0,0,0,0.04);
+  flex-shrink: 0;
+}
+.rl-panel-close {
+  background: none;
+  border: none;
+  font-size: 1.1rem;
+  color: var(--soft);
+  cursor: pointer;
+  font-family: inherit;
+  line-height: 1;
+}
+.rl-panel-close:hover { color: var(--ink); }
+.rl-panel-body {
+  flex: 1;
+  overflow-y: auto;
+  padding: 0.5rem 0;
+}
+.rl-panel-empty {
+  padding: 2rem 1.25rem;
+  text-align: center;
+  font-size: 0.78rem;
+  color: var(--soft);
+}
+.rl-panel-item {
+  display: flex;
+  flex-direction: column;
+  padding: 0.55rem 1.25rem;
+  border-bottom: 1px solid rgba(0,0,0,0.04);
+  font-size: 0.78rem;
+}
+.rl-panel-item-header {
+  display: flex;
+  align-items: center;
+  gap: 0.5rem;
+  width: 100%;
+}
+.rl-panel-item-toggle {
+  background: none;
+  border: none;
+  color: #bbb;
+  cursor: pointer;
+  padding: 0.2rem;
+  flex-shrink: 0;
+  transition: color 0.15s, transform 0.2s;
+}
+.rl-panel-item-toggle svg {
+  width: 12px;
+  height: 12px;
+  display: block;
+}
+.rl-panel-item-toggle:hover { color: var(--soft); }
+.rl-panel-item.expanded .rl-panel-item-toggle {
+  transform: rotate(180deg);
+  color: #004055;
+}
+.rl-panel-item-info {
+  flex: 1;
+  min-width: 0;
+}
+.rl-panel-item-title {
+  font-weight: 600;
+  color: #222;
+  line-height: 1.35;
+}
+.rl-panel-item-ref {
+  font-size: 15px;
+  color: var(--soft);
+  margin-top: 0.1rem;
+}
+.rl-panel-item-remove {
+  background: none;
+  border: none;
+  color: var(--line);
+  cursor: pointer;
+  font-size: 0.9rem;
+  font-family: inherit;
+  line-height: 1;
+  padding: 0.2rem;
+  flex-shrink: 0;
+  transition: color 0.15s;
+}
+.rl-panel-item-remove:hover { color: #b8336a; }
+/* Collapsible details */
+.rl-panel-item-details {
+  display: none;
+  padding: 0.35rem 0 0.15rem 1.6rem;
+  margin-top: 0.25rem;
+  border-left: 2px solid rgba(0,64,85,0.12);
+  margin-left: 0.45rem;
+  font-size: 15px;
+  color: var(--soft);
+  line-height: 1.45;
+}
+.rl-panel-item.expanded .rl-panel-item-details {
+  display: block;
+}
+/* APA reference + copy button row */
+.rl-detail-ref-row {
+  display: flex;
+  align-items: flex-start;
+  gap: 0.3rem;
+}
+.rl-detail-apa {
+  flex: 1;
+  font-size: 15px;
+  color: var(--ink);
+  line-height: 1.4;
+  padding-left: 1.2em;
+  text-indent: -1.2em;
+}
+.rl-detail-copy {
+  flex-shrink: 0;
+  background: none;
+  border: 1px solid var(--line);
+  border-radius: 3px;
+  padding: 0.15rem 0.25rem;
+  cursor: pointer;
+  color: var(--soft);
+  transition: color 0.15s, border-color 0.15s, background 0.15s;
+  margin-top: 0.1rem;
+}
+.rl-detail-copy svg { width: 11px; height: 11px; display: block; }
+.rl-detail-copy:hover { color: #004055; border-color: #004055; }
+.rl-detail-copy.copied { color: #2a6a3a; border-color: #2a6a3a; background: #e6f4ea; }
+/* Abstract with inline show more/less */
+.rl-detail-abstract-wrap {
+  margin-top: 0.3rem;
+  font-size: 15px;
+  color: var(--soft);
+  line-height: 1.4;
+  position: relative;
+}
+.rl-detail-abstract {
+  display: -webkit-box;
+  -webkit-box-orient: vertical;
+  -webkit-line-clamp: 4;
+  overflow: hidden;
+}
+.rl-detail-abstract-wrap.abstract-expanded .rl-detail-abstract {
+  display: block;
+  -webkit-line-clamp: unset;
+  overflow: visible;
+}
+.rl-detail-show-more {
+  background: none;
+  border: none;
+  padding: 0;
+  font-size: 15px;
+  color: #006080;
+  cursor: pointer;
+  font-family: inherit;
+  margin-top: 0.1rem;
+}
+.rl-detail-show-more:hover { text-decoration: underline; }
+/* DOI + OA icon + Free PDF — compact meta row */
+.rl-detail-meta {
+  margin-top: 0.3rem;
+  display: flex;
+  align-items: center;
+  gap: 0.35rem;
+  font-size: 15px;
+}
+.rl-detail-doi-link {
+  color: #006080 !important;
+  text-decoration: none;
+  word-break: break-all;
+}
+.rl-detail-doi-link:hover { text-decoration: underline; }
+.rl-oa-icon {
+  width: 11px;
+  height: 17px;
+  flex-shrink: 0;
+}
+.rl-detail-pdf-link {
+  color: #2a6a3a !important;
+  font-weight: 600;
+  text-decoration: none;
+}
+.rl-detail-pdf-link:hover { text-decoration: underline; }
+.rl-panel-footer {
+  padding: 0.65rem 1.25rem;
+  border-top: 1px solid rgba(0,0,0,0.06);
+  display: flex;
+  justify-content: flex-end;
+  gap: 0.4rem;
+  flex-shrink: 0;
+  flex-wrap: wrap;
+}
+.rl-export-btn {
+  font-family: inherit;
+  font-size: 15px;
+  font-weight: 600;
+  color: #fff;
+  background: #004055;
+  border: none;
+  border-radius: 4px;
+  padding: 0.35rem 0.75rem;
+  cursor: pointer;
+  display: inline-flex;
+  align-items: center;
+  gap: 0.3rem;
+  transition: background 0.15s;
+}
+.rl-export-btn:hover { background: #00556e; }
+.rl-export-btn svg {
+  width: 12px;
+  height: 12px;
+}
+.rl-pdf-btn {
+  font-family: inherit;
+  font-size: 15px;
+  font-weight: 600;
+  color: #004055;
+  background: transparent;
+  border: 1.5px solid #004055;
+  border-radius: 4px;
+  padding: 0.35rem 0.75rem;
+  cursor: pointer;
+  display: inline-flex;
+  align-items: center;
+  gap: 0.3rem;
+  transition: background 0.15s, color 0.15s;
+}
+.rl-pdf-btn:hover {
+  background: #004055;
+  color: #fff;
+}
+.rl-pdf-btn:disabled {
+  opacity: 0.6;
+  cursor: wait;
+}
+.rl-pdf-btn svg {
+  width: 12px;
+  height: 12px;
+}
+@keyframes rl-spin {
+  to { transform: rotate(360deg); }
+}
+.rl-spin {
+  animation: rl-spin 1s linear infinite;
+}
+
+/* ---- Featured resources responsive ---- */
+@media (max-width: 768px) {
+  .fr-card { grid-template-columns: 1fr; }
+  .fr-testimonial { border-left: none; border-top: 1px solid rgba(0,64,85,0.12); }
+  .fr-filter-bar {
+    flex-direction: column;
+    gap: 0.5rem;
+  }
+  .fc-top-row {
+    flex-direction: column;
+    gap: 0.25rem;
+  }
+}
+
+.clusters-display-section,.clusters-intro-section{background:transparent!important;padding:0!important}
+.cluster-section{border:0!important;border-radius:var(--r-large)!important;box-shadow:none!important}
+.acc-count,.cluster-stats,.cluster-description{color:var(--ink)!important;opacity:1!important}
+.clusters-head h1.clusters-site-heading{font-size:clamp(36px,4.2vw,58px);line-height:1.06}
+.clusters-intro a:not(.btn, .clusters-map a),.disciplines-attribution a,.sc-description a,.disciplines-leads a{text-decoration:underline;text-underline-offset:3px}
+
+.sidebar-header:has(.sidebar-close){display:flex;align-items:center;justify-content:space-between;gap:8px}
+.sidebar-close{padding:8px 14px;background:#fff;border:1.5px solid var(--ink);border-radius:999px;color:var(--ink);font:600 15px/1.2 var(--text);letter-spacing:0;text-transform:none;cursor:pointer}
+/* On phones the pinned filters took half the screen, so they scroll away with the page. */
+@media (max-width:760px){
+  .clusters-controls{position:static}
+  .clusters-layout{--clusters-controls-height:0px!important}
+}
+
+/* Back to top rests in the margin beside the fields or clusters, which .cluster-full-width widens by 15 px
+   (35 px on phones, 47 px or more on laptops, 80 px from 1440), so it never covers text or a control.
+   clusters-page.js shows it only alongside that section. It sits above the chat launcher, clear of the cookie banner,
+   and its focus ring stays inside it. */
+.clusters-back-to-top.clusters-back-to-top{right:6px;bottom:calc(84px + var(--banner,0px));width:36px;height:36px;font-size:14px;background:var(--ink);box-shadow:none}
+.clusters-back-to-top.clusters-back-to-top:hover{background:var(--link)}
+.clusters-back-to-top.clusters-back-to-top:focus{outline:none}
+.clusters-back-to-top.clusters-back-to-top:focus-visible{outline:2px solid #fff;outline-offset:-5px;border-radius:999px}
+@media (min-width:1440px){
+  .clusters-back-to-top.clusters-back-to-top{right:20px;bottom:calc(92px + var(--banner,0px));width:44px;height:44px;font-size:16px}
+}
+@media (max-width:760px){
+  .clusters-back-to-top.clusters-back-to-top{right:4px;bottom:calc(80px + var(--banner,0px));width:28px;height:28px;font-size:13px}
+}
+body.clusters-mobile-nav-open .clusters-back-to-top{display:none}
+.sc-description,.fc-summary,.fc-title{font-size:16px}
+
+/* Explanations inside the panels keep to the reading measure of .article-style; the cards and
+   resource lists around them stay wide. */
+.cluster-description,.sc-description{max-width:580px}
+/* Labels, tags and counts at the site's smallest UI size, as the design check requires. */
+.acc-count,.cluster-stats,.acc-toggle-all,.fc-tags .tag,.disciplines-category-badge{font-size:15px}
+.fc-tags{flex-wrap:wrap}
+
+/* The explorer in the site's own components: pill filters as in the resources directory, no card shadow
+   or full-bleed rules, legible disclosure arrows, counts and link buttons, and "How to cite" as a link. */
+.clusters-controls{box-shadow:none;border:0;padding:0;background:var(--page)}
+.fr-filter-bar{background:var(--surface);border:0;border-radius:var(--r-large);padding:16px 18px;gap:12px 20px;margin-bottom:12px}
+.fr-filter-label{text-transform:none;letter-spacing:0;color:var(--ink);font-weight:600}
+.fr-filter-tags{gap:7px}
+.fr-tag-btn{background:#fff;border:1.5px solid var(--line);border-radius:999px;padding:6px 12px;font:400 15px/1.3 var(--text);color:var(--ink)}
+.fr-tag-btn:hover{background:#fff;border-color:var(--ink);color:var(--ink)}
+.fr-tag-btn.active,.fr-tag-btn.active:hover{background:var(--ink);border-color:var(--ink);color:#fff}
+.fr-search-input{border:1.5px solid var(--line);border-radius:999px;padding:8px 16px;background:#fff;font:400 16px/1.3 var(--text);color:var(--ink)}
+.fr-specificity-toggle{color:var(--ink)}
+.fr-specificity-toggle input{width:18px;height:18px;accent-color:var(--ink)}
+.clusters-mobile-toggle.clusters-mobile-toggle{border:1.5px solid var(--ink);border-radius:999px;background:#fff;color:var(--ink);font:600 16px/1.3 var(--text);padding:10px 18px}
+.clusters-display-section{border:0}
+.acc-header{font-size:16px;color:var(--ink);padding:10px 2px;gap:10px}
+.acc-chevron{font-size:13px;color:var(--ink);width:14px;text-align:center}
+.acc-chevron.acc-open{color:var(--ink)}
+.acc-section+.acc-section{border-top-color:var(--line)}
+.acc-count{color:var(--soft)!important;font-variant-numeric:tabular-nums}
+.acc-copy-link{opacity:1;color:var(--soft);width:32px;height:32px;border-radius:999px}
+.acc-copy-link svg{width:15px;height:15px}
+.acc-copy-link:hover{color:var(--link);background:rgba(0,90,135,.08)}
+.acc-toggle-all{background:#fff;border:1.5px solid var(--line);border-radius:999px;padding:6px 14px;color:var(--ink);font-weight:600}
+.acc-toggle-all:hover{border-color:var(--ink);color:var(--ink)}
+/* Expand all sits on its own line above the rows; floated, it took width from the first row. */
+.acc-toggle-all{float:none;display:block;margin:4px 0 10px}
+.disciplines-citation-summary{color:var(--link);font-size:16px;font-weight:600;text-align:start;padding:8px 0}
+.disciplines-citation-summary:hover,.disciplines-citation-summary:focus-visible{color:var(--ink)}
+/* Labels in sentence case, as elsewhere on the site, not spaced capitals. */
+.sidebar-header,.fr-rec-label,.ref-section-label,.ref-copy-btn,.fc-tags .tag{text-transform:none;letter-spacing:0}
+.sidebar-header{color:var(--ink);font-size:16px}
+.acc-chevron{font-size:18px;line-height:1}
+.cluster-nav-toggle{font-size:16px!important;width:16px;display:inline-block;text-align:center}
+.clusters-sidebar-inner .sidebar-header{padding-top:14px}
+/* The page title at the weight and spacing of every other h1. */
+.clusters-head h1.clusters-site-heading{font-weight:var(--display-weight);letter-spacing:-.01em;text-wrap:balance}
+/* The closed reading-list panel cast its shadow back onto the page edge. */
+.rl-panel:not(.open){box-shadow:none}
+/* Introductions keep to a reading measure; the explorer and diagram keep the full width. */
+.clusters-intro .intro-paragraph{max-width:70ch}
+/* On a phone the sponsor is a small credit line, so the search follows the introduction closely. */
+@media (max-width:768px){
+  .disciplines-partner{display:flex;align-items:center;gap:12px;align-self:flex-start;max-width:none}
+  .disciplines-partner img{width:56px;height:56px}
+  .disciplines-partner__caption{margin:0}
+}
+/* The disciplines search as the header's: a pill field with its button inside it, so the two never part. */
+.clusters-inline-search__row{align-items:center;background:var(--page)}
+.clusters-inline-search__input.clusters-inline-search__input{flex:1 1 0;max-width:28rem;border:1.5px solid var(--line);border-radius:999px;padding:9px 52px 9px 16px;font:400 16px/1.3 var(--text);color:var(--ink);background:#fff}
+.clusters-inline-search__submit.clusters-inline-search__submit{margin-inline-start:-50px;width:40px;height:40px;min-width:0;padding:0;border:0;border-radius:999px;background:transparent;color:var(--ink)}
+.clusters-inline-search__submit.clusters-inline-search__submit:hover{background:var(--surface);color:var(--ink)}
+.clusters-inline-search__option-label{font-size:15px;color:var(--ink);margin-inline-start:8px}
+@media(max-width:760px){.clusters-inline-search__option-label{flex-basis:100%;margin:4px 0 0}}
+.clusters-map__enlarge,.clusters-map__close{border:1.5px solid var(--ink);border-radius:999px;background:#fff;padding:8px 16px;font:600 15px/1.3 var(--text)}
+@media(max-width:760px){.clusters-map__hub{width:min(180px,50%)}}
+/* On a phone a row's count goes under its title, so long titles keep the width; the whole row opens it. */
+@media(max-width:760px){
+  .acc-header{flex-wrap:wrap;row-gap:2px}
+  .acc-header .acc-label{flex:1 1 0}
+  .acc-header .acc-copy-link{order:2}
+  .acc-header .acc-count{order:3;flex-basis:100%;margin-left:24px}
+}
+/* Below 1440 px the chat button floats in the bottom corner (launcher.css); back to top sits above it. */
+@media (max-width:1439px){
+  .clusters-back-to-top.clusters-back-to-top{right:20px;bottom:calc(80px + var(--banner,0px) + env(safe-area-inset-bottom,0px));width:44px;height:44px;font-size:16px}
+}
+body.clusters-mobile-nav-open #just-os-widget{display:none}
+.disciplines-areas{display:flex;flex-wrap:wrap;gap:6px;margin:-4px 0 14px;padding:0;list-style:none}
+.disciplines-areas li{margin:0}
+.disciplines-areas .badge{padding:4px 10px;border-radius:999px;font:600 15px/1.3 var(--text)}
diff --git a/assets/css/doors/compat.css b/assets/css/doors/compat.css
new file mode 100644
index 00000000000..2b7d6971296
--- /dev/null
+++ b/assets/css/doors/compat.css
@@ -0,0 +1,54 @@
+/* The Bootstrap classes still written in Markdown, shortcodes and generated pages, drawn in Doors
+   colours. Only classes the build actually uses; add here rather than bringing the theme back. */
+.btn{display:inline-block;padding:8px 18px;border:1.5px solid var(--link);border-radius:999px;background:transparent;color:var(--link);font:600 16px/1.35 var(--text);text-align:center;text-decoration:none;cursor:pointer}
+.btn:hover,.btn:focus-visible{background:var(--ink);border-color:var(--ink);color:#fff;text-decoration:none}
+.btn-primary{background:var(--link);border-color:var(--link);color:#fff}
+.btn-outline-primary,.btn-outline{color:var(--link);border-color:var(--link);background:transparent}
+.btn-outline-success,.btn-outline-info,.btn-outline-danger,.btn-outline-secondary{color:var(--ink);border-color:var(--soft);background:transparent}
+.btn-sm{padding:4px 12px;font-size:15px}
+.btn-lg{padding:12px 24px;font-size:18px}
+.btn-block{display:block;width:100%}
+.btn-group{display:inline-flex;flex-wrap:wrap;gap:6px}
+.badge{display:inline-block;padding:3px 10px;border-radius:var(--r-small);background:var(--surface);color:var(--ink);font:600 15px/1.4 var(--text)}
+.badge-pill{border-radius:999px}
+.alert{margin:0 0 1em;padding:14px 18px;background:var(--res-bg);border-radius:var(--r-large);color:var(--ink);font-size:16px}
+.alert-example{background:var(--edu-bg)}
+.alert-warning{background:var(--com-bg)}
+.card{background:var(--surface);border-radius:var(--r-large)}
+.card-body{padding:18px}
+.collapse:not(.show){display:none}
+.form-control{display:block;width:100%;padding:8px 12px;background:#fff;border:1.5px solid var(--soft);border-radius:var(--r-small);color:var(--ink);font:400 16px/1.4 var(--text)}
+.form-group{margin-bottom:1em}
+.container,.container-fluid{width:100%;margin-inline:auto;padding-inline:12px}
+.row{display:flex;flex-wrap:wrap;margin-inline:-12px}
+.row>*{width:100%;min-width:0;padding-inline:12px}
+.col{flex:1 0 0}
+.col-auto{flex:0 0 auto;width:auto}
+@media(min-width:576px){.col-sm-4{width:33.333%}.col-sm-8{width:66.667%}.col-sm-auto{flex:0 0 auto;width:auto}.d-sm-flex{display:flex!important}.text-sm-right{text-align:end}}
+@media(min-width:768px){.col-md-3{width:25%}.col-md-4{width:33.333%}.col-md-8{width:66.667%}.col-md-9{width:75%}.col-md-12{width:100%}.d-md-none{display:none!important}}
+@media(min-width:992px){.col-lg-4{width:33.333%}.col-lg-8{width:66.667%}.col-lg-12{width:100%}.d-lg-none{display:none!important}}
+@media(min-width:1200px){.col-xl-3{width:25%}.col-xl-9{width:75%}}
+.media{display:flex;align-items:flex-start;gap:12px}
+.media-body{flex:1;min-width:0}
+.d-none{display:none!important}
+.d-block{display:block!important}
+.d-flex{display:flex!important}
+.d-inline{display:inline!important}
+.flex-column{flex-direction:column}
+.flex-wrap{flex-wrap:wrap}
+.justify-content-center{justify-content:center}
+.justify-content-around{justify-content:space-around}
+.align-items-center{align-items:center}
+.align-self-center{align-self:center}
+.text-center{text-align:center}
+.text-danger{color:var(--urgent)}
+.text-white{color:#fff}
+.mx-auto{margin-inline:auto}
+.w-50{width:50%}
+.rounded-circle{border-radius:50%}
+.rounded{border-radius:var(--r-small)}
+.bg-light{background:var(--surface)}
+.border-bottom{border-bottom:1px solid var(--line)}
+.mt-0{margin-top:0}.mb-0{margin-bottom:0}.m-1{margin:4px}.mb-1{margin-bottom:4px}.mb-2{margin-bottom:8px}.mb-3{margin-bottom:16px}.mb-4{margin-bottom:24px}
+.mt-3{margin-top:16px}.mt-4{margin-top:24px}.my-1{margin-block:4px}.my-4{margin-block:24px}.mr-1{margin-inline-end:4px}.mr-3{margin-inline-end:16px}
+.p-0{padding:0}.p-3{padding:16px}.pb-1{padding-bottom:4px}.pb-2{padding-bottom:8px}.pb-3{padding-bottom:16px}.pt-3{padding-top:16px}.pr-2{padding-inline-end:8px}.py-2{padding-block:8px}.py-3{padding-block:16px}.py-4{padding-block:24px}
diff --git a/assets/css/doors/fonts.css b/assets/css/doors/fonts.css
new file mode 100644
index 00000000000..11b5fad5ef3
--- /dev/null
+++ b/assets/css/doors/fonts.css
@@ -0,0 +1,6 @@
+/* Self-hosted, subsetted from Google's OFL sources by scripts/rebrand/build_fonts.py.
+   Paths are relative to the built stylesheet in /css/. */
+@font-face{font-family:'Newsreader';src:url(../fonts/doors/newsreader-var.woff2) format('woff2');font-weight:500;font-style:normal;font-display:swap}
+@font-face{font-family:'Source Sans 3';src:url(../fonts/doors/source-sans-3-var.woff2) format('woff2');font-weight:400 700;font-style:normal;font-display:swap}
+/* Only reference lists ask for this, so other pages never download it. */
+@font-face{font-family:'Source Sans 3';src:url(../fonts/doors/source-sans-3-italic.woff2) format('woff2');font-weight:400;font-style:italic;font-display:swap}
diff --git a/assets/css/doors/glossary.css b/assets/css/doors/glossary.css
new file mode 100644
index 00000000000..71418c33146
--- /dev/null
+++ b/assets/css/doors/glossary.css
@@ -0,0 +1,141 @@
+/* Explicit glossary links keep the surrounding text colour. */
+a.gloss-term {
+  color: inherit;
+  text-decoration: underline dotted 2px var(--edu);
+  text-underline-offset: 3px;
+}
+a.gloss-term:hover,
+a.gloss-term:focus {
+  color: var(--edu);
+}
+.doors-popover .gloss-popover-title {
+  font-family: var(--display);
+  font-size: 1.1rem;
+  font-weight: 500;
+  margin: 0 0 6px;
+}
+/* Translated terms: the term on its own line, its English name below it, isolated left to right; the
+   breadcrumb names only the term; English references read left to right inside an Arabic page. */
+.glossary-layout .reading h1 bdi{display:block;margin-top:6px;font-size:.6em;line-height:1.2;color:var(--soft)}
+.glossary-layout .crumbs [aria-current=page] bdi{display:none}
+main:lang(ar) .glossary-layout .references-list li{direction:ltr;text-align:left}
+.term-list-jump{display:none}
+@media(max-width:1000px){
+  .term-list-jump{display:inline-block;margin-top:10px;font-weight:600;color:var(--link);text-decoration:underline;text-underline-offset:3px}
+  #glossary-terms{scroll-margin-top:16px}
+}
+main:lang(ar) .glossary-layout .reading h1 bdi{text-align:right}
+@media(max-width:1000px){.term-list-jump{display:block;width:fit-content}}
+/* Languages on a term page as the hub's pills. */
+.glossary-layout .language-switcher{display:flex;flex-wrap:wrap;align-items:center;gap:6px}
+.glossary-layout .language-switcher strong{font-size:16px;margin-inline-end:4px}
+.glossary-layout .language-switcher a{font-size:16px;padding:5px 12px;border:1.5px solid var(--line);border-radius:999px;background:#fff;color:var(--link);text-decoration:none}
+.glossary-layout .language-switcher a:hover{border-color:var(--link)}
+.glossary-layout .language-switcher .term-list-jump{flex-basis:auto;margin-top:6px;border-color:var(--ink);color:var(--ink);font-weight:600}
+@media(max-width:1000px){.glossary-layout .language-switcher .term-list-jump{display:inline-block}}
+/* English runs on an Arabic page in the site's own faces; the Arabic text keeps its own, whose spacing the line-length rule is set for. */
+main:lang(ar) [lang=en],main:lang(ar) .glossary-layout .references-list li{font-family:'Source Sans 3','Source Sans Pro',system-ui,sans-serif}
+main:lang(ar) h1 [lang=en]{font-family:var(--display)}
+/* A translated term's English name, on its own smaller line wherever the term is listed. */
+.term-list .term-en,.post-nav .term-en{display:block;font-size:15px;color:var(--soft)}
+main:lang(ar) .term-list .term-en,main:lang(ar) .post-nav-prev .term-en{text-align:right}
+main:lang(ar) .post-nav-next .term-en{text-align:left}
+/* The glossary hub: languages, a search and every term with the start of its definition. */
+.glossary-hub .glossary-languages{display:flex;flex-wrap:wrap;gap:8px;margin:18px 0 0}
+.glossary-hub .glossary-languages a{padding:7px 14px;border:1.5px solid var(--line);border-radius:999px;background:#fff;color:var(--link);font:600 16px/1.3 var(--text);text-decoration:none}
+.glossary-hub .glossary-languages a:hover{border-color:var(--link)}
+.glossary-hub .glossary-languages a[aria-current]{background:var(--ink);border-color:var(--ink);color:#fff}
+.glossary-find{margin:28px 0 10px;max-width:640px}
+.glossary-find label{display:block;margin:0 0 8px;font:var(--display-weight) 24px/1.2 var(--display)}
+.glossary-find input{width:100%;box-sizing:border-box;padding:12px 18px;border:1.5px solid var(--ink);border-radius:999px;background:#fff;font:400 18px/1.3 var(--text);color:var(--ink)}
+.glossary-none{margin:12px 0 0;font-size:17px}
+.glossary-letters{display:flex;flex-wrap:wrap;gap:4px;margin:14px 0 8px}
+.glossary-letters a{display:inline-flex;align-items:center;justify-content:center;min-width:36px;height:36px;border-radius:var(--r-small);background:var(--surface);color:var(--ink);font:600 16px/1 var(--text);text-decoration:none}
+.glossary-letters a:hover{background:var(--edu-bg)}
+.term-group{scroll-margin-top:16px}
+.term-group h2{margin:28px 0 10px;font-size:28px;color:var(--edu)}
+.term-group ul{display:grid;grid-template-columns:repeat(auto-fill,minmax(min(100%,300px),1fr));gap:12px;margin:0;padding:0;list-style:none}
+.term-group li{margin:0;padding:14px 16px;background:var(--surface);border-radius:var(--r-large)}
+.term-group li a{color:var(--link);font:600 18px/1.3 var(--text);text-decoration:none}
+.term-group li a:hover{text-decoration:underline;text-underline-offset:3px}
+.term-group li .term-en{display:block;font-size:15px;font-weight:400;color:var(--soft)}
+.term-group li p{margin:6px 0 0;font-size:16px;line-height:1.45;color:var(--ink)}
+.glossary-about{margin:0 0 20px;padding:4px 20px;background:var(--surface);border-radius:var(--r-large)}
+.glossary-about>summary{padding:14px 0;cursor:pointer;font:600 18px/1.3 var(--text);color:var(--ink)}
+.glossary-about .article-style>.btn-group:first-child{display:none}
+/* A term page leads with its definition in a tinted panel; credits are a quiet line at the end. */
+.glossary-layout .article-style .term-definition{margin:6px 0 18px;padding:18px 22px;background:var(--edu-bg);border:0;border-radius:var(--r-large)}
+.glossary-layout .article-style .term-definition p{margin:0;font-size:20px;line-height:1.55}
+.glossary-layout .article-style .term-definition .term-definition-label{margin:0 0 6px;color:var(--edu);font:600 15px/1.3 var(--text)}
+.glossary-layout .article-style .term-credit{margin:0 0 4px;font-size:16px;color:var(--soft)}
+.glossary-layout .article-style .term-credit b{font-weight:600;color:var(--ink)}
+.glossary-layout .article-style .term-credit:first-of-type{margin-top:18px}
+.glossary-count{margin:8px 0 0;font-size:16px;color:var(--soft)}
+.glossary-count:empty{display:none}
+/* The letters stay in reach while the terms scroll by. */
+.glossary-tools{position:sticky;top:0;z-index:5;padding:6px 0 4px;background:var(--page);border-bottom:1px solid var(--line)}
+.glossary-letters a.is-empty{opacity:.35;pointer-events:none}
+/* Related terms as chips: linked where the term has a page, plain where it has none yet. */
+.glossary-layout .article-style .term-related a{color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.glossary-layout .article-style .term-credit{color:var(--ink)}
+/* On a phone the hub's terms are compact rows with two lines of definition, and a term's definition panel is lighter. */
+@media(max-width:760px){
+  .term-group ul{gap:8px}
+  .term-group li{padding:10px 14px}
+  .term-group li p{display:-webkit-box;-webkit-line-clamp:2;-webkit-box-orient:vertical;overflow:hidden;margin-top:4px;font-size:15px}
+  .glossary-layout .article-style .term-definition{padding:14px 16px}
+  .glossary-layout .article-style .term-definition p{font-size:18px}
+}
+/* On a phone the languages and the letters are one row each, scrolled sideways, so the terms start in the first screen. */
+@media(max-width:760px){
+  .glossary-hub .glossary-languages,.glossary-letters{flex-wrap:nowrap;overflow-x:auto;scrollbar-width:thin;padding-bottom:6px}
+  .glossary-hub .glossary-languages a,.glossary-letters a{flex:none}
+  .glossary-find{margin-top:18px}
+  .glossary-find label{font-size:21px}
+}
+/* Related terms on their own row under the label; those without a page of their own are muted chips. */
+.glossary-layout .article-style .term-unlinked{color:var(--ink)}
+.glossary-search-row{display:flex;gap:8px;align-items:center}
+.glossary-search-row input{flex:1}
+.glossary-clear{flex:none;padding:10px 16px;border:1.5px solid var(--ink);border-radius:999px;background:#fff;color:var(--ink);font:600 16px/1.2 var(--text);cursor:pointer}
+.glossary-clear[hidden]{display:none}
+.term-group{scroll-margin-top:200px}
+@media(max-width:760px){.glossary-tools .glossary-find label{font-size:17px;margin-bottom:6px}.glossary-find{margin-top:10px}.term-group{scroll-margin-top:150px}}
+.glossary-language-select{display:none}
+@media(max-width:760px){
+  .glossary-hub .glossary-languages{display:none}
+  .glossary-language-select{display:flex;align-items:center;gap:10px;margin:14px 0 0;font:600 16px/1.3 var(--text)}
+  .glossary-language-select select{flex:1;padding:9px 12px;border:1.5px solid var(--ink);border-radius:var(--r-small);background:#fff;font:400 16px/1.3 var(--text);color:var(--ink)}
+}
+/* Two lines of definition per term on every screen, so each letter reads as an even block. */
+.term-group li p{display:-webkit-box;-webkit-line-clamp:2;-webkit-box-orient:vertical;overflow:hidden}
+main:lang(ar) .glossary-layout .article-style .term-definition p{font-size:21px}
+.term-filter-status{margin:4px 0 0;font-size:15px;color:var(--soft)}
+.term-filter-status:empty{display:none}
+.term-filter-clear{align-self:flex-start;margin:4px 0 8px;padding:4px 12px;border:1.5px solid var(--ink);border-radius:999px;background:#fff;font:600 15px/1.3 var(--text);color:var(--ink);cursor:pointer}
+.term-filter-clear[hidden]{display:none}
+/* On a phone the list of terms sits in a disclosure right after the definition (site.js). */
+.term-finder{margin:0 0 18px;background:var(--surface);border-radius:var(--r-large)}
+.term-finder>summary{padding:12px 16px;cursor:pointer;font:600 17px/1.3 var(--text);color:var(--link)}
+.term-finder .glossary-card{position:static;max-height:none;margin:0;background:none;padding:0 16px 14px}
+.term-finder .glossary-card>h2{display:none}
+.term-finder .term-list{max-height:50vh;overflow-y:auto}
+.glossary-hub .standfirst a{text-decoration:underline;text-underline-offset:3px}
+.glossary-view{flex:none;display:inline-flex;border:1.5px solid var(--line);border-radius:999px;background:#fff;overflow:hidden}
+.glossary-view button{padding:10px 14px;border:0;background:transparent;color:var(--ink);font:600 16px/1.2 var(--text);cursor:pointer}
+.glossary-view button[aria-pressed="true"]{background:var(--ink);color:#fff}
+.glossary-view[hidden]{display:none}
+/* List view: one row per term, its definition on one line beside or under it. */
+.term-grid.is-list .term-group ul{grid-template-columns:minmax(0,1fr);gap:0}
+.term-grid.is-list .term-group li{padding:8px 4px;background:none;border-radius:0;border-bottom:1px solid var(--line);display:grid;grid-template-columns:minmax(0,280px) minmax(0,1fr);gap:4px 20px;align-items:baseline}
+.term-grid.is-list .term-group li p{margin:0;-webkit-line-clamp:1}
+@media(max-width:760px){.term-grid.is-list .term-group li{grid-template-columns:minmax(0,1fr)}}
+@media(max-width:760px){.glossary-search-row{flex-wrap:wrap}.glossary-search-row input{flex-basis:100%}}
+.glossary-letters a.is-current{background:var(--ink);color:#fff}
+.term-filter-label{display:block;margin:0 0 6px;font:600 16px/1.3 var(--text);color:var(--ink)}
+/* Arabic term pages: each breadcrumb step and each link is isolated, so an English name or a URL keeps its own
+   order and its brackets inside right-to-left text. */
+main:lang(ar) .crumbs a,main:lang(ar) .crumbs [aria-current]{unicode-bidi:isolate}
+main:lang(ar) .glossary-layout .article-style a{unicode-bidi:plaintext}
+/* A contributor's name is never split across lines. */
+.glossary-layout .term-credit bdi.term-name{white-space:nowrap}
diff --git a/assets/css/doors/home.css b/assets/css/doors/home.css
new file mode 100644
index 00000000000..2ae425bc2a5
--- /dev/null
+++ b/assets/css/doors/home.css
@@ -0,0 +1,204 @@
+/* The home page. Loaded only there, so the short class names from the mock cannot reach anything
+   else. Lists and paragraphs are reset here because the theme's global rules still apply. */
+.hero{position:relative;isolation:isolate;border-bottom:12px solid var(--edu-bg)}
+.hero-grid{display:grid;grid-template-columns:minmax(0,1.1fr) minmax(0,1fr);gap:48px;align-items:end;padding-top:12px}
+.invite{padding:32px 0 28px;min-width:0;align-self:center}
+.hero h1{font-size:clamp(50px,6.2vw,92px);line-height:1;font-weight:500;letter-spacing:-.018em;margin:0;overflow-wrap:anywhere;text-wrap:balance}
+.lede{font-size:clamp(18px,1.45vw,20px);line-height:1.55;margin:24px 0 0;max-width:32em;color:var(--ink)}
+.quick{display:flex;flex-wrap:wrap;gap:8px;margin-top:24px;max-width:720px}
+.quick a{padding:8px 14px;border:1.5px solid var(--edu);border-radius:999px;font-weight:600;font-size:16px;line-height:1.3;text-decoration:none;background:#fff;color:var(--ink)}
+.quick a:hover{background:var(--edu);border-color:var(--edu);color:#fff}
+.tower{margin:0;position:relative;min-width:0;background:var(--edu-bg);border-radius:999px 999px 0 0;padding:28px 32px 14px;max-width:560px;justify-self:end;width:100%}
+.castle-stage{position:relative;height:clamp(320px,31vw,410px)}
+.castle-stage canvas,.castle-fallback{display:block;width:100%;height:100%;max-width:none;object-fit:cover}
+.castle-stage canvas{position:absolute;inset:0;visibility:hidden}
+.castle-stage[data-engine=webgl] canvas{visibility:visible}
+.castle-stage[data-engine=webgl] .castle-fallback{visibility:hidden}
+/* Out of sight until a pointer, keyboard focus or a tap reaches it, so nothing sits beside
+   the tower. It does nothing until the 3D castle is running. */
+.motion-bar{position:absolute;left:50%;bottom:8px;transform:translateX(-50%);z-index:3;display:flex;align-items:center;gap:8px;width:max-content}
+[data-motion-host]:not(:hover):not(:focus-within):not(.show-motion-control) :is(.motion-toggle,.tower-entry){position:absolute;width:1px;height:1px;padding:0;border:0;overflow:hidden;clip-path:inset(50%);white-space:nowrap}
+/* A finger counts as hovering from the moment it touches, which would reveal a button under that
+   finger and send the tap to it. On touch screens only a finished tap reveals these buttons. */
+@media(hover:none){[data-motion-host]:not(:focus-within):not(.show-motion-control) :is(.motion-toggle,.tower-entry){position:absolute;width:1px;height:1px;padding:0;border:0;overflow:hidden;clip-path:inset(50%);white-space:nowrap}}
+.motion-toggle,.tower-entry{background:#fff;border:1.5px solid var(--ink);border-radius:999px;font-weight:600;font-size:15px;line-height:1.3;color:var(--ink);cursor:pointer;white-space:nowrap}
+.tower-entry{padding:7px 12px}
+/* The icon carries the meaning on screen. The words stay in the button for screen readers. */
+.motion-toggle{position:relative;width:36px;height:36px;padding:0;overflow:hidden;text-indent:44px}
+.motion-toggle::before{content:"";position:absolute;left:50%;top:50%;width:11px;height:13px;transform:translate(-50%,-50%);border-inline:3.5px solid currentColor}
+.motion-toggle.is-paused::before{width:0;height:0;margin-left:1px;border-block:7px solid transparent;border-inline:0;border-left:11px solid currentColor}
+@media(hover:hover){.motion-toggle:hover,.tower-entry:hover{background:var(--ink);color:#fff}}
+@media(pointer:coarse){.motion-toggle{width:44px;height:44px}.tower-entry{min-height:44px;padding-block:0;padding-inline:14px}}
+.castle-stage[data-engine=fallback]+.motion-bar{display:none}
+
+
+/* The four areas, each behind its arched door */
+.areas-section{padding-top:0}
+.areas{display:grid;grid-template-columns:repeat(4,minmax(0,1fr));gap:22px;padding-top:40px}
+.area{--tone:var(--edu);--tint:var(--edu-bg);display:flex;flex-direction:column;min-width:0;background:var(--tint);border-radius:999px 999px var(--r-large) var(--r-large);padding:0 22px 20px}
+.area-res{--tone:var(--res);--tint:var(--res-bg)}
+.area-jus{--tone:var(--jus);--tint:var(--jus-bg)}
+.area-com{--tone:var(--com);--tint:var(--com-bg)}
+.area-plate{position:relative;height:clamp(176px,14.5vw,208px);min-height:0}
+.area-plate img{position:absolute;inset:24% 11% 2%;width:78%;height:74%;max-width:none;object-fit:contain}
+.area-body{display:flex;flex-direction:column;flex:1;padding-top:12px}
+.area h3{font-size:clamp(26px,2.1vw,31px);line-height:1.12;color:var(--tone);min-height:2.3em;margin:0;overflow-wrap:anywhere}
+.area-body>p{margin:8px 0 0;font-size:16px;line-height:1.5}
+.area ul{list-style:none;margin:auto 0 0;padding:14px 0 0}
+.area li a{display:block;padding:7px 0;font-size:17px;line-height:1.35;color:var(--ink);text-decoration:underline;text-decoration-color:color-mix(in srgb,var(--tone) 45%,transparent);text-underline-offset:3px}
+.area li a:hover{color:var(--tone);text-decoration-color:currentColor}
+
+/* Topic buttons */
+.topics-section{padding-top:64px}
+.topics-section h2,.board h2{font-size:clamp(32px,3.2vw,46px);line-height:1.12;margin:0}
+.section-note{margin:8px 0 0}
+.topics{display:flex;flex-wrap:wrap;gap:10px;list-style:none;margin:22px 0 0;padding:0}
+.topic{display:inline-block;padding:10px 16px;background:var(--edu-bg);color:var(--ink);border-radius:999px;font-weight:600;font-size:16px;line-height:1.3;text-decoration:none}
+.topic:hover{background:var(--edu);color:#fff}
+
+/* Noticeboard and ways to take part */
+/* The news spans both rows; the second row takes up the extra height, so the sign-up sits
+   straight under "Take part" whatever the length of the news. */
+.board{display:grid;grid-template-columns:minmax(0,3fr) minmax(0,2fr);grid-template-rows:auto 1fr;gap:28px 64px;padding-top:80px}
+.notices{grid-row:1/span 2}
+.notice-card{margin-top:24px;background:var(--surface);border-radius:var(--r-large);padding:6px 24px}
+.notice-list{list-style:none;margin:0;padding:0}
+.notice-list li+li{border-top:1.5px solid var(--line)}
+.notice-list a{display:grid;grid-template-columns:150px minmax(0,1fr);column-gap:24px;padding:18px 0;color:inherit;text-decoration:none}
+.notice-list a:hover h3{text-decoration:underline;text-underline-offset:4px;color:var(--link)}
+.notice-list time{grid-column:1;font-weight:600;font-size:15px;line-height:1.5;padding-top:4px}
+.notice-kind{grid-column:1;grid-row:2;justify-self:start;align-self:start;margin-top:4px;padding:1px 9px;background:#fff;border-radius:var(--r-small);font-size:15px;font-weight:600;line-height:1.5}
+.notice-list h3{grid-column:2;grid-row:1;font-size:24px;line-height:1.12;margin:0}
+.notice-list p{grid-column:2;grid-row:2;margin:5px 0 0;font-size:16px;line-height:1.5}
+.board-foot{margin:0;padding:16px 0 20px;border-top:1.5px solid var(--line);font-size:16px}
+.home-newsletter{grid-column:2;align-self:start}
+.home-newsletter h3{font:var(--display-weight) 21px/1.2 var(--display);margin:0}
+.home-newsletter>p{margin:3px 0 12px;font-size:16px;line-height:1.5}
+.standing-list{list-style:none;margin:24px 0 0;padding:0}
+.standing-list a{display:block;padding:12px 0;color:inherit;text-decoration:none}
+.standing-list strong{display:block;font:var(--display-weight) 21px/1.2 var(--display);color:var(--link);text-decoration:underline;text-decoration-thickness:1.5px;text-underline-offset:4px;text-decoration-color:transparent}
+.standing-list a:hover strong{text-decoration-color:currentColor}
+.standing-list span{display:block;margin-top:3px;font-size:16px;line-height:1.5}
+
+/* The band: quotes, statement, FORWARD and figures */
+.about{display:grid;grid-template-columns:minmax(0,1fr) minmax(0,1fr);gap:40px 64px;padding:80px 0 32px}
+.about-statement{grid-column:1/-1;max-width:980px}
+.about-statement>p{margin:6px 0 16px;font-size:18px;max-width:32em}
+.quotes{margin:0}
+.quote-stage{display:grid}
+.quote{grid-area:1/1;margin:0;font:var(--display-weight) clamp(34px,4.2vw,60px)/1.08 var(--display);color:var(--ink);overflow-wrap:anywhere;text-wrap:balance;opacity:0;visibility:hidden;transition:opacity .4s,visibility 0s .4s}
+.quote.is-active{opacity:1;visibility:visible;transition:opacity .4s}
+.quote .accent{color:var(--edu)}
+.quotes-bar{min-height:44px;padding-top:8px;text-align:start}
+.forward{padding:28px 30px;background:var(--surface);border-radius:var(--r-large)}
+.forward h3{font-size:clamp(25px,2.2vw,31px);line-height:1.12;margin:0}
+.forward p{margin:12px 0 0;font-size:16px;line-height:1.55;max-width:32em}
+.forward .forward-links{display:flex;flex-wrap:wrap;gap:8px 24px;max-width:none}
+.ledger{display:grid;grid-template-columns:repeat(2,minmax(0,1fr));gap:12px;align-content:start;list-style:none;margin:0;padding:0}
+.ledger a{display:flex;flex-direction:column;gap:6px;height:100%;box-sizing:border-box;padding:18px 20px;border:1.5px solid var(--line);border-radius:var(--r-large);color:var(--ink);text-decoration:none}
+.ledger strong{font:var(--display-weight) clamp(30px,2.8vw,40px)/1 var(--display);color:var(--ink)}
+.ledger span{font-size:16px;line-height:1.4}
+.ledger a:hover{border-color:var(--link)}
+.ledger a:hover strong{color:var(--link)}
+
+@media(max-width:1240px){
+  .castle-stage{height:clamp(320px,34vw,400px)}
+  .areas{grid-template-columns:repeat(2,minmax(0,1fr))}
+  .area-plate{height:190px}
+  .area h3{min-height:0}
+  .board{gap:44px}
+}
+@media(max-width:1000px){
+  .board{grid-template-columns:1fr;grid-template-rows:none;row-gap:44px}
+  .notices{grid-row:auto}
+  .home-newsletter{grid-column:auto}
+  .standing-list{display:grid;grid-template-columns:repeat(2,minmax(0,1fr));column-gap:28px}
+  .about{grid-template-columns:minmax(0,1fr)}
+}
+@media(max-width:760px){
+  .hero-grid{grid-template-columns:1fr;gap:0}
+  .invite{padding:18px 0 0}
+  .hero h1{font-size:clamp(42px,12.4vw,54px)}
+  .lede{font-size:17px;margin-top:16px}
+  .quick{margin-top:18px}
+  .quick a{padding:8px 12px;font-size:15px}
+  /* The extra room at the foot of the door keeps the 44 px buttons off the tower. */
+  .tower{padding:18px 12px 58px;max-width:270px;justify-self:center;margin-top:16px}
+  .castle-stage{height:150px}
+  .hero{border-bottom-width:8px}
+  .areas{grid-template-columns:1fr;gap:12px;padding-top:18px}
+  .area{display:grid;grid-template-columns:78px minmax(0,1fr);column-gap:14px;padding:14px;border-radius:var(--r-large)}
+  .area-plate{height:92px;align-self:start;background:#ffffffb0;border-radius:999px 999px 0 0}
+  .area-plate img{inset:14px 8px 2px;width:calc(100% - 16px);height:calc(100% - 16px)}
+  .area-body{display:block;padding-top:0}
+  .area h3{font-size:23px}
+  .area-body>p{margin-top:5px}
+  .area ul{padding-top:6px}
+  /* Only with script, which sets .js above the areas: without it every link stays in view. */
+  .js .area li:nth-child(n+3):not(.area-more){display:none}
+  .js .area.is-open li:nth-child(n+3){display:list-item}
+  .js .area.is-open li.area-more{display:none}
+  .area-more button{margin:2px 0 0;padding:8px 0;text-align:left;background:none;border:0;color:var(--ink);font:600 16px/1.3 var(--text);text-decoration:underline;text-underline-offset:3px;cursor:pointer}
+  .area li a{padding:8px 0;font-size:16px}
+  .board{gap:44px;padding-top:56px}
+  .standing{grid-row:1}
+  .notices{grid-row:2}
+  .notice-card{padding:4px 16px}
+  .notice-list a{display:flex;flex-wrap:wrap;align-items:center;gap:4px 10px;padding:14px 0}
+  .notice-list time{padding:0}
+  .notice-kind{margin:0}
+  .notice-list h3{flex:0 0 100%;font-size:22px}
+  .notice-list p{flex:0 0 100%;margin-top:0}
+  .standing-list{grid-template-columns:1fr}
+  .standing-list a{padding:9px 0}
+  .topics-section{padding-top:44px}
+  .topics{gap:8px;margin-top:16px}
+  .topic{padding:9px 12px;font-size:15px}
+  .about{padding:56px 0 28px}
+  .quote{font-size:34px}
+  .forward{padding:22px 20px}
+}
+
+.area-more{display:none}
+@media(max-width:760px){.js .area-more{display:list-item}}
+/* The statement band on a wide screen: the quote on the left, what FORRT is and the mission link beside it. */
+@media(min-width:1001px){
+  .about-statement{display:grid;grid-template-columns:minmax(0,1.35fr) minmax(0,1fr);column-gap:56px;align-items:end;max-width:none}
+  .about-statement .quotes{grid-column:1;grid-row:1 / span 2}
+  .about-statement>p,.about-statement>.more{grid-column:2}
+  .about-statement>p{margin-top:0}
+  .about-statement>.more{justify-self:start;margin-bottom:52px}
+}
+.ledger strong{white-space:nowrap}
+/* The first hero link is the main task, filled; the others stay as outlines. */
+.quick a:first-child{background:var(--edu);border-color:var(--edu);color:#fff}
+.quick a:first-child:hover{background:var(--ink);border-color:var(--ink)}
+/* The second line under the hero actions: plain links, on wide screens only. */
+.quick-more{display:flex;flex-wrap:wrap;gap:4px 22px;margin-top:10px}
+.quick-more a{padding:6px 0;font-weight:600;font-size:16px;line-height:1.3;color:var(--ink);text-decoration:underline;text-underline-offset:3px}
+.quick-more a:hover{color:var(--edu)}
+@media(max-width:760px){.quick-more{display:none}}
+@media(max-width:760px){.tower{max-width:200px}.castle-stage{height:120px}}
+
+/* Noticeboard thumbnails: each news row leads with a small crop of the post's featured image, or a
+   tile in its category's tint, beside the date and category, title and an excerpt of two lines.
+   The rules above set the older two-column layout; these replace it on every screen width. */
+.notice-list a{display:grid;grid-template-columns:88px minmax(0,1fr);grid-template-rows:auto auto 1fr;column-gap:20px;align-items:start;padding:18px 0}
+.notice-thumb{grid-column:1;grid-row:1/span 3;display:block;width:88px;height:66px;margin-top:4px;object-fit:cover;border-radius:var(--r-small);background:var(--page)}
+.notice-tile{display:grid;place-items:center;background:var(--res-bg);color:var(--res);font:var(--display-weight) 34px/1 var(--display)}
+.notice-tile-newsletter{background:var(--com-bg);color:var(--com)}
+.notice-tile-opportunity{background:var(--edu-bg);color:var(--edu)}
+.notice-tile-milestone{background:var(--jus-bg);color:var(--jus)}
+.notice-meta{grid-column:2;grid-row:1;display:flex;flex-wrap:wrap;align-items:center;gap:4px 10px}
+.notice-list time{padding:0}
+.notice-kind{margin:0}
+.notice-list h3{grid-column:2;grid-row:2;margin:2px 0 0}
+.notice-list p{grid-column:2;grid-row:3;margin:5px 0 0;display:-webkit-box;-webkit-box-orient:vertical;-webkit-line-clamp:2;line-clamp:2;overflow:hidden}
+@media(max-width:760px){
+  /* The thumbnail sits beside the date and title; the excerpt takes the full width below. */
+  .notice-list a{grid-template-columns:64px minmax(0,1fr);grid-template-rows:auto 1fr auto;gap:0 12px;padding:14px 0}
+  .notice-thumb{grid-row:1/span 2;width:64px;height:48px;margin-top:2px}
+  .notice-tile{font-size:26px}
+  .notice-list h3{flex:none}
+  .notice-list p{flex:none;grid-column:1/-1;margin-top:6px}
+}
diff --git a/assets/css/doors/hub.css b/assets/css/doors/hub.css
new file mode 100644
index 00000000000..c6da252a97d
--- /dev/null
+++ b/assets/css/doors/hub.css
@@ -0,0 +1,51 @@
+/* The Replication Hub. Loaded only on /replication-hub/. */
+.heading-plate-plain{margin:0;justify-self:end;width:100%;max-width:400px}
+.heading-plate-plain img{display:block;width:100%;height:auto}
+@media(max-width:760px){.heading-plate-plain{display:none}}
+.stage-jumps{display:none;--tone:#44598c}
+@media(max-width:760px){
+  .stage-jumps{display:flex;flex-wrap:wrap;gap:8px;margin:0 0 20px}
+  .stage-jump{padding:8px 16px;border:1.5px solid var(--tone);border-radius:999px;background:#fff;color:var(--tone);font:600 16px/1.3 var(--text);text-decoration:none}
+  .stage-jump:hover{background:var(--tone);color:#fff}
+  .stage h2{scroll-margin-top:16px}
+}
+.heading-plate-research{background:var(--res-bg)}
+
+@media(max-width:760px){.stage-jumps{display:grid;grid-template-columns:repeat(2,minmax(0,1fr))}.stage-jump{text-align:center}}
+
+/* Start here: four bricks in the stage colours, joined into one course on a wide screen. */
+.hub-start{margin:0 0 40px}
+.hub-start h2{margin:0 0 4px;font:500 28px/1.2 var(--display)}
+.hub-start .action-cards li:nth-child(1){--tone:#44598c}.hub-start .action-cards li:nth-child(2){--tone:#25705f}
+.hub-start .action-cards li:nth-child(3){--tone:#a34a0c}.hub-start .action-cards li:nth-child(4){--tone:#7a5c3d}
+/* Joined into one course once all four fit on a line; until then they keep a row gap for their studs. */
+@media(min-width:1001px){.hub-start.hub-start .action-cards{gap:0 4px}}
+
+/* Stages: open sections under a rule in the stage colour, each tool a ruled row whose whole width is
+   the link (a stretched link), so it is a full-size target on a phone. Set like a contents page. */
+.stage{--tone:#44598c;--tint:#eef0f5;min-width:0;border-top:5px solid var(--tone);padding-top:12px}
+.stage-explore{--tone:#25705f;--tint:#ebf2f1}.stage-conduct{--tone:#a34a0c;--tint:#f7efe9}.stage-disseminate{--tone:#7a5c3d;--tint:#f3f0ee}
+.stages{display:grid;grid-template-columns:1fr;gap:40px}
+@media(min-width:1001px){.stages{display:block;columns:2;column-gap:56px}.stage{break-inside:avoid;margin:0 0 44px}}
+.stage header{display:flex;flex-wrap:wrap;align-items:baseline;gap:4px 16px}
+.stage h2{margin:0;font:500 34px/1.1 var(--display);color:var(--tone);scroll-margin-top:16px;overflow-wrap:anywhere}
+.stage header p{margin:0;font-size:17px;line-height:1.4;color:var(--soft)}
+.stage ul{list-style:none;margin:10px 0 0;padding:0}
+.tool{position:relative;display:grid;grid-template-columns:7.5rem minmax(0,1fr);column-gap:16px;padding:12px 8px;border-bottom:1px solid var(--line)}
+.tool p.tool-format{grid-column:1;grid-row:1/span 2;margin:0;padding-top:5px;font:600 15px/1.3 var(--text);color:var(--soft)}
+.tool h3{grid-column:2;margin:0;font:500 21px/1.25 var(--display);overflow-wrap:anywhere}
+.tool h3 a{color:var(--ink);text-decoration:underline;text-decoration-color:var(--tone);text-decoration-thickness:1px;text-underline-offset:3px}
+.tool h3 a::after{content:"";position:absolute;inset:0}
+.tool p:not(.tool-format){grid-column:2;margin:2px 0 0;font-size:16px;line-height:1.45}
+.tool:hover{background:var(--tint)}
+.tool:hover h3 a{text-decoration-thickness:2px}
+.tool:focus-within{outline:3px solid var(--ink);outline-offset:2px;background:var(--tint)}
+.tool h3 a:focus-visible{outline:none}
+/* Each stage's starting point keeps its emphasis as a title in the stage colour. */
+.tool:first-child h3 a{color:var(--tone)}
+@media(max-width:600px){
+  .tool{grid-template-columns:1fr;padding:12px 4px}
+  .tool p.tool-format,.tool h3,.tool p:not(.tool-format){grid-column:1;grid-row:auto}
+  .tool p.tool-format{padding:0;margin:0 0 2px}
+}
+@media(prefers-reduced-motion:no-preference){.tool{transition:background-color .15s}}
diff --git a/assets/css/doors/icons.css b/assets/css/doors/icons.css
new file mode 100644
index 00000000000..dcc747da4c1
--- /dev/null
+++ b/assets/css/doors/icons.css
@@ -0,0 +1,10 @@
+/* Generated by scripts/rebrand/build_fonts.py --icons: Font Awesome Free 6.7.2 (fonts OFL 1.1,
+   code MIT), subset to the icons the site uses. */
+@font-face{font-family:'Doors Icons brands';src:url(../fonts/doors/icons-brands.woff2) format('woff2');font-weight:400;font-display:block}
+.fab,.fa-brands{font-family:'Doors Icons brands';font-weight:400}
+@font-face{font-family:'Doors Icons solid';src:url(../fonts/doors/icons-solid.woff2) format('woff2');font-weight:900;font-display:block}
+.fa,.fas,.fa-solid{font-family:'Doors Icons solid';font-weight:900}
+@font-face{font-family:'Doors Icons regular';src:url(../fonts/doors/icons-regular.woff2) format('woff2');font-weight:400;font-display:block}
+.far,.fa-regular{font-family:'Doors Icons regular';font-weight:400}
+.fab,.fa-brands,.fa,.fas,.fa-solid,.far,.fa-regular{display:inline-block;line-height:1;-webkit-font-smoothing:antialiased;text-rendering:auto}
+.fa-angle-right::before{content:"\f105"}.fa-arrow-alt-circle-right::before{content:"\f35a"}.fa-arrow-right::before{content:"\f061"}.fa-arrow-up::before{content:"\f062"}.fa-bars::before{content:"\f0c9"}.fa-bluesky::before{content:"\e671"}.fa-book::before{content:"\f02d"}.fa-book-open::before{content:"\f518"}.fa-brain::before{content:"\f5dc"}.fa-chart-line::before{content:"\f201"}.fa-chevron-down::before{content:"\f078"}.fa-chevron-right::before{content:"\f054"}.fa-envelope::before{content:"\f0e0"}.fa-external-link-alt::before{content:"\f35d"}.fa-facebook::before{content:"\f09a"}.fa-file-alt::before{content:"\f15c"}.fa-file-pdf::before{content:"\f1c1"}.fa-flask::before{content:"\f0c3"}.fa-folder::before{content:"\f07b"}.fa-github::before{content:"\f09b"}.fa-globe::before{content:"\f0ac"}.fa-graduation-cap::before{content:"\f19d"}.fa-heart::before{content:"\f004"}.fa-instagram::before{content:"\f16d"}.fa-layer-group::before{content:"\f5fd"}.fa-lightbulb::before{content:"\f0eb"}.fa-link::before{content:"\f0c1"}.fa-linkedin::before{content:"\f08c"}.fa-mastodon::before{content:"\f4f6"}.fa-orcid::before{content:"\f8d2"}.fa-play::before{content:"\f04b"}.fa-project-diagram::before{content:"\f542"}.fa-redo::before{content:"\f01e"}.fa-search::before{content:"\f002"}.fa-share-alt::before{content:"\f1e0"}.fa-slack::before{content:"\f198"}.fa-star::before{content:"\f005"}.fa-times::before{content:"\f00d"}.fa-times-circle::before{content:"\f057"}.fa-twitter::before{content:"\f099"}.fa-user::before{content:"\f007"}.fa-users::before{content:"\f0c0"}.fa-youtube::before{content:"\f167"}
diff --git a/assets/css/doors/inner.css b/assets/css/doors/inner.css
new file mode 100644
index 00000000000..2e0ba96712a
--- /dev/null
+++ b/assets/css/doors/inner.css
@@ -0,0 +1,63 @@
+/* Bridge for pages not redesigned yet: the theme's components in Doors colours and type,
+   so they sit inside the new shell. Each page group replaces this in its own phase. */
+.btn-primary{background:var(--link);border-color:var(--link);color:#fff}
+.btn-primary:hover,.btn-primary:focus{background:var(--ink);border-color:var(--ink);color:#fff}
+.btn-outline-primary{color:var(--link);border-color:var(--link);background:transparent}
+.btn-outline-primary:hover{background:var(--link);border-color:var(--link);color:#fff}
+.home-section,.docs-content,.article,.universal-wrapper{background:transparent}
+/* The theme fixes this at 1000 px from a 1001 px screen, wider than its padded parent. */
+.universal-wrapper{max-width:100%}
+/* The theme's sidebar, contents and article columns add up to 13 of 12, so the article takes what is left. */
+@media(min-width:1200px){.docs-sidebar~.docs-content{flex:1 1 0;max-width:none;min-width:0}}
+code,pre,kbd,samp{font-style:normal}
+
+/* Cookie banner: same library and wording, in Doors colours. */
+.cc-window.cc-window{max-height:100vh;overflow-y:auto;background:var(--ink);color:var(--page);font-family:var(--text);font-size:16px;line-height:1.5}
+.cc-window .cc-link,.cc-window .cc-link:hover,.cc-window .cc-link:visited{color:var(--page);opacity:1}
+.cc-window.cc-window .cc-btn,.cc-window.cc-window .cc-btn:focus{background:var(--hot);color:var(--ink);border:0;border-radius:999px;font-weight:700;font-size:15px;text-decoration:none}
+.cc-window.cc-window .cc-btn:hover{background:var(--page);color:var(--ink);text-decoration:none}
+
+/* An embed from another site, loaded when a visitor asks (layouts/partials/click_to_load.html). */
+.click-to-load{display:flex;flex-direction:column;align-items:center;justify-content:center;gap:10px;min-height:12rem;margin:0 0 18px;padding:24px;overflow:auto;background:var(--surface);border:1px solid var(--line);border-radius:var(--r-small);text-align:center}
+.click-to-load p{max-width:34rem;margin:0;font-size:16px;line-height:1.45}
+.click-to-load-link{font-size:16px}
+/* A lesson activity in a small frame on a phone is too small to use, so there it opens on the provider's site. */
+@media(max-width:760px){
+  .click-to-load[style*="absolute"]:not([data-embed-src*="youtube"]) button{display:none}
+  .click-to-load[style*="absolute"]:not([data-embed-src*="youtube"]) .click-to-load-link{padding:8px 18px;background:var(--link);border-radius:999px;color:#fff;font-weight:600;text-decoration:none}
+}
+/* The flipbook's page count, in its own toolbar. */
+label[for=df_book_page_number]{color:var(--ink)!important;opacity:1!important}
+/* Lesson activities sit in a fixed-ratio box meant for the frame. Until it loads, the panel sets its own height. */
+.click-to-load[style*="absolute"]{position:static!important;width:auto!important;height:auto!important}
+:has(>.click-to-load[style*="absolute"]){height:auto!important;padding:0!important;overflow:visible!important}
+
+/* Author card and its social links. The card's name is an h2 under the article and elsewhere. */
+.author-card{display:flex;align-items:flex-start;gap:14px;margin:0 0 20px}
+.author-card .avatar{flex:none;width:64px;height:64px;border-radius:50%;object-fit:cover;margin:0}
+.author-card .avatar-square{border-radius:var(--r-small)}
+.author-card .media-body{min-width:0}
+.author-card .card-title{font-size:21px;line-height:1.2;margin:0 0 4px}
+.author-card .card-title a{color:inherit}
+ul.network-icon{display:flex;flex-wrap:wrap;gap:6px 10px;margin:6px 0 0;padding:0;list-style:none}
+ul.network-icon li{margin:0}
+ul.network-icon a{display:inline-flex;align-items:center;justify-content:center;width:24px;height:24px;font-size:18px;color:var(--link)}
+ul.network-icon a:hover{color:var(--ink)}
+.cite-dialog{width:min(640px,calc(100% - 32px));padding:22px;border:0;border-radius:var(--r-large);background:var(--page);color:var(--ink)}
+.cite-dialog::backdrop{background:rgba(38,45,53,.55)}
+.cite-dialog h2{font-size:26px}
+.cite-dialog pre{max-height:50vh;overflow:auto;padding:12px;background:var(--surface);border-radius:var(--r-small)}
+
+/* Forced colours drop backgrounds, so filled buttons need an edge, and the dark logo needs a light plate. */
+@media (forced-colors:active){
+  .head-join,.cc-window.cc-window .cc-btn,.newsletter-submit,.btn,.tower-entry,.motion-toggle{border:2px solid ButtonText!important}
+  .brand img{background:#fff;padding:2px;border-radius:4px;forced-color-adjust:none}
+}
+/* On a phone the consent banner is compact: tighter padding and its two buttons side by side. The wording stays. */
+@media(max-width:760px){
+  .cc-window.cc-window{padding:12px 16px;font-size:15px;line-height:1.4}
+  .cc-window.cc-window .cc-message{margin-bottom:10px}
+  .cc-window.cc-window .cc-compliance{display:flex;gap:8px}
+  /* The plug-in's second-button margin and the 140 px minimum would overflow a 320 px screen. */
+  .cc-window.cc-window .cc-compliance .cc-btn{flex:1 1 0;min-width:0;margin:0;padding:9px 12px}
+}
diff --git a/assets/css/doors/launcher.css b/assets/css/doors/launcher.css
new file mode 100644
index 00000000000..b2bfa122e3f
--- /dev/null
+++ b/assets/css/doors/launcher.css
@@ -0,0 +1,67 @@
+/* The JUST-OS launcher on every page. The chat loads when it is clicked (chatbot.css, just-os-chat.js). */
+#just-os-widget{position:fixed;inset-block-end:calc(20px + var(--banner,0px));inset-inline-end:20px;z-index:900;display:flex;flex-direction:column;align-items:flex-end;font-family:var(--text)}
+#just-os-widget[hidden]{display:none}
+/* The opened chat goes above everything, which its own z-index cannot do from in here. */
+#just-os-widget:has(#just-os-window[style*="flex"]){z-index:10000}
+.just-os-fullpage{position:relative;font-family:var(--text)}
+#just-os-btn{position:relative;z-index:2;display:inline-block;padding:0;background:#fff;border:1.5px solid var(--ink);border-radius:50%;box-shadow:0 1px 4px rgba(38,45,53,.25);cursor:pointer;text-decoration:none;transition:transform .2s ease}
+/* At 1440 px the margin beside .wrap is 80 px, so the button (55 px, 20 px from the edge) clears the page by 5 px.
+   Nothing may reach past it: no growth on hover, a shadow within 4 px, and the focus ring drawn inside. */
+#just-os-btn:focus-visible{outline:3px solid var(--ink);outline-offset:-6px}
+#just-os-img{display:block;width:52px;height:52px;border-radius:50%}
+#just-os-dismiss{position:absolute;top:-6px;inset-inline-end:-6px;z-index:3;width:22px;height:22px;padding:0;background:#fff;border:1.5px solid var(--ink);border-radius:50%;color:var(--ink);font-size:14px;line-height:18px;text-align:center;cursor:pointer;opacity:0;transition:opacity .2s ease}
+#just-os-widget:hover #just-os-dismiss,#just-os-dismiss:focus-visible{opacity:1}
+#just-os-dismiss:hover{background:var(--ink);color:#fff}
+#just-os-bubble{position:absolute;inset-inline-end:64px;top:11px;padding:6px 12px;background:#fff;border:1.5px solid var(--ink);border-radius:999px;color:var(--ink);font-size:15px;font-weight:600;line-height:1.3;white-space:nowrap;opacity:0;transform:translateX(-6px);transition:opacity .25s ease,transform .25s ease;pointer-events:none}
+/* The bubble never covers the page. The invitation shows only where site.js finds empty space under it,
+   and the hover or focus label only where the margin holds it beside the button: from 1800 px, as .wrap is at most 1280 px wide. */
+.bubble-visible{opacity:1!important;transform:none!important}
+@media (min-width:1800px){#just-os-btn:is(:hover,:focus-visible) #just-os-bubble{opacity:1;transform:none}}
+#just-os-widget.is-offline #just-os-img{filter:grayscale(1);opacity:.7}
+#just-os-offline-badge{position:absolute;inset-block-end:-2px;inset-inline-start:-2px;width:22px;height:22px;display:flex;align-items:center;justify-content:center;background:#fff;border:1.5px solid var(--ink);border-radius:50%;color:var(--urgent)}
+#just-os-offline-badge svg{width:14px;height:14px}
+@media(max-width:760px){#just-os-widget{inset-block-end:calc(12px + var(--banner,0px));inset-inline-end:12px}#just-os-img{width:48px;height:48px}#just-os-bubble{inset-inline-end:58px;top:9px;font-size:14px}}
+/* On a touch screen the close control is larger and its tap area is 44 px, reaching past the visible circle. */
+@media(hover:none){
+  #just-os-dismiss{opacity:1;width:28px;height:28px;top:-10px;inset-inline-end:-10px;font-size:18px;line-height:24px}
+  #just-os-dismiss::after{content:"";position:absolute;inset:-8px}
+}
+@media print{#just-os-widget{display:none}}
+
+/* The round button needs 80 px of margin, which the page has from 1440 px (.wrap is at most 1280 px wide).
+   Below that it would sit over text, cards or buttons wherever it rested, so it is a tab in the page's gutter. site.js uses the same width for the invitation. */
+@media (max-width:1439px){
+  #just-os-widget{inset-block-end:calc(16px + var(--banner,0px));inset-inline-end:0}
+  #just-os-btn{display:flex;align-items:center;justify-content:center;width:24px;height:52px;border-inline-end:0;border-radius:12px 0 0 12px}
+  #just-os-btn:hover{transform:none}
+  #just-os-img{width:20px;height:20px}
+  #just-os-dismiss{display:none}
+  #just-os-bubble{inset-inline-end:32px;top:10px}
+  /* The ring stays inside the tab, which an outside ring would take off the screen and over the page. */
+  #just-os-btn:focus-visible{outline-offset:-3px}
+}
+/* Phones have a 20 px margin (base.css), so the tab is 20 px wide and stays off the cards. */
+@media (max-width:760px){
+  #just-os-btn{width:20px}
+  #just-os-img{width:16px;height:16px}
+  #just-os-bubble{inset-inline-end:28px}
+}
+/* Below 1440 px the margin is too narrow to hold the button, so it floats in the bottom corner over the page,
+   as a 48 px round button that is easy to find and press; the footer keeps room under it, so the end of the
+   page is never hidden. (Earlier the tab sat in the margin; reviewers found it too small to read or press.) */
+@media (max-width:1439px){
+  #just-os-widget{inset-block-end:calc(16px + var(--banner,0px) + env(safe-area-inset-bottom,0px));inset-inline-end:16px}
+  #just-os-btn{display:inline-block;width:auto;height:auto;padding:0;background:#fff;border:1.5px solid var(--ink);border-radius:50%;box-shadow:0 2px 8px rgba(38,45,53,.3)}
+  #just-os-btn:hover{background:#fff;border-color:var(--link)}
+  #just-os-img{width:48px;height:48px}
+  #just-os-btn:focus-visible{outline:3px solid var(--ink);outline-offset:2px}
+  #just-os-bubble{inset-inline-end:58px;top:9px}
+  /* A floating button can be dismissed, as on desktop; on touch screens the cross always shows. */
+  #just-os-dismiss{display:block}
+  .site-foot{padding-bottom:88px}
+}
+/* At 400% zoom a full-size launcher would cover a third of the screen. Last, so the sizes above do not undo it. */
+@media (max-height:420px){
+  #just-os-img{width:38px;height:38px}
+  #just-os-bubble{display:none}
+}
diff --git a/assets/css/doors/lists.css b/assets/css/doors/lists.css
new file mode 100644
index 00000000000..df6b4a8ee63
--- /dev/null
+++ b/assets/css/doors/lists.css
@@ -0,0 +1,135 @@
+/* List pages: the simple list, news cards, tags and the newsletter archive. */
+.news-page,.tags-page{padding:32px 0 40px}
+.news-page .article-head h1,.tags-page h1,.nla-page h1{font-size:clamp(36px,4.2vw,58px);line-height:1.06;letter-spacing:-.01em;margin:0 0 12px}
+.news-page .crumbs,.tags-page .crumbs,.nla-page .crumbs{margin-bottom:18px}
+.news-page .article-style{max-width:32em;margin-bottom:18px}
+.news-page .standfirst,.tags-page .standfirst{font:500 clamp(19px,1.6vw,22px)/1.35 var(--display);max-width:32em}
+.list-count{margin:0 0 18px;font-size:18px}
+.list-count a{color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.plain-list{margin:0;padding:0;list-style:none;font-size:20px;line-height:1.35}
+.plain-list li{padding:6px 0;border-bottom:1px solid var(--line)}
+.plain-list a{color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.list-items{display:grid;gap:18px;margin-top:8px}
+.list-item{padding:0 0 18px;border-bottom:1px solid var(--line)}
+.article-layout-wide .list-count{max-width:580px}
+.article-layout-wide .list-items{grid-template-columns:repeat(auto-fill,minmax(min(100%,420px),1fr));gap:24px 40px}
+.article-layout-wide .list-summary{max-width:36em}
+@media(min-width:1001px){.article-layout-wide .plain-list{columns:2;column-gap:48px}.article-layout-wide .plain-list li{max-width:none;break-inside:avoid}}
+@media(min-width:1280px){.article-layout-wide .plain-list{columns:3;column-gap:40px}}
+.list-item-image{display:grid;grid-template-columns:minmax(0,1fr) 140px;gap:18px;align-items:start}
+.list-item img{border-radius:var(--r-small);width:140px;height:105px;object-fit:cover}
+.article-layout .list-item h2{margin:0 0 4px;font-size:24px;line-height:1.2}
+.list-item h2 a{color:var(--link);text-decoration:underline;text-underline-offset:3px;text-decoration-thickness:1.5px}
+.list-item h2 a:hover{color:var(--ink)}
+.list-meta{margin:0 0 4px;max-width:32em;font-size:15px;color:var(--soft)}
+.list-meta a{color:inherit;text-decoration:underline}
+.list-meta:empty{display:none}
+.list-summary{margin:0;font-size:17px;line-height:1.45}
+.pager{display:flex;flex-wrap:wrap;gap:6px;align-items:center;margin:26px 0 0;font-weight:600;font-size:16px}
+.pager a,.pager-current{display:inline-block;min-width:36px;padding:4px 10px;border-radius:999px;text-align:center;color:var(--link)}
+.pager a:hover{background:var(--surface);color:var(--ink)}
+.pager-current{background:var(--ink);color:#fff}
+.ac-filters{display:flex;flex-wrap:wrap;gap:6px;margin:0 0 22px}
+.ac-chip{padding:5px 14px;background:#fff;border:1.5px solid var(--soft);border-radius:999px;color:var(--ink);font:600 15px/1.3 var(--text)}
+.ac-chip:hover{border-color:var(--ink)}
+.ac-chip.active{background:var(--ink);border-color:var(--ink);color:#fff}
+.announcements-grid{display:grid;grid-template-columns:repeat(auto-fill,minmax(280px,1fr));gap:18px}
+.announcement-card{position:relative;display:flex;flex-direction:column;height:100%;background:var(--surface);border-radius:var(--r-large);overflow:hidden}
+.announcement-card:hover h2 a{color:var(--ink)}
+.ac-thumb img{display:block;width:100%;height:auto;aspect-ratio:16/9;object-fit:cover}
+.ac-body{padding:14px 18px 18px;font-size:16px;line-height:1.45}
+.ac-meta{display:flex;flex-wrap:wrap;gap:8px;align-items:center;margin-bottom:6px;font-size:15px;font-weight:600}
+.ac-cat{padding:2px 8px;background:#fff;border-radius:var(--r-small)}
+.ac-body h2{margin:0 0 6px;font-size:21px;line-height:1.2}
+.ac-link{color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.ac-link::after{content:"";position:absolute;inset:0}
+.ac-summary{display:-webkit-box;-webkit-box-orient:vertical;-webkit-line-clamp:4;overflow:hidden}
+.ac-summary p{margin:0}
+.ac-summary a{color:inherit}
+.tags-note{max-width:40em;font-size:17px}
+.tags-note a{color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.tag-cloud{display:flex;flex-wrap:wrap;gap:6px;margin:18px 0 0}
+.tag-cloud a{padding:3px 10px;background:var(--surface);border-radius:var(--r-small);font-size:15px;font-weight:600;line-height:1.35;color:var(--ink)}
+.tag-cloud a:hover{background:var(--ink);color:#fff}
+.tag-count{margin-inline-start:4px;font-weight:400}
+#tag-results{margin:18px 0;max-width:40em}
+#tag-results h2{font-size:26px}
+.nla-page{padding:32px 0 40px}
+.nla-subscribe-band{max-width:40em;margin:0 0 26px;padding:18px 20px;background:var(--surface);border-radius:var(--r-large)}
+.nla-subscribe-label{margin:0 0 10px}
+.nla-archive-header{display:flex;flex-wrap:wrap;align-items:center;gap:14px;margin:0 0 18px}
+.nla-archive-title{margin:0;font-size:30px}
+.nla-year-tabs{display:flex;flex-wrap:wrap;gap:6px}
+.nla-year-tab{padding:4px 12px;background:#fff;border:1.5px solid var(--soft);border-radius:999px;color:var(--ink);font:600 15px/1.3 var(--text)}
+.nla-year-tab.active{background:var(--ink);border-color:var(--ink);color:#fff}
+.nla-year-band{display:flex;align-items:center;gap:10px;margin:22px 0 12px;font:var(--display-weight) 24px/1.2 var(--display)}
+.nla-year-band-line{display:none}
+.nla-grid{display:grid;grid-template-columns:repeat(auto-fill,minmax(140px,1fr));gap:10px}
+.nla-card{display:block;padding:12px 14px;background:var(--surface);border-radius:var(--r-small);color:var(--ink);text-decoration:none}
+.nla-card:hover{background:var(--ink);color:#fff}
+.nla-card-accent{display:none}
+.nla-card-month{font-weight:700}
+.nla-card-year,.nla-card-footer{font-size:15px}
+.nla-badge-new{display:inline-block;margin-bottom:4px;padding:1px 7px;background:var(--res-bg);border-radius:var(--r-small);color:var(--ink);font-size:15px;font-weight:700}
+@media(max-width:760px){
+  .news-page,.tags-page,.nla-page{padding:20px 0 28px}
+  .list-item-image{grid-template-columns:minmax(0,1fr) 88px;gap:12px}
+  .list-item img{width:88px;height:66px}
+  .article-layout .list-item h2{font-size:21px}
+}
+.list-item .btn-links{display:flex;flex-wrap:wrap;gap:6px;margin-top:8px}
+.tag-more{flex-basis:100%;margin-top:10px}
+.tag-more>summary{font-weight:700;color:var(--link);cursor:pointer}
+.tag-more .tag-cloud{margin-top:10px}
+.tag-section{display:block;font-size:15px;color:var(--soft)}
+#tag-results li{padding:8px 0;font-size:18px}
+.tag-show-more{margin:14px 0}
+/* Thumbnails are often logos or figures, so they are shown whole on a white panel, not cropped. On phones the
+   thumbnail sits above the entry and the text takes the full width. */
+.list-item-image img{object-fit:contain;background:#fff;border:1px solid var(--line);padding:4px}
+@media(max-width:760px){
+  .list-item-image{display:flex;flex-direction:column-reverse;align-items:flex-start;gap:12px}
+  .list-item-image img{width:120px;height:72px}
+}
+.cluster-resources{display:grid;grid-template-columns:repeat(auto-fill,minmax(min(100%,340px),1fr));gap:14px 36px;margin:18px 0 0;padding:0;list-style:none}
+.cluster-resources li{margin:0;padding:0 0 12px;border-bottom:1px solid var(--line);font-size:17px;line-height:1.35}
+.cluster-resources a{color:var(--link);text-decoration:none;font-weight:600}
+.cluster-resources a:hover{text-decoration:underline;text-underline-offset:3px}
+.cluster-resources span{display:block;margin-top:4px;color:var(--soft);font-size:15px}
+.tag-find{max-width:520px;margin:20px 0 6px}
+.tag-find label{display:block;margin:0 0 6px;font:600 17px/1.3 var(--text)}
+.tag-find input{width:100%;box-sizing:border-box;padding:10px 16px;border:1.5px solid var(--ink);border-radius:999px;background:#fff;font:400 17px/1.3 var(--text);color:var(--ink)}
+.tag-filter-count{margin:8px 0 0;font-size:16px;color:var(--soft)}
+.tag-cloud a[hidden]{display:none}
+/* Tags: the most used as larger pills, then A to Z in columns. */
+.tag-top h2,.tag-all h2{margin:28px 0 10px;font-size:24px}
+.tag-top .tag-cloud a{padding:6px 14px;font-size:17px}
+.tag-letters{display:flex;flex-wrap:wrap;gap:4px;margin:0 0 8px;position:sticky;top:0;z-index:5;padding:8px 0;background:var(--page)}
+.tag-letters a{display:inline-flex;align-items:center;justify-content:center;min-width:34px;height:34px;border-radius:var(--r-small);background:var(--surface);color:var(--ink);font:600 15px/1 var(--text);text-decoration:none}
+.tag-group{scroll-margin-top:56px}
+/* On a phone the sticky letters wrap to three or four rows, so a jump lands below them. */
+@media(max-width:760px){.tag-group{scroll-margin-top:140px}}
+@media(max-width:360px){.tag-group{scroll-margin-top:180px}}
+.tag-group h3{margin:20px 0 6px;font-size:22px;color:var(--edu)}
+.tag-group ul{columns:4 220px;column-gap:28px;margin:0;padding:0;list-style:none}
+.tag-group li{break-inside:avoid;margin:0;padding:3px 0}
+.tag-group a{color:var(--link);font-size:16px;text-decoration:none}
+.tag-group a:hover{text-decoration:underline;text-underline-offset:3px}
+.tag-group .tag-count{color:var(--soft);font-size:15px}
+.tag-group[hidden],.tag-group li[hidden]{display:none}
+.tag-group.is-short li:not(.is-top){display:none}
+.tag-all.is-searching .tag-group.is-short li:not([hidden]){display:list-item}
+.tag-all.is-searching .tag-group-more{display:none}
+.tag-group-more{margin:6px 0 0;padding:6px 14px;border:1.5px solid var(--ink);border-radius:999px;background:#fff;color:var(--ink);font:600 15px/1.3 var(--text);cursor:pointer}
+.tag-letters{border-bottom:1px solid var(--line)}
+/* Tags carried by one page only are lighter, so the ones in common use stand out. */
+/* A tag's page count as a small badge beside it, not another word of the tag. */
+.tag-group .tag-count,.tag-top .tag-count{display:inline-block;margin-inline-start:4px;padding:0 7px;border-radius:999px;background:var(--surface);color:var(--soft);font-size:15px;line-height:1.5}
+.tag-top .tag-cloud a .tag-count{background:#fff}
+/* A to Z as rows: the tag on the left, its count aligned on the right, a light rule between rows. */
+.tag-group ul{columns:3 240px}
+@media(max-width:760px){.tag-group ul{columns:2 140px}}
+.tag-group li{padding:0;border-bottom:1px solid var(--surface)}
+.tag-group li a{display:flex;justify-content:space-between;align-items:baseline;gap:10px;padding:5px 2px}
+.tag-group li .tag-count{flex:none}
+.tag-top .tag-cloud a{display:inline-flex;align-items:center}
diff --git a/assets/css/doors/newsletter.css b/assets/css/doors/newsletter.css
new file mode 100644
index 00000000000..959ee0df14c
--- /dev/null
+++ b/assets/css/doors/newsletter.css
@@ -0,0 +1,21 @@
+/* The newsletter sign-up form (layouts/partials/doors/newsletter.html). The note and status carry
+   element selectors to outweigh article.css, which loads later and resets paragraph type. */
+.newsletter-form{max-width:520px}
+.newsletter-row{display:flex;flex-wrap:wrap;gap:8px}
+.newsletter-field{flex:999 1 220px;margin:0}
+.newsletter-field input{width:100%;padding:10px 16px;border:1.5px solid var(--soft);border-radius:999px;background:#fff;color:var(--ink);font:16px/1.3 var(--text)}
+.newsletter-field input::placeholder{color:var(--soft);opacity:1}
+.newsletter-field input:focus{border-color:var(--ink);outline:3px solid var(--ink);outline-offset:0}
+.newsletter-submit{flex:1 0 auto;padding:11px 22px;border:0;border-radius:999px;background:var(--link);color:#fff;cursor:pointer;font:700 16px/1.3 var(--text)}
+.newsletter-submit:hover{background:var(--ink)}
+.newsletter-submit:focus-visible{outline:3px solid var(--ink);outline-offset:2px}
+.newsletter-submit:disabled{background:var(--soft);cursor:progress}
+.newsletter-hp{position:absolute;left:-5000px}
+form.newsletter-form p.newsletter-status{margin:10px 0 0;font-size:16px;font-weight:600}
+.newsletter-status:empty{display:none}
+.newsletter-status.is-error{color:#a3271f}
+form.newsletter-form p.newsletter-note{margin:8px 0 0;color:var(--soft);font-size:15px;line-height:1.4}
+.newsletter-note a{color:inherit;text-decoration:underline}
+.newsletter-form.is-done .newsletter-row,.newsletter-form.is-done .newsletter-note{display:none}
+.newsletter-form.is-done .newsletter-status{margin-top:0}
+.newsletter-status:focus:not(:focus-visible){outline:none}
diff --git a/assets/css/doors/page.css b/assets/css/doors/page.css
new file mode 100644
index 00000000000..490c686ae50
--- /dev/null
+++ b/assets/css/doors/page.css
@@ -0,0 +1,16 @@
+/* What the designed inner pages share: the heading block and its arched plate. */
+.page-heading{padding:32px 0 36px}
+.page-heading .crumbs{margin-bottom:26px}
+.heading-grid{display:grid;grid-template-columns:minmax(0,1.5fr) minmax(0,1fr);gap:48px;align-items:center}
+.heading-grid>*{min-width:0}
+.page-heading h1{font-size:clamp(42px,5vw,72px);line-height:1.02;letter-spacing:-.012em;margin:0;text-wrap:balance}
+.page-heading .lede{font-size:clamp(18px,1.45vw,20px);line-height:1.55;margin:20px 0 0;max-width:32em;color:var(--ink)}
+.heading-plate{margin:0;justify-self:end;width:100%;max-width:300px;background:var(--edu-bg);border-radius:999px 999px 0 0;padding:34px 24px 10px}
+.heading-plate img{display:block;width:100%;height:auto;max-height:190px;object-fit:contain}
+@media(max-width:760px){
+  .page-heading{padding:20px 0 24px}
+  .page-heading .crumbs{margin-bottom:18px}
+  .heading-grid{grid-template-columns:1fr;gap:18px}
+  .heading-plate{display:none}
+  .page-heading h1{font-size:clamp(38px,11vw,48px)}
+}
diff --git a/assets/css/doors/popover.css b/assets/css/doors/popover.css
new file mode 100644
index 00000000000..90b3365d159
--- /dev/null
+++ b/assets/css/doors/popover.css
@@ -0,0 +1,12 @@
+/* Shared by citation and term popovers. Below the header, cookie banner and chat. */
+.doors-popover{position:fixed;z-index:800;box-sizing:border-box;width:min(28rem,calc(100vw - 32px));max-height:calc(100vh - 32px);overflow:auto;background:#fff;border:1px solid var(--line);border-radius:var(--r-small);box-shadow:0 8px 24px rgba(38,45,53,.18);padding:14px 36px 14px 16px;color:var(--ink);font:400 .95rem/1.5 var(--text)}
+.doors-popover{animation:popover-in 120ms ease}
+.doors-popover-close{position:absolute;top:2px;right:2px;width:32px;height:32px;padding:0;background:none;border:0;color:var(--soft);font:inherit;font-size:1.3rem;cursor:pointer}
+.doors-popover-close:hover,.doors-popover-close:focus{color:var(--ink)}
+.popover-actions{display:flex;flex-wrap:wrap;gap:16px;margin-top:10px;font-size:.9rem}
+.popover-actions a,.popover-actions button{background:none;border:0;padding:0;color:var(--link);text-decoration:underline;font:inherit;cursor:pointer}
+.doors-popover :is(em,i){font-style:italic!important;font-weight:400}
+@keyframes popover-in{from{opacity:0}to{opacity:1}}
+@media(max-width:599px){.doors-popover{width:calc(100vw - 32px)}}
+@media(prefers-reduced-motion:reduce){.doors-popover{animation:none!important}}
+@media print{.doors-popover{display:none!important}}
diff --git a/assets/css/doors/reset.css b/assets/css/doors/reset.css
new file mode 100644
index 00000000000..ce3b240d469
--- /dev/null
+++ b/assets/css/doors/reset.css
@@ -0,0 +1,24 @@
+/* What pages need from a browser reset, in place of Bootstrap's reboot. */
+*,*::before,*::after{box-sizing:border-box}
+/* Older Markdown and shortcodes size text in rem, written against the theme's 20 px root. */
+html{-webkit-text-size-adjust:100%;font-size:125%}
+body{margin:0}
+h1,h2,h3,h4,h5,h6,p,ul,ol,dl,figure,blockquote,pre{margin-top:0}
+h1,h2,h3,h4,h5,h6{margin-bottom:.5em;line-height:1.2}
+p,ul,ol,dl,pre{margin-bottom:1em}
+ul ul,ol ul,ul ol,ol ol{margin-bottom:0}
+dt{font-weight:700}
+dd{margin:0 0 .5em}
+a{text-decoration:none;background:transparent}
+b,strong{font-weight:700}
+img,svg,video,canvas{vertical-align:middle}
+img,video{max-width:100%;height:auto}
+button,input,select,textarea{font:inherit;color:inherit;margin:0}
+button,select{text-transform:none}
+button:not(:disabled),[type=submit]:not(:disabled),summary{cursor:pointer}
+table{border-collapse:collapse}
+th{text-align:inherit}
+hr{border:0;border-top:1px solid var(--line);margin:2em 0}
+[hidden]{display:none!important}
+code,kbd,pre,samp{font-family:ui-monospace,SFMono-Regular,Menlo,Consolas,monospace;font-size:.9em}
+.sr-only{position:absolute;width:1px;height:1px;overflow:hidden;clip-path:inset(50%);white-space:nowrap}
diff --git a/assets/css/doors/resources.css b/assets/css/doors/resources.css
new file mode 100644
index 00000000000..bda14dab0a2
--- /dev/null
+++ b/assets/css/doors/resources.css
@@ -0,0 +1,105 @@
+/* The resources directory. Loaded only on /resources/ and its pages, so the short class names
+   from the mock cannot reach anything else. */
+.directory{display:grid;grid-template-columns:minmax(0,300px) minmax(0,1fr);gap:48px;align-items:start}
+.filters{background:var(--surface);border-radius:var(--r-large);padding:22px 20px;min-width:0}
+.filter-drawer>summary{list-style:none;font-weight:700;line-height:1.35}
+.filter-drawer>summary::-webkit-details-marker{display:none}
+.filter-badge{font-weight:600}
+.facet{border:0;margin:18px 0 0;padding:0;min-width:0}
+.filter-title{padding:0;font:var(--display-weight) 20px/1.2 var(--display);margin:0 0 10px;color:var(--ink)}
+.chips{display:flex;flex-wrap:wrap;gap:7px}
+.chip{display:inline-flex;align-items:baseline;gap:7px;background:#fff;border:1.5px solid var(--line);border-radius:999px;padding:7px 12px;font:400 15px/1.3 var(--text);color:var(--ink);text-align:start;max-width:100%;cursor:pointer}
+.chip:hover{border-color:var(--ink)}
+.chip[aria-pressed=true]{background:var(--ink);border-color:var(--ink);color:#fff}
+.chip-count{color:var(--soft);font-size:15px;font-weight:600}
+.chip[aria-pressed=true] .chip-count{color:inherit}
+.filter-note{margin:12px 0 0;font-size:16px}
+.catalogue{min-width:0}
+.search-label{display:block;font:var(--display-weight) 22px/1.2 var(--display);margin:0 0 10px}
+.resource-search{width:100%;background:#fff;border:1.5px solid var(--soft);border-radius:var(--r-small);padding:12px 14px;font:400 17px/1.3 var(--text);color:var(--ink)}
+.resource-search::placeholder{color:var(--soft);opacity:1}
+.result-bar{display:flex;flex-wrap:wrap;align-items:baseline;gap:6px 20px;margin-top:16px}
+.result-count{font-weight:600;margin:0}
+.text-button{background:none;border:0;padding:0;font:700 var(--text-size)/1.4 var(--text);color:var(--link);text-decoration:underline;text-underline-offset:3px;cursor:pointer}
+.active-filters{margin:4px 0 0;font-size:16px}
+.res-grid{display:grid;grid-template-columns:repeat(2,minmax(0,1fr));gap:14px;margin-top:20px}
+.res{display:flex;flex-direction:column;gap:8px;padding:18px;background:var(--surface);border-radius:var(--r-large);min-width:0}
+.res-format{display:flex;flex-wrap:wrap;align-items:center;gap:6px 10px;margin:0;font-size:15px}
+.res-type{background:var(--edu);color:#fff;font-weight:700;padding:3px 9px;border-radius:var(--r-small);line-height:1.3}
+.res-level{color:var(--ink)}
+.res-title{font-size:21px;line-height:1.25;margin:0;overflow-wrap:anywhere}
+.res-title a{color:inherit;text-decoration:none}
+.res-title a:hover{color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.res-tag{margin:auto 0 0;font-size:15px;line-height:1.4}
+.res-tag:empty{display:none}
+.empty{margin-top:20px;padding:24px;background:var(--surface);border-radius:var(--r-large)}
+.empty h2{font-size:26px;margin:0}
+.empty p{margin:8px 0 0;font-size:16px}
+.show-more{display:block;margin:20px auto 0;background:#fff;border:1.5px solid var(--ink);border-radius:999px;padding:9px 18px;font:600 16px/1.3 var(--text);color:var(--ink);cursor:pointer}
+.show-more:hover{background:var(--ink);color:#fff}
+.pager{display:flex;flex-wrap:wrap;justify-content:center;align-items:center;gap:6px;margin-top:28px;font-size:16px}
+.pager a,.pager-current{display:inline-block;min-width:40px;padding:8px 10px;border-radius:999px;text-align:center;line-height:1.3}
+.pager a{color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.pager a:hover{background:var(--surface);color:var(--ink)}
+.pager-current{background:var(--edu);color:#fff;font-weight:700}
+.collection-note{margin-top:64px;max-width:44em}
+.collection-note h2{font-size:clamp(28px,2.6vw,36px);margin:0 0 10px}
+.collection-note p{margin:0 0 12px}
+.collection-about p{font-size:16px;line-height:1.55;margin-top:16px}
+.collection-about a{color:var(--link);text-decoration:underline;text-underline-offset:3px}
+
+@media(max-width:1000px){
+  .directory{grid-template-columns:minmax(0,250px) minmax(0,1fr);gap:28px}
+  .res-grid{grid-template-columns:1fr}
+}
+@media(max-width:760px){
+  .directory{grid-template-columns:1fr;gap:18px}
+  .filters{padding:14px 16px}
+  .filter-drawer>summary{display:flex;justify-content:space-between;gap:10px;cursor:pointer}
+  .filter-drawer>summary::after{content:'';flex:none;width:8px;height:8px;margin:7px 3px 0;border-inline-end:2px solid currentColor;border-bottom:2px solid currentColor;transform:rotate(45deg)}
+  .filter-drawer[open]>summary::after{transform:rotate(-135deg)}
+  .collection-note{margin-top:44px}
+}
+/* A card's title reads as a link, and the whole card answers to it. */
+.res{position:relative;transition:background-color .15s}
+.res-title a{color:var(--link)}
+.res-title a::after{content:"";position:absolute;inset:0;border-radius:inherit}
+.res:hover{background:var(--res-bg)}
+.res:has(.res-title a:focus-visible){outline:2px solid var(--link);outline-offset:2px}
+/* Cards lead with the title; type and level follow as one quiet line, then the cluster. Each card is as tall as it needs. */
+.res-grid{align-items:start}
+.res-title{order:-1}
+.res-format{display:block;color:var(--soft);line-height:1.45}
+.res-type{background:none;color:var(--ink);font-weight:600;padding:0;border-radius:0}
+.res-type:has(+ .res-level:not(:empty))::after{content:" ·";font-weight:400;color:var(--soft)}
+.res-level{color:var(--soft)}
+.res-tag{margin:0;color:var(--soft)}
+.res-level:empty{display:none}
+/* Active filters as chips; each one's cross removes it. */
+.active-filters{display:flex;flex-wrap:wrap;gap:6px;margin:8px 0 0}
+.active-chip{display:inline-flex;align-items:center;gap:6px;padding:5px 12px;border:1.5px solid var(--ink);border-radius:999px;background:#fff;color:var(--ink);font:600 15px/1.3 var(--text);cursor:pointer}
+.active-chip::after{content:"×";font-size:18px;line-height:1}
+.active-chip:hover{background:var(--ink);color:#fff}
+/* Results as full-width rows: title, then type and level, then cluster, each row as tall as it needs. */
+.res-grid{grid-template-columns:minmax(0,1fr);gap:0;border-top:1px solid var(--line)}
+.res{padding:14px 12px;background:none;border-radius:0;border-bottom:1px solid var(--line);gap:4px}
+.res:hover{background:var(--surface)}
+.res-title{font-size:20px}
+.pager-mini{display:flex;gap:16px;margin-inline-start:auto}
+.pager-mini a{color:var(--link);font-weight:600;text-decoration:underline;text-underline-offset:3px}
+.pager-mini[hidden]{display:none}
+.result-bar .pager-top{margin:0 0 0 auto}
+.pager-top[hidden]{display:none}
+.collection-about>summary{cursor:pointer;color:var(--link);font-weight:600;text-decoration:underline;text-underline-offset:3px;margin:8px 0}
+/* Sort order and page size: two menus in the search box's style, beside it; on a phone, below it, side by side.
+   The search keeps at least 18em, so with enlarged text or a narrow column the menus wrap below it. */
+.search-row{display:flex;flex-wrap:wrap;gap:10px}
+.search-row .resource-search{flex:1 1 18em;width:auto;min-width:0}
+.search-option{flex:none;padding:0 12px;background:#fff;border:1.5px solid var(--soft);border-radius:var(--r-small);font:400 16px/1.3 var(--text);color:var(--ink);cursor:pointer}
+.search-option:disabled{cursor:default;color:var(--soft)}
+@media(max-width:760px){
+  .search-row{gap:8px}
+  .search-row .resource-search{flex-basis:100%}
+  .search-option{flex:1 1 0;min-width:0;padding:8px 10px;font-size:15px}
+}
+.pager[hidden]{display:none}
diff --git a/assets/css/doors/search.css b/assets/css/doors/search.css
new file mode 100644
index 00000000000..9db15aad628
--- /dev/null
+++ b/assets/css/doors/search.css
@@ -0,0 +1,18 @@
+/* Site search, a dialog over the page. Results stay one readable column at any width. */
+.search-dialog{width:min(760px,calc(100% - 32px));max-width:none;max-height:calc(100dvh - 48px);margin:24px auto auto;padding:0;border:0;border-radius:var(--r-large);background:var(--page);color:var(--ink);box-shadow:0 18px 60px rgba(38,45,53,.35);overflow:hidden}
+.search-dialog[open]{display:flex;flex-direction:column}
+.search-dialog::backdrop{background:rgba(38,45,53,.55)}
+.search-top{display:flex;align-items:center;gap:12px;padding:18px 20px 12px}
+.search-top label{flex:1;margin:0;min-width:0}
+.search-top input{width:100%;padding:10px 16px;background:#fff;border:1.5px solid var(--soft);border-radius:999px;font:400 18px/1.3 var(--text);color:var(--ink)}
+.search-close{flex:none;padding:9px 14px;background:transparent;border:1.5px solid var(--ink);border-radius:999px;font:600 15px/1.3 var(--text);color:var(--ink)}
+.search-close:hover{background:var(--ink);color:#fff}
+.search-status{margin:0;padding:0 20px 10px;font-size:15px;color:var(--soft)}
+.search-hits{flex:1;min-height:0;overflow-y:auto;margin:0;padding:0 20px 20px;list-style:none}
+.search-hits li{padding:12px 0;border-top:1px solid var(--line)}
+.search-hits a{font:var(--display-weight) 21px/1.25 var(--display);color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.search-hits a:hover{color:var(--ink)}
+.search-hits .hit-type{display:block;margin-bottom:2px;font-size:15px;font-weight:600;color:var(--soft)}
+.search-hits p{display:-webkit-box;margin:4px 0 0;overflow:hidden;font-size:16px;line-height:1.45;-webkit-box-orient:vertical;-webkit-line-clamp:3}
+.search-hits mark{background:var(--com-bg);color:inherit}
+@media(max-width:760px){.search-dialog{width:calc(100% - 16px);margin-top:8px;max-height:calc(100dvh - 16px)}.search-top{padding:12px 12px 8px}.search-status{padding:0 12px 8px}.search-hits{padding:0 12px 12px}}
diff --git a/assets/css/doors/sections.css b/assets/css/doors/sections.css
new file mode 100644
index 00000000000..0f38fadc8e9
--- /dev/null
+++ b/assets/css/doors/sections.css
@@ -0,0 +1,187 @@
+/* What the generic section page adds to the reading layout in article.css. */
+.article-layout .doc-section{margin:0 0 36px}
+.article-layout .doc-section:last-child{margin-bottom:0}
+.article-layout .doc-section>h2:first-child{margin-top:0}
+.article-layout .section-lede{font:400 19px/1.5 var(--text);color:var(--ink)}
+.article-layout .doc-section-tinted{padding:22px 24px;background:var(--surface);border-radius:var(--r-large)}
+.article-layout .doc-section-tinted:nth-of-type(4n+1){background:var(--edu-bg)}
+.article-layout .doc-section-tinted:nth-of-type(4n+2){background:var(--res-bg)}
+.article-layout .doc-section-tinted:nth-of-type(4n+3){background:var(--jus-bg)}
+.article-layout .doc-section-tinted:nth-of-type(4n){background:var(--com-bg)}
+.article-layout .doc-section-tinted iframe{display:block;width:100%}
+.feature-rows{display:grid;gap:22px;margin:24px 0;padding:0;list-style:none}
+.article-layout .article-style .feature-rows li{display:grid;grid-template-columns:96px minmax(0,1fr);gap:18px;align-items:start;margin:0;font-size:18px;line-height:1.5}
+.feature-rows img{width:96px;height:96px;object-fit:contain;padding:12px;background:var(--edu-bg);border-radius:50%}
+.article-layout .article-style .feature-rows h3{margin:0 0 4px;font-size:23px}
+.feature-rows p{margin:0 0 8px}
+.feature-rows-small .feature-icon{width:96px;font-size:40px;text-align:center;color:var(--link)}
+.feature-links{display:flex;flex-wrap:wrap;gap:8px}
+.article-layout .article-style .timeline{margin:18px 0;padding:0;list-style:none;border-inline-start:3px solid var(--line)}
+.article-layout .article-style .timeline li{position:relative;margin:0 0 22px;padding-inline-start:20px;font-size:18px;line-height:1.5}
+.article-layout .article-style .timeline li::before{content:"";position:absolute;inset-inline-start:-8px;top:8px;width:13px;height:13px;background:var(--link);border-radius:50%}
+.article-layout .article-style .timeline h3{margin:0 0 2px;font-size:22px}
+.article-layout .article-style .timeline-meta{margin:0 0 6px;font-size:16px;color:var(--soft)}
+.article-layout .article-style .people-wall{display:grid;grid-template-columns:repeat(auto-fill,minmax(170px,1fr));gap:18px 16px;margin:18px 0;padding:0;list-style:none}
+.article-layout .article-style .people-wall li{margin:0;font-size:15px;line-height:1.35}
+.people-wall a{display:grid;grid-template-columns:48px minmax(0,1fr);align-items:center;gap:10px;color:var(--ink);text-decoration:none}
+.people-wall a:hover .people-name{text-decoration:underline}
+.people-wall img,.people-initials{display:flex;align-items:center;justify-content:center;width:48px;height:48px;object-fit:cover;border-radius:50%;background:var(--surface);font-weight:600}
+.people-name{font-weight:600}
+.people-role{display:block;margin:4px 0 0 58px;color:var(--soft)}
+@media(max-width:760px){
+  .article-layout .article-style .feature-rows li{grid-template-columns:64px minmax(0,1fr);gap:12px;font-size:16px}
+  .feature-rows img{width:64px;height:64px;padding:8px}
+  .feature-rows-small .feature-icon{width:64px;font-size:28px}
+  .article-layout .doc-section-tinted{padding:16px}
+}
+
+/* Filters on the publications and partners pages. */
+.filter-container{margin:0 0 24px}
+.filter-section-title{margin:0 0 6px;font-size:16px;font-weight:700}
+.pill-bar{display:flex;flex-wrap:wrap;gap:6px;margin:0 0 16px}
+.filter-pill{padding:5px 12px;background:#fff;border:1.5px solid var(--soft);border-radius:999px;color:var(--ink);font:600 15px/1.3 var(--text)}
+.filter-pill:hover{border-color:var(--ink)}
+.filter-pill.active{background:var(--ink);border-color:var(--ink);color:#fff}
+#no-resources-warning h4{margin-top:12px}
+
+/* Publications, partners and projects: a shared card. */
+.article-layout .article-style :is(.pub-section-group,.partner-section-group)>.section-heading h2{margin-top:34px}
+.article-layout .article-style :is(.pub-section-group,.partner-section-group) hr{display:none}
+.pub-section-description,.partner-section-description{margin:0 0 12px;font-size:18px}
+.pub-list,.partner-list,.get-involved-projects{display:grid;gap:14px;margin:14px 0}
+.pub-card,.partner-card,.get-involved-card{padding:18px 20px;background:var(--surface);border-radius:var(--r-large);font-size:16px;line-height:1.45}
+.article-layout .article-style :is(.pub-card,.partner-card,.get-involved-card) :is(p,li){font-size:16px;line-height:1.45}
+.pub-card,.pub-card-body{min-width:0;overflow-wrap:anywhere}
+.pub-pill{max-width:100%;white-space:normal}
+.pub-header,.partner-header{display:flex;flex-wrap:wrap;align-items:center;justify-content:space-between;gap:6px;margin:0 0 8px}
+.pub-tags,.partner-tags{display:flex;flex-wrap:wrap;gap:6px}
+.pub-pill,.partner-pill{padding:2px 9px;background:#fff;border-radius:var(--r-small);font-size:15px;font-weight:600;color:var(--ink)}
+.pub-year{font-size:15px;font-weight:700}
+.article-layout .article-style :is(.pub-title,.partner-title,.get-involved-card h3){margin:0 0 6px;font-size:21px;line-height:1.2}
+.pub-authors,.pub-journal{margin:0 0 6px;font-size:15px}
+.journal-icon{margin-inline-end:4px}
+.btn-toggle-abstract{padding:0;background:none;border:0;color:var(--link);font:600 15px/1.4 var(--text);text-decoration:underline;text-underline-offset:3px}
+.btn-toggle-abstract i{transition:transform .15s}
+.btn-toggle-abstract.active i{transform:rotate(90deg)}
+.publication-card-abstract{display:none;margin:8px 0}
+.publication-card-abstract.show{display:block}
+.pub-citation-section{margin:10px 0;font-size:15px}
+.pub-footer,.partner-footer{display:flex;flex-wrap:wrap;align-items:center;justify-content:space-between;gap:10px;margin-top:10px}
+.pub-buttons,.partner-buttons{display:flex;flex-wrap:wrap;gap:6px}
+.pub-metrics{display:flex;gap:10px}
+.pub-metric-label{display:block;font-size:15px}
+.partner-content{display:grid;grid-template-columns:96px minmax(0,1fr);gap:16px}
+.partner-logo{display:block;width:96px;height:auto;max-height:72px;object-fit:contain}
+.partner-description{font-size:16px}
+.get-involved-card>:last-child{display:flex;flex-wrap:wrap;gap:6px;align-items:center}
+
+/* Directories hold cards and lists rather than running text, so a wide screen takes two or more columns. */
+.article-layout-wide :is(.pub-list,.partner-list){grid-template-columns:repeat(auto-fill,minmax(min(100%,420px),1fr));gap:16px}
+.article-layout-wide .article-style .feature-rows{grid-template-columns:repeat(auto-fill,minmax(min(100%,420px),1fr));gap:28px 40px}
+.article-layout-wide .article-style .feature-rows li{max-width:none}
+.article-layout-wide .pub-card,.article-layout-wide .pub-card-body{display:flex;flex-direction:column}
+.article-layout-wide .pub-card-body{flex:1}
+.article-layout-wide .pub-footer{margin-top:auto;padding-top:10px}
+@media(min-width:1001px){.article-layout-wide #contributor-list{columns:3;column-gap:40px}}
+@media(min-width:761px) and (max-width:1000px){.article-layout-wide #contributor-list{columns:2;column-gap:32px}}
+.article-layout-wide .contributor-group{max-width:none;break-inside:avoid}
+.article-layout-wide .article-style center{text-align:start}
+
+/* The citation chart supports the introduction: beside it on a wide screen, after it on a narrow one. */
+.pub-intro{display:flex;flex-direction:column;margin-bottom:28px}
+.article-layout .article-style .citation-container{order:1;width:min(100%,320px);margin:6px 0 10px}
+.citation-container img{display:block;width:100%;height:auto}
+.citation-container figcaption{margin-top:6px;text-align:start}
+@media(min-width:761px){
+  .pub-intro{display:grid;grid-template-columns:minmax(0,550px) 240px;justify-content:space-between;gap:48px;align-items:start}
+  .article-layout .article-style .pub-intro p{max-width:none;font-size:18px;line-height:1.55}
+  .article-layout .article-style .citation-container{grid-column:2;grid-row:1;width:auto;margin:0}
+  .pub-intro>:not(figure){grid-column:1}
+}
+@media(min-width:761px) and (max-width:1000px){.pub-intro{grid-template-columns:minmax(0,1fr) 260px;gap:32px}}
+
+.reading:has(.pub-intro) .article-head{margin-bottom:14px}
+.reading:has(.pub-intro) .doc-section>hr:first-child{margin:0 0 20px}
+
+/* Get Involved: its project cards take the reading column and the call-out column together. */
+@media(min-width:1240px){
+  .article-layout-callouts .article-style .get-involved-projects{clear:both;width:calc(100% + 300px);grid-template-columns:repeat(2,minmax(0,1fr))}
+}
+
+/* PDFs and the booklet are for looking at, so they take the width; their introductions do not. */
+.pdf-open{margin:0 0 12px}
+/* The flipbook fits a spread to its frame's width, so a frame wider than a spread clips the pages. */
+@media(min-width:761px){.article-style ._df_book{width:min(100%,calc(80vh*1.35));margin-inline:auto!important}}
+.pdf-viewer{display:block;width:100%;max-width:960px;border:1px solid var(--line);border-radius:var(--r-small)}
+
+/* The chatbot's page is a tool: on a wide screen its input is in view beside the introduction. */
+@media(min-width:1001px){
+  .article-layout-wide .doc-section:has(>#just-os-fullpage){display:grid;grid-template-columns:minmax(0,560px) minmax(0,1fr);column-gap:48px;align-items:start}
+  .article-layout-wide .doc-section:has(>#just-os-fullpage)>*{grid-column:1}
+  .article-layout-wide .doc-section>#just-os-fullpage{grid-column:2;grid-row:1/span 30;height:min(calc(100vh - 260px),640px)!important;min-height:420px;margin:0!important}
+  .article-layout-wide .doc-section:has(>#just-os-fullpage)>br{display:none}
+  /* The team runs across the page below the chat. */
+  .article-layout-wide .doc-section:has(>#just-os-fullpage)>h2:last-of-type{grid-column:1/-1;grid-row:31}
+  .article-layout-wide .doc-section:has(>#just-os-fullpage)>.jos-team{grid-column:1/-1;grid-row:32}
+}
+@media(min-width:1001px) and (max-width:1279px){.article-layout-wide .doc-section:has(>#just-os-fullpage){grid-template-columns:repeat(2,minmax(0,1fr));column-gap:32px}}
+
+/* Contributors: its generated page carries an older inline style, so these rules name the same ids. */
+.article-layout #filter-menu,.article-layout #filter-collapsed{padding:16px 18px;margin:0 0 22px;background:var(--surface);border:0;border-radius:var(--r-large)}
+.article-layout #filter-menu h3{margin:0 0 10px;color:var(--ink);font-size:22px;font-weight:var(--display-weight)}
+.article-layout .filter-field label{font-size:15px}
+.article-layout .filter-field select{width:100%;padding:7px 10px;background:#fff;border:1.5px solid var(--soft);border-radius:var(--r-small);font-size:16px}
+.article-layout #apply-filter,.article-layout #clear-filters{padding:8px 16px;background:var(--link);border-radius:999px;color:#fff;font:600 15px/1.3 var(--text)}
+.article-layout #apply-filter:hover,.article-layout #clear-filters:hover{background:var(--ink)}
+.article-layout .filter-title{border-bottom:1px solid var(--line)}
+.article-layout #filter-collapsed a{color:var(--link)}
+.article-layout .contribution{font-size:17px;line-height:1.45}
+
+/* Testimonials: portraits float beside the text on a wide screen and sit above it on a phone.
+   Their inline size would leave the text a strip about 200 px wide. */
+.article-layout .doc-section-tinted [style*="float"]>div[style*="320px"]{width:180px!important;height:180px!important;margin-inline:auto}
+@media(max-width:760px){
+  .article-layout .doc-section-tinted img[style*="float"],.article-layout .doc-section-tinted [style*="float"]{float:none!important;display:block;margin:0 auto 12px!important}
+  .pub-card,.partner-card,.get-involved-card{padding:14px}
+  .partner-content{grid-template-columns:64px minmax(0,1fr);gap:12px}
+  .partner-logo{width:64px}
+}
+.article-layout .article-style center p:not(:has(img)){text-align:start}
+/* The JUST-OS team: the site's people cards, a pale panel with a round portrait, name and role. */
+.article-layout .article-style .jos-team{display:grid;grid-template-columns:repeat(auto-fill,minmax(min(100%,230px),1fr));gap:16px;margin:16px 0 0;padding:0;list-style:none}
+.article-layout .article-style .jos-team li{margin:0;padding:18px;background:var(--surface);border-radius:var(--r-large)}
+.article-layout .article-style .jos-team img{display:block;width:96px;height:96px;border-radius:50%;object-fit:cover;margin:0 0 12px}
+.article-layout .article-style .jos-team h3{margin:0 0 6px;font-size:20px}
+.article-layout .article-style .jos-team p{margin:0;font-size:16px;line-height:1.45;color:var(--soft)}
+/* "Cite this" reads like "Show Abstract" above it, and opens the full reference. */
+.pub-citation-section{margin:4px 0 10px}
+.pub-citation-section>summary{display:inline-block;cursor:pointer;color:var(--link);font:600 15px/1.4 var(--text);text-decoration:underline;text-underline-offset:3px}
+.pub-citation-section>summary::-webkit-details-marker{display:none}
+.pub-citation-section>summary i{transition:transform .15s}
+.pub-citation-section[open]>summary i{transform:rotate(90deg)}
+.pub-citation-section .citation-text{margin-top:8px;padding:10px 12px;background:#fff;border-radius:var(--r-small)}
+#just-os-fullpage{margin-bottom:24px}
+/* On a phone the empty chat takes about half the screen, so its question box is in view at once; it is the site's card, not a shadowed box. */
+#just-os-fullpage{border-color:var(--line)!important;border-radius:var(--r-large)!important;box-shadow:none!important}
+@media(max-width:760px){#just-os-fullpage{height:min(60vh,520px)!important;min-height:380px}}
+@media(max-width:760px){.article-layout .article-style .citation-container{width:min(100%,220px)}}
+/* The chat page on a phone opens with the chat: the introduction and credits follow it. */
+#just-os-fullpage{margin-bottom:24px!important}
+@media(max-width:1000px){
+  .doc-section:has(>#just-os-fullpage){display:flex;flex-direction:column}
+  .doc-section>#just-os-fullpage{order:-1;margin-top:4px!important}
+}
+@media(max-width:760px){#just-os-fullpage{height:min(52vh,460px)!important;min-height:340px}}
+/* Project cards: their actions as the site's outline pills, one size. */
+.get-involved-card .btn{display:inline-flex;align-items:center;gap:6px;min-height:40px;padding:8px 16px!important;border:1.5px solid var(--link)!important;border-radius:999px!important;background:#fff!important;color:var(--link)!important;font:600 15px/1.2 var(--text)!important}
+.get-involved-card .btn:hover{background:var(--link)!important;color:#fff!important}
+/* Project cards share one footer line of actions. */
+.get-involved-card{display:flex;flex-direction:column}
+.get-involved-card .get-involved-actions{display:flex;flex-wrap:wrap;gap:8px;margin-top:auto;padding-top:12px}
+/* Get Involved is a wide page: its projects fill the width, as many to a row as fit. */
+.article-layout-wide .article-style .get-involved-projects{grid-template-columns:repeat(auto-fill,minmax(min(100%,340px),1fr));max-width:none}
+.article-layout-wide .article-style .action-cards{max-width:960px}
+.get-involved-card[hidden]{display:none}
+.get-involved-card .get-involved-link{display:inline-flex;align-items:center;min-height:40px;padding:0 6px;color:var(--link);font-weight:600;text-decoration:underline;text-underline-offset:3px}
+.get-involved-card .btn.is-main{background:var(--link)!important;color:#fff!important}
+.get-involved-card .btn.is-main:hover{background:var(--ink)!important;border-color:var(--ink)!important}
diff --git a/assets/css/doors/shell.css b/assets/css/doors/shell.css
new file mode 100644
index 00000000000..06c46e86334
--- /dev/null
+++ b/assets/css/doors/shell.css
@@ -0,0 +1,73 @@
+/* Doors header, mega menus and footer. */
+.site-head{position:relative;z-index:1000;background:var(--page);font-family:var(--text)}
+.site-head a{color:inherit;text-decoration:none}
+.head-inner{display:flex;flex-wrap:wrap;align-items:center;gap:8px 28px;min-height:84px;padding-block:8px}
+.brand{flex:none}
+.brand img{width:127px;height:auto;display:block}
+nav.primary{display:flex;flex-wrap:wrap;align-items:center;gap:6px;margin-inline-start:auto}
+.nav-button,nav.primary>a{background:none;border:0;padding:10px 12px;font:600 16px/1.3 var(--text);color:var(--ink);border-radius:var(--r-small);cursor:pointer}
+.nav-button::after{content:'';display:inline-block;width:7px;height:7px;margin-inline-start:8px;border-inline-end:2px solid currentColor;border-bottom:2px solid currentColor;transform:translateY(-3px) rotate(45deg)}
+.nav-button[aria-expanded=true]::after{transform:translateY(1px) rotate(-135deg)}
+.nav-button:hover,nav.primary>a:hover,.nav-button[aria-expanded=true]{background:var(--surface)}
+nav.primary>a[aria-current]{text-decoration:underline;text-underline-offset:5px}
+.search-nav{display:flex;align-items:center;margin:0;border:1.5px solid var(--soft);border-radius:999px;overflow:hidden;background:#fff}
+.search-nav input{border:0;background:none;padding-block:8px;padding-inline:16px 10px;width:158px;font:400 15px/1.3 var(--text);color:var(--ink)}
+.search-nav input::placeholder{color:var(--soft);opacity:1}
+.search-nav input:focus{outline:none}
+.search-nav:focus-within{outline:3px solid var(--ink);outline-offset:2px}
+.search-nav button,.search-open{display:flex;align-items:center;border:0;background:none;padding-block:6px;padding-inline:8px 12px;color:var(--ink);cursor:pointer}
+.search-open{display:none;border:1.5px solid var(--soft);border-radius:999px;padding:9px 11px;background:#fff}
+.site-head .head-join{background:var(--hot);color:var(--ink);padding:11px 16px;font:700 15px/1.2 var(--text);border-radius:999px;white-space:nowrap}
+.site-head .head-join:hover{background:var(--ink);color:#fff}
+.menu-toggle{display:none;background:none;border:1.5px solid var(--ink);border-radius:999px;padding:9px 14px;font:700 15px/1.3 var(--text);color:var(--ink);cursor:pointer}
+.mega{position:absolute;inset-inline:0;top:100%;background:var(--page);border-top:1px solid var(--line);box-shadow:0 18px 30px rgba(22,40,54,.14);padding:30px 0 34px}
+.mega-inner{display:grid;grid-template-columns:repeat(var(--mega-columns,3),minmax(0,1fr));gap:36px;text-align:start}
+.mega-title{font:var(--display-weight) 21px/1.12 var(--display);margin:0 0 10px;color:var(--ink)}
+.site-head .mega a{display:block;padding:5px 0;font-size:16px;line-height:1.4}
+.site-head .mega a:hover,.site-head .mega a[aria-current]{color:var(--link);text-decoration:underline;text-underline-offset:3px}
+
+.site-foot{clear:both;background:var(--foot);padding:52px 0 26px;margin-top:56px;font-family:var(--text);color:var(--ink);text-align:start}
+.site-foot p{text-align:inherit}
+.site-foot a{color:inherit}
+.foot-top{display:grid;grid-template-columns:minmax(0,1.4fr) repeat(3,minmax(0,1fr));gap:40px}
+.foot-top>div>p{margin:12px 0;font-size:16px;line-height:1.5;max-width:26em}
+.foot-top h2{font-size:21px;line-height:1.12;margin:0 0 10px}
+.foot-top a{display:block;padding:4px 0;font-size:16px;line-height:1.4;text-decoration:none}
+.foot-top a:hover{text-decoration:underline;text-underline-offset:3px;color:var(--link)}
+.foot-top .brand{padding:0}
+.foot-top .foot-news{margin-top:6px;color:var(--link);text-decoration:underline;text-decoration-thickness:2px;text-underline-offset:4px}
+.socials{display:flex;flex-wrap:wrap;gap:8px 22px;margin-top:32px;font-weight:600;font-size:16px}
+.socials a{text-underline-offset:3px;text-decoration:underline}
+.foot-base,.foot-legal{display:flex;flex-wrap:wrap;justify-content:space-between;gap:6px 28px;margin-top:22px;font-size:15px}
+.foot-legal{justify-content:flex-start;margin-top:14px}
+.foot-base a,.foot-legal a{text-underline-offset:3px;text-decoration:underline}
+.foot-licence img{display:inline-block;vertical-align:middle;margin-inline-end:10px}
+.nav-button:focus:not(:focus-visible),.menu-toggle:focus:not(:focus-visible),.search-open:focus:not(:focus-visible){outline:none}
+
+@media(max-width:1240px){
+  .head-inner{gap:16px}
+  .search-nav{display:none}
+  .search-open{display:flex}
+  .site-foot{padding-bottom:96px}
+  .foot-top{grid-template-columns:repeat(3,minmax(0,1fr))}
+  .foot-top>div:first-child{grid-column:1/-1}
+}
+@media(max-width:1000px){.nav-button,nav.primary>a{font-size:15px;padding:9px 8px}}
+/* Below 980 px the full row of menus no longer fits beside the logo and Get involved, so the Menu button takes over. */
+@media(max-width:979px){
+  .head-inner{min-height:72px;gap:8px}
+  .menu-toggle{display:block;margin-inline-start:auto}
+  .site-head .head-join{padding:10px 12px}
+  .search-open{padding:8px 10px}
+  .menu-toggle{padding:8px 12px}
+  nav.primary{display:none;position:absolute;inset-inline:0;top:100%;z-index:45;flex-direction:column;flex-wrap:nowrap;align-items:stretch;gap:2px;padding:10px 20px 16px;margin:0;background:var(--page);box-shadow:0 18px 30px rgba(22,40,54,.14);max-height:calc(100vh - 72px);overflow-y:auto}
+  nav.primary[data-open=true]{display:flex}
+  .nav-button,nav.primary>a{text-align:start;font-size:17px;padding:11px 8px}
+  .mega{position:static;box-shadow:none;border-top:0;padding:10px 14px 14px;background:var(--surface);border-radius:var(--r-small)}
+  .mega-inner{grid-template-columns:1fr;gap:18px;width:100%}
+}
+@media(max-width:760px){
+  .brand img{width:96px}
+  .foot-top{grid-template-columns:1fr;gap:26px}
+  .foot-base{flex-direction:column}
+}
diff --git a/assets/css/doors/tokens.css b/assets/css/doors/tokens.css
new file mode 100644
index 00000000000..cb6a16586a3
--- /dev/null
+++ b/assets/css/doors/tokens.css
@@ -0,0 +1,31 @@
+/* Doors design tokens: the one place colours and type are defined.
+   Values come from the FORRT Identity & Design guide unless marked otherwise. */
+:root{
+  /* Guide: backgrounds, neutral elements, text */
+  --ink:#262d35;
+  --page:#fefdf6;
+  --foot:#dce4ea;
+  --soft:#4c5e72;
+  --line:#bdc5ca;
+  /* Guide: highlights, important elements, links */
+  --link:#005a87;
+  --hot:#ff6b00;
+  --edu:#2d5750;
+  --res:#005a87;
+  /* Outside the guide, chosen for the Doors mock (migration plan, Doors README) */
+  --jus:#65478c;
+  --com:#9c4a0e;
+  --surface:#f0f3f5;
+  --edu-bg:#e3efec;
+  --res-bg:#e1eef6;
+  --jus-bg:#ebe6f4;
+  --com-bg:#f8eadc;
+  --urgent:#b3261e;
+  /* Type */
+  --display:'Newsreader',Georgia,'Apple Symbols','Segoe UI Symbol','Noto Sans Symbols 2',serif;
+  --text:'Source Sans 3','Source Sans Pro',system-ui,'Apple Symbols','Segoe UI Symbol','Noto Sans Symbols 2',sans-serif;
+  --text-size:18px;
+  --display-weight:500;
+  --r-small:8px;
+  --r-large:18px;
+}
diff --git a/assets/css/doors/toolkit.css b/assets/css/doors/toolkit.css
new file mode 100644
index 00000000000..378e1f585f0
--- /dev/null
+++ b/assets/css/doors/toolkit.css
@@ -0,0 +1,47 @@
+/* The Citation Politics Toolkit page (shortcode citation-politics-toolkit), on the wide reading layout.
+   Each stage keeps its colour from the wheel as a thin accent only: the yellow fails as text. */
+.cpt [hidden]{display:none!important}
+.cpt-intro{display:grid;grid-template-columns:minmax(0,580px) minmax(0,380px);justify-content:start;gap:24px 56px;align-items:start;margin:0 0 12px}
+.article-layout .article-style .cpt-lede p{margin:0 0 18px}
+.cpt-stages ul{display:flex;flex-wrap:wrap;gap:8px;margin:0 0 22px!important;padding:0!important;list-style:none}
+.article-layout .article-style .cpt-stages li{margin:0;font-size:16px;line-height:1.3}
+.article-layout .article-style .cpt-stages a{display:inline-flex;align-items:center;gap:8px;padding:6px 12px;background:#fff;border:1.5px solid var(--soft);border-radius:999px;color:var(--ink);font-weight:600;text-decoration:none}
+.cpt-stages a::before{content:"";width:10px;height:10px;border-radius:50%;background:var(--stage,var(--soft))}
+.article-layout .article-style .cpt-stages a:hover{border-color:var(--ink)}
+.cpt-search label{display:block;margin:0 0 6px;font-size:16px;font-weight:700}
+.cpt-search input{width:100%;max-width:440px;padding:10px 14px;background:#fff;border:1.5px solid var(--soft);border-radius:var(--r-small);font:400 18px/1.3 var(--text);color:var(--ink)}
+.cpt-search input::placeholder{color:var(--soft);opacity:1}
+.cpt-result{display:flex;flex-wrap:wrap;align-items:center;gap:8px 14px;max-width:440px;margin:10px 0 0}
+.article-layout .article-style .cpt-status{margin:0;font-size:16px;line-height:1.4;color:var(--soft)}
+.article-layout .article-style .cpt-status:empty{display:none}
+.cpt-result.is-empty{padding:14px 18px;background:var(--surface);border-radius:var(--r-large)}
+.article-layout .article-style .cpt-result.is-empty .cpt-status{color:var(--ink)}
+.cpt-wheel{margin:0!important}
+.cpt-wheel a{display:block;color:var(--link);text-decoration:none}
+.cpt-wheel img{display:block;width:100%;height:auto;border-radius:var(--r-small)}
+.cpt-wheel-open{display:block;margin-top:8px;font-size:16px;font-weight:600;text-decoration:underline;text-underline-offset:3px}
+.cpt-wheel a:hover .cpt-wheel-open{color:var(--ink)}
+.cpt-clear{padding:6px 14px;background:#fff;border:1.5px solid var(--ink);border-radius:999px;font:600 16px/1.3 var(--text);color:var(--ink);cursor:pointer}
+.cpt-clear:hover{background:var(--ink);color:#fff}
+.cpt-group{margin:40px 0 0}
+.article-layout .article-style .cpt-group>h2{display:flex;align-items:center;gap:12px;margin:0 0 4px}
+.cpt-group>h2::before{content:"";flex:none;width:6px;height:.9em;border-radius:3px;background:var(--stage,var(--soft))}
+.article-layout .article-style .cpt-wheel-note{margin:0 0 14px;font-size:16px;color:var(--soft)}
+.cpt-items{display:grid;grid-template-columns:repeat(auto-fill,minmax(min(100%,360px),1fr));gap:12px;margin:14px 0 0!important;padding:0!important;list-style:none}
+.article-layout .article-style .cpt-item{display:flex;flex-direction:column;align-items:flex-start;gap:4px;max-width:none;margin:0;padding:14px 18px;background:var(--surface);border-radius:var(--r-large);font-size:16px;line-height:1.45;overflow-wrap:anywhere}
+.cpt-kind{padding:1px 8px;border-radius:var(--r-small);font-size:15px;font-weight:600;color:var(--ink)}
+.cpt-kind-tool{background:var(--res-bg)}
+.cpt-kind-practice{background:var(--edu-bg)}
+.cpt-name{font:var(--display-weight) 20px/1.25 var(--display);color:var(--ink)}
+a.cpt-name,a.cpt-also{color:var(--link);text-decoration:underline;text-underline-offset:3px}
+a.cpt-name:hover,a.cpt-also:hover{color:var(--ink)}
+.cpt-source,.cpt-note{color:var(--soft)}
+.cpt-text{color:var(--ink)}
+.cpt-cite{margin:44px 0 0}
+.article-layout .article-style .cpt-cite h2{margin:0 0 12px}
+.article-layout .article-style .cpt-cite blockquote{max-width:580px;margin:0}
+.article-layout .article-style .cpt-cite blockquote p{overflow-wrap:anywhere}
+@media(max-width:960px){
+  .cpt-intro{grid-template-columns:minmax(0,1fr)}
+  .cpt-wheel{max-width:340px}
+}
diff --git a/assets/css/doors/welcome.css b/assets/css/doors/welcome.css
new file mode 100644
index 00000000000..fefa68cbede
--- /dev/null
+++ b/assets/css/doors/welcome.css
@@ -0,0 +1,27 @@
+/* The welcome page for new members. */
+.welcome-page{padding:32px 0 44px}
+.welcome-page h1{font-size:clamp(36px,4.2vw,58px);line-height:1.06;margin:0 0 12px}
+.welcome-page .crumbs{margin-bottom:18px}
+.welcome-page .standfirst{font:500 clamp(19px,1.6vw,22px)/1.35 var(--display);max-width:34em;margin:0 0 14px}
+.welcome-buttons{display:flex;flex-wrap:wrap;gap:8px;margin:0}
+.welcome-content{display:grid;grid-template-columns:repeat(2,minmax(0,1fr));gap:14px;margin-top:28px}
+.welcome-content>*{min-width:0}
+.welcome-content>:is(h2,p,ul,div:not(.card)){grid-column:1/-1}
+.welcome-content h2{margin:22px 0 2px;font-size:30px}
+.step-card,.resource-card{position:relative;padding:18px 20px;background:var(--surface);border-radius:var(--r-large);font-size:16px;line-height:1.45}
+.step-badge{float:right;margin-inline-start:10px;width:30px;height:30px;line-height:30px;background:var(--ink);border-radius:50%;color:#fff;text-align:center;font-weight:700}
+.step-title,.resource-title{margin:0 0 6px;font:var(--display-weight) 22px/1.2 var(--display)}
+.step-description,.resource-description{margin:0 0 10px}
+.step-button,.resource-button{font-weight:700;color:var(--link);text-decoration:underline;text-underline-offset:3px}
+.step-button i,.resource-button i{margin-inline-start:4px;font-size:15px}
+.resource-header{display:flex;flex-wrap:wrap;justify-content:space-between;gap:8px;margin:0 0 6px}
+.resource-header>div:first-child{display:flex;align-items:center;gap:10px}
+.resource-icon{display:flex;align-items:center;justify-content:center;flex:none;width:36px;height:36px;background:#fff;border-radius:50%;color:var(--link)}
+.resource-title{margin:0}
+.resource-count{display:inline-flex;align-items:center;gap:6px;font-size:15px;font-weight:600;color:var(--soft)}
+.social-media-grid{display:flex;flex-wrap:wrap;gap:6px}
+.social-btn{display:inline-flex;align-items:center;gap:6px;padding:5px 12px;background:#fff;border:1.5px solid var(--soft);border-radius:999px;color:var(--ink);font-size:15px;font-weight:600}
+.social-btn:hover{border-color:var(--ink);color:var(--ink)}
+.welcome-community{margin-top:32px;padding:22px 24px;background:var(--edu-bg);border-radius:var(--r-large)}
+.welcome-community h2{margin:0 0 6px;font-size:30px}
+@media(max-width:760px){.welcome-page{padding:20px 0 28px}.welcome-content{grid-template-columns:minmax(0,1fr)}}
diff --git a/assets/css/welcome.css b/assets/css/welcome.css
deleted file mode 100644
index 4a5f4181efc..00000000000
--- a/assets/css/welcome.css
+++ /dev/null
@@ -1,516 +0,0 @@
-/* Welcome Page Styles - Simplified */
-
-* { box-sizing: border-box; }
-
-body {
-  margin: 0;
-  font-family: -apple-system, BlinkMacSystemFont, 'Segoe UI', Roboto, sans-serif;
-  line-height: 1.6;
-}
-
-/* Layout */
-.welcome-page { min-height: 100vh; }
-
-/* Hero Section */
-.hero-section {
-  background: linear-gradient(135deg, #3b82f6, #8b5cf6);
-  color: white;
-  padding: 4rem 0;
-  text-align: center;
-}
-
-.hero-container { max-width: 1200px; margin: 0 auto; padding: 0 1rem; }
-.hero-content { max-width: 800px; margin: 0 auto; }
-.hero-title { font-size: 2.25rem; font-weight: bold; margin-bottom: 1.5rem; }
-.hero-description { font-size: 0.9375rem; margin-bottom: 2rem; opacity: 0.9; }
-.hero-buttons { display: flex; gap: 1rem; justify-content: center; flex-wrap: wrap; }
-
-.hero-btn {
-  display: inline-flex;
-  align-items: center;
-  padding: 0.75rem 2rem;
-  border-radius: 0.5rem;
-  font-weight: 600;
-  text-decoration: none;
-  transition: all 0.3s ease;
-  border: 2px solid transparent;
-}
-
-.hero-btn-primary { background: white; color: #3b82f6; }
-.hero-btn-primary:hover { background: #f3f4f6; transform: translateY(-2px); }
-.hero-btn-secondary { border-color: white; color: white; }
-.hero-btn-secondary:hover { background: white; color: #3b82f6; transform: translateY(-2px); }
-
-/* Content Sections */
-.welcome-content h2 {
-  font-size: 1.5rem;
-  font-weight: bold;
-  text-align: center;
-  margin: 0;
-  padding: 3rem 1rem;
-  color: #1f2937;
-  background: white;
-}
-
-.welcome-content h2:nth-of-type(2) { background: linear-gradient(135deg, #fef3c7, #fde68a); color: #92400e; }
-.welcome-content h2:last-of-type { background: linear-gradient(135deg, #f3e8ff, #e0e7ff); color: #7c3aed; }
-
-.welcome-content > div {
-  max-width: 1000px;
-  margin: 1rem auto;
-  padding: 1rem 1rem;
-}
-
-.welcome-content h2:first-of-type + div {
-  background: white;
-  padding: 0 1rem 2rem 1rem;
-  max-width: 700px;
-  margin: 0 auto;
-}
-
-.welcome-content h2:nth-of-type(2) + div {
-  background: linear-gradient(135deg, #fef3c7, #fde68a);
-  padding: 0 1rem 2rem 1rem;
-  max-width: 1000px;
-  margin: 0 auto;
-}
-
-.welcome-content h2:last-of-type + div {
-  background: linear-gradient(135deg, #f3e8ff, #e0e7ff);
-  padding: 0 1rem 2rem 1rem;
-  max-width: 1000px;
-  margin: 0 auto;
-}
-
-/* Cards */
-.card {
-  background: white;
-  border-radius: 1rem;
-  box-shadow: 0 4px 6px rgba(0, 0, 0, 0.1);
-  border: 1px solid #e5e7eb;
-  overflow: hidden;
-  transition: all 0.3s ease;
-  position: relative;
-  padding: 2rem;
-}
-
-.card:hover { transform: translateY(-4px); box-shadow: 0 20px 40px rgba(0, 0, 0, 0.15); }
-
-/* Step Card */
-.step-card { border-left: 4px solid #3b82f6; }
-.step-badge {
-  position: absolute;
-  top: 1rem;
-  right: 1rem;
-  width: 2.5rem;
-  height: 2.5rem;
-  background: linear-gradient(135deg, #3b82f6, #8b5cf6);
-  color: white;
-  border-radius: 50%;
-  display: flex;
-  align-items: center;
-  justify-content: center;
-  font-weight: bold;
-  font-size: 0.875rem;
-  box-shadow: 0 4px 12px rgba(59, 130, 246, 0.4);
-  z-index: 10;
-  border: 3px solid white;
-}
-
-.step-title { font-size: 1.125rem; font-weight: bold; color: #1f2937; margin-bottom: 1rem; }
-.step-description { color: #6b7280; font-size: 0.84375rem; margin-bottom: 1.5rem; }
-
-.step-button {
-  display: inline-block !important;
-  align-items: center;
-  padding: 0.5rem 1rem;
-  background: linear-gradient(135deg, #3b82f6, #8b5cf6);
-  color: white;
-  font-weight: 600;
-  font-size: 0.65625rem;
-  border-radius: 0.5rem;
-  text-decoration: none;
-  transition: all 0.3s ease;
-  box-shadow: 0 4px 12px rgba(59, 130, 246, 0.3);
-  width: auto !important;
-  max-width: none !important;
-  flex: none !important;
-}
-
-.step-button:hover {
-  background: linear-gradient(135deg, #2563eb, #7c3aed);
-  transform: scale(1.05);
-  box-shadow: 0 8px 20px rgba(59, 130, 246, 0.4);
-}
-
-.step-button i { margin-left: 0.75rem; transition: transform 0.3s ease; }
-.step-button:hover i { transform: translateX(0.25rem); }
-
-/* Resource Card */
-.resource-card { position: relative; }
-.resource-card::before {
-  content: '';
-  position: absolute;
-  inset: 0;
-  background: linear-gradient(135deg, #f0fdf4, #ecfdf5);
-  opacity: 0.5;
-  z-index: 0;
-}
-
-/* Non-team Resource Card Special Styling - Purple/Teal Gradient */
-.resource-card:not([data-team="true"]) {
-  border-left: 4px solid #8b5cf6;
-  box-shadow: 0 4px 6px rgba(139, 92, 246, 0.1);
-}
-
-.resource-card:not([data-team="true"])::before {
-  background: linear-gradient(135deg, #f3e8ff, #e0e7ff);
-  opacity: 0.4;
-}
-
-.resource-card:not([data-team="true"]):hover {
-  box-shadow: 0 20px 40px rgba(139, 92, 246, 0.15);
-}
-
-.resource-card:not([data-team="true"]) .resource-icon {
-  background: linear-gradient(135deg, #8b5cf6, #06b6d4);
-  box-shadow: 0 4px 12px rgba(139, 92, 246, 0.3);
-}
-
-.resource-card:not([data-team="true"]) .resource-button {
-  background: linear-gradient(135deg, #8b5cf6, #06b6d4);
-  box-shadow: 0 4px 12px rgba(139, 92, 246, 0.3);
-}
-
-.resource-card:not([data-team="true"]) .resource-button:hover {
-  background: linear-gradient(135deg, #7c3aed, #0891b2);
-  box-shadow: 0 8px 20px rgba(139, 92, 246, 0.4);
-}
-
-/* Team Card Special Styling - Amber/Yellow Gradient */
-.resource-card[data-team="true"] {
-  border-left: 4px solid #f59e0b;
-  box-shadow: 0 4px 6px rgba(245, 158, 11, 0.1);
-}
-
-.resource-card[data-team="true"]::before {
-  background: linear-gradient(135deg, #fef3c7, #fde68a);
-  opacity: 0.4;
-}
-
-.resource-card[data-team="true"]:hover {
-  box-shadow: 0 20px 40px rgba(245, 158, 11, 0.15);
-}
-
-.resource-content { position: relative; z-index: 1; }
-
-.resource-header {
-  display: flex;
-  align-items: flex-start;
-  justify-content: space-between;
-  margin-bottom: 1.5rem;
-}
-
-.resource-icon {
-  width: 2.5rem;
-  height: 2.5rem;
-  border-radius: 0.75rem;
-  display: flex;
-  align-items: center;
-  justify-content: center;
-  color: white;
-  font-size: 1rem;
-  background: linear-gradient(135deg, #10b981, #059669);
-  box-shadow: 0 4px 12px rgba(34, 197, 94, 0.3);
-  margin-right: 1rem;
-}
-
-/* Team Icon Special Styling - Amber/Yellow Gradient */
-.resource-card[data-team="true"] .resource-icon {
-  background: linear-gradient(135deg, #f59e0b, #d97706);
-  box-shadow: 0 4px 12px rgba(245, 158, 11, 0.3);
-  width: 2.5rem;
-  height: 2.5rem;
-  font-size: 1rem;
-}
-
-.resource-title {
-  font-size: 1.125rem;
-  font-weight: bold;
-  color: #1f2937;
-  margin: 0 0 0.5rem 0;
-}
-
-.resource-title::after {
-  content: '';
-  display: block;
-  width: 3rem;
-  height: 0.25rem;
-  background: linear-gradient(90deg, #10b981, #059669);
-  border-radius: 0.125rem;
-  margin-top: 0.5rem;
-}
-
-.resource-count {
-  display: inline-flex;
-  align-items: center;
-  padding: 0.5rem 1rem;
-  background: linear-gradient(90deg, #dcfce7, #d1fae5);
-  color: #166534;
-  font-size: 0.875rem;
-  font-weight: bold;
-  border-radius: 9999px;
-  border: 1px solid #bbf7d0;
-  box-shadow: 0 1px 3px rgba(0, 0, 0, 0.1);
-}
-
-.resource-count i { margin-right: 0.5rem; }
-
-.resource-description { color: #6b7280; font-size: 0.84375rem; margin-bottom: 2rem; }
-
-.resource-button {
-  display: inline-flex;
-  align-items: center;
-  padding: 0.5rem 1rem;
-  background: linear-gradient(135deg, #10b981, #059669);
-  color: white;
-  font-weight: 600;
-  font-size: 0.65625rem;
-  border-radius: 0.5rem;
-  text-decoration: none;
-  transition: all 0.3s ease;
-  box-shadow: 0 4px 12px rgba(16, 185, 129, 0.3);
-}
-
-.resource-button:hover {
-  background: linear-gradient(135deg, #059669, #047857);
-  transform: scale(1.05);
-  box-shadow: 0 8px 20px rgba(16, 185, 129, 0.4);
-}
-
-/* Team Button Special Styling - Amber/Yellow Gradient */
-.resource-card[data-team="true"] .resource-button {
-  background: linear-gradient(135deg, #f59e0b, #d97706);
-  color: white;
-  box-shadow: 0 4px 12px rgba(245, 158, 11, 0.3);
-  border: none;
-  padding: 0.5rem 1rem;
-  font-size: 0.65625rem;
-}
-
-.resource-card[data-team="true"] .resource-button:hover {
-  background: linear-gradient(135deg, #d97706, #b45309);
-  color: white;
-  transform: scale(1.05);
-  box-shadow: 0 8px 20px rgba(245, 158, 11, 0.4);
-}
-
-/* Social Media Buttons */
-.social-media-container {
-  margin-top: 1rem;
-}
-
-.social-media-grid {
-  display: grid;
-  grid-template-columns: repeat(auto-fit, minmax(80px, 1fr));
-  gap: 0.25rem;
-  margin-top: 1rem;
-}
-
-.social-btn {
-  display: flex;
-  flex-direction: column;
-  align-items: center;
-  padding: 0.375rem 0.25rem;
-  background: white;
-  border: 1px solid #e5e7eb;
-  border-radius: 0.25rem;
-  text-decoration: none;
-  color: #374151;
-  transition: all 0.2s ease;
-  box-shadow: 0 1px 3px rgba(0, 0, 0, 0.1);
-  min-height: 45px;
-}
-
-.social-btn:hover {
-  transform: translateY(-1px);
-  box-shadow: 0 4px 12px rgba(0, 0, 0, 0.15);
-  color: #1f2937;
-}
-
-.social-btn i {
-  font-size: 0.875rem;
-  margin-bottom: 0.0625rem;
-}
-
-.social-btn span {
-  font-weight: 600;
-  font-size: 0.5rem;
-  margin-bottom: 0.03125rem;
-  text-align: center;
-}
-
-.social-btn small {
-  font-size: 0.375rem;
-  color: #6b7280;
-  text-align: center;
-  line-height: 1;
-}
-
-/* Social Media Button Colors */
-.social-email {
-  border-color: #dc2626;
-}
-
-.social-email:hover {
-  background: #fef2f2;
-  border-color: #dc2626;
-}
-
-.social-email i {
-  color: #dc2626;
-}
-
-.social-twitter {
-  border-color: #1da1f2;
-}
-
-.social-twitter:hover {
-  background: #f0f9ff;
-  border-color: #1da1f2;
-}
-
-.social-twitter i {
-  color: #1da1f2;
-}
-
-.social-slack {
-  border-color: #4a154b;
-}
-
-.social-slack:hover {
-  background: #faf5ff;
-  border-color: #4a154b;
-}
-
-.social-slack i {
-  color: #4a154b;
-}
-
-
-.social-instagram {
-  border-color: #e4405f;
-}
-
-.social-instagram:hover {
-  background: #fef2f2;
-  border-color: #e4405f;
-}
-
-.social-instagram i {
-  color: #e4405f;
-}
-
-.social-facebook {
-  border-color: #1877f2;
-}
-
-.social-facebook:hover {
-  background: #f0f9ff;
-  border-color: #1877f2;
-}
-
-.social-facebook i {
-  color: #1877f2;
-}
-
-.social-osf {
-  border-color: #8b5cf6;
-}
-
-.social-osf:hover {
-  background: #faf5ff;
-  border-color: #8b5cf6;
-}
-
-.social-osf i {
-  color: #8b5cf6;
-}
-
-.social-linkedin {
-  border-color: #0077b5;
-}
-
-.social-linkedin:hover {
-  background: #f0f9ff;
-  border-color: #0077b5;
-}
-
-.social-linkedin i {
-  color: #0077b5;
-}
-
-.social-youtube {
-  border-color: #ff0000;
-}
-
-.social-youtube:hover {
-  background: #fef2f2;
-  border-color: #ff0000;
-}
-
-.social-youtube i {
-  color: #ff0000;
-}
-
-.resource-button i { margin-left: 0.75rem; transition: transform 0.3s ease; }
-.resource-button:hover i { transform: translateX(0.25rem); }
-
-/* Community Section */
-.community-section {
-  background: linear-gradient(135deg, #3b82f6, #8b5cf6);
-  color: white;
-  padding: 4rem 0;
-  text-align: center;
-}
-
-.community-container { max-width: 800px; margin: 0 auto; padding: 0 1rem; }
-.community-title { font-size: 1.5rem; font-weight: bold; margin-bottom: 1.5rem; }
-.community-description { font-size: 0.9375rem; margin-bottom: 2rem; opacity: 0.9; }
-.community-buttons { display: flex; gap: 1rem; justify-content: center; flex-wrap: wrap; }
-
-.community-btn {
-  display: inline-flex;
-  align-items: center;
-  padding: 0.75rem 2rem;
-  border-radius: 0.5rem;
-  font-weight: 600;
-  text-decoration: none;
-  transition: all 0.3s ease;
-  border: 2px solid white;
-  color: white;
-}
-
-.community-btn:hover { background: white; color: #3b82f6; transform: translateY(-2px); }
-
-/* Responsive */
-@media (max-width: 768px) {
-.welcome-content > div {
-        margin: 0.5rem 0.5rem;
-        padding: 0.5rem 0.5rem;
-      }
-  .hero-title { font-size: 1.5rem; }
-  .hero-description { font-size: 0.84375rem; }
-  .welcome-content h2 { font-size: 1.3125rem; padding: 2rem 1rem; }
-  .welcome-content h2:first-of-type + div,
-  .welcome-content h2:last-of-type + div { padding: 0 1rem 2rem 1rem; }
-  .hero-buttons, .community-buttons { flex-direction: column; align-items: center; }
-  .hero-btn, .community-btn { width: 100%; max-width: 300px; justify-content: center; }
-  .step-button { width: auto; }
-}
-
-/* Scrollbar */
-::-webkit-scrollbar { width: 8px; }
-::-webkit-scrollbar-track { background: #f1f5f9; }
-::-webkit-scrollbar-thumb { background: linear-gradient(to bottom, #3b82f6, #8b5cf6); border-radius: 4px; }
-::-webkit-scrollbar-thumb:hover { background: linear-gradient(to bottom, #2563eb, #7c3aed); }
\ No newline at end of file
diff --git a/assets/images/doors/area-community.webp b/assets/images/doors/area-community.webp
new file mode 100644
index 00000000000..8052435a42e
Binary files /dev/null and b/assets/images/doors/area-community.webp differ
diff --git a/assets/images/doors/area-education.webp b/assets/images/doors/area-education.webp
new file mode 100644
index 00000000000..8be0213fd52
Binary files /dev/null and b/assets/images/doors/area-education.webp differ
diff --git a/assets/images/doors/area-justice.webp b/assets/images/doors/area-justice.webp
new file mode 100644
index 00000000000..52716ddaee8
Binary files /dev/null and b/assets/images/doors/area-justice.webp differ
diff --git a/assets/images/doors/area-research.webp b/assets/images/doors/area-research.webp
new file mode 100644
index 00000000000..a4ea10584f1
Binary files /dev/null and b/assets/images/doors/area-research.webp differ
diff --git a/assets/images/doors/castle-still.webp b/assets/images/doors/castle-still.webp
new file mode 100644
index 00000000000..08e0f38ce20
Binary files /dev/null and b/assets/images/doors/castle-still.webp differ
diff --git a/assets/images/doors/just-os-icon.webp b/assets/images/doors/just-os-icon.webp
new file mode 100644
index 00000000000..5321f9200ff
Binary files /dev/null and b/assets/images/doors/just-os-icon.webp differ
diff --git a/assets/images/doors/logo-row.webp b/assets/images/doors/logo-row.webp
new file mode 100644
index 00000000000..29bcbde24bc
Binary files /dev/null and b/assets/images/doors/logo-row.webp differ
diff --git a/assets/js/castle/README.md b/assets/js/castle/README.md
new file mode 100644
index 00000000000..14b4b228edb
--- /dev/null
+++ b/assets/js/castle/README.md
@@ -0,0 +1,36 @@
+# The home-page castle
+
+The animated brick tower in the home page's arched door. Hugo bundles it with `js.Build` from `layouts/partials/doors/home/scripts.html`, using Three.js 0.186.0 from `assets/three/`. No Node is needed to build the site.
+
+| File | Role |
+|---|---|
+| `castle-scene.js` | Scene, lights, timeline. Exposes `window.forrtCastle` |
+| `castle-geometry.js` | The bricks |
+| `castle-piles.js` | Baked resting poses of the two heaps. Generated, see below |
+| `bake-castle-piles.js` | Offline physics bake for those poses. Never part of the site's bundle |
+| `illustrations-render.js` | Offline renderer for the four area illustrations. Never part of the site's bundle |
+| `../doors/castle.js` | Loads the bundle after paint and owns playback: pause, hover, tap, off-screen suspension. Also opens the tower game, see `../tower/README.md` |
+| `../doors/motion.js` | The pause state the castle shares with the home page's quotes, remembered between visits |
+
+**Behaviour.** The still image paints first. The bundle loads after that, and not at all under reduced motion, Save-Data or no WebGL, so the home page works if the castle does not. The tower builds once, turns every 120 seconds and takes a colour wave after each change. Hovering dismantles it. The pause button and "Build it yourself" appear on hover, on keyboard focus and after a tap.
+
+**To measure it on a device**, add `?fps` to the home page's address, which shows the frame rate, or `?fps=20`, which also caps drawing at that rate.
+
+**To turn it off**, set `doors.castle = false` in `config/_default/params.toml`. Visitors then see only the still.
+
+**After changing the geometry or the scene**, regenerate the still, so it still lines up when the bundle takes over:
+
+```sh
+hugo --destination /tmp/castle-build
+python3 scripts/rebrand/render_castle_still.py /tmp/castle-build assets/images/doors/castle-still.webp
+```
+
+**After changing which bricks move**, re-bake the heaps. This is the one step that needs Node, and only on the machine doing it:
+
+```sh
+npm install --prefix /tmp/castle-bake --no-audit --no-fund three@0.186.0 cannon-es@0.20.0 esbuild@0.28.2
+NODE_PATH=/tmp/castle-bake/node_modules /tmp/castle-bake/node_modules/.bin/esbuild assets/js/castle/bake-castle-piles.js --bundle --platform=node --format=cjs --outfile=/tmp/castle-bake/bake.cjs
+node /tmp/castle-bake/bake.cjs assets/js/castle/castle-piles.js
+```
+
+`setVariant("stone" | "pride" | "brick")`, `seek(seconds)` and `setProgress(0..1)` pin a pose for screenshots.
diff --git a/assets/js/castle/bake-castle-piles.js b/assets/js/castle/bake-castle-piles.js
new file mode 100644
index 00000000000..0c7a8c29310
--- /dev/null
+++ b/assets/js/castle/bake-castle-piles.js
@@ -0,0 +1,62 @@
+/* Offline only: generate deterministic, physically settled brick pile poses.
+   Dependencies: three@0.186.0, cannon-es@0.20.0, esbuild@0.28.2.
+   Bundle this script for Node using the same temporary NODE_PATH as README.md:
+   esbuild assets/js/castle/bake-castle-piles.js --bundle --platform=node --format=cjs --outfile=/tmp/bake-castle-piles.cjs
+   node /tmp/bake-castle-piles.cjs assets/js/castle/castle-piles.js
+   This solver is never included in the site's browser bundle. */
+import * as C from 'cannon-es';
+import * as T from 'three';
+import fs from 'node:fs';
+import { createBrickCastle } from './castle-geometry.js';
+const parts=[...createBrickCastle().assemblyParts].sort((a, b) => a.order - b.order).map(({object},index)=>{object.position.set(0,0,0);object.quaternion.identity();const bounds=new T.Box3().setFromObject(object); return {object,index,bounds};});
+let seed=12512; function rand(){seed=(1664525*seed+1013904223)>>>0;return seed/4294967296;}
+const world=new C.World({gravity:new C.Vec3(0,-9.81,0)});
+world.solver.iterations=30;world.solver.tolerance=1e-8;
+world.defaultContactMaterial.friction=.65;world.defaultContactMaterial.restitution=.025;
+world.defaultContactMaterial.contactEquationStiffness=1e8;
+world.defaultContactMaterial.contactEquationRelaxation=4;
+const floor=new C.Body({mass:0});floor.addShape(new C.Plane());floor.quaternion.setFromEuler(-Math.PI/2,0,0);floor.position.y=-.035;world.addBody(floor);
+const poses=[],bounds=new T.Box3();
+const resting=[];
+for(const part of [...parts].reverse()){
+ const size=part.bounds.getSize(new T.Vector3()),center=part.bounds.getCenter(new T.Vector3());
+ const studs=!/lintel|ledge/.test(part.object.name)&&size.x>.18;
+ const bodyHeight=size.y-(studs?.055:0);
+ const bodyCenter=new C.Vec3(center.x,center.y-(studs?.0275:0),center.z);
+ const brick=new C.Body({mass:Math.max(.015,size.x*bodyHeight*size.z*5),linearDamping:.24,angularDamping:.4});
+ brick.addShape(new C.Box(new C.Vec3(size.x/2,bodyHeight/2,size.z/2)),bodyCenter);
+ if(studs){
+  const cols=Math.max(1,Math.floor((size.x+.014-.18)/.30)+1),rows=Math.max(1,Math.floor((size.z+.014-.18)/.30)+1);
+  for(let i=0;i<cols;i++)for(let j=0;j<rows;j++){
+   const x=(i-(cols-1)/2)*.30,z=(j-(rows-1)/2)*.30;
+   if(Math.abs(x)+.09<(size.x+.014)/2 && Math.abs(z)+.09<(size.z+.014)/2)
+    brick.addShape(new C.Cylinder(.079,.086,.053,12),new C.Vec3(x,part.bounds.max.y-.0275,z));
+  }
+ }
+ const side=part.index%2?1:-1;
+ let good=false,finalBox;
+ for(let attempt=0;attempt<30&&!good;attempt++){
+  const x=side*(2.63+(rand()-.5)*.48),z=(rand()-.5)*1.55+.05;
+  let top=0;for(const placed of resting)if(Math.abs(placed.x-x)<.65&&Math.abs(placed.z-z)<.65)top=Math.max(top,placed.top);
+  brick.position.set(x,top+.6+size.y,z);brick.quaternion.setFromEuler((rand()-.5)*.65,rand()*Math.PI*2,(rand()-.5)*.65);
+  brick.velocity.set(0,0,0);brick.angularVelocity.set(0,0,0);brick.force.set(0,0,0);brick.torque.set(0,0,0);
+  world.addBody(brick);
+  for(let i=0;i<720;i++)world.step(1/120);
+  const q=new T.Quaternion(brick.quaternion.x,brick.quaternion.y,brick.quaternion.z,brick.quaternion.w);
+  part.object.position.set(brick.position.x,brick.position.y,brick.position.z);part.object.quaternion.copy(q);finalBox=new T.Box3().setFromObject(part.object);
+  good=(side===1?finalBox.min.x>1.835:finalBox.max.x< -1.835)&&Math.max(Math.abs(finalBox.min.x),Math.abs(finalBox.max.x))<3.6&&finalBox.max.z<1.85&&finalBox.min.z>-1.85&&finalBox.max.y<1.8&&brick.velocity.length()<.035&&brick.angularVelocity.length()<.1;
+  if(!good)world.removeBody(brick);
+ }
+ if(!good)throw new Error('Could not place '+part.index);
+ brick.mass=0;brick.type=C.Body.STATIC;brick.updateMassProperties();brick.velocity.set(0,0,0);brick.angularVelocity.set(0,0,0);
+ const position=part.object.position.toArray(),quat=part.object.quaternion.toArray();
+ poses[part.index]=[...position,...quat].map(n=>+n.toFixed(6));
+ bounds.union(finalBox);resting.push({x:position[0],z:position[2],top:finalBox.max.y});
+ 
+}
+const header=`import { Vector3, Quaternion } from 'three';\n\n// Rigid-body settled poses, deposited from highest castle index to lowest.\n// The offline bake uses each brick's dimensions and stud colliders; earlier\n// deposits become fixed supports so removing later deposits cannot suspend them.\n// No physics engine is shipped to the browser. Floor y = -.035.\nconst SETTLED_POSES = ${JSON.stringify(poses,null,2)};\n\nexport function arrangeBrickPiles(parts) {\n  if (parts.length !== SETTLED_POSES.length) throw new Error('Brick pile poses must be rebaked after changing the castle geometry.');\n  for (const part of parts) {\n    const pose = SETTLED_POSES[part.index];\n    part.staging = new Vector3(...pose.slice(0, 3));\n    part.stagedQuaternion = new Quaternion(...pose.slice(3));\n  }\n  return parts;\n}\n`;
+fs.writeFileSync(process.argv[2] || 'assets/js/castle/castle-piles.js', header);
+// Precise vertices exclude empty corners of rotated geometry bounding boxes.
+const actualBounds = new T.Box3();
+for (const part of parts) actualBounds.union(new T.Box3().setFromObject(part.object, true));
+console.log(JSON.stringify({pieces: poses.length, min: actualBounds.min.toArray(), max: actualBounds.max.toArray()}, null, 2));
diff --git a/assets/js/castle/castle-geometry.js b/assets/js/castle/castle-geometry.js
new file mode 100644
index 00000000000..71e841aa335
--- /dev/null
+++ b/assets/js/castle/castle-geometry.js
@@ -0,0 +1,355 @@
+/* Common Room v3 copy of assets/web3/castle-geometry.js. The moving bricks and their order are unchanged; the upper courses of all four sides now change colour,
+   and arch tops no longer cut thin bands across the fixed lower walls.
+   A hollow, brick-built keep. Units are metres only by convention: one stud is .30.
+   Bricks include their studs in a shared geometry and animate as individual parts. */
+import {
+  Group, Mesh, MeshStandardMaterial, Shape, ExtrudeGeometry,
+  LatheGeometry, Vector2, Matrix4, Color
+} from 'three';
+import { RoundedBoxGeometry } from 'three/addons/geometries/RoundedBoxGeometry.js';
+import { mergeGeometries } from 'three/addons/utils/BufferGeometryUtils.js';
+
+const PITCH = .30;
+const COURSE = .27;
+const GAP = .014;
+const WALL = .36;
+const FLOOR = .15;
+const BODY_HALF = 1.20;
+const GROUND = -.035;
+// The shaped doorway bricks extend .005 below their nominal lower edge.
+const GROUND_SHIFT = FLOOR + GAP / 2 - .005 - GROUND;
+const CASTLE_HEIGHT = 4.02 - GROUND_SHIFT;
+
+export function createBrickCastle() {
+  const model = new Group();
+  model.name = 'Brick-built stone keep';
+  const assemblyParts = [];
+  const cache = new Map();
+  const stoneColours = ['#55616a', '#5c6870', '#637078', '#505c65', '#6b757b', '#5a666e', '#626b71'];
+  const stones = stoneColours.map(color => new MeshStandardMaterial({
+    color, roughness: .42, metalness: .025
+  }));
+  const archStones = ['#79848a', '#707c83', '#65717a'].map(color => new MeshStandardMaterial({
+    color, roughness: .43, metalness: .025
+  }));
+  const mortar = new MeshStandardMaterial({color: '#444f58', roughness: .48, metalness: .02});
+  // Stable brick identities also index the precomputed loose-brick pile poses.
+  let serial = 1, removedBandBricks = 0;
+
+  // The softened lip catches a narrow highlight without the cost of a bevel modifier.
+  const studGeometry = new LatheGeometry([
+    new Vector2(0, 0), new Vector2(.078, 0), new Vector2(.087, .008),
+    new Vector2(.087, .048), new Vector2(.080, .055), new Vector2(0, .055)
+  ], 16);
+
+  function merge(parts) {
+    const result = mergeGeometries(parts.map(part => part.index ? part.toNonIndexed() : part), false);
+    result.computeBoundingSphere();
+    return result;
+  }
+
+  function studAt(x, y, z) {
+    return studGeometry.clone().applyMatrix4(new Matrix4().makeTranslation(x, y, z));
+  }
+
+  function brickGeometry(width, height, depth, studs = true) {
+    const key = [width, height, depth, studs].map(value => typeof value === 'number' ? value.toFixed(4) : value).join('/');
+    if (cache.has(key)) return cache.get(key);
+    const parts = [new RoundedBoxGeometry(width - GAP, height - GAP, depth - GAP, 2, .011)];
+    if (studs) {
+      const columns = Math.max(1, Math.floor((width - .18) / PITCH) + 1);
+      const rows = Math.max(1, Math.floor((depth - .18) / PITCH) + 1);
+      for (let x = 0; x < columns; x++) for (let z = 0; z < rows; z++) {
+        const px = (x - (columns - 1) / 2) * PITCH;
+        const pz = (z - (rows - 1) / 2) * PITCH;
+        if (Math.abs(px) + .09 < width / 2 && Math.abs(pz) + .09 < depth / 2) {
+          parts.push(studAt(px, (height - GAP) / 2, pz));
+        }
+      }
+    }
+    const geometry = merge(parts);
+    cache.set(key, geometry);
+    return geometry;
+  }
+
+  function addPiece(geometry, {x = 0, y = 0, z = 0, rotation = 0, material, animate = false, order, name = 'Masonry brick'} = {}) {
+    const object = new Group();
+    object.name = name;
+    object.position.set(x, y, z);
+    object.rotation.y = rotation;
+    const mesh = new Mesh(geometry, material || stones[(serial * 17 + Math.floor(y * 31)) % stones.length]);
+    mesh.castShadow = true;
+    mesh.receiveShadow = true;
+    object.add(mesh);
+    object.userData = {brick: true, index: serial++, course: Math.floor((y - FLOOR) / COURSE), restHeight: y};
+    model.add(object);
+    if (animate) assemblyParts.push({object, order: order ?? y * 100 + (serial % 23) * .025});
+    return object;
+  }
+
+  function wallPiece(geometry, x, y, side, material, animate, name) {
+    const rotation = side * Math.PI / 2;
+    const z = BODY_HALF - WALL / 2;
+    return addPiece(geometry, {
+      x: Math.cos(rotation) * x + Math.sin(rotation) * z,
+      y,
+      z: -Math.sin(rotation) * x + Math.cos(rotation) * z,
+      rotation, material, animate, name
+    });
+  }
+
+  // Front and right entrances are openings through the wall, including the arch.
+  // Arches use circular boundaries; upper arrow windows have a small flat lintel.
+  const openings = [
+    [{bottom: FLOOR - .03, spring: .96, radius: .45, top: 1.41}, {bottom: 2.04, top: 2.58, half: .16}],
+    [{bottom: FLOOR - .03, spring: .81, radius: .36, top: 1.17}, {bottom: 2.04, top: 2.58, half: .16}],
+    [{bottom: 2.04, top: 2.58, half: .16}],
+    [{bottom: 2.04, top: 2.58, half: .16}]
+  ];
+
+  function halfOpening(opening, y) {
+    if (opening.half) return opening.half;
+    if (y <= opening.spring) return opening.radius;
+    return Math.sqrt(Math.max(0, opening.radius ** 2 - (y - opening.spring) ** 2));
+  }
+
+  function rectangularIntervals(left, right, course) {
+    const boundaries = [left];
+    const offset = course % 2 ? .30 : 0;
+    for (let x = -1.80 + offset; x < right - .01; x += .60) {
+      if (x > left + .08) boundaries.push(x);
+    }
+    boundaries.push(right);
+    return boundaries.slice(0, -1).map((x, i) => [x, boundaries[i + 1]]);
+  }
+
+  // Clip an individual masonry block against an aperture, leaving real air inside.
+  // Curved edge points are sampled only on the handful of blocks around each arch.
+  function clippedBrick(left, right, low, high, opening, direction) {
+    const centerX = (left + right) / 2;
+    const centerY = (low + high) / 2;
+    const samples = 18;
+    const points = [];
+    let area = 0;
+    const x0 = left + GAP / 2;
+    const x1 = right - GAP / 2;
+    const y0 = low + GAP / 2;
+    const y1 = high - GAP / 2;
+    for (let i = 0; i <= samples; i++) {
+      const y = y0 + (y1 - y0) * i / samples;
+      const boundary = direction < 0
+        ? Math.min(x1, -halfOpening(opening, y) - .006)
+        : Math.max(x0, halfOpening(opening, y) + .006);
+      const width = direction < 0 ? Math.max(0, boundary - x0) : Math.max(0, x1 - boundary);
+      area += width;
+      points.push({y, boundary: direction < 0 ? Math.max(x0, boundary) : Math.min(x1, boundary)});
+    }
+    if (area < .025) return null;
+    const shape = new Shape();
+    if (direction < 0) {
+      shape.moveTo(x0 - centerX, y0 - centerY);
+      for (const point of points) shape.lineTo(point.boundary - centerX, point.y - centerY);
+      shape.lineTo(x0 - centerX, y1 - centerY);
+    } else {
+      shape.moveTo(x1 - centerX, y0 - centerY);
+      shape.lineTo(x1 - centerX, y1 - centerY);
+      for (const point of points.slice().reverse()) shape.lineTo(point.boundary - centerX, point.y - centerY);
+    }
+    shape.closePath();
+    const solid = new ExtrudeGeometry(shape, {depth: WALL - GAP - .012, bevelEnabled: true, bevelThickness: .006, bevelSize: .005, bevelSegments: 2, steps: 1, curveSegments: 10});
+    solid.translate(0, 0, -(WALL - GAP - .012) / 2);
+    const parts = [solid];
+    // Studs belong only where the clipped brick still has a full-width top surface.
+    const topBoundary = points[points.length - 1].boundary;
+    for (let x = -1.05; x < 1.20; x += PITCH) {
+      const permitted = direction < 0 ? x + .094 < topBoundary : x - .094 > topBoundary;
+      if (permitted && x - .094 > x0 && x + .094 < x1) parts.push(studAt(x - centerX, y1 - centerY, 0));
+    }
+    return merge(parts);
+  }
+
+  for (let course = 0; course < 11; course++) {
+    const low = FLOOR + course * COURSE;
+    const high = low + COURSE;
+    for (let side = 0; side < 4; side++) {
+      // Alternate which pair passes through the corners, as physical brick bonds do.
+      const fullWidth = side % 2 === course % 2;
+      const half = fullWidth ? BODY_HALF : BODY_HALF - WALL;
+      const rows = [low, high];
+      const holes = openings[side];
+      // An arch top inside a course leaves that course whole; only the bricks over the arch are shaped.
+      let archTop = false;
+      for (const hole of holes) for (const boundary of [hole.bottom, hole.top]) {
+        if (boundary > low + .01 && boundary < high - .01) {
+          if (hole.radius) archTop = true;
+          else rows.push(boundary);
+        }
+      }
+      rows.sort((a, b) => a - b);
+      for (let section = 0; section < rows.length - 1; section++) {
+        const bottom = rows[section];
+        const top = rows[section + 1];
+        const middleY = (bottom + top) / 2;
+        const hole = holes.find(opening => middleY > opening.bottom && middleY < opening.top);
+        for (const [left, right] of rectangularIntervals(-half, half, course + side)) {
+          const middleX = (left + right) / 2;
+          const animate = course >= 8 && side < 2;
+          if (!hole || (right < -halfOpening(hole, bottom) - .01 || left > halfOpening(hole, bottom) + .01)) {
+            wallPiece(brickGeometry(right - left, top - bottom, WALL), middleX, middleY, side, null, animate, 'Interlocking slate-grey wall brick');
+          } else {
+            for (const direction of [-1, 1]) {
+              const geometry = clippedBrick(left, right, bottom, top, hole, direction);
+              if (geometry) wallPiece(geometry, middleX, middleY, side, null, animate, 'Shaped masonry around an opening');
+            }
+          }
+        }
+      }
+      // Serials index the baked heap poses, so the bricks of the removed band keep their numbers.
+      if (archTop) {
+        const skipped = rectangularIntervals(-half, half, course + side).length;
+        serial += skipped;
+        removedBandBricks += skipped;
+      }
+    }
+  }
+
+  // Specialised arch bricks project by .018, with a separate keystone and jambs.
+  // Their inner radii exactly follow the openings cut into the structural wall.
+  function addArch(side, radius, spring, count) {
+    for (let i = 0; i < count; i++) {
+      const start = i * Math.PI / count + .012;
+      const end = (i + 1) * Math.PI / count - .012;
+      const outer = radius + .135;
+      const shape = new Shape();
+      shape.absarc(0, 0, outer, start, end, false);
+      shape.absarc(0, 0, radius + .007, end, start, true);
+      shape.closePath();
+      const geometry = new ExtrudeGeometry(shape, {depth: WALL + .025, bevelEnabled: true, bevelSize: .004, bevelThickness: .004, bevelSegments: 2, curveSegments: 6, steps: 1});
+      geometry.translate(0, 0, -(WALL + .025) / 2);
+      wallPiece(geometry, 0, spring, side, archStones[i % archStones.length], false, 'Individual arch voussoir');
+    }
+    const jambHeight = spring - FLOOR;
+    const countJamb = Math.ceil(jambHeight / COURSE);
+    for (let course = 0; course < countJamb; course++) {
+      const h = jambHeight / countJamb;
+      for (const sign of [-1, 1]) {
+        wallPiece(brickGeometry(.132, h, WALL + .027, false), sign * (radius + .071), FLOOR + h * (course + .5), side, archStones[(course + side) % archStones.length], false, 'Arch jamb brick');
+      }
+    }
+  }
+  addArch(0, .45, .96, 7);
+  addArch(1, .36, .81, 7);
+
+  // Narrow sill pieces and lintels give the upper windows a manufactured brick edge.
+  for (let side = 0; side < 4; side++) {
+    wallPiece(brickGeometry(.48, .085, .41, false), 0, 2.005, side, archStones[2], false, 'Arrow-window sill');
+    wallPiece(brickGeometry(.48, .10, .39, false), 0, 2.63, side, stones[3], side < 2, 'Arrow-window lintel');
+  }
+
+  // A two-step corbel expands the top into a broad, genuinely hollow parapet.
+  // The interior remains open to the base, including during the assembly sequence.
+  function ringCourse(outer, thickness, low, height, pattern, name, material) {
+    const center = outer / 2 - thickness / 2;
+    for (let side = 0; side < 4; side++) {
+      const rotation = side * Math.PI / 2;
+      const length = side % 2 === pattern % 2 ? outer : outer - thickness * 2;
+      const count = Math.round(length / .59);
+      const width = length / count;
+      for (let brick = 0; brick < count; brick++) {
+        const x = -length / 2 + width * (brick + .5);
+        addPiece(brickGeometry(width, height, thickness), {
+          x: Math.cos(rotation) * x + Math.sin(rotation) * center,
+          y: low + height / 2,
+          z: -Math.sin(rotation) * x + Math.cos(rotation) * center,
+          rotation, material, animate: side < 2, name
+        });
+      }
+    }
+  }
+  ringCourse(2.58, .40, 3.12, .12, 0, 'Lower corbel brick', stones[3]);
+  ringCourse(2.76, .45, 3.24, .13, 1, 'Upper corbel brick', stones[2]);
+  ringCourse(2.94, .45, 3.37, .25, 0, 'Open parapet wall', null);
+
+  // Four substantial corner merlons and two middle merlons on every edge.
+  // Exposed two-by-two studs make the crown unmistakably a construction toy.
+  const crownHalf = 1.47;
+  const merlonWidth = .54;
+  const center = crownHalf - merlonWidth / 2;
+  for (const x of [-center, center]) for (const z of [-center, center]) {
+    addPiece(brickGeometry(.54, .34, .54), {x, y: 3.79, z, material: stones[3], animate: x > 0 && z > 0, name: 'Corner battlement'});
+  }
+  for (let side = 0; side < 4; side++) {
+    const rotation = side * Math.PI / 2;
+    for (const x of [-.415, .415]) {
+      addPiece(brickGeometry(.51, .34, .54), {
+        x: Math.cos(rotation) * x + Math.sin(rotation) * center,
+        y: 3.79,
+        z: -Math.sin(rotation) * x + Math.cos(rotation) * center,
+        rotation, material: stones[(side + 2) % stones.length], animate: side < 2, name: 'Studded crenellation'
+      });
+    }
+  }
+
+  // A few shallow inner ledge tiles catch light inside the open roof, adding depth.
+  ringCourse(2.05, .17, 3.25, .08, 0, 'Interior parapet ledge', mortar);
+  assemblyParts.sort((a, b) => a.order - b.order);
+
+  // The upper courses can change on all four sides while the stone foundation stays
+  // in place, so the turning tower shows the facade from every angle. Only the front
+  // and right bricks move. Each changing brick owns its material so colours never leak
+  // into the fixed walls. Colour targets are linear-space Three colours for interpolation.
+  const prideColours = ['#7046a3', '#2672b8', '#2b985b', '#edc438', '#e98434', '#ce4742'];
+  const brickColours = ['#a84f39', '#b66147', '#9d4535', '#c17354', '#a95b44', '#bb5940', '#99503f'];
+  const moved = new Set(assemblyParts.map(part => part.object));
+  const recolourParts = model.children.filter(object => object.userData.brick && object.position.y > 2.31 && !moved.has(object)).map(object => ({object}));
+  for (const part of [...assemblyParts, ...recolourParts]) {
+    const y = part.object.position.y;
+    // Course changes, corbels and crown each contribute to the ascending bands.
+    const band = y < 2.58 ? 0 : y < 2.86 ? 1 : y < 3.12 ? 2 : y < 3.30 ? 3 : y < 3.62 ? 4 : 5;
+    const variation = part.object.userData.index % brickColours.length;
+    part.palette = [];
+    part.object.traverse(mesh => {
+      if (!mesh.isMesh) return;
+      mesh.material = mesh.material.clone();
+      part.palette.push({
+        material: mesh.material,
+        stone: mesh.material.color.clone(),
+        pride: new Color(prideColours[band]),
+        brick: new Color(brickColours[variation])
+      });
+    });
+    part.object.userData.facadeBand = band;
+  }
+
+  // Brick geometry remains unchanged for the baked pile poses. Lower the castle
+  // as a whole so the first masonry course rests directly on the shadow plane.
+  for (const object of model.children) {
+    object.position.y -= GROUND_SHIFT;
+    object.userData.restHeight -= GROUND_SHIFT;
+  }
+
+  // Fixed bricks share a draw call per material. Moving bricks retain independent
+  // pivots and shared geometries, so the detailed model stays economical on phones.
+  const moving = new Set([...assemblyParts, ...recolourParts].map(part => part.object));
+  const fixedByMaterial = new Map();
+  model.updateMatrixWorld(true);
+  for (const object of model.children.slice()) {
+    if (moving.has(object)) continue;
+    object.traverse(mesh => {
+      if (!mesh.isMesh) return;
+      if (!fixedByMaterial.has(mesh.material)) fixedByMaterial.set(mesh.material, []);
+      fixedByMaterial.get(mesh.material).push(mesh.geometry.clone().applyMatrix4(mesh.matrixWorld));
+    });
+    model.remove(object);
+  }
+  for (const [material, geometries] of fixedByMaterial) {
+    const mesh = new Mesh(merge(geometries), material);
+    mesh.name = 'Fixed castle masonry';
+    mesh.castShadow = true;
+    mesh.receiveShadow = true;
+    model.add(mesh);
+    geometries.forEach(geometry => geometry.dispose());
+  }
+  model.userData = {studPitch: PITCH, bodyWidth: 2.4, baseWidth: 2.94, height: CASTLE_HEIGHT, brickCount: serial - 1 - removedBandBricks};
+  return {model, assemblyParts, recolourParts, height: CASTLE_HEIGHT};
+}
diff --git a/assets/js/castle/castle-piles.js b/assets/js/castle/castle-piles.js
new file mode 100644
index 00000000000..3c0a8e556ad
--- /dev/null
+++ b/assets/js/castle/castle-piles.js
@@ -0,0 +1,540 @@
+import { Vector3, Quaternion } from 'three';
+
+// Rigid-body settled poses, deposited from highest castle index to lowest.
+// The offline bake uses each brick's dimensions and stud colliders; earlier
+// deposits become fixed supports so removing later deposits cannot suspend them.
+// No physics engine is shipped to the browser. Floor y = -.035.
+const SETTLED_POSES = [
+  [
+    -2.762196,
+    1.519374,
+    0.201872,
+    -0.058075,
+    0.966239,
+    0.107143,
+    -0.227001
+  ],
+  [
+    2.910415,
+    0.700614,
+    -1.130143,
+    -0.44114,
+    0.279641,
+    -0.622896,
+    -0.582407
+  ],
+  [
+    -2.335264,
+    0.431316,
+    -0.775152,
+    0.131656,
+    -0.192286,
+    0.247051,
+    -0.940563
+  ],
+  [
+    2.64086,
+    0.092993,
+    1.606751,
+    0,
+    -0.991671,
+    0,
+    0.128796
+  ],
+  [
+    -2.779671,
+    1.300908,
+    -0.278321,
+    -0.125919,
+    0.918049,
+    0.088557,
+    0.365361
+  ],
+  [
+    2.962703,
+    0.302172,
+    -0.504478,
+    -0.49234,
+    0.839966,
+    -0.030349,
+    0.226134
+  ],
+  [
+    -2.64207,
+    1.128068,
+    0.508993,
+    0.750042,
+    0.584448,
+    -0.160565,
+    -0.26472
+  ],
+  [
+    2.691394,
+    1.374349,
+    -0.256562,
+    -0.553269,
+    0.178624,
+    -0.677454,
+    0.450602
+  ],
+  [
+    -2.760343,
+    1.120281,
+    -0.18211,
+    -0.044834,
+    0.499245,
+    0.147267,
+    0.852676
+  ],
+  [
+    2.478386,
+    1.368097,
+    0.063462,
+    -0.118629,
+    0.924552,
+    0.288394,
+    0.218999
+  ],
+  [
+    -2.808953,
+    0.853202,
+    -0.445325,
+    0.087031,
+    0.876213,
+    -0.459556,
+    -0.116125
+  ],
+  [
+    2.815329,
+    1.030478,
+    0.141814,
+    -0.589796,
+    0.299601,
+    0.473836,
+    -0.581257
+  ],
+  [
+    -2.951747,
+    0.635841,
+    -0.749274,
+    -0.987546,
+    0.077785,
+    0.136757,
+    -0.000784
+  ],
+  [
+    3.262337,
+    0.231556,
+    0.889533,
+    0.637715,
+    -0.118123,
+    0.730031,
+    -0.215457
+  ],
+  [
+    -2.556266,
+    0.342159,
+    -1.186858,
+    -0.063995,
+    -0.375852,
+    -0.904556,
+    -0.190839
+  ],
+  [
+    3.223478,
+    0.5445,
+    0.142827,
+    0.902738,
+    -0.356456,
+    0.193522,
+    -0.143361
+  ],
+  [
+    -3.09319,
+    0.333393,
+    -0.855782,
+    -0.508891,
+    0.17361,
+    -0.836501,
+    -0.105617
+  ],
+  [
+    2.444895,
+    0.521019,
+    -1.142683,
+    0.82759,
+    0.216861,
+    0.146296,
+    0.496652
+  ],
+  [
+    -2.157952,
+    0.137993,
+    -1.544295,
+    0.084082,
+    -0.70209,
+    -0.70209,
+    -0.084082
+  ],
+  [
+    2.957451,
+    0.445884,
+    -0.785152,
+    0.217762,
+    0.684901,
+    0.672823,
+    -0.175502
+  ],
+  [
+    -3.198635,
+    0.140931,
+    -1.324817,
+    -0.165186,
+    -0.695033,
+    -0.679009,
+    0.169084
+  ],
+  [
+    2.351744,
+    1.244735,
+    -0.38821,
+    -0.077872,
+    0.634864,
+    0.138864,
+    0.756043
+  ],
+  [
+    -2.686164,
+    1.117655,
+    0.519459,
+    0.134332,
+    0.872003,
+    -0.033017,
+    0.469549
+  ],
+  [
+    2.578228,
+    0.240137,
+    -1.371165,
+    0.756766,
+    0.016298,
+    0.242732,
+    0.60673
+  ],
+  [
+    -2.705798,
+    0.844357,
+    0.640168,
+    -0.181641,
+    0.072357,
+    -0.11853,
+    0.97351
+  ],
+  [
+    2.406813,
+    1.012214,
+    -0.50172,
+    0.099346,
+    -0.001545,
+    0.155135,
+    0.982884
+  ],
+  [
+    -2.839229,
+    0.759358,
+    0.767795,
+    -0.105193,
+    0.349802,
+    0.930297,
+    0.033457
+  ],
+  [
+    2.390414,
+    1.02744,
+    0.021706,
+    0.094722,
+    0.697968,
+    -0.128574,
+    -0.698095
+  ],
+  [
+    -2.111296,
+    0.148578,
+    -0.167687,
+    0.56688,
+    -0.33591,
+    -0.70152,
+    -0.271442
+  ],
+  [
+    3.212435,
+    0.163292,
+    0.448927,
+    0.54297,
+    -0.141106,
+    0.093146,
+    0.822555
+  ],
+  [
+    -2.833777,
+    0.881405,
+    0.079142,
+    -0.278294,
+    0.794185,
+    -0.15145,
+    -0.518542
+  ],
+  [
+    2.985669,
+    0.33798,
+    0.05892,
+    0.928324,
+    0,
+    -0.371773,
+    0
+  ],
+  [
+    -2.435534,
+    -0.002007,
+    -1.174564,
+    -0.037998,
+    0,
+    0.999278,
+    0
+  ],
+  [
+    2.857076,
+    0.33798,
+    -0.156199,
+    0,
+    0.868218,
+    0,
+    -0.496182
+  ],
+  [
+    -2.254641,
+    0.167987,
+    0.960991,
+    0,
+    -0.138281,
+    0,
+    0.990393
+  ],
+  [
+    2.706043,
+    0.377987,
+    0.946488,
+    0,
+    -0.30076,
+    0,
+    -0.9537
+  ],
+  [
+    -2.599056,
+    0.737108,
+    -0.125416,
+    0.060227,
+    0.52859,
+    -0.453533,
+    0.715034
+  ],
+  [
+    2.975553,
+    0.246987,
+    -0.064693,
+    0.956271,
+    0,
+    0.292482,
+    0
+  ],
+  [
+    -2.761556,
+    0.6505,
+    0.314622,
+    -0.148516,
+    0.829627,
+    0.094839,
+    -0.529781
+  ],
+  [
+    3.012897,
+    0.076993,
+    -0.051303,
+    0.914072,
+    0,
+    0.405552,
+    0
+  ],
+  [
+    -2.740653,
+    0.493463,
+    0.937067,
+    0.443438,
+    0.401297,
+    0.628213,
+    0.497666
+  ],
+  [
+    2.939976,
+    0.022993,
+    -1.541041,
+    0,
+    -0.00882,
+    0,
+    0.999961
+  ],
+  [
+    -3.058994,
+    0.076993,
+    -0.909842,
+    -0.988945,
+    0,
+    0.148281,
+    0
+  ],
+  [
+    2.443477,
+    0.849173,
+    0.294832,
+    0.129584,
+    0.86824,
+    -0.048152,
+    0.476496
+  ],
+  [
+    -2.077511,
+    0.076993,
+    0.787584,
+    0.706659,
+    0,
+    -0.707554,
+    0
+  ],
+  [
+    3.1201,
+    0.136993,
+    -0.705835,
+    0.290199,
+    0,
+    -0.956966,
+    0
+  ],
+  [
+    -2.765828,
+    0.504648,
+    -0.042604,
+    -0.0995,
+    0.486222,
+    0.024159,
+    -0.867816
+  ],
+  [
+    2.494471,
+    0.579846,
+    0.463745,
+    -0.147127,
+    0.102594,
+    0.102584,
+    -0.978419
+  ],
+  [
+    -3.418939,
+    0.182993,
+    -0.228133,
+    -0.503479,
+    -0.496496,
+    0.496496,
+    -0.503479
+  ],
+  [
+    2.36481,
+    0.731579,
+    -0.379687,
+    -0.003312,
+    0.543554,
+    0.184184,
+    0.818911
+  ],
+  [
+    -2.506566,
+    0.243488,
+    -0.554331,
+    0.263393,
+    0.903245,
+    -0.094841,
+    -0.325234
+  ],
+  [
+    2.404243,
+    0.462987,
+    -0.608265,
+    0,
+    0.876912,
+    0,
+    0.480651
+  ],
+  [
+    -2.762663,
+    0.136993,
+    1.321576,
+    -0.381307,
+    0,
+    0.924448,
+    0
+  ],
+  [
+    2.346288,
+    0.227993,
+    0.246532,
+    -0.60895,
+    0.60895,
+    -0.359416,
+    0.359416
+  ],
+  [
+    -2.753706,
+    0.227993,
+    0.610509,
+    -0.09408,
+    0.70082,
+    0.70082,
+    0.09408
+  ],
+  [
+    2.540662,
+    0.127993,
+    0.844396,
+    0,
+    0.749458,
+    0,
+    0.662051
+  ],
+  [
+    -2.846986,
+    0.127993,
+    0.006779,
+    0,
+    0.986928,
+    0,
+    -0.161162
+  ],
+  [
+    2.41589,
+    0.127993,
+    -0.58106,
+    0,
+    0.570402,
+    0,
+    -0.821366
+  ]
+];
+
+export function arrangeBrickPiles(parts) {
+  if (parts.length !== SETTLED_POSES.length) throw new Error('Brick pile poses must be rebaked after changing the castle geometry.');
+  for (const part of parts) {
+    const pose = SETTLED_POSES[part.index];
+    part.staging = new Vector3(...pose.slice(0, 3));
+    part.stagedQuaternion = new Quaternion(...pose.slice(3));
+  }
+  return parts;
+}
diff --git a/assets/js/castle/castle-scene.js b/assets/js/castle/castle-scene.js
new file mode 100644
index 00000000000..b1446a6157e
--- /dev/null
+++ b/assets/js/castle/castle-scene.js
@@ -0,0 +1,273 @@
+/* The castle scene for the Doors home page, from the design mock.
+   The tower builds once, then turns slowly while a colour wave climbs it. hold(true) dismantles it; hold(false) builds the next facade.
+   A studded toy castle, built in courses. Geometry and motion remain independent.
+   Bundle with Three.js using the project's castle build command. */
+import {
+  Scene, OrthographicCamera, WebGLRenderer, HemisphereLight, DirectionalLight,
+  Mesh, PlaneGeometry, ShadowMaterial, Group, Vector3, Quaternion,
+  PCFSoftShadowMap, SRGBColorSpace, ACESFilmicToneMapping
+} from 'three';
+import { createBrickCastle } from './castle-geometry.js';
+import { arrangeBrickPiles } from './castle-piles.js';
+
+const canvas = document.getElementById('castle-canvas');
+const stage = canvas?.parentElement;
+if (canvas) {
+  try {
+    const renderer = new WebGLRenderer({ canvas, antialias: true, alpha: true });
+    renderer.setPixelRatio(Math.min(window.devicePixelRatio || 1, 1.75));
+    renderer.outputColorSpace = SRGBColorSpace;
+    renderer.toneMapping = ACESFilmicToneMapping;
+    renderer.toneMappingExposure = 1.05;
+    renderer.shadowMap.enabled = true;
+    renderer.shadowMap.type = PCFSoftShadowMap;
+    const scene = new Scene();
+    const camera = new OrthographicCamera(-3.7, 3.7, 3, -3, .1, 40);
+    const lookAt = new Vector3(0, 1.92, 0);
+    camera.position.set(7.4, 6.4, 10.2);
+    camera.lookAt(lookAt);
+
+    // Neutral studio lighting preserves the stone and the coloured brick facades.
+    scene.add(new HemisphereLight(0xffffff, 0x8b8379, 1.75));
+    const key = new DirectionalLight(0xfffbf6, 3.5);
+    // Higher than the original key light, so the shadow stays inside the canvas.
+    key.position.set(-3, 11, 6);
+    key.castShadow = true;
+    key.shadow.mapSize.set(2048, 2048);
+    key.shadow.camera.left = -6; key.shadow.camera.right = 6;
+    key.shadow.camera.top = 7; key.shadow.camera.bottom = -5;
+    key.shadow.camera.near = .5; key.shadow.camera.far = 22;
+    key.shadow.normalBias = .012;
+    key.shadow.bias = -.00008;
+    key.shadow.radius = 3;
+    scene.add(key);
+    const fill = new DirectionalLight(0xf3f7ff, 1.25);
+    fill.position.set(6, 4, -2); scene.add(fill);
+    const rim = new DirectionalLight(0xffffff, 1.2);
+    rim.position.set(-3, 5, -5); scene.add(rim);
+
+    const { model, assemblyParts, recolourParts, height } = createBrickCastle();
+    const turntable = new Group();
+    turntable.add(model); scene.add(turntable);
+    const ground = new Mesh(new PlaneGeometry(30, 30), new ShadowMaterial({ opacity: .18 }));
+    ground.rotation.x = -Math.PI / 2;
+    ground.position.y = -.035;
+    ground.receiveShadow = true;
+    scene.add(ground);
+
+    const clamp = value => Math.max(0, Math.min(1, value));
+    const smooth = value => { const p = clamp(value); return p * p * (3 - 2 * p); };
+    const easeOut = value => 1 - Math.pow(1 - clamp(value), 3);
+    const rotation = new Quaternion();
+    // Every loose brick has a permanent resting place in one of the two heaps.
+    const parts = [...assemblyParts].sort((a, b) => a.order - b.order).map(({ object, order, palette }, index) => ({
+      object, order, palette, index, rest: object.position.clone(), quaternion: object.quaternion.clone()
+    }));
+    arrangeBrickPiles(parts);
+    // The wave climbs by height, across moving and fixed bricks alike.
+    const recoloured = recolourParts.map(({ object, palette }) => ({ object, palette, rest: object.position.clone() }));
+    const waveLevels = [...parts, ...recoloured].map(part => part.rest.y);
+    const waveLow = Math.min(...waveLevels), waveHigh = Math.max(...waveLevels);
+    const waveHeight = part => (part.rest.y - waveLow) / (waveHigh - waveLow);
+    const cycleLength = 21;
+    const buildStart = 1.25;
+    const buildDuration = 7.75;
+    const reverseStart = 12.35;
+    const reverseDuration = 6.2;
+    let valid = true, lastTime = 0, origin = 0, replayPending = false, progressOverride = null;
+    const reduced = matchMedia('(prefers-reduced-motion: reduce)');
+    const variants = ['stone', 'pride', 'brick'];
+    // The first view is always the grey stone tower closest to the FORRT logo.
+    const startingVariant = 0;
+    const builtAt = buildStart + buildDuration;
+    const waveLength = 15, waveRest = 30, turnSeconds = 120;
+    let facade = startingVariant, previous = startingVariant, settledAt = builtAt, nextWaveAt = builtAt + waveRest, waveStart = null;
+    let held = false, rebuilding = null, spin = 0, spinFrom = 0, lastLocal = 0;
+    const name = index => variants[index % variants.length];
+
+    // Maps page time to the original timeline, the facade colours and any recolouring wave.
+    function timeline(time) {
+      if (!rebuilding && held && time >= settledAt) { rebuilding = { start: time, buildAt: null, recolour: false }; spinFrom = spin; }
+      if (waveStart !== null && time - waveStart >= waveLength) { waveStart = null; previous = facade; nextWaveAt = time + waveRest; }
+      if (!rebuilding && waveStart === null && time >= nextWaveAt) { previous = facade; facade += 1; waveStart = time; }
+      const wave = waveStart === null ? undefined : (time - waveStart) / waveLength;
+      const flow = { target: name(facade), previous: name(previous), wave };
+      if (!rebuilding) return { ...flow, t: Math.min(time, builtAt) };
+      if (rebuilding.buildAt === null) {
+        const r = time - rebuilding.start;
+        // A dismantle always finishes; bricks stay in their heaps until the visitor moves away.
+        if (r < reverseDuration || held) return { ...flow, t: reverseStart + Math.min(r, reverseDuration) };
+        rebuilding.buildAt = time;
+        // A wave still climbing the fixed courses keeps its colours; otherwise the build brings the next facade.
+        if (waveStart === null) { previous = facade; facade += 1; rebuilding.recolour = true; }
+      }
+      const t = buildStart + time - rebuilding.buildAt;
+      const build = rebuilding.recolour ? clamp((t - buildStart) / buildDuration) : undefined;
+      if (t < builtAt) return { target: name(facade), previous: name(previous), wave, build, t };
+      if (waveStart === null) { previous = facade; nextWaveAt = time + waveRest; }
+      settledAt = time; rebuilding = null;
+      return { target: name(facade), previous: name(previous), wave, t: builtAt };
+    }
+    function hold(value) { held = Boolean(value); }
+    let variantMode = 'auto';
+
+    function setVariant(variant) {
+      if (variant !== 'auto' && !variants.includes(variant)) return;
+      variantMode = variant;
+      render();
+    }
+
+    function place(part, amount, dismantling = false) {
+      const p = clamp(amount);
+      const clearance = Math.max(height + .30, part.rest.y + .62);
+      if (p === 1) {
+        part.object.position.copy(part.rest);
+        part.object.quaternion.copy(part.quaternion);
+      } else if (p === 0) {
+        part.object.position.copy(part.staging);
+        part.object.quaternion.copy(part.stagedQuaternion);
+      } else if (dismantling) {
+        const departure = 1 - p;
+        if (departure < .22) {
+          // Unseat vertically before carrying the brick clear of the battlements.
+          part.object.position.copy(part.rest);
+          part.object.position.y += (clearance - part.rest.y) * smooth(departure / .22);
+        } else if (departure < .57) {
+          part.object.position.lerpVectors(part.rest, part.staging, smooth((departure - .22) / .35));
+          part.object.position.y = clearance;
+        } else {
+          // Gravity-like acceleration into the heap, then one small settling bounce.
+          const drop = clamp((departure - .57) / .34);
+          part.object.position.copy(part.staging);
+          part.object.position.y += (clearance - part.staging.y) * (1 - drop * drop);
+          if (departure > .91) {
+            const settle = (departure - .91) / .09;
+            part.object.position.y += Math.sin(settle * Math.PI) * .055 * (1 - settle);
+          }
+        }
+        rotation.copy(part.quaternion).slerp(part.stagedQuaternion, smooth((departure - .18) / .73));
+        part.object.quaternion.copy(rotation);
+      } else {
+        if (p < .24) {
+          part.object.position.copy(part.staging);
+          part.object.position.y += (clearance - part.staging.y) * smooth(p / .24);
+        } else if (p < .78) {
+          part.object.position.lerpVectors(part.staging, part.rest, smooth((p - .24) / .54));
+          part.object.position.y = clearance;
+        } else {
+          part.object.position.copy(part.rest);
+          part.object.position.y += (clearance - part.rest.y) * (1 - easeOut((p - .78) / .22));
+        }
+        rotation.copy(part.stagedQuaternion).slerp(part.quaternion, smooth(p / .70));
+        part.object.quaternion.copy(rotation);
+      }
+    }
+
+    const lift = .05;
+    const climb = (phase, part) => smooth((phase - waveHeight(part) * .6) / .4);
+
+    function assemblyAt(time) {
+      const flow = timeline(time);
+      const t = flow.t;
+      const reducedStatic = reduced.matches && !document.body.classList.contains('motion-opt-in');
+      const targetVariant = variantMode === 'auto' ? flow.target : variantMode;
+      const previousVariant = variantMode === 'auto' ? flow.previous : variantMode;
+      stage.dataset.variant = targetVariant;
+      const lastIndex = Math.max(1, parts.length - 1);
+      const waving = flow.wave !== undefined && progressOverride === null && !reducedStatic;
+      const climbing = waving ? flow.wave : progressOverride === null && !reducedStatic ? flow.build : undefined;
+      for (const part of recoloured) {
+        const colourProgress = climbing === undefined ? 1 : climb(climbing, part);
+        for (const colours of part.palette) colours.material.color.lerpColors(colours[previousVariant], colours[targetVariant], colourProgress);
+        part.object.position.y = part.rest.y + (waving ? Math.sin(colourProgress * Math.PI) * lift : 0);
+      }
+      let assembled = 0;
+      for (const part of parts) {
+        const fraction = part.index / lastIndex;
+        let amount;
+        if (progressOverride !== null || reducedStatic) {
+          // Scrubbing represents construction progress, independent of the loop.
+          const progress = reducedStatic && progressOverride === null ? 1 : progressOverride;
+          const local = (progress * (buildDuration + .8) - fraction * buildDuration) / .8;
+          amount = clamp(local);
+        } else if (t < reverseStart) {
+          const startsAt = buildStart + fraction * (buildDuration - .8);
+          const local = (t - startsAt) / .8;
+          amount = clamp(local);
+        } else {
+          // Top courses leave first and become the bottom of each persistent heap.
+          const startsAt = reverseStart + (1 - fraction) * (reverseDuration - 1.1);
+          const local = (t - startsAt) / 1.1;
+          amount = 1 - clamp(local);
+        }
+        // Incoming bricks bring the next facade's colours; settled outgoing bricks
+        // retain theirs until they rise into the following build.
+        // A recolouring wave climbs the tower: each brick lifts slightly and comes back in its new colour.
+        const colourProgress = waving ? climb(flow.wave, part) : reducedStatic || progressOverride !== null || t >= reverseStart ? 1 : smooth(amount / .72);
+        for (const colours of part.palette || []) {
+          colours.material.color.lerpColors(colours[previousVariant], colours[targetVariant], colourProgress);
+        }
+        place(part, amount, progressOverride === null && !reducedStatic && t >= reverseStart);
+        if (waving && amount > .999) part.object.position.y += Math.sin(colourProgress * Math.PI) * lift;
+        if (amount > .999) assembled++;
+      }
+      stage.dataset.assembly = assembled === parts.length ? 'complete' : 'building';
+      stage.dataset.looseBricks = String(parts.length - assembled);
+      stage.dataset.assemblyProgress = String(Math.round(assembled / Math.max(parts.length, 1) * 100));
+    }
+
+    function resize() {
+      const { width, height: stageHeight } = stage.getBoundingClientRect();
+      if (!width || !stageHeight) return;
+      renderer.setSize(width, stageHeight, false);
+      const aspect = width / stageHeight;
+      // Leave room for both persistent heaps and the airborne pieces on every screen.
+      const halfHeight = Math.max(3.25, 3.6 / aspect);
+      camera.left = -halfHeight * aspect; camera.right = halfHeight * aspect;
+      camera.top = halfHeight; camera.bottom = -halfHeight;
+      camera.updateProjectionMatrix();
+    }
+
+    function render(time = lastTime, x = 0, y = 0) {
+      if (!valid) return;
+      lastTime = Number.isFinite(time) ? time : lastTime;
+      if (replayPending) { origin = lastTime; replayPending = false; }
+      const localTime = lastTime - origin;
+      const still = reduced.matches && !document.body.classList.contains('motion-opt-in');
+      if (!still && progressOverride === null) {
+        const dt = Math.max(0, Math.min(.1, localTime - lastLocal));
+        if (rebuilding) {
+          // Come back to the front before the heaps form, so they stay in frame.
+          const home = Math.round(spinFrom / (Math.PI * 2)) * Math.PI * 2;
+          spin = spinFrom + (home - spinFrom) * smooth((localTime - rebuilding.start) / 2.5);
+        } else if (localTime > settledAt) {
+          spin += dt * Math.PI * 2 / turnSeconds * clamp((localTime - settledAt) / 6);
+        }
+      }
+      lastLocal = localTime;
+      turntable.rotation.y = still ? 0 : spin + x * .15;
+      camera.position.y = 6.4 + (still ? 0 : y * .35);
+      camera.lookAt(lookAt);
+      assemblyAt(localTime);
+      renderer.render(scene, camera);
+    }
+
+    function replay() { progressOverride = null; replayPending = true; }
+    function setProgress(value) { progressOverride = clamp(Number(value) || 0); render(); }
+    function clearProgress() { progressOverride = null; render(); }
+    function seek(seconds) { origin = lastTime - Math.max(0, Number(seconds) || 0); progressOverride = null; replayPending = false; render(); }
+
+    canvas.addEventListener('webglcontextlost', event => {
+      event.preventDefault(); valid = false; stage.dataset.engine = 'fallback';
+    });
+    canvas.addEventListener('webglcontextrestored', () => {
+      valid = true; stage.dataset.engine = 'webgl'; resize(); render();
+    });
+    window.forrtCastle = { hold, setSpin(value) { spin = value; render(); }, resize, render, replay, setProgress, clearProgress, seek, setVariant,
+      info: { cycleLength, buildStart, buildDuration, reverseStart, reverseDuration, movingBricks: parts.length, height, variants, startingStyle: variants[startingVariant] } };
+    resize(); render(); stage.dataset.engine = 'webgl';
+  } catch (error) {
+    stage.dataset.engine = 'fallback';
+    console.warn('Castle using static fallback:', error.message);
+  }
+}
diff --git a/assets/js/castle/illustrations-render.js b/assets/js/castle/illustrations-render.js
new file mode 100644
index 00000000000..22c8c403f3e
--- /dev/null
+++ b/assets/js/castle/illustrations-render.js
@@ -0,0 +1,127 @@
+/* Reproducible orthographic illustrations. No motion, controls or page dependencies. */
+import * as T from 'three';
+import { RoundedBoxGeometry } from 'three/addons/geometries/RoundedBoxGeometry.js';
+const colors={bark:'#8a5a36',leaf:'#2f9e5f',leaf2:'#47b56e',leaf3:'#1f8650',pink:'#e58a9a',lead:'#38404a',wood:'#c98f55',board:'#27594f',chalk:'#f4f1e5',red:'#d8402f',orange:'#ee8a26',yellow:'#efc23a',grass:'#2f9e5f',azure:'#2a6fc4',purple:'#7a4fb0',teal:'#2a8c84',navy:'#1f3a6e',slate:'#637078',blue:'#3156a4',ochre:'#d59b42',green:'#527869',rose:'#b97176',cream:'#f4f1e5',paper:'#f9f7ee',edge:'#d8d7cb',ink:'#a6adb0'};
+const mats=Object.fromEntries(Object.entries(colors).map(([k,c])=>[k,new T.MeshStandardMaterial({color:c,roughness:.32,metalness:0})]));
+const scene=new T.Scene();
+const renderer=new T.WebGLRenderer({canvas:document.querySelector('canvas'),alpha:true,antialias:true,preserveDrawingBuffer:true});renderer.setSize(1200,800);renderer.setPixelRatio(2);renderer.outputColorSpace=T.SRGBColorSpace;renderer.toneMapping=T.ACESFilmicToneMapping;renderer.toneMappingExposure=1.05;renderer.shadowMap.enabled=true;renderer.shadowMap.type=T.PCFSoftShadowMap;
+scene.add(new T.HemisphereLight(0xffffff,0x8b8379,1.75));
+const key=new T.DirectionalLight(0xfffbf6,3.5);key.position.set(-4.5,8,7);key.castShadow=true;key.shadow.mapSize.set(4096,4096);Object.assign(key.shadow.camera,{left:-8,right:8,top:8,bottom:-8,near:.1,far:25});key.shadow.normalBias=.009;key.shadow.bias=-.00005;key.shadow.radius=4;scene.add(key);
+for(const [color,intensity,pos] of [[0xf3f7ff,1.25,[6,4,-2]],[0xffffff,1.2,[-3,5,-5]]]){const light=new T.DirectionalLight(color,intensity);light.position.set(...pos);scene.add(light);}
+const ground=new T.Mesh(new T.PlaneGeometry(30,30),new T.ShadowMaterial({opacity:.15}));ground.rotation.x=-Math.PI/2;ground.position.y=-.015;ground.receiveShadow=true;scene.add(ground);
+const model=new T.Group();scene.add(model);
+function box(parent,w,h,d,mat,x=0,y=0,z=0,r=.035){const m=new T.Mesh(new RoundedBoxGeometry(w,h,d,3,Math.min(r,h/3,w/3,d/3)),mats[mat]);m.position.set(x,y,z);m.castShadow=true;m.receiveShadow=true;parent.add(m);return m;}
+function cylinder(parent,r,h,mat,x,y,z){const m=new T.Mesh(new T.CylinderGeometry(r,r,h,40,1),mats[mat]);m.position.set(x,y,z);m.castShadow=true;m.receiveShadow=true;parent.add(m);return m;}
+function brick(parent,nx,nz,mat,x,y,z,rotation=0,height=.31){const g=new T.Group();g.position.set(x,y,z);g.rotation.y=rotation;parent.add(g);const unit=.42;box(g,nx*unit-.02,height,nz*unit-.02,mat,0,height/2,0,.035);for(let ix=0;ix<nx;ix++)for(let iz=0;iz<nz;iz++)cylinder(g,.126,.075,mat,(ix-(nx-1)/2)*unit,height+.035,(iz-(nz-1)/2)*unit);return g;}
+
+// Saturated counterparts to the Pride tower: tall, solid objects that fill an arched window.
+function book(y,w,d,h,cover,x,rot){
+  const g=new T.Group();g.position.set(x,y,0);g.rotation.y=rot;model.add(g);
+  box(g,w,.07,d,cover,0,.035,0,.03);box(g,w,.07,d,cover,0,h-.035,0,.03);box(g,.1,h,d,cover,-w/2+.05,h/2,0,.04);
+  box(g,w-.16,h-.14,d-.12,'paper',.04,h/2,0,.015);
+  for(let n=1;n<5;n++)box(g,.006,h-.17,d-.1,'edge',w/2-.1,h/2,0,.002),box(g,w-.16,.006,.006,'edge',.04,.07+n*(h-.14)/5,d/2-.06,.002);
+  box(g,.1,h*.5,.012,'yellow',-w/2+.05,h/2,d/2+.002,.003);
+}
+function education(){
+  const stack=[[3.2,2.3,.56,'grass',-.04],[2.9,2.15,.46,'azure',.09],[3.0,2.1,.52,'red',-.1],[2.6,1.95,.42,'yellow',.06],[2.5,1.85,.5,'teal',-.05]];
+  let y=0;for(const [w,d,h,c,r] of stack){book(y,w,d,h,c,(r>0?.08:-.06),r);y+=h;}
+  // An open book resting on top, pages up.
+  const top=new T.Group();top.position.set(0,y,0);top.rotation.y=-.08;model.add(top);
+  for(const side of [-1,1]){const leaf=new T.Group();leaf.position.set(side*.88,.1,0);leaf.rotation.z=side*.12;top.add(leaf);
+    box(leaf,1.78,.07,1.75,'navy',0,-.03,0,.03);box(leaf,1.66,.15,1.63,'paper',0,.07,0,.02);
+    for(let r=0;r<5;r++)box(leaf,1.05,.008,.03,'ink',0,.15,-.5+r*.25,.003);}
+  brick(model,2,2,'orange',2.55,0,.85,-.2);brick(model,2,2,'yellow',2.55,.31,.85,-.2);brick(model,1,2,'grass',-2.35,0,1.0,.16);
+}
+function towerPair(x,swap){
+  const g=new T.Group();g.position.x=x;model.add(g);
+  const bands=['navy','navy','azure','azure','teal','azure','navy'];
+  bands.forEach((c,level)=>{for(let a=0;a<2;a++)for(let b=0;b<2;b++){const odd=level%2?.21:0;
+    const col=(swap&&level===3&&a===1&&b===1)?'orange':c;brick(g,2,2,col,(a-.5)*.84,level*.31,(b-.5)*.84);}});
+  brick(g,1,1,'yellow',0,bands.length*.31,0,0,.2);
+}
+function research(){
+  towerPair(-1.25,false);towerPair(1.25,true);
+  // A magnifying glass held up to the second structure.
+  const lens=new T.Group();lens.position.set(.72,1.16,1.55);lens.rotation.set(-.2,.55,.0);model.add(lens);
+  const ring=new T.Mesh(new T.TorusGeometry(.72,.09,24,64),mats.red);ring.castShadow=true;lens.add(ring);
+  const glass=new T.Mesh(new T.CircleGeometry(.68,64),new T.MeshStandardMaterial({color:'#dff1fb',transparent:true,opacity:.3,roughness:.1,side:T.DoubleSide}));lens.add(glass);
+  const handle=new T.Mesh(new T.CylinderGeometry(.09,.09,1.05,24),mats.navy);handle.position.set(.72*.7+.37,-.72*.7-.37,0);handle.rotation.z=Math.PI/4;handle.castShadow=true;lens.add(handle);
+  brick(model,2,2,'orange',-2.6,0,1.3,.2);brick(model,1,2,'yellow',2.75,0,1.0,-.16);
+}
+function person(x,z,a,c,scale=1){
+  const g=new T.Group();g.position.set(x,0,z);g.rotation.y=a;g.scale.setScalar(scale);model.add(g);
+  brick(g,2,1,c,0,0,0,0,.42);brick(g,2,1,c,0,.42,0,0,.42);
+  box(g,.3,.1,.2,'cream',0,.89,0,.03);
+  const head=new T.Mesh(new T.CylinderGeometry(.24,.24,.36,32),mats.yellow);head.position.set(0,1.11,0);head.castShadow=true;g.add(head);
+  cylinder(g,.11,.09,'yellow',0,1.33,0);
+}
+function community(){
+  // People gathered in a circle, with a space left open and someone arriving.
+  const r=1.9,n=11,cols=['red','azure','grass','orange','purple','teal','yellow','azure','red','grass','purple'];
+  for(let i=0;i<n;i++){if(i===1||i===2)continue;const a=i/n*Math.PI*2;person(Math.sin(a)*r,Math.cos(a)*r,a,cols[i]);}
+  const a=1.5/n*Math.PI*2;person(Math.sin(a)*(r+1.25),Math.cos(a)*(r+1.25),a+Math.PI*.1,'orange');
+  brick(model,4,4,'slate',0,0,0,.2,.2);brick(model,2,2,'cream',0,.2,0,.2,.2);
+}
+
+function eduTree(){
+  // A tree growing out of an open book: growth from learning.
+  for(const side of [-1,1]){brick(model,4,6,'azure',side*.86,0,0,0,.2);for(let k=0;k<2;k++)brick(model,4-k,6,'cream',side*(.86-k*.21),.2+k*.2,0,0,.2);}
+  for(let l=0;l<7;l++)brick(model,2,2,'bark',0,.6+l*.31,0);
+  const y=2.77,c=['leaf','leaf2','leaf3'];
+  const layer=(n,l)=>{for(let a=0;a<n;a++)for(let b=0;b<n;b++)brick(model,2,2,c[(a*2+b+l)%3],(a-(n-1)/2)*.84,y+l*.31,(b-(n-1)/2)*.84);};
+  layer(3,-1);layer(4,0);layer(4,1);layer(3,2);layer(2,3);
+  for(const [col,x,l,z] of [['red',1.72,1,.75],['yellow',-.75,1,1.72],['red',.9,0,1.72],['yellow',1.72,0,-.6],['red',-.2,2,1.3]])brick(model,1,1,col,x,y+l*.31,z,0,.24);
+}
+function eduCap(){
+  // A mortarboard on a stack of two brick books.
+  let y=0;
+  for(const [c,nx,nz] of [['azure',7,5],['red',6,5]]){brick(model,nx,nz,c,0,y,0,0,.24);brick(model,nx-1,nz,'cream',.1,y+.24,0,0,.14);brick(model,nx,nz,c,0,y+.38,0,0,.14);y+=.52;}
+  for(let l=0;l<3;l++)brick(model,3,3,'navy',0,y+l*.31,0,Math.PI/4);
+  y+=.93;const board=new T.Group();board.position.y=y;board.rotation.y=Math.PI/4;model.add(board);
+  brick(board,6,6,'navy',0,0,0,0,.16);brick(board,1,1,'yellow',0,.16,0,0,.1);
+  box(board,1.2,.05,.06,'yellow',.62,.235,0,.02);
+  box(board,.07,1.0,.07,'yellow',1.22,-.27,0,.02);
+  box(board,.22,.36,.22,'orange',1.22,-.92,0,.05);
+}
+function eduBook(){
+  // A big open book built entirely of bricks, with pages stepping up from the spine.
+  for(const side of [-1,1]){
+    brick(model,7,8,'azure',side*1.5,0,0,0,.2);
+    const steps=[[6,.2],[5,.42],[4,.64]];
+    for(const [n,y] of steps)brick(model,n,7,'cream',side*(.3+n*.21),y,0,0,.22);
+  }
+  brick(model,1,8,'navy',0,0,0,0,.34);
+  box(model,.2,.03,1.3,'red',.5,.87,1.2,.01);
+  brick(model,2,2,'yellow',-1.65,.86,-.3,.18);brick(model,2,1,'grass',-1.55,1.17,-.3,.18);brick(model,2,2,'orange',1.7,.86,-.5,-.2);
+}
+function eduBoard(){
+  // A classroom board on an easel: teaching, in bricks.
+  const g=new T.Group();g.rotation.y=-.1;model.add(g);
+  box(g,3.9,2.5,.16,'wood',0,2.25,0,.05);box(g,3.5,2.1,.18,'board',0,2.25,.015,.02);
+  for(const [w,x,y] of [[2.3,-.35,2.95],[1.7,-.65,2.62],[2.6,-.2,2.29]])box(g,w,.06,.03,'chalk',x,y,.11,.012);
+  // A small chart drawn in chalk on the lower part of the board.
+  for(const [i,h] of [[0,.3],[1,.5],[2,.7],[3,.95]])box(g,.22,h,.03,['yellow','chalk','orange','chalk'][i],.3+i*.34,1.28+h/2,.11,.012);
+  for(const x of [-1.6,1.6]){box(g,.2,3.8,.2,'wood',x,1.9,.3,.05);}
+  box(g,.2,3.7,.2,'wood',0,1.85,-.9,.05);
+  box(g,3.7,.12,.5,'wood',0,.96,.3,.03);
+  brick(g,2,1,'red',-1.1,1.02,.3,0,.18);brick(g,1,1,'yellow',-.3,1.02,.3,0,.18);brick(g,2,1,'azure',.5,1.02,.3,0,.18);
+  brick(model,2,2,'orange',2.5,0,1.3,-.2);brick(model,2,2,'grass',-2.5,0,1.5,.16);
+}
+function eduPencil(){
+  // A tall pencil standing on a brick book, echoing the proportions of the tower.
+  const y0=.86;
+  brick(model,8,6,'grass',0,0,0,0,.24);brick(model,7,6,'cream',.12,.24,0,0,.14);brick(model,7,6,'cream',.12,.38,0,0,.14);brick(model,8,6,'grass',0,.52,0,0,.14);
+  box(model,.1,.66,2.5,'yellow',-1.62,.33,0,.02);
+  const g=new T.Group();g.position.set(0,y0-.2,0);model.add(g);
+  const tip=new T.Mesh(new T.ConeGeometry(.6,.72,6),mats.wood);tip.rotation.x=Math.PI;tip.position.y=.36;tip.castShadow=true;g.add(tip);
+  const lead=new T.Mesh(new T.ConeGeometry(.2,.24,6),mats.lead);lead.rotation.x=Math.PI;lead.position.y=.12;g.add(lead);
+  for(let l=0;l<8;l++)brick(g,3,3,l%2?'orange':'yellow',0,.72+l*.31,0);
+  brick(g,3,3,'cream',0,.72+8*.31,0,0,.2);brick(g,3,3,'pink',0,.72+8*.31+.2,0,0,.31);
+}
+const kind=new URLSearchParams(location.search).get('kind')||'education';({education,research,community,eduTree,eduCap,eduBook,eduBoard,eduPencil}[kind]||education)();
+const bounds=new T.Box3().setFromObject(model);const center=bounds.getCenter(new T.Vector3());
+const camera=new T.OrthographicCamera(-4.7,4.7,3.133,-3.133,.1,40);camera.position.copy(center).add(new T.Vector3(7.4,6.4,10.2));camera.lookAt(center);camera.updateMatrixWorld();
+// Fit actual projected corners with comfortable margins, consistent camera direction.
+let minX=Infinity,maxX=-Infinity,minY=Infinity,maxY=-Infinity;
+for(const x of [bounds.min.x,bounds.max.x])for(const y of [bounds.min.y,bounds.max.y])for(const z of [bounds.min.z,bounds.max.z]){const v=new T.Vector3(x,y,z).applyMatrix4(camera.matrixWorldInverse);minX=Math.min(minX,v.x);maxX=Math.max(maxX,v.x);minY=Math.min(minY,v.y);maxY=Math.max(maxY,v.y);}
+const halfH=Math.max((maxY-minY)/2/.78,(maxX-minX)/3/.80);camera.left=-halfH*1.5;camera.right=halfH*1.5;camera.top=halfH;camera.bottom=-halfH;camera.zoom=kind==='community'?1.24:kind==='research'?1.07:1;camera.updateProjectionMatrix();renderer.render(scene,camera);window.renderReady={kind,objects:model.children.length,bounds:bounds.getSize(new T.Vector3()).toArray()};
diff --git a/assets/js/doors/castle.js b/assets/js/doors/castle.js
new file mode 100644
index 00000000000..f2c499af578
--- /dev/null
+++ b/assets/js/doors/castle.js
@@ -0,0 +1,244 @@
+/* Castle playback on the home page, from the Doors mock's controller.
+   The still image is already on the page. This loads the 3D bundle once the page has painted,
+   then owns playback: pause, hover and tap, and suspension when off screen, in a hidden tab or behind
+   the tower game. It also opens that game.
+   A visitor who paused on an earlier visit keeps the still until they press play. */
+import { isPaused, onMotionChange, prefersReduced } from './motion.js';
+
+const script = document.currentScript;
+const stage = document.querySelector('.castle-stage');
+const canvas = document.getElementById('castle-canvas');
+const hero = document.querySelector('.hero');
+const figure = stage?.closest('figure');
+const pauseButton = figure?.querySelector('.motion-toggle');
+let gameOpen = false;
+let syncCastle = () => {};
+
+// The tower game calls this as it opens and closes, so the castle stops drawing behind it.
+window.forrtHeroSuspend = (open) => {
+  gameOpen = Boolean(open);
+  syncCastle();
+};
+
+function webglAvailable() {
+  try {
+    const test = document.createElement('canvas');
+    // Three.js has required WebGL 2 since r163.
+    return Boolean(test.getContext('webgl2'));
+  } catch {
+    return false;
+  }
+}
+
+function startControls() {
+  const castle = () => window.forrtCastle;
+  let lastTime = 0;
+  let previous = 0;
+  let frame = 0;
+  let visible = true;
+  let pointerX = 0;
+  let pointerY = 0;
+  let targetX = 0;
+  let targetY = 0;
+
+  function draw(time) {
+    pointerX += (targetX - pointerX) * 0.04;
+    pointerY += (targetY - pointerY) * 0.04;
+    castle()?.render(time, pointerX, pointerY);
+  }
+  // For device tests: ?fps shows the frame rate, and ?fps=20 also caps drawing at that rate.
+  const fps = new URLSearchParams(location.search).get('fps');
+  const cap = Number(fps) > 0 ? 1000 / Number(fps) : 0;
+  let meter;
+  let counted = 0;
+  let countedSince = 0;
+  function count(ms) {
+    if (!meter) {
+      meter = document.createElement('output');
+      meter.style.cssText = 'position:fixed;top:0;left:0;z-index:9999;padding:4px 8px;background:#000;color:#fff;font:16px monospace';
+      document.body.append(meter);
+    }
+    if (!countedSince) {
+      countedSince = ms;
+      return;
+    }
+    counted += 1;
+    if (ms - countedSince >= 1000) {
+      meter.textContent = `${Math.round(counted * 1000 / (ms - countedSince))} fps`;
+      counted = 0;
+      countedSince = ms;
+    }
+  }
+  function loop(ms) {
+    frame = 0;
+    if (isPaused() || gameOpen || document.hidden || !visible) return;
+    if (cap && previous && ms - previous < cap) {
+      frame = requestAnimationFrame(loop);
+      return;
+    }
+    lastTime += Math.min(cap ? cap / 1000 : 0.045, ms - (previous || ms) > 0 ? (ms - (previous || ms)) / 1000 : 0);
+    previous = ms;
+    draw(lastTime);
+    if (fps !== null) count(ms);
+    frame = requestAnimationFrame(loop);
+  }
+  function start() {
+    if (!frame && !isPaused() && !gameOpen && visible && !document.hidden) {
+      previous = 0;
+      counted = 0;
+      countedSince = 0;
+      frame = requestAnimationFrame(loop);
+    }
+  }
+  function syncMotion() {
+    if (isPaused() || gameOpen || document.hidden || !visible) {
+      cancelAnimationFrame(frame);
+      frame = 0;
+    } else {
+      start();
+    }
+  }
+  // Also draws once as the game closes, because a resize behind it clears the canvas and a paused
+  // castle would otherwise stay blank.
+  syncCastle = () => {
+    syncMotion();
+    if (!gameOpen) draw(lastTime);
+  };
+  onMotionChange(() => {
+    syncMotion();
+    draw(lastTime);
+  });
+
+  hero.addEventListener('pointermove', (event) => {
+    if (isPaused() || event.pointerType === 'touch') return;
+    const box = hero.getBoundingClientRect();
+    targetX = (event.clientX - box.left) / box.width - 0.5;
+    targetY = (event.clientY - box.top) / box.height - 0.5;
+  });
+  hero.addEventListener('pointerleave', () => {
+    targetX = 0;
+    targetY = 0;
+  });
+
+  new IntersectionObserver((entries) => {
+    visible = entries[0].isIntersecting;
+    syncMotion();
+  }, { threshold: 0 }).observe(stage);
+  document.addEventListener('visibilitychange', syncMotion);
+  window.addEventListener('resize', () => {
+    castle()?.resize();
+    if (!gameOpen) draw(lastTime);
+  });
+
+  castle()?.resize();
+  draw(0);
+  start();
+}
+
+/* Hovering with a mouse dismantles the tower, after a short dwell so a passing cursor does nothing;
+   leaving rebuilds it. A tap does the same on touch screens and reveals the pause button; the bricks
+   stay down until the next tap. The figure, not the stage, owns hover, so moving onto the pause
+   button does not start the rebuild. Set up before the bundle arrives, so that a visitor who paused
+   earlier can still find the play button by tapping. */
+function watchPointer() {
+  const castle = () => window.forrtCastle;
+  let dwell = 0;
+  let tapHeld = false;
+  let lastPointer = 'mouse';
+  let revealedAt = -Infinity;
+  figure.addEventListener('pointerenter', (event) => {
+    if (event.pointerType === 'mouse' && !isPaused()) {
+      dwell = setTimeout(() => castle()?.hold(true), 400);
+    }
+  });
+  figure.addEventListener('pointerleave', (event) => {
+    if (event.pointerType === 'mouse') {
+      clearTimeout(dwell);
+      castle()?.hold(false);
+    }
+  });
+  stage.addEventListener('pointerdown', (event) => {
+    lastPointer = event.pointerType;
+  });
+  stage.addEventListener('click', () => {
+    if (lastPointer === 'mouse') return;
+    if (!figure.classList.contains('show-motion-control')) revealedAt = performance.now();
+    figure.classList.add('show-motion-control');
+    if (isPaused() || !castle()) return;
+    tapHeld = !tapHeld;
+    castle()?.hold(tapHeld);
+  });
+  // A quick second tap on the tower must not land on a button the first tap has just revealed.
+  figure.querySelector('.motion-bar').addEventListener('click', (event) => {
+    if (performance.now() - revealedAt < 350) event.stopPropagation();
+  }, true);
+}
+
+/* "Build it yourself" opens the tower game. Nobody downloads the game until they press this. It sets
+   window.towerGame, and finds its physics file beside itself. Without WebGL the button stays hidden. */
+function watchBuildButton() {
+  const button = figure.querySelector('.tower-entry');
+  if (!button) return;
+  const label = button.textContent;
+  let loading = false;
+  button.hidden = false;
+  button.addEventListener('click', () => {
+    if (window.towerGame) {
+      window.towerGame.open();
+      return;
+    }
+    if (loading) return;
+    loading = true;
+    button.textContent = 'Loading…';
+    const game = document.createElement('script');
+    game.src = button.dataset.game;
+    game.onload = () => {
+      loading = false;
+      button.textContent = label;
+      window.towerGame.open();
+    };
+    game.onerror = () => {
+      loading = false;
+      button.textContent = 'Could not load the game';
+    };
+    document.body.append(game);
+  });
+}
+
+function allowed() {
+  return Boolean(script?.dataset.castleBundle) && !prefersReduced() && navigator.connection?.saveData !== true && webglAvailable();
+}
+
+let requested = false;
+
+function loadBundle() {
+  // Settings can change during the wait for the first paint.
+  if (requested || !allowed() || isPaused()) return;
+  requested = true;
+  const bundle = document.createElement('script');
+  bundle.src = script.dataset.castleBundle;
+  bundle.onload = () => {
+    if (window.forrtCastle) startControls();
+  };
+  document.body.append(bundle);
+}
+
+if (stage && canvas && webglAvailable()) {
+  // Also under reduced motion and Save-Data, where a tap still has to reveal the button.
+  watchPointer();
+  watchBuildButton();
+}
+if (stage && canvas && allowed()) {
+  onMotionChange(loadBundle);
+  // Wait for the first paint, then for the browser to have a moment to spare.
+  const afterPaint = () => requestAnimationFrame(() => {
+    if (window.requestIdleCallback) requestIdleCallback(loadBundle, { timeout: 1500 });
+    else setTimeout(loadBundle, 0);
+  });
+  if (document.readyState === 'complete') afterPaint();
+  else window.addEventListener('load', afterPaint, { once: true });
+} else if (pauseButton) {
+  // Nothing here will ever move, so the castle's button has no job.
+  pauseButton.dataset.unusable = 'true';
+  pauseButton.hidden = true;
+}
diff --git a/assets/js/doors/citation-matches.js b/assets/js/doors/citation-matches.js
new file mode 100644
index 00000000000..9fb6991393e
--- /dev/null
+++ b/assets/js/doors/citation-matches.js
@@ -0,0 +1,37 @@
+/* Pure matching logic: only a unique first-author/year pair among this term's references
+   can become a link. In particular, two works from the same author/year stay plain text. */
+const escapeRE = (text) => text.replace(/[.*+?^${}()|[\]\\]/g, '\\$&');
+const normalise = (text) => text.normalize('NFC').toLocaleLowerCase();
+
+export function citationMatches(text, references) {
+  const groups = new Map();
+  for (const ref of references) {
+    if (!ref.first || !ref.year) continue;
+    const pair = `${normalise(ref.first)}\0${normalise(ref.year)}`;
+    const group = groups.get(pair) || [];
+    group.push(ref);
+    groups.set(pair, group);
+  }
+  const matches = [];
+  for (const group of groups.values()) {
+    if (group.length !== 1) continue;
+    const ref = group[0];
+    const names = ref.authors || [ref.first];
+    const rest = names.slice(1);
+    const full = rest.map((name, index) => index === rest.length - 1
+      ? String.raw`,?\s+(?:&|and)\s+${escapeRE(name)}`
+      : String.raw`,\s*${escapeRE(name)}`).join('');
+    let others = full;
+    if (ref.etal) others = full ? String.raw`(?:\s+et\s+al\.?|${full})` : String.raw`\s+et\s+al\.?`;
+    const pattern = new RegExp(String.raw`(?<![\p{L}\p{M}\p{N}])${escapeRE(ref.first)}${others}(?:(?:,\s*|\s+)${escapeRE(ref.year)}|\s+\(${escapeRE(ref.year)}\))(?![\p{L}\p{N}])`, 'giu');
+    for (let match; (match = pattern.exec(text));) {
+      // A coauthor or the end of a longer surname is not the first author.
+      const before = text.slice(0, match.index);
+      if (/(?:,|&|\band)\s*$/iu.test(before) || /\b(?:van(?:\s+den)?|von|de(?:\s+la)?|del|da|der|di|le|la)\s+$/iu.test(before)) continue;
+      matches.push({ start: match.index, end: match.index + match[0].length, key: ref.key });
+    }
+  }
+  // Longer surnames win over their suffixes (e.g. van den Berg / Berg).
+  matches.sort((a, b) => a.start - b.start || b.end - a.end);
+  return matches.filter((match, index) => !matches.slice(0, index).some((other) => match.start < other.end && match.end > other.start));
+}
diff --git a/assets/js/doors/citations.js b/assets/js/doors/citations.js
new file mode 100644
index 00000000000..b0c9ad670a6
--- /dev/null
+++ b/assets/js/doors/citations.js
@@ -0,0 +1,76 @@
+import { registerPopover } from './popover.js';
+import { citationMatches } from './citation-matches.js';
+import { referenceText } from './references.js';
+
+// Glossary generators already expand citekeys to APA strings. The template recovers their
+// keys and metadata; residual references still get a stable local id, never a guessed key.
+const entries = [...document.querySelectorAll('[data-reference]')];
+const references = new Map(entries.map((entry) => [entry.dataset.reference, entry]));
+const termReferences = entries.filter((entry) => entry.closest('.glossary-layout')).map((entry) => ({
+  key: entry.dataset.reference, first: entry.dataset.firstAuthor, year: entry.dataset.year,
+  authors: JSON.parse(entry.dataset.authors), etal: entry.dataset.etal === 'true',
+}));
+
+document.querySelectorAll('.term-definition,.term-alt-definition').forEach((definition) => {
+  const walker = document.createTreeWalker(definition, NodeFilter.SHOW_TEXT, {
+    acceptNode: (node) => node.parentElement.closest('a,button,code,script,style') ? NodeFilter.FILTER_REJECT : NodeFilter.FILTER_ACCEPT,
+  });
+  const nodes = [];
+  while (walker.nextNode()) nodes.push(walker.currentNode);
+  for (const node of nodes) {
+    const matches = citationMatches(node.textContent, termReferences);
+    if (!matches.length) continue;
+    const fragment = document.createDocumentFragment();
+    let offset = 0;
+    for (const match of matches) {
+      fragment.append(node.textContent.slice(offset, match.start));
+      const link = document.createElement('a');
+      link.className = 'cite';
+      link.href = `#ref-${match.key}`;
+      link.dataset.cite = match.key;
+      link.textContent = node.textContent.slice(match.start, match.end);
+      fragment.append(link);
+      offset = match.end;
+    }
+    fragment.append(node.textContent.slice(offset));
+    node.replaceWith(fragment);
+  }
+});
+
+registerPopover('a.cite[data-cite]', (trigger) => {
+  const entry = references.get(trigger.dataset.cite);
+  if (!entry) return null;
+  const content = document.createElement('div');
+  const reference = document.createElement('div');
+  reference.append(...[...entry.childNodes].map((node) => node.cloneNode(true)));
+  content.append(reference);
+  const actions = document.createElement('div');
+  actions.className = 'popover-actions';
+  // Offer the source separately only when the reference itself doesn't already link it.
+  if (entry.dataset.source && !reference.querySelector('a[href]')) {
+    const open = document.createElement('a');
+    open.href = entry.dataset.source;
+    open.target = '_blank';
+    open.rel = 'noopener';
+    open.textContent = 'Open source ↗';
+    actions.append(open);
+  }
+  const copy = document.createElement('button');
+  copy.type = 'button';
+  copy.textContent = 'Copy reference';
+  copy.setAttribute('aria-live', 'polite');
+  let reset;
+  copy.addEventListener('click', async () => {
+    try {
+      await navigator.clipboard.writeText(referenceText(reference));
+      copy.textContent = 'Copied';
+    } catch {
+      copy.textContent = 'Copy failed';
+    }
+    clearTimeout(reset);
+    reset = setTimeout(() => { copy.textContent = 'Copy reference'; }, 1500);
+  });
+  actions.append(copy);
+  content.append(actions);
+  return content;
+}, { label: 'Reference' });
diff --git a/assets/js/doors/glossary.js b/assets/js/doors/glossary.js
new file mode 100644
index 00000000000..a0ed3feeb9a
--- /dev/null
+++ b/assets/js/doors/glossary.js
@@ -0,0 +1,135 @@
+import { openPopover, closePopover } from './popover.js';
+
+// Glossary links navigate on mouse click and Enter. Their focus/touch rules differ
+// from citation registration, so use the shared opening primitive directly.
+const selector = 'a.gloss-term[data-term]';
+let lookup;
+let opening;
+let closing;
+let request = 0;
+let pointerFocus = false;
+let touchTrigger;
+let changingPopover = false;
+
+function loadIndex() {
+  if (!lookup) {
+    lookup = fetch(document.querySelector('meta[name="glossary-index"]').content)
+      .then((response) => {
+        if (!response.ok) throw new Error('Glossary index unavailable');
+        return response.json();
+      }).catch((error) => { lookup = null; throw error; });
+  }
+  return lookup;
+}
+
+function panelFor(trigger) {
+  return document.getElementById(trigger.getAttribute('aria-controls'));
+}
+
+function cancelOpening() {
+  clearTimeout(opening);
+  request += 1;
+}
+
+async function show(trigger, mode, data = loadIndex()) {
+  const attempt = ++request;
+  try {
+    const terms = await data;
+    if (attempt !== request || !trigger.isConnected) return;
+    if (mode === 'hover' && !trigger.matches(':hover')) return;
+    if (mode === 'focus' && document.activeElement !== trigger) return;
+    const term = terms[trigger.dataset.term];
+    if (!term) return;
+    const content = document.createElement('div');
+    const title = document.createElement('p');
+    title.className = 'gloss-popover-title';
+    title.textContent = term.title;
+    const summary = document.createElement('div');
+    summary.textContent = term.summary;
+    const actions = document.createElement('div');
+    actions.className = 'popover-actions';
+    const full = document.createElement('a');
+    full.href = term.url;
+    full.textContent = 'Read the full definition →';
+    actions.append(full);
+    content.append(title, summary, actions);
+    // `hover` is the primitive's no-focus-transfer option, also needed for keyboard focus.
+    changingPopover = true;
+    try {
+      openPopover(trigger, content, { label: `Glossary: ${term.title}`, hover: mode !== 'touch' });
+      // Replacing a touch/citation panel restores its old trigger's focus. Keep
+      // an incoming keyboard focus on the glossary link the reader moved to.
+      if (mode === 'focus' && document.activeElement !== trigger) trigger.focus({ preventScroll: true });
+    } finally {
+      changingPopover = false;
+    }
+  } catch {
+    // Hover/focus keep their ordinary link; a failed first tap follows it too.
+    if (mode === 'touch' && attempt === request) location.assign(trigger.href);
+  }
+}
+
+document.addEventListener('pointerover', (event) => {
+  if (event.pointerType === 'touch') return;
+  const trigger = event.target.closest(selector);
+  if (!trigger || trigger.contains(event.relatedTarget)) return;
+  clearTimeout(closing);
+  cancelOpening();
+  const data = loadIndex();
+  data.catch(() => {});
+  // Returning from the panel clears the shared primitive's pending hover close.
+  if (panelFor(trigger)) show(trigger, 'hover', data);
+  else opening = setTimeout(() => show(trigger, 'hover', data), 250);
+});
+
+document.addEventListener('pointerout', (event) => {
+  if (event.pointerType === 'touch') return;
+  const trigger = event.target.closest(selector);
+  if (!trigger || trigger.contains(event.relatedTarget)) return;
+  cancelOpening();
+  const panel = panelFor(trigger);
+  if (!panel || panel.contains(event.relatedTarget)) return;
+  closing = setTimeout(() => {
+    if (panelFor(trigger) === panel && !panel.matches(':hover') && document.activeElement !== trigger) closePopover();
+  }, 200);
+});
+
+document.addEventListener('focusin', (event) => {
+  const trigger = event.target.closest(selector);
+  if (!trigger || pointerFocus || changingPopover) return;
+  clearTimeout(closing);
+  cancelOpening();
+  show(trigger, 'focus');
+});
+document.addEventListener('focusout', (event) => {
+  const trigger = event.target.closest(selector);
+  if (!trigger || panelFor(trigger)?.contains(event.relatedTarget)) return;
+  cancelOpening();
+  if (panelFor(trigger)) closePopover();
+});
+
+document.addEventListener('pointerdown', (event) => {
+  pointerFocus = true;
+  touchTrigger = event.pointerType === 'touch' ? event.target.closest(selector) : null;
+  if (!event.target.closest(`${selector},.doors-popover`)) cancelOpening();
+});
+document.addEventListener('pointercancel', () => { touchTrigger = null; });
+document.addEventListener('click', (event) => {
+  const trigger = event.target.closest(selector);
+  if (!trigger || (event.pointerType !== 'touch' && trigger !== touchTrigger)) return;
+  if (event.button || event.metaKey || event.ctrlKey || event.shiftKey || event.altKey) return;
+  touchTrigger = null;
+  if (panelFor(trigger)) return;
+  event.preventDefault();
+  cancelOpening();
+  show(trigger, 'touch');
+});
+document.addEventListener('keydown', (event) => {
+  if (event.key === 'Tab') pointerFocus = false;
+  if (event.key === 'Escape' || ((event.key === 'Enter' || event.key === ' ') && event.target.closest('.doors-popover-close'))) {
+    // Explicit dismissal returns focus to the trigger; that must not reopen it.
+    pointerFocus = true;
+    cancelOpening();
+    clearTimeout(closing);
+  }
+}, true);
diff --git a/assets/js/doors/home.js b/assets/js/doors/home.js
new file mode 100644
index 00000000000..495d86460fc
--- /dev/null
+++ b/assets/js/doors/home.js
@@ -0,0 +1,4 @@
+/* The home page's script: the shared pause state first, then what obeys it. */
+import './motion.js';
+import './quotes.js';
+import './castle.js';
diff --git a/assets/js/doors/motion.js b/assets/js/doors/motion.js
new file mode 100644
index 00000000000..8af190ff65f
--- /dev/null
+++ b/assets/js/doors/motion.js
@@ -0,0 +1,53 @@
+/* One pause state for everything that moves on its own on the home page. The castle and the quotes
+   both obey it, and every `.motion-toggle` button shows and sets it. Pausing is remembered between
+   visits, and the operating system's reduced-motion setting always wins. */
+const KEY = 'forrt-motion-paused';
+const reduced = matchMedia('(prefers-reduced-motion: reduce)');
+const listeners = [];
+
+function stored() {
+  try {
+    return localStorage.getItem(KEY) === '1';
+  } catch {
+    return false;
+  }
+}
+
+let userPaused = stored();
+
+export const isPaused = () => reduced.matches || userPaused;
+export const prefersReduced = () => reduced.matches;
+export const onMotionChange = (listener) => listeners.push(listener);
+
+function showState() {
+  document.querySelectorAll('.motion-toggle').forEach((button) => {
+    button.textContent = isPaused() ? 'Play animation' : 'Pause animation';
+    button.title = button.textContent;
+    button.classList.toggle('is-paused', isPaused());
+  });
+}
+
+function changed() {
+  showState();
+  listeners.forEach((listener) => listener());
+}
+
+reduced.addEventListener('change', changed);
+
+document.querySelectorAll('.motion-toggle').forEach((button) => {
+  button.hidden = reduced.matches;
+  reduced.addEventListener('change', () => {
+    button.hidden = reduced.matches || button.dataset.unusable === 'true';
+  });
+  button.addEventListener('click', () => {
+    userPaused = !userPaused;
+    try {
+      if (userPaused) localStorage.setItem(KEY, '1');
+      else localStorage.removeItem(KEY);
+    } catch {
+      // Private browsing can refuse storage. The pause still works for this visit.
+    }
+    changed();
+  });
+});
+showState();
diff --git a/assets/js/doors/network.js b/assets/js/doors/network.js
new file mode 100644
index 00000000000..383316d815f
--- /dev/null
+++ b/assets/js/doors/network.js
@@ -0,0 +1,754 @@
+/* The contributor network on /contributor-analysis/. People and projects are drawn on a canvas from
+   the JSON in the page, at positions computed when the data is generated and spread out once here,
+   so nothing moves on its own. Everything the drawing shows can also be reached with the two search
+   boxes and read as text. */
+const root = document.querySelector('[data-analysis-network]');
+const canvas = root && root.querySelector('[data-network-canvas]');
+
+/* A force layout packs the people who share many projects into a dense middle, and how dense it
+   is changes with every data run. This moves each node along the line from the middle by its rank
+   in distance, partly, so that the middle opens up whatever shape the layout took. Distances are
+   measured in each axis's own spread, so the drawing keeps its proportions, and the order outwards
+   is kept, so a project's people stay around it. */
+const SPREAD = 0.7;
+
+function spreadOut(items) {
+  if (items.length < 3) return;
+  const median = (values) => {
+    const sorted = [...values].sort((a, b) => a - b);
+    return sorted[Math.floor(sorted.length / 2)];
+  };
+  const cx = median(items.map((item) => item.x));
+  const cy = median(items.map((item) => item.y));
+  const sx = median(items.map((item) => Math.abs(item.x - cx))) || 1;
+  const sy = median(items.map((item) => Math.abs(item.y - cy))) || 1;
+  const away = items.map((item) => ({ item, r: Math.hypot((item.x - cx) / sx, (item.y - cy) / sy) }))
+    .sort((a, b) => a.r - b.r);
+  const outer = away[away.length - 1].r;
+  if (!outer) return;
+  away.forEach(({ item, r }, i) => {
+    if (!r) return;
+    const target = outer * (SPREAD * Math.sqrt(i / (away.length - 1)) + (1 - SPREAD) * (r / outer));
+    item.x = cx + (item.x - cx) * (target / r);
+    item.y = cy + (item.y - cy) * (target / r);
+  });
+}
+
+if (canvas) {
+  const raw = JSON.parse(document.getElementById('network-data').textContent);
+  const projects = raw.projects.map(([name, x, y]) => ({ kind: 'project', name, x, y, members: [] }));
+  const people = raw.people.map(([name, roles, x, y, joined]) => ({
+    kind: 'person', name, roles, x, y, projects: joined.map((index) => projects[index]),
+  }));
+  people.forEach((person) => person.projects.forEach((project) => project.members.push(person)));
+  // The older generated file has no positions for projects, so they sit among their people once
+  // the people are spread. Goes with that file.
+  const placed = projects.filter((project) => project.x !== undefined);
+  spreadOut([...people, ...placed]);
+  projects.forEach((project) => {
+    if (project.x === undefined) {
+      project.x = project.members.reduce((sum, person) => sum + person.x, 0) / project.members.length;
+      project.y = project.members.reduce((sum, person) => sum + person.y, 0) / project.members.length;
+    }
+    project.radius = Math.min(11, 3 + Math.sqrt(project.members.length) * 0.6);
+  });
+  people.forEach((person) => { person.radius = Math.min(7, 2 + Math.sqrt(person.roles) * 0.45); });
+  const byMembers = [...projects].sort((a, b) => b.members.length - a.members.length);
+  const byName = [...projects].sort((a, b) => a.name.localeCompare(b.name));
+
+  const colleagues = (person) => {
+    const found = new Set();
+    person.projects.forEach((project) => project.members.forEach((other) => found.add(other)));
+    found.delete(person);
+    return [...found].sort((a, b) => a.name.localeCompare(b.name));
+  };
+  const count = (n, one, many) => `${n.toLocaleString('en')} ${n === 1 ? one : many}`;
+
+  const context = canvas.getContext('2d');
+  const panel = root.querySelector('[data-network-panel]');
+  const stage = root.querySelector('[data-network-stage]');
+  const tip = root.querySelector('[data-network-tip]');
+  const status = root.querySelector('[data-network-status]');
+  const detail = root.querySelector('[data-network-detail]');
+  const guide = root.querySelector('[data-network-guide]');
+  const chips = root.querySelector('[data-network-chips]');
+  const css = getComputedStyle(document.documentElement);
+  const colour = (name) => css.getPropertyValue(`--${name}`).trim();
+  const ink = { ink: colour('ink'), soft: colour('soft'), project: colour('res'), focus: colour('jus'), card: '#fff' };
+
+  const phone = window.matchMedia('(max-width:760px)');
+  const reduced = window.matchMedia('(prefers-reduced-motion: reduce)');
+  // A small drawing, as on a phone, has little room to give to its margins or to names.
+  const narrow = () => view.width < 500;
+  const pad = () => (narrow() ? 18 : 34);
+  const MAX_ZOOM = 14;
+
+  const state = { person: null, chosen: new Set(), hover: null };
+  const view = { k: 1, x: 0, y: 0, width: 0, height: 0, fitted: 1, tall: 1 };
+  let followFit = true;
+  let raf = 0;
+  let animation = 0;
+
+  /* What is shown. Choosing a person replaces chosen projects, and the other way round. */
+  function emphasis() {
+    const lit = new Set();
+    const hubs = new Set();
+    if (state.person) {
+      lit.add(state.person);
+      state.person.projects.forEach((project) => {
+        hubs.add(project);
+        project.members.forEach((member) => lit.add(member));
+      });
+    } else if (state.chosen.size) {
+      state.chosen.forEach((project) => {
+        hubs.add(project);
+        project.members.forEach((member) => lit.add(member));
+      });
+    }
+    return { lit, hubs, active: lit.size > 0 };
+  }
+
+  /* View */
+  const screenX = (x) => x * view.k + view.x;
+  const screenY = (y) => y * view.tall * view.k + view.y;
+
+  function bounds(items) {
+    const xs = items.map((item) => item.x);
+    const ys = items.map((item) => item.y * view.tall);
+    return { left: Math.min(...xs), right: Math.max(...xs), top: Math.min(...ys), bottom: Math.max(...ys) };
+  }
+
+  function frameFor(items, limit) {
+    const box = bounds(items);
+    const width = Math.max(box.right - box.left, 1);
+    const height = Math.max(box.bottom - box.top, 1);
+    const k = Math.min((view.width - pad() * 2) / width, (view.height - pad() * 2) / height, limit);
+    return { k, x: view.width / 2 - ((box.left + box.right) / 2) * k, y: view.height / 2 - ((box.top + box.bottom) / 2) * k };
+  }
+
+  function moveTo(target) {
+    cancelAnimationFrame(animation);
+    if (reduced.matches) {
+      Object.assign(view, target);
+      draw();
+      return;
+    }
+    const start = { k: view.k, x: view.x, y: view.y };
+    const began = performance.now();
+    const step = (now) => {
+      const t = Math.min(1, (now - began) / 260);
+      const eased = 1 - (1 - t) ** 3;
+      view.k = start.k + (target.k - start.k) * eased;
+      view.x = start.x + (target.x - start.x) * eased;
+      view.y = start.y + (target.y - start.y) * eased;
+      paint();
+      if (t < 1) animation = requestAnimationFrame(step);
+    };
+    animation = requestAnimationFrame(step);
+  }
+
+  const everything = () => [...people, ...projects];
+
+  function fitAll(animate = false) {
+    followFit = true;
+    const frame = frameFor(everything(), Infinity);
+    view.fitted = frame.k;
+    if (animate) moveTo(frame);
+    else {
+      Object.assign(view, frame);
+      draw();
+    }
+  }
+
+  function frameSelection() {
+    const { lit, hubs } = emphasis();
+    if (!lit.size) {
+      fitAll(true);
+      return;
+    }
+    followFit = false;
+    moveTo(frameFor([...lit, ...hubs], view.fitted * 4));
+  }
+
+  function zoomAt(factor, cx = view.width / 2, cy = view.height / 2) {
+    cancelAnimationFrame(animation);
+    followFit = false;
+    const k = Math.max(view.fitted * 0.7, Math.min(view.fitted * MAX_ZOOM, view.k * factor));
+    const applied = k / view.k;
+    view.x = cx - (cx - view.x) * applied;
+    view.y = cy - (cy - view.y) * applied;
+    view.k = k;
+    draw();
+  }
+
+  function resize() {
+    const box = canvas.getBoundingClientRect();
+    if (!box.width || !box.height) return;
+    const scale = window.devicePixelRatio || 1;
+    canvas.width = Math.round(box.width * scale);
+    canvas.height = Math.round(box.height * scale);
+    const cx = (view.width / 2 - view.x) / view.k;
+    const cy = (view.height / 2 - view.y) / view.k / view.tall;
+    view.width = box.width;
+    view.height = box.height;
+    // How wide a force layout runs means nothing, so it can take the stage's proportions.
+    view.tall = 1;
+    const all = bounds(everything());
+    const proportion = ((view.height - pad() * 2) / (view.width - pad() * 2)) / (((all.bottom - all.top) || 1) / ((all.right - all.left) || 1));
+    view.tall = Math.max(0.8, Math.min(1.6, proportion));
+    view.fitted = frameFor(everything(), Infinity).k;
+    if (followFit) {
+      fitAll();
+    } else {
+      view.x = view.width / 2 - cx * view.k;
+      view.y = view.height / 2 - cy * view.tall * view.k;
+      draw();
+    }
+    // On a phone it is a picture. Elsewhere it takes keys of its own, and says so.
+    canvas.tabIndex = phone.matches ? -1 : 0;
+    canvas.setAttribute('role', phone.matches ? 'img' : 'application');
+    if (phone.matches) canvas.removeAttribute('aria-describedby');
+    else canvas.setAttribute('aria-describedby', 'network-hint');
+  }
+
+  /* Drawing */
+  function draw() {
+    cancelAnimationFrame(raf);
+    raf = requestAnimationFrame(paint);
+  }
+
+  const dotScale = () => Math.min(1.7, Math.max(0.75, Math.sqrt(view.k / view.fitted))) * (narrow() ? 0.62 : 1);
+
+  function dot(person, radius, fill) {
+    context.fillStyle = fill;
+    context.beginPath();
+    context.arc(screenX(person.x), screenY(person.y), radius, 0, Math.PI * 2);
+    context.fill();
+  }
+
+  function square(project, half, fill) {
+    const x = screenX(project.x);
+    const y = screenY(project.y);
+    context.fillStyle = fill;
+    context.beginPath();
+    if (context.roundRect) context.roundRect(x - half, y - half, half * 2, half * 2, 2);
+    else context.rect(x - half, y - half, half * 2, half * 2);
+    context.fill();
+  }
+
+  function lines(pairs, stroke, width) {
+    context.strokeStyle = stroke;
+    context.lineWidth = width;
+    context.beginPath();
+    pairs.forEach(([from, to]) => {
+      context.moveTo(screenX(from.x), screenY(from.y));
+      context.lineTo(screenX(to.x), screenY(to.y));
+    });
+    context.stroke();
+  }
+
+  const spokes = (items) => items.flatMap((project) => project.members.map((member) => [member, project]));
+
+  /* Greedy labels: most important first, skipping any that would land on another. */
+  function labels(wanted) {
+    const placed = [];
+    context.textBaseline = 'middle';
+    context.lineJoin = 'round';
+    wanted.forEach(({ text, item, weight, fill, force }) => {
+      context.font = `${weight} ${phone.matches ? 14 : 15}px "Source Sans 3", system-ui, sans-serif`;
+      const width = context.measureText(text).width;
+      const x = screenX(item.x);
+      const y = screenY(item.y) - (item.radius || 3) * dotScale() - 11;
+      if (x < -20 || x > view.width + 20 || y < -10 || y > view.height + 10) return;
+      const left = Math.max(4, Math.min(view.width - width - 4, x - width / 2));
+      const box = { left: left - 3, right: left + width + 3, top: y - 10, bottom: y + 10 };
+      const clash = placed.some((b) => b.left < box.right && box.left < b.right && b.top < box.bottom && box.top < b.bottom);
+      if (clash && !force) return;
+      placed.push(box);
+      context.globalAlpha = 0.82;
+      context.fillStyle = ink.card;
+      context.fillRect(box.left, box.top + 1, box.right - box.left, box.bottom - box.top - 2);
+      context.globalAlpha = 1;
+      context.fillStyle = fill;
+      context.fillText(text, left, y);
+    });
+  }
+
+  function paint() {
+    const scale = canvas.width / (view.width || 1);
+    context.setTransform(scale, 0, 0, scale, 0, 0);
+    context.clearRect(0, 0, view.width, view.height);
+    if (!view.width) return;
+    const { lit, hubs, active } = emphasis();
+    const size = dotScale();
+    const hovered = state.hover;
+
+    // Everything at rest, faint when something is selected.
+    context.globalAlpha = active ? 0.1 : 0.2;
+    lines(spokes(projects), ink.soft, 0.6);
+    context.globalAlpha = active ? 0.22 : 1;
+    people.forEach((person) => dot(person, person.radius * size, ink.ink));
+    projects.forEach((project) => square(project, project.radius * size, ink.project));
+    context.globalAlpha = 1;
+
+    if (active) {
+      lines(spokes([...hubs]), ink.project, 0.9);
+      if (state.person) lines(state.person.projects.map((project) => [state.person, project]), ink.focus, 2.2);
+      lit.forEach((person) => dot(person, person.radius * size + 0.5, ink.ink));
+      hubs.forEach((project) => square(project, project.radius * size + 1, ink.project));
+      if (state.person) {
+        dot(state.person, state.person.radius * size + 6, ink.card);
+        dot(state.person, state.person.radius * size + 4, ink.focus);
+      }
+    }
+
+    // What the pointer is on, over everything else.
+    if (hovered) {
+      if (hovered.kind === 'person') {
+        lines(hovered.projects.map((project) => [hovered, project]), ink.focus, 1.8);
+        hovered.projects.forEach((project) => square(project, project.radius * size + 1, ink.project));
+        dot(hovered, hovered.radius * size + 4, ink.card);
+        dot(hovered, hovered.radius * size + 2.5, ink.focus);
+      } else {
+        lines(spokes([hovered]), ink.focus, 1.2);
+        hovered.members.forEach((member) => dot(member, member.radius * size + 0.5, ink.ink));
+        square(hovered, hovered.radius * size + 3, ink.card);
+        square(hovered, hovered.radius * size + 1.5, ink.focus);
+      }
+    }
+
+    const wanted = [];
+    if (state.person) wanted.push({ text: state.person.name, item: state.person, weight: 700, fill: ink.focus, force: true });
+    [...hubs].sort((a, b) => b.members.length - a.members.length).slice(0, Math.max(10, state.chosen.size))
+      .forEach((project) => wanted.push({ text: project.name, item: project, weight: 600, fill: ink.project, force: state.chosen.has(project) }));
+    // At rest the largest projects get names, and more come in with zooming.
+    if (!active) {
+      const room = Math.max(narrow() ? 2 : 4, Math.min(12, (view.width * view.height) / 60000)) * (view.k / view.fitted) ** 2;
+      byMembers.slice(0, Math.round(room)).forEach((project) => wanted.push({ text: project.name, item: project, weight: 600, fill: ink.project }));
+    }
+    // Names of people come in once they have room.
+    if (view.k > view.fitted * 2.4) {
+      (active ? [...lit] : people).forEach((person) => wanted.push({ text: person.name, item: person, weight: 400, fill: ink.ink }));
+    }
+    labels(wanted);
+  }
+
+  /* The panel of text */
+  function linkButton(text, onClick) {
+    const button = document.createElement('button');
+    button.type = 'button';
+    button.className = 'network-link';
+    button.textContent = text;
+    button.addEventListener('click', onClick);
+    return button;
+  }
+
+  function element(tag, text) {
+    const node = document.createElement(tag);
+    if (text) node.textContent = text;
+    return node;
+  }
+
+  function linkList(items, onPick) {
+    const list = element('ul');
+    items.forEach((item) => {
+      const row = element('li');
+      row.append(linkButton(item.name, () => onPick(item)));
+      list.append(row);
+    });
+    return list;
+  }
+
+  function clearButton() {
+    const button = linkButton('Clear and show everyone', () => { clearAll(); fitAll(true); });
+    button.classList.add('network-clear');
+    return button;
+  }
+
+  function showPanelText() {
+    // Rebuilding removes the control just used, so keyboard users need somewhere to land.
+    const hadFocus = detail.contains(document.activeElement) || chips.contains(document.activeElement);
+    const inChips = chips.contains(document.activeElement);
+    detail.replaceChildren();
+    const person = state.person;
+    if (person) {
+      const others = colleagues(person);
+      status.textContent = `${person.name}: ${count(person.projects.length, 'project', 'projects')}, connected to ${count(others.length, 'person', 'people')}.`;
+      detail.append(clearButton());
+      detail.append(element('h3', person.name));
+      detail.append(element('p', `${count(person.roles, 'role', 'roles')} on record`));
+      detail.append(element('h4', count(person.projects.length, 'project', 'projects')));
+      detail.append(linkList([...person.projects].sort((a, b) => a.name.localeCompare(b.name)), chooseOnly));
+      if (others.length) {
+        detail.append(element('h4', `Connected to ${count(others.length, 'person', 'people')}`));
+        detail.append(linkList(others, choosePerson));
+      }
+    } else if (state.chosen.size) {
+      const chosen = [...state.chosen];
+      const everyone = new Set(chosen.flatMap((project) => project.members));
+      status.textContent = chosen.length === 1
+        ? `${chosen[0].name}: ${count(everyone.size, 'person', 'people')}.`
+        : `${count(chosen.length, 'project', 'projects')}: ${count(everyone.size, 'person', 'people')} in all.`;
+      detail.append(clearButton());
+      chosen.forEach((project) => {
+        detail.append(element('h3', project.name));
+        detail.append(element('p', count(project.members.length, 'person', 'people')));
+        detail.append(linkList([...project.members].sort((a, b) => a.name.localeCompare(b.name)), choosePerson));
+      });
+    } else {
+      status.textContent = 'Nothing selected. Showing everyone.';
+    }
+    detail.hidden = !(person || state.chosen.size);
+    guide.hidden = !detail.hidden;
+    chips.replaceChildren();
+    state.chosen.forEach((project) => {
+      const item = element('li');
+      const chip = element('button');
+      chip.type = 'button';
+      chip.className = 'network-chip';
+      chip.setAttribute('aria-label', `Stop showing ${project.name}`);
+      chip.append(element('span', project.name));
+      const cross = element('span', '×');
+      cross.setAttribute('aria-hidden', 'true');
+      chip.append(cross);
+      chip.addEventListener('click', () => toggleProject(project));
+      item.append(chip);
+      chips.append(item);
+    });
+    chips.hidden = !state.chosen.size;
+    if (hadFocus) {
+      const heading = detail.querySelector('h3');
+      if (heading) heading.tabIndex = -1;
+      const next = inChips ? chips.querySelector('button') || projectBox.input : heading || personBox.input;
+      next.focus();
+    }
+  }
+
+  function choosePerson(person) {
+    state.person = person;
+    state.chosen.clear();
+    personBox.input.value = person.name;
+    showPanelText();
+    frameSelection();
+  }
+
+  function toggleProject(project) {
+    state.person = null;
+    personBox.input.value = '';
+    if (state.chosen.has(project)) state.chosen.delete(project);
+    else state.chosen.add(project);
+    showPanelText();
+    frameSelection();
+  }
+
+  function chooseOnly(project) {
+    state.person = null;
+    personBox.input.value = '';
+    state.chosen.clear();
+    state.chosen.add(project);
+    showPanelText();
+    frameSelection();
+  }
+
+  function clearAll() {
+    state.person = null;
+    state.chosen.clear();
+    personBox.input.value = '';
+    showPanelText();
+    draw();
+  }
+
+  /* A search box with a list of matches: the ARIA combobox pattern. */
+  const fold = (text) => text.normalize('NFD').replace(/\p{M}/gu, '').toLowerCase();
+
+  function combobox(input, list, options, onPick) {
+    let shown = [];
+    let active = -1;
+
+    function close() {
+      list.hidden = true;
+      input.setAttribute('aria-expanded', 'false');
+      input.removeAttribute('aria-activedescendant');
+      active = -1;
+    }
+
+    // Fixed, so that the list can run past the panel, which clips its overflow.
+    function place() {
+      const box = input.getBoundingClientRect();
+      list.style.left = `${box.left}px`;
+      list.style.width = `${Math.max(box.width, 280)}px`;
+      // Opens upwards when that leaves more of it on the screen.
+      const below = window.innerHeight - box.bottom - 12;
+      const above = box.top - 12;
+      const upwards = below < 200 && above > below;
+      list.style.maxHeight = `${Math.max(0, Math.min(280, upwards ? above : below))}px`;
+      list.style.top = `${upwards ? box.top - 4 - list.offsetHeight : box.bottom + 4}px`;
+    }
+
+    function highlight(index) {
+      active = index;
+      [...list.children].forEach((row, i) => row.setAttribute('aria-selected', String(i === index)));
+      if (index >= 0) {
+        input.setAttribute('aria-activedescendant', list.children[index].id);
+        list.children[index].scrollIntoView({ block: 'nearest' });
+      } else {
+        input.removeAttribute('aria-activedescendant');
+      }
+    }
+
+    function open() {
+      const query = fold(input.value.trim());
+      shown = options(query);
+      list.replaceChildren();
+      shown.slice(0, 60).forEach((option, i) => {
+        const row = element('li');
+        row.id = `${list.id}-${i}`;
+        row.setAttribute('role', 'option');
+        row.setAttribute('aria-selected', 'false');
+        row.append(element('span', option.label));
+        if (option.note) row.append(element('span', option.note));
+        // Before the box's blur would close the list.
+        row.addEventListener('mousedown', (event) => event.preventDefault());
+        row.addEventListener('click', () => { close(); onPick(option.value); });
+        list.append(row);
+      });
+      if (!shown.length) {
+        const row = element('li', 'No match');
+        row.setAttribute('role', 'option');
+        row.setAttribute('aria-disabled', 'true');
+        row.setAttribute('aria-selected', 'false');
+        list.append(row);
+      }
+      list.hidden = false;
+      input.setAttribute('aria-expanded', 'true');
+      active = -1;
+      place();
+    }
+
+    input.addEventListener('input', open);
+    input.addEventListener('click', open);
+    input.addEventListener('blur', close);
+    input.addEventListener('keydown', (event) => {
+      if (event.key === 'ArrowDown' || event.key === 'ArrowUp') {
+        event.preventDefault();
+        if (list.hidden) open();
+        const count = Math.min(shown.length, 60);
+        const next = event.key === 'ArrowDown' ? active + 1 : (active < 0 ? count : active) - 1;
+        highlight(count ? (next + count) % count : -1);
+      } else if (event.key === 'Enter') {
+        if (!list.hidden && shown.length) {
+          event.preventDefault();
+          const pick = shown[active < 0 ? 0 : active];
+          close();
+          onPick(pick.value);
+        }
+      } else if (event.key === 'Escape') {
+        if (!list.hidden) {
+          event.stopPropagation();
+          close();
+        }
+      }
+    });
+    // Capturing, to hear the side panel's own scrolling as well as the page's.
+    window.addEventListener('scroll', (event) => {
+      if (list.hidden || event.target === list) return;
+      place();
+      const box = input.getBoundingClientRect();
+      const frame = input.closest('.network-controls').getBoundingClientRect();
+      if (frame.height && (box.bottom < frame.top || box.top > frame.bottom)) close();
+    }, { passive: true, capture: true });
+    window.addEventListener('resize', () => { if (!list.hidden) place(); });
+    return { input };
+  }
+
+  const peopleIndex = people.map((person) => ({
+    value: person, search: fold(person.name), label: person.name, note: count(person.projects.length, 'project', 'projects'),
+  }));
+  const projectIndex = byName.map((project) => ({
+    value: project, search: fold(project.name), label: project.name, note: String(project.members.length),
+  }));
+
+  const personBox = combobox(
+    root.querySelector('#network-person'),
+    root.querySelector('#network-person-list'),
+    (query) => (query ? peopleIndex.filter((option) => option.search.includes(query)) : peopleIndex),
+    choosePerson,
+  );
+  const projectBox = combobox(
+    root.querySelector('#network-project'),
+    root.querySelector('#network-project-list'),
+    (query) => (query ? projectIndex.filter((option) => option.search.includes(query)) : projectIndex)
+      .filter((option) => !state.chosen.has(option.value)),
+    (project) => { projectBox.input.value = ''; toggleProject(project); },
+  );
+
+  /* Pointer and keyboard on the drawing */
+  function nodeAt(cx, cy, slack) {
+    let best = null;
+    let bestDistance = Infinity;
+    const size = dotScale();
+    const test = (item) => {
+      const distance = Math.hypot(screenX(item.x) - cx, screenY(item.y) - cy) - item.radius * size;
+      if (distance < slack && distance < bestDistance) {
+        best = item;
+        bestDistance = distance;
+      }
+    };
+    people.forEach(test);
+    projects.forEach(test);
+    return best;
+  }
+
+  function showTip(item, cx, cy) {
+    tip.replaceChildren();
+    tip.append(element('b', item.name));
+    tip.append(item.kind === 'person'
+      ? `${count(item.roles, 'role', 'roles')} on ${count(item.projects.length, 'project', 'projects')}, connected to ${count(colleagues(item).length, 'person', 'people')}`
+      : count(item.members.length, 'person', 'people'));
+    tip.hidden = false;
+    const left = Math.max(6, Math.min(view.width - tip.offsetWidth - 6, cx + 12));
+    const above = cy - tip.offsetHeight - 12;
+    const top = above < 6 ? Math.min(cy + 14, view.height - tip.offsetHeight - 6) : above;
+    tip.style.left = `${left}px`;
+    tip.style.top = `${top}px`;
+  }
+
+  function setHover(item, cx, cy) {
+    clearTimeout(hoverEnd);
+    if (item) showTip(item, cx, cy);
+    else tip.hidden = true;
+    if (item !== state.hover) {
+      state.hover = item;
+      canvas.style.cursor = item ? 'pointer' : '';
+      draw();
+    }
+  }
+
+  // The name stays long enough to move the pointer onto it, and stays while it is there.
+  function endHover() {
+    clearTimeout(hoverEnd);
+    hoverEnd = setTimeout(() => setHover(null), 300);
+  }
+
+  tip.addEventListener('pointerenter', () => clearTimeout(hoverEnd));
+  tip.addEventListener('pointerleave', endHover);
+
+  let press = null;
+  let hoverEnd = 0;
+
+  canvas.addEventListener('pointerdown', (event) => {
+    cancelAnimationFrame(animation);
+    press = { x: event.clientX, y: event.clientY, viewX: view.x, viewY: view.y, moved: false, touch: event.pointerType === 'touch' };
+    if (event.pointerType === 'mouse') canvas.setPointerCapture(event.pointerId);
+  });
+
+  canvas.addEventListener('pointermove', (event) => {
+    const box = canvas.getBoundingClientRect();
+    const cx = event.clientX - box.left;
+    const cy = event.clientY - box.top;
+    if (press && !phone.matches) {
+      if (!press.moved && Math.hypot(event.clientX - press.x, event.clientY - press.y) > 4) {
+        press.moved = true;
+        followFit = false;
+        canvas.classList.add('dragging');
+        setHover(null);
+      }
+      if (press.moved) {
+        view.x = press.viewX + event.clientX - press.x;
+        view.y = press.viewY + event.clientY - press.y;
+        draw();
+        return;
+      }
+    }
+    if (event.pointerType === 'mouse') {
+      const item = nodeAt(cx, cy, 7);
+      if (item) setHover(item, cx, cy);
+      else if (state.hover) endHover();
+    }
+  });
+
+  canvas.addEventListener('pointerup', (event) => {
+    const box = canvas.getBoundingClientRect();
+    if (press && !press.moved) {
+      const item = nodeAt(event.clientX - box.left, event.clientY - box.top, press.touch ? 16 : 7);
+      if (item && item.kind === 'person') choosePerson(item);
+      else if (item) chooseOnly(item);
+      else if (state.person || state.chosen.size) clearAll();
+    }
+    press = null;
+    canvas.classList.remove('dragging');
+  });
+
+  canvas.addEventListener('pointercancel', () => {
+    press = null;
+    canvas.classList.remove('dragging');
+  });
+
+  canvas.addEventListener('pointerleave', endHover);
+
+  // The page keeps scrolling over the drawing. Only a pinch or Ctrl and the wheel zooms it.
+  canvas.addEventListener('wheel', (event) => {
+    if (!event.ctrlKey && !event.metaKey) return;
+    event.preventDefault();
+    const box = canvas.getBoundingClientRect();
+    zoomAt(Math.exp(-event.deltaY * 0.004), event.clientX - box.left, event.clientY - box.top);
+  }, { passive: false });
+
+  canvas.addEventListener('keydown', (event) => {
+    const step = 60;
+    const moves = { ArrowLeft: [step, 0], ArrowRight: [-step, 0], ArrowUp: [0, step], ArrowDown: [0, -step] };
+    if (moves[event.key]) {
+      event.preventDefault();
+      cancelAnimationFrame(animation);
+      followFit = false;
+      view.x += moves[event.key][0];
+      view.y += moves[event.key][1];
+      draw();
+    } else if (event.key === '+' || event.key === '=') {
+      event.preventDefault();
+      zoomAt(1.3);
+    } else if (event.key === '-') {
+      event.preventDefault();
+      zoomAt(1 / 1.3);
+    } else if (event.key === '0') {
+      event.preventDefault();
+      fitAll(true);
+    }
+  });
+
+  // Escape first dismisses a name shown by hovering, wherever the focus is.
+  document.addEventListener('keydown', (event) => {
+    if (event.key !== 'Escape' || tip.hidden) return;
+    setHover(null);
+    event.stopPropagation();
+  }, { capture: true });
+
+  root.addEventListener('keydown', (event) => {
+    if (event.key === 'Escape' && (state.person || state.chosen.size)) {
+      clearAll();
+      fitAll(true);
+    }
+  });
+
+  root.querySelectorAll('[data-network-zoom]').forEach((button) => {
+    button.addEventListener('click', () => {
+      const kind = button.dataset.networkZoom;
+      if (kind === 'in') zoomAt(1.4);
+      else if (kind === 'out') zoomAt(1 / 1.4);
+      else fitAll(true);
+    });
+  });
+
+  // For scripts/rebrand/check_design.py, which has to point at a node it can only see as pixels.
+  root.networkPosition = (name) => {
+    const item = [...people, ...projects].find((candidate) => candidate.name === name);
+    return item && { x: screenX(item.x), y: screenY(item.y) };
+  };
+
+  panel.hidden = false;
+  showPanelText();
+  new ResizeObserver(resize).observe(stage);
+  resize();
+  // Labels are measured in the page's type, which may arrive after the first drawing.
+  if (document.fonts && document.fonts.ready) document.fonts.ready.then(draw);
+}
diff --git a/assets/js/doors/popover.js b/assets/js/doors/popover.js
new file mode 100644
index 00000000000..93643050ee5
--- /dev/null
+++ b/assets/js/doors/popover.js
@@ -0,0 +1,127 @@
+/* Shared, non-modal popovers (citations #200, glossary terms #227).
+   import { openPopover, closePopover, registerPopover } from './popover.js'.
+   openPopover(trigger, contentNode, {label, hover = false}) replaces the current popover.
+   registerPopover(selector, (trigger) => contentNode | null, {label, hover = false})
+   delegates click/Enter; opt-in hover opens after 250ms, closes after 200ms away from both.
+   A null builder leaves the original link alone. Hover never takes focus; other opens focus
+   the first control. label is required by both opening APIs. closePopover() restores focus
+   to the trigger, including outside-click dismissal as specified. No feature data lives here. */
+let current = null;
+let opening;
+let closing;
+const focusable = 'a[href],button:not([disabled]),input:not([disabled]),select,textarea,[tabindex="0"]';
+
+function position() {
+  if (!current) return;
+  const { trigger, panel } = current;
+  const rect = trigger.getBoundingClientRect();
+  panel.style.maxHeight = 'calc(100vh - 32px)';
+  const height = panel.offsetHeight;
+  const below = innerHeight - rect.bottom - 16;
+  const above = rect.top - 16;
+  const flip = below < height && above > below;
+  panel.style.maxHeight = `${Math.max(32, flip ? above : below)}px`;
+  panel.style.left = `${innerWidth < 600 ? 16 : Math.max(16, Math.min(rect.left, innerWidth - panel.offsetWidth - 16))}px`;
+  panel.style.top = `${Math.max(16, flip ? rect.top - panel.offsetHeight : rect.bottom)}px`;
+}
+
+export function closePopover() {
+  clearTimeout(opening);
+  clearTimeout(closing);
+  if (!current) return;
+  const { trigger, panel, expanded, controls, restoreFocus } = current;
+  current = null;
+  panel.remove();
+  if (expanded === null) trigger.removeAttribute('aria-expanded');
+  else trigger.setAttribute('aria-expanded', expanded);
+  if (controls === null) trigger.removeAttribute('aria-controls');
+  else trigger.setAttribute('aria-controls', controls);
+  window.removeEventListener('resize', position);
+  document.removeEventListener('scroll', position, true);
+  if (restoreFocus && trigger.isConnected) trigger.focus({ preventScroll: true });
+}
+
+export function openPopover(trigger, contentNode, { label, hover = false } = {}) {
+  closePopover();
+  const panel = document.createElement('div');
+  panel.className = 'doors-popover';
+  panel.id = 'doors-popover';
+  panel.setAttribute('role', 'dialog');
+  panel.setAttribute('aria-label', label);
+  panel.append(contentNode);
+  const close = document.createElement('button');
+  close.type = 'button';
+  close.className = 'doors-popover-close';
+  close.setAttribute('aria-label', 'Close');
+  close.textContent = '×';
+  close.addEventListener('click', closePopover);
+  panel.append(close);
+  current = { trigger, panel, expanded: trigger.getAttribute('aria-expanded'), controls: trigger.getAttribute('aria-controls'), restoreFocus: !hover };
+  trigger.setAttribute('aria-expanded', 'true');
+  trigger.setAttribute('aria-controls', panel.id);
+  document.body.append(panel);
+  position();
+  window.addEventListener('resize', position);
+  document.addEventListener('scroll', position, true);
+  panel.addEventListener('pointerenter', () => clearTimeout(closing));
+  panel.addEventListener('pointerleave', () => { if (current && !current.restoreFocus) scheduleClose(); });
+  panel.addEventListener('focusin', () => { if (current) current.restoreFocus = true; });
+  if (!hover) panel.querySelector(focusable)?.focus({ preventScroll: true });
+}
+
+function scheduleClose() {
+  clearTimeout(closing);
+  closing = setTimeout(closePopover, 200);
+}
+
+export function registerPopover(selector, buildContent, { label, hover = false } = {}) {
+  const activate = (trigger, fromHover = false) => {
+    if (current?.trigger === trigger) {
+      if (!fromHover && !current.restoreFocus) {
+        current.restoreFocus = true;
+        current.panel.querySelector(focusable)?.focus();
+      } else if (!fromHover) closePopover();
+      return true;
+    }
+    const content = buildContent(trigger);
+    if (!content) return false;
+    openPopover(trigger, content, { label, hover: fromHover });
+    return true;
+  };
+  document.addEventListener('click', (event) => {
+    if (event.button || event.metaKey || event.ctrlKey || event.shiftKey || event.altKey) return;
+    const trigger = event.target.closest(selector);
+    if (trigger && activate(trigger)) event.preventDefault();
+  });
+  // Links and buttons already turn Enter into click; support other focusable triggers too.
+  document.addEventListener('keydown', (event) => {
+    const trigger = event.target.closest(selector);
+    if (event.key === 'Enter' && trigger && !trigger.matches('a[href],button') && activate(trigger)) event.preventDefault();
+  });
+  if (hover) {
+    document.addEventListener('pointerover', (event) => {
+      if (event.pointerType === 'touch') return;
+      const trigger = event.target.closest(selector);
+      if (!trigger || trigger.contains(event.relatedTarget)) return;
+      clearTimeout(closing);
+      clearTimeout(opening);
+      opening = setTimeout(() => activate(trigger, true), 250);
+    });
+    document.addEventListener('pointerout', (event) => {
+      const trigger = event.target.closest(selector);
+      if (!trigger || trigger.contains(event.relatedTarget)) return;
+      clearTimeout(opening);
+      if (current?.trigger === trigger && !current.restoreFocus) scheduleClose();
+    });
+  }
+}
+
+document.addEventListener('keydown', (event) => {
+  if (event.key === 'Escape' && current) {
+    event.preventDefault();
+    closePopover();
+  }
+});
+document.addEventListener('click', (event) => {
+  if (current && !current.panel.contains(event.target) && !current.trigger.contains(event.target)) closePopover();
+});
diff --git a/assets/js/doors/quotes.js b/assets/js/doors/quotes.js
new file mode 100644
index 00000000000..c081f6633c1
--- /dev/null
+++ b/assets/js/doors/quotes.js
@@ -0,0 +1,77 @@
+/* The home page's band of quotes, one at a time. It stops for the shared pause control, while a
+   pointer or keyboard focus is on it, and when nobody can see it. */
+import { isPaused, onMotionChange } from './motion.js';
+
+const INTERVAL = 6000;
+const host = document.querySelector('.quotes');
+const quotes = host ? [...host.querySelectorAll('.quote')] : [];
+const button = host?.querySelector('.motion-toggle');
+
+if (quotes.length < 2 && button) {
+  button.dataset.unusable = 'true';
+  button.hidden = true;
+}
+
+if (quotes.length > 1) {
+  let current = 0;
+  let timer = 0;
+  let pointerOver = false;
+  let focusInside = false;
+  let onScreen = true;
+
+  const next = () => {
+    quotes[current].classList.remove('is-active');
+    current = (current + 1) % quotes.length;
+    quotes[current].classList.add('is-active');
+  };
+  const sync = () => {
+    clearInterval(timer);
+    timer = 0;
+    if (!isPaused() && !pointerOver && !focusInside && onScreen && !document.hidden) timer = setInterval(next, INTERVAL);
+  };
+
+  host.addEventListener('pointerenter', (event) => {
+    if (event.pointerType === 'mouse') {
+      pointerOver = true;
+      sync();
+    }
+  });
+  host.addEventListener('pointerleave', (event) => {
+    if (event.pointerType === 'mouse') {
+      pointerOver = false;
+      sync();
+    }
+  });
+  // A tap reveals the pause button, as it does on the castle.
+  // On the click, because a button revealed at the touch would sit under the finger and take the tap.
+  let lastPointer = 'mouse';
+  let revealedAt = -Infinity;
+  host.addEventListener('pointerdown', (event) => {
+    lastPointer = event.pointerType;
+  });
+  host.addEventListener('click', () => {
+    if (lastPointer === 'mouse') return;
+    if (!host.classList.contains('show-motion-control')) revealedAt = performance.now();
+    host.classList.add('show-motion-control');
+  });
+  // A quick second tap must not land on the button the first tap has just revealed.
+  host.addEventListener('click', (event) => {
+    if (event.target.closest('.motion-toggle') && performance.now() - revealedAt < 350) event.stopPropagation();
+  }, true);
+  // Only keyboard focus holds them: a mouse click leaves focus on the button after the pointer goes.
+  host.addEventListener('focusin', (event) => {
+    focusInside = event.target.matches(':focus-visible');
+    sync();
+  });
+  host.addEventListener('focusout', () => {
+    focusInside = false;
+    sync();
+  });
+  new IntersectionObserver((entries) => {
+    onScreen = entries[0].isIntersecting;
+    sync();
+  }).observe(host);
+  document.addEventListener('visibilitychange', sync);
+  onMotionChange(sync);
+  sync();
+}
diff --git a/assets/js/doors/references.js b/assets/js/doors/references.js
new file mode 100644
index 00000000000..9f0d69cc2f9
--- /dev/null
+++ b/assets/js/doors/references.js
@@ -0,0 +1,57 @@
+/* Full references with long author lists show three authors and "et al." until their button
+   is pressed (layouts/partials/citations/authors.html). The click handler is delegated, so the
+   button also works in the copy of a reference that the citation popover shows. */
+
+// The reference as text to copy: every author, without the "et al.", the button's label or a note.
+export function referenceText(node) {
+  const copy = node.cloneNode(true);
+  copy.querySelectorAll('.ref-etal,.ref-authors-toggle,.ref-note').forEach((element) => element.remove());
+  return copy.textContent.replace(/\s+/g, ' ').trim();
+}
+
+// The Clipboard API needs a secure context; older browsers and plain-http previews fall back to a selection.
+export async function copyText(text) {
+  try {
+    await navigator.clipboard.writeText(text);
+    return true;
+  } catch {
+    const focused = document.activeElement;
+    const area = document.createElement('textarea');
+    area.value = text;
+    area.setAttribute('readonly', '');
+    area.style.cssText = 'position:fixed;opacity:0';
+    document.body.append(area);
+    area.select();
+    let copied = false;
+    try { copied = document.execCommand('copy'); } catch { copied = false; }
+    area.remove();
+    focused?.focus({ preventScroll: true });
+    return copied;
+  }
+}
+
+document.addEventListener('click', (event) => {
+  const button = event.target.closest('.ref-authors-toggle');
+  if (!button) return;
+  const authors = button.closest('.ref-authors');
+  const open = button.getAttribute('aria-expanded') !== 'true';
+  authors.querySelector('.ref-more').hidden = !open;
+  authors.querySelector('.ref-etal').hidden = open;
+  button.setAttribute('aria-expanded', String(open));
+  button.textContent = open ? button.dataset.less : button.dataset.more;
+});
+
+// Citation cards ({{< citation-card >}}) copy the reference beside their button.
+document.addEventListener('click', async (event) => {
+  const button = event.target.closest('[data-copy-reference]');
+  if (!button) return;
+  const text = button.closest('.cite-us-item').querySelector('.cite-us-text');
+  const label = button.querySelector('.copy-label');
+  label.textContent = await copyText(referenceText(text)) ? 'Copied!' : 'Copy failed';
+  button.classList.add('copied');
+  clearTimeout(button.reset);
+  button.reset = setTimeout(() => {
+    label.textContent = 'Copy';
+    button.classList.remove('copied');
+  }, 2000);
+});
diff --git a/assets/js/doors/resources.js b/assets/js/doors/resources.js
new file mode 100644
index 00000000000..765d235869b
--- /dev/null
+++ b/assets/js/doors/resources.js
@@ -0,0 +1,369 @@
+/* The resources directory: filters, search, sorting, page size and shareable addresses. The page
+   already holds one page of cards as HTML, A to Z, 24 to a page. This loads the data file, then
+   redraws the list whenever a filter, the search box, the sort or the page size changes, and
+   keeps the choice in the address (?type=&level=&cluster=&search=&sort=&per=&page=). With none
+   of these chosen, the address is the server's own page (/resources/page/N/), and that page's
+   cards are shown as they came. The theme's script claims ?q= for the site search, so the
+   directory does not use that name. */
+const root = document.getElementById('directory');
+const results = document.getElementById('results');
+const pager = document.getElementById('pager');
+const search = document.getElementById('resource-search');
+const countLine = document.getElementById('resultCount');
+const activeLine = document.getElementById('activeFilters');
+const clear = document.getElementById('clearFilters');
+const empty = document.getElementById('empty');
+const sortSelect = document.getElementById('sortOrder');
+const perSelect = document.getElementById('perPage');
+const clientPager = document.getElementById('clientPager');
+const clientPagerTop = document.getElementById('clientPagerTop');
+const drawer = document.getElementById('filterDrawer');
+const badge = document.getElementById('filterBadge');
+const card = document.getElementById('resCard');
+const facets = [...document.querySelectorAll('.facet')];
+const fmt = (n) => n.toLocaleString('en-GB');
+const total = fmt(Number(root.dataset.total));
+// The server's pages hold 24 each; phones start at 12, so a page fits a few screens.
+const SERVER_PER = Number(root.dataset.perPage);
+const serverPage = Number(root.dataset.page);
+const defaultPer = matchMedia('(max-width: 760px)').matches ? 12 : SERVER_PER;
+const PER_OPTIONS = [...perSelect.options].map((option) => Number(option.value));
+
+// What the page shows with nothing chosen, restored when the last filter goes.
+const serverCards = [...results.children];
+const serverCount = countLine.textContent;
+
+let data = null;
+let searchText = null;
+let wantsFullSearch = false;
+let sort = 'title';
+let per = SERVER_PER;
+let page = serverPage;
+// Positions in data.items in each order; items come A to Z, and search.json matches by position.
+let orders = null;
+
+const chipsOf = (facet) => [...facet.querySelectorAll('.chip')];
+const labelOf = (chip) => chip.firstChild.textContent.trim();
+
+function chosen() {
+  const picks = {};
+  facets.forEach((facet) => {
+    picks[facet.dataset.facet] = chipsOf(facet)
+      .filter((chip) => chip.getAttribute('aria-pressed') === 'true')
+      .map((chip) => chip.dataset.value);
+  });
+  return picks;
+}
+
+const words = () => search.value.trim().toLowerCase().split(/\s+/).filter(Boolean);
+const anyChoice = (picks, query) => query.length > 0 || Object.values(picks).some((list) => list.length);
+
+// Within a filter group any chosen value matches; across groups all must. `skip` leaves one group
+// out, which gives each option's count: how many results it would give alongside the others.
+function matches(index, picks, query, skip) {
+  const item = data.items[index];
+  const fields = { type: item.y, level: item.l, cluster: item.c };
+  for (const facet of Object.keys(picks)) {
+    if (facet !== skip && picks[facet].length) {
+      const names = data.facets[facet];
+      if (!fields[facet].some((position) => picks[facet].includes(names[position]))) return false;
+    }
+  }
+  if (!query.length) return true;
+  const text = searchText ? searchText[index] : item.t.toLowerCase();
+  return query.every((word) => text.includes(word));
+}
+
+function drawCard(index) {
+  const item = data.items[index];
+  const node = card.content.firstElementChild.cloneNode(true);
+  const link = node.querySelector('.res-title a');
+  link.textContent = item.t;
+  link.href = `${data.base}${item.u}/`;
+  const labels = (facet, positions, most = Infinity) => {
+    const names = positions
+      .map((position) => document.querySelector(`.facet[data-facet=${facet}] .chip[data-value="${data.facets[facet][position]}"]`))
+      .filter(Boolean)
+      .map(labelOf);
+    // Levels show two at most and a count, as on the server-drawn cards.
+    return names.slice(0, most).join(', ') + (names.length > most ? ` +${names.length - most}` : '');
+  };
+  node.querySelector('.res-type').textContent = labels('type', item.y);
+  node.querySelector('.res-level').textContent = labels('level', item.l, 2);
+  node.querySelector('.res-tag').textContent = labels('cluster', item.c);
+  return node;
+}
+
+// The address for the current choice on page `n`. With no filter, A to Z and 24 a page, it is the
+// server's page; otherwise ?per= is added whenever per is not 24 and the address names a page, filter,
+// search or sort, so a link opened on another screen size shows the same resources.
+// Other parameters in the address (a campaign tag, say) are kept as they are.
+const OWN_KEYS = ['type', 'level', 'cluster', 'search', 'sort', 'per', 'page'];
+function addressFor(picks, n) {
+  const params = new URLSearchParams(location.search);
+  OWN_KEYS.forEach((key) => params.delete(key));
+  const foreign = params.toString();
+  Object.entries(picks).forEach(([facet, list]) => {
+    if (list.length) params.set(facet, list.join(','));
+  });
+  if (search.value.trim()) params.set('search', search.value.trim());
+  if (sort !== 'title') params.set('sort', sort);
+  const named = params.toString() !== foreign;
+  const plain = !named && per === SERVER_PER;
+  if (per !== defaultPer || (per !== SERVER_PER && (n > 1 || named))) params.set('per', String(per));
+  let path = root.dataset.listUrl;
+  if (plain) {
+    if (n > 1) path += `page/${n}/`;
+  } else if (n > 1) params.set('page', String(n));
+  const query = params.toString();
+  return query ? `${path}?${query}` : path;
+}
+
+function writeAddress(picks, push) {
+  const address = addressFor(picks, page) + location.hash;
+  if (address === location.pathname + location.search + location.hash) return;
+  if (push) history.pushState(null, '', address);
+  else history.replaceState(null, '', address);
+}
+
+// Previous, numbered pages (first, last and two either side) and Next, as doors/pager draws them.
+function drawPager(picks, pages) {
+  const parts = [];
+  const link = (n, text, rel) => {
+    const a = document.createElement('a');
+    a.href = addressFor(picks, n);
+    a.textContent = text;
+    if (rel) a.rel = rel;
+    else a.setAttribute('aria-label', `Page ${n}`);
+    a.dataset.page = n;
+    return a;
+  };
+  if (page > 1) parts.push(link(page - 1, 'Previous', 'prev'));
+  let last = 0;
+  for (let n = 1; n <= pages; n += 1) {
+    if (n === 1 || n === pages || Math.abs(n - page) <= 2) {
+      if (n - last > 1) {
+        const gap = document.createElement('span');
+        gap.className = 'pager-gap';
+        gap.setAttribute('aria-hidden', 'true');
+        gap.textContent = '…';
+        parts.push(gap);
+      }
+      if (n === page) {
+        const current = document.createElement('span');
+        current.className = 'pager-current';
+        current.setAttribute('aria-current', 'page');
+        current.textContent = n;
+        parts.push(current);
+      } else parts.push(link(n, String(n)));
+      last = n;
+    }
+  }
+  if (page < pages) parts.push(link(page + 1, 'Next', 'next'));
+  clientPager.replaceChildren(...parts);
+  clientPagerTop.replaceChildren(...parts.map((part) => part.cloneNode(true)));
+  clientPager.hidden = pages <= 1;
+  clientPagerTop.hidden = pages <= 1;
+}
+
+function draw() {
+  const picks = chosen();
+  const query = words();
+  const filtering = anyChoice(picks, query);
+  const hits = orders[sort].filter((index) => matches(index, picks, query));
+  const pages = Math.max(1, Math.ceil(hits.length / per));
+  page = Math.min(Math.max(1, page), pages);
+  // The server's own cards while they are what the choice asks for.
+  const asServed = !filtering && sort === 'title' && per === SERVER_PER && page === serverPage;
+
+  facets.forEach((facet) => {
+    chipsOf(facet).forEach((chip) => {
+      const position = data.facets[facet.dataset.facet].indexOf(chip.dataset.value);
+      const field = { type: 'y', level: 'l', cluster: 'c' }[facet.dataset.facet];
+      let count = 0;
+      data.items.forEach((item, index) => {
+        if (item[field].includes(position) && matches(index, picks, query, facet.dataset.facet)) count += 1;
+      });
+      chip.querySelector('.chip-count').textContent = count;
+      chip.setAttribute('aria-label', `${labelOf(chip)}, ${count} ${count === 1 ? 'resource' : 'resources'}`);
+    });
+  });
+
+  // The order is part of the line, so a new sort is announced even when the range stays the same.
+  const order = sort === 'newest' ? 'newest first' : 'A to Z';
+  if (asServed) {
+    results.replaceChildren(...serverCards);
+    countLine.textContent = serverCount;
+  } else {
+    const first = (page - 1) * per;
+    const shown = hits.slice(first, first + per);
+    results.replaceChildren(...shown.map(drawCard));
+    const noun = filtering ? 'matching resources' : 'resources';
+    const from = filtering ? `, from ${total}` : '';
+    if (!hits.length) countLine.textContent = `No matching resources, from ${total}`;
+    else if (pages === 1) {
+      countLine.textContent = hits.length === 1
+        ? `Showing 1 matching resource, from ${total}`
+        : `Showing all ${fmt(hits.length)} ${noun}, ${order}${from}`;
+    } else {
+      countLine.textContent = `Showing ${fmt(first + 1)}–${fmt(first + shown.length)} of ${fmt(hits.length)} ${noun}, ${order}${from}`;
+    }
+  }
+  if (pager) pager.hidden = !asServed;
+  const pagerTop = document.querySelector('.pager-top');
+  if (pagerTop) pagerTop.hidden = !asServed;
+  if (asServed) {
+    clientPager.hidden = true;
+    clientPagerTop.hidden = true;
+  }
+  else drawPager(picks, pages);
+  empty.hidden = hits.length > 0;
+  results.hidden = hits.length === 0;
+  clear.hidden = !filtering;
+  // Each active filter as a chip that removes it, and the search too. Its group is named in the chip when
+  // another chip has the same label (two facets have an "Other"), and always to screen readers.
+  const removers = [];
+  facets.forEach((facet) => {
+    const group = facet.querySelector('legend')?.textContent.trim() || '';
+    chipsOf(facet).forEach((chip) => {
+      if (chip.getAttribute('aria-pressed') !== 'true') return;
+      removers.push([labelOf(chip), () => { chip.setAttribute('aria-pressed', 'false'); redraw(); }, group]);
+    });
+  });
+  if (search.value.trim()) removers.push([`“${search.value.trim()}”`, () => { search.value = ''; redraw(); }, 'Search']);
+  activeLine.hidden = !removers.length;
+  activeLine.replaceChildren(...removers.map(([label, remove, group]) => {
+    const named = group ? `${group}: ${label}` : label;
+    const button = document.createElement('button');
+    button.type = 'button';
+    button.className = 'active-chip';
+    button.textContent = removers.filter((other) => other[0] === label).length > 1 ? named : label;
+    button.setAttribute('aria-label', `Remove filter: ${named}`);
+    button.addEventListener('click', () => { remove(); clear.hidden ? search.focus() : clear.focus(); });
+    return button;
+  }));
+  const facetCount = Object.values(picks).reduce((sum, list) => sum + list.length, 0);
+  badge.textContent = facetCount ? `(${facetCount} active)` : '';
+  writeAddress(picks);
+}
+
+// A new filter, search, sort or page size starts again at page 1.
+function redraw() {
+  page = 1;
+  if (data) draw();
+  else writeAddress(chosen());
+}
+
+function loadSearchText() {
+  if (searchText || wantsFullSearch) return;
+  wantsFullSearch = true;
+  fetch(root.dataset.searchUrl)
+    .then((response) => (response.ok ? response.json() : Promise.reject(new Error(response.status))))
+    .then((text) => {
+      searchText = text;
+      if (data) draw();
+    })
+    // Search carries on over titles, which are already here.
+    .catch(() => {});
+}
+
+function reset() {
+  facets.forEach((facet) => chipsOf(facet).forEach((chip) => chip.setAttribute('aria-pressed', 'false')));
+  search.value = '';
+  redraw();
+  search.focus();
+}
+
+// Sets every control from the address, on load and on Back or Forward.
+function readAddress() {
+  const params = new URLSearchParams(location.search);
+  facets.forEach((facet) => {
+    const wanted = (params.get(facet.dataset.facet) || '').split(',');
+    chipsOf(facet).forEach((chip) => {
+      chip.setAttribute('aria-pressed', String(wanted.includes(chip.dataset.value)));
+    });
+  });
+  search.value = params.get('search') || '';
+  if (search.value) loadSearchText();
+  sort = params.get('sort') === 'newest' ? 'newest' : 'title';
+  const askedPer = Number(params.get('per'));
+  per = PER_OPTIONS.includes(askedPer) ? askedPer : defaultPer;
+  // The server's page number counts in 24s; at another size, start at the page holding its first card.
+  const path = location.pathname.slice(root.dataset.listUrl.length).match(/^page\/(\d+)\//);
+  const pathPage = path ? Number(path[1]) : 1;
+  const askedPage = Number(params.get('page'));
+  page = askedPage >= 1 ? Math.floor(askedPage) : Math.floor(((pathPage - 1) * SERVER_PER) / per) + 1;
+  sortSelect.value = sort;
+  perSelect.value = String(per);
+}
+
+facets.forEach((facet) => chipsOf(facet).forEach((chip) => {
+  chip.addEventListener('click', () => {
+    chip.setAttribute('aria-pressed', String(chip.getAttribute('aria-pressed') !== 'true'));
+    redraw();
+  });
+}));
+let typing = 0;
+search.addEventListener('input', () => {
+  loadSearchText();
+  clearTimeout(typing);
+  typing = setTimeout(redraw, 150);
+});
+clear.addEventListener('click', reset);
+document.getElementById('emptyReset').addEventListener('click', reset);
+sortSelect.addEventListener('change', () => {
+  sort = sortSelect.value;
+  redraw();
+});
+perSelect.addEventListener('change', () => {
+  per = Number(perSelect.value);
+  redraw();
+});
+// Page links work as links (a new tab gets the address); a plain click redraws in place, adds a
+// step to the history, and moves focus to the first resource on the new page.
+function turnPage(event) {
+  const target = event.target.closest('a[data-page]');
+  if (!target || event.button !== 0 || event.metaKey || event.ctrlKey || event.shiftKey || event.altKey) return;
+  event.preventDefault();
+  page = Number(target.dataset.page);
+  writeAddress(chosen(), true);
+  draw();
+  const firstLink = results.querySelector('.res-title a');
+  if (firstLink) {
+    countLine.scrollIntoView({ block: 'start' });
+    firstLink.focus({ preventScroll: true });
+  }
+}
+clientPager.addEventListener('click', turnPage);
+clientPagerTop.addEventListener('click', turnPage);
+window.addEventListener('popstate', () => {
+  readAddress();
+  if (data) draw();
+});
+
+// The filters are a collapsible drawer on phones and always open on wider screens.
+const wide = matchMedia('(min-width: 761px)');
+drawer.querySelector('summary').addEventListener('click', (event) => {
+  if (wide.matches) event.preventDefault();
+});
+wide.addEventListener('change', () => {
+  drawer.open = wide.matches;
+});
+
+readAddress();
+fetch(root.dataset.directoryUrl)
+  .then((response) => (response.ok ? response.json() : Promise.reject(new Error(response.status))))
+  .then((directory) => {
+    data = directory;
+    const titleOrder = data.items.map((_, index) => index);
+    // Newest first by the date added; resources without one keep A to Z order at the end.
+    const dated = titleOrder.filter((index) => data.items[index].d);
+    dated.sort((a, b) => (data.items[a].d < data.items[b].d ? 1 : data.items[a].d > data.items[b].d ? -1 : 0));
+    orders = { title: titleOrder, newest: dated.concat(titleOrder.filter((index) => !data.items[index].d)) };
+    sortSelect.disabled = false;
+    perSelect.disabled = false;
+    draw();
+  })
+  .catch(() => {
+    countLine.textContent = `${serverCount}. Filters could not be loaded, so please use the page links below.`;
+  });
diff --git a/assets/js/doors/search.js b/assets/js/doors/search.js
new file mode 100644
index 00000000000..47b162661c7
--- /dev/null
+++ b/assets/js/doors/search.js
@@ -0,0 +1,142 @@
+/* Site search over the theme's index.json, using the theme's Fuse options, so results rank as they
+   did. site.js loads this on the first search and calls window.doorsSearch with the query. */
+const dialog = document.getElementById('searchDialog');
+const input = document.getElementById('searchQuery');
+const status = document.getElementById('searchStatus');
+const hits = document.getElementById('searchHits');
+const LIMIT = 100;
+const SECTIONS = {
+  curated_resources: 'Resource', glossary: 'Glossary', post: 'News', authors: 'Person',
+  'educators-corner': "Educators' Corner", pedagogies: 'Pedagogies', summaries: 'Summary',
+  about: 'About', clusters: 'Cluster', disciplines: 'Discipline',
+};
+let fuse;
+
+function loadFuse() {
+  return new Promise((resolve, reject) => {
+    const script = document.createElement('script');
+    script.src = dialog.dataset.fuse;
+    script.integrity = dialog.dataset.fuseSri;
+    script.crossOrigin = 'anonymous';
+    script.onload = resolve;
+    script.onerror = reject;
+    document.head.append(script);
+  });
+}
+
+function ready() {
+  if (!fuse) {
+    status.textContent = 'Loading search.';
+    fuse = Promise.all([fetch(dialog.dataset.index), loadFuse()])
+      .then(([response]) => {
+        if (!response.ok) throw new Error(response.statusText);
+        return response.json();
+      })
+      .then((index) => new window.Fuse(index, {
+        shouldSort: true,
+        includeMatches: true,
+        tokenize: true,
+        threshold: Number(dialog.dataset.threshold),
+        location: 0,
+        distance: 100,
+        maxPatternLength: 32,
+        minMatchCharLength: Number(dialog.dataset.minLength),
+        keys: [
+          { name: 'title', weight: 0.99 },
+          { name: 'summary', weight: 0.6 },
+          { name: 'authors', weight: 0.5 },
+          { name: 'content', weight: 0.2 },
+          { name: 'tags', weight: 0.5 },
+          { name: 'categories', weight: 0.5 },
+        ],
+      }))
+      .catch((error) => {
+        fuse = undefined;
+        throw error;
+      });
+  }
+  return fuse;
+}
+
+function highlighted(text, query) {
+  const paragraph = document.createElement('p');
+  const words = query.split(/\s+/).filter(Boolean).map((word) => word.replace(/[.*+?^${}()|[\]\\]/g, '\\$&'));
+  if (!words.length) {
+    paragraph.textContent = text;
+    return paragraph;
+  }
+  text.split(new RegExp(`(${words.join('|')})`, 'gi')).forEach((part, index) => {
+    if (index % 2) {
+      const mark = document.createElement('mark');
+      mark.textContent = part;
+      paragraph.append(mark);
+    } else {
+      paragraph.append(part);
+    }
+  });
+  return paragraph;
+}
+
+function show(results, query) {
+  hits.replaceChildren(...results.slice(0, LIMIT).map(({ item }) => {
+    const row = document.createElement('li');
+    row.className = 'search-hit';
+    row.dir = 'auto';
+    row.lang = '';
+    const type = document.createElement('span');
+    type.className = 'hit-type';
+    type.textContent = SECTIONS[item.section] || item.section || 'Page';
+    const link = document.createElement('a');
+    link.href = item.relpermalink;
+    link.textContent = item.title;
+    row.append(type, link);
+    if (item.summary) row.append(highlighted(item.summary, query));
+    return row;
+  }));
+  const found = results.length === 1 ? '1 result' : `${results.length} results`;
+  status.textContent = results.length > LIMIT ? `${found}, showing the first ${LIMIT}.` : results.length ? `${found}.` : 'No results found.';
+}
+
+let timer;
+let latest = 0;
+async function run(query) {
+  const attempt = ++latest;
+  const url = new URL(location.href);
+  if (query) url.searchParams.set('q', query); else url.searchParams.delete('q');
+  history.replaceState(null, '', url);
+  if (!query) {
+    hits.replaceChildren();
+    status.textContent = '';
+    return;
+  }
+  try {
+    const engine = await ready();
+    if (attempt === latest) show(engine.search(query), query);
+  } catch {
+    if (attempt === latest) status.textContent = 'Search is unavailable right now. Reload the page and try again.';
+  }
+}
+
+input.addEventListener('input', () => {
+  clearTimeout(timer);
+  timer = setTimeout(() => run(input.value.trim()), 250);
+});
+input.addEventListener('keydown', (event) => {
+  if (event.key === 'Enter') {
+    clearTimeout(timer);
+    run(input.value.trim());
+  }
+});
+
+window.doorsSearch = (query) => {
+  input.value = query;
+  if (query) {
+    run(query);
+  } else {
+    latest += 1;
+    hits.replaceChildren();
+    ready().then(() => { status.textContent = ''; }, () => {
+      status.textContent = 'Search is unavailable right now. Reload the page and try again.';
+    });
+  }
+};
diff --git a/assets/js/doors/site.js b/assets/js/doors/site.js
new file mode 100644
index 00000000000..261033393be
--- /dev/null
+++ b/assets/js/doors/site.js
@@ -0,0 +1,815 @@
+/* Header behaviour for every page: mega menus, the phone menu and the search box.
+   Closing rules follow the Doors mock: Escape, a click outside and a second click all close,
+   and an opened menu is next in the Tab order because it follows its button in the page. */
+import './citations.js';
+import './references.js';
+import './glossary.js';
+
+const toggle = document.querySelector('.menu-toggle');
+const nav = document.querySelector('nav.primary');
+const head = document.querySelector('.site-head');
+const buttons = [...document.querySelectorAll('.nav-button')];
+
+function closeMenus(restoreFocus = false) {
+  const open = buttons.find((button) => button.getAttribute('aria-expanded') === 'true');
+  buttons.forEach((button) => {
+    button.setAttribute('aria-expanded', 'false');
+    document.getElementById(button.getAttribute('aria-controls')).hidden = true;
+  });
+  if (restoreFocus && open) open.focus();
+}
+
+function closePhoneMenu() {
+  nav.dataset.open = 'false';
+  toggle.setAttribute('aria-expanded', 'false');
+}
+
+buttons.forEach((button) => {
+  button.addEventListener('click', () => {
+    const wasOpen = button.getAttribute('aria-expanded') === 'true';
+    closeMenus();
+    if (!wasOpen) {
+      button.setAttribute('aria-expanded', 'true');
+      document.getElementById(button.getAttribute('aria-controls')).hidden = false;
+      // In the phone menu, keep the chosen parent in view above its opened list.
+      if (toggle.getClientRects().length) button.scrollIntoView({ block: 'nearest' });
+    }
+  });
+});
+
+toggle.addEventListener('click', () => {
+  const open = nav.dataset.open === 'true';
+  closeMenus();
+  nav.dataset.open = String(!open);
+  toggle.setAttribute('aria-expanded', String(!open));
+});
+
+document.addEventListener('click', (event) => {
+  if (!event.target.closest('.site-head')) {
+    closeMenus();
+    closePhoneMenu();
+  }
+});
+
+head.addEventListener('focusout', (event) => {
+  if (event.relatedTarget && !head.contains(event.relatedTarget)) {
+    closeMenus();
+    closePhoneMenu();
+  }
+});
+
+document.addEventListener('keydown', (event) => {
+  if (event.key !== 'Escape') return;
+  const phoneOpen = nav.dataset.open === 'true' && toggle.getClientRects().length > 0;
+  closeMenus(!phoneOpen);
+  closePhoneMenu();
+  if (phoneOpen) toggle.focus();
+});
+
+// Site search opens as a dialog. Its script, Fuse and the index load only now.
+const searchDialog = document.getElementById('searchDialog');
+function openSearch(query = '') {
+  if (!searchDialog) return;
+  if (!searchDialog.open) searchDialog.showModal();
+  const start = () => window.doorsSearch(query);
+  if (window.doorsSearch) {
+    start();
+  } else if (!searchDialog.dataset.loading) {
+    searchDialog.dataset.loading = 'true';
+    const script = document.createElement('script');
+    script.src = searchDialog.dataset.script;
+    script.onload = start;
+    script.onerror = () => {
+      script.remove();
+      delete searchDialog.dataset.loading;
+      document.getElementById('searchStatus').textContent = 'Search is unavailable right now. Try again in a moment.';
+    };
+    document.head.append(script);
+  }
+}
+if (searchDialog) {
+  document.querySelector('.search-nav')?.addEventListener('submit', (event) => {
+    event.preventDefault();
+    openSearch(event.target.elements.q.value.trim());
+  });
+  document.querySelector('.search-open')?.addEventListener('click', () => openSearch());
+  searchDialog.querySelector('.search-close').addEventListener('click', () => searchDialog.close());
+  searchDialog.addEventListener('click', (event) => {
+    if (event.target === searchDialog) searchDialog.close();
+  });
+  // A search box's own Escape only clears it, so close the dialog at once.
+  searchDialog.addEventListener('keydown', (event) => {
+    if (event.key === 'Escape') {
+      event.preventDefault();
+      searchDialog.close();
+    }
+  });
+  searchDialog.addEventListener('close', () => {
+    const url = new URL(location.href);
+    url.searchParams.delete('q');
+    history.replaceState(null, '', url);
+  });
+  document.addEventListener('keydown', (event) => {
+    if (event.key === '/' && !event.target.closest('input,textarea,select,[contenteditable]')) {
+      event.preventDefault();
+      openSearch();
+    }
+  });
+  const shared = new URLSearchParams(location.search).get('q');
+  if (shared) openSearch(shared);
+}
+
+// Newsletter sign-up (layouts/partials/doors/newsletter.html). Nothing loads from elsewhere until
+// a visitor presses Subscribe. Then Google reCAPTCHA loads, as EmailOctopus requires, and the form
+// posts the address to EmailOctopus the way its own embed does.
+let recaptcha;
+let recaptchaTries = 0;
+const loadRecaptcha = () => {
+  recaptcha ??= new Promise((resolve, reject) => {
+    const script = document.createElement('script');
+    // A failed or stalled load clears the cache, so the next Subscribe tries again. Each retry
+    // gets its own URL; otherwise the browser waits on the stalled request again.
+    // Only the latest attempt clears the cache: a late error from a stalled earlier script must
+    // not wipe out the promise of the retry that replaced it.
+    const attempt = recaptchaTries;
+    const fail = () => {
+      clearTimeout(timer);
+      if (attempt === recaptchaTries - 1) recaptcha = null;
+      script.remove();
+      reject(new Error('reCAPTCHA did not load'));
+    };
+    const timer = setTimeout(fail, 120000);
+    window.forrtRecaptchaReady = () => { clearTimeout(timer); resolve(window.grecaptcha); };
+    script.src = 'https://www.google.com/recaptcha/api.js?onload=forrtRecaptchaReady&render=explicit'
+      + (recaptchaTries ? `&retry=${recaptchaTries}` : '');
+    recaptchaTries += 1;
+    script.async = true;
+    script.onerror = fail;
+    document.head.append(script);
+  });
+  return recaptcha;
+};
+
+document.querySelectorAll('.newsletter-form').forEach((form) => {
+  const button = form.querySelector('.newsletter-submit');
+  const status = form.querySelector('.newsletter-status');
+  const email = form.querySelector('input[type=email]');
+  let widget;
+  let solved;
+  const say = (text, error) => {
+    status.textContent = text;
+    status.classList.toggle('is-error', Boolean(error));
+  };
+  const token = async () => {
+    const grecaptcha = await loadRecaptcha();
+    if (widget === undefined) {
+      const holder = document.createElement('div');
+      form.append(holder);
+      widget = grecaptcha.render(holder, {
+        sitekey: form.dataset.newsletterSitekey, size: 'invisible', badge: 'inline', isolated: true,
+        callback: (value) => solved?.resolve(value),
+        'error-callback': () => solved?.reject(new Error('reCAPTCHA failed')),
+      });
+      holder.hidden = true;
+    }
+    return new Promise((resolve, reject) => {
+      solved = { resolve, reject };
+      grecaptcha.execute(widget);
+    });
+  };
+
+  form.addEventListener('submit', async (event) => {
+    event.preventDefault();
+    if (!form.reportValidity()) return;
+    button.disabled = true;
+    say('Subscribing…');
+    try {
+      const body = new URLSearchParams();
+      form.querySelectorAll('input[name]').forEach((input) => body.set(input.name, input.value.trim()));
+      // Covers a reCAPTCHA script that stalls as well as a challenge the visitor closes.
+      body.set('recaptcha-response', await Promise.race([
+        token(),
+        new Promise((resolve, reject) => setTimeout(() => reject(new Error('reCAPTCHA timed out')), 120000)),
+      ]));
+      const reply = await (await fetch(form.action, { method: 'POST', mode: 'cors', cache: 'no-cache', body })).json();
+      if (reply.success) {
+        form.classList.add('is-done');
+        say('Thanks for subscribing! Look out for FORRT news in your inbox.');
+        status.focus();
+        return;
+      }
+      const code = reply.error?.code;
+      say(code === 'INVALID_PARAMETERS'
+        ? 'That email address does not look right. Please check it and try again.'
+        : 'Sorry, that did not work. Please try again, or ask to join at info@forrt.org.', true);
+      if (code === 'INVALID_PARAMETERS') email.focus();
+    } catch {
+      say('Sorry, that did not work. Please try again, or ask to join at info@forrt.org.', true);
+    } finally {
+      button.disabled = false;
+      if (widget !== undefined) window.grecaptcha?.reset(widget);
+    }
+  });
+});
+
+// An article's "Copy article link" button.
+document.querySelectorAll('[data-copy-link]').forEach((button) => {
+  const status = button.parentElement.querySelector('[role=status]');
+  button.addEventListener('click', async () => {
+    try {
+      await navigator.clipboard.writeText(button.dataset.copyLink);
+      status.textContent = 'Link copied.';
+    } catch {
+      status.textContent = 'Copy the address from your browser to share this page.';
+    }
+  });
+});
+
+// Code blocks, on the pages that load Highlight.js and Mermaid (site_head.html decides).
+document.addEventListener('DOMContentLoaded', () => {
+  document.querySelectorAll('code.language-mermaid').forEach((code) => {
+    const diagram = document.createElement('div');
+    diagram.className = 'mermaid';
+    diagram.textContent = code.textContent;
+    code.closest('pre').replaceWith(diagram);
+  });
+  if (window.mermaid) window.mermaid.init(undefined, '.mermaid');
+  if (window.hljs) window.hljs.initHighlighting();
+});
+
+// The theme's figure and gallery shortcodes write their images for lazysizes.
+document.querySelectorAll('img.lazyload[data-src]').forEach((image) => {
+  image.loading = 'lazy';
+  image.src = image.dataset.src;
+});
+
+// A video's player replaces its poster when someone asks to play it.
+document.addEventListener('click', (event) => {
+  const poster = event.target.closest('[data-video]');
+  if (!poster || event.metaKey || event.ctrlKey || event.shiftKey) return;
+  event.preventDefault();
+  const frame = document.createElement('iframe');
+  frame.src = `https://www.youtube-nocookie.com/embed/${poster.dataset.video}?autoplay=1`;
+  frame.title = poster.getAttribute('aria-label');
+  frame.allow = 'autoplay; encrypted-media; picture-in-picture; fullscreen';
+  frame.className = 'video-frame';
+  poster.replaceWith(frame);
+  frame.focus();
+});
+
+// A link to a heading inside a closed section opens the section.
+function openTarget() {
+  let id = location.hash.slice(1);
+  try { id = decodeURIComponent(id); } catch { /* a malformed address keeps its form */ }
+  const target = id && document.getElementById(id);
+  const section = target && target.closest('details');
+  if (section) {
+    section.hidden = false;
+    section.open = true;
+    target.scrollIntoView();
+  }
+}
+addEventListener('hashchange', openTarget);
+openTarget();
+
+// A long summaries page shows its first entries, a filter and a count, all added here so that
+// without JavaScript every entry shows and no control sits idle.
+const summaryEntries = [...document.querySelectorAll('.summary-entry')];
+if (summaryEntries.length) {
+  const tools = document.createElement('div');
+  tools.className = 'summary-tools';
+  tools.innerHTML = '<label>Filter these summaries <input type="search" autocomplete="off" spellcheck="false"></label><p class="summary-count" role="status"></p>';
+  summaryEntries[0].before(tools);
+  const more = document.createElement('button');
+  more.className = 'btn summary-more';
+  more.type = 'button';
+  more.textContent = 'Show more';
+  summaryEntries[summaryEntries.length - 1].after(more);
+  const input = tools.querySelector('input');
+  // What a filter looks through: title, takeaways, quote and abstract, not the fixed headings or related links.
+  const words = new Map(summaryEntries.map((entry) => {
+    const copy = entry.cloneNode(true);
+    copy.querySelectorAll('h3').forEach((heading) => heading.remove());
+    copy.querySelector('ul:last-of-type')?.remove();
+    return [entry, copy.textContent.toLowerCase()];
+  }));
+  let limit = 30;
+  const show = () => {
+    const query = input.value.trim().toLowerCase();
+    const matches = summaryEntries.filter((entry) => !query || words.get(entry).includes(query));
+    const shown = query ? matches : matches.slice(0, limit);
+    // An entry someone has opened, perhaps from a link to it, stays in view.
+    summaryEntries.forEach((entry) => { entry.hidden = !shown.includes(entry) && !entry.open; });
+    more.hidden = shown.length === matches.length;
+    const kept = summaryEntries.filter((entry) => !entry.hidden).length - shown.length;
+    const count = query ? `${matches.length} of ${summaryEntries.length} summaries match.` : `Showing ${shown.length} of ${summaryEntries.length} summaries.`;
+    tools.querySelector('[role=status]').textContent = kept ? `${count} ${kept} you opened ${kept === 1 ? 'stays' : 'stay'} in view.` : count;
+  };
+  input.addEventListener('input', show);
+  addEventListener('hashchange', show);
+  more.addEventListener('click', () => {
+    const next = summaryEntries[limit];
+    limit += 30;
+    show();
+    next?.querySelector('summary').focus();
+  });
+  show();
+}
+
+// Older content opens and closes sections with Bootstrap's data attributes.
+document.addEventListener('click', (event) => {
+  const toggle = event.target.closest('[data-toggle=collapse]');
+  if (!toggle || window.jQuery?.fn?.collapse) return;
+  const target = document.querySelector(toggle.getAttribute('href') || toggle.dataset.target);
+  if (!target) return;
+  event.preventDefault();
+  toggle.setAttribute('aria-expanded', String(target.classList.toggle('show')));
+});
+
+// The cookie banner covers the foot of the screen, so scrolling and side cards leave room for it.
+function watchBanner() {
+  const banner = document.querySelector('.cc-window');
+  if (!banner) return;
+  banner.lang = 'en';
+  banner.dir = 'ltr';
+  new ResizeObserver(() => {
+    document.documentElement.style.setProperty('--banner', `${banner.offsetHeight}px`);
+  }).observe(banner);
+}
+if (document.readyState === 'complete') watchBanner(); else addEventListener('load', () => setTimeout(watchBanner));
+
+// A citation file, shown in a dialog built on the first click. A page offers one only when it has a cite.bib.
+let citeDialog;
+document.addEventListener('click', async (event) => {
+  const cite = event.target.closest('.js-cite-modal');
+  if (!cite) return;
+  event.preventDefault();
+  if (!citeDialog) {
+    citeDialog = document.createElement('dialog');
+    citeDialog.className = 'cite-dialog';
+    citeDialog.innerHTML = '<h2>Cite</h2><pre tabindex="0"></pre><p role="status"></p><button class="btn btn-primary" type="button" data-copy>Copy</button> <a class="btn" download>Download</a> <button class="btn" type="button" data-close>Close</button>';
+    document.body.append(citeDialog);
+    citeDialog.querySelector('[data-close]').addEventListener('click', () => citeDialog.close());
+    citeDialog.querySelector('[data-copy]').addEventListener('click', async () => {
+      const status = citeDialog.querySelector('[role=status]');
+      try {
+        await navigator.clipboard.writeText(citeDialog.querySelector('pre').textContent);
+        status.textContent = 'Copied.';
+      } catch {
+        status.textContent = 'Select the text above to copy it.';
+      }
+    });
+  }
+  citeDialog.querySelector('a').href = cite.dataset.filename;
+  citeDialog.querySelector('[role=status]').textContent = '';
+  citeDialog.showModal();
+  const text = citeDialog.querySelector('pre');
+  text.textContent = 'Loading.';
+  try {
+    const response = await fetch(cite.dataset.filename);
+    if (!response.ok) throw new Error(response.statusText);
+    text.textContent = await response.text();
+  } catch {
+    text.textContent = 'The citation could not be loaded. Use the Download button.';
+  }
+});
+
+// Whether nothing of the page's own lies under a box (with a 6 px margin): no text, control, image or card,
+// a card being anything with its own background, shadow or side borders that does not span the screen.
+const textRange = document.createRange();
+function emptyAt(el, x, y) {
+  if (el === document.documentElement || el === document.body) return true;
+  if (el.closest('a,button,input,select,textarea,summary,label,img,svg,video,iframe,canvas,[role=button],[tabindex]:not([tabindex="-1"])')) return false;
+  for (const node of el.childNodes) {
+    if (node.nodeType !== Node.TEXT_NODE || !node.data.trim()) continue;
+    textRange.selectNodeContents(node);
+    if ([...textRange.getClientRects()].some((r) => x >= r.left && x <= r.right && y >= r.top && y <= r.bottom)) return false;
+  }
+  const screen = document.documentElement.clientWidth;
+  for (let e = el; e && e !== document.body; e = e.parentElement) {
+    const style = getComputedStyle(e);
+    const painted = style.backgroundColor !== 'rgba(0, 0, 0, 0)' || style.backgroundImage !== 'none' || style.boxShadow !== 'none'
+      || ['Left', 'Right'].every((side) => style[`border${side}Style`] !== 'none' && parseFloat(style[`border${side}Width`]));
+    const box = e.getBoundingClientRect();
+    if (painted && (box.left > 1 || box.right < screen - 1)) return false;
+  }
+  return true;
+}
+function overEmptySpace(box) {
+  for (let x = box.left - 6; x <= box.right + 6; x += 6) {
+    for (let y = box.top - 6; y <= box.bottom + 6; y += 6) {
+      const el = document.elementsFromPoint(x, y).find((e) => !e.closest('#just-os-widget'));
+      if (el && !emptyAt(el, x, y)) return false;
+    }
+  }
+  return true;
+}
+
+// The chatbot launcher. The chat's own script, styles and window load on the first click.
+const chatWidget = document.getElementById('just-os-widget');
+if (chatWidget) {
+  const chatButton = chatWidget.querySelector('#just-os-btn');
+  const chatBubble = chatWidget.querySelector('#just-os-bubble');
+  let chatLoading = false;
+  let chatFailed = false;
+  const dismissed = () => sessionStorage.getItem('just-os-dismissed');
+  if (dismissed()) chatWidget.hidden = true;
+  chatWidget.querySelector('#just-os-dismiss').addEventListener('click', () => {
+    chatWidget.hidden = true;
+    sessionStorage.setItem('just-os-dismissed', '1');
+  });
+  // The invitation shows and hides on a slow cycle, as it always has, and rests while the chat is open.
+  // It shows only over empty space, so it never covers text, a card or a control.
+  // Where the launcher is a tab (launcher.css) the margin is too narrow for it: there it is offered once, at the top of the page.
+  const chatOpen = () => document.getElementById('just-os-window')?.style.display === 'flex';
+  const tabbed = () => matchMedia('(max-width:1439px)').matches;
+  let offered = false;
+  const invitation = setInterval(() => {
+    if (dismissed() || chatFailed) return clearInterval(invitation);
+    if (chatOpen()) return;
+    const shown = chatBubble.classList.contains('bubble-visible');
+    chatBubble.classList.remove('bubble-visible');
+    if (tabbed() && (offered || scrollY > 0)) return clearInterval(invitation);
+    offered = true;
+    if (!shown && overEmptySpace(chatBubble.getBoundingClientRect())) chatBubble.classList.add('bubble-visible');
+  }, 10000);
+  // Any scroll hides it, and the message that the chat did not load, which replaces it after a click.
+  addEventListener('scroll', () => chatBubble.classList.remove('bubble-visible'), { passive: true });
+  if (chatButton.tagName === 'BUTTON') {
+    chatButton.addEventListener('click', () => {
+      if (window.toggleJustOS) {
+        window.toggleJustOS();
+        chatButton.setAttribute('aria-expanded', String(chatOpen()));
+        return;
+      }
+      if (chatLoading) return;
+      chatLoading = true;
+      const styles = document.createElement('link');
+      styles.rel = 'stylesheet';
+      styles.href = chatWidget.dataset.css;
+      document.head.append(styles);
+      chatWidget.append(document.getElementById('just-os-template').content.cloneNode(true));
+      const script = document.createElement('script');
+      script.src = chatWidget.dataset.js;
+      script.onload = () => {
+        window.toggleJustOS();
+        chatButton.setAttribute('aria-expanded', 'true');
+      };
+      script.onerror = () => {
+        chatLoading = false;
+        chatFailed = true;
+        document.getElementById('just-os-window')?.remove();
+        chatBubble.textContent = 'The chat did not load. Try again in a moment.';
+        chatBubble.classList.add('bubble-visible');
+      };
+      document.head.append(script);
+    });
+  }
+}
+
+// Glossary pages: filter the list of terms, and show the current term inside its card.
+const termFilter = document.getElementById('glossary-search');
+const termGrid = document.querySelector('.term-grid');
+if (termFilter && termGrid) {
+  // The glossary hub: match on the term's name, hide letters left empty, and say when nothing matches.
+  const terms = [...termGrid.querySelectorAll('li[data-term]')];
+  const groups = [...termGrid.querySelectorAll('.term-group')];
+  const none = document.querySelector('.glossary-none');
+  termFilter.addEventListener('input', () => {
+    const query = termFilter.value.trim().toLowerCase();
+    // Names first; when no name matches, the definitions (a related term may be named only inside them).
+    const byName = terms.some((term) => term.dataset.term.includes(query));
+    terms.forEach((term) => {
+      term.hidden = !(byName ? term.dataset.term : term.textContent.toLowerCase()).includes(query);
+    });
+    groups.forEach((group) => { group.hidden = !group.querySelector('li:not([hidden])'); });
+    none.hidden = groups.some((group) => !group.hidden);
+    // Letters with no match left are dimmed and leave the tab order.
+    groups.forEach((group) => {
+      const letter = document.querySelector(`.glossary-letters a[href="#${group.id}"]`);
+      if (!letter) return;
+      letter.classList.toggle('is-empty', group.hidden);
+      if (group.hidden) letter.setAttribute('tabindex', '-1'); else letter.removeAttribute('tabindex');
+    });
+    document.querySelector('.glossary-clear').hidden = !query;
+    const shown = terms.filter((term) => !term.hidden).length;
+    document.querySelector('.glossary-count').textContent = query && shown ? `${shown} of ${terms.length} terms` : '';
+  });
+  // Cards or a compact list; the choice is kept for the next visit.
+  const view = document.querySelector('.glossary-view');
+  const setView = (list) => {
+    termGrid.classList.toggle('is-list', list);
+    view.querySelectorAll('button').forEach((b) => b.setAttribute('aria-pressed', String((b.dataset.view === 'list') === list)));
+    try { localStorage.setItem('glossary-view', list ? 'list' : 'cards'); } catch (e) { /* storage blocked: the choice lasts this visit */ }
+  };
+  view.hidden = false;
+  view.querySelectorAll('button').forEach((b) => b.addEventListener('click', () => setView(b.dataset.view === 'list')));
+  // Phones start with the compact list; a stored choice wins.
+  let stored = null;
+  try { stored = localStorage.getItem('glossary-view'); } catch (e) { /* no stored choice */ }
+  if (stored ? stored === 'list' : matchMedia('(max-width: 760px)').matches) setView(stored === 'list' || !stored);
+  // The letter whose terms are on screen is marked in the letter bar.
+  const letterLinks = [...document.querySelectorAll('.glossary-letters a')];
+  if ('IntersectionObserver' in window && letterLinks.length) {
+    const seen = new Map();
+    const mark = () => {
+      const top = [...seen.entries()].filter(([, on]) => on).map(([id]) => id)[0];
+      const first = top || (scrollY < 200 ? [...seen.keys()][0] : null);
+      if (first) letterLinks.forEach((a) => a.classList.toggle('is-current', a.hash === `#${first}`));
+    };
+    const watch = new IntersectionObserver((entries) => {
+      entries.forEach((e) => seen.set(e.target.id, e.isIntersecting));
+      mark();
+    }, { rootMargin: '-35% 0px -60% 0px' });
+    document.querySelectorAll('.term-group').forEach((g) => { seen.set(g.id, false); watch.observe(g); });
+    mark();
+  }
+  document.querySelector('.glossary-clear').addEventListener('click', () => {
+    termFilter.value = '';
+    termFilter.dispatchEvent(new Event('input'));
+    termFilter.focus();
+  });
+  // /glossary/english/?q=… opens with that search, so a related term without its own page can link here.
+  const asked = new URLSearchParams(location.search).get('q');
+  if (asked) { termFilter.value = asked; termFilter.dispatchEvent(new Event('input')); }
+  // "How to cite" links to the closed disclosure under the heading; following the link opens it.
+  const about = document.getElementById('about-the-glossary');
+  const openAbout = () => { if (location.hash === '#about-the-glossary') about.open = true; };
+  window.addEventListener('hashchange', openAbout);
+  openAbout();
+} else if (termFilter) {
+  const terms = [...document.querySelectorAll('.term-list li')];
+  // A count, a no-results line and a clear button under the filter.
+  const status = document.createElement('p');
+  status.className = 'term-filter-status';
+  status.setAttribute('aria-live', 'polite');
+  const clearTerms = document.createElement('button');
+  clearTerms.type = 'button';
+  clearTerms.className = 'term-filter-clear';
+  clearTerms.textContent = 'Clear';
+  clearTerms.hidden = true;
+  termFilter.after(status, clearTerms);
+  clearTerms.addEventListener('click', () => { termFilter.value = ''; termFilter.dispatchEvent(new Event('input')); termFilter.focus(); });
+  termFilter.addEventListener('input', () => {
+    const query = termFilter.value.toLowerCase();
+    terms.forEach((term) => { term.hidden = !term.textContent.toLowerCase().includes(query); });
+    const shown = terms.filter((term) => !term.hidden).length;
+    status.textContent = !query ? '' : shown ? `${shown} ${shown === 1 ? 'term' : 'terms'}` : 'No matching terms.';
+    clearTerms.hidden = !query;
+  });
+  // On a phone the list moves up, into a "Find another term" disclosure right after the definition.
+  const card = document.getElementById('glossary-terms');
+  const definition = document.querySelector('.term-definition');
+  if (card && definition && window.matchMedia('(max-width: 1000px)').matches) {
+    const finder = document.createElement('details');
+    finder.className = 'term-finder';
+    const summary = document.createElement('summary');
+    summary.textContent = document.documentElement.lang.startsWith('en') ? 'Find another term' : (card.querySelector('h2')?.textContent || 'Find another term');
+    finder.append(summary, card);
+    definition.after(finder);
+    document.querySelector('.term-list-jump')?.remove();
+  }
+  const list = document.querySelector('.term-list');
+  const current = list.querySelector('[aria-current]');
+  const centre = () => { if (current) list.scrollTop = current.offsetTop - list.offsetTop - list.clientHeight / 3; };
+  centre();
+  // A closed disclosure has no layout, so the phone list is centred on the current term when it opens.
+  document.querySelector('.term-finder')?.addEventListener('toggle', (event) => { if (event.target.open) centre(); });
+}
+
+// Home: on a phone each area shows two links, and its "more" button shows the rest.
+document.querySelectorAll('.area-more button').forEach((button) => {
+  button.addEventListener('click', () => {
+    const area = button.closest('.area');
+    area.classList.add('is-open');
+    button.setAttribute('aria-expanded', 'true');
+    area.querySelector('li:nth-child(3) a')?.focus();
+  });
+});
+
+// An entry whose details give "Status: …" (the effects on /reversals/) shows that status as a chip beside its name.
+document.querySelectorAll('.article-style li > p > strong:first-child').forEach((name) => {
+  const item = name.closest('li');
+  if (!item.querySelector('.spoiler')) return;
+  const line = [...item.querySelectorAll('.spoiler li')].find((li) => /^\s*status:/i.test(li.textContent));
+  const status = line ? line.textContent.replace(/^\s*status:\s*/i, '').trim().toLowerCase() : '';
+  // One word set for the chips; any qualifier stays in the statistics and in the chip's title.
+  // An entry with no status says so, so that it can still be found by outcome.
+  const label = ['not replicated', 'reversed', 'mixed', 'replicated'].find((word) => status.startsWith(word) || status.includes(word)) || 'no status';
+  const chip = document.createElement('span');
+  chip.className = `status-chip status-${label.replace(/[^a-z]+/g, '-')}`;
+  chip.textContent = label;
+  if (status !== label) chip.title = status;
+  name.before(chip, ' ');
+});
+
+// Get Involved: a search over the project cards.
+const projectFilter = document.querySelector('.project-filter');
+if (projectFilter) {
+  projectFilter.hidden = false;
+  const input = projectFilter.querySelector('input');
+  const count = projectFilter.querySelector('.list-filter-count');
+  const cards = [...document.querySelectorAll('.get-involved-card')];
+  // A card matches on its name and description, not on its actions, which every card shares ("Email", "Slack channel").
+  const texts = cards.map((card) => [...card.querySelectorAll(':scope > h3, :scope > h3 + div')]
+    .map((part) => part.textContent).join(' ').toLowerCase());
+  input.addEventListener('input', () => {
+    const query = input.value.trim().toLowerCase();
+    let shown = 0;
+    cards.forEach((card, index) => {
+      const match = !query || texts[index].includes(query);
+      card.hidden = !match;
+      if (match) shown += 1;
+    });
+    count.textContent = !query ? '' : shown ? `${shown} of ${cards.length} projects` : 'No project matches.';
+  });
+}
+
+// A search over the list items after it (shortcodes/list_filter.html): items match on their text, and a
+// heading whose lists are all hidden hides too, so the page reads as the matches.
+const listFilter = document.querySelector('.list-filter:not(.project-filter)');
+if (listFilter) {
+  listFilter.hidden = false;
+  const input = listFilter.querySelector('input');
+  const count = listFilter.querySelector('.list-filter-count');
+  // The label, the field and the count form the search row, the part of the toolbar that stays on screen on a phone.
+  const searchRow = document.createElement('div');
+  searchRow.className = 'list-filter-search';
+  searchRow.append(listFilter.querySelector('label'), count, input);
+  listFilter.prepend(searchRow);
+  const noun = listFilter.dataset.noun || 'entries';
+  const sections = [];
+  let section = null;
+  for (let node = listFilter.nextElementSibling; node; node = node.nextElementSibling) {
+    if (/^H[1-3]$/.test(node.tagName)) { section = {heading: node, items: []}; sections.push(section); }
+    else if (section && /^(UL|OL)$/.test(node.tagName)) section.items.push(...node.children);
+  }
+  // Where the entries carry details (the reversals' statistics), other lists after them, such as further
+  // literature or contributors, are not entries: they stay out of the menu, the count and the filter.
+  if (sections.some(({items}) => items.some((item) => item.querySelector('.spoiler')))) {
+    sections.forEach((s) => { s.items = s.items.filter((item) => item.querySelector('.spoiler')); });
+  }
+  // A menu of the sections that hold entries, with their counts, to jump straight to one.
+  const withItems = sections.filter(({items}) => items.length && items.length < 400);
+  if (withItems.length > 3) {
+    const jump = document.createElement('label');
+    jump.className = 'list-filter-jump';
+    jump.textContent = 'Go to ';
+    const select = document.createElement('select');
+    select.append(new Option('a section…', ''));
+    withItems.forEach(({heading, items}) => select.append(new Option(`${heading.textContent.trim()} (${items.length})`, heading.id)));
+    select.addEventListener('change', () => { if (select.value) document.getElementById(select.value).scrollIntoView(); });
+    jump.append(select);
+    listFilter.append(jump);
+  }
+  // Status buttons, when the entries carry status chips: show one outcome at a time.
+  let status = '';
+  const outcomes = ['not replicated', 'reversed', 'mixed', 'replicated', 'no status'].filter((word) => document.querySelector(`.status-${word.replace(' ', '-')}`));
+  if (outcomes.length) {
+    const row = document.createElement('div');
+    row.className = 'list-filter-status';
+    row.setAttribute('role', 'group');
+    row.setAttribute('aria-label', 'Show by outcome');
+    ['all', ...outcomes].forEach((word) => {
+      const button = document.createElement('button');
+      button.type = 'button';
+      button.className = word === 'all' ? 'status-chip' : `status-chip status-${word.replace(' ', '-')}`;
+      const many = word === 'all' ? '' : ` ${document.querySelectorAll(`.list-filter ~ ul .status-${word.replace(' ', '-')}`).length}`;
+      button.textContent = word + many;
+      button.setAttribute('aria-pressed', String(word === 'all'));
+      button.addEventListener('click', () => {
+        status = word === 'all' ? '' : word.replace(' ', '-');
+        row.querySelectorAll('button').forEach((other) => other.setAttribute('aria-pressed', String(other === button)));
+        input.dispatchEvent(new Event('input'));
+      });
+      row.append(button);
+    });
+    listFilter.append(row);
+  }
+  // Each entry's text is read once, so controls added to the entries later (their "more" buttons) are not searched.
+  const texts = new Map(sections.flatMap(({items}) => items.map((item) => [item, item.textContent])));
+  const total = texts.size;
+  let words = /./;
+  input.addEventListener('input', () => {
+    const query = input.value.trim().toLowerCase();
+    words = new RegExp(`(^|[^\\p{L}\\p{N}])${query.replace(/[.*+?^${}()|[\]\\]/g, '\\$&')}`, 'iu');
+    let shown = 0;
+    sections.forEach(({heading, items}) => {
+      if (!items.length) return;
+      let any = false;
+      items.forEach((item) => {
+        // Matches the start of a word, so "ego" finds ego depletion and not "category".
+        const match = (!query || words.test(texts.get(item))) && (!status || item.querySelector(`.status-${status}`));
+        item.hidden = !match;
+        if (match) { any = true; shown += 1; }
+      });
+      heading.hidden = Boolean(query || status) && !any;
+    });
+    count.textContent = `Showing ${shown} of ${total} ${noun}`;
+  });
+  input.dispatchEvent(new Event('input'));
+}
+
+// /reversals/: the search, outcome and Go to controls are a toolbar that stays at the top of the screen while the
+// effects scroll under it (on a phone only the search row stays), and each effect shows the start of its
+// description, with a "more" button for the rest.
+const entryFilter = document.querySelector('.list-filter:not(.project-filter):not([hidden])');
+const entries = entryFilter ? [...document.querySelectorAll('.list-filter ~ ul > li')]
+  .filter((item) => item.firstElementChild?.matches('p') && item.querySelector(':scope > .spoiler')) : [];
+if (entries.length) {
+  // The toolbar sticks only within the list: one box from the toolbar to the last entry's list.
+  const section = document.createElement('div');
+  section.className = 'list-filter-section';
+  const last = entries[entries.length - 1].parentElement;
+  entryFilter.before(section);
+  for (let node = entryFilter; node;) {
+    const next = node.nextSibling;
+    section.append(node);
+    node = node === last ? null : next;
+  }
+  // Rows scrolled to or reached with Tab stop below the toolbar: its height is the page's scroll padding.
+  const phone = matchMedia('(max-width: 760px)');
+  const searchRow = entryFilter.querySelector('.list-filter-search');
+  const pad = () => document.documentElement.style.setProperty('--list-filter-bar', `${(phone.matches ? searchRow : entryFilter).offsetHeight}px`);
+  const bars = new ResizeObserver(pad);
+  bars.observe(entryFilter);
+  bars.observe(searchRow);
+  // The description is cut to its first lines; an entry whose text runs longer gets the button.
+  entries.forEach((item) => {
+    const text = item.firstElementChild;
+    text.classList.add('entry-text');
+    const more = document.createElement('button');
+    more.type = 'button';
+    more.className = 'entry-more';
+    more.setAttribute('aria-expanded', 'false');
+    // The label names the effect for screen readers; it is an attribute, not hidden text, so it adds nothing to the line.
+    const about = ` about ${text.querySelector('strong')?.textContent.trim() || 'this effect'}`;
+    const label = (word) => { more.textContent = word; more.setAttribute('aria-label', word + about); };
+    label('more');
+    more.addEventListener('click', () => {
+      const open = item.classList.toggle('is-open');
+      more.setAttribute('aria-expanded', String(open));
+      label(open ? 'less' : 'more');
+      // The width may have changed while it was open, so check again whether the text still runs over.
+      if (!open) item.classList.toggle('is-long', text.scrollHeight > text.clientHeight + 2);
+    });
+    text.after(more);
+  });
+  // While a search is typed, the matching entries show in full, so the match can be seen wherever it is.
+  const query = entryFilter.querySelector('input');
+  const measure = () => {
+    if (section.classList.contains('is-searching')) return;
+    const long = entries.map((item) => !item.hidden && !item.classList.contains('is-open') && item.firstElementChild.scrollHeight > item.firstElementChild.clientHeight + 2);
+    entries.forEach((item, i) => { if (!item.hidden && !item.classList.contains('is-open')) item.classList.toggle('is-long', long[i]); });
+  };
+  query.addEventListener('input', () => {
+    section.classList.toggle('is-searching', Boolean(query.value.trim()));
+    measure();
+  });
+  let width = 0;
+  new ResizeObserver(([entry]) => {
+    if (Math.round(entry.contentRect.width) === width) return;
+    width = Math.round(entry.contentRect.width);
+    measure();
+  }).observe(section);
+  document.fonts?.ready.then(measure);
+}
+
+// A table wider than the screen scrolls in its own box, so keyboard users must be able to focus it.
+// Closed sections and late fonts change the answer after load.
+function focusableTable(table) {
+  if (table.scrollWidth > table.clientWidth) table.tabIndex = 0;
+  else table.removeAttribute('tabindex');
+}
+const tables = document.querySelectorAll('.article-style table');
+const tableSizes = new ResizeObserver((entries) => entries.forEach((entry) => focusableTable(entry.target)));
+tables.forEach((table) => tableSizes.observe(table));
+document.fonts?.ready.then(() => tables.forEach(focusableTable));
+
+// Altmetric's badges are links with no text, so each takes the name of what it measures.
+const badges = document.querySelectorAll('.altmetric-embed');
+if (badges.length) {
+  const nameBadges = () => badges.forEach((badge) => {
+    const label = badge.previousElementSibling?.classList.contains('pub-metric-label') ? badge.previousElementSibling.textContent : 'publication';
+    badge.querySelector('a:not([aria-label])')?.setAttribute('aria-label', `Altmetric attention for this ${label.toLowerCase()}`);
+  });
+  new MutationObserver(nameBadges).observe(document.querySelector('.pub-list, .article-style') || document.body, { childList: true, subtree: true });
+}
+
+// Phone contents (doors/toc_phone): a list of more than six sections shows its first five and a button for the rest.
+document.querySelectorAll('.toc-phone').forEach((box) => {
+  const items = [...box.querySelectorAll('nav > ul > li')];
+  if (items.length <= 6) return;
+  items.slice(5).forEach((item) => item.classList.add('toc-extra'));
+  box.classList.add('is-short');
+  const more = document.createElement('button');
+  more.type = 'button';
+  more.className = 'toc-phone-more';
+  more.textContent = `Show all ${items.length} sections`;
+  more.addEventListener('click', () => {
+    box.classList.remove('is-short');
+    more.remove();
+    items[5].querySelector('a')?.focus();
+  });
+  box.querySelector('.article-toc').append(more);
+});
diff --git a/assets/js/doors/steering.js b/assets/js/doors/steering.js
new file mode 100644
index 00000000000..2ec2a153930
--- /dev/null
+++ b/assets/js/doors/steering.js
@@ -0,0 +1,83 @@
+/* The steering committee page is generated with click-only cards and always-present dialogs, so this
+   gives them what keyboards and screen readers need. scripts/generate_sc_profiles.py is the source. */
+// Keep each team's name with its people, so that small teams can sit side by side.
+document.querySelectorAll('.sc-grid').forEach((grid) => {
+  let team = null;
+  [...grid.children].forEach((tile) => {
+    if (tile.classList.contains('sc-title-card')) {
+      team = document.createElement('div');
+      team.className = 'sc-team';
+      tile.before(team);
+    }
+    if (team) team.append(tile);
+  });
+  grid.querySelectorAll('.sc-team').forEach((group) => {
+    group.style.setProperty('--sc-members', group.querySelectorAll('.sc-card').length);
+  });
+});
+
+let trigger = null;
+const backdrops = [...document.querySelectorAll('.sc-modal-backdrop')];
+
+backdrops.forEach((backdrop) => {
+  const name = backdrop.querySelector('.sc-modal-name');
+  backdrop.setAttribute('role', 'dialog');
+  backdrop.setAttribute('aria-modal', 'true');
+  if (name) {
+    name.id = name.id || `${backdrop.id}-name`;
+    backdrop.setAttribute('aria-labelledby', name.id);
+  }
+  backdrop.querySelector('.sc-close-btn')?.setAttribute('aria-label', 'Close this profile');
+  backdrop.querySelectorAll('.sc-social-links a').forEach((link) => {
+    if (!link.getAttribute('aria-label')) {
+      const host = new URL(link.href, location.href);
+      link.setAttribute('aria-label', host.protocol === 'mailto:' ? 'Email' : host.hostname.replace(/^www\./, ''));
+    }
+  });
+});
+
+document.querySelectorAll('.sc-card[onclick]').forEach((card) => {
+  const name = card.querySelector('.sc-card-name');
+  card.setAttribute('role', 'button');
+  card.tabIndex = 0;
+  card.setAttribute('aria-label', `Open the profile of ${name ? name.textContent.trim() : 'this person'}`);
+  card.addEventListener('click', () => { trigger = card; });
+  card.addEventListener('keydown', (event) => {
+    if (event.key === 'Enter' || event.key === ' ') {
+      event.preventDefault();
+      card.click();
+    }
+  });
+});
+
+// Into the dialog when it opens, back to the card when it closes, and Tab stays inside while open.
+const observer = new MutationObserver(() => {
+  const open = backdrops.find((backdrop) => backdrop.classList.contains('active'));
+  if (open) {
+    // The dialog can't take focus until its fade-in has made it visible.
+    if (!open.contains(document.activeElement)) setTimeout(() => open.querySelector('.sc-close-btn')?.focus(), 60);
+  } else if (trigger) {
+    trigger.focus();
+    trigger = null;
+  }
+});
+backdrops.forEach((backdrop) => observer.observe(backdrop, { attributes: true, attributeFilter: ['class'] }));
+
+document.addEventListener('keydown', (event) => {
+  if (event.key !== 'Tab') return;
+  const open = backdrops.find((backdrop) => backdrop.classList.contains('active'));
+  if (!open) return;
+  const stops = [...open.querySelectorAll('a[href],button')].filter((el) => el.getClientRects().length);
+  const first = stops[0];
+  const last = stops[stops.length - 1];
+  if (!open.contains(document.activeElement)) {
+    event.preventDefault();
+    (event.shiftKey ? last : first).focus();
+  } else if (event.shiftKey && document.activeElement === first) {
+    event.preventDefault();
+    last.focus();
+  } else if (!event.shiftKey && document.activeElement === last) {
+    event.preventDefault();
+    first.focus();
+  }
+});
diff --git a/assets/js/tower/README.md b/assets/js/tower/README.md
new file mode 100644
index 00000000000..77a6a8bf01d
--- /dev/null
+++ b/assets/js/tower/README.md
@@ -0,0 +1,20 @@
+# The tower game
+
+A free-building Lego game that opens in a dialog from "Build it yourself" on the home page. `../doors/castle.js` loads it when a visitor presses that button.
+
+The site serves two prebuilt files from `static/js/tower/`, which have to stay in the same folder:
+
+| File | Size gzipped | Fetched when |
+|---|---|---|
+| `game.bundle.js` | 166 KB, with its own copy of Three.js | The visitor presses the button |
+| `physics.bundle.js` | 25 KB | The first wobble warning |
+
+The sources are here, and Hugo does not read them. Rebuilding is the one step that needs Node, and only on the machine doing it. From the repository's root:
+
+```sh
+npm install --prefix /tmp/tower-build --no-audit --no-fund three@0.186.0 cannon-es@0.20.0 esbuild@0.28.2
+NODE_PATH=/tmp/tower-build/node_modules /tmp/tower-build/node_modules/.bin/esbuild assets/js/tower/game.js --bundle --minify --format=iife --outfile=static/js/tower/game.bundle.js --legal-comments=eof --define:__DEBUG__=false
+NODE_PATH=/tmp/tower-build/node_modules /tmp/tower-build/node_modules/.bin/esbuild assets/js/tower/physics-entry.js --bundle --minify --format=iife --global-name=CANNON --outfile=static/js/tower/physics.bundle.js --legal-comments=eof
+```
+
+The game calls `window.forrtHeroSuspend(true)` as it opens and `(false)` as it closes, so the castle stops drawing behind it. It adds its own styles and `<dialog>`, and uses the page's fonts.
diff --git a/assets/js/tower/collapse.js b/assets/js/tower/collapse.js
new file mode 100644
index 00000000000..26195d4db8b
--- /dev/null
+++ b/assets/js/tower/collapse.js
@@ -0,0 +1,134 @@
+/* The collapse after "Place it anyway". Physics engines know nothing of studs, so grip is modelled by what moves together:
+   bricks that grip each other form one rigid clump, and a hard enough knock breaks a clump at its weakest joints, those with
+   the fewest studs. A clump starts on the bricks that stay, so a load leaning past the studs under it tips over their edge. */
+const GRAVITY = -26, FRICTION = .55, BOUNCE = .18, DENSITY = 20;
+const BREAK_SPEED = 1.6, BREAK_PER_SPEED = .75, BURST = .9, TIP = .55, TUMBLE = 2.2, EARLIEST_REST = 1.2, SHAKE_AT = .7, SHAKE = 9, TOP_SPEED = 15, TOP_SPIN = 12, TIME_LIMIT = 5, STEP = 1 / 60;
+
+export function createCollapse(C, { pieces, grips, standing, shell, groundY, leans, random = Math.random }) {
+  const world = new C.World({ gravity: new C.Vec3(0, GRAVITY, 0), allowSleep: true });
+  world.broadphase = new C.SAPBroadphase(world);
+  world.solver.iterations = 18;
+  world.defaultContactMaterial.friction = FRICTION;
+  world.defaultContactMaterial.restitution = BOUNCE;
+
+  const fixed = b => world.addBody(new C.Body({ mass: 0, shape: new C.Box(new C.Vec3(b.hx, b.hy, b.hz)), position: new C.Vec3(b.x, b.y, b.z) }));
+  shell.forEach(fixed);
+  standing.forEach(fixed);
+  const floor = new C.Body({ mass: 0, shape: new C.Plane(), position: new C.Vec3(0, groundY, 0) });
+  floor.quaternion.setFromAxisAngle(new C.Vec3(1, 0, 0), -Math.PI / 2);
+  world.addBody(floor);
+
+  const turns = pieces.map(p => new C.Quaternion().setFromAxisAngle(new C.Vec3(0, 1, 0), p.rotY));
+  const volume = p => p.hx * p.hy * p.hz;
+  const clumps = new Set();
+  const hits = new Map();
+  let time = 0;
+  /* No two joints are quite alike, so a stack of equal bricks does not come apart all at once. */
+  const strength = grips.map(g => g.studs + random() * 1.5);
+
+  function makeClump(members, offsetOf, origin, turn, velocityAt, spin, level) {
+    let m = 0;
+    const com = new C.Vec3();
+    for (const k of members) { const v = volume(pieces[k]), o = offsetOf(k); m += v; com.x += o.x * v; com.y += o.y * v; com.z += o.z * v; }
+    com.scale(1 / m, com);
+    const body = new C.Body({ mass: 8 * m * DENSITY, position: origin.vadd(turn.vmult(com)), quaternion: turn.clone(), velocity: velocityAt(turn.vmult(com)), angularVelocity: spin.clone(), allowSleep: time >= EARLIEST_REST, sleepSpeedLimit: .6, sleepTimeLimit: .25 });
+    const offsets = new Map();
+    for (const k of members) {
+      const p = pieces[k], o = offsetOf(k).vsub(com);
+      offsets.set(k, o);
+      body.addShape(new C.Box(new C.Vec3(p.hx, p.hy, p.hz)), o);
+    }
+    const clump = { body, members, offsets, level, from: body.position.clone() };
+    body.addEventListener('collide', e => {
+      if (members.length < 2) return;
+      const speed = Math.abs(e.contact.getImpactVelocityAlongNormal());
+      if (speed > BREAK_SPEED) hits.set(clump, Math.max(hits.get(clump) || 0, speed));
+    });
+    world.addBody(body);
+    clumps.add(clump);
+    return clump;
+  }
+  /* Groups of bricks still gripped together, ignoring joints of `level` studs or fewer. */
+  function groupsOf(members, level) {
+    const parent = new Map(members.map(k => [k, k]));
+    const find = k => (parent.get(k) === k ? k : (parent.set(k, find(parent.get(k))), parent.get(k)));
+    grips.forEach((g, n) => { if (strength[n] > level && parent.has(g.a) && parent.has(g.b)) parent.set(find(g.a), find(g.b)); });
+    const groups = new Map();
+    for (const k of members) { const r = find(k); if (!groups.has(r)) groups.set(r, []); groups.get(r).push(k); }
+    return [...groups.values()];
+  }
+  function split(clump, speed) {
+    clump.level += speed * BREAK_PER_SPEED;
+    const groups = groupsOf(clump.members, clump.level);
+    if (groups.length < 2) return;
+    const { body, offsets, level } = clump;
+    world.removeBody(body);
+    clumps.delete(clump);
+    // Joints letting go throw the parts a little apart, away from the middle of what broke.
+    const velocityAt = r => {
+      const out = body.velocity.vadd(body.angularVelocity.cross(r)), d = Math.hypot(r.x, r.y, r.z) || 1;
+      return out.vadd(new C.Vec3(r.x / d * BURST, Math.abs(r.y) / d * BURST * .5, r.z / d * BURST));
+    };
+    // And no two parts leave quite alike, or equal bricks would land in a neat row.
+    const tumble = () => (random() - .5) * TUMBLE;
+    for (const members of groups) makeClump(members, k => offsets.get(k), body.position, body.quaternion, velocityAt, body.angularVelocity.vadd(new C.Vec3(tumble(), tumble(), tumble())), level);
+  }
+
+  const start = new C.Quaternion(), at = new C.Vec3(), none = new C.Vec3();
+  for (const members of groupsOf(pieces.map((_, k) => k), 0)) {
+    const clump = makeClump(members, k => new C.Vec3(pieces[k].x, pieces[k].y, pieces[k].z), at, start, () => none.clone(), none, 0);
+    // The grip lets go on the far side first, so the clump starts to turn over the edge it is leaning past.
+    const lean = leans.find(l => members.includes(l.piece));
+    if (lean) {
+      const dx = clump.body.position.x - lean.x, dz = clump.body.position.z - lean.z, d = Math.hypot(dx, dz) || 1;
+      clump.body.angularVelocity.set(dz / d * TIP, 0, -dx / d * TIP);
+    }
+  }
+
+  function stuck(clump) {
+    const { body } = clump;
+    if (clump.members.length > 1) { const before = clumps.size; split(clump, SHAKE); if (clumps.size !== before || !clumps.has(clump)) return; }
+    const dx = body.position.x, dz = body.position.z, d = Math.hypot(dx, dz) || 1;
+    body.velocity.set(dx / d * 1.6, 1, dz / d * 1.6);
+    body.angularVelocity.set(dz / d * 3, 0, -dx / d * 3);
+  }
+  const v = new C.Vec3(), q = new C.Quaternion();
+  function draw() {
+    for (const { body, members, offsets } of clumps) for (const k of members) {
+      body.quaternion.vmult(offsets.get(k), v);
+      const o = pieces[k].object;
+      o.position.set(body.position.x + v.x, body.position.y + v.y, body.position.z + v.z);
+      body.quaternion.mult(turns[k], q);
+      o.quaternion.set(q.x, q.y, q.z, q.w);
+    }
+  }
+  function tick() {
+    world.step(STEP);
+    time += STEP;
+    // A load tipping slowly moves about as little as one at rest, so nothing may count as settled until it has had time to go over.
+    if (time >= EARLIEST_REST) for (const { body } of clumps) body.allowSleep = true;
+    // Contacts this tight can throw a body far too hard. Nothing in a fall this small moves that fast.
+    for (const { body } of clumps) {
+      const speed = body.velocity.length(), spin = body.angularVelocity.length();
+      if (speed > TOP_SPEED) body.velocity.scale(TOP_SPEED / speed, body.velocity);
+      if (spin > TOP_SPIN) body.angularVelocity.scale(TOP_SPIN / spin, body.angularVelocity);
+    }
+    // A load whose weight happens to sit over something solid would stay put with the joint under it broken. The shock shakes it apart instead.
+    if (!shaken && time >= SHAKE_AT) {
+      shaken = true;
+      for (const clump of [...clumps]) if (clump.body.position.distanceTo(clump.from) < .08) stuck(clump);
+    }
+    for (const [clump, speed] of hits) if (clumps.has(clump)) split(clump, speed);
+    hits.clear();
+  }
+  let carry = 0, shaken = false;
+  const atRest = () => time > TIME_LIMIT || (time > EARLIEST_REST + .25 && [...clumps].every(c => c.body.sleepState === C.Body.SLEEPING));
+  return {
+    /* Frames that run long slow the fall down rather than piling up steps. */
+    advance(dt) { carry += dt; for (let n = 0; carry >= STEP && n < 3; n++) { tick(); carry -= STEP; } carry = Math.min(carry, STEP); draw(); },
+    finish() { while (!atRest()) tick(); draw(); },
+    get settled() { return atRest(); },
+    get time() { return time; },
+    get clumps() { return clumps.size; }
+  };
+}
diff --git a/assets/js/tower/game.js b/assets/js/tower/game.js
new file mode 100644
index 00000000000..d3caf3798d9
--- /dev/null
+++ b/assets/js/tower/game.js
@@ -0,0 +1,1298 @@
+/* Tower game prototype: free building by real Lego rules on a stud grid.
+   Every brick covers whole stud squares, every height is a whole number of plates, and a brick
+   comes down from above onto the highest thing under it, so it can never slide into a gap.
+   One stud is enough to hold a brick, though a placement that would overload a joint is refused with a warning. The supply is unlimited, and any of ten bricks (keys 1 to 9 and 0) and three looks can be chosen at any time.
+   Reused from the castle: its brick and arch geometry (cut to a flat foundation) and lighting.
+   New: grid and rules, picking by height map, brick picker, looks, how-to-play note, hints with a planned tower, undo, dialog, tests. */
+import {
+  Scene, OrthographicCamera, WebGLRenderer, HemisphereLight, DirectionalLight, Mesh, PlaneGeometry, BoxGeometry, EdgesGeometry,
+  LineSegments, LineBasicMaterial, Group, ShadowMaterial, Vector3, Box3, PCFSoftShadowMap, SRGBColorSpace,
+  ACESFilmicToneMapping, Color, MeshBasicMaterial, Raycaster, Vector2, BackSide, AlwaysStencilFunc, NotEqualStencilFunc, ReplaceStencilOp
+} from 'three';
+import { createFoundation } from './source-copies/lego-foundation.js';
+import { createCollapse } from './collapse.js';
+
+const css = `
+html.tg-lock{overflow:hidden;scrollbar-gutter:stable}
+#tower-game{touch-action:none;width:min(1000px,100vw);max-width:100vw;height:min(800px,100dvh);max-height:100dvh;padding:0;border:0;border-radius:18px;background:#e3efec;color:#262d35;overflow:hidden}
+#tower-game::backdrop{background:rgba(38,45,53,.55)}
+#tower-game .tg-wrap{display:flex;flex-direction:column;height:100%}
+#tower-game .tg-head{display:flex;align-items:center;gap:12px;padding:10px 12px 4px 18px}
+#tower-game h2{font:500 clamp(20px,3vw,26px)/1.1 'Newsreader',Georgia,serif;margin:0;flex:1}
+#tower-game .tg-count{font-weight:600;font-size:16px;white-space:nowrap}
+#tower-game .tg-field{position:relative;flex:1;min-height:0}
+#tower-game .tg-stage{position:absolute;inset:0;touch-action:none;user-select:none;-webkit-user-select:none}
+#tower-game .tg-over{position:absolute;top:6px;display:flex;gap:6px}
+#tower-game .tg-over[hidden]{display:none}
+#tower-game .tg-plan{left:8px}
+#tower-game .tg-again{right:8px}
+#tower-game .tg-stage.tg-keys:focus{outline:3px solid #005a87;outline-offset:-3px}
+#tower-game canvas{position:absolute;inset:0;width:100%;height:100%;display:block;cursor:crosshair}
+#tower-game .tg-tray{display:grid;grid-template-columns:repeat(10,minmax(0,1fr));gap:4px;padding:4px 12px;touch-action:none;user-select:none;-webkit-user-select:none}
+#tower-game button.tg-style{display:flex;flex-direction:column;align-items:center;justify-content:flex-end;gap:0;min-height:58px;min-width:0;padding:3px 1px 4px;border:2px solid transparent;border-radius:10px;background:#f6faf9;font:600 13px/1.1 'Source Sans 3',system-ui,sans-serif;color:#262d35}
+@media(hover:hover){#tower-game button.tg-style:hover{background:#fff;color:#262d35;border-color:#2d5750}}
+#tower-game button.tg-style[aria-pressed=true]{background:#fff;color:#262d35;border-color:#b34e0a;box-shadow:0 0 0 1px #b34e0a}
+#tower-game .tg-style img{width:100%;max-width:62px;height:34px;object-fit:contain;display:block;pointer-events:none;transition:transform .15s}
+#tower-game .tg-style.tg-flip img{transform:scaleX(-1)}
+#tower-game .tg-style small{font-size:12px;font-weight:400;line-height:1}
+#tower-game .tg-style{position:relative}
+#tower-game .tg-style kbd{position:absolute;top:3px;left:5px;font:600 11px/1 'Source Sans 3',system-ui,sans-serif;color:#5a666e}
+@media(hover:none){#tower-game .tg-style kbd{display:none}}
+#tower-game .tg-looks{left:8px;bottom:6px;top:auto;gap:4px}
+#tower-game button.tg-look{display:flex;align-items:center;gap:5px;min-height:44px;padding:4px 10px 4px 7px;border:2px solid transparent;border-radius:10px;background:#f6faf9;font:600 14px/1 'Source Sans 3',system-ui,sans-serif;color:#262d35;cursor:pointer}
+@media(hover:hover){#tower-game button.tg-look:hover{background:#fff;border-color:#2d5750}}
+#tower-game button.tg-look[aria-pressed=true]{background:#fff;border-color:#b34e0a;box-shadow:0 0 0 1px #b34e0a}
+#tower-game .tg-look i{width:16px;height:16px;border-radius:4px;flex:none}
+#tower-game .tg-look[data-look=grey] i{background:#5c6870}
+#tower-game .tg-look[data-look=brick] i{background:#963a27}
+#tower-game .tg-look[data-look=pride] i{background:linear-gradient(#7046a3 0 17%,#2672b8 17% 33%,#2b985b 33% 50%,#e8b52c 50% 67%,#e98434 67% 83%,#ce4742 83%)}
+#tower-game .tg-note{position:absolute;inset:0;display:flex;align-items:center;justify-content:center;padding:8px;background:rgba(38,45,53,.45)}
+#tower-game .tg-note[hidden]{display:none}
+#tower-game .tg-card{display:flex;flex-direction:column;width:min(500px,100%);max-height:100%;padding:14px 18px 12px;border-radius:14px;background:#fff;box-shadow:0 10px 30px rgba(38,45,53,.3)}
+#tower-game .tg-card h3{font:500 22px/1.1 'Newsreader',Georgia,serif;margin:0 0 6px}
+#tower-game .tg-card .tg-steps{min-height:0;overflow:auto;touch-action:pan-y;margin:0 0 10px;padding:0;list-style:none;font-size:15px;line-height:1.3}
+#tower-game .tg-card li{margin:0 0 7px}
+#tower-game .tg-warn-text{margin:0 0 12px;font-size:17px;line-height:1.35}
+#tower-game .tg-warn-row{display:flex;flex-wrap:wrap;justify-content:flex-end;gap:8px}
+#tower-game .tg-turns{display:flex;align-items:center;gap:4px;float:right;margin:0 0 2px 8px;font-size:20px;color:#5a666e}
+#tower-game .tg-turns img{width:58px;height:36px;object-fit:contain;display:block}
+#tower-game .tg-style.tg-suggested::after{content:'';position:absolute;top:4px;right:4px;width:9px;height:9px;border-radius:50%;background:#14808f}
+#tower-game .tg-foot{display:flex;flex-wrap:wrap;align-items:center;gap:6px 8px;padding:4px 12px 12px 18px}
+#tower-game .tg-hint{flex:1 1 240px;margin:0;font-size:15px;line-height:1.3;height:2.6em;overflow:hidden}
+#tower-game .tg-btn{white-space:nowrap;min-height:44px;padding:8px 14px;border:1.5px solid #2d5750;border-radius:999px;background:#fff;color:#262d35;font:600 15px/1.2 'Source Sans 3',system-ui,sans-serif;cursor:pointer}
+#tower-game .tg-close{min-width:44px;padding:8px 12px}
+@media(hover:hover){#tower-game .tg-btn:hover:not(:disabled){background:#2d5750;color:#fff}}
+#tower-game .tg-btn:disabled{opacity:.45;cursor:default}
+#tower-game .tg-btn.tg-main{flex:0 0 5.4em;padding-left:4px;padding-right:4px;background:#b34e0a;border-color:#b34e0a;color:#fff}
+#tower-game .tg-btn.tg-main:disabled{background:#fff;border-color:#2d5750;color:#262d35}
+@media(hover:hover){#tower-game .tg-btn.tg-main:hover:not(:disabled){background:#8f3e07}}
+#tower-game .tg-card .tg-btn.tg-main{align-self:flex-end;flex:none;padding:8px 16px}
+#tower-game .tg-btn[aria-pressed=true],#tower-game .tg-btn[aria-pressed=true]:hover{background:#14808f;border-color:#14808f;color:#fff}
+#tower-game button:focus-visible{outline:3px solid #005a87;outline-offset:2px}
+#tower-game .tg-sr{position:absolute;width:1px;height:1px;overflow:hidden;clip-path:inset(50%);white-space:nowrap}
+@media(max-width:760px){#tower-game .tg-tray{grid-template-columns:repeat(5,minmax(0,1fr));padding:2px 8px}#tower-game .tg-foot{padding:4px 8px 8px}#tower-game .tg-hint{flex-basis:100%}#tower-game .tg-foot .tg-btn:not(.tg-main){padding:8px 11px;flex:1 1 auto}#tower-game .tg-plan{flex-direction:column}#tower-game .tg-over .tg-btn{padding:8px 11px}}
+@media(max-width:600px){#tower-game{border-radius:0;width:100vw;height:100dvh}#tower-game button.tg-style{min-height:52px}#tower-game .tg-style img{height:28px}}
+@media(max-width:360px){#tower-game button.tg-look{padding:4px 7px 4px 5px}#tower-game .tg-foot .tg-btn:not(.tg-main){padding:8px 6px}#tower-game button.tg-style{min-height:44px}#tower-game .tg-style img{height:22px}#tower-game .tg-style small{display:none}#tower-game .tg-hint{font-size:14px}}
+@media(max-height:480px){#tower-game .tg-card{padding:8px 14px}#tower-game .tg-card h3{font-size:18px;margin-bottom:3px}#tower-game .tg-card .tg-steps{font-size:14px;line-height:1.25;margin-bottom:5px}#tower-game .tg-card li{margin-bottom:3px}#tower-game .tg-turns img{height:24px;width:40px}#tower-game .tg-wrap{display:grid;grid-template-columns:1fr 300px;grid-template-rows:auto auto 1fr}
+ #tower-game .tg-head{grid-column:2;grid-row:1;padding:6px 8px 0 4px}#tower-game .tg-field{grid-column:1;grid-row:1/4}#tower-game .tg-plan{flex-direction:column}#tower-game .tg-over .tg-btn{padding:8px 11px}#tower-game .tg-tray{grid-column:2;grid-row:2;grid-template-columns:repeat(5,minmax(0,1fr));padding:2px 8px 2px 4px}
+ #tower-game button.tg-style{min-height:44px}#tower-game .tg-style img{height:20px}#tower-game .tg-style small{display:none}
+ #tower-game .tg-foot{grid-column:2;grid-row:3;align-content:flex-end;padding:2px 8px 8px 4px}#tower-game .tg-foot .tg-btn:not(.tg-main){padding:6px 8px;flex:1 1 auto}#tower-game .tg-hint{flex:1 1 100%;font-size:14px}}
+`;
+
+/* The physics file sits beside this one, and is fetched only by someone who reaches the wobble warning. */
+const scriptUrl = document.currentScript?.src || location.href;
+let physics = null;
+function loadPhysics() {
+  physics ??= new Promise((resolve, reject) => {
+    const tag = document.createElement('script');
+    tag.src = new URL('physics.bundle.js', scriptUrl).href;
+    tag.onload = () => resolve(window.CANNON);
+    tag.onerror = () => { physics = null; reject(new Error('The physics file did not load')); };
+    document.head.appendChild(tag);
+  });
+  return physics;
+}
+
+const clamp = v => Math.max(0, Math.min(1, v));
+const smooth = v => { const p = clamp(v); return p * p * (3 - 2 * p); };
+const reduced = matchMedia('(prefers-reduced-motion: reduce)');
+const coarse = matchMedia('(pointer: coarse)');
+
+/* Grid. Square (i, j) has its stud at x = .15 + .30 i, z = .15 + .30 j. Heights count in plates: a brick is 3, a plate is 1. */
+const PITCH = .30, PLATE = .09;
+const TYPES = {};
+for (const [nz, nx] of [[1, 1], [1, 2], [1, 4], [2, 2], [2, 3], [2, 4]]) TYPES[`b${nz}x${nx}`] = { nx, nz, plates: 3, size: `${nz}×${nx}`, word: 'brick', label: `${nz} by ${nx} brick` };
+for (const [nz, nx] of [[1, 1], [1, 2], [2, 2], [2, 4]]) TYPES[`p${nz}x${nx}`] = { nx, nz, plates: 1, size: `${nz}×${nx}`, word: 'plate', label: `${nz} by ${nx} plate` };
+const TYPE_KEYS = Object.keys(TYPES);
+/* Number keys in the order they sit on the keyboard: 1 is the first brick, 0 the tenth. */
+const keyOf = n => String((n + 1) % 10);
+const LOOKS = { grey: 'Grey', brick: 'Brick', pride: 'Pride' };
+const BRICK_REDS = ['#8e3524', '#963a27', '#833022', '#9c432c', '#8a3828', '#7b2d20', '#984631'];
+const STRIPES = ['#7046a3', '#2672b8', '#2b985b', '#e8b52c', '#e98434', '#ce4742'];
+/* Stripes rise with height, one colour per brick height. Anything set on top of a whole course starts the next colour. */
+const stripeAt = level => STRIPES[Math.ceil(level / 3) % STRIPES.length];
+const NOTHING = -1000;
+/* How much turning force a stud may carry. A game rule tuned by feel, not a measurement of real bricks. */
+const STRAIN_LIMIT = 80;
+/* The top is cells -4 to 3. Bricks may reach four studs past it, up to 16 bricks high. */
+const MIN_CELL = -8, MAX_CELL = 7, MAX_PLATES = 48, MAX_BRICKS = 400;
+/* The tower the hints show: two courses of wall with a window on the front and right, a ring of plates, then a crown. */
+function buildPlan() {
+  const plan = [];
+  const add = (type, i, j, rot, level) => plan.push({ type, i, j, rot, level });
+  // First course: corners, then each wall between them. Front (j 3) and right (i 3) leave a window at -1..0.
+  for (const [i, j] of [[-4, -4], [3, -4], [-4, 3], [3, 3]]) add('b1x1', i, j, 0, 0);
+  add('b1x2', -3, 3, 0, 0); add('b1x2', 1, 3, 0, 0);
+  add('b1x2', 3, -3, 1, 0); add('b1x2', 3, 1, 1, 0);
+  for (const i of [-3, -1, 1]) add('b1x2', i, -4, 0, 0);
+  for (const j of [-3, -1, 1]) add('b1x2', -4, j, 1, 0);
+  // Second course: long bricks bridge the windows.
+  add('b1x2', -4, 3, 0, 3); add('b1x4', -2, 3, 0, 3); add('b1x2', 2, 3, 0, 3);
+  for (const i of [-4, -2, 0, 2]) add('b1x2', i, -4, 0, 3);
+  for (const j of [-3, -1, 1]) add('b1x2', -4, j, 1, 3);
+  add('b1x1', 3, -3, 0, 3); add('b1x4', 3, -2, 1, 3); add('b1x1', 3, 2, 0, 3);
+  // Plates in a pinwheel, overhanging the wall by one stud.
+  for (const i of [-5, -1]) add('p2x4', i, 3, 0, 6);
+  for (const j of [-3, 1]) add('p2x4', 3, j, 1, 6);
+  for (const i of [-3, 1]) add('p2x4', i, -5, 0, 6);
+  for (const j of [-5, -1]) add('p2x4', -5, j, 1, 6);
+  // Crown: corners and the middle of each side.
+  for (const [i, j] of [[-5, 3], [3, 3], [3, -5], [-5, -5], [-1, 3], [3, -1], [-1, -5], [-5, -1]]) add('b2x2', i, j, 0, 7);
+  return plan;
+}
+const footprint = (type, rot) => (rot ? [TYPES[type].nz, TYPES[type].nx] : [TYPES[type].nx, TYPES[type].nz]);
+const isSquare = type => TYPES[type].nx === TYPES[type].nz;
+const cellX = i => .15 + PITCH * i;
+
+let ui, game;
+
+function buildDialog() {
+  const style = document.createElement('style'); style.textContent = css; document.head.appendChild(style);
+  const d = document.createElement('dialog');
+  d.id = 'tower-game'; d.setAttribute('aria-labelledby', 'tg-title');
+  const tray = TYPE_KEYS.map((k, n) => `<button type="button" class="tg-style" data-type="${k}" aria-pressed="false" aria-label="${TYPES[k].label}" aria-keyshortcuts="${keyOf(n)}"><kbd>${keyOf(n)}</kbd><img alt=""><span>${TYPES[k].size}</span><small>${TYPES[k].word}</small></button>`).join('');
+  const looks = Object.entries(LOOKS).map(([k, name]) => `<button type="button" class="tg-look" data-look="${k}" aria-pressed="false"><i></i>${name}</button>`).join('');
+  const tap = coarse.matches ? 'tap' : 'click';
+  const steps = [
+    `<strong>Pick a brick</strong> from the row below${coarse.matches ? '' : ', or press its number: 1 to 9, then 0 for the tenth'}.`,
+    `<strong>Point and ${tap}.</strong> ${coarse.matches ? 'Drag first to see a copy of the brick, edged in orange, where it will land; a plain tap places it at once.' : 'A copy of the brick, edged in orange, shows where it will land.'} One stud is enough to hold a brick, but a red edge means the pile would be too wobbly.`,
+    `<span class="tg-turns" aria-hidden="true"><img id="tg-turn-a" alt="">↻<img id="tg-turn-b" alt=""></span><strong>Rotate${coarse.matches ? '' : ' (or R)'}</strong> turns the brick a quarter turn before you place it. Square bricks stay the same.`,
+    `<strong>View${coarse.matches ? '' : ' (or T)'}</strong> turns the whole tower, so you can reach the far side.`,
+    '<strong>Grey, Brick and Pride</strong> set the look of your next bricks, so you can mix them. Pride colours follow the height.',
+    '<strong>Undo</strong> takes a brick back. <strong>Hints</strong> shows a planned tower, if you would like one.'
+  ].map(t => `<li>${t}</li>`).join('');
+
+  d.innerHTML = `<div class="tg-wrap">
+    <div class="tg-head"><h2 id="tg-title">Build the tower</h2><span class="tg-count" id="tg-count"></span>
+      <button type="button" class="tg-btn tg-close" id="tg-help" aria-label="How to play">?</button>
+      <button type="button" class="tg-btn tg-close" id="tg-close" aria-label="Close the game">✕</button></div>
+    <div class="tg-field"><div class="tg-stage" id="tg-stage" tabindex="0" role="application" aria-label="Building area. Number keys choose a brick, arrow keys move it, R rotates it, T turns the view, Enter places it."><canvas id="tg-canvas" aria-hidden="true"></canvas></div>
+      <div class="tg-over tg-plan" id="tg-plan" hidden><button type="button" class="tg-btn" id="tg-next" title="Places the next brick of the planned tower" aria-label="Place the next brick of the plan">Place next</button>
+      <button type="button" class="tg-btn" id="tg-finish" title="Builds the rest of the planned tower. Undo takes it all back" aria-label="Build the rest of the plan for me">Build rest</button></div>
+      <div class="tg-over tg-again"><button type="button" class="tg-btn" id="tg-restart">Start again</button></div>
+      <div class="tg-over tg-looks" id="tg-looks" role="group" aria-label="Look of your next bricks">${looks}</div></div>
+    <div class="tg-tray" id="tg-tray" role="group" aria-label="Choose a brick">${tray}</div>
+    <div class="tg-foot"><p class="tg-hint" id="tg-hint"></p>
+      <button type="button" class="tg-btn" id="tg-rotate" aria-label="Rotate the brick">Rotate</button>
+      <button type="button" class="tg-btn" id="tg-view" aria-label="Turn the view">View</button>
+      <button type="button" class="tg-btn" id="tg-undo">Undo</button>
+      <button type="button" class="tg-btn" id="tg-hints" aria-pressed="false" aria-label="Show hints">Hints</button>
+      <button type="button" class="tg-btn tg-main" id="tg-done">Done</button></div>
+    <div class="tg-sr" role="status" aria-live="polite" id="tg-live"></div></div>
+    <div class="tg-note" id="tg-note" hidden><div class="tg-card" role="group" aria-labelledby="tg-note-title"><h3 id="tg-note-title">How to play</h3><ul class="tg-steps" id="tg-steps" tabindex="0">${steps}</ul><button type="button" class="tg-btn tg-main" id="tg-note-go">Start building</button></div></div>
+    <div class="tg-note" id="tg-warn" hidden><div class="tg-card" role="alertdialog" aria-modal="true" aria-labelledby="tg-warn-title" aria-describedby="tg-warn-text"><h3 id="tg-warn-title">Careful!</h3><p class="tg-warn-text" id="tg-warn-text">Placing it here would bring FORRT down. We only build on solid foundations.</p><div class="tg-warn-row"><button type="button" class="tg-btn" id="tg-warn-anyway">Place it anyway</button><button type="button" class="tg-btn tg-main" id="tg-warn-go">Move it</button></div></div></div>`;
+  document.body.appendChild(d);
+  const $ = id => d.querySelector('#' + id);
+  return { d, canvas: $('tg-canvas'), stage: $('tg-stage'), tray: $('tg-tray'), count: $('tg-count'), hint: $('tg-hint'), rotate: $('tg-rotate'), view: $('tg-view'), next: $('tg-next'), plan: $('tg-plan'), restart: $('tg-restart'), undo: $('tg-undo'), hints: $('tg-hints'), finish: $('tg-finish'), done: $('tg-done'), close: $('tg-close'), live: $('tg-live'), styles: [...d.querySelectorAll('.tg-style')], looks: [...d.querySelectorAll('.tg-look')], wrap: d.querySelector('.tg-wrap'), note: $('tg-note'), noteGo: $('tg-note-go'), help: $('tg-help'), warn: $('tg-warn'), warnGo: $('tg-warn-go'), warnAnyway: $('tg-warn-anyway') };
+}
+
+function createGame() {
+  const renderer = new WebGLRenderer({ canvas: ui.canvas, antialias: true, alpha: true, stencil: true });
+  renderer.setPixelRatio(Math.min(window.devicePixelRatio || 1, 1.75));
+  renderer.outputColorSpace = SRGBColorSpace;
+  renderer.toneMapping = ACESFilmicToneMapping;
+  renderer.toneMappingExposure = 1.05;
+  renderer.shadowMap.enabled = true;
+  renderer.shadowMap.type = PCFSoftShadowMap;
+  const scene = new Scene();
+  const camera = new OrthographicCamera(-3.7, 3.7, 3, -3, .1, 60);
+  scene.add(new HemisphereLight(0xffffff, 0x8b8379, 1.75));
+  const key = new DirectionalLight(0xfffbf6, 3.5);
+  key.position.set(-3, 11, 6);
+  key.castShadow = true;
+  key.shadow.mapSize.set(2048, 2048);
+  key.shadow.camera.left = -8; key.shadow.camera.right = 8;
+  key.shadow.camera.top = 8; key.shadow.camera.bottom = -8;
+  key.shadow.camera.near = .5; key.shadow.camera.far = 30;
+  key.shadow.normalBias = .035; key.shadow.bias = -.0004; key.shadow.radius = 3; key.shadow.intensity = .6;
+  scene.add(key);
+  const fill = new DirectionalLight(0xf3f7ff, 1.25); fill.position.set(6, 4, -2); scene.add(fill);
+  const rim = new DirectionalLight(0xffffff, 1.2); rim.position.set(-3, 5, -5); scene.add(rim);
+
+  const { model, brickGeometry, stones, foundationTop } = createFoundation();
+  scene.add(model);
+  const overlay = new Group(); scene.add(overlay);
+  const ground = new Mesh(new PlaneGeometry(60, 60), new ShadowMaterial({ opacity: .18 }));
+  ground.rotation.x = -Math.PI / 2; ground.position.y = -.035; ground.receiveShadow = true;
+  scene.add(ground);
+
+  const Y = new Vector3(0, 1, 0);
+  const mesh = part => part.object.children[0];
+  const geometryOf = {}, boxOf = {}, edgesOf = {};
+  for (const k of TYPE_KEYS) {
+    const t = TYPES[k], w = t.nx * PITCH, h = t.plates * PLATE, d = t.nz * PITCH;
+    geometryOf[k] = brickGeometry(w, h, d);
+    boxOf[k] = new BoxGeometry(w - .014, h - .014, d - .014);
+    edgesOf[k] = new EdgesGeometry(boxOf[k]);
+  }
+
+  /* The grid: the height, in plates, of the top surface over each square. */
+  const SIZE = MAX_CELL - MIN_CELL + 1;
+  const at = (i, j) => (i - MIN_CELL) * SIZE + (j - MIN_CELL);
+  const baseTops = new Int16Array(SIZE * SIZE).fill(NOTHING);
+  for (let a = -4; a <= 3; a++) for (let b = -4; b <= 3; b++) baseTops[at(a, b)] = 0;
+  const tops = baseTops.slice();
+  /* The brick whose top is the top of each column; null over the bare foundation. */
+  const topOwner = new Array(SIZE * SIZE).fill(null);
+  /* What fills each column, as [bottom, top] in plates. Bricks can overhang, so a column can have gaps. */
+  const spans = Array.from({ length: SIZE * SIZE }, () => []);
+  const STUD = .048, BODY_GAP = .007;
+  const heightOf = plates => foundationTop + plates * PLATE;
+  const cellsOf = (i, j, nx, nz, visit) => { for (let a = i; a < i + nx; a++) for (let b = j; b < j + nz; b++) visit(at(a, b)); };
+  const inGrid = (i, j, nx, nz) => i >= MIN_CELL && j >= MIN_CELL && i + nx - 1 <= MAX_CELL && j + nz - 1 <= MAX_CELL;
+  /* Lowered from above, a brick stops on the highest thing under it. One stud is enough to hold it, as with real bricks. */
+  function landing(type, i, j, rot) {
+    const [nx, nz] = footprint(type, rot);
+    if (!inGrid(i, j, nx, nz)) return null;
+    let level = NOTHING, studs = 0;
+    cellsOf(i, j, nx, nz, c => { if (tops[c] > level) { level = tops[c]; studs = 1; } else if (tops[c] === level) studs++; });
+    if (level === NOTHING || level + TYPES[type].plates > MAX_PLATES) return null;
+    return { level, studs };
+  }
+  const worldOf = (type, i, j, rot, level) => {
+    const [nx, nz] = footprint(type, rot);
+    return { x: cellX(i + (nx - 1) / 2), z: cellX(j + (nz - 1) / 2), y: heightOf(level) + TYPES[type].plates * PLATE / 2, floor: heightOf(level), rotY: rot ? Math.PI / 2 : 0 };
+  };
+  const makeTarget = (type, i, j, rot, r) => ({ type, i, j, rot, level: r.level, studs: r.studs, ...worldOf(type, i, j, rot, r.level) });
+  /* What holds a brick lowered here: the bricks under it, how many studs each grips, and the patch those studs cover, in cell units. */
+  function holdOf(type, i, j, rot, level) {
+    const [nx, nz] = footprint(type, rot), under = new Map();
+    let studs = 0, sx = 0, sz = 0, x0 = Infinity, x1 = -Infinity, z0 = Infinity, z1 = -Infinity;
+    for (let a = i; a < i + nx; a++) for (let b = j; b < j + nz; b++) {
+      const c = at(a, b);
+      if (tops[c] !== level) continue;
+      const owner = topOwner[c];
+      if (owner) under.set(owner, (under.get(owner) || 0) + 1);
+      studs++; sx += a + .5; sz += b + .5;
+      x0 = Math.min(x0, a); x1 = Math.max(x1, a + 1); z0 = Math.min(z0, b); z1 = Math.max(z1, b + 1);
+    }
+    return { under, studs, x: sx / studs, z: sz / studs, hx: (x1 - x0) / 2, hz: (z1 - z0) / 2, mass: nx * nz * TYPES[type].plates, cx: i + nx / 2, cz: j + nz / 2 };
+  }
+  /* Weight flows down through the studs. Each brick's load is measured by how far its centre lies outside the studs holding it,
+     per stud, and shared among the bricks below by stud count. Bricks only rest on earlier ones, so history reversed is top to bottom. */
+  let worstHold = null;
+  function strainWith(extra) {
+    const carried = new Map();
+    let worst = 0;
+    worstHold = null;
+    const visit = hold => {
+      const on = carried.get(hold), w = hold.mass + (on ? on.w : 0), mx = hold.mass * hold.cx + (on ? on.mx : 0), mz = hold.mass * hold.cz + (on ? on.mz : 0);
+      const off = Math.hypot(Math.max(0, Math.abs(mx / w - hold.x) - hold.hx), Math.max(0, Math.abs(mz / w - hold.z) - hold.hz));
+      const strain = w * off / hold.studs;
+      if (strain > worst) { worst = strain; worstHold = hold; }
+      for (const [below, n] of hold.under) {
+        const share = n / hold.studs, to = carried.get(below.hold) || { w: 0, mx: 0, mz: 0 };
+        to.w += w * share; to.mx += mx * share; to.mz += mz * share;
+        carried.set(below.hold, to);
+      }
+    };
+    if (extra) visit(extra);
+    for (let k = history.length - 1; k >= 0; k--) visit(history[k].hold);
+    return worst;
+  }
+  const tooWobbly = t => strainWith(holdOf(t.type, t.i, t.j, t.rot, t.level)) > STRAIN_LIMIT;
+
+  /* The planned tower. A place opens once the plan bricks below it are in, or can no longer be: a free build may have covered them. */
+  const slots = buildPlan().map(p => ({ ...p, filled: null }));
+  for (const s of slots) {
+    const [nx, nz] = footprint(s.type, s.rot);
+    s.needs = slots.filter(o => {
+      if (o.level >= s.level) return false;
+      const [ox, oz] = footprint(o.type, o.rot);
+      return o.i < s.i + nx && s.i < o.i + ox && o.j < s.j + nz && s.j < o.j + oz;
+    });
+  }
+  const covered = s => { const r = landing(s.type, s.i, s.j, s.rot); return !r || r.level > s.level; };
+  const openSlots = type => slots.filter(s => {
+    if (s.filled || (type && s.type !== type) || !s.needs.every(n => n.filled || covered(n))) return false;
+    const r = landing(s.type, s.i, s.j, s.rot);
+    return r && r.level === s.level && strainWith(holdOf(s.type, s.i, s.j, s.rot, s.level)) <= STRAIN_LIMIT;
+  });
+
+  const bricks = [], history = [];
+  const placedCount = () => bricks.filter(p => p.state === 'placed').length;
+  /* What colour a brick is. Grey and Brick vary a little from brick to brick; Pride follows the height it sits at. */
+  const colourOf = (brickLook, shade, level) => (brickLook === 'pride' ? stripeAt(level) : brickLook === 'brick' ? BRICK_REDS[shade % BRICK_REDS.length] : stones[shade % stones.length].color);
+  function paint(part, level) {
+    part.stone.set(colourOf(part.look, part.shade, level));
+    part.material.color.copy(part.stone);
+  }
+  const nextShade = () => bricks.length * 3 + 1;
+  function spawn(type, look = currentLook) {
+    const object = new Group();
+    const shade = nextShade();
+    const material = stones[shade % stones.length].clone();
+    const m = new Mesh(geometryOf[type], material);
+    m.castShadow = true; m.receiveShadow = true;
+    object.add(m);
+    object.name = TYPES[type].label;
+    model.add(object);
+    const part = { object, type, look, shade, state: 'flying', material, stone: new Color(), pride: new Color(), slot: null, cell: null, rest: new Vector3() };
+    bricks.push(part);
+    return part;
+  }
+  function discard(part) { model.remove(part.object); part.material.dispose(); bricks.splice(bricks.indexOf(part), 1); }
+
+  /* The chosen brick. */
+  let selected = 'b1x2', currentLook = 'grey', rot = 0, view = 0, hintsOn = false, done = false;
+  const selectedRot = () => (isSquare(selected) ? 0 : rot);
+  const ghost = new Group(); ghost.visible = false; overlay.add(ghost);
+  /* The preview is the brick itself, in the colour it will land in, lit the same way. Nearer bricks hide it, so it never seems to sit on them;
+     its rim and edges show through them, so its place can always be seen. */
+  const ghostSkin = stones[0].clone();
+  ghostSkin.transparent = true;
+  const ghostBody = new Mesh(geometryOf[selected], ghostSkin);
+  const ghostLine = new LineSegments(edgesOf[selected], new LineBasicMaterial({ color: '#ff8a1f', transparent: true, depthTest: false, toneMapped: false }));
+  /* A slightly larger box seen from inside draws a rim round the whole brick, a little over two pixels at any zoom. A grey brick on the grey tower needs it.
+     The mask marks the brick's own shape first, so the box paints only the rim and never across the brick or whatever hides it. */
+  const ghostMask = new Mesh(geometryOf[selected], new MeshBasicMaterial({ colorWrite: false, transparent: true, depthWrite: false, depthTest: false, stencilWrite: true, stencilFunc: AlwaysStencilFunc, stencilRef: 1, stencilZPass: ReplaceStencilOp }));
+  const ghostRim = new Mesh(boxOf[selected], new MeshBasicMaterial({ color: '#ff8a1f', side: BackSide, transparent: true, depthWrite: false, depthTest: false, toneMapped: false, stencilWrite: true, stencilFunc: NotEqualStencilFunc, stencilRef: 1 }));
+  ghostMask.renderOrder = 4; ghostRim.renderOrder = 5; ghostBody.renderOrder = 6; ghostLine.renderOrder = 7; ghost.add(ghostMask, ghostRim, ghostBody, ghostLine);
+
+  const hintStrong = new MeshBasicMaterial({ color: '#14808f', transparent: true, opacity: .42, depthWrite: false, depthTest: false });
+  const hintFaint = new MeshBasicMaterial({ color: '#14808f', transparent: true, opacity: .14, depthWrite: false, depthTest: false });
+  const hintLine = new LineBasicMaterial({ color: '#0b5a65', transparent: true, depthTest: false });
+  const hintLineFaint = new LineBasicMaterial({ color: '#0b5a65', transparent: true, opacity: .45, depthTest: false });
+  for (const s of slots) {
+    const w = worldOf(s.type, s.i, s.j, s.rot, s.level);
+    s.hint = new Group();
+    s.hint.position.set(w.x, w.y, w.z); s.hint.rotation.y = w.rotY; s.hint.visible = false;
+    s.body = new Mesh(boxOf[s.type], hintFaint); s.body.renderOrder = 4;
+    s.line = new LineSegments(edgesOf[s.type], hintLineFaint); s.line.renderOrder = 5;
+    s.hint.add(s.body, s.line);
+    overlay.add(s.hint);
+  }
+  function showHints() {
+    const open = hintsOn && !done ? openSlots() : [];
+    for (const s of slots) s.hint.visible = false;
+    for (const s of open) {
+      const mine = s.type === selected;
+      s.hint.visible = true; s.body.material = mine ? hintStrong : hintFaint; s.line.material = mine ? hintLine : hintLineFaint;
+    }
+    for (const b of ui.styles) b.classList.toggle('tg-suggested', open.some(s => s.type === b.dataset.type));
+    dirty = true;
+    return open;
+  }
+
+  /* Framing: the camera stands higher than the hero's so the studs can be seen and aimed at. It widens as the build grows. */
+  const eye = new Vector3(7.4, 10.6, 10.2), look = new Vector3(0, 2.5, 0);
+  const frame = { width: 1, height: 1, scale: 1 };
+  const bounds = { l: -3, r: 3, t: 3, b: -3 };
+  let viewAngle = 0, turning = false;
+  function aimCamera() {
+    camera.position.copy(eye).applyAxisAngle(Y, viewAngle);
+    camera.lookAt(look);
+    camera.updateMatrixWorld(true);
+  }
+  function wantedBounds() {
+    // On short screens the lower wall runs off the bottom, so the part being built on stays large enough to aim at.
+    const floor = frame.height < 480 ? heightOf(0) - .75 : -.035;
+    // The view widens in steps and stays centred on the tower, so most placements do not move anything on screen.
+    let reach = 1.56, room = frame.height < 480 ? 9 : 13;
+    for (const p of history) {
+      const [nx, nz] = footprint(p.type, p.cell.rot);
+      const w = worldOf(p.type, p.cell.i, p.cell.j, p.cell.rot, p.cell.level);
+      reach = Math.max(reach, Math.ceil((Math.max(Math.abs(w.x) + nx * .15, Math.abs(w.z) + nz * .15) + PITCH) / .6) * .6);
+      room = Math.max(room, Math.min(MAX_PLATES, Math.ceil((p.cell.level + TYPES[p.type].plates + 9) / 6) * 6));
+    }
+    const box = new Box3(new Vector3(-reach, floor, -reach), new Vector3(reach, heightOf(room) + .06, reach));
+    const inv = camera.matrixWorldInverse, v = new Vector3();
+    let l = Infinity, r = -Infinity, b = Infinity, t = -Infinity;
+    for (const x of [box.min.x, box.max.x]) for (const y of [box.min.y, box.max.y]) for (const z of [box.min.z, box.max.z]) {
+      v.set(x, y, z).applyMatrix4(inv);
+      l = Math.min(l, v.x); r = Math.max(r, v.x); b = Math.min(b, v.y); t = Math.max(t, v.y);
+    }
+    // Rubble counts only as far as it reaches, so the view widens no more than it must.
+    for (const p of bricks) if (p.state === 'debris') {
+      v.copy(p.object.position).applyMatrix4(inv);
+      l = Math.min(l, v.x - .8); r = Math.max(r, v.x + .8); b = Math.min(b, v.y - .8); t = Math.max(t, v.y + .8);
+    }
+    const margin = 1.03, aspect = frame.width / frame.height;
+    const halfH = Math.max((t - b) / 2, (r - l) / 2 / aspect) * margin, halfW = halfH * aspect;
+    const cx = (l + r) / 2, cy = (t + b) / 2;
+    return { l: cx - halfW, r: cx + halfW, t: cy + halfH, b: cy - halfH };
+  }
+  function applyBounds() {
+    camera.left = bounds.l; camera.right = bounds.r; camera.top = bounds.t; camera.bottom = bounds.b;
+    camera.updateProjectionMatrix();
+    frame.scale = frame.height / (bounds.t - bounds.b);
+    dirty = true;
+  }
+  function fitNow() { Object.assign(bounds, wantedBounds()); applyBounds(); }
+  function resize() {
+    const { width, height: h } = ui.stage.getBoundingClientRect();
+    if (!width || !h) return;
+    renderer.setSize(width, h, false);
+    frame.width = width; frame.height = h;
+    aimCamera(); fitNow();
+  }
+  const project = v => { const p = v.clone().project(camera); return { x: (p.x + 1) / 2 * frame.width, y: (1 - p.y) / 2 * frame.height }; };
+  const toCanvas = e => { const r = ui.canvas.getBoundingClientRect(); return { x: e.clientX - r.left, y: e.clientY - r.top }; };
+  const raycaster = new Raycaster(), ndc = new Vector2();
+  function castRay(point) { raycaster.setFromCamera(ndc.set(point.x / frame.width * 2 - 1, 1 - point.y / frame.height * 2), camera); return raycaster.ray; }
+
+  /* Is this point inside something solid in column (i, j): the foundation, a brick, or the stud on top of either? */
+  function solidAt(i, j, x, y, z) {
+    const c = at(i, j), stud = Math.hypot(x - cellX(i), z - cellX(j)) <= .087;
+    const above = stud ? STUD : -BODY_GAP;
+    if (baseTops[c] === 0 && y <= heightOf(0) + above) return true;
+    for (const [lo, hi] of spans[c]) if (y >= heightOf(lo) && y <= heightOf(hi) + above) return true;
+    return false;
+  }
+  /* The square whose surface the pointer is on: walk along the pointer's line from above until it meets something solid.
+     A gap under an overhang stays a gap, so what shows through it can be pointed at. */
+  function surfaceCell(point) {
+    const { origin: o, direction: d } = castRay(point);
+    const t0 = (heightOf(MAX_PLATES) + .06 - o.y) / d.y, t1 = (heightOf(0) - .12 - o.y) / d.y;
+    for (let t = t0; t <= t1; t += .015) {
+      const x = o.x + d.x * t, z = o.z + d.z * t, i = Math.floor(x / PITCH), j = Math.floor(z / PITCH);
+      if (inGrid(i, j, 1, 1) && solidAt(i, j, x, o.y + d.y * t, z)) return { i, j };
+    }
+    return null;
+  }
+  const SNAP_RADIUS = 34, TOUCH_LIFT = 60, TAP_SLOP = 10, STACK_RADIUS = coarse.matches ? 10 : 6, BOUNCE_MS = 60;
+  /* Clicking again without moving away stacks straight on the brick just placed. Left to the pointer alone, the taller stack
+     would put its side under the pointer, and each brick would land a stud across from the last. */
+  const stillOn = point => lastPlaced && Math.hypot(point.x - lastPlaced.x, point.y - lastPlaced.y) <= STACK_RADIUS;
+  function targetAt(point) {
+    if (stillOn(point)) {
+      const turn = selectedRot(), [nx, nz] = footprint(selected, turn);
+      if (inGrid(lastPlaced.i, lastPlaced.j, nx, nz)) {
+        const r = landing(selected, lastPlaced.i, lastPlaced.j, turn);
+        return r ? makeTarget(selected, lastPlaced.i, lastPlaced.j, turn, r) : null;
+      }
+    }
+    return freeTargetAt(point);
+  }
+  /* The spot for the chosen brick under the pointer. Only distance on screen decides between spots. */
+  function freeTargetAt(point) {
+    const type = selected, turn = selectedRot(), [nx, nz] = footprint(type, turn);
+    const floorOf = (i, j, r) => { const w = worldOf(type, i, j, turn, r.level); return project(new Vector3(w.x, w.floor, w.z)); };
+    let best = null, bestD = Infinity;
+    const consider = (i, j) => {
+      const r = landing(type, i, j, turn);
+      if (!r) return;
+      const s = floorOf(i, j, r), d = Math.hypot(s.x - point.x, s.y - point.y);
+      if (d < bestD) { bestD = d; best = { i, j, r }; }
+    };
+    const hit = surfaceCell(point);
+    if (hit) for (let a = hit.i - nx + 1; a <= hit.i; a++) for (let b = hit.j - nz + 1; b <= hit.j; b++) consider(a, b);
+    if (best) return makeTarget(type, best.i, best.j, turn, best.r);
+    // Pointing at air beside the tower: the nearest spot, so bricks can hang over the edge.
+    for (let i = MIN_CELL; i <= MAX_CELL; i++) for (let j = MIN_CELL; j <= MAX_CELL; j++) consider(i, j);
+    return best && bestD <= SNAP_RADIUS ? makeTarget(type, best.i, best.j, turn, best.r) : null;
+  }
+
+  let dirty = true, running = false, raf = 0, last = 0, drag = null, celebrate = null, aim = null, cursor = null, lastPoint = null, cleared = null, batches = 0, lastPlaced = null, doneAt = -1000;
+  const flights = new Set(), rubbleOut = new Set();
+  let toppling = false, awaitingPhysics = false, collapse = null, collapseWait = 0, cannon = null, lastCollapse = null, reframeIn = 0;
+  const stats = { refused: 0, toppled: 0, misses: 0, drops: 0, undos: 0, lost: 0, frames: 0, rotates: 0, turns: 0, keyboard: 0 };
+
+  const say = text => { ui.live.textContent = text; };
+  const WOBBLY_HINT = 'Too wobbly here: a brick in this spot would bring the tower down.';
+  const defaultHint = () => {
+    const open = hintsOn ? openSlots() : [];
+    if (hintsOn && open.length) return "Teal boxes show the plan's next places. Dark ones fit your brick; dotted bricks fit the rest.";
+    if (hintsOn) return slots.every(s => s.filled) ? 'The planned tower is complete. Keep building if you like.' : 'Your build has covered the rest of the plan, or left it too wobbly. Keep building, or undo to bring it back.';
+    return coarse.matches ? 'Pick a brick, then tap the tower. Drag to aim, and turn bricks with Rotate.' : 'Press 1 to 9 or 0 for a brick, then click the tower. R rotates the brick and T turns the view.';
+  };
+  function refresh() {
+    const n = placedCount();
+    ui.count.textContent = n === 1 ? '1 brick' : `${n} bricks`;
+    ui.done.textContent = done ? 'Build on' : 'Done';
+    ui.done.setAttribute('aria-label', done ? 'Build on' : 'Done building');
+    ui.done.disabled = toppling || (!history.length && !done);
+    ui.undo.disabled = awaitingPhysics || (!history.length && !cleared);
+    ui.restart.disabled = !history.length;
+    ui.plan.hidden = !hintsOn;
+    const open = showHints();
+    ui.next.disabled = ui.finish.disabled = toppling || !open.length;
+    if (!done && !drag && !toppling) ui.hint.textContent = defaultHint();
+    dirty = true;
+  }
+  function select(type) {
+    selected = type;
+    for (const b of ui.styles) b.setAttribute('aria-pressed', String(b.dataset.type === type));
+    ghostBody.geometry = ghostMask.geometry = geometryOf[type]; ghostLine.geometry = edgesOf[type]; ghostRim.geometry = boxOf[type];
+    updateFlips();
+    ui.rotate.disabled = isSquare(type);
+    refresh();
+    updateAim();
+  }
+  function setLook(look) {
+    currentLook = look;
+    for (const b of ui.looks) b.setAttribute('aria-pressed', String(b.dataset.look === look));
+    for (const b of ui.styles) b.querySelector('img').src = pictures[look][b.dataset.type];
+    updateAim();
+  }
+  /* The picture of a turned brick is close to its mirror image, and turning the view swaps which way bricks appear to run. */
+  function updateFlips() { for (const b of ui.styles) b.classList.toggle('tg-flip', !isSquare(b.dataset.type) && (rot + view) % 2 === 1); }
+  function rotateBrick() {
+    if (isSquare(selected)) return;
+    rot = 1 - rot; stats.rotates++; updateFlips(); updateAim();
+    if (!done && !drag) ui.hint.textContent = 'Brick rotated. The pictures below show which way it now runs.';
+    say(rot ? 'Brick rotated.' : 'Brick rotated back.');
+  }
+  function setAim(target) {
+    aim = target;
+    ghost.visible = Boolean(target);
+    const wobbly = Boolean(target) && tooWobbly(target);
+    if (target) {
+      ghost.position.set(target.x, target.y, target.z); ghost.rotation.y = target.rotY;
+      ghostSkin.color.set(wobbly ? '#e01414' : colourOf(currentLook, nextShade(), target.level));
+      ghostSkin.opacity = wobbly ? .6 : 1;
+      const edge = wobbly ? '#e01414' : '#ff8a1f', t = TYPES[target.type], rim = 2.5 / frame.scale * 2, solid = n => n - .014;
+      ghostLine.material.color.set(edge); ghostRim.material.color.set(edge);
+      ghostRim.scale.set((solid(t.nx * PITCH) + rim) / solid(t.nx * PITCH), (solid(t.plates * PLATE) + rim) / solid(t.plates * PLATE), (solid(t.nz * PITCH) + rim) / solid(t.nz * PITCH));
+    }
+    ui.canvas.style.cursor = wobbly ? 'not-allowed' : '';
+    if (wobbly) ui.hint.textContent = WOBBLY_HINT;
+    else if (ui.hint.textContent === WOBBLY_HINT) ui.hint.textContent = defaultHint();
+    dirty = true;
+  }
+  function updateAim() {
+    if (done || toppling) setAim(null);
+    else if (drag && drag.point) setAim(targetAt(drag.point));
+    else if (cursor) keyAim();
+    else if (lastPoint) setAim(targetAt(lastPoint));
+  }
+
+  function commit(part, target) {
+    const [nx, nz] = footprint(part.type, target.rot);
+    part.cell = { i: target.i, j: target.j, rot: target.rot, level: target.level };
+    part.hold = holdOf(part.type, target.i, target.j, target.rot, target.level);
+    part.rest.set(target.x, target.y, target.z);
+    part.object.quaternion.setFromAxisAngle(Y, target.rotY);
+    paint(part, target.level);
+    const slot = slots.find(s => !s.filled && s.type === part.type && s.i === target.i && s.j === target.j && s.rot === target.rot && s.level === target.level) || null;
+    part.slot = slot;
+    if (slot) slot.filled = part;
+    cellsOf(target.i, target.j, nx, nz, c => { tops[c] = target.level + TYPES[part.type].plates; topOwner[c] = part; spans[c].push([target.level, tops[c]]); });
+    history.push(part);
+  }
+  function land(part) {
+    part.state = 'placed';
+    part.object.position.copy(part.rest);
+    say(`${TYPES[part.type].label} placed. ${placedCount()} in all.`);
+    refresh();
+    if (part.finishing && !flights.size) finishRun();
+    if (part.topples) { part.topples = false; startCollapse(); }
+  }
+  /* Every brick comes straight down, the only way it can reach its place. */
+  function drop(part, delay = 0) {
+    const d = reduced.matches ? 0 : .24, high = part.rest.y + .7;
+    part.object.position.set(part.rest.x, high, part.rest.z);
+    if (delay > 0 && !reduced.matches) part.object.visible = false;
+    if (!d) { land(part); return; }
+    flights.add({ part, t: -delay, d, high });
+    dirty = true;
+  }
+  function placeBrick(target, anyway = false) {
+    if (toppling) return null;
+    if (bricks.length >= MAX_BRICKS) { ui.hint.textContent = `That is ${MAX_BRICKS} bricks, the most this version allows.`; return null; }
+    if (!anyway && tooWobbly(target)) { showWarning(target); return null; }
+    if (done) leaveDone();
+    cleared = null;
+    clearRubble();
+    const part = spawn(target.type);
+    part.batch = ++batches;
+    commit(part, target);
+    drop(part);
+    refresh();
+    return part;
+  }
+  /* The warning holds the game back until it is dismissed, then puts focus and the keyboard cursor back where they were. */
+  let warnCursor = null, warnTarget = null;
+  function showWarning(target) {
+    stats.refused++;
+    warnTarget = target;
+    loadPhysics().catch(() => {});
+    warnCursor = cursor && document.activeElement === ui.stage ? { ...cursor } : null;
+    lastPoint = null;
+    setAim(null);
+    ui.warn.hidden = false; ui.wrap.inert = true;
+    ui.warnGo.focus({ preventScroll: true });
+  }
+  function hideWarning() {
+    ui.warn.hidden = true; ui.wrap.inert = false;
+    if (warnCursor) { ui.stage.focus({ preventScroll: true }); ui.stage.classList.add('tg-keys'); cursor = warnCursor; warnCursor = null; keyAim(); }
+    else ui.styles.find(b => b.getAttribute('aria-pressed') === 'true').focus({ preventScroll: true });
+  }
+  /* Place it anyway: the brick lands, the overloaded joint gives way, and what it held falls. Undo puts everything back as it was. */
+  async function placeAnyway() {
+    const target = warnTarget;
+    hideWarning();
+    toppling = awaitingPhysics = true;
+    refresh();
+    // Undo waits for the file too, or it would change the tower under the waiting brick.
+    try { cannon = await loadPhysics(); } catch { toppling = awaitingPhysics = false; refresh(); ui.hint.textContent = 'The physics file did not load, so nothing was placed.'; return; }
+    awaitingPhysics = false;
+    if (!toppling) { refresh(); return; }
+    const before = snapshot();
+    toppling = false;
+    const part = placeBrick(target, true);
+    toppling = true;
+    cleared = before;
+    cleared.wipe = true;
+    part.topples = true;
+    ui.hint.textContent = 'Here goes…';
+    refresh();
+    if (part.state === 'placed' && part.topples) { part.topples = false; startCollapse(); }
+  }
+  const snapshot = () => history.map(p => ({ type: p.type, cell: p.cell, batch: p.batch, look: p.look, shade: p.shade }));
+  /* Which bricks fall: the one with the worst load, then everything above it, even what also rests elsewhere: left standing, that would hold the load up.
+     If what stays is still overloaded, it goes round again. */
+  function failingBricks() {
+    const fallen = [], grips = [], leans = [];
+    for (let round = 0; round < 60 && strainWith() > STRAIN_LIMIT; round++) {
+      const first = history.find(p => p.hold === worstHold), gone = new Set([first]);
+      leans.push({ part: first, x: PITCH * first.hold.x, z: PITCH * first.hold.z });
+      for (const p of history) {
+        if (p !== first && [...p.hold.under.keys()].some(q => gone.has(q))) gone.add(p);
+      }
+      for (const p of gone) if (p !== first) for (const [q, studs] of p.hold.under) if (gone.has(q)) grips.push({ a: p, b: q, studs });
+      for (let k = history.length - 1; k >= 0; k--) if (gone.has(history[k])) history.splice(k, 1);
+      for (const p of gone) { if (p.slot) p.slot.filled = null; p.slot = null; p.state = 'debris'; fallen.push(p); }
+      rebuildGrid();
+    }
+    return { fallen, grips, leans };
+  }
+  const boxOfPart = p => {
+    const [nx, nz] = footprint(p.type, p.cell.rot), w = worldOf(p.type, p.cell.i, p.cell.j, p.cell.rot, p.cell.level);
+    return { x: w.x, y: w.y, z: w.z, hx: nx * PITCH / 2 - .002, hy: TYPES[p.type].plates * PLATE / 2 - .002, hz: nz * PITCH / 2 - .002, rotY: w.rotY };
+  };
+  /* The foundation as the physics sees it: four walls with their doorways, a deck, and a hollow inside. */
+  function foundationBoxes() {
+    const top = foundationTop, low = -.035, E = 1.2, T = .3, mid = (a, b) => (a + b) / 2;
+    const span = (x0, x1, y0, y1, z0, z1) => ({ x: mid(x0, x1), y: mid(y0, y1), z: mid(z0, z1), hx: (x1 - x0) / 2, hy: (y1 - y0) / 2, hz: (z1 - z0) / 2 });
+    const front = .45, frontTop = .96 + .45 - .187, right = .36, rightTop = .81 + .36 - .187;
+    return [
+      span(-E, E, low, top, -E, -E + T), span(-E, -E + T, low, top, -E + T, E - T),
+      span(-E, -front, low, top, E - T, E), span(front, E, low, top, E - T, E), span(-front, front, frontTop, top, E - T, E),
+      span(E - T, E, low, top, -E + T, -right), span(E - T, E, low, top, right, E - T), span(E - T, E, rightTop, top, -right, right),
+      span(-E + T, E - T, top - PLATE, top, -E + T, E - T)
+    ];
+  }
+  function startCollapse() {
+    lastPlaced = null;
+    const { fallen, grips, leans } = failingBricks();
+    const index = new Map(fallen.map((p, k) => [p, k]));
+    const pieces = fallen.map(p => ({ object: p.object, ...boxOfPart(p) }));
+    collapse = createCollapse(cannon, {
+      pieces, shell: foundationBoxes(), standing: history.map(boxOfPart), groundY: -.035,
+      grips: grips.map(g => ({ a: index.get(g.a), b: index.get(g.b), studs: g.studs })),
+      leans: leans.map(l => ({ piece: index.get(l.part), x: l.x, z: l.z }))
+    });
+    stats.toppled++;
+    lastCollapse = { fell: fallen.length, stayed: history.length, clumpsAtStart: collapse.clumps };
+    collapseWait = reduced.matches ? 0 : .14;
+    if (reduced.matches) { collapse.finish(); endCollapse(); }
+    dirty = true;
+  }
+  function endCollapse() {
+    const n = lastCollapse.fell;
+    lastCollapse.seconds = +collapse.time.toFixed(2); lastCollapse.clumpsAtEnd = collapse.clumps;
+    collapse = null; toppling = false;
+    refit();
+    refresh();
+    updateAim();
+    const text = `Down it came: ${n === 1 ? '1 brick' : `${n} bricks`} fell. Undo puts ${n === 1 ? 'it' : 'them'} back, and your next brick clears the rubble.`;
+    ui.hint.textContent = text;
+    say(text);
+  }
+  function clearRubble() {
+    for (const p of bricks) if (p.state === 'debris') {
+      p.state = 'gone';
+      rubbleOut.add({ part: p, t: reduced.matches ? 1 : 0 });
+    }
+    dirty = true;
+  }
+  function planTarget(s) { return makeTarget(s.type, s.i, s.j, s.rot, landing(s.type, s.i, s.j, s.rot)); }
+  function placeNext() {
+    if (toppling) return;
+    if (done) leaveDone();
+    const s = openSlots().sort((a, b) => a.level - b.level)[0];
+    if (s) { placeBrick(planTarget(s)); stats.drops++; }
+    refresh();
+  }
+  function finishAll() {
+    if (toppling) return;
+    if (done) leaveDone();
+    clearRubble();
+    let delay = 0, part = null;
+    cleared = null; batches++;
+    for (let s = openSlots().sort((a, b) => a.level - b.level)[0]; s; s = openSlots().sort((a, b) => a.level - b.level)[0]) {
+      part = spawn(s.type);
+      part.batch = batches;
+      commit(part, planTarget(s));
+      drop(part, delay);
+      delay += .07;
+    }
+    if (part) { part.finishing = true; if (!flights.size) finishRun(); }
+    refresh();
+  }
+  function rebuildGrid() {
+    tops.set(baseTops);
+    topOwner.fill(null);
+    for (const list of spans) list.length = 0;
+    for (const p of history) { const [nx, nz] = footprint(p.type, p.cell.rot); p.hold = holdOf(p.type, p.cell.i, p.cell.j, p.cell.rot, p.cell.level); cellsOf(p.cell.i, p.cell.j, nx, nz, c => { tops[c] = p.cell.level + TYPES[p.type].plates; topOwner[c] = p; spans[c].push([p.cell.level, tops[c]]); }); }
+  }
+  function refit() { framing = { from: { ...bounds }, to: wantedBounds(), t: 0 }; dirty = true; }
+  let framing = null;
+  function leaveDone() { lastPlaced = null; done = false; celebrate = null; model.rotation.y = 0; paintStone(); }
+  /* Undo takes back the last action: one brick, everything Build rest added, or Start again. */
+  function undo() {
+    if (drag || awaitingPhysics) return;
+    lastPlaced = null;
+    if (cleared?.wipe) wipe();
+    if (cleared) { restore(); return; }
+    if (!history.length) return;
+    if (done) leaveDone();
+    const batch = history[history.length - 1].batch;
+    while (history.length && history[history.length - 1].batch === batch) {
+      const part = history.pop();
+      for (const f of flights) if (f.part === part) flights.delete(f);
+      if (part.slot) part.slot.filled = null;
+      discard(part);
+    }
+    stats.undos++;
+    rebuildGrid();
+    refit();
+    say(`Undone. ${placedCount()} left.`);
+    refresh();
+    updateAim();
+  }
+  /* Everything off the board, with no record kept: the way back to how things stood before a collapse. */
+  function wipe() {
+    collapse = null; toppling = false; celebrate = null; done = false; model.rotation.y = 0; flights.clear(); rubbleOut.clear(); history.length = 0;
+    for (const s of slots) s.filled = null;
+    for (const p of [...bricks]) discard(p);
+    rebuildGrid();
+  }
+  function restore() {
+    for (const { type, cell, batch, look, shade } of cleared) {
+      const part = spawn(type, look);
+      part.shade = shade ?? part.shade;
+      part.batch = batch;
+      commit(part, makeTarget(type, cell.i, cell.j, cell.rot, { level: cell.level, studs: 0 }));
+      land(part);
+    }
+    cleared = null;
+    stats.undos++;
+    refit();
+    say(`Build restored. ${placedCount()} bricks.`);
+    refresh();
+  }
+  function restart() {
+    lastPlaced = null;
+    const keep = cleared?.wipe ? cleared : history.length ? snapshot() : null;
+    collapse = null; toppling = false; rubbleOut.clear();
+    cleared = keep;
+    celebrate = null; done = false; flights.clear(); model.rotation.y = 0; history.length = 0; rot = 0; updateFlips();
+    for (const s of slots) s.filled = null;
+    for (const p of [...bricks]) discard(p);
+    rebuildGrid();
+    refit();
+    say('All bricks cleared. Undo brings them back.');
+    refresh();
+    if (cleared) ui.hint.textContent = 'All bricks cleared. Undo brings them back.';
+    ui.styles.find(b => b.dataset.type === selected).focus();
+  }
+  function paintStone() { for (const p of bricks) p.material.color.copy(p.stone); dirty = true; }
+  function finishRun() {
+    done = true;
+    setAim(null);
+    const plan = slots.every(s => s.filled) && history.every(p => p.slot);
+    const n = history.length;
+    ui.hint.textContent = plan ? 'Tower built to the plan.' : `Your tower is finished: ${n} ${n === 1 ? 'brick' : 'bricks'}. Build on, or start again.`;
+    say(ui.hint.textContent);
+    // Pride stripes up the tower, as on the homepage: grey bricks take the colour of their height. Bricks given a look keep it.
+    const levels = history.map(p => p.cell.level);
+    for (const p of history) { if (p.look === 'grey') p.pride.set(stripeAt(p.cell.level)); else p.pride.copy(p.stone); }
+    refresh();
+    if (reduced.matches) { for (const p of bricks) p.material.color.copy(p.pride); dirty = true; return; }
+    celebrate = { t: 0, top: Math.max(1, ...levels) };
+  }
+
+  /* Pointing. A mouse shows where the brick would go before pressing. On touch, a tap places under the finger;
+     a drag lifts the outline above the finger so it stays in sight. Bricks can also be dragged from the picker. */
+  function pointFor(e) {
+    const point = toCanvas(e);
+    if (e.pointerType === 'touch' && drag) {
+      const moved = Math.hypot(point.x - drag.down.x, point.y - drag.down.y);
+      if (moved >= TAP_SLOP) drag.lift = Math.max(drag.lift, Math.min(TOUCH_LIFT, moved * 1.5));
+      point.y -= drag.lift;
+    }
+    return point;
+  }
+  const insideCanvas = p => p.x >= 0 && p.y >= 0 && p.x <= frame.width && p.y <= frame.height;
+  function onDown(e) {
+    // A finished tower is only looked at: Build on goes back to building.
+    if (drag || !running || done || toppling || (e.pointerType === 'mouse' && e.button !== 0)) return;
+    const point = toCanvas(e);
+    e.preventDefault();
+    if (!stillOn(point)) lastPlaced = null;
+    ui.stage.classList.remove('tg-keys');
+    cursor = null;
+    ui.canvas.setPointerCapture(e.pointerId);
+    drag = { id: e.pointerId, down: point, lift: 0, point };
+    setAim(targetAt(point));
+  }
+  function onTrayDown(e) {
+    const b = e.target.closest('.tg-style');
+    if (!b || drag || !running) return;
+    select(b.dataset.type);
+    b.releasePointerCapture?.(e.pointerId);
+    drag = { id: e.pointerId, down: toCanvas(e), lift: e.pointerType === 'touch' ? TOUCH_LIFT : 0, fromTray: true, point: null };
+    cursor = null;
+  }
+  function onMove(e) {
+    if (drag && e.pointerId === drag.id) {
+      const point = pointFor(e);
+      drag.point = insideCanvas(point) ? point : null;
+      if (drag.point && !stillOn(drag.point)) lastPlaced = null;
+      setAim(drag.point && !toppling ? targetAt(drag.point) : null);
+    } else if (!drag && e.pointerType === 'mouse' && running && e.target === ui.canvas) {
+      lastPoint = toCanvas(e); cursor = null;
+      if (!stillOn(lastPoint)) lastPlaced = null;
+      setAim(done || toppling ? null : targetAt(lastPoint));
+    }
+  }
+  function onUp(e) {
+    if (!drag || e.pointerId !== drag.id) return;
+    const { fromTray, point } = drag, cancelled = e.type !== 'pointerup';
+    const release = !cancelled && point && drag.point;
+    drag = null;
+    // A short press on the picker only chooses the brick.
+    if (release && !done && !toppling) {
+      const target = targetAt(point), now = performance.now();
+      // Faster than anyone clicks on purpose, this is a switch bouncing or a finger landing twice.
+      const repeat = lastPlaced && now - lastPlaced.t < BOUNCE_MS && stillOn(point);
+      if (target && !repeat && placeBrick(target)) { stats.drops++; lastPlaced = { t: now, x: point.x, y: point.y, i: target.i, j: target.j }; }
+      else if (!target && !fromTray && !repeat) { stats.misses++; ui.hint.textContent = surfaceCell(point) ? 'That stack has reached the height limit.' : 'No studs there. Point at the top of the tower.'; }
+    }
+    if (e.pointerType === 'mouse' && lastPoint && !cancelled && !done && !toppling) { setAim(targetAt(toCanvas(e))); } else setAim(null);
+    lastPoint = e.pointerType === 'mouse' ? lastPoint : null;
+  }
+  let keyTabbing = false;
+  /* Keyboard: a cursor moves over the squares, as a pointer would, and Enter places the brick. */
+  function keyAim() {
+    const [nx, nz] = footprint(selected, selectedRot());
+    cursor.i = Math.min(cursor.i, MAX_CELL - nx + 1); cursor.j = Math.min(cursor.j, MAX_CELL - nz + 1);
+    const r = landing(selected, cursor.i, cursor.j, selectedRot());
+    setAim(r && !toppling ? makeTarget(selected, cursor.i, cursor.j, selectedRot(), r) : null);
+    return r;
+  }
+  function onKey(e) {
+    const k = e.key.toLowerCase();
+    if (e.ctrlKey || e.metaKey || e.altKey || !ui.note.hidden || !ui.warn.hidden) return;
+    // By physical key, because some keyboards need Shift for digits.
+    const digit = /^(?:Digit|Numpad)(\d)$/.exec(e.code)?.[1] ?? (/^\d$/.test(k) ? k : null);
+    if (digit !== null) { const type = TYPE_KEYS[(+digit + 9) % 10]; select(type); say(`${TYPES[type].label} chosen.`); return; }
+    if (k === 'r') { rotateBrick(); return; }
+    if (k === 't') { turnView(); return; }
+    if (k === 'tab') keyTabbing = true;
+    if (e.target !== ui.stage) return;
+    const steps = { arrowleft: [-1, 0], arrowright: [1, 0], arrowup: [0, -1], arrowdown: [0, 1] }[k];
+    if (steps) {
+      e.preventDefault();
+      if (!cursor) cursor = { i: 0, j: 0 };
+      else {
+        let [di, dj] = steps;
+        for (let v = 0; v < view; v++) [di, dj] = [dj, -di];
+        const [nx, nz] = footprint(selected, selectedRot());
+        cursor.i = Math.max(MIN_CELL, Math.min(MAX_CELL - nx + 1, cursor.i + di));
+        cursor.j = Math.max(MIN_CELL, Math.min(MAX_CELL - nz + 1, cursor.j + dj));
+      }
+      const r = keyAim();
+      say(r ? `Column ${cursor.i + 5}, row ${cursor.j + 5}, height ${r.level}, held by ${r.studs} ${r.studs === 1 ? 'stud' : 'studs'}${aim && tooWobbly(aim) ? ', too wobbly' : ''}.` : `Column ${cursor.i + 5}, row ${cursor.j + 5}: nothing to build on.`);
+    } else if ((k === 'enter' || k === ' ') && cursor && !done && !toppling) {
+      e.preventDefault();
+      const r = keyAim();
+      if (r) { if (placeBrick(makeTarget(selected, cursor.i, cursor.j, selectedRot(), r))) { stats.keyboard++; stats.drops++; keyAim(); } }
+      else say('Nothing to build on here.');
+    }
+  }
+  function turnView() {
+    if (turning) return;
+    lastPlaced = null;
+    view = (view + 1) % 4; stats.turns++;
+    turning = { from: viewAngle, to: viewAngle + Math.PI / 2, t: 0 };
+    updateFlips();
+    setAim(null);
+    say(`View turned, side ${view + 1} of 4.`);
+    if (reduced.matches) { turning.t = 1; endTurn(); }
+    dirty = true;
+  }
+  function endTurn() {
+    viewAngle = turning.to % (Math.PI * 2); turning = false;
+    aimCamera(); fitNow(); updateAim();
+  }
+
+  ui.canvas.addEventListener('pointerdown', onDown);
+  ui.tray.addEventListener('pointerdown', onTrayDown);
+  ui.d.addEventListener('pointermove', onMove);
+  ui.d.addEventListener('pointerup', onUp);
+  ui.d.addEventListener('pointercancel', onUp);
+  ui.d.addEventListener('keydown', onKey);
+  ui.canvas.addEventListener('pointerleave', () => { if (!drag) { lastPoint = null; setAim(null); } });
+  ui.stage.addEventListener('focus', () => { ui.stage.classList.toggle('tg-keys', keyTabbing); keyTabbing = false; });
+  ui.stage.addEventListener('blur', () => { if (cursor) { cursor = null; setAim(null); } });
+  ui.tray.addEventListener('click', e => { const b = e.target.closest('.tg-style'); if (b) { select(b.dataset.type); say(`${TYPES[b.dataset.type].label} chosen.`); } });
+  ui.d.querySelector('#tg-looks').addEventListener('click', e => {
+    const b = e.target.closest('.tg-look');
+    if (!b) return;
+    setLook(b.dataset.look);
+    const text = { grey: 'New bricks will be grey. Done gives grey bricks their pride stripes.', brick: 'New bricks will be red brick. Bricks already placed keep their look.', pride: 'New bricks take a pride colour from their height, so stripes rise as you build.' }[b.dataset.look];
+    if (!done && !drag) ui.hint.textContent = text;
+    say(text);
+  });
+  ui.warnGo.addEventListener('click', hideWarning);
+  ui.warnAnyway.addEventListener('click', placeAnyway);
+  // Holding Enter must not dismiss the warning and set it off again.
+  ui.warn.addEventListener('keydown', e => { if (e.repeat) e.preventDefault(); });
+  ui.rotate.addEventListener('click', rotateBrick);
+  ui.view.addEventListener('click', turnView);
+  ui.undo.addEventListener('click', undo);
+  ui.next.addEventListener('click', placeNext);
+  ui.finish.addEventListener('click', finishAll);
+  ui.restart.addEventListener('click', restart);
+  ui.done.addEventListener('click', () => {
+    // Done and Build on share a button, so a double press must not count twice.
+    if (performance.now() - doneAt < 400) return;
+    doneAt = performance.now();
+    if (done) { leaveDone(); refresh(); updateAim(); } else if (history.length) finishRun();
+  });
+  ui.hints.addEventListener('click', () => {
+    hintsOn = !hintsOn;
+    ui.hints.setAttribute('aria-pressed', String(hintsOn));
+    refresh();
+    updateAim();
+    say(hintsOn ? `Hints on. ${openSlots().length} places outlined.` : 'Hints off.');
+  });
+
+  let lost = false;
+  ui.canvas.addEventListener('webglcontextlost', e => { e.preventDefault(); lost = true; ui.hint.textContent = 'The browser reset its graphics. Waiting for it to come back.'; stats.lost++; });
+  ui.canvas.addEventListener('webglcontextrestored', () => { lost = false; resize(); refresh(); });
+
+  function tick(ms) {
+    raf = 0;
+    if (!running) return;
+    const dt = Math.min(.05, last ? (ms - last) / 1000 : 0); last = ms;
+    const landed = [];
+    for (const f of [...flights]) {
+      f.t += dt;
+      if (f.t < 0) continue;
+      f.part.object.visible = true;
+      const p = clamp(f.t / f.d), q = p * p;
+      f.part.object.position.y = f.high + (f.part.rest.y - f.high) * q;
+      dirty = true;
+      if (p === 1) { flights.delete(f); landed.push(f.part); }
+    }
+    for (const part of landed) { land(part); if (!framing) refit(); }
+    if (collapse) {
+      collapseWait -= dt;
+      if (collapseWait <= 0) collapse.advance(dt);
+      dirty = true;
+      // The view widens if the rubble reaches past it.
+      reframeIn -= dt;
+      if (reframeIn <= 0 && !framing) { reframeIn = .25; const want = wantedBounds(); if (want.t - want.b > bounds.t - bounds.b + .01) refit(); }
+      if (collapse.settled) endCollapse();
+    }
+    for (const out of [...rubbleOut]) {
+      out.t += dt / .25;
+      const s = 1 - clamp(out.t);
+      out.part.object.scale.setScalar(Math.max(.001, s));
+      dirty = true;
+      if (out.t >= 1) { rubbleOut.delete(out); discard(out.part); if (!framing) refit(); }
+    }
+    if (framing) {
+      framing.t += dt / .28;
+      const q = reduced.matches ? 1 : smooth(framing.t);
+      for (const k of 'lrtb') bounds[k] = framing.from[k] + (framing.to[k] - framing.from[k]) * q;
+      applyBounds();
+      if (framing.t >= 1 || reduced.matches) { framing = null; updateAim(); }
+    }
+    if (turning) {
+      turning.t += dt / .42;
+      viewAngle = turning.from + (turning.to - turning.from) * smooth(turning.t);
+      aimCamera(); fitNow();
+      if (turning.t >= 1) endTurn();
+    }
+    if (celebrate) {
+      celebrate.t += dt;
+      const phase = clamp(celebrate.t / 3);
+      for (const p of history) p.material.color.lerpColors(p.stone, p.pride, smooth((phase - clamp(p.cell.level / celebrate.top) * .6) / .4));
+      model.rotation.y = celebrate.t > 3 ? smooth((celebrate.t - 3) / 3) * Math.PI * 2 : 0;
+      if (celebrate.t > 6) { celebrate = null; model.rotation.y = 0; }
+      dirty = true;
+    }
+    if (dirty && !lost) { renderer.render(scene, camera); stats.frames++; dirty = false; }
+    raf = requestAnimationFrame(tick);
+  }
+  const start = () => { if (running) return; running = true; last = 0; dirty = true; raf = requestAnimationFrame(tick); };
+  const stop = () => { running = false; cancelAnimationFrame(raf); raf = 0; if (drag) onUp({ pointerId: drag.id, type: 'pointercancel' }); if (!ui.warn.hidden) { warnCursor = null; hideWarning(); } setAim(null); };
+
+  /* Pictures for the picker, drawn once in each look with the game's own bricks and lights. */
+  const pictures = { grey: {}, brick: {}, pride: {} };
+  function drawPicker() {
+    const s = new Scene();
+    s.add(new HemisphereLight(0xffffff, 0x8b8379, 2.1));
+    const light = new DirectionalLight(0xfffbf6, 3.2); light.position.set(-3, 11, 6); s.add(light);
+    const c = new OrthographicCamera(-.82, .82, .5, -.5, .1, 20);
+    c.position.set(3.7, 4.4, 5.1); c.lookAt(0, 0, 0);
+    const m = new Mesh(geometryOf.b1x1, stones[4]);
+    s.add(m);
+    renderer.setSize(164, 100, false);
+    const red = stones[4].clone(); red.color.set(BRICK_REDS[0]);
+    const pale = stones[4].clone(); pale.color.set('#d5dadc');
+    // Pride pictures are washed with all six stripes, because the colour a brick gets depends on where it lands.
+    const wash = document.createElement('canvas'); wash.width = 164; wash.height = 100;
+    const x = wash.getContext('2d'), bands = x.createLinearGradient(30, 0, 134, 0);
+    STRIPES.forEach((c, n) => { bands.addColorStop(n / 6, c); bands.addColorStop((n + 1) / 6, c); });
+    for (const k of TYPE_KEYS) {
+      m.geometry = geometryOf[k];
+      m.material = stones[4]; renderer.render(s, c); pictures.grey[k] = ui.canvas.toDataURL();
+      m.material = red; renderer.render(s, c); pictures.brick[k] = ui.canvas.toDataURL();
+      m.material = pale; renderer.render(s, c);
+      x.globalCompositeOperation = 'source-over'; x.clearRect(0, 0, 164, 100); x.drawImage(ui.canvas, 0, 0);
+      x.globalCompositeOperation = 'multiply'; x.fillStyle = bands; x.fillRect(0, 0, 164, 100);
+      x.globalCompositeOperation = 'destination-in'; x.drawImage(ui.canvas, 0, 0);
+      pictures.pride[k] = wash.toDataURL();
+    }
+    // The same long brick both ways round, for the how-to-play note.
+    m.geometry = geometryOf.b1x4; m.material = stones[4];
+    renderer.render(s, c); ui.d.querySelector('#tg-turn-a').src = ui.canvas.toDataURL();
+    m.rotation.y = Math.PI / 2; renderer.render(s, c); ui.d.querySelector('#tg-turn-b').src = ui.canvas.toDataURL();
+  }
+
+  drawPicker();
+  aimCamera();
+  resize();
+  new ResizeObserver(() => { resize(); if (running) renderer.render(scene, camera); }).observe(ui.stage);
+  setLook(currentLook);
+  select(selected);
+
+  return { hideWarning, strainWith, holdOf, tooWobbly, STRAIN_LIMIT, ghostSkin, ghostLine, ghostBody, colourOf, start, stop, resize, renderer, stats, bricks, slots, camera, scene, model, ghost, overlay, project, placedCount, frame, openSlots, landing, targetAt, freeTargetAt, surfaceCell, history, flights, commit, land, spawn, restart, undo, select, rotateBrick, turnView, placeBrick, makeTarget, castRay, raycaster, get drag() { return drag; }, get aim() { return aim; }, get cursor() { return cursor; }, get busy() { return Boolean(flights.size || framing || turning || toppling); }, get toppling() { return toppling; }, get collapse() { return collapse; }, get lastCollapse() { return lastCollapse; }, get worstHold() { return worstHold; }, get selected() { return selected; }, get look() { return currentLook; }, get view() { return view; }, get hintsOn() { return hintsOn; }, get done() { return done; }, get rot() { return selectedRot(); }, MIN_CELL, MAX_CELL, MAX_PLATES, mesh, foundationTop, TYPES, TYPE_KEYS, footprint, heightOf };
+}
+
+/* The how-to-play note: shown the first time the game opens, and again from the ? button. */
+let noteSeen = false;
+function showNote() {
+  ui.note.hidden = false; ui.wrap.inert = true;
+  ui.noteGo.focus({ preventScroll: true });
+}
+function hideNote() {
+  ui.note.hidden = true; ui.wrap.inert = false;
+  ui.styles.find(b => b.getAttribute('aria-pressed') === 'true').focus({ preventScroll: true });
+}
+
+function open() {
+  if (!ui) {
+    ui = buildDialog();
+    ui.close.addEventListener('click', () => ui.d.close());
+    ui.help.addEventListener('click', showNote);
+    ui.noteGo.addEventListener('click', hideNote);
+    // While the note is up, Escape puts it away rather than closing the game.
+    ui.d.addEventListener('cancel', e => {
+      if (!ui.note.hidden) { e.preventDefault(); hideNote(); }
+      else if (!ui.warn.hidden) { e.preventDefault(); game.hideWarning(); }
+    });
+    ui.d.addEventListener('close', () => {
+      game?.stop();
+      document.documentElement.classList.remove('tg-lock');
+      window.forrtHeroSuspend?.(false);
+    });
+  }
+  if (ui.d.open) return;
+  window.forrtHeroSuspend?.(true);
+  document.documentElement.classList.add('tg-lock');
+  ui.d.showModal();
+  const t0 = performance.now();
+  try {
+    if (!game) game = createGame();
+    window.towerGame.setupMs = window.towerGame.setupMs || performance.now() - t0;
+    game.resize(); game.start();
+    if (!noteSeen || !ui.note.hidden) { noteSeen = true; showNote(); }
+    else ui.styles.find(b => b.getAttribute('aria-pressed') === 'true').focus({ preventScroll: true });
+  } catch (error) {
+    ui.hint.textContent = 'This browser could not start the game.';
+    console.warn('Tower game could not start:', error.message);
+  }
+}
+
+window.towerGame = { open, close: () => ui?.d.close() };
+
+if (__DEBUG__) {
+  /* Test hooks. Excluded from the size figures. */
+  Object.defineProperty(window.towerGame, 'g', { get: () => game });
+  const idx = p => game.bricks.indexOf(p);
+  /* Stud centres, read from the rendered mesh's own vertices rather than from the game's bookkeeping. */
+  function studCentres(m) {
+    m.updateWorldMatrix(true, false);
+    const pos = m.geometry.attributes.position, v = new Vector3();
+    let top = -Infinity;
+    for (let k = 0; k < pos.count; k++) { v.fromBufferAttribute(pos, k).applyMatrix4(m.matrixWorld); if (v.y > top) top = v.y; }
+    const groups = new Map();
+    for (let k = 0; k < pos.count; k++) {
+      v.fromBufferAttribute(pos, k).applyMatrix4(m.matrixWorld);
+      if (Math.abs(v.y - top) > .0005) continue;
+      const key = Math.round(v.x / .3 - .5) + ',' + Math.round(v.z / .3 - .5);
+      if (!groups.has(key)) groups.set(key, { x: 0, z: 0, n: 0 });
+      const g = groups.get(key); g.x += v.x; g.z += v.z; g.n++;
+    }
+    return { top, studs: [...groups.values()].map(g => ({ x: g.x / g.n, z: g.z / g.n })) };
+  }
+  /* The brick that a real ray hits first, against the rendered meshes. Shares no code with the game's height-map picking. */
+  function meshUnder(point) {
+    const g = game;
+    g.castRay(point);
+    const fixed = g.model.children.filter(o => o.isMesh), loose = g.history.map(p => p.object);
+    const hit = g.raycaster.intersectObjects([...fixed, ...loose], true)[0];
+    if (!hit) return null;
+    return { x: hit.point.x, y: hit.point.y, z: hit.point.z, cell: [Math.floor(hit.point.x / .3), Math.floor(hit.point.z / .3)], onBrick: !fixed.includes(hit.object) };
+  }
+  Object.assign(window.towerGame, {
+    state() {
+      const g = game;
+      return { placed: g.placedCount(), used: g.history.length, slotsFilled: g.slots.filter(s => s.filled).length, open: ui.d.open, hintsShown: g.slots.filter(s => s.hint.visible).length, last: g.history.length ? { ...g.history[g.history.length - 1].cell, type: g.history[g.history.length - 1].type } : null, stats: g.stats, hint: ui.hint.textContent, selected: g.selected, rot: g.rot, view: g.view, done: g.done, aim: g.aim && { i: g.aim.i, j: g.aim.j, rot: g.aim.rot, level: g.aim.level, type: g.aim.type }, ghost: g.ghost.visible, warning: !ui.warn.hidden, toppling: g.toppling, lastCollapse: g.lastCollapse, rubble: g.bricks.filter(p => p.state === 'debris').length, strain: +g.strainWith().toFixed(1), wobblyAim: Boolean(g.aim) && g.tooWobbly(g.aim), ghostColour: '#' + g.ghostSkin.color.getHexString(), lastColour: g.history.length ? '#' + g.history[g.history.length - 1].stone.getHexString() : null, ghostEdge: '#' + g.ghostLine.material.color.getHexString() };
+    },
+    settled() { return !game.busy && !game.drag; },
+    frameSize() { return { w: game.frame.width, h: game.frame.height }; },
+    meshUnder,
+    /* Screen point of the centre of a stud square's surface. */
+    cellPoint(i, j, level) { return game.project(new Vector3(.15 + .3 * i, game.heightOf(level) + .002, .15 + .3 * j)); },
+    /* Every spot the rules allow for the chosen brick and direction, right now. */
+    legalSpots() {
+      const g = game, out = [];
+      for (let i = g.MIN_CELL; i <= g.MAX_CELL; i++) for (let j = g.MIN_CELL; j <= g.MAX_CELL; j++) { const r = g.landing(g.selected, i, j, g.rot); if (r) out.push(`${i},${j},${r.level}`); }
+      return out;
+    },
+    /* Screen centre of a spot's underside, or null if the spot is off the canvas. */
+    spotPoint(i, j, level) {
+      const g = game, [nx, nz] = g.footprint(g.selected, g.rot);
+      const q = g.project(new Vector3(.15 + .3 * (i + (nx - 1) / 2), g.heightOf(level), .15 + .3 * (j + (nz - 1) / 2)));
+      return q.x >= 0 && q.y >= 0 && q.x <= g.frame.width && q.y <= g.frame.height ? q : null;
+    },
+    /* Sweep the pointer in fine steps over the area around the legal spots and collect every spot it can reach. */
+    sweep(step = 3) {
+      const g = game, w = window.towerGame, seen = new Set(), spots = w.legalSpots().map(s => s.split(',').map(Number)).map(([i, j, l]) => w.spotPoint(i, j, l)).filter(Boolean);
+      const x0 = Math.max(0, Math.min(...spots.map(q => q.x)) - 36), x1 = Math.min(g.frame.width, Math.max(...spots.map(q => q.x)) + 36);
+      const y0 = Math.max(0, Math.min(...spots.map(q => q.y)) - 36), y1 = Math.min(g.frame.height, Math.max(...spots.map(q => q.y)) + 36);
+      for (let y = y0; y < y1; y += step) for (let x = x0; x < x1; x += step) { const t = g.freeTargetAt({ x, y }); if (t) seen.add(`${t.i},${t.j},${t.level}`); }
+      return [...seen];
+    },
+    /* The pixel nearest a spot's centre at which the pointer chooses that spot. */
+    aimFor(i, j, level) {
+      const g = game, c = window.towerGame.spotPoint(i, j, level);
+      if (!c) return null;
+      let best = null, bestD = Infinity;
+      for (let dy = -48; dy <= 48; dy += 2) for (let dx = -48; dx <= 48; dx += 2) {
+        const d = Math.hypot(dx, dy);
+        if (d >= bestD) continue;
+        const t = g.freeTargetAt({ x: c.x + dx, y: c.y + dy });
+        if (t && t.i === i && t.j === j && t.level === level) { best = { x: c.x + dx, y: c.y + dy }; bestD = d; }
+      }
+      return best;
+    },
+    /* Raw pointer points against what a real ray hits on the rendered meshes. */
+    fidelity(n) {
+      const g = game, F = g.foundationTop;
+      // Ray tests read world matrices, which otherwise update only when a frame is drawn.
+      g.scene.updateMatrixWorld(true);
+      const out = { points: 0, exact: 0, withinOne: 0, seam: 0, far: [], none: 0 };
+      for (let k = 0; k < n; k++) {
+        const point = { x: Math.random() * g.frame.width, y: Math.random() * g.frame.height };
+        const hit = meshUnder(point);
+        if (!hit || hit.y < F - .1) continue;
+        out.points++;
+        const t = g.freeTargetAt(point);
+        if (!t) { out.none++; continue; }
+        const [nx, nz] = g.footprint(t.type, t.rot);
+        const dx = hit.cell[0] < t.i ? t.i - hit.cell[0] : Math.max(0, hit.cell[0] - (t.i + nx - 1));
+        const dz = hit.cell[1] < t.j ? t.j - hit.cell[1] : Math.max(0, hit.cell[1] - (t.j + nz - 1));
+        if (dx === 0 && dz === 0) out.exact++;
+        else if (dx <= 1 && dz <= 1) out.withinOne++;
+        else {
+          // A ray can slip through the hairline joint between bricks or graze a brick's edge. If a pixel 2 px away agrees with the game, it was only that.
+          const near = [[-2, 0], [2, 0], [0, -2], [0, 2]].map(([a, b]) => meshUnder({ x: point.x + a, y: point.y + b })).filter(q => q && q.cell[0] >= t.i - 1 && q.cell[0] <= t.i + nx && q.cell[1] >= t.j - 1 && q.cell[1] <= t.j + nz);
+          // Or the ray only caught the rim of a stud with air right beside it: the game treats that sliver as the air next to it.
+          const rim = !g.surfaceCell(point) && [[-1, 0], [1, 0], [0, -1], [0, 1]].some(([a, b]) => !meshUnder({ x: point.x + a, y: point.y + b }));
+          if (near.length >= 1 || rim) out.seam++;
+          else if (out.far.length < 8) out.far.push({ point, hit, t: [t.i, t.j, t.rot, t.level] });
+        }
+      }
+      return out;
+    },
+    /* The same way in as a click: the rule applies and the warning shows. */
+    tryPlace(type, i, j, rot = 0) { const g = game, r = g.landing(type, i, j, rot); if (!r) return 'none'; const wasFlying = g.placeBrick(g.makeTarget(type, i, j, rot, r)); if (wasFlying) { g.land(wasFlying); for (const f of [...g.flights]) if (f.part === wasFlying) g.flights.delete(f); return 'placed'; } g.hideWarning(); return 'refused'; },
+    place(type, i, j, rot = 0) { const g = game, r = g.landing(type, i, j, rot); if (!r) return null; const p = g.spawn(type); g.commit(p, g.makeTarget(type, i, j, rot, r)); g.land(p); return r; },
+    /* Independent audit, from world positions and mesh vertices only. Uses none of the game's rule code. */
+    audit() {
+      const g = game, F = g.foundationTop, placed = g.history.filter(p => p.state === 'placed');
+      const offGrid = [], wrongLevel = [], unconnected = [], collisions = [], slidIn = [];
+      const eps = 1e-3;
+      const onLattice = v => Math.abs((v - .15) / .3 - Math.round((v - .15) / .3)) < eps;
+      // Foundation studs, from the merged mesh vertices at the very top: walls and deck.
+      const fixed = g.model.children.filter(o => o.isMesh && o.name === 'Fixed castle masonry');
+      let foundationStuds = [], foundationStudTop = -Infinity;
+      for (const m of fixed) { const c = studCentres(m); if (c.top > foundationStudTop + eps) { foundationStudTop = c.top; foundationStuds = c.studs; } else if (Math.abs(c.top - foundationStudTop) < eps) foundationStuds.push(...c.studs); }
+      const foundationOffGrid = foundationStuds.filter(s => !(onLattice(s.x) && onLattice(s.z)));
+      const foundationCells = new Set(foundationStuds.map(s => Math.round((s.x - .15) / .3) + ',' + Math.round((s.z - .15) / .3)));
+      // Column map, filled brick by brick in placing order.
+      const col = new Map();
+      for (const p of placed) {
+        const t = g.TYPES[p.type], rot = Math.abs(Math.sin(p.object.rotation.y)) > .5;
+        const nx = rot ? t.nz : t.nx, nz = rot ? t.nx : t.nz;
+        const h = t.plates * .09, bottom = p.object.position.y - h / 2;
+        const units = (bottom - F) / .09;
+        if (Math.abs(units - Math.round(units)) > eps) wrongLevel.push(idx(p));
+        const studs = studCentres(g.mesh(p)).studs;
+        if (studs.length !== nx * nz || !studs.every(s => onLattice(s.x) && onLattice(s.z))) offGrid.push(idx(p));
+        const i0 = Math.round((p.object.position.x - (nx - 1) * .15 - .15) / .3), j0 = Math.round((p.object.position.z - (nz - 1) * .15 - .15) / .3);
+        let touches = 0, trapped = false;
+        for (let a = i0; a < i0 + nx; a++) for (let b = j0; b < j0 + nz; b++) {
+          const key = a + ',' + b, here = col.get(key) || [];
+          if (here.some(([lo, hi]) => lo < bottom + h - eps && hi > bottom + eps)) collisions.push(idx(p));
+          // Anything already above its underside in its own column means it could not have come from above.
+          if (here.some(([, hi]) => hi > bottom + eps)) trapped = true;
+          if (here.some(([, hi]) => Math.abs(hi - bottom) < eps) || (Math.abs(bottom - F) < eps && foundationCells.has(key))) touches++;
+        }
+        if (touches < 1) unconnected.push(idx(p));
+        if (trapped) slidIn.push(idx(p));
+        for (let a = i0; a < i0 + nx; a++) for (let b = j0; b < j0 + nz; b++) { const key = a + ',' + b; if (!col.has(key)) col.set(key, []); col.get(key).push([bottom, bottom + h]); }
+      }
+      return { placed: placed.length, offGrid: offGrid.length, wrongLevel: wrongLevel.length, unconnected: unconnected.length, collisions: collisions.length, slidIn: slidIn.length, foundationStuds: foundationStuds.length, foundationOffGrid: foundationOffGrid.length };
+    },
+    /* Rule-only games, without flights. 'plan': random order through the plan. 'free': random bricks at random legal spots. */
+    simulate(mode, runs, bricks = 60) {
+      const g = game; let stuck = 0, completed = 0, faults = 0, placed = 0;
+      for (let r = 0; r < runs; r++) {
+        g.restart();
+        if (mode === 'plan') {
+          for (let open = g.openSlots(); open.length; open = g.openSlots()) { const s = open[Math.floor(Math.random() * open.length)]; const p = g.spawn(s.type); g.commit(p, g.makeTarget(s.type, s.i, s.j, s.rot, g.landing(s.type, s.i, s.j, s.rot))); g.land(p); }
+          if (g.slots.every(s => s.filled)) completed++; else stuck++;
+        } else {
+          for (let n = 0; n < bricks; n++) {
+            const type = g.TYPE_KEYS[Math.floor(Math.random() * g.TYPE_KEYS.length)], rot = Math.floor(Math.random() * 2), spots = [];
+            for (let i = g.MIN_CELL; i <= g.MAX_CELL; i++) for (let j = g.MIN_CELL; j <= g.MAX_CELL; j++) { if (g.landing(type, i, j, rot)) spots.push([i, j]); }
+            const [i, j] = spots[Math.floor(Math.random() * spots.length)];
+            const part = g.spawn(type); g.commit(part, g.makeTarget(type, i, j, rot, g.landing(type, i, j, rot))); g.land(part);
+          }
+          completed++;
+        }
+        const a = window.towerGame.audit();
+        placed += a.placed;
+        faults += a.offGrid + a.wrongLevel + a.unconnected + a.collisions + a.slidIn;
+      }
+      g.restart();
+      return { mode, runs, stuck, completed, faults, placed };
+    },
+    sizes() {
+      const g = game, w = window.towerGame;
+      const a = w.cellPoint(-1, -1, 0), b = w.cellPoint(0, -1, 0), c = w.cellPoint(-1, 0, 0);
+      const px = (p, q) => +Math.hypot(p.x - q.x, p.y - q.y).toFixed(1);
+      return { canvas: [g.frame.width, g.frame.height], pxPerUnit: +g.frame.scale.toFixed(1), studStepAcross: px(a, b), studStepAlong: px(a, c) };
+    }
+  });
+}
diff --git a/assets/js/tower/physics-entry.js b/assets/js/tower/physics-entry.js
new file mode 100644
index 00000000000..167bef1fb35
--- /dev/null
+++ b/assets/js/tower/physics-entry.js
@@ -0,0 +1,2 @@
+/* The physics file, fetched only by someone who reaches the wobble warning. */
+export { World, Body, Box, Plane, Vec3, Quaternion, SAPBroadphase } from 'cannon-es';
diff --git a/assets/js/tower/source-copies/lego-foundation.js b/assets/js/tower/source-copies/lego-foundation.js
new file mode 100644
index 00000000000..c7da6a449ea
--- /dev/null
+++ b/assets/js/tower/source-copies/lego-foundation.js
@@ -0,0 +1,274 @@
+/* Game foundation, cut from castle-geometry-v3.js. The walls are one stud thick (.30, not .36) and stop in a flat studded
+   course, with no windows, and a deck fills the middle, so all 64 studs on top sit on the .30 grid the game's bricks use.
+   A hollow, brick-built keep. Units are metres only by convention: one stud is .30.
+   Bricks include their studs in a shared geometry and animate as individual parts. */
+import {
+  Group, Mesh, MeshStandardMaterial, Shape, ExtrudeGeometry,
+  LatheGeometry, Vector2, Matrix4
+} from 'three';
+import { RoundedBoxGeometry } from 'three/addons/geometries/RoundedBoxGeometry.js';
+import { mergeGeometries } from 'three/addons/utils/BufferGeometryUtils.js';
+
+const PITCH = .30;
+const COURSE = .27;
+const GAP = .014;
+const WALL = .30;
+const FOUNDATION_COURSES = 9;
+const FLOOR = .15;
+const BODY_HALF = 1.20;
+const GROUND = -.035;
+// The shaped doorway bricks extend .005 below their nominal lower edge.
+const GROUND_SHIFT = FLOOR + GAP / 2 - .005 - GROUND;
+const CASTLE_HEIGHT = 4.02 - GROUND_SHIFT;
+
+export function createFoundation() {
+  const model = new Group();
+  model.name = 'Brick-built stone keep';
+  const assemblyParts = [];
+  const cache = new Map();
+  const stoneColours = ['#55616a', '#5c6870', '#637078', '#505c65', '#6b757b', '#5a666e', '#626b71'];
+  const stones = stoneColours.map(color => new MeshStandardMaterial({
+    color, roughness: .42, metalness: .025
+  }));
+  const archStones = ['#79848a', '#707c83', '#65717a'].map(color => new MeshStandardMaterial({
+    color, roughness: .43, metalness: .025
+  }));
+  const mortar = new MeshStandardMaterial({color: '#444f58', roughness: .48, metalness: .02});
+  // Stable brick identities also index the precomputed loose-brick pile poses.
+  let serial = 1, removedBandBricks = 0;
+
+  // The softened lip catches a narrow highlight without the cost of a bevel modifier.
+  const studGeometry = new LatheGeometry([
+    new Vector2(0, 0), new Vector2(.078, 0), new Vector2(.087, .008),
+    new Vector2(.087, .048), new Vector2(.080, .055), new Vector2(0, .055)
+  ], 16);
+
+  function merge(parts) {
+    const result = mergeGeometries(parts.map(part => part.index ? part.toNonIndexed() : part), false);
+    result.computeBoundingSphere();
+    return result;
+  }
+
+  function studAt(x, y, z) {
+    return studGeometry.clone().applyMatrix4(new Matrix4().makeTranslation(x, y, z));
+  }
+
+  function brickGeometry(width, height, depth, studs = true) {
+    const key = [width, height, depth, studs].map(value => typeof value === 'number' ? value.toFixed(4) : value).join('/');
+    if (cache.has(key)) return cache.get(key);
+    const parts = [new RoundedBoxGeometry(width - GAP, height - GAP, depth - GAP, 2, .011)];
+    if (studs) {
+      const columns = Math.max(1, Math.floor((width - .18) / PITCH) + 1);
+      const rows = Math.max(1, Math.floor((depth - .18) / PITCH) + 1);
+      for (let x = 0; x < columns; x++) for (let z = 0; z < rows; z++) {
+        const px = (x - (columns - 1) / 2) * PITCH;
+        const pz = (z - (rows - 1) / 2) * PITCH;
+        if (Math.abs(px) + .09 < width / 2 && Math.abs(pz) + .09 < depth / 2) {
+          parts.push(studAt(px, (height - GAP) / 2, pz));
+        }
+      }
+    }
+    const geometry = merge(parts);
+    cache.set(key, geometry);
+    return geometry;
+  }
+
+  function addPiece(geometry, {x = 0, y = 0, z = 0, rotation = 0, material, animate = false, order, name = 'Masonry brick'} = {}) {
+    const object = new Group();
+    object.name = name;
+    object.position.set(x, y, z);
+    object.rotation.y = rotation;
+    const mesh = new Mesh(geometry, material || stones[(serial * 17 + Math.floor(y * 31)) % stones.length]);
+    mesh.castShadow = true;
+    mesh.receiveShadow = true;
+    object.add(mesh);
+    object.userData = {brick: true, index: serial++, course: Math.floor((y - FLOOR) / COURSE), restHeight: y};
+    model.add(object);
+    if (animate) assemblyParts.push({object, order: order ?? y * 100 + (serial % 23) * .025});
+    return object;
+  }
+
+  function wallPiece(geometry, x, y, side, material, animate, name) {
+    const rotation = side * Math.PI / 2;
+    const z = BODY_HALF - WALL / 2;
+    return addPiece(geometry, {
+      x: Math.cos(rotation) * x + Math.sin(rotation) * z,
+      y,
+      z: -Math.sin(rotation) * x + Math.cos(rotation) * z,
+      rotation, material, animate, name
+    });
+  }
+
+  // Front and right entrances are openings through the wall, including the arch.
+  // Arches use circular boundaries; upper arrow windows have a small flat lintel.
+  const openings = [
+    [{bottom: FLOOR - .03, spring: .96, radius: .45, top: 1.41}],
+    [{bottom: FLOOR - .03, spring: .81, radius: .36, top: 1.17}],
+    [],
+    []
+  ];
+
+  function halfOpening(opening, y) {
+    if (opening.half) return opening.half;
+    if (y <= opening.spring) return opening.radius;
+    return Math.sqrt(Math.max(0, opening.radius ** 2 - (y - opening.spring) ** 2));
+  }
+
+  function rectangularIntervals(left, right, course) {
+    const boundaries = [left];
+    const offset = course % 2 ? .30 : 0;
+    for (let x = -1.80 + offset; x < right - .01; x += .60) {
+      if (x > left + .08) boundaries.push(x);
+    }
+    boundaries.push(right);
+    return boundaries.slice(0, -1).map((x, i) => [x, boundaries[i + 1]]);
+  }
+
+  // Clip an individual masonry block against an aperture, leaving real air inside.
+  // Curved edge points are sampled only on the handful of blocks around each arch.
+  function clippedBrick(left, right, low, high, opening, direction) {
+    const centerX = (left + right) / 2;
+    const centerY = (low + high) / 2;
+    const samples = 18;
+    const points = [];
+    let area = 0;
+    const x0 = left + GAP / 2;
+    const x1 = right - GAP / 2;
+    const y0 = low + GAP / 2;
+    const y1 = high - GAP / 2;
+    for (let i = 0; i <= samples; i++) {
+      const y = y0 + (y1 - y0) * i / samples;
+      const boundary = direction < 0
+        ? Math.min(x1, -halfOpening(opening, y) - .006)
+        : Math.max(x0, halfOpening(opening, y) + .006);
+      const width = direction < 0 ? Math.max(0, boundary - x0) : Math.max(0, x1 - boundary);
+      area += width;
+      points.push({y, boundary: direction < 0 ? Math.max(x0, boundary) : Math.min(x1, boundary)});
+    }
+    if (area < .025) return null;
+    const shape = new Shape();
+    if (direction < 0) {
+      shape.moveTo(x0 - centerX, y0 - centerY);
+      for (const point of points) shape.lineTo(point.boundary - centerX, point.y - centerY);
+      shape.lineTo(x0 - centerX, y1 - centerY);
+    } else {
+      shape.moveTo(x1 - centerX, y0 - centerY);
+      shape.lineTo(x1 - centerX, y1 - centerY);
+      for (const point of points.slice().reverse()) shape.lineTo(point.boundary - centerX, point.y - centerY);
+    }
+    shape.closePath();
+    const solid = new ExtrudeGeometry(shape, {depth: WALL - GAP - .012, bevelEnabled: true, bevelThickness: .006, bevelSize: .005, bevelSegments: 2, steps: 1, curveSegments: 10});
+    solid.translate(0, 0, -(WALL - GAP - .012) / 2);
+    const parts = [solid];
+    // Studs belong only where the clipped brick still has a full-width top surface.
+    const topBoundary = points[points.length - 1].boundary;
+    for (let x = -1.05; x < 1.20; x += PITCH) {
+      const permitted = direction < 0 ? x + .094 < topBoundary : x - .094 > topBoundary;
+      if (permitted && x - .094 > x0 && x + .094 < x1) parts.push(studAt(x - centerX, y1 - centerY, 0));
+    }
+    return merge(parts);
+  }
+
+  for (let course = 0; course < FOUNDATION_COURSES; course++) {
+    const low = FLOOR + course * COURSE;
+    const high = low + COURSE;
+    for (let side = 0; side < 4; side++) {
+      // Alternate which pair passes through the corners, as physical brick bonds do.
+      const fullWidth = side % 2 === course % 2;
+      const half = fullWidth ? BODY_HALF : BODY_HALF - WALL;
+      const rows = [low, high];
+      const holes = openings[side];
+      // An arch top inside a course leaves that course whole; only the bricks over the arch are shaped.
+      let archTop = false;
+      for (const hole of holes) for (const boundary of [hole.bottom, hole.top]) {
+        if (boundary > low + .01 && boundary < high - .01) {
+          if (hole.radius) archTop = true;
+          else rows.push(boundary);
+        }
+      }
+      rows.sort((a, b) => a - b);
+      for (let section = 0; section < rows.length - 1; section++) {
+        const bottom = rows[section];
+        const top = rows[section + 1];
+        const middleY = (bottom + top) / 2;
+        const hole = holes.find(opening => middleY > opening.bottom && middleY < opening.top);
+        for (const [left, right] of rectangularIntervals(-half, half, course + side)) {
+          const middleX = (left + right) / 2;
+          const animate = false;
+          if (!hole || (right < -halfOpening(hole, bottom) - .01 || left > halfOpening(hole, bottom) + .01)) {
+            wallPiece(brickGeometry(right - left, top - bottom, WALL), middleX, middleY, side, null, animate, 'Interlocking slate-grey wall brick');
+          } else {
+            for (const direction of [-1, 1]) {
+              const geometry = clippedBrick(left, right, bottom, top, hole, direction);
+              if (geometry) wallPiece(geometry, middleX, middleY, side, null, animate, 'Shaped masonry around an opening');
+            }
+          }
+        }
+      }
+      // Serials index the baked heap poses, so the bricks of the removed band keep their numbers.
+      if (archTop) {
+        const skipped = rectangularIntervals(-half, half, course + side).length;
+        serial += skipped;
+        removedBandBricks += skipped;
+      }
+    }
+  }
+
+  // Specialised arch bricks project by .018, with a separate keystone and jambs.
+  // Their inner radii exactly follow the openings cut into the structural wall.
+  function addArch(side, radius, spring, count) {
+    for (let i = 0; i < count; i++) {
+      const start = i * Math.PI / count + .012;
+      const end = (i + 1) * Math.PI / count - .012;
+      const outer = radius + .135;
+      const shape = new Shape();
+      shape.absarc(0, 0, outer, start, end, false);
+      shape.absarc(0, 0, radius + .007, end, start, true);
+      shape.closePath();
+      const geometry = new ExtrudeGeometry(shape, {depth: WALL + .025, bevelEnabled: true, bevelSize: .004, bevelThickness: .004, bevelSegments: 2, curveSegments: 6, steps: 1});
+      geometry.translate(0, 0, -(WALL + .025) / 2);
+      wallPiece(geometry, 0, spring, side, archStones[i % archStones.length], false, 'Individual arch voussoir');
+    }
+    const jambHeight = spring - FLOOR;
+    const countJamb = Math.ceil(jambHeight / COURSE);
+    for (let course = 0; course < countJamb; course++) {
+      const h = jambHeight / countJamb;
+      for (const sign of [-1, 1]) {
+        wallPiece(brickGeometry(.132, h, WALL + .027, false), sign * (radius + .071), FLOOR + h * (course + .5), side, archStones[(course + side) % archStones.length], false, 'Arch jamb brick');
+      }
+    }
+  }
+  addArch(0, .45, .96, 7);
+  addArch(1, .36, .81, 7);
+
+  // A studded deck fills the space inside the walls, flush with their tops, so the whole top can be built on.
+  const deckStone = new MeshStandardMaterial({color: '#757f84', roughness: .46, metalness: .02});
+  addPiece(brickGeometry(6 * PITCH, COURSE / 3, 6 * PITCH), {y: FLOOR + FOUNDATION_COURSES * COURSE - COURSE / 6, material: deckStone, name: 'Deck'});
+
+  for (const object of model.children) {
+    object.position.y -= GROUND_SHIFT;
+    object.userData.restHeight -= GROUND_SHIFT;
+  }
+
+  // Fixed bricks share a draw call per material. Moving bricks retain independent
+  // pivots and shared geometries, so the detailed model stays economical on phones.
+    const fixedByMaterial = new Map();
+  model.updateMatrixWorld(true);
+  for (const object of model.children.slice()) {
+    object.traverse(mesh => {
+      if (!mesh.isMesh) return;
+      if (!fixedByMaterial.has(mesh.material)) fixedByMaterial.set(mesh.material, []);
+      fixedByMaterial.get(mesh.material).push(mesh.geometry.clone().applyMatrix4(mesh.matrixWorld));
+    });
+    model.remove(object);
+  }
+  for (const [material, geometries] of fixedByMaterial) {
+    const mesh = new Mesh(merge(geometries), material);
+    mesh.name = 'Fixed castle masonry';
+    mesh.castShadow = true;
+    mesh.receiveShadow = true;
+    model.add(mesh);
+    geometries.forEach(geometry => geometry.dispose());
+  }
+  return {model, brickGeometry, stones, foundationTop: FLOOR + FOUNDATION_COURSES * COURSE - GROUND_SHIFT, pitch: PITCH, course: COURSE, gap: GAP};
+}
diff --git a/assets/scss/custom.scss b/assets/scss/custom.scss
index cd057c2cf31..69f8cd861d0 100644
--- a/assets/scss/custom.scss
+++ b/assets/scss/custom.scss
@@ -3414,36 +3414,6 @@ h1.clusters-site-heading.clusters-hub-page__title {
   margin: 16px auto 0;
 }
 
-/* ============================================================
- *  Newsletter sign-up form (layouts/partials/newsletter_form.html)
- * ============================================================ */
-.newsletter-form { flex: 0 1 auto; width: 100%; max-width: 520px; text-align: left; }
-.newsletter-row { display: flex; flex-wrap: wrap; gap: 8px; }
-.newsletter-field { flex: 999 1 220px; margin: 0; }
-.newsletter-field input {
-  width: 100%; padding: 8px 14px; border: 1.5px solid #718096; border-radius: 999px;
-  background: #fff; color: #2d3748; font-size: 1rem; line-height: 1.3;
-}
-.newsletter-field input::placeholder { color: #4a5568; opacity: 1; }
-.newsletter-field input:focus { border-color: #004055; outline: 3px solid #004055; outline-offset: 0; }
-.newsletter-submit {
-  flex: 1 0 auto; padding: 9px 22px; border: 0; border-radius: 999px;
-  background: #004055; color: #fff; cursor: pointer; font-weight: 700; font-size: 1rem; line-height: 1.3;
-}
-.newsletter-submit:hover { background: #00566f; }
-.newsletter-submit:focus-visible { outline: 3px solid #2d3748; outline-offset: 2px; }
-.newsletter-submit:disabled { background: #718096; cursor: progress; }
-.newsletter-hp { position: absolute; left: -5000px; }
-form.newsletter-form p.newsletter-status { margin: 8px 0 0; font-size: 1rem; font-weight: 600; color: #2d3748; }
-.newsletter-status:empty { display: none; }
-form.newsletter-form p.newsletter-status.is-error { color: #a3271f; }
-.newsletter-status:focus:not(:focus-visible) { outline: none; }
-form.newsletter-form p.newsletter-note { margin: 6px 0 0; color: #4a5568; font-size: 15px; line-height: 1.4; }
-.newsletter-note a { color: inherit; text-decoration: underline; }
-.newsletter-form.is-done .newsletter-row,
-.newsletter-form.is-done .newsletter-note { display: none; }
-.newsletter-form.is-done .newsletter-status { margin-top: 0; }
-
 /* ============================================================
  *  Combined Achievements & Awards section (two columns)
  * ============================================================ */
diff --git a/assets/three/LICENSE b/assets/three/LICENSE
new file mode 100644
index 00000000000..8ada2a5f982
--- /dev/null
+++ b/assets/three/LICENSE
@@ -0,0 +1,21 @@
+The MIT License
+
+Copyright © 2010-2026 three.js authors
+
+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.
diff --git a/assets/three/README.md b/assets/three/README.md
new file mode 100644
index 00000000000..ed0255fd4bd
--- /dev/null
+++ b/assets/three/README.md
@@ -0,0 +1,12 @@
+# Three.js, vendored for the home-page castle
+
+These are unmodified files from the npm package `three@0.186.0` (MIT, see `LICENSE`), so Hugo's `js.Build` can bundle the castle without Node.
+
+| Here | In the package |
+|---|---|
+| `index.js` | `build/three.module.js` |
+| `three.core.js` | `build/three.core.js` |
+| `addons/geometries/RoundedBoxGeometry.js` | `examples/jsm/geometries/RoundedBoxGeometry.js` |
+| `addons/utils/BufferGeometryUtils.js` | `examples/jsm/utils/BufferGeometryUtils.js` |
+
+To update, replace these four files from the new release, change the version here and in `assets/js/castle/README.md`, and look at the castle on the home page. This folder is excluded from spell checking.
diff --git a/assets/three/addons/geometries/RoundedBoxGeometry.js b/assets/three/addons/geometries/RoundedBoxGeometry.js
new file mode 100644
index 00000000000..038370c48e7
--- /dev/null
+++ b/assets/three/addons/geometries/RoundedBoxGeometry.js
@@ -0,0 +1,216 @@
+import {
+	BoxGeometry,
+	Vector3
+} from 'three';
+
+const _tempNormal = new Vector3();
+
+function getUv( faceDirVector, normal, uvAxis, projectionAxis, radius, sideLength ) {
+
+	const totArcLength = 2 * Math.PI * radius / 4;
+
+	// length of the planes between the arcs on each axis
+	const centerLength = Math.max( sideLength - 2 * radius, 0 );
+	const halfArc = Math.PI / 4;
+
+	// Get the vector projected onto the Y plane
+	_tempNormal.copy( normal );
+	_tempNormal[ projectionAxis ] = 0;
+	_tempNormal.normalize();
+
+	// total amount of UV space alloted to a single arc
+	const arcUvRatio = 0.5 * totArcLength / ( totArcLength + centerLength );
+
+	// the distance along one arc the point is at
+	const arcAngleRatio = 1.0 - ( _tempNormal.angleTo( faceDirVector ) / halfArc );
+
+	if ( Math.sign( _tempNormal[ uvAxis ] ) === 1 ) {
+
+		return arcAngleRatio * arcUvRatio;
+
+	} else {
+
+		// total amount of UV space alloted to the plane between the arcs
+		const lenUv = centerLength / ( totArcLength + centerLength );
+		return lenUv + arcUvRatio + arcUvRatio * ( 1.0 - arcAngleRatio );
+
+	}
+
+}
+
+/**
+ * A special type of box geometry with rounded corners and edges.
+ *
+ * ```js
+ * const geometry = new RoundedBoxGeometry();
+ * const material = new THREE.MeshStandardMaterial( { color: 0x00ff00 } );
+ * const cube = new THREE.Mesh( geometry, material );
+ * scene.add( cube );
+ * ```
+ *
+ * @augments BoxGeometry
+ * @three_import import { RoundedBoxGeometry } from 'three/addons/geometries/RoundedBoxGeometry.js';
+ */
+class RoundedBoxGeometry extends BoxGeometry {
+
+	/**
+	 * Constructs a new rounded box geometry.
+	 *
+	 * @param {number} [width=1] - The width. That is, the length of the edges parallel to the X axis.
+	 * @param {number} [height=1] - The height. That is, the length of the edges parallel to the Y axis.
+	 * @param {number} [depth=1] - The depth. That is, the length of the edges parallel to the Z axis.
+	 * @param {number} [segments=2] - Number of segments that form the rounded corners.
+	 * @param {number} [radius=0.1] - The radius of the rounded corners.
+	 */
+	constructor( width = 1, height = 1, depth = 1, segments = 2, radius = 0.1 ) {
+
+		// calculate total segments needed &
+		// ensure it's odd so that we have a plane connecting the rounded corners
+		const totalSegments = segments * 2 + 1;
+
+		// ensure radius isn't bigger than shortest side
+		radius = Math.min( width / 2, height / 2, depth / 2, radius );
+
+		// start with a unit box geometry, its vertices will be modified to form the rounded box
+		super( 1, 1, 1, totalSegments, totalSegments, totalSegments );
+
+		this.type = 'RoundedBoxGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			width: width,
+			height: height,
+			depth: depth,
+			segments: segments,
+			radius: radius,
+		};
+
+		// if totalSegments is 1, no rounding is needed - return regular box
+		if ( totalSegments === 1 ) return;
+
+		const geometry2 = this.toNonIndexed();
+
+		this.index = null;
+		this.attributes.position = geometry2.attributes.position;
+		this.attributes.normal = geometry2.attributes.normal;
+		this.attributes.uv = geometry2.attributes.uv;
+
+		//
+
+		const position = new Vector3();
+		const normal = new Vector3();
+
+		const box = new Vector3( width, height, depth ).divideScalar( 2 ).subScalar( radius );
+
+		const positions = this.attributes.position.array;
+		const normals = this.attributes.normal.array;
+		const uvs = this.attributes.uv.array;
+
+		const faceTris = positions.length / 6;
+		const faceDirVector = new Vector3();
+		const halfSegmentSize = 0.5 / totalSegments;
+
+		for ( let i = 0, j = 0; i < positions.length; i += 3, j += 2 ) {
+
+			position.fromArray( positions, i );
+			normal.copy( position );
+			normal.x -= Math.sign( normal.x ) * halfSegmentSize;
+			normal.y -= Math.sign( normal.y ) * halfSegmentSize;
+			normal.z -= Math.sign( normal.z ) * halfSegmentSize;
+			normal.normalize();
+
+			positions[ i + 0 ] = box.x * Math.sign( position.x ) + normal.x * radius;
+			positions[ i + 1 ] = box.y * Math.sign( position.y ) + normal.y * radius;
+			positions[ i + 2 ] = box.z * Math.sign( position.z ) + normal.z * radius;
+
+			normals[ i + 0 ] = normal.x;
+			normals[ i + 1 ] = normal.y;
+			normals[ i + 2 ] = normal.z;
+
+			const side = Math.floor( i / faceTris );
+
+			switch ( side ) {
+
+				case 0: // right
+
+					// generate UVs along Z then Y
+					faceDirVector.set( 1, 0, 0 );
+					uvs[ j + 0 ] = getUv( faceDirVector, normal, 'z', 'y', radius, depth );
+					uvs[ j + 1 ] = 1.0 - getUv( faceDirVector, normal, 'y', 'z', radius, height );
+					break;
+
+				case 1: // left
+
+					// generate UVs along Z then Y
+					faceDirVector.set( - 1, 0, 0 );
+					uvs[ j + 0 ] = 1.0 - getUv( faceDirVector, normal, 'z', 'y', radius, depth );
+					uvs[ j + 1 ] = 1.0 - getUv( faceDirVector, normal, 'y', 'z', radius, height );
+					break;
+
+				case 2: // top
+
+					// generate UVs along X then Z
+					faceDirVector.set( 0, 1, 0 );
+					uvs[ j + 0 ] = 1.0 - getUv( faceDirVector, normal, 'x', 'z', radius, width );
+					uvs[ j + 1 ] = getUv( faceDirVector, normal, 'z', 'x', radius, depth );
+					break;
+
+				case 3: // bottom
+
+					// generate UVs along X then Z
+					faceDirVector.set( 0, - 1, 0 );
+					uvs[ j + 0 ] = 1.0 - getUv( faceDirVector, normal, 'x', 'z', radius, width );
+					uvs[ j + 1 ] = 1.0 - getUv( faceDirVector, normal, 'z', 'x', radius, depth );
+					break;
+
+				case 4: // front
+
+					// generate UVs along X then Y
+					faceDirVector.set( 0, 0, 1 );
+					uvs[ j + 0 ] = 1.0 - getUv( faceDirVector, normal, 'x', 'y', radius, width );
+					uvs[ j + 1 ] = 1.0 - getUv( faceDirVector, normal, 'y', 'x', radius, height );
+					break;
+
+				case 5: // back
+
+					// generate UVs along X then Y
+					faceDirVector.set( 0, 0, - 1 );
+					uvs[ j + 0 ] = getUv( faceDirVector, normal, 'x', 'y', radius, width );
+					uvs[ j + 1 ] = 1.0 - getUv( faceDirVector, normal, 'y', 'x', radius, height );
+					break;
+
+			}
+
+		}
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @returns {RoundedBoxGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new RoundedBoxGeometry(
+			data.width,
+			data.height,
+			data.depth,
+			data.segments,
+			data.radius
+		);
+
+	}
+
+
+}
+
+export { RoundedBoxGeometry };
diff --git a/assets/three/addons/utils/BufferGeometryUtils.js b/assets/three/addons/utils/BufferGeometryUtils.js
new file mode 100644
index 00000000000..a167e11b055
--- /dev/null
+++ b/assets/three/addons/utils/BufferGeometryUtils.js
@@ -0,0 +1,1501 @@
+import {
+	BufferAttribute,
+	BufferGeometry,
+	Float32BufferAttribute,
+	InstancedBufferAttribute,
+	InterleavedBuffer,
+	InterleavedBufferAttribute,
+	TriangleFanDrawMode,
+	TriangleStripDrawMode,
+	TrianglesDrawMode,
+	Vector3,
+} from 'three';
+
+/**
+ * @module BufferGeometryUtils
+ * @three_import import * as BufferGeometryUtils from 'three/addons/utils/BufferGeometryUtils.js';
+ */
+
+/**
+ * Computes vertex tangents using the MikkTSpace algorithm. MikkTSpace generates the same tangents consistently,
+ * and is used in most modelling tools and normal map bakers. Use MikkTSpace for materials with normal maps,
+ * because inconsistent tangents may lead to subtle visual issues in the normal map, particularly around mirrored
+ * UV seams.
+ *
+ * In comparison to this method, {@link BufferGeometry#computeTangents} (a custom algorithm) generates tangents that
+ * probably will not match the tangents in other software. The custom algorithm is sufficient for general use with a
+ * custom material, and may be faster than MikkTSpace.
+ *
+ * Returns the original BufferGeometry. Indexed geometries will be de-indexed. Requires position, normal, and uv attributes.
+ *
+ * @param {BufferGeometry} geometry - The geometry to compute tangents for.
+ * @param {Object} MikkTSpace - Instance of `examples/jsm/libs/mikktspace.module.js`, or `mikktspace` npm package.
+ * Await `MikkTSpace.ready` before use.
+ * @param {boolean} [negateSign=true] - Whether to negate the sign component (.w) of each tangent.
+ * Required for normal map conventions in some formats, including glTF.
+ * @return {BufferGeometry} The updated geometry.
+ */
+function computeMikkTSpaceTangents( geometry, MikkTSpace, negateSign = true ) {
+
+	if ( ! MikkTSpace || ! MikkTSpace.isReady ) {
+
+		throw new Error( 'THREE.BufferGeometryUtils: Initialized MikkTSpace library required.' );
+
+	}
+
+	if ( ! geometry.hasAttribute( 'position' ) || ! geometry.hasAttribute( 'normal' ) || ! geometry.hasAttribute( 'uv' ) ) {
+
+		throw new Error( 'THREE.BufferGeometryUtils: Tangents require "position", "normal", and "uv" attributes.' );
+
+	}
+
+	function getAttributeArray( attribute ) {
+
+		if ( attribute.normalized || attribute.isInterleavedBufferAttribute ) {
+
+			const dstArray = new Float32Array( attribute.count * attribute.itemSize );
+
+			for ( let i = 0, j = 0; i < attribute.count; i ++ ) {
+
+				dstArray[ j ++ ] = attribute.getX( i );
+				dstArray[ j ++ ] = attribute.getY( i );
+
+				if ( attribute.itemSize > 2 ) {
+
+					dstArray[ j ++ ] = attribute.getZ( i );
+
+				}
+
+			}
+
+			return dstArray;
+
+		}
+
+		if ( attribute.array instanceof Float32Array ) {
+
+			return attribute.array;
+
+		}
+
+		return new Float32Array( attribute.array );
+
+	}
+
+	// MikkTSpace algorithm requires non-indexed input.
+
+	const _geometry = geometry.index ? geometry.toNonIndexed() : geometry;
+
+	// Compute vertex tangents.
+
+	const tangents = MikkTSpace.generateTangents(
+
+		getAttributeArray( _geometry.attributes.position ),
+		getAttributeArray( _geometry.attributes.normal ),
+		getAttributeArray( _geometry.attributes.uv )
+
+	);
+
+	// Texture coordinate convention of glTF differs from the apparent
+	// default of the MikkTSpace library; .w component must be flipped.
+
+	if ( negateSign ) {
+
+		for ( let i = 3; i < tangents.length; i += 4 ) {
+
+			tangents[ i ] *= - 1;
+
+		}
+
+	}
+
+	//
+
+	_geometry.setAttribute( 'tangent', new BufferAttribute( tangents, 4 ) );
+
+	if ( geometry !== _geometry ) {
+
+		geometry.copy( _geometry );
+
+	}
+
+	return geometry;
+
+}
+
+/**
+ * Merges a set of geometries into a single instance. All geometries must have compatible attributes.
+ *
+ * @param {Array<BufferGeometry>} geometries - The geometries to merge.
+ * @param {boolean} [useGroups=false] - Whether to use groups or not.
+ * @return {?BufferGeometry} The merged geometry. Returns `null` if the merge does not succeed.
+ */
+function mergeGeometries( geometries, useGroups = false ) {
+
+	const isIndexed = geometries[ 0 ].index !== null;
+
+	const attributesUsed = new Set( Object.keys( geometries[ 0 ].attributes ) );
+	const morphAttributesUsed = new Set( Object.keys( geometries[ 0 ].morphAttributes ) );
+
+	const attributes = {};
+	const morphAttributes = {};
+
+	const morphTargetsRelative = geometries[ 0 ].morphTargetsRelative;
+
+	const mergedGeometry = new BufferGeometry();
+
+	let offset = 0;
+
+	for ( let i = 0; i < geometries.length; ++ i ) {
+
+		const geometry = geometries[ i ];
+		let attributesCount = 0;
+
+		// ensure that all geometries are indexed, or none
+
+		if ( isIndexed !== ( geometry.index !== null ) ) {
+
+			console.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index ' + i + '. All geometries must have compatible attributes; make sure index attribute exists among all geometries, or in none of them.' );
+			return null;
+
+		}
+
+		// gather attributes, exit early if they're different
+
+		for ( const name in geometry.attributes ) {
+
+			if ( ! attributesUsed.has( name ) ) {
+
+				console.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index ' + i + '. All geometries must have compatible attributes; make sure "' + name + '" attribute exists among all geometries, or in none of them.' );
+				return null;
+
+			}
+
+			if ( attributes[ name ] === undefined ) attributes[ name ] = [];
+
+			attributes[ name ].push( geometry.attributes[ name ] );
+
+			attributesCount ++;
+
+		}
+
+		// ensure geometries have the same number of attributes
+
+		if ( attributesCount !== attributesUsed.size ) {
+
+			console.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index ' + i + '. Make sure all geometries have the same number of attributes.' );
+			return null;
+
+		}
+
+		// gather morph attributes, exit early if they're different
+
+		if ( morphTargetsRelative !== geometry.morphTargetsRelative ) {
+
+			console.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index ' + i + '. .morphTargetsRelative must be consistent throughout all geometries.' );
+			return null;
+
+		}
+
+		for ( const name in geometry.morphAttributes ) {
+
+			if ( ! morphAttributesUsed.has( name ) ) {
+
+				console.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index ' + i + '.  .morphAttributes must be consistent throughout all geometries.' );
+				return null;
+
+			}
+
+			if ( morphAttributes[ name ] === undefined ) morphAttributes[ name ] = [];
+
+			morphAttributes[ name ].push( geometry.morphAttributes[ name ] );
+
+		}
+
+		if ( useGroups ) {
+
+			let count;
+
+			if ( isIndexed ) {
+
+				count = geometry.index.count;
+
+			} else if ( geometry.attributes.position !== undefined ) {
+
+				count = geometry.attributes.position.count;
+
+			} else {
+
+				console.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index ' + i + '. The geometry must have either an index or a position attribute' );
+				return null;
+
+			}
+
+			mergedGeometry.addGroup( offset, count, i );
+
+			offset += count;
+
+		}
+
+	}
+
+	// merge indices
+
+	if ( isIndexed ) {
+
+		let indexOffset = 0;
+		const mergedIndex = [];
+
+		for ( let i = 0; i < geometries.length; ++ i ) {
+
+			const index = geometries[ i ].index;
+
+			for ( let j = 0; j < index.count; ++ j ) {
+
+				mergedIndex.push( index.getX( j ) + indexOffset );
+
+			}
+
+			indexOffset += geometries[ i ].attributes.position.count;
+
+		}
+
+		mergedGeometry.setIndex( mergedIndex );
+
+	}
+
+	// merge attributes
+
+	for ( const name in attributes ) {
+
+		const mergedAttribute = mergeAttributes( attributes[ name ] );
+
+		if ( ! mergedAttribute ) {
+
+			console.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the ' + name + ' attribute.' );
+			return null;
+
+		}
+
+		mergedGeometry.setAttribute( name, mergedAttribute );
+
+	}
+
+	// merge morph attributes
+
+	for ( const name in morphAttributes ) {
+
+		const numMorphTargets = morphAttributes[ name ][ 0 ].length;
+		if ( numMorphTargets === 0 ) continue;
+
+		mergedGeometry.morphAttributes = mergedGeometry.morphAttributes || {};
+		mergedGeometry.morphAttributes[ name ] = [];
+
+		for ( let i = 0; i < numMorphTargets; ++ i ) {
+
+			const morphAttributesToMerge = [];
+
+			for ( let j = 0; j < morphAttributes[ name ].length; ++ j ) {
+
+				morphAttributesToMerge.push( morphAttributes[ name ][ j ][ i ] );
+
+			}
+
+			const mergedMorphAttribute = mergeAttributes( morphAttributesToMerge );
+
+			if ( ! mergedMorphAttribute ) {
+
+				console.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the ' + name + ' morphAttribute.' );
+				return null;
+
+			}
+
+			mergedGeometry.morphAttributes[ name ].push( mergedMorphAttribute );
+
+		}
+
+	}
+
+	return mergedGeometry;
+
+}
+
+/**
+ * Merges a set of attributes into a single instance. All attributes must have compatible properties and types.
+ * Instances of {@link InterleavedBufferAttribute} are not supported.
+ *
+ * @param {Array<BufferAttribute>} attributes - The attributes to merge.
+ * @return {?BufferAttribute} The merged attribute. Returns `null` if the merge does not succeed.
+ */
+function mergeAttributes( attributes ) {
+
+	let TypedArray;
+	let itemSize;
+	let normalized;
+	let gpuType = - 1;
+	let arrayLength = 0;
+
+	for ( let i = 0; i < attributes.length; ++ i ) {
+
+		const attribute = attributes[ i ];
+
+		if ( TypedArray === undefined ) TypedArray = attribute.array.constructor;
+		if ( TypedArray !== attribute.array.constructor ) {
+
+			console.error( 'THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.array must be of consistent array types across matching attributes.' );
+			return null;
+
+		}
+
+		if ( itemSize === undefined ) itemSize = attribute.itemSize;
+		if ( itemSize !== attribute.itemSize ) {
+
+			console.error( 'THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.itemSize must be consistent across matching attributes.' );
+			return null;
+
+		}
+
+		if ( normalized === undefined ) normalized = attribute.normalized;
+		if ( normalized !== attribute.normalized ) {
+
+			console.error( 'THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.normalized must be consistent across matching attributes.' );
+			return null;
+
+		}
+
+		if ( gpuType === - 1 ) gpuType = attribute.gpuType;
+		if ( gpuType !== attribute.gpuType ) {
+
+			console.error( 'THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.gpuType must be consistent across matching attributes.' );
+			return null;
+
+		}
+
+		arrayLength += attribute.count * itemSize;
+
+	}
+
+	const array = new TypedArray( arrayLength );
+	const result = new BufferAttribute( array, itemSize, normalized );
+	let offset = 0;
+
+	for ( let i = 0; i < attributes.length; ++ i ) {
+
+		const attribute = attributes[ i ];
+		if ( attribute.isInterleavedBufferAttribute ) {
+
+			const tupleOffset = offset / itemSize;
+			for ( let j = 0, l = attribute.count; j < l; j ++ ) {
+
+				for ( let c = 0; c < itemSize; c ++ ) {
+
+					const value = attribute.getComponent( j, c );
+					result.setComponent( j + tupleOffset, c, value );
+
+				}
+
+			}
+
+		} else {
+
+			array.set( attribute.array, offset );
+
+		}
+
+		offset += attribute.count * itemSize;
+
+	}
+
+	if ( gpuType !== undefined ) {
+
+		result.gpuType = gpuType;
+
+	}
+
+	return result;
+
+}
+
+/**
+ * Performs a deep clone of the given buffer attribute.
+ *
+ * @param {BufferAttribute} attribute - The attribute to clone.
+ * @return {BufferAttribute} The cloned attribute.
+ */
+function deepCloneAttribute( attribute ) {
+
+	if ( attribute.isInstancedInterleavedBufferAttribute || attribute.isInterleavedBufferAttribute ) {
+
+		return deinterleaveAttribute( attribute );
+
+	}
+
+	if ( attribute.isInstancedBufferAttribute ) {
+
+		return new InstancedBufferAttribute().copy( attribute );
+
+	}
+
+	return new BufferAttribute().copy( attribute );
+
+}
+
+/**
+ * Interleaves a set of attributes and returns a new array of corresponding attributes that share a
+ * single {@link InterleavedBuffer} instance. All attributes must have compatible types.
+ *
+ * @param {Array<BufferAttribute>} attributes - The attributes to interleave.
+ * @return {?Array<InterleavedBufferAttribute>} An array of interleaved attributes. If interleave does not succeed, the method returns `null`.
+ */
+function interleaveAttributes( attributes ) {
+
+	// Interleaves the provided attributes into an InterleavedBuffer and returns
+	// a set of InterleavedBufferAttributes for each attribute
+	let TypedArray;
+	let arrayLength = 0;
+	let stride = 0;
+
+	// calculate the length and type of the interleavedBuffer
+	for ( let i = 0, l = attributes.length; i < l; ++ i ) {
+
+		const attribute = attributes[ i ];
+
+		if ( TypedArray === undefined ) TypedArray = attribute.array.constructor;
+		if ( TypedArray !== attribute.array.constructor ) {
+
+			console.error( 'AttributeBuffers of different types cannot be interleaved' );
+			return null;
+
+		}
+
+		arrayLength += attribute.array.length;
+		stride += attribute.itemSize;
+
+	}
+
+	// Create the set of buffer attributes
+	const interleavedBuffer = new InterleavedBuffer( new TypedArray( arrayLength ), stride );
+	let offset = 0;
+	const res = [];
+	const getters = [ 'getX', 'getY', 'getZ', 'getW' ];
+	const setters = [ 'setX', 'setY', 'setZ', 'setW' ];
+
+	for ( let j = 0, l = attributes.length; j < l; j ++ ) {
+
+		const attribute = attributes[ j ];
+		const itemSize = attribute.itemSize;
+		const count = attribute.count;
+		const iba = new InterleavedBufferAttribute( interleavedBuffer, itemSize, offset, attribute.normalized );
+		res.push( iba );
+
+		offset += itemSize;
+
+		// Move the data for each attribute into the new interleavedBuffer
+		// at the appropriate offset
+		for ( let c = 0; c < count; c ++ ) {
+
+			for ( let k = 0; k < itemSize; k ++ ) {
+
+				iba[ setters[ k ] ]( c, attribute[ getters[ k ] ]( c ) );
+
+			}
+
+		}
+
+	}
+
+	return res;
+
+}
+
+/**
+ * Returns a new, non-interleaved version of the given attribute.
+ *
+ * @param {InterleavedBufferAttribute} attribute - The interleaved attribute.
+ * @return {BufferAttribute} The non-interleaved attribute.
+ */
+function deinterleaveAttribute( attribute ) {
+
+	const cons = attribute.data.array.constructor;
+	const count = attribute.count;
+	const itemSize = attribute.itemSize;
+	const normalized = attribute.normalized;
+
+	const array = new cons( count * itemSize );
+	let newAttribute;
+	if ( attribute.isInstancedInterleavedBufferAttribute ) {
+
+		newAttribute = new InstancedBufferAttribute( array, itemSize, normalized, attribute.meshPerAttribute );
+
+	} else {
+
+		newAttribute = new BufferAttribute( array, itemSize, normalized );
+
+	}
+
+	for ( let i = 0; i < count; i ++ ) {
+
+		newAttribute.setX( i, attribute.getX( i ) );
+
+		if ( itemSize >= 2 ) {
+
+			newAttribute.setY( i, attribute.getY( i ) );
+
+		}
+
+		if ( itemSize >= 3 ) {
+
+			newAttribute.setZ( i, attribute.getZ( i ) );
+
+		}
+
+		if ( itemSize >= 4 ) {
+
+			newAttribute.setW( i, attribute.getW( i ) );
+
+		}
+
+	}
+
+	return newAttribute;
+
+}
+
+/**
+ * Deinterleaves all attributes on the given geometry.
+ *
+ * @param {BufferGeometry} geometry - The geometry to deinterleave.
+ */
+function deinterleaveGeometry( geometry ) {
+
+	const attributes = geometry.attributes;
+	const morphTargets = geometry.morphTargets;
+	const attrMap = new Map();
+
+	for ( const key in attributes ) {
+
+		const attr = attributes[ key ];
+		if ( attr.isInterleavedBufferAttribute ) {
+
+			if ( ! attrMap.has( attr ) ) {
+
+				attrMap.set( attr, deinterleaveAttribute( attr ) );
+
+			}
+
+			attributes[ key ] = attrMap.get( attr );
+
+		}
+
+	}
+
+	for ( const key in morphTargets ) {
+
+		const attr = morphTargets[ key ];
+		if ( attr.isInterleavedBufferAttribute ) {
+
+			if ( ! attrMap.has( attr ) ) {
+
+				attrMap.set( attr, deinterleaveAttribute( attr ) );
+
+			}
+
+			morphTargets[ key ] = attrMap.get( attr );
+
+		}
+
+	}
+
+}
+
+/**
+ * Returns the amount of bytes used by all attributes to represent the geometry.
+ *
+ * @param {BufferGeometry} geometry - The geometry.
+ * @return {number} The estimate bytes used.
+ */
+function estimateBytesUsed( geometry ) {
+
+	// Return the estimated memory used by this geometry in bytes
+	// Calculate using itemSize, count, and BYTES_PER_ELEMENT to account
+	// for InterleavedBufferAttributes.
+	let mem = 0;
+	for ( const name in geometry.attributes ) {
+
+		const attr = geometry.getAttribute( name );
+		mem += attr.count * attr.itemSize * attr.array.BYTES_PER_ELEMENT;
+
+	}
+
+	const indices = geometry.getIndex();
+	mem += indices ? indices.count * indices.itemSize * indices.array.BYTES_PER_ELEMENT : 0;
+	return mem;
+
+}
+
+/**
+ * Returns a new geometry with vertices for which all similar vertex attributes (within tolerance) are merged.
+ *
+ * @param {BufferGeometry} geometry - The geometry to merge vertices for.
+ * @param {number} [tolerance=1e-4] - The tolerance value.
+ * @return {BufferGeometry} - The new geometry with merged vertices.
+ */
+function mergeVertices( geometry, tolerance = 1e-4 ) {
+
+	tolerance = Math.max( tolerance, Number.EPSILON );
+
+	// Generate an index buffer if the geometry doesn't have one, or optimize it
+	// if it's already available.
+	const hashToIndex = {};
+	const indices = geometry.getIndex();
+	const positions = geometry.getAttribute( 'position' );
+	const vertexCount = indices ? indices.count : positions.count;
+
+	// next value for triangle indices
+	let nextIndex = 0;
+
+	// attributes and new attribute arrays
+	const attributeNames = Object.keys( geometry.attributes );
+	const tmpAttributes = {};
+	const tmpMorphAttributes = {};
+	const newIndices = [];
+	const getters = [ 'getX', 'getY', 'getZ', 'getW' ];
+	const setters = [ 'setX', 'setY', 'setZ', 'setW' ];
+
+	// Initialize the arrays, allocating space conservatively. Extra
+	// space will be trimmed in the last step.
+	for ( let i = 0, l = attributeNames.length; i < l; i ++ ) {
+
+		const name = attributeNames[ i ];
+		const attr = geometry.attributes[ name ];
+
+		tmpAttributes[ name ] = new attr.constructor(
+			new attr.array.constructor( attr.count * attr.itemSize ),
+			attr.itemSize,
+			attr.normalized
+		);
+
+		const morphAttributes = geometry.morphAttributes[ name ];
+		if ( morphAttributes ) {
+
+			if ( ! tmpMorphAttributes[ name ] ) tmpMorphAttributes[ name ] = [];
+			morphAttributes.forEach( ( morphAttr, i ) => {
+
+				const array = new morphAttr.array.constructor( morphAttr.count * morphAttr.itemSize );
+				tmpMorphAttributes[ name ][ i ] = new morphAttr.constructor( array, morphAttr.itemSize, morphAttr.normalized );
+
+			} );
+
+		}
+
+	}
+
+	// convert the error tolerance to an amount of decimal places to truncate to
+	const halfTolerance = tolerance * 0.5;
+	const exponent = Math.log10( 1 / tolerance );
+	const hashMultiplier = Math.pow( 10, exponent );
+	const hashAdditive = halfTolerance * hashMultiplier;
+	for ( let i = 0; i < vertexCount; i ++ ) {
+
+		const index = indices ? indices.getX( i ) : i;
+
+		// Generate a hash for the vertex attributes at the current index 'i'
+		let hash = '';
+		for ( let j = 0, l = attributeNames.length; j < l; j ++ ) {
+
+			const name = attributeNames[ j ];
+			const attribute = geometry.getAttribute( name );
+			const itemSize = attribute.itemSize;
+
+			for ( let k = 0; k < itemSize; k ++ ) {
+
+				// Math.trunc() preserves the full Number range, ~~ would wrap to int32
+				hash += `${ Math.trunc( attribute[ getters[ k ] ]( index ) * hashMultiplier + hashAdditive ) },`;
+
+			}
+
+		}
+
+		// Add another reference to the vertex if it's already
+		// used by another index
+		if ( hash in hashToIndex ) {
+
+			newIndices.push( hashToIndex[ hash ] );
+
+		} else {
+
+			// copy data to the new index in the temporary attributes
+			for ( let j = 0, l = attributeNames.length; j < l; j ++ ) {
+
+				const name = attributeNames[ j ];
+				const attribute = geometry.getAttribute( name );
+				const morphAttributes = geometry.morphAttributes[ name ];
+				const itemSize = attribute.itemSize;
+				const newArray = tmpAttributes[ name ];
+				const newMorphArrays = tmpMorphAttributes[ name ];
+
+				for ( let k = 0; k < itemSize; k ++ ) {
+
+					const getterFunc = getters[ k ];
+					const setterFunc = setters[ k ];
+					newArray[ setterFunc ]( nextIndex, attribute[ getterFunc ]( index ) );
+
+					if ( morphAttributes ) {
+
+						for ( let m = 0, ml = morphAttributes.length; m < ml; m ++ ) {
+
+							newMorphArrays[ m ][ setterFunc ]( nextIndex, morphAttributes[ m ][ getterFunc ]( index ) );
+
+						}
+
+					}
+
+				}
+
+			}
+
+			hashToIndex[ hash ] = nextIndex;
+			newIndices.push( nextIndex );
+			nextIndex ++;
+
+		}
+
+	}
+
+	// generate result BufferGeometry
+	const result = geometry.clone();
+	for ( const name in geometry.attributes ) {
+
+		const tmpAttribute = tmpAttributes[ name ];
+
+		result.setAttribute( name, new tmpAttribute.constructor(
+			tmpAttribute.array.slice( 0, nextIndex * tmpAttribute.itemSize ),
+			tmpAttribute.itemSize,
+			tmpAttribute.normalized,
+		) );
+
+		if ( ! ( name in tmpMorphAttributes ) ) continue;
+
+		for ( let j = 0; j < tmpMorphAttributes[ name ].length; j ++ ) {
+
+			const tmpMorphAttribute = tmpMorphAttributes[ name ][ j ];
+
+			result.morphAttributes[ name ][ j ] = new tmpMorphAttribute.constructor(
+				tmpMorphAttribute.array.slice( 0, nextIndex * tmpMorphAttribute.itemSize ),
+				tmpMorphAttribute.itemSize,
+				tmpMorphAttribute.normalized,
+			);
+
+		}
+
+	}
+
+	// indices
+
+	result.setIndex( newIndices );
+
+	return result;
+
+}
+
+/**
+ * Converts the given geometry to the `TrianglesDrawMode` draw mode, which
+ * corresponds to the `gl.TRIANGLES` primitive in WebGL. The conversion only
+ * rewrites the index, so the geometry is modified in place and returned.
+ *
+ * @param {BufferGeometry} geometry - The geometry to convert.
+ * @param {number} drawMode - The current draw mode.
+ * @return {BufferGeometry} The converted geometry using `TrianglesDrawMode`.
+ */
+function toTrianglesDrawMode( geometry, drawMode ) {
+
+	if ( drawMode === TrianglesDrawMode ) {
+
+		console.warn( 'THREE.BufferGeometryUtils.toTrianglesDrawMode(): Geometry already defined as triangles.' );
+		return geometry;
+
+	}
+
+	if ( drawMode === TriangleFanDrawMode || drawMode === TriangleStripDrawMode ) {
+
+		let index = geometry.getIndex();
+
+		// generate index if not present
+
+		if ( index === null ) {
+
+			const indices = [];
+
+			const position = geometry.getAttribute( 'position' );
+
+			if ( position !== undefined ) {
+
+				for ( let i = 0; i < position.count; i ++ ) {
+
+					indices.push( i );
+
+				}
+
+				geometry.setIndex( indices );
+				index = geometry.getIndex();
+
+			} else {
+
+				console.error( 'THREE.BufferGeometryUtils.toTrianglesDrawMode(): Undefined position attribute. Processing not possible.' );
+				return geometry;
+
+			}
+
+		}
+
+		//
+
+		const numberOfTriangles = index.count - 2;
+		const newIndices = [];
+
+		if ( drawMode === TriangleFanDrawMode ) {
+
+			// gl.TRIANGLE_FAN
+
+			for ( let i = 1; i <= numberOfTriangles; i ++ ) {
+
+				newIndices.push( index.getX( 0 ) );
+				newIndices.push( index.getX( i ) );
+				newIndices.push( index.getX( i + 1 ) );
+
+			}
+
+		} else {
+
+			// gl.TRIANGLE_STRIP
+
+			for ( let i = 0; i < numberOfTriangles; i ++ ) {
+
+				if ( i % 2 === 0 ) {
+
+					newIndices.push( index.getX( i ) );
+					newIndices.push( index.getX( i + 1 ) );
+					newIndices.push( index.getX( i + 2 ) );
+
+				} else {
+
+					newIndices.push( index.getX( i + 2 ) );
+					newIndices.push( index.getX( i + 1 ) );
+					newIndices.push( index.getX( i ) );
+
+				}
+
+			}
+
+		}
+
+		if ( ( newIndices.length / 3 ) !== numberOfTriangles ) {
+
+			console.error( 'THREE.BufferGeometryUtils.toTrianglesDrawMode(): Unable to generate correct amount of triangles.' );
+
+		}
+
+		// updated indices
+
+		geometry.setIndex( newIndices );
+		geometry.clearGroups();
+
+		return geometry;
+
+	} else {
+
+		console.error( 'THREE.BufferGeometryUtils.toTrianglesDrawMode(): Unknown draw mode:', drawMode );
+		return geometry;
+
+	}
+
+}
+
+/**
+ * Calculates the morphed attributes of a morphed/skinned BufferGeometry.
+ *
+ * Helpful for Raytracing or Decals (i.e. a `DecalGeometry` applied to a morphed Object with a `BufferGeometry`
+ * will use the original `BufferGeometry`, not the morphed/skinned one, generating an incorrect result.
+ * Using this function to create a shadow `Object3`D the `DecalGeometry` can be correctly generated).
+ *
+ * @param {Mesh|Line|Points} object - The 3D object to compute morph attributes for.
+ * @return {Object} An object with original position/normal attributes and morphed ones.
+ */
+function computeMorphedAttributes( object ) {
+
+	const _vA = new Vector3();
+	const _vB = new Vector3();
+	const _vC = new Vector3();
+
+	const _tempA = new Vector3();
+	const _tempB = new Vector3();
+	const _tempC = new Vector3();
+
+	const _morphA = new Vector3();
+	const _morphB = new Vector3();
+	const _morphC = new Vector3();
+
+	function _calculateMorphedAttributeData(
+		object,
+		attribute,
+		morphAttribute,
+		morphTargetsRelative,
+		a,
+		b,
+		c,
+		modifiedAttributeArray
+	) {
+
+		_vA.fromBufferAttribute( attribute, a );
+		_vB.fromBufferAttribute( attribute, b );
+		_vC.fromBufferAttribute( attribute, c );
+
+		const morphInfluences = object.morphTargetInfluences;
+
+		if ( morphAttribute && morphInfluences ) {
+
+			_morphA.set( 0, 0, 0 );
+			_morphB.set( 0, 0, 0 );
+			_morphC.set( 0, 0, 0 );
+
+			for ( let i = 0, il = morphAttribute.length; i < il; i ++ ) {
+
+				const influence = morphInfluences[ i ];
+				const morph = morphAttribute[ i ];
+
+				if ( influence === 0 ) continue;
+
+				_tempA.fromBufferAttribute( morph, a );
+				_tempB.fromBufferAttribute( morph, b );
+				_tempC.fromBufferAttribute( morph, c );
+
+				if ( morphTargetsRelative ) {
+
+					_morphA.addScaledVector( _tempA, influence );
+					_morphB.addScaledVector( _tempB, influence );
+					_morphC.addScaledVector( _tempC, influence );
+
+				} else {
+
+					_morphA.addScaledVector( _tempA.sub( _vA ), influence );
+					_morphB.addScaledVector( _tempB.sub( _vB ), influence );
+					_morphC.addScaledVector( _tempC.sub( _vC ), influence );
+
+				}
+
+			}
+
+			_vA.add( _morphA );
+			_vB.add( _morphB );
+			_vC.add( _morphC );
+
+		}
+
+		if ( object.isSkinnedMesh ) {
+
+			object.applyBoneTransform( a, _vA );
+			object.applyBoneTransform( b, _vB );
+			object.applyBoneTransform( c, _vC );
+
+		}
+
+		modifiedAttributeArray[ a * 3 + 0 ] = _vA.x;
+		modifiedAttributeArray[ a * 3 + 1 ] = _vA.y;
+		modifiedAttributeArray[ a * 3 + 2 ] = _vA.z;
+		modifiedAttributeArray[ b * 3 + 0 ] = _vB.x;
+		modifiedAttributeArray[ b * 3 + 1 ] = _vB.y;
+		modifiedAttributeArray[ b * 3 + 2 ] = _vB.z;
+		modifiedAttributeArray[ c * 3 + 0 ] = _vC.x;
+		modifiedAttributeArray[ c * 3 + 1 ] = _vC.y;
+		modifiedAttributeArray[ c * 3 + 2 ] = _vC.z;
+
+	}
+
+	const geometry = object.geometry;
+	const material = object.material;
+
+	let a, b, c;
+	const index = geometry.index;
+	const positionAttribute = geometry.attributes.position;
+	const morphPosition = geometry.morphAttributes.position;
+	const morphTargetsRelative = geometry.morphTargetsRelative;
+	const normalAttribute = geometry.attributes.normal;
+	const morphNormal = geometry.morphAttributes.normal;
+
+	const groups = geometry.groups;
+	const drawRange = geometry.drawRange;
+	let i, j, il, jl;
+	let group;
+	let start, end;
+
+	const modifiedPosition = new Float32Array( positionAttribute.count * positionAttribute.itemSize );
+	const modifiedNormal = new Float32Array( normalAttribute.count * normalAttribute.itemSize );
+
+	if ( index !== null ) {
+
+		// indexed buffer geometry
+
+		if ( Array.isArray( material ) ) {
+
+			for ( i = 0, il = groups.length; i < il; i ++ ) {
+
+				group = groups[ i ];
+
+				start = Math.max( group.start, drawRange.start );
+				end = Math.min( ( group.start + group.count ), ( drawRange.start + drawRange.count ) );
+
+				for ( j = start, jl = end; j < jl; j += 3 ) {
+
+					a = index.getX( j );
+					b = index.getX( j + 1 );
+					c = index.getX( j + 2 );
+
+					_calculateMorphedAttributeData(
+						object,
+						positionAttribute,
+						morphPosition,
+						morphTargetsRelative,
+						a, b, c,
+						modifiedPosition
+					);
+
+					_calculateMorphedAttributeData(
+						object,
+						normalAttribute,
+						morphNormal,
+						morphTargetsRelative,
+						a, b, c,
+						modifiedNormal
+					);
+
+				}
+
+			}
+
+		} else {
+
+			start = Math.max( 0, drawRange.start );
+			end = Math.min( index.count, ( drawRange.start + drawRange.count ) );
+
+			for ( i = start, il = end; i < il; i += 3 ) {
+
+				a = index.getX( i );
+				b = index.getX( i + 1 );
+				c = index.getX( i + 2 );
+
+				_calculateMorphedAttributeData(
+					object,
+					positionAttribute,
+					morphPosition,
+					morphTargetsRelative,
+					a, b, c,
+					modifiedPosition
+				);
+
+				_calculateMorphedAttributeData(
+					object,
+					normalAttribute,
+					morphNormal,
+					morphTargetsRelative,
+					a, b, c,
+					modifiedNormal
+				);
+
+			}
+
+		}
+
+	} else {
+
+		// non-indexed buffer geometry
+
+		if ( Array.isArray( material ) ) {
+
+			for ( i = 0, il = groups.length; i < il; i ++ ) {
+
+				group = groups[ i ];
+
+				start = Math.max( group.start, drawRange.start );
+				end = Math.min( ( group.start + group.count ), ( drawRange.start + drawRange.count ) );
+
+				for ( j = start, jl = end; j < jl; j += 3 ) {
+
+					a = j;
+					b = j + 1;
+					c = j + 2;
+
+					_calculateMorphedAttributeData(
+						object,
+						positionAttribute,
+						morphPosition,
+						morphTargetsRelative,
+						a, b, c,
+						modifiedPosition
+					);
+
+					_calculateMorphedAttributeData(
+						object,
+						normalAttribute,
+						morphNormal,
+						morphTargetsRelative,
+						a, b, c,
+						modifiedNormal
+					);
+
+				}
+
+			}
+
+		} else {
+
+			start = Math.max( 0, drawRange.start );
+			end = Math.min( positionAttribute.count, ( drawRange.start + drawRange.count ) );
+
+			for ( i = start, il = end; i < il; i += 3 ) {
+
+				a = i;
+				b = i + 1;
+				c = i + 2;
+
+				_calculateMorphedAttributeData(
+					object,
+					positionAttribute,
+					morphPosition,
+					morphTargetsRelative,
+					a, b, c,
+					modifiedPosition
+				);
+
+				_calculateMorphedAttributeData(
+					object,
+					normalAttribute,
+					morphNormal,
+					morphTargetsRelative,
+					a, b, c,
+					modifiedNormal
+				);
+
+			}
+
+		}
+
+	}
+
+	const morphedPositionAttribute = new Float32BufferAttribute( modifiedPosition, 3 );
+	const morphedNormalAttribute = new Float32BufferAttribute( modifiedNormal, 3 );
+
+	return {
+
+		positionAttribute: positionAttribute,
+		normalAttribute: normalAttribute,
+		morphedPositionAttribute: morphedPositionAttribute,
+		morphedNormalAttribute: morphedNormalAttribute
+
+	};
+
+}
+
+/**
+ * Merges the {@link BufferGeometry#groups} for the given geometry.
+ *
+ * @param {BufferGeometry} geometry - The geometry to modify.
+ * @return {BufferGeometry} - The updated geometry
+ */
+function mergeGroups( geometry ) {
+
+	if ( geometry.groups.length === 0 ) {
+
+		console.warn( 'THREE.BufferGeometryUtils.mergeGroups(): No groups are defined. Nothing to merge.' );
+		return geometry;
+
+	}
+
+	let groups = geometry.groups;
+
+	// sort groups by material index
+
+	groups = groups.sort( ( a, b ) => {
+
+		if ( a.materialIndex !== b.materialIndex ) return a.materialIndex - b.materialIndex;
+
+		return a.start - b.start;
+
+	} );
+
+	// create index for non-indexed geometries
+
+	if ( geometry.getIndex() === null ) {
+
+		const positionAttribute = geometry.getAttribute( 'position' );
+		const indices = [];
+
+		for ( let i = 0; i < positionAttribute.count; i += 3 ) {
+
+			indices.push( i, i + 1, i + 2 );
+
+		}
+
+		geometry.setIndex( indices );
+
+	}
+
+	// sort index
+
+	const index = geometry.getIndex();
+
+	const newIndices = [];
+
+	for ( let i = 0; i < groups.length; i ++ ) {
+
+		const group = groups[ i ];
+
+		const groupStart = group.start;
+		const groupLength = groupStart + group.count;
+
+		for ( let j = groupStart; j < groupLength; j ++ ) {
+
+			newIndices.push( index.getX( j ) );
+
+		}
+
+	}
+
+	geometry.dispose(); // Required to force buffer recreation
+	geometry.setIndex( newIndices );
+
+	// update groups indices
+
+	let start = 0;
+
+	for ( let i = 0; i < groups.length; i ++ ) {
+
+		const group = groups[ i ];
+
+		group.start = start;
+		start += group.count;
+
+	}
+
+	// merge groups
+
+	let currentGroup = groups[ 0 ];
+
+	geometry.groups = [ currentGroup ];
+
+	for ( let i = 1; i < groups.length; i ++ ) {
+
+		const group = groups[ i ];
+
+		if ( currentGroup.materialIndex === group.materialIndex ) {
+
+			currentGroup.count += group.count;
+
+		} else {
+
+			currentGroup = group;
+			geometry.groups.push( currentGroup );
+
+		}
+
+	}
+
+	return geometry;
+
+}
+
+/**
+ * Modifies the supplied geometry if it is non-indexed, otherwise creates a new,
+ * non-indexed geometry. Returns the geometry with smooth normals everywhere except
+ * faces that meet at an angle greater than the crease angle.
+ *
+ * @param {BufferGeometry} geometry - The geometry to modify.
+ * @param {number} [creaseAngle=Math.PI/3] - The crease angle in radians.
+ * @return {BufferGeometry} - The updated geometry
+ */
+function toCreasedNormals( geometry, creaseAngle = Math.PI / 3 /* 60 degrees */ ) {
+
+	// BufferGeometry.toNonIndexed() warns if the geometry is non-indexed
+	// and returns the original geometry
+	const resultGeometry = geometry.index ? geometry.toNonIndexed() : geometry;
+	const posAttr = resultGeometry.attributes.position;
+	const vertexCount = posAttr.count;
+
+	let positions;
+
+	if ( posAttr.isBufferAttribute === true && posAttr.itemSize === 3 && posAttr.normalized === false ) {
+
+		positions = posAttr.array;
+
+	} else {
+
+		// flatten the position buffer so the math below operates on plain numbers
+		positions = new Float64Array( vertexCount * 3 );
+
+		for ( let i = 0; i < vertexCount; i ++ ) {
+
+			positions[ 3 * i + 0 ] = posAttr.getX( i );
+			positions[ 3 * i + 1 ] = posAttr.getY( i );
+			positions[ 3 * i + 2 ] = posAttr.getZ( i );
+
+		}
+
+	}
+
+	const creaseDot = Math.cos( creaseAngle );
+	const hashMultiplier = ( 1 + 1e-10 ) * 1e2;
+	const faceCount = vertexCount / 3;
+
+	// compute the normal of each face
+	const faceNormals = new Float64Array( faceCount * 3 );
+	for ( let f = 0; f < faceCount; f ++ ) {
+
+		const f9 = 9 * f;
+		const ax = positions[ f9 + 0 ], ay = positions[ f9 + 1 ], az = positions[ f9 + 2 ];
+		const bx = positions[ f9 + 3 ], by = positions[ f9 + 4 ], bz = positions[ f9 + 5 ];
+		const cx = positions[ f9 + 6 ], cy = positions[ f9 + 7 ], cz = positions[ f9 + 8 ];
+
+		const v1x = cx - bx, v1y = cy - by, v1z = cz - bz;
+		const v2x = ax - bx, v2y = ay - by, v2z = az - bz;
+
+		const nx = v1y * v2z - v1z * v2y;
+		const ny = v1z * v2x - v1x * v2z;
+		const nz = v1x * v2y - v1y * v2x;
+
+		const invLength = 1 / ( Math.sqrt( nx * nx + ny * ny + nz * nz ) || 1 );
+		faceNormals[ 3 * f + 0 ] = nx * invLength;
+		faceNormals[ 3 * f + 1 ] = ny * invLength;
+		faceNormals[ 3 * f + 2 ] = nz * invLength;
+
+	}
+
+	// assign an id to each vertex, sharing the id between vertices with the same
+	// quantized position via an open-addressed hash table (slots hold id + 1, 0 means empty)
+	const vertexIds = new Int32Array( vertexCount );
+	const quantized = new Float64Array( vertexCount * 3 );
+
+	let tableSize = 1;
+	while ( tableSize < vertexCount * 2 ) tableSize <<= 1;
+	const tableMask = tableSize - 1;
+	const table = new Int32Array( tableSize );
+
+	let uniqueCount = 0;
+	for ( let i = 0; i < vertexCount; i ++ ) {
+
+		const i3 = 3 * i;
+		const qx = Math.trunc( positions[ i3 + 0 ] * hashMultiplier );
+		const qy = Math.trunc( positions[ i3 + 1 ] * hashMultiplier );
+		const qz = Math.trunc( positions[ i3 + 2 ] * hashMultiplier );
+
+		let slot = ( Math.imul( qx, 73856093 ) ^ Math.imul( qy, 19349663 ) ^ Math.imul( qz, 83492791 ) ) & tableMask;
+
+		while ( true ) {
+
+			const id = table[ slot ];
+
+			if ( id === 0 ) {
+
+				const q3 = 3 * uniqueCount;
+				quantized[ q3 + 0 ] = qx;
+				quantized[ q3 + 1 ] = qy;
+				quantized[ q3 + 2 ] = qz;
+
+				table[ slot ] = uniqueCount + 1;
+				vertexIds[ i ] = uniqueCount ++;
+				break;
+
+			}
+
+			const q3 = 3 * ( id - 1 );
+
+			if ( quantized[ q3 + 0 ] === qx && quantized[ q3 + 1 ] === qy && quantized[ q3 + 2 ] === qz ) {
+
+				vertexIds[ i ] = id - 1;
+				break;
+
+			}
+
+			slot = ( slot + 1 ) & tableMask;
+
+		}
+
+	}
+
+	// bucket the faces surrounding each unique vertex position
+	const bucketOffsets = new Int32Array( uniqueCount + 1 );
+	for ( let i = 0; i < vertexCount; i ++ ) bucketOffsets[ vertexIds[ i ] + 1 ] ++;
+	for ( let i = 0; i < uniqueCount; i ++ ) bucketOffsets[ i + 1 ] += bucketOffsets[ i ];
+
+	const bucketFaces = new Int32Array( vertexCount );
+	const bucketCursors = bucketOffsets.slice( 0, uniqueCount );
+	for ( let f = 0; f < faceCount; f ++ ) {
+
+		const f3 = 3 * f;
+		bucketFaces[ bucketCursors[ vertexIds[ f3 + 0 ] ] ++ ] = f;
+		bucketFaces[ bucketCursors[ vertexIds[ f3 + 1 ] ] ++ ] = f;
+		bucketFaces[ bucketCursors[ vertexIds[ f3 + 2 ] ] ++ ] = f;
+
+	}
+
+	// average the normals of the faces surrounding each vertex if they are within the
+	// provided crease threshold
+	const normalArray = new Float32Array( vertexCount * 3 );
+	for ( let f = 0; f < faceCount; f ++ ) {
+
+		const f3 = 3 * f;
+		const nx = faceNormals[ f3 + 0 ];
+		const ny = faceNormals[ f3 + 1 ];
+		const nz = faceNormals[ f3 + 2 ];
+
+		for ( let n = 0; n < 3; n ++ ) {
+
+			const i = f3 + n;
+			const id = vertexIds[ i ];
+
+			let sumX = 0, sumY = 0, sumZ = 0;
+
+			for ( let k = bucketOffsets[ id ], end = bucketOffsets[ id + 1 ]; k < end; k ++ ) {
+
+				const o3 = 3 * bucketFaces[ k ];
+				const ox = faceNormals[ o3 + 0 ];
+				const oy = faceNormals[ o3 + 1 ];
+				const oz = faceNormals[ o3 + 2 ];
+
+				if ( nx * ox + ny * oy + nz * oz > creaseDot ) {
+
+					sumX += ox;
+					sumY += oy;
+					sumZ += oz;
+
+				}
+
+			}
+
+			const invLength = 1 / ( Math.sqrt( sumX * sumX + sumY * sumY + sumZ * sumZ ) || 1 );
+			normalArray[ 3 * i + 0 ] = sumX * invLength;
+			normalArray[ 3 * i + 1 ] = sumY * invLength;
+			normalArray[ 3 * i + 2 ] = sumZ * invLength;
+
+		}
+
+	}
+
+	resultGeometry.setAttribute( 'normal', new BufferAttribute( normalArray, 3, false ) );
+	return resultGeometry;
+
+}
+
+export {
+	computeMikkTSpaceTangents,
+	mergeGeometries,
+	mergeAttributes,
+	deepCloneAttribute,
+	deinterleaveAttribute,
+	deinterleaveGeometry,
+	interleaveAttributes,
+	estimateBytesUsed,
+	mergeVertices,
+	toTrianglesDrawMode,
+	computeMorphedAttributes,
+	mergeGroups,
+	toCreasedNormals
+};
diff --git a/assets/three/index.js b/assets/three/index.js
new file mode 100644
index 00000000000..c52087acfab
--- /dev/null
+++ b/assets/three/index.js
@@ -0,0 +1,19719 @@
+/**
+ * @license
+ * Copyright 2010-2026 Three.js Authors
+ * SPDX-License-Identifier: MIT
+ */
+import { Matrix3, Vector2, Color, Vector3, mergeUniforms, CubeUVReflectionMapping, Mesh, BoxGeometry, ShaderMaterial, BackSide, cloneUniforms, Matrix4, ColorManagement, SRGBTransfer, PlaneGeometry, FrontSide, getUnlitUniformColorSpace, IntType, warn, HalfFloatType, UnsignedByteType, FloatType, RGBAFormat, Plane, CubeReflectionMapping, CubeRefractionMapping, BufferGeometry, OrthographicCamera, PerspectiveCamera, NoToneMapping, MeshBasicMaterial, NoBlending, WebGLRenderTarget, BufferAttribute, LinearSRGBColorSpace, LinearFilter, CubeTexture, LinearMipmapLinearFilter, CubeCamera, EquirectangularReflectionMapping, EquirectangularRefractionMapping, warnOnce, Uint32BufferAttribute, Uint16BufferAttribute, error, DataArrayTexture, Vector4, Float32BufferAttribute, RawShaderMaterial, CustomToneMapping, NeutralToneMapping, AgXToneMapping, ACESFilmicToneMapping, CineonToneMapping, ReinhardToneMapping, LinearToneMapping, Data3DTexture, GreaterEqualCompare, LessEqualCompare, DepthTexture, Texture, GLSL3, VSMShadowMap, PCFShadowMap, AddOperation, MixOperation, MultiplyOperation, LinearTransfer, UniformsUtils, DoubleSide, NormalBlending, TangentSpaceNormalMap, ObjectSpaceNormalMap, Layers, RGFormat, RG11_EAC_Format, RED_GREEN_RGTC2_Format, MeshDepthMaterial, MeshDistanceMaterial, PCFSoftShadowMap, DepthFormat, NearestFilter, CubeDepthTexture, UnsignedIntType, Frustum, LessEqualDepth, ReverseSubtractEquation, SubtractEquation, AddEquation, OneMinusConstantAlphaFactor, ConstantAlphaFactor, OneMinusConstantColorFactor, ConstantColorFactor, OneMinusDstAlphaFactor, OneMinusDstColorFactor, OneMinusSrcAlphaFactor, OneMinusSrcColorFactor, DstAlphaFactor, DstColorFactor, SrcAlphaSaturateFactor, SrcAlphaFactor, SrcColorFactor, OneFactor, ZeroFactor, NotEqualDepth, GreaterDepth, GreaterEqualDepth, EqualDepth, LessDepth, AlwaysDepth, NeverDepth, CullFaceNone, CullFaceBack, CullFaceFront, CustomBlending, MultiplyBlending, SubtractiveBlending, AdditiveBlending, ReversedDepthFuncs, MinEquation, MaxEquation, MirroredRepeatWrapping, ClampToEdgeWrapping, RepeatWrapping, LinearMipmapNearestFilter, NearestMipmapLinearFilter, NearestMipmapNearestFilter, NotEqualCompare, GreaterCompare, EqualCompare, LessCompare, AlwaysCompare, NeverCompare, NoColorSpace, DepthStencilFormat, getByteLength, UnsignedInt248Type, UnsignedShortType, createElementNS, UnsignedShort4444Type, UnsignedShort5551Type, UnsignedInt5999Type, UnsignedInt101111Type, ByteType, ShortType, AlphaFormat, RGBFormat, RedFormat, RedIntegerFormat, RGIntegerFormat, RGBAIntegerFormat, RGB_S3TC_DXT1_Format, RGBA_S3TC_DXT1_Format, RGBA_S3TC_DXT3_Format, RGBA_S3TC_DXT5_Format, RGB_PVRTC_4BPPV1_Format, RGB_PVRTC_2BPPV1_Format, RGBA_PVRTC_4BPPV1_Format, RGBA_PVRTC_2BPPV1_Format, RGB_ETC1_Format, RGB_ETC2_Format, RGBA_ETC2_EAC_Format, R11_EAC_Format, SIGNED_R11_EAC_Format, SIGNED_RG11_EAC_Format, RGBA_ASTC_4x4_Format, RGBA_ASTC_5x4_Format, RGBA_ASTC_5x5_Format, RGBA_ASTC_6x5_Format, RGBA_ASTC_6x6_Format, RGBA_ASTC_8x5_Format, RGBA_ASTC_8x6_Format, RGBA_ASTC_8x8_Format, RGBA_ASTC_10x5_Format, RGBA_ASTC_10x6_Format, RGBA_ASTC_10x8_Format, RGBA_ASTC_10x10_Format, RGBA_ASTC_12x10_Format, RGBA_ASTC_12x12_Format, RGBA_BPTC_Format, RGB_BPTC_SIGNED_Format, RGB_BPTC_UNSIGNED_Format, RED_RGTC1_Format, SIGNED_RED_RGTC1_Format, SIGNED_RED_GREEN_RGTC2_Format, ExternalTexture, EventDispatcher, ArrayCamera, WebXRController, RAD2DEG, DataTexture, createCanvasElement, SRGBColorSpace, REVISION, log, WebGLCoordinateSystem, probeAsync } from './three.core.js';
+export { AdditiveAnimationBlendMode, AlwaysStencilFunc, AmbientLight, AnimationAction, AnimationClip, AnimationLoader, AnimationMixer, AnimationObjectGroup, AnimationUtils, ArcCurve, ArrowHelper, AttachedBindMode, Audio, AudioAnalyser, AudioContext, AudioListener, AudioLoader, AxesHelper, BasicDepthPacking, BasicShadowMap, BatchedMesh, BezierInterpolant, Bone, BooleanKeyframeTrack, Box2, Box3, Box3Helper, BoxHelper, BufferGeometryLoader, Cache, Camera, CameraHelper, CanvasTexture, CapsuleGeometry, CatmullRomCurve3, CircleGeometry, Clock, ColorKeyframeTrack, Compatibility, CompressedArrayTexture, CompressedCubeTexture, CompressedTexture, CompressedTextureLoader, ConeGeometry, Controls, CubeTextureLoader, CubicBezierCurve, CubicBezierCurve3, CubicInterpolant, CullFaceFrontBack, Curve, CurvePath, CylinderGeometry, Cylindrical, DataTextureLoader, DataUtils, DecrementStencilOp, DecrementWrapStencilOp, DefaultLoadingManager, DetachedBindMode, DirectionalLight, DirectionalLightHelper, DiscreteInterpolant, DodecahedronGeometry, DynamicCopyUsage, DynamicDrawUsage, DynamicReadUsage, EdgesGeometry, EllipseCurve, EqualStencilFunc, Euler, ExtrudeGeometry, FileLoader, Float16BufferAttribute, Fog, FogExp2, FramebufferTexture, FrustumArray, GLBufferAttribute, GLSL1, GreaterEqualStencilFunc, GreaterStencilFunc, GridHelper, Group, HTMLTexture, HemisphereLight, HemisphereLightHelper, IcosahedronGeometry, ImageBitmapLoader, ImageLoader, ImageUtils, IncrementStencilOp, IncrementWrapStencilOp, InstancedBufferAttribute, InstancedBufferGeometry, InstancedInterleavedBuffer, InstancedMesh, Int16BufferAttribute, Int32BufferAttribute, Int8BufferAttribute, InterleavedBuffer, InterleavedBufferAttribute, Interpolant, InterpolateBezier, InterpolateDiscrete, InterpolateLinear, InterpolateSmooth, InterpolationSamplingMode, InterpolationSamplingType, InvertStencilOp, KeepStencilOp, KeyframeTrack, LOD, LatheGeometry, LessEqualStencilFunc, LessStencilFunc, Light, LightProbe, LightShadow, Line, Line3, LineBasicMaterial, LineCurve, LineCurve3, LineDashedMaterial, LineLoop, LineSegments, LinearInterpolant, LinearMipMapLinearFilter, LinearMipMapNearestFilter, Loader, LoaderUtils, LoadingManager, LoopOnce, LoopPingPong, LoopRepeat, MOUSE, Material, MaterialBlending, MaterialLoader, MathUtils, Matrix2, MeshLambertMaterial, MeshMatcapMaterial, MeshNormalMaterial, MeshPhongMaterial, MeshPhysicalMaterial, MeshStandardMaterial, MeshToonMaterial, NearestMipMapLinearFilter, NearestMipMapNearestFilter, NeverStencilFunc, NoNormalPacking, NormalAnimationBlendMode, NormalGAPacking, NormalRGPacking, NotEqualStencilFunc, NumberKeyframeTrack, Object3D, ObjectLoader, OctahedronGeometry, Path, PlaneHelper, PointLight, PointLightHelper, Points, PointsMaterial, PolarGridHelper, PolyhedronGeometry, PositionalAudio, PropertyBinding, PropertyMixer, QuadraticBezierCurve, QuadraticBezierCurve3, Quaternion, QuaternionKeyframeTrack, QuaternionLinearInterpolant, RGBADepthPacking, RGBDepthPacking, RGBIntegerFormat, RGDepthPacking, Ray, Raycaster, RectAreaLight, RenderObjectRefreshType, RenderTarget, RenderTarget3D, ReplaceStencilOp, RingGeometry, Scene, ShadowMaterial, Shape, ShapeGeometry, ShapePath, ShapeUtils, Skeleton, SkeletonHelper, SkinnedMesh, Source, Sphere, SphereGeometry, Spherical, SphericalHarmonics3, SplineCurve, SpotLight, SpotLightHelper, Sprite, SpriteMaterial, StaticCopyUsage, StaticDrawUsage, StaticReadUsage, StereoCamera, StreamCopyUsage, StreamDrawUsage, StreamReadUsage, StringKeyframeTrack, TOUCH, TetrahedronGeometry, TextureLoader, TextureSource, TextureUtils, Timer, TimestampQuery, TorusGeometry, TorusKnotGeometry, Triangle, TriangleFanDrawMode, TriangleStripDrawMode, TrianglesDrawMode, TubeGeometry, UVMapping, Uint8BufferAttribute, Uint8ClampedBufferAttribute, Uniform, UniformsGroup, VectorKeyframeTrack, VideoFrameTexture, VideoTexture, WebGL3DRenderTarget, WebGLArrayRenderTarget, WebGPUCoordinateSystem, WireframeGeometry, WrapAroundEnding, ZeroCurvatureEnding, ZeroSlopeEnding, ZeroStencilOp, getConsoleFunction, setConsoleFunction } from './three.core.js';
+
+function WebGLAnimation() {
+
+	let context = null;
+	let isAnimating = false;
+	let animationLoop = null;
+	let requestId = null;
+
+	function onAnimationFrame( time, frame ) {
+
+		requestId = context.requestAnimationFrame( onAnimationFrame );
+
+		animationLoop( time, frame );
+
+	}
+
+	return {
+
+		start: function () {
+
+			if ( isAnimating === true ) return;
+			if ( animationLoop === null ) return;
+			if ( context === null ) return;
+
+			requestId = context.requestAnimationFrame( onAnimationFrame );
+
+			isAnimating = true;
+
+		},
+
+		stop: function () {
+
+			if ( context !== null ) context.cancelAnimationFrame( requestId );
+
+			isAnimating = false;
+
+		},
+
+		setAnimationLoop: function ( callback ) {
+
+			animationLoop = callback;
+
+		},
+
+		setContext: function ( value ) {
+
+			context = value;
+
+		}
+
+	};
+
+}
+
+function WebGLAttributes( gl ) {
+
+	const buffers = new WeakMap();
+
+	function createBuffer( attribute, bufferType ) {
+
+		const array = attribute.array;
+		const usage = attribute.usage;
+		const size = array.byteLength;
+
+		const buffer = gl.createBuffer();
+
+		gl.bindBuffer( bufferType, buffer );
+		gl.bufferData( bufferType, array, usage );
+
+		attribute.onUploadCallback();
+
+		let type;
+
+		if ( array instanceof Float32Array ) {
+
+			type = gl.FLOAT;
+
+		} else if ( typeof Float16Array !== 'undefined' && array instanceof Float16Array ) {
+
+			type = gl.HALF_FLOAT;
+
+		} else if ( array instanceof Uint16Array ) {
+
+			if ( attribute.isFloat16BufferAttribute ) {
+
+				type = gl.HALF_FLOAT;
+
+			} else {
+
+				type = gl.UNSIGNED_SHORT;
+
+			}
+
+		} else if ( array instanceof Int16Array ) {
+
+			type = gl.SHORT;
+
+		} else if ( array instanceof Uint32Array ) {
+
+			type = gl.UNSIGNED_INT;
+
+		} else if ( array instanceof Int32Array ) {
+
+			type = gl.INT;
+
+		} else if ( array instanceof Int8Array ) {
+
+			type = gl.BYTE;
+
+		} else if ( array instanceof Uint8Array ) {
+
+			type = gl.UNSIGNED_BYTE;
+
+		} else if ( array instanceof Uint8ClampedArray ) {
+
+			type = gl.UNSIGNED_BYTE;
+
+		} else {
+
+			throw new Error( 'THREE.WebGLAttributes: Unsupported buffer data format: ' + array );
+
+		}
+
+		return {
+			buffer: buffer,
+			type: type,
+			bytesPerElement: array.BYTES_PER_ELEMENT,
+			version: attribute.version,
+			size: size
+		};
+
+	}
+
+	function updateBuffer( buffer, attribute, bufferType ) {
+
+		const array = attribute.array;
+		const updateRanges = attribute.updateRanges;
+
+		gl.bindBuffer( bufferType, buffer );
+
+		if ( updateRanges.length === 0 ) {
+
+			// Not using update ranges
+			gl.bufferSubData( bufferType, 0, array );
+
+		} else {
+
+			// Before applying update ranges, we merge any adjacent / overlapping
+			// ranges to reduce load on `gl.bufferSubData`. Empirically, this has led
+			// to performance improvements for applications which make heavy use of
+			// update ranges. Likely due to GPU command overhead.
+			//
+			// Note that to reduce garbage collection between frames, we merge the
+			// update ranges in-place. This is safe because this method will clear the
+			// update ranges once updated.
+
+			updateRanges.sort( ( a, b ) => a.start - b.start );
+
+			// To merge the update ranges in-place, we work from left to right in the
+			// existing updateRanges array, merging ranges. This may result in a final
+			// array which is smaller than the original. This index tracks the last
+			// index representing a merged range, any data after this index can be
+			// trimmed once the merge algorithm is completed.
+			let mergeIndex = 0;
+
+			for ( let i = 1; i < updateRanges.length; i ++ ) {
+
+				const previousRange = updateRanges[ mergeIndex ];
+				const range = updateRanges[ i ];
+
+				// We add one here to merge adjacent ranges. This is safe because ranges
+				// operate over positive integers.
+				if ( range.start <= previousRange.start + previousRange.count + 1 ) {
+
+					previousRange.count = Math.max(
+						previousRange.count,
+						range.start + range.count - previousRange.start
+					);
+
+				} else {
+
+					++ mergeIndex;
+					updateRanges[ mergeIndex ] = range;
+
+				}
+
+			}
+
+			// Trim the array to only contain the merged ranges.
+			updateRanges.length = mergeIndex + 1;
+
+			for ( let i = 0, l = updateRanges.length; i < l; i ++ ) {
+
+				const range = updateRanges[ i ];
+
+				gl.bufferSubData( bufferType, range.start * array.BYTES_PER_ELEMENT,
+					array, range.start, range.count );
+
+			}
+
+			attribute.clearUpdateRanges();
+
+		}
+
+		attribute.onUploadCallback();
+
+	}
+
+	//
+
+	function get( attribute ) {
+
+		if ( attribute.isInterleavedBufferAttribute ) attribute = attribute.data;
+
+		return buffers.get( attribute );
+
+	}
+
+	function remove( attribute ) {
+
+		if ( attribute.isInterleavedBufferAttribute ) attribute = attribute.data;
+
+		const data = buffers.get( attribute );
+
+		if ( data ) {
+
+			gl.deleteBuffer( data.buffer );
+
+			buffers.delete( attribute );
+
+		}
+
+	}
+
+	function update( attribute, bufferType ) {
+
+		if ( attribute.isInterleavedBufferAttribute ) attribute = attribute.data;
+
+		if ( attribute.isGLBufferAttribute ) {
+
+			const cached = buffers.get( attribute );
+
+			if ( ! cached || cached.version < attribute.version ) {
+
+				buffers.set( attribute, {
+					buffer: attribute.buffer,
+					type: attribute.type,
+					bytesPerElement: attribute.elementSize,
+					version: attribute.version
+				} );
+
+			}
+
+			return;
+
+		}
+
+		const data = buffers.get( attribute );
+
+		if ( data === undefined ) {
+
+			buffers.set( attribute, createBuffer( attribute, bufferType ) );
+
+		} else if ( data.version < attribute.version ) {
+
+			if ( data.size !== attribute.array.byteLength ) {
+
+				throw new Error( 'THREE.WebGLAttributes: The size of the buffer attribute\'s array buffer does not match the original size. Resizing buffer attributes is not supported.' );
+
+			}
+
+			updateBuffer( data.buffer, attribute, bufferType );
+
+			data.version = attribute.version;
+
+		}
+
+	}
+
+	return {
+
+		get: get,
+		remove: remove,
+		update: update
+
+	};
+
+}
+
+var alphahash_fragment = "#ifdef USE_ALPHAHASH\n\tif ( diffuseColor.a < getAlphaHashThreshold( vPosition ) ) discard;\n#endif";
+
+var alphahash_pars_fragment = "#ifdef USE_ALPHAHASH\n\tconst float ALPHA_HASH_SCALE = 0.05;\n\tfloat hash2D( vec2 value ) {\n\t\treturn fract( 1.0e4 * sin( 17.0 * value.x + 0.1 * value.y ) * ( 0.1 + abs( sin( 13.0 * value.y + value.x ) ) ) );\n\t}\n\tfloat hash3D( vec3 value ) {\n\t\treturn hash2D( vec2( hash2D( value.xy ), value.z ) );\n\t}\n\tfloat getAlphaHashThreshold( vec3 position ) {\n\t\tfloat maxDeriv = max(\n\t\t\tlength( dFdx( position.xyz ) ),\n\t\t\tlength( dFdy( position.xyz ) )\n\t\t);\n\t\tfloat pixScale = 1.0 / ( ALPHA_HASH_SCALE * maxDeriv );\n\t\tvec2 pixScales = vec2(\n\t\t\texp2( floor( log2( pixScale ) ) ),\n\t\t\texp2( ceil( log2( pixScale ) ) )\n\t\t);\n\t\tvec2 alpha = vec2(\n\t\t\thash3D( floor( pixScales.x * position.xyz ) ),\n\t\t\thash3D( floor( pixScales.y * position.xyz ) )\n\t\t);\n\t\tfloat lerpFactor = fract( log2( pixScale ) );\n\t\tfloat x = ( 1.0 - lerpFactor ) * alpha.x + lerpFactor * alpha.y;\n\t\tfloat a = min( lerpFactor, 1.0 - lerpFactor );\n\t\tvec3 cases = vec3(\n\t\t\tx * x / ( 2.0 * a * ( 1.0 - a ) ),\n\t\t\t( x - 0.5 * a ) / ( 1.0 - a ),\n\t\t\t1.0 - ( ( 1.0 - x ) * ( 1.0 - x ) / ( 2.0 * a * ( 1.0 - a ) ) )\n\t\t);\n\t\tfloat threshold = ( x < ( 1.0 - a ) )\n\t\t\t? ( ( x < a ) ? cases.x : cases.y )\n\t\t\t: cases.z;\n\t\treturn clamp( threshold , 1.0e-6, 1.0 );\n\t}\n#endif";
+
+var alphamap_fragment = "#ifdef USE_ALPHAMAP\n\tdiffuseColor.a *= texture2D( alphaMap, vAlphaMapUv ).g;\n#endif";
+
+var alphamap_pars_fragment = "#ifdef USE_ALPHAMAP\n\tuniform sampler2D alphaMap;\n#endif";
+
+var alphatest_fragment = "#ifdef USE_ALPHATEST\n\t#ifdef ALPHA_TO_COVERAGE\n\tdiffuseColor.a = smoothstep( alphaTest, alphaTest + fwidth( diffuseColor.a ), diffuseColor.a );\n\tif ( diffuseColor.a == 0.0 ) discard;\n\t#else\n\tif ( diffuseColor.a < alphaTest ) discard;\n\t#endif\n#endif";
+
+var alphatest_pars_fragment = "#ifdef USE_ALPHATEST\n\tuniform float alphaTest;\n#endif";
+
+var aomap_fragment = "#ifdef USE_AOMAP\n\tfloat ambientOcclusion = ( texture2D( aoMap, vAoMapUv ).r - 1.0 ) * aoMapIntensity + 1.0;\n\treflectedLight.indirectDiffuse *= ambientOcclusion;\n\t#if defined( USE_CLEARCOAT ) \n\t\tclearcoatSpecularIndirect *= ambientOcclusion;\n\t#endif\n\t#if defined( USE_SHEEN ) \n\t\tsheenSpecularIndirect *= ambientOcclusion;\n\t#endif\n\t#if defined( USE_ENVMAP ) && defined( STANDARD )\n\t\tfloat dotNV = saturate( dot( geometryNormal, geometryViewDir ) );\n\t\treflectedLight.indirectSpecular *= computeSpecularOcclusion( dotNV, ambientOcclusion, material.roughness );\n\t#endif\n#endif";
+
+var aomap_pars_fragment = "#ifdef USE_AOMAP\n\tuniform sampler2D aoMap;\n\tuniform float aoMapIntensity;\n#endif";
+
+var batching_pars_vertex = "#ifdef USE_BATCHING\n\t#if ! defined( GL_ANGLE_multi_draw )\n\t#define gl_DrawID _gl_DrawID\n\tuniform int _gl_DrawID;\n\t#endif\n\tuniform highp sampler2D batchingTexture;\n\tuniform highp usampler2D batchingIdTexture;\n\tmat4 getBatchingMatrix( const in float i ) {\n\t\tint size = textureSize( batchingTexture, 0 ).x;\n\t\tint j = int( i ) * 4;\n\t\tint x = j % size;\n\t\tint y = j / size;\n\t\tvec4 v1 = texelFetch( batchingTexture, ivec2( x, y ), 0 );\n\t\tvec4 v2 = texelFetch( batchingTexture, ivec2( x + 1, y ), 0 );\n\t\tvec4 v3 = texelFetch( batchingTexture, ivec2( x + 2, y ), 0 );\n\t\tvec4 v4 = texelFetch( batchingTexture, ivec2( x + 3, y ), 0 );\n\t\treturn mat4( v1, v2, v3, v4 );\n\t}\n\tfloat getIndirectIndex( const in int i ) {\n\t\tint size = textureSize( batchingIdTexture, 0 ).x;\n\t\tint x = i % size;\n\t\tint y = i / size;\n\t\treturn float( texelFetch( batchingIdTexture, ivec2( x, y ), 0 ).r );\n\t}\n#endif\n#ifdef USE_BATCHING_COLOR\n\tuniform sampler2D batchingColorTexture;\n\tvec4 getBatchingColor( const in float i ) {\n\t\tint size = textureSize( batchingColorTexture, 0 ).x;\n\t\tint j = int( i );\n\t\tint x = j % size;\n\t\tint y = j / size;\n\t\treturn texelFetch( batchingColorTexture, ivec2( x, y ), 0 );\n\t}\n#endif";
+
+var batching_vertex = "#ifdef USE_BATCHING\n\tmat4 batchingMatrix = getBatchingMatrix( getIndirectIndex( gl_DrawID ) );\n#endif";
+
+var begin_vertex = "vec3 transformed = vec3( position );\n#ifdef USE_ALPHAHASH\n\tvPosition = vec3( position );\n#endif";
+
+var beginnormal_vertex = "vec3 objectNormal = vec3( normal );\n#ifdef USE_TANGENT\n\tvec3 objectTangent = vec3( tangent.xyz );\n#endif";
+
+var bsdfs = "float G_BlinnPhong_Implicit( ) {\n\treturn 0.25;\n}\nfloat D_BlinnPhong( const in float shininess, const in float dotNH ) {\n\treturn RECIPROCAL_PI * ( shininess * 0.5 + 1.0 ) * pow( dotNH, shininess );\n}\nvec3 BRDF_BlinnPhong( const in vec3 lightDir, const in vec3 viewDir, const in vec3 normal, const in vec3 specularColor, const in float shininess ) {\n\tvec3 halfDir = normalize( lightDir + viewDir );\n\tfloat dotNH = saturate( dot( normal, halfDir ) );\n\tfloat dotVH = saturate( dot( viewDir, halfDir ) );\n\tvec3 F = F_Schlick( specularColor, 1.0, dotVH );\n\tfloat G = G_BlinnPhong_Implicit( );\n\tfloat D = D_BlinnPhong( shininess, dotNH );\n\treturn F * ( G * D );\n} // validated";
+
+var iridescence_fragment = "#ifdef USE_IRIDESCENCE\n\tconst mat3 XYZ_TO_REC709 = mat3(\n\t\t 3.2404542, -0.9692660,  0.0556434,\n\t\t-1.5371385,  1.8760108, -0.2040259,\n\t\t-0.4985314,  0.0415560,  1.0572252\n\t);\n\tvec3 Fresnel0ToIor( vec3 fresnel0 ) {\n\t\tvec3 sqrtF0 = sqrt( fresnel0 );\n\t\treturn ( vec3( 1.0 ) + sqrtF0 ) / ( vec3( 1.0 ) - sqrtF0 );\n\t}\n\tvec3 IorToFresnel0( vec3 transmittedIor, float incidentIor ) {\n\t\treturn pow2( ( transmittedIor - vec3( incidentIor ) ) / ( transmittedIor + vec3( incidentIor ) ) );\n\t}\n\tfloat IorToFresnel0( float transmittedIor, float incidentIor ) {\n\t\treturn pow2( ( transmittedIor - incidentIor ) / ( transmittedIor + incidentIor ));\n\t}\n\tvec3 evalSensitivity( float OPD, vec3 shift ) {\n\t\tfloat phase = 2.0 * PI * OPD * 1.0e-9;\n\t\tvec3 val = vec3( 5.4856e-13, 4.4201e-13, 5.2481e-13 );\n\t\tvec3 pos = vec3( 1.6810e+06, 1.7953e+06, 2.2084e+06 );\n\t\tvec3 var = vec3( 4.3278e+09, 9.3046e+09, 6.6121e+09 );\n\t\tvec3 xyz = val * sqrt( 2.0 * PI * var ) * cos( pos * phase + shift ) * exp( - pow2( phase ) * var );\n\t\txyz.x += 9.7470e-14 * sqrt( 2.0 * PI * 4.5282e+09 ) * cos( 2.2399e+06 * phase + shift[ 0 ] ) * exp( - 4.5282e+09 * pow2( phase ) );\n\t\txyz /= 1.0685e-7;\n\t\tvec3 rgb = XYZ_TO_REC709 * xyz;\n\t\treturn rgb;\n\t}\n\tvec3 evalIridescence( float outsideIOR, float eta2, float cosTheta1, float thinFilmThickness, vec3 baseF0 ) {\n\t\tvec3 I;\n\t\tfloat iridescenceIOR = mix( outsideIOR, eta2, smoothstep( 0.0, 0.03, thinFilmThickness ) );\n\t\tfloat sinTheta2Sq = pow2( outsideIOR / iridescenceIOR ) * ( 1.0 - pow2( cosTheta1 ) );\n\t\tfloat cosTheta2Sq = 1.0 - sinTheta2Sq;\n\t\tif ( cosTheta2Sq < 0.0 ) {\n\t\t\treturn vec3( 1.0 );\n\t\t}\n\t\tfloat cosTheta2 = sqrt( cosTheta2Sq );\n\t\tfloat R0 = IorToFresnel0( iridescenceIOR, outsideIOR );\n\t\tfloat R12 = F_Schlick( R0, 1.0, cosTheta1 );\n\t\tfloat T121 = 1.0 - R12;\n\t\tfloat phi12 = 0.0;\n\t\tif ( iridescenceIOR < outsideIOR ) phi12 = PI;\n\t\tfloat phi21 = PI - phi12;\n\t\tvec3 baseIOR = Fresnel0ToIor( clamp( baseF0, 0.0, 0.9999 ) );\t\tvec3 R1 = IorToFresnel0( baseIOR, iridescenceIOR );\n\t\tvec3 R23 = F_Schlick( R1, 1.0, cosTheta2 );\n\t\tvec3 phi23 = vec3( 0.0 );\n\t\tif ( baseIOR[ 0 ] < iridescenceIOR ) phi23[ 0 ] = PI;\n\t\tif ( baseIOR[ 1 ] < iridescenceIOR ) phi23[ 1 ] = PI;\n\t\tif ( baseIOR[ 2 ] < iridescenceIOR ) phi23[ 2 ] = PI;\n\t\tfloat OPD = 2.0 * iridescenceIOR * thinFilmThickness * cosTheta2;\n\t\tvec3 phi = vec3( phi21 ) + phi23;\n\t\tvec3 R123 = clamp( R12 * R23, 1e-5, 0.9999 );\n\t\tvec3 r123 = sqrt( R123 );\n\t\tvec3 Rs = pow2( T121 ) * R23 / ( vec3( 1.0 ) - R123 );\n\t\tvec3 C0 = R12 + Rs;\n\t\tI = C0;\n\t\tvec3 Cm = Rs - T121;\n\t\tfor ( int m = 1; m <= 2; ++ m ) {\n\t\t\tCm *= r123;\n\t\t\tvec3 Sm = 2.0 * evalSensitivity( float( m ) * OPD, float( m ) * phi );\n\t\t\tI += Cm * Sm;\n\t\t}\n\t\treturn max( I, vec3( 0.0 ) );\n\t}\n#endif";
+
+var bumpmap_pars_fragment = "#ifdef USE_BUMPMAP\n\tuniform sampler2D bumpMap;\n\tuniform float bumpScale;\n\tvec2 dHdxy_fwd() {\n\t\tvec2 dSTdx = dFdx( vBumpMapUv );\n\t\tvec2 dSTdy = dFdy( vBumpMapUv );\n\t\tfloat Hll = bumpScale * texture2D( bumpMap, vBumpMapUv ).x;\n\t\tfloat dBx = bumpScale * texture2D( bumpMap, vBumpMapUv + dSTdx ).x - Hll;\n\t\tfloat dBy = bumpScale * texture2D( bumpMap, vBumpMapUv + dSTdy ).x - Hll;\n\t\treturn vec2( dBx, dBy );\n\t}\n\tvec3 perturbNormalArb( vec3 surf_pos, vec3 surf_norm, vec2 dHdxy, float faceDirection ) {\n\t\tvec3 vSigmaX = normalize( dFdx( surf_pos.xyz ) );\n\t\tvec3 vSigmaY = normalize( dFdy( surf_pos.xyz ) );\n\t\tvec3 vN = surf_norm;\n\t\tvec3 R1 = cross( vSigmaY, vN );\n\t\tvec3 R2 = cross( vN, vSigmaX );\n\t\tfloat fDet = dot( vSigmaX, R1 ) * faceDirection;\n\t\tvec3 vGrad = sign( fDet ) * ( dHdxy.x * R1 + dHdxy.y * R2 );\n\t\treturn normalize( abs( fDet ) * surf_norm - vGrad );\n\t}\n#endif";
+
+var clipping_planes_fragment = "#if NUM_CLIPPING_PLANES > 0\n\tvec4 plane;\n\t#ifdef ALPHA_TO_COVERAGE\n\t\tfloat distanceToPlane, distanceGradient;\n\t\tfloat clipOpacity = 1.0;\n\t\t#pragma unroll_loop_start\n\t\tfor ( int i = 0; i < UNION_CLIPPING_PLANES; i ++ ) {\n\t\t\tplane = clippingPlanes[ i ];\n\t\t\tdistanceToPlane = - dot( vClipPosition, plane.xyz ) + plane.w;\n\t\t\tdistanceGradient = fwidth( distanceToPlane ) / 2.0;\n\t\t\tclipOpacity *= smoothstep( - distanceGradient, distanceGradient, distanceToPlane );\n\t\t\tif ( clipOpacity == 0.0 ) discard;\n\t\t}\n\t\t#pragma unroll_loop_end\n\t\t#if UNION_CLIPPING_PLANES < NUM_CLIPPING_PLANES\n\t\t\tfloat unionClipOpacity = 1.0;\n\t\t\t#pragma unroll_loop_start\n\t\t\tfor ( int i = UNION_CLIPPING_PLANES; i < NUM_CLIPPING_PLANES; i ++ ) {\n\t\t\t\tplane = clippingPlanes[ i ];\n\t\t\t\tdistanceToPlane = - dot( vClipPosition, plane.xyz ) + plane.w;\n\t\t\t\tdistanceGradient = fwidth( distanceToPlane ) / 2.0;\n\t\t\t\tunionClipOpacity *= 1.0 - smoothstep( - distanceGradient, distanceGradient, distanceToPlane );\n\t\t\t}\n\t\t\t#pragma unroll_loop_end\n\t\t\tclipOpacity *= 1.0 - unionClipOpacity;\n\t\t#endif\n\t\tdiffuseColor.a *= clipOpacity;\n\t\tif ( diffuseColor.a == 0.0 ) discard;\n\t#else\n\t\t#pragma unroll_loop_start\n\t\tfor ( int i = 0; i < UNION_CLIPPING_PLANES; i ++ ) {\n\t\t\tplane = clippingPlanes[ i ];\n\t\t\tif ( dot( vClipPosition, plane.xyz ) > plane.w ) discard;\n\t\t}\n\t\t#pragma unroll_loop_end\n\t\t#if UNION_CLIPPING_PLANES < NUM_CLIPPING_PLANES\n\t\t\tbool clipped = true;\n\t\t\t#pragma unroll_loop_start\n\t\t\tfor ( int i = UNION_CLIPPING_PLANES; i < NUM_CLIPPING_PLANES; i ++ ) {\n\t\t\t\tplane = clippingPlanes[ i ];\n\t\t\t\tclipped = ( dot( vClipPosition, plane.xyz ) > plane.w ) && clipped;\n\t\t\t}\n\t\t\t#pragma unroll_loop_end\n\t\t\tif ( clipped ) discard;\n\t\t#endif\n\t#endif\n#endif";
+
+var clipping_planes_pars_fragment = "#if NUM_CLIPPING_PLANES > 0\n\tvarying vec3 vClipPosition;\n\tuniform vec4 clippingPlanes[ NUM_CLIPPING_PLANES ];\n#endif";
+
+var clipping_planes_pars_vertex = "#if NUM_CLIPPING_PLANES > 0\n\tvarying vec3 vClipPosition;\n#endif";
+
+var clipping_planes_vertex = "#if NUM_CLIPPING_PLANES > 0\n\tvClipPosition = - mvPosition.xyz;\n#endif";
+
+var color_fragment = "#if defined( USE_COLOR ) || defined( USE_COLOR_ALPHA )\n\tdiffuseColor *= vColor;\n#endif";
+
+var color_pars_fragment = "#if defined( USE_COLOR ) || defined( USE_COLOR_ALPHA )\n\tvarying vec4 vColor;\n#endif";
+
+var color_pars_vertex = "#if defined( USE_COLOR ) || defined( USE_COLOR_ALPHA ) || defined( USE_INSTANCING_COLOR ) || defined( USE_BATCHING_COLOR )\n\tvarying vec4 vColor;\n#endif";
+
+var color_vertex = "#if defined( USE_COLOR ) || defined( USE_COLOR_ALPHA ) || defined( USE_INSTANCING_COLOR ) || defined( USE_BATCHING_COLOR )\n\tvColor = vec4( 1.0 );\n#endif\n#ifdef USE_COLOR_ALPHA\n\tvColor *= color;\n#elif defined( USE_COLOR )\n\tvColor.rgb *= color;\n#endif\n#ifdef USE_INSTANCING_COLOR\n\tvColor.rgb *= instanceColor.rgb;\n#endif\n#ifdef USE_BATCHING_COLOR\n\tvColor *= getBatchingColor( getIndirectIndex( gl_DrawID ) );\n#endif";
+
+var common = "#define PI 3.141592653589793\n#define PI2 6.283185307179586\n#define PI_HALF 1.5707963267948966\n#define RECIPROCAL_PI 0.3183098861837907\n#define RECIPROCAL_PI2 0.15915494309189535\n#define EPSILON 1e-6\n#ifndef saturate\n#define saturate( a ) clamp( a, 0.0, 1.0 )\n#endif\n#define whiteComplement( a ) ( 1.0 - saturate( a ) )\nfloat pow2( const in float x ) { return x*x; }\nvec3 pow2( const in vec3 x ) { return x*x; }\nfloat pow3( const in float x ) { return x*x*x; }\nfloat pow4( const in float x ) { float x2 = x*x; return x2*x2; }\nfloat max3( const in vec3 v ) { return max( max( v.x, v.y ), v.z ); }\nfloat average( const in vec3 v ) { return dot( v, vec3( 0.3333333 ) ); }\nhighp float rand( const in vec2 uv ) {\n\tconst highp float a = 12.9898, b = 78.233, c = 43758.5453;\n\thighp float dt = dot( uv.xy, vec2( a,b ) ), sn = mod( dt, PI );\n\treturn fract( sin( sn ) * c );\n}\n#ifdef HIGH_PRECISION\n\tfloat precisionSafeLength( vec3 v ) { return length( v ); }\n#else\n\tfloat precisionSafeLength( vec3 v ) {\n\t\tfloat maxComponent = max3( abs( v ) );\n\t\treturn length( v / maxComponent ) * maxComponent;\n\t}\n#endif\nstruct IncidentLight {\n\tvec3 color;\n\tvec3 direction;\n\tbool visible;\n};\nstruct ReflectedLight {\n\tvec3 directDiffuse;\n\tvec3 directSpecular;\n\tvec3 indirectDiffuse;\n\tvec3 indirectSpecular;\n};\n#ifdef USE_ALPHAHASH\n\tvarying vec3 vPosition;\n#endif\nvec3 transformDirection( in vec3 dir, in mat4 matrix ) {\n\treturn normalize( ( matrix * vec4( dir, 0.0 ) ).xyz );\n}\n#define inverseTransformDirection transformDirectionByInverseViewMatrix\nvec3 transformNormalByInverseViewMatrix( in vec3 normal, in mat4 viewMatrix ) {\n\treturn normalize( ( vec4( normal, 0.0 ) * viewMatrix ).xyz );\n}\nvec3 transformDirectionByInverseViewMatrix( in vec3 dir, in mat4 viewMatrix ) {\n\treturn normalize( ( vec4( dir, 0.0 ) * viewMatrix ).xyz );\n}\nbool isPerspectiveMatrix( mat4 m ) {\n\treturn m[ 2 ][ 3 ] == - 1.0;\n}\nvec2 equirectUv( in vec3 dir ) {\n\tfloat u = atan( dir.z, dir.x ) * RECIPROCAL_PI2 + 0.5;\n\tfloat v = asin( clamp( dir.y, - 1.0, 1.0 ) ) * RECIPROCAL_PI + 0.5;\n\treturn vec2( u, v );\n}\nvec3 BRDF_Lambert( const in vec3 diffuseColor ) {\n\treturn RECIPROCAL_PI * diffuseColor;\n}\nvec3 F_Schlick( const in vec3 f0, const in float f90, const in float dotVH ) {\n\tfloat fresnel = exp2( ( - 5.55473 * dotVH - 6.98316 ) * dotVH );\n\treturn f0 * ( 1.0 - fresnel ) + ( f90 * fresnel );\n}\nfloat F_Schlick( const in float f0, const in float f90, const in float dotVH ) {\n\tfloat fresnel = exp2( ( - 5.55473 * dotVH - 6.98316 ) * dotVH );\n\treturn f0 * ( 1.0 - fresnel ) + ( f90 * fresnel );\n} // validated";
+
+var cube_uv_reflection_fragment = "#ifdef ENVMAP_TYPE_CUBE_UV\n\t#define cubeUV_minMipLevel 4.0\n\t#define cubeUV_minTileSize 16.0\n\tfloat getFace( vec3 direction ) {\n\t\tvec3 absDirection = abs( direction );\n\t\tfloat face = - 1.0;\n\t\tif ( absDirection.x > absDirection.z ) {\n\t\t\tif ( absDirection.x > absDirection.y )\n\t\t\t\tface = direction.x > 0.0 ? 0.0 : 3.0;\n\t\t\telse\n\t\t\t\tface = direction.y > 0.0 ? 1.0 : 4.0;\n\t\t} else {\n\t\t\tif ( absDirection.z > absDirection.y )\n\t\t\t\tface = direction.z > 0.0 ? 2.0 : 5.0;\n\t\t\telse\n\t\t\t\tface = direction.y > 0.0 ? 1.0 : 4.0;\n\t\t}\n\t\treturn face;\n\t}\n\tvec2 getUV( vec3 direction, float face ) {\n\t\tvec2 uv;\n\t\tif ( face == 0.0 ) {\n\t\t\tuv = vec2( direction.z, direction.y ) / abs( direction.x );\n\t\t} else if ( face == 1.0 ) {\n\t\t\tuv = vec2( - direction.x, - direction.z ) / abs( direction.y );\n\t\t} else if ( face == 2.0 ) {\n\t\t\tuv = vec2( - direction.x, direction.y ) / abs( direction.z );\n\t\t} else if ( face == 3.0 ) {\n\t\t\tuv = vec2( - direction.z, direction.y ) / abs( direction.x );\n\t\t} else if ( face == 4.0 ) {\n\t\t\tuv = vec2( - direction.x, direction.z ) / abs( direction.y );\n\t\t} else {\n\t\t\tuv = vec2( direction.x, direction.y ) / abs( direction.z );\n\t\t}\n\t\treturn 0.5 * ( uv + 1.0 );\n\t}\n\tvec3 bilinearCubeUV( sampler2D envMap, vec3 direction, float mipInt ) {\n\t\tfloat face = getFace( direction );\n\t\tfloat filterInt = max( cubeUV_minMipLevel - mipInt, 0.0 );\n\t\tmipInt = max( mipInt, cubeUV_minMipLevel );\n\t\tfloat faceSize = exp2( mipInt );\n\t\thighp vec2 uv = getUV( direction, face ) * ( faceSize - 2.0 ) + 1.0;\n\t\tif ( face > 2.0 ) {\n\t\t\tuv.y += faceSize;\n\t\t\tface -= 3.0;\n\t\t}\n\t\tuv.x += face * faceSize;\n\t\tuv.x += filterInt * 3.0 * cubeUV_minTileSize;\n\t\tuv.y += 4.0 * ( exp2( CUBEUV_MAX_MIP ) - faceSize );\n\t\tuv.x *= CUBEUV_TEXEL_WIDTH;\n\t\tuv.y *= CUBEUV_TEXEL_HEIGHT;\n\t\t#ifdef texture2DGradEXT\n\t\t\treturn texture2DGradEXT( envMap, uv, vec2( 0.0 ), vec2( 0.0 ) ).rgb;\n\t\t#else\n\t\t\treturn texture2D( envMap, uv ).rgb;\n\t\t#endif\n\t}\n\t#define cubeUV_r0 1.0\n\t#define cubeUV_m0 - 2.0\n\t#define cubeUV_r1 0.8\n\t#define cubeUV_m1 - 1.0\n\t#define cubeUV_r4 0.4\n\t#define cubeUV_m4 2.0\n\t#define cubeUV_r5 0.305\n\t#define cubeUV_m5 3.0\n\t#define cubeUV_r6 0.21\n\t#define cubeUV_m6 4.0\n\tfloat roughnessToMip( float roughness ) {\n\t\tfloat mip = 0.0;\n\t\tif ( roughness >= cubeUV_r1 ) {\n\t\t\tmip = ( cubeUV_r0 - roughness ) * ( cubeUV_m1 - cubeUV_m0 ) / ( cubeUV_r0 - cubeUV_r1 ) + cubeUV_m0;\n\t\t} else if ( roughness >= cubeUV_r4 ) {\n\t\t\tmip = ( cubeUV_r1 - roughness ) * ( cubeUV_m4 - cubeUV_m1 ) / ( cubeUV_r1 - cubeUV_r4 ) + cubeUV_m1;\n\t\t} else if ( roughness >= cubeUV_r5 ) {\n\t\t\tmip = ( cubeUV_r4 - roughness ) * ( cubeUV_m5 - cubeUV_m4 ) / ( cubeUV_r4 - cubeUV_r5 ) + cubeUV_m4;\n\t\t} else if ( roughness >= cubeUV_r6 ) {\n\t\t\tmip = ( cubeUV_r5 - roughness ) * ( cubeUV_m6 - cubeUV_m5 ) / ( cubeUV_r5 - cubeUV_r6 ) + cubeUV_m5;\n\t\t} else {\n\t\t\tmip = - 2.0 * log2( 1.16 * roughness );\t\t}\n\t\treturn mip;\n\t}\n\tvec4 textureCubeUV( sampler2D envMap, vec3 sampleDir, float roughness ) {\n\t\tfloat mip = clamp( roughnessToMip( roughness ), cubeUV_m0, CUBEUV_MAX_MIP );\n\t\tfloat mipF = fract( mip );\n\t\tfloat mipInt = floor( mip );\n\t\tvec3 color0 = bilinearCubeUV( envMap, sampleDir, mipInt );\n\t\tif ( mipF == 0.0 ) {\n\t\t\treturn vec4( color0, 1.0 );\n\t\t} else {\n\t\t\tvec3 color1 = bilinearCubeUV( envMap, sampleDir, mipInt + 1.0 );\n\t\t\treturn vec4( mix( color0, color1, mipF ), 1.0 );\n\t\t}\n\t}\n#endif";
+
+var defaultnormal_vertex = "vec3 transformedNormal = objectNormal;\n#ifdef USE_TANGENT\n\tvec3 transformedTangent = objectTangent;\n#endif\n#ifdef USE_BATCHING\n\tmat3 bm = mat3( batchingMatrix );\n\ttransformedNormal /= vec3( dot( bm[ 0 ], bm[ 0 ] ), dot( bm[ 1 ], bm[ 1 ] ), dot( bm[ 2 ], bm[ 2 ] ) );\n\ttransformedNormal = bm * transformedNormal;\n\t#ifdef USE_TANGENT\n\t\ttransformedTangent = bm * transformedTangent;\n\t#endif\n#endif\n#ifdef USE_INSTANCING\n\tmat3 im = mat3( instanceMatrix );\n\ttransformedNormal /= vec3( dot( im[ 0 ], im[ 0 ] ), dot( im[ 1 ], im[ 1 ] ), dot( im[ 2 ], im[ 2 ] ) );\n\ttransformedNormal = im * transformedNormal;\n\t#ifdef USE_TANGENT\n\t\ttransformedTangent = im * transformedTangent;\n\t#endif\n#endif\ntransformedNormal = normalMatrix * transformedNormal;\n#ifdef FLIP_SIDED\n\ttransformedNormal = - transformedNormal;\n#endif\n#ifdef USE_TANGENT\n\ttransformedTangent = ( modelViewMatrix * vec4( transformedTangent, 0.0 ) ).xyz;\n#endif";
+
+var displacementmap_pars_vertex = "#ifdef USE_DISPLACEMENTMAP\n\tuniform sampler2D displacementMap;\n\tuniform float displacementScale;\n\tuniform float displacementBias;\n#endif";
+
+var displacementmap_vertex = "#ifdef USE_DISPLACEMENTMAP\n\ttransformed += normalize( objectNormal ) * ( texture2D( displacementMap, vDisplacementMapUv ).x * displacementScale + displacementBias );\n#endif";
+
+var emissivemap_fragment = "#ifdef USE_EMISSIVEMAP\n\tvec4 emissiveColor = texture2D( emissiveMap, vEmissiveMapUv );\n\t#ifdef DECODE_VIDEO_TEXTURE_EMISSIVE\n\t\temissiveColor = sRGBTransferEOTF( emissiveColor );\n\t#endif\n\ttotalEmissiveRadiance *= emissiveColor.rgb;\n#endif";
+
+var emissivemap_pars_fragment = "#ifdef USE_EMISSIVEMAP\n\tuniform sampler2D emissiveMap;\n#endif";
+
+var colorspace_fragment = "gl_FragColor = linearToOutputTexel( gl_FragColor );";
+
+var colorspace_pars_fragment = "vec4 LinearTransferOETF( in vec4 value ) {\n\treturn value;\n}\nvec4 sRGBTransferEOTF( in vec4 value ) {\n\treturn vec4( mix( pow( value.rgb * 0.9478672986 + vec3( 0.0521327014 ), vec3( 2.4 ) ), value.rgb * 0.0773993808, vec3( lessThanEqual( value.rgb, vec3( 0.04045 ) ) ) ), value.a );\n}\nvec4 sRGBTransferOETF( in vec4 value ) {\n\treturn vec4( mix( pow( value.rgb, vec3( 0.41666 ) ) * 1.055 - vec3( 0.055 ), value.rgb * 12.92, vec3( lessThanEqual( value.rgb, vec3( 0.0031308 ) ) ) ), value.a );\n}";
+
+var envmap_fragment = "#ifdef USE_ENVMAP\n\t#ifdef ENV_WORLDPOS\n\t\tvec3 cameraToFrag;\n\t\tif ( isOrthographic ) {\n\t\t\tcameraToFrag = normalize( vec3( - viewMatrix[ 0 ][ 2 ], - viewMatrix[ 1 ][ 2 ], - viewMatrix[ 2 ][ 2 ] ) );\n\t\t} else {\n\t\t\tcameraToFrag = normalize( vWorldPosition - cameraPosition );\n\t\t}\n\t\tvec3 worldNormal = transformNormalByInverseViewMatrix( normal, viewMatrix );\n\t\t#ifdef ENVMAP_MODE_REFLECTION\n\t\t\tvec3 reflectVec = reflect( cameraToFrag, worldNormal );\n\t\t#else\n\t\t\tvec3 reflectVec = refract( cameraToFrag, worldNormal, refractionRatio );\n\t\t#endif\n\t#else\n\t\tvec3 reflectVec = vReflect;\n\t#endif\n\t#ifdef ENVMAP_TYPE_CUBE\n\t\tvec4 envColor = textureCube( envMap, envMapRotation * reflectVec );\n\t\t#ifdef ENVMAP_BLENDING_MULTIPLY\n\t\t\toutgoingLight = mix( outgoingLight, outgoingLight * envColor.xyz, specularStrength * reflectivity );\n\t\t#elif defined( ENVMAP_BLENDING_MIX )\n\t\t\toutgoingLight = mix( outgoingLight, envColor.xyz, specularStrength * reflectivity );\n\t\t#elif defined( ENVMAP_BLENDING_ADD )\n\t\t\toutgoingLight += envColor.xyz * specularStrength * reflectivity;\n\t\t#endif\n\t#endif\n#endif";
+
+var envmap_common_pars_fragment = "#ifdef USE_ENVMAP\n\tuniform float envMapIntensity;\n\tuniform mat3 envMapRotation;\n\t#ifdef ENVMAP_TYPE_CUBE\n\t\tuniform samplerCube envMap;\n\t#else\n\t\tuniform sampler2D envMap;\n\t#endif\n#endif";
+
+var envmap_pars_fragment = "#ifdef USE_ENVMAP\n\tuniform float reflectivity;\n\t#if defined( USE_BUMPMAP ) || defined( USE_NORMALMAP ) || defined( PHONG ) || defined( LAMBERT )\n\t\t#define ENV_WORLDPOS\n\t#endif\n\t#ifdef ENV_WORLDPOS\n\t\tvarying vec3 vWorldPosition;\n\t\tuniform float refractionRatio;\n\t#else\n\t\tvarying vec3 vReflect;\n\t#endif\n#endif";
+
+var envmap_pars_vertex = "#ifdef USE_ENVMAP\n\t#if defined( USE_BUMPMAP ) || defined( USE_NORMALMAP ) || defined( PHONG ) || defined( LAMBERT )\n\t\t#define ENV_WORLDPOS\n\t#endif\n\t#ifdef ENV_WORLDPOS\n\t\t\n\t\tvarying vec3 vWorldPosition;\n\t#else\n\t\tvarying vec3 vReflect;\n\t\tuniform float refractionRatio;\n\t#endif\n#endif";
+
+var envmap_vertex = "#ifdef USE_ENVMAP\n\t#ifdef ENV_WORLDPOS\n\t\tvWorldPosition = worldPosition.xyz;\n\t#else\n\t\tvec3 cameraToVertex;\n\t\tif ( isOrthographic ) {\n\t\t\tcameraToVertex = normalize( vec3( - viewMatrix[ 0 ][ 2 ], - viewMatrix[ 1 ][ 2 ], - viewMatrix[ 2 ][ 2 ] ) );\n\t\t} else {\n\t\t\tcameraToVertex = normalize( worldPosition.xyz - cameraPosition );\n\t\t}\n\t\tvec3 worldNormal = transformNormalByInverseViewMatrix( transformedNormal, viewMatrix );\n\t\t#ifdef ENVMAP_MODE_REFLECTION\n\t\t\tvReflect = reflect( cameraToVertex, worldNormal );\n\t\t#else\n\t\t\tvReflect = refract( cameraToVertex, worldNormal, refractionRatio );\n\t\t#endif\n\t#endif\n#endif";
+
+var fog_vertex = "#ifdef USE_FOG\n\tvFogDepth = - mvPosition.z;\n#endif";
+
+var fog_pars_vertex = "#ifdef USE_FOG\n\tvarying float vFogDepth;\n#endif";
+
+var fog_fragment = "#ifdef USE_FOG\n\t#ifdef FOG_EXP2\n\t\tfloat fogFactor = 1.0 - exp( - fogDensity * fogDensity * vFogDepth * vFogDepth );\n\t#else\n\t\tfloat fogFactor = smoothstep( fogNear, fogFar, vFogDepth );\n\t#endif\n\tgl_FragColor.rgb = mix( gl_FragColor.rgb, fogColor, fogFactor );\n#endif";
+
+var fog_pars_fragment = "#ifdef USE_FOG\n\tuniform vec3 fogColor;\n\tvarying float vFogDepth;\n\t#ifdef FOG_EXP2\n\t\tuniform float fogDensity;\n\t#else\n\t\tuniform float fogNear;\n\t\tuniform float fogFar;\n\t#endif\n#endif";
+
+var gradientmap_pars_fragment = "#ifdef USE_GRADIENTMAP\n\tuniform sampler2D gradientMap;\n#endif\nvec3 getGradientIrradiance( vec3 normal, vec3 lightDirection ) {\n\tfloat dotNL = dot( normal, lightDirection );\n\tvec2 coord = vec2( dotNL * 0.5 + 0.5, 0.0 );\n\t#ifdef USE_GRADIENTMAP\n\t\treturn vec3( texture2D( gradientMap, coord ).r );\n\t#else\n\t\tvec2 fw = fwidth( coord ) * 0.5;\n\t\treturn mix( vec3( 0.7 ), vec3( 1.0 ), smoothstep( 0.7 - fw.x, 0.7 + fw.x, coord.x ) );\n\t#endif\n}";
+
+var lightmap_pars_fragment = "#ifdef USE_LIGHTMAP\n\tuniform sampler2D lightMap;\n\tuniform float lightMapIntensity;\n#endif";
+
+var lights_lambert_fragment = "LambertMaterial material;\nmaterial.diffuseColor = diffuseColor.rgb;\nmaterial.specularStrength = specularStrength;";
+
+var lights_lambert_pars_fragment = "varying vec3 vViewPosition;\nstruct LambertMaterial {\n\tvec3 diffuseColor;\n\tfloat specularStrength;\n};\nvoid RE_Direct_Lambert( const in IncidentLight directLight, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in LambertMaterial material, inout ReflectedLight reflectedLight ) {\n\tfloat dotNL = saturate( dot( geometryNormal, directLight.direction ) );\n\tvec3 irradiance = dotNL * directLight.color;\n\treflectedLight.directDiffuse += irradiance * BRDF_Lambert( material.diffuseColor );\n}\nvoid RE_IndirectDiffuse_Lambert( const in vec3 irradiance, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in LambertMaterial material, inout ReflectedLight reflectedLight ) {\n\treflectedLight.indirectDiffuse += irradiance * BRDF_Lambert( material.diffuseColor );\n}\n#define RE_Direct\t\t\t\tRE_Direct_Lambert\n#define RE_IndirectDiffuse\t\tRE_IndirectDiffuse_Lambert";
+
+var lights_pars_begin = "uniform bool receiveShadow;\nuniform vec3 ambientLightColor;\n#if defined( USE_LIGHT_PROBES )\n\tuniform vec3 lightProbe[ 9 ];\n#endif\nvec3 shGetIrradianceAt( in vec3 normal, in vec3 shCoefficients[ 9 ] ) {\n\tfloat x = normal.x, y = normal.y, z = normal.z;\n\tvec3 result = shCoefficients[ 0 ] * 0.886227;\n\tresult += shCoefficients[ 1 ] * 2.0 * 0.511664 * y;\n\tresult += shCoefficients[ 2 ] * 2.0 * 0.511664 * z;\n\tresult += shCoefficients[ 3 ] * 2.0 * 0.511664 * x;\n\tresult += shCoefficients[ 4 ] * 2.0 * 0.429043 * x * y;\n\tresult += shCoefficients[ 5 ] * 2.0 * 0.429043 * y * z;\n\tresult += shCoefficients[ 6 ] * ( 0.743125 * z * z - 0.247708 );\n\tresult += shCoefficients[ 7 ] * 2.0 * 0.429043 * x * z;\n\tresult += shCoefficients[ 8 ] * 0.429043 * ( x * x - y * y );\n\treturn result;\n}\nvec3 getLightProbeIrradiance( const in vec3 lightProbe[ 9 ], const in vec3 normal ) {\n\tvec3 worldNormal = transformNormalByInverseViewMatrix( normal, viewMatrix );\n\tvec3 irradiance = shGetIrradianceAt( worldNormal, lightProbe );\n\treturn irradiance;\n}\nvec3 getAmbientLightIrradiance( const in vec3 ambientLightColor ) {\n\tvec3 irradiance = ambientLightColor;\n\treturn irradiance;\n}\nfloat getDistanceAttenuation( const in float lightDistance, const in float cutoffDistance, const in float decayExponent ) {\n\tfloat distanceFalloff = 1.0 / max( pow( lightDistance, decayExponent ), 0.01 );\n\tif ( cutoffDistance > 0.0 ) {\n\t\tdistanceFalloff *= pow2( saturate( 1.0 - pow4( lightDistance / cutoffDistance ) ) );\n\t}\n\treturn distanceFalloff;\n}\nfloat getSpotAttenuation( const in float coneCosine, const in float penumbraCosine, const in float angleCosine ) {\n\treturn smoothstep( coneCosine, penumbraCosine, angleCosine );\n}\n#if NUM_SUN_LIGHTS > 0\n\tstruct SunLight {\n\t\tvec3 direction;\n\t\tvec3 color;\n\t};\n\tuniform SunLight sunLights[ NUM_SUN_LIGHTS ];\n\tvoid getSunLightInfo( const in SunLight sunLight, out IncidentLight light ) {\n\t\tlight.color = sunLight.color;\n\t\tlight.direction = sunLight.direction;\n\t\tlight.visible = true;\n\t}\n#endif\n#if NUM_DIR_LIGHTS > 0\n\tstruct DirectionalLight {\n\t\tvec3 direction;\n\t\tvec3 color;\n\t};\n\tuniform DirectionalLight directionalLights[ NUM_DIR_LIGHTS ];\n\tvoid getDirectionalLightInfo( const in DirectionalLight directionalLight, out IncidentLight light ) {\n\t\tlight.color = directionalLight.color;\n\t\tlight.direction = directionalLight.direction;\n\t\tlight.visible = true;\n\t}\n#endif\n#if NUM_POINT_LIGHTS > 0\n\tstruct PointLight {\n\t\tvec3 position;\n\t\tvec3 color;\n\t\tfloat distance;\n\t\tfloat decay;\n\t};\n\tuniform PointLight pointLights[ NUM_POINT_LIGHTS ];\n\tvoid getPointLightInfo( const in PointLight pointLight, const in vec3 geometryPosition, out IncidentLight light ) {\n\t\tvec3 lVector = pointLight.position - geometryPosition;\n\t\tlight.direction = normalize( lVector );\n\t\tfloat lightDistance = length( lVector );\n\t\tlight.color = pointLight.color;\n\t\tlight.color *= getDistanceAttenuation( lightDistance, pointLight.distance, pointLight.decay );\n\t\tlight.visible = ( light.color != vec3( 0.0 ) );\n\t}\n#endif\n#if NUM_SPOT_LIGHTS > 0\n\tstruct SpotLight {\n\t\tvec3 position;\n\t\tvec3 direction;\n\t\tvec3 color;\n\t\tfloat distance;\n\t\tfloat decay;\n\t\tfloat coneCos;\n\t\tfloat penumbraCos;\n\t};\n\tuniform SpotLight spotLights[ NUM_SPOT_LIGHTS ];\n\tvoid getSpotLightInfo( const in SpotLight spotLight, const in vec3 geometryPosition, out IncidentLight light ) {\n\t\tvec3 lVector = spotLight.position - geometryPosition;\n\t\tlight.direction = normalize( lVector );\n\t\tfloat angleCos = dot( light.direction, spotLight.direction );\n\t\tfloat spotAttenuation = getSpotAttenuation( spotLight.coneCos, spotLight.penumbraCos, angleCos );\n\t\tif ( spotAttenuation > 0.0 ) {\n\t\t\tfloat lightDistance = length( lVector );\n\t\t\tlight.color = spotLight.color * spotAttenuation;\n\t\t\tlight.color *= getDistanceAttenuation( lightDistance, spotLight.distance, spotLight.decay );\n\t\t\tlight.visible = ( light.color != vec3( 0.0 ) );\n\t\t} else {\n\t\t\tlight.color = vec3( 0.0 );\n\t\t\tlight.visible = false;\n\t\t}\n\t}\n#endif\n#if NUM_RECT_AREA_LIGHTS > 0\n\tstruct RectAreaLight {\n\t\tvec3 color;\n\t\tvec3 position;\n\t\tvec3 halfWidth;\n\t\tvec3 halfHeight;\n\t};\n\tuniform sampler2D ltc_1;\tuniform sampler2D ltc_2;\n\tuniform RectAreaLight rectAreaLights[ NUM_RECT_AREA_LIGHTS ];\n#endif\n#if NUM_HEMI_LIGHTS > 0\n\tstruct HemisphereLight {\n\t\tvec3 direction;\n\t\tvec3 skyColor;\n\t\tvec3 groundColor;\n\t};\n\tuniform HemisphereLight hemisphereLights[ NUM_HEMI_LIGHTS ];\n\tvec3 getHemisphereLightIrradiance( const in HemisphereLight hemiLight, const in vec3 normal ) {\n\t\tfloat dotNL = dot( normal, hemiLight.direction );\n\t\tfloat hemiDiffuseWeight = 0.5 * dotNL + 0.5;\n\t\tvec3 irradiance = mix( hemiLight.groundColor, hemiLight.skyColor, hemiDiffuseWeight );\n\t\treturn irradiance;\n\t}\n#endif\n#include <lightprobes_pars_fragment>";
+
+var envmap_physical_pars_fragment = "#ifdef USE_ENVMAP\n\tvec3 getIBLIrradiance( const in vec3 normal ) {\n\t\t#ifdef ENVMAP_TYPE_CUBE_UV\n\t\t\tvec3 worldNormal = transformNormalByInverseViewMatrix( normal, viewMatrix );\n\t\t\tvec4 envMapColor = textureCubeUV( envMap, envMapRotation * worldNormal, 1.0 );\n\t\t\treturn PI * envMapColor.rgb * envMapIntensity;\n\t\t#else\n\t\t\treturn vec3( 0.0 );\n\t\t#endif\n\t}\n\tvec3 getIBLRadiance( const in vec3 viewDir, const in vec3 normal, const in float roughness ) {\n\t\t#ifdef ENVMAP_TYPE_CUBE_UV\n\t\t\tvec3 reflectVec = reflect( - viewDir, normal );\n\t\t\treflectVec = normalize( mix( reflectVec, normal, pow4( roughness ) ) );\n\t\t\treflectVec = transformDirectionByInverseViewMatrix( reflectVec, viewMatrix );\n\t\t\tvec4 envMapColor = textureCubeUV( envMap, envMapRotation * reflectVec, roughness );\n\t\t\treturn envMapColor.rgb * envMapIntensity;\n\t\t#else\n\t\t\treturn vec3( 0.0 );\n\t\t#endif\n\t}\n\t#ifdef USE_RETROREFLECTION\n\t\tvec3 getIBLRetroRadiance( const in vec3 viewDir, const in vec3 normal, const in float roughness ) {\n\t\t\t#ifdef ENVMAP_TYPE_CUBE_UV\n\t\t\t\tvec3 retroVec = normalize( mix( viewDir, normal, pow4( roughness ) ) );\n\t\t\t\tretroVec = transformDirectionByInverseViewMatrix( retroVec, viewMatrix );\n\t\t\t\tvec4 envMapColor = textureCubeUV( envMap, envMapRotation * retroVec, roughness );\n\t\t\t\treturn envMapColor.rgb * envMapIntensity;\n\t\t\t#else\n\t\t\t\treturn vec3( 0.0 );\n\t\t\t#endif\n\t\t}\n\t#endif\n\t#ifdef USE_ANISOTROPY\n\t\tvec3 getIBLAnisotropyRadiance( const in vec3 viewDir, const in vec3 normal, const in float roughness, const in vec3 bitangent, const in float anisotropy ) {\n\t\t\t#ifdef ENVMAP_TYPE_CUBE_UV\n\t\t\t\tvec3 bentNormal = cross( bitangent, viewDir );\n\t\t\t\tbentNormal = normalize( cross( bentNormal, bitangent ) );\n\t\t\t\tbentNormal = normalize( mix( bentNormal, normal, pow2( pow2( 1.0 - anisotropy * ( 1.0 - roughness ) ) ) ) );\n\t\t\t\treturn getIBLRadiance( viewDir, bentNormal, roughness );\n\t\t\t#else\n\t\t\t\treturn vec3( 0.0 );\n\t\t\t#endif\n\t\t}\n\t\t#ifdef USE_RETROREFLECTION\n\t\t\tvec3 getIBLAnisotropyRetroRadiance( const in vec3 viewDir, const in vec3 normal, const in float roughness, const in vec3 bitangent, const in float anisotropy ) {\n\t\t\t\t#ifdef ENVMAP_TYPE_CUBE_UV\n\t\t\t\t\tvec3 bentNormal = cross( bitangent, viewDir );\n\t\t\t\t\tbentNormal = normalize( cross( bentNormal, bitangent ) );\n\t\t\t\t\tbentNormal = normalize( mix( bentNormal, normal, pow2( pow2( 1.0 - anisotropy * ( 1.0 - roughness ) ) ) ) );\n\t\t\t\t\treturn getIBLRetroRadiance( viewDir, bentNormal, roughness );\n\t\t\t\t#else\n\t\t\t\t\treturn vec3( 0.0 );\n\t\t\t\t#endif\n\t\t\t}\n\t\t#endif\n\t#endif\n#endif";
+
+var lights_toon_fragment = "ToonMaterial material;\nmaterial.diffuseColor = diffuseColor.rgb;";
+
+var lights_toon_pars_fragment = "varying vec3 vViewPosition;\nstruct ToonMaterial {\n\tvec3 diffuseColor;\n};\nvoid RE_Direct_Toon( const in IncidentLight directLight, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in ToonMaterial material, inout ReflectedLight reflectedLight ) {\n\tvec3 irradiance = getGradientIrradiance( geometryNormal, directLight.direction ) * directLight.color;\n\treflectedLight.directDiffuse += irradiance * BRDF_Lambert( material.diffuseColor );\n}\nvoid RE_IndirectDiffuse_Toon( const in vec3 irradiance, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in ToonMaterial material, inout ReflectedLight reflectedLight ) {\n\treflectedLight.indirectDiffuse += irradiance * BRDF_Lambert( material.diffuseColor );\n}\n#define RE_Direct\t\t\t\tRE_Direct_Toon\n#define RE_IndirectDiffuse\t\tRE_IndirectDiffuse_Toon";
+
+var lights_phong_fragment = "BlinnPhongMaterial material;\nmaterial.diffuseColor = diffuseColor.rgb;\nmaterial.specularColor = specular;\nmaterial.specularShininess = shininess;\nmaterial.specularStrength = specularStrength;";
+
+var lights_phong_pars_fragment = "varying vec3 vViewPosition;\nstruct BlinnPhongMaterial {\n\tvec3 diffuseColor;\n\tvec3 specularColor;\n\tfloat specularShininess;\n\tfloat specularStrength;\n};\nvoid RE_Direct_BlinnPhong( const in IncidentLight directLight, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in BlinnPhongMaterial material, inout ReflectedLight reflectedLight ) {\n\tfloat dotNL = saturate( dot( geometryNormal, directLight.direction ) );\n\tvec3 irradiance = dotNL * directLight.color;\n\treflectedLight.directDiffuse += irradiance * BRDF_Lambert( material.diffuseColor );\n\treflectedLight.directSpecular += irradiance * BRDF_BlinnPhong( directLight.direction, geometryViewDir, geometryNormal, material.specularColor, material.specularShininess ) * material.specularStrength;\n}\nvoid RE_IndirectDiffuse_BlinnPhong( const in vec3 irradiance, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in BlinnPhongMaterial material, inout ReflectedLight reflectedLight ) {\n\treflectedLight.indirectDiffuse += irradiance * BRDF_Lambert( material.diffuseColor );\n}\n#define RE_Direct\t\t\t\tRE_Direct_BlinnPhong\n#define RE_IndirectDiffuse\t\tRE_IndirectDiffuse_BlinnPhong";
+
+var lights_physical_fragment = "PhysicalMaterial material;\nmaterial.diffuseColor = diffuseColor.rgb;\nmaterial.diffuseContribution = diffuseColor.rgb * ( 1.0 - metalnessFactor );\nmaterial.metalness = metalnessFactor;\nvec3 dxy = max( abs( dFdx( nonPerturbedNormal ) ), abs( dFdy( nonPerturbedNormal ) ) );\nfloat geometryRoughness = max( max( dxy.x, dxy.y ), dxy.z );\nmaterial.roughness = max( roughnessFactor, 0.0525 );material.roughness += geometryRoughness;\nmaterial.roughness = min( material.roughness, 1.0 );\n#ifdef IOR\n\tmaterial.ior = ior;\n\t#ifdef USE_SPECULAR\n\t\tfloat specularIntensityFactor = specularIntensity;\n\t\tvec3 specularColorFactor = specularColor;\n\t\t#ifdef USE_SPECULAR_COLORMAP\n\t\t\tspecularColorFactor *= texture2D( specularColorMap, vSpecularColorMapUv ).rgb;\n\t\t#endif\n\t\t#ifdef USE_SPECULAR_INTENSITYMAP\n\t\t\tspecularIntensityFactor *= texture2D( specularIntensityMap, vSpecularIntensityMapUv ).a;\n\t\t#endif\n\t\tmaterial.specularF90 = mix( specularIntensityFactor, 1.0, metalnessFactor );\n\t#else\n\t\tfloat specularIntensityFactor = 1.0;\n\t\tvec3 specularColorFactor = vec3( 1.0 );\n\t\tmaterial.specularF90 = 1.0;\n\t#endif\n\tmaterial.specularColor = min( pow2( ( material.ior - 1.0 ) / ( material.ior + 1.0 ) ) * specularColorFactor, vec3( 1.0 ) ) * specularIntensityFactor;\n\tmaterial.specularColorBlended = mix( material.specularColor, diffuseColor.rgb, metalnessFactor );\n#else\n\tmaterial.specularColor = vec3( 0.04 );\n\tmaterial.specularColorBlended = mix( material.specularColor, diffuseColor.rgb, metalnessFactor );\n\tmaterial.specularF90 = 1.0;\n#endif\n#ifdef USE_CLEARCOAT\n\tmaterial.clearcoat = clearcoat;\n\tmaterial.clearcoatRoughness = clearcoatRoughness;\n\tmaterial.clearcoatF0 = vec3( 0.04 );\n\tmaterial.clearcoatF90 = 1.0;\n\t#ifdef USE_CLEARCOATMAP\n\t\tmaterial.clearcoat *= texture2D( clearcoatMap, vClearcoatMapUv ).x;\n\t#endif\n\t#ifdef USE_CLEARCOAT_ROUGHNESSMAP\n\t\tmaterial.clearcoatRoughness *= texture2D( clearcoatRoughnessMap, vClearcoatRoughnessMapUv ).y;\n\t#endif\n\tmaterial.clearcoat = saturate( material.clearcoat );\tmaterial.clearcoatRoughness = max( material.clearcoatRoughness, 0.0525 );\n\tmaterial.clearcoatRoughness += geometryRoughness;\n\tmaterial.clearcoatRoughness = min( material.clearcoatRoughness, 1.0 );\n#endif\n#ifdef USE_DISPERSION\n\tmaterial.dispersion = dispersion;\n#endif\n#ifdef USE_RETROREFLECTION\n\tmaterial.retroreflectivity = retroreflectivity;\n#endif\n#ifdef USE_IRIDESCENCE\n\tmaterial.iridescence = iridescence;\n\tmaterial.iridescenceIOR = iridescenceIOR;\n\t#ifdef USE_IRIDESCENCEMAP\n\t\tmaterial.iridescence *= texture2D( iridescenceMap, vIridescenceMapUv ).r;\n\t#endif\n\t#ifdef USE_IRIDESCENCE_THICKNESSMAP\n\t\tmaterial.iridescenceThickness = (iridescenceThicknessMaximum - iridescenceThicknessMinimum) * texture2D( iridescenceThicknessMap, vIridescenceThicknessMapUv ).g + iridescenceThicknessMinimum;\n\t#else\n\t\tmaterial.iridescenceThickness = iridescenceThicknessMaximum;\n\t#endif\n#endif\n#ifdef USE_SHEEN\n\tmaterial.sheenColor = sheenColor;\n\t#ifdef USE_SHEEN_COLORMAP\n\t\tmaterial.sheenColor *= texture2D( sheenColorMap, vSheenColorMapUv ).rgb;\n\t#endif\n\tmaterial.sheenRoughness = clamp( sheenRoughness, 0.0001, 1.0 );\n\t#ifdef USE_SHEEN_ROUGHNESSMAP\n\t\tmaterial.sheenRoughness *= texture2D( sheenRoughnessMap, vSheenRoughnessMapUv ).a;\n\t#endif\n#endif\n#ifdef USE_ANISOTROPY\n\t#ifdef USE_ANISOTROPYMAP\n\t\tmat2 anisotropyMat = mat2( anisotropyVector.x, anisotropyVector.y, - anisotropyVector.y, anisotropyVector.x );\n\t\tvec3 anisotropyPolar = texture2D( anisotropyMap, vAnisotropyMapUv ).rgb;\n\t\tvec2 anisotropyV = anisotropyMat * normalize( 2.0 * anisotropyPolar.rg - vec2( 1.0 ) ) * anisotropyPolar.b;\n\t#else\n\t\tvec2 anisotropyV = anisotropyVector;\n\t#endif\n\tmaterial.anisotropy = length( anisotropyV );\n\tif( material.anisotropy == 0.0 ) {\n\t\tanisotropyV = vec2( 1.0, 0.0 );\n\t} else {\n\t\tanisotropyV /= material.anisotropy;\n\t\tmaterial.anisotropy = saturate( material.anisotropy );\n\t}\n\tmaterial.alphaT = mix( pow2( material.roughness ), 1.0, pow2( material.anisotropy ) );\n\tmaterial.anisotropyT = tbn[ 0 ] * anisotropyV.x + tbn[ 1 ] * anisotropyV.y;\n\tmaterial.anisotropyB = tbn[ 1 ] * anisotropyV.x - tbn[ 0 ] * anisotropyV.y;\n#endif";
+
+var lights_physical_pars_fragment = "uniform sampler2D dfgLUT;\nstruct PhysicalMaterial {\n\tvec3 diffuseColor;\n\tvec3 diffuseContribution;\n\tvec3 specularColor;\n\tvec3 specularColorBlended;\n\tfloat roughness;\n\tfloat metalness;\n\tfloat specularF90;\n\tfloat dispersion;\n\tvec2 dfg;\n\tvec3 multiScatteringCompensation;\n\t#ifdef USE_RETROREFLECTION\n\t\tfloat retroreflectivity;\n\t#endif\n\t#ifdef USE_CLEARCOAT\n\t\tfloat clearcoat;\n\t\tfloat clearcoatRoughness;\n\t\tvec3 clearcoatF0;\n\t\tfloat clearcoatF90;\n\t#endif\n\t#ifdef USE_IRIDESCENCE\n\t\tfloat iridescence;\n\t\tfloat iridescenceIOR;\n\t\tfloat iridescenceThickness;\n\t\tvec3 iridescenceFresnel;\n\t\tvec3 iridescenceF0Dielectric;\n\t\tvec3 iridescenceF0Metallic;\n\t#endif\n\t#ifdef USE_SHEEN\n\t\tvec3 sheenColor;\n\t\tfloat sheenRoughness;\n\t#endif\n\t#ifdef IOR\n\t\tfloat ior;\n\t#endif\n\t#ifdef USE_TRANSMISSION\n\t\tfloat transmission;\n\t\tfloat transmissionAlpha;\n\t\tfloat thickness;\n\t\tfloat attenuationDistance;\n\t\tvec3 attenuationColor;\n\t#endif\n\t#ifdef USE_ANISOTROPY\n\t\tfloat anisotropy;\n\t\tfloat alphaT;\n\t\tvec3 anisotropyT;\n\t\tvec3 anisotropyB;\n\t#endif\n};\nvec3 clearcoatSpecularDirect = vec3( 0.0 );\nvec3 clearcoatSpecularIndirect = vec3( 0.0 );\nvec3 sheenSpecularDirect = vec3( 0.0 );\nvec3 sheenSpecularIndirect = vec3(0.0 );\nvec3 Schlick_to_F0( const in vec3 f, const in float f90, const in float dotVH ) {\n    float x = clamp( 1.0 - dotVH, 0.0, 1.0 );\n    float x2 = x * x;\n    float x5 = clamp( x * x2 * x2, 0.0, 0.9999 );\n    return ( f - vec3( f90 ) * x5 ) / ( 1.0 - x5 );\n}\nfloat V_GGX_SmithCorrelated( const in float alpha, const in float dotNL, const in float dotNV ) {\n\tfloat a2 = pow2( alpha );\n\tfloat gv = dotNL * sqrt( a2 + ( 1.0 - a2 ) * pow2( dotNV ) );\n\tfloat gl = dotNV * sqrt( a2 + ( 1.0 - a2 ) * pow2( dotNL ) );\n\treturn 0.5 / max( gv + gl, EPSILON );\n}\nfloat D_GGX( const in float alpha, const in float dotNH ) {\n\tfloat a2 = pow2( alpha );\n\tfloat denom = pow2( dotNH ) * ( a2 - 1.0 ) + 1.0;\n\treturn RECIPROCAL_PI * a2 / pow2( denom );\n}\n#ifdef USE_ANISOTROPY\n\tfloat V_GGX_SmithCorrelated_Anisotropic( const in float alphaT, const in float alphaB, const in float dotTV, const in float dotBV, const in float dotTL, const in float dotBL, const in float dotNV, const in float dotNL ) {\n\t\tfloat gv = dotNL * length( vec3( alphaT * dotTV, alphaB * dotBV, dotNV ) );\n\t\tfloat gl = dotNV * length( vec3( alphaT * dotTL, alphaB * dotBL, dotNL ) );\n\t\treturn 0.5 / max( gv + gl, EPSILON );\n\t}\n\tfloat D_GGX_Anisotropic( const in float alphaT, const in float alphaB, const in float dotNH, const in float dotTH, const in float dotBH ) {\n\t\tfloat a2 = alphaT * alphaB;\n\t\thighp vec3 v = vec3( alphaB * dotTH, alphaT * dotBH, a2 * dotNH );\n\t\thighp float v2 = dot( v, v );\n\t\tfloat w2 = a2 / v2;\n\t\treturn RECIPROCAL_PI * a2 * pow2 ( w2 );\n\t}\n#endif\n#ifdef USE_CLEARCOAT\n\tvec3 BRDF_GGX_Clearcoat( const in vec3 lightDir, const in vec3 viewDir, const in vec3 normal, const in PhysicalMaterial material) {\n\t\tvec3 f0 = material.clearcoatF0;\n\t\tfloat f90 = material.clearcoatF90;\n\t\tfloat roughness = material.clearcoatRoughness;\n\t\tfloat alpha = pow2( roughness );\n\t\tvec3 halfDir = normalize( lightDir + viewDir );\n\t\tfloat dotNL = saturate( dot( normal, lightDir ) );\n\t\tfloat dotNV = saturate( dot( normal, viewDir ) );\n\t\tfloat dotNH = saturate( dot( normal, halfDir ) );\n\t\tfloat dotVH = saturate( dot( viewDir, halfDir ) );\n\t\tvec3 F = F_Schlick( f0, f90, dotVH );\n\t\tfloat V = V_GGX_SmithCorrelated( alpha, dotNL, dotNV );\n\t\tfloat D = D_GGX( alpha, dotNH );\n\t\treturn F * ( V * D );\n\t}\n#endif\nvec3 BRDF_GGX( const in vec3 lightDir, const in vec3 viewDir, const in vec3 normal, const in PhysicalMaterial material ) {\n\tvec3 f0 = material.specularColorBlended;\n\tfloat f90 = material.specularF90;\n\tfloat roughness = material.roughness;\n\tfloat alpha = pow2( roughness );\n\tvec3 halfDir = normalize( lightDir + viewDir );\n\tfloat dotNL = saturate( dot( normal, lightDir ) );\n\tfloat dotNV = saturate( dot( normal, viewDir ) );\n\tfloat dotNH = saturate( dot( normal, halfDir ) );\n\tfloat dotVH = saturate( dot( viewDir, halfDir ) );\n\tvec3 F = F_Schlick( f0, f90, dotVH );\n\t#ifdef USE_IRIDESCENCE\n\t\tF = mix( F, material.iridescenceFresnel, material.iridescence );\n\t#endif\n\t#ifdef USE_ANISOTROPY\n\t\tfloat dotTL = dot( material.anisotropyT, lightDir );\n\t\tfloat dotTV = dot( material.anisotropyT, viewDir );\n\t\tfloat dotTH = dot( material.anisotropyT, halfDir );\n\t\tfloat dotBL = dot( material.anisotropyB, lightDir );\n\t\tfloat dotBV = dot( material.anisotropyB, viewDir );\n\t\tfloat dotBH = dot( material.anisotropyB, halfDir );\n\t\tfloat V = V_GGX_SmithCorrelated_Anisotropic( material.alphaT, alpha, dotTV, dotBV, dotTL, dotBL, dotNV, dotNL );\n\t\tfloat D = D_GGX_Anisotropic( material.alphaT, alpha, dotNH, dotTH, dotBH );\n\t#else\n\t\tfloat V = V_GGX_SmithCorrelated( alpha, dotNL, dotNV );\n\t\tfloat D = D_GGX( alpha, dotNH );\n\t#endif\n\treturn F * ( V * D );\n}\nvec2 LTC_Uv( const in vec3 N, const in vec3 V, const in float roughness ) {\n\tconst float LUT_SIZE = 64.0;\n\tconst float LUT_SCALE = ( LUT_SIZE - 1.0 ) / LUT_SIZE;\n\tconst float LUT_BIAS = 0.5 / LUT_SIZE;\n\tfloat dotNV = saturate( dot( N, V ) );\n\tvec2 uv = vec2( roughness, sqrt( 1.0 - dotNV ) );\n\tuv = uv * LUT_SCALE + LUT_BIAS;\n\treturn uv;\n}\nfloat LTC_ClippedSphereFormFactor( const in vec3 f ) {\n\tfloat l = length( f );\n\treturn max( ( l * l + f.z ) / ( l + 1.0 ), 0.0 );\n}\nvec3 LTC_EdgeVectorFormFactor( const in vec3 v1, const in vec3 v2 ) {\n\tfloat x = dot( v1, v2 );\n\tfloat y = abs( x );\n\tfloat a = 0.8543985 + ( 0.4965155 + 0.0145206 * y ) * y;\n\tfloat b = 3.4175940 + ( 4.1616724 + y ) * y;\n\tfloat v = a / b;\n\tfloat theta_sintheta = ( x > 0.0 ) ? v : 0.5 * inversesqrt( max( 1.0 - x * x, 1e-7 ) ) - v;\n\treturn cross( v1, v2 ) * theta_sintheta;\n}\nvec3 LTC_Evaluate( const in vec3 N, const in vec3 V, const in vec3 P, const in mat3 mInv, const in vec3 rectCoords[ 4 ] ) {\n\tvec3 v1 = rectCoords[ 1 ] - rectCoords[ 0 ];\n\tvec3 v2 = rectCoords[ 3 ] - rectCoords[ 0 ];\n\tvec3 lightNormal = cross( v1, v2 );\n\tif( dot( lightNormal, P - rectCoords[ 0 ] ) < 0.0 ) return vec3( 0.0 );\n\tvec3 T1, T2;\n\tT1 = normalize( V - N * dot( V, N ) );\n\tT2 = - cross( N, T1 );\n\tmat3 mat = mInv * transpose( mat3( T1, T2, N ) );\n\tvec3 coords[ 4 ];\n\tcoords[ 0 ] = mat * ( rectCoords[ 0 ] - P );\n\tcoords[ 1 ] = mat * ( rectCoords[ 1 ] - P );\n\tcoords[ 2 ] = mat * ( rectCoords[ 2 ] - P );\n\tcoords[ 3 ] = mat * ( rectCoords[ 3 ] - P );\n\tcoords[ 0 ] = normalize( coords[ 0 ] );\n\tcoords[ 1 ] = normalize( coords[ 1 ] );\n\tcoords[ 2 ] = normalize( coords[ 2 ] );\n\tcoords[ 3 ] = normalize( coords[ 3 ] );\n\tvec3 vectorFormFactor = vec3( 0.0 );\n\tvectorFormFactor += LTC_EdgeVectorFormFactor( coords[ 0 ], coords[ 1 ] );\n\tvectorFormFactor += LTC_EdgeVectorFormFactor( coords[ 1 ], coords[ 2 ] );\n\tvectorFormFactor += LTC_EdgeVectorFormFactor( coords[ 2 ], coords[ 3 ] );\n\tvectorFormFactor += LTC_EdgeVectorFormFactor( coords[ 3 ], coords[ 0 ] );\n\tfloat result = LTC_ClippedSphereFormFactor( vectorFormFactor );\n\treturn vec3( result );\n}\n#if defined( USE_SHEEN )\nfloat D_Charlie( float roughness, float dotNH ) {\n\tfloat alpha = pow2( roughness );\n\tfloat invAlpha = 1.0 / alpha;\n\tfloat cos2h = dotNH * dotNH;\n\tfloat sin2h = max( 1.0 - cos2h, 0.0078125 );\n\treturn ( 2.0 + invAlpha ) * pow( sin2h, invAlpha * 0.5 ) / ( 2.0 * PI );\n}\nfloat V_Neubelt( float dotNV, float dotNL ) {\n\treturn saturate( 1.0 / ( 4.0 * ( dotNL + dotNV - dotNL * dotNV ) ) );\n}\nvec3 BRDF_Sheen( const in vec3 lightDir, const in vec3 viewDir, const in vec3 normal, vec3 sheenColor, const in float sheenRoughness ) {\n\tvec3 halfDir = normalize( lightDir + viewDir );\n\tfloat dotNL = saturate( dot( normal, lightDir ) );\n\tfloat dotNV = saturate( dot( normal, viewDir ) );\n\tfloat dotNH = saturate( dot( normal, halfDir ) );\n\tfloat D = D_Charlie( sheenRoughness, dotNH );\n\tfloat V = V_Neubelt( dotNV, dotNL );\n\treturn sheenColor * ( D * V );\n}\n#endif\nfloat IBLSheenBRDF( const in vec3 normal, const in vec3 viewDir, const in float roughness ) {\n\tfloat dotNV = saturate( dot( normal, viewDir ) );\n\tfloat r2 = roughness * roughness;\n\tfloat rInv = 1.0 / ( roughness + 0.1 );\n\tfloat a = -1.9362 + 1.0678 * roughness + 0.4573 * r2 - 0.8469 * rInv;\n\tfloat b = -0.6014 + 0.5538 * roughness - 0.4670 * r2 - 0.1255 * rInv;\n\tfloat DG = exp( a * dotNV + b );\n\treturn saturate( DG );\n}\nvec3 EnvironmentBRDF( const in vec3 normal, const in vec3 viewDir, const in vec3 specularColor, const in float specularF90, const in float roughness ) {\n\tfloat dotNV = saturate( dot( normal, viewDir ) );\n\tvec2 fab = texture2D( dfgLUT, vec2( roughness, dotNV ) ).rg;\n\treturn specularColor * fab.x + specularF90 * fab.y;\n}\n#ifdef USE_IRIDESCENCE\nvoid computeMultiscatteringIridescence( const in vec2 fab, const in vec3 specularColor, const in float specularF90, const in float iridescence, const in vec3 iridescenceF0, inout vec3 singleScatter, inout vec3 multiScatter ) {\n#else\nvoid computeMultiscattering( const in vec2 fab, const in vec3 specularColor, const in float specularF90, inout vec3 singleScatter, inout vec3 multiScatter ) {\n#endif\n\t#ifdef USE_IRIDESCENCE\n\t\tvec3 Fr = mix( specularColor, iridescenceF0, iridescence );\n\t#else\n\t\tvec3 Fr = specularColor;\n\t#endif\n\tvec3 FssEss = Fr * fab.x + specularF90 * fab.y;\n\tfloat Ess = fab.x + fab.y;\n\tfloat Ems = 1.0 - Ess;\n\tvec3 Favg = Fr + ( 1.0 - Fr ) * 0.047619;\tvec3 Fms = FssEss * Favg / ( 1.0 - Ems * Favg );\n\tsingleScatter += FssEss;\n\tmultiScatter += Fms * Ems;\n}\n#if NUM_RECT_AREA_LIGHTS > 0\n\tvoid RE_Direct_RectArea_Physical( const in RectAreaLight rectAreaLight, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in PhysicalMaterial material, inout ReflectedLight reflectedLight ) {\n\t\tvec3 normal = geometryNormal;\n\t\tvec3 viewDir = geometryViewDir;\n\t\tvec3 position = geometryPosition;\n\t\tvec3 lightPos = rectAreaLight.position;\n\t\tvec3 halfWidth = rectAreaLight.halfWidth;\n\t\tvec3 halfHeight = rectAreaLight.halfHeight;\n\t\tvec3 lightColor = rectAreaLight.color;\n\t\tfloat roughness = material.roughness;\n\t\tvec3 rectCoords[ 4 ];\n\t\trectCoords[ 0 ] = lightPos + halfWidth - halfHeight;\t\trectCoords[ 1 ] = lightPos - halfWidth - halfHeight;\n\t\trectCoords[ 2 ] = lightPos - halfWidth + halfHeight;\n\t\trectCoords[ 3 ] = lightPos + halfWidth + halfHeight;\n\t\tvec2 uv = LTC_Uv( normal, viewDir, roughness );\n\t\tvec4 t1 = texture2D( ltc_1, uv );\n\t\tvec4 t2 = texture2D( ltc_2, uv );\n\t\tmat3 mInv = mat3(\n\t\t\tvec3( t1.x, 0, t1.y ),\n\t\t\tvec3(    0, 1,    0 ),\n\t\t\tvec3( t1.z, 0, t1.w )\n\t\t);\n\t\tvec3 fresnel = ( material.specularColorBlended * t2.x + ( material.specularF90 - material.specularColorBlended ) * t2.y );\n\t\treflectedLight.directSpecular += lightColor * fresnel * LTC_Evaluate( normal, viewDir, position, mInv, rectCoords );\n\t\treflectedLight.directDiffuse += lightColor * material.diffuseContribution * LTC_Evaluate( normal, viewDir, position, mat3( 1.0 ), rectCoords );\n\t\t#ifdef USE_CLEARCOAT\n\t\t\tvec3 Ncc = geometryClearcoatNormal;\n\t\t\tvec2 uvClearcoat = LTC_Uv( Ncc, viewDir, material.clearcoatRoughness );\n\t\t\tvec4 t1Clearcoat = texture2D( ltc_1, uvClearcoat );\n\t\t\tvec4 t2Clearcoat = texture2D( ltc_2, uvClearcoat );\n\t\t\tmat3 mInvClearcoat = mat3(\n\t\t\t\tvec3( t1Clearcoat.x, 0, t1Clearcoat.y ),\n\t\t\t\tvec3(             0, 1,             0 ),\n\t\t\t\tvec3( t1Clearcoat.z, 0, t1Clearcoat.w )\n\t\t\t);\n\t\t\tvec3 fresnelClearcoat = material.clearcoatF0 * t2Clearcoat.x + ( material.clearcoatF90 - material.clearcoatF0 ) * t2Clearcoat.y;\n\t\t\tclearcoatSpecularDirect += lightColor * fresnelClearcoat * LTC_Evaluate( Ncc, viewDir, position, mInvClearcoat, rectCoords );\n\t\t#endif\n\t}\n#endif\nvoid RE_Direct_Physical( const in IncidentLight directLight, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in PhysicalMaterial material, inout ReflectedLight reflectedLight ) {\n\tfloat dotNL = saturate( dot( geometryNormal, directLight.direction ) );\n\tvec3 irradiance = dotNL * directLight.color;\n\t#ifdef USE_CLEARCOAT\n\t\tfloat dotNLcc = saturate( dot( geometryClearcoatNormal, directLight.direction ) );\n\t\tvec3 ccIrradiance = dotNLcc * directLight.color;\n\t\tclearcoatSpecularDirect += ccIrradiance * BRDF_GGX_Clearcoat( directLight.direction, geometryViewDir, geometryClearcoatNormal, material );\n\t#endif\n\t#ifdef USE_SHEEN\n \n \t\tsheenSpecularDirect += irradiance * BRDF_Sheen( directLight.direction, geometryViewDir, geometryNormal, material.sheenColor, material.sheenRoughness );\n \n \t\tfloat sheenAlbedoV = IBLSheenBRDF( geometryNormal, geometryViewDir, material.sheenRoughness );\n \t\tfloat sheenAlbedoL = IBLSheenBRDF( geometryNormal, directLight.direction, material.sheenRoughness );\n \n \t\tfloat sheenEnergyComp = 1.0 - max3( material.sheenColor ) * max( sheenAlbedoV, sheenAlbedoL );\n \n \t\tirradiance *= sheenEnergyComp;\n \n \t#endif\n\tvec3 specularBRDF = BRDF_GGX( directLight.direction, geometryViewDir, geometryNormal, material );\n\t#ifdef USE_RETROREFLECTION\n\t\tvec3 retroViewDir = reflect( - geometryViewDir, geometryNormal );\n\t\tvec3 retroSpecularBRDF = BRDF_GGX( directLight.direction, retroViewDir, geometryNormal, material );\n\t\tspecularBRDF = mix( specularBRDF, retroSpecularBRDF, saturate( material.retroreflectivity ) );\n\t#endif\n\treflectedLight.directSpecular += irradiance * specularBRDF * material.multiScatteringCompensation;\n\tvec3 halfDir = normalize( directLight.direction + geometryViewDir );\n\tfloat dotVH = saturate( dot( geometryViewDir, halfDir ) );\n\tvec3 F = F_Schlick( material.specularColor, material.specularF90, dotVH );\n\t#ifdef USE_RETROREFLECTION\n\t\tvec3 retroHalfDir = normalize( directLight.direction + retroViewDir );\n\t\tfloat dotRetroVH = saturate( dot( retroViewDir, retroHalfDir ) );\n\t\tvec3 retroF = F_Schlick( material.specularColor, material.specularF90, dotRetroVH );\n\t\tF = mix( F, retroF, saturate( material.retroreflectivity ) );\n\t#endif\n\treflectedLight.directDiffuse += irradiance * BRDF_Lambert( material.diffuseContribution ) * ( 1.0 - F );\n}\nvoid RE_IndirectDiffuse_Physical( const in vec3 irradiance, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in PhysicalMaterial material, inout ReflectedLight reflectedLight ) {\n\tvec3 singleScattering = vec3( 0.0 );\n\tvec3 multiScattering = vec3( 0.0 );\n\t#ifdef USE_IRIDESCENCE\n\t\tcomputeMultiscatteringIridescence( material.dfg, material.specularColor, material.specularF90, material.iridescence, material.iridescenceF0Dielectric, singleScattering, multiScattering );\n\t#else\n\t\tcomputeMultiscattering( material.dfg, material.specularColor, material.specularF90, singleScattering, multiScattering );\n\t#endif\n\tvec3 diffuse = irradiance * BRDF_Lambert( material.diffuseContribution ) * ( 1.0 - singleScattering - multiScattering );\n\t#ifdef USE_SHEEN\n\t\tfloat sheenAlbedo = IBLSheenBRDF( geometryNormal, geometryViewDir, material.sheenRoughness );\n\t\tsheenSpecularIndirect += irradiance * material.sheenColor * sheenAlbedo * RECIPROCAL_PI;\n\t\tfloat sheenEnergyComp = 1.0 - max3( material.sheenColor ) * sheenAlbedo;\n\t\tdiffuse *= sheenEnergyComp;\n\t#endif\n\treflectedLight.indirectDiffuse += diffuse;\n}\nvoid RE_IndirectSpecular_Physical( const in vec3 radiance, const in vec3 irradiance, const in vec3 clearcoatRadiance, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in PhysicalMaterial material, inout ReflectedLight reflectedLight) {\n\t#ifdef USE_CLEARCOAT\n\t\tclearcoatSpecularIndirect += clearcoatRadiance * EnvironmentBRDF( geometryClearcoatNormal, geometryViewDir, material.clearcoatF0, material.clearcoatF90, material.clearcoatRoughness );\n\t#endif\n\t#ifdef USE_SHEEN\n\t\tsheenSpecularIndirect += irradiance * material.sheenColor * IBLSheenBRDF( geometryNormal, geometryViewDir, material.sheenRoughness ) * RECIPROCAL_PI;\n \t#endif\n\tvec3 singleScatteringDielectric = vec3( 0.0 );\n\tvec3 multiScatteringDielectric = vec3( 0.0 );\n\tvec3 singleScatteringMetallic = vec3( 0.0 );\n\tvec3 multiScatteringMetallic = vec3( 0.0 );\n\t#ifdef USE_IRIDESCENCE\n\t\tcomputeMultiscatteringIridescence( material.dfg, material.specularColor, material.specularF90, material.iridescence, material.iridescenceF0Dielectric, singleScatteringDielectric, multiScatteringDielectric );\n\t\tcomputeMultiscatteringIridescence( material.dfg, material.diffuseColor, material.specularF90, material.iridescence, material.iridescenceF0Metallic, singleScatteringMetallic, multiScatteringMetallic );\n\t#else\n\t\tcomputeMultiscattering( material.dfg, material.specularColor, material.specularF90, singleScatteringDielectric, multiScatteringDielectric );\n\t\tcomputeMultiscattering( material.dfg, material.diffuseColor, material.specularF90, singleScatteringMetallic, multiScatteringMetallic );\n\t#endif\n\tvec3 singleScattering = mix( singleScatteringDielectric, singleScatteringMetallic, material.metalness );\n\tvec3 multiScattering = mix( multiScatteringDielectric, multiScatteringMetallic, material.metalness );\n\tvec3 totalScatteringDielectric = singleScatteringDielectric + multiScatteringDielectric;\n\tvec3 diffuse = material.diffuseContribution * ( 1.0 - totalScatteringDielectric );\n\tvec3 cosineWeightedIrradiance = irradiance * RECIPROCAL_PI;\n\tvec3 indirectSpecular = radiance * singleScattering;\n\tindirectSpecular += multiScattering * cosineWeightedIrradiance;\n\tvec3 indirectDiffuse = diffuse * cosineWeightedIrradiance;\n\t#ifdef USE_SHEEN\n\t\tfloat sheenAlbedo = IBLSheenBRDF( geometryNormal, geometryViewDir, material.sheenRoughness );\n\t\tfloat sheenEnergyComp = 1.0 - max3( material.sheenColor ) * sheenAlbedo;\n\t\tindirectSpecular *= sheenEnergyComp;\n\t\tindirectDiffuse *= sheenEnergyComp;\n\t#endif\n\treflectedLight.indirectSpecular += indirectSpecular;\n\treflectedLight.indirectDiffuse += indirectDiffuse;\n}\n#define RE_Direct\t\t\t\tRE_Direct_Physical\n#define RE_Direct_RectArea\t\tRE_Direct_RectArea_Physical\n#define RE_IndirectDiffuse\t\tRE_IndirectDiffuse_Physical\n#define RE_IndirectSpecular\t\tRE_IndirectSpecular_Physical\nfloat computeSpecularOcclusion( const in float dotNV, const in float ambientOcclusion, const in float roughness ) {\n\treturn saturate( pow( dotNV + ambientOcclusion, exp2( - 16.0 * roughness - 1.0 ) ) - 1.0 + ambientOcclusion );\n}";
+
+var lights_fragment_begin = "\nvec3 geometryPosition = - vViewPosition;\nvec3 geometryNormal = normal;\nvec3 geometryViewDir = ( isOrthographic ) ? vec3( 0, 0, 1 ) : normalize( vViewPosition );\nvec3 geometryClearcoatNormal = vec3( 0.0 );\n#ifdef USE_CLEARCOAT\n\tgeometryClearcoatNormal = clearcoatNormal;\n#endif\n#ifdef USE_IRIDESCENCE\n\tfloat dotNVi = saturate( dot( normal, geometryViewDir ) );\n\tif ( material.iridescenceThickness == 0.0 ) {\n\t\tmaterial.iridescence = 0.0;\n\t} else {\n\t\tmaterial.iridescence = saturate( material.iridescence );\n\t}\n\tif ( material.iridescence > 0.0 ) {\n\t\tvec3 iridescenceFresnelDielectric = evalIridescence( 1.0, material.iridescenceIOR, dotNVi, material.iridescenceThickness, material.specularColor );\n\t\tvec3 iridescenceFresnelMetallic = evalIridescence( 1.0, material.iridescenceIOR, dotNVi, material.iridescenceThickness, material.diffuseColor );\n\t\tmaterial.iridescenceFresnel = mix( iridescenceFresnelDielectric, iridescenceFresnelMetallic, material.metalness );\n\t\tmaterial.iridescenceF0Dielectric = Schlick_to_F0( iridescenceFresnelDielectric, 1.0, dotNVi );\n\t\tmaterial.iridescenceF0Metallic = Schlick_to_F0( iridescenceFresnelMetallic, 1.0, dotNVi );\n\t}\n#endif\n#ifdef STANDARD\n\tfloat dotNVms = saturate( dot( geometryNormal, geometryViewDir ) );\n\tmaterial.dfg = texture2D( dfgLUT, vec2( material.roughness, dotNVms ) ).rg;\n\t#if ( NUM_SUN_LIGHTS > 0 || NUM_DIR_LIGHTS > 0 || NUM_POINT_LIGHTS > 0 || NUM_SPOT_LIGHTS > 0 )\n\t\tfloat EssMs = material.dfg.x + material.dfg.y;\n\t\tmaterial.multiScatteringCompensation = 1.0 + material.specularColorBlended * ( 1.0 / EssMs - 1.0 );\n\t#endif\n#endif\nIncidentLight directLight;\n#if ( NUM_POINT_LIGHTS > 0 ) && defined( RE_Direct )\n\tPointLight pointLight;\n\t#if defined( USE_SHADOWMAP ) && NUM_POINT_LIGHT_SHADOWS > 0\n\tPointLightShadow pointLightShadow;\n\t#endif\n\t#pragma unroll_loop_start\n\tfor ( int i = 0; i < NUM_POINT_LIGHTS; i ++ ) {\n\t\tpointLight = pointLights[ i ];\n\t\tgetPointLightInfo( pointLight, geometryPosition, directLight );\n\t\t#if defined( USE_SHADOWMAP ) && ( UNROLLED_LOOP_INDEX < NUM_POINT_LIGHT_SHADOWS ) && ( defined( SHADOWMAP_TYPE_PCF ) || defined( SHADOWMAP_TYPE_BASIC ) )\n\t\tpointLightShadow = pointLightShadows[ i ];\n\t\tdirectLight.color *= ( directLight.visible && receiveShadow ) ? getPointShadow( pointShadowMap[ i ], pointLightShadow.shadowMapSize, pointLightShadow.shadowIntensity, pointLightShadow.shadowBias, pointLightShadow.shadowRadius, vPointShadowCoord[ i ], pointLightShadow.shadowCameraNear, pointLightShadow.shadowCameraFar ) : 1.0;\n\t\t#endif\n\t\tRE_Direct( directLight, geometryPosition, geometryNormal, geometryViewDir, geometryClearcoatNormal, material, reflectedLight );\n\t}\n\t#pragma unroll_loop_end\n#endif\n#if ( NUM_SPOT_LIGHTS > 0 ) && defined( RE_Direct )\n\tSpotLight spotLight;\n\tvec4 spotColor;\n\tvec3 spotLightCoord;\n\tbool inSpotLightMap;\n\t#if defined( USE_SHADOWMAP ) && NUM_SPOT_LIGHT_SHADOWS > 0\n\tSpotLightShadow spotLightShadow;\n\t#endif\n\t#pragma unroll_loop_start\n\tfor ( int i = 0; i < NUM_SPOT_LIGHTS; i ++ ) {\n\t\tspotLight = spotLights[ i ];\n\t\tgetSpotLightInfo( spotLight, geometryPosition, directLight );\n\t\t#if ( UNROLLED_LOOP_INDEX < NUM_SPOT_LIGHT_SHADOWS_WITH_MAPS )\n\t\t#define SPOT_LIGHT_MAP_INDEX UNROLLED_LOOP_INDEX\n\t\t#elif ( UNROLLED_LOOP_INDEX < NUM_SPOT_LIGHT_SHADOWS )\n\t\t#define SPOT_LIGHT_MAP_INDEX NUM_SPOT_LIGHT_MAPS\n\t\t#else\n\t\t#define SPOT_LIGHT_MAP_INDEX ( UNROLLED_LOOP_INDEX - NUM_SPOT_LIGHT_SHADOWS + NUM_SPOT_LIGHT_SHADOWS_WITH_MAPS )\n\t\t#endif\n\t\t#if ( SPOT_LIGHT_MAP_INDEX < NUM_SPOT_LIGHT_MAPS )\n\t\t\tspotLightCoord = vSpotLightCoord[ i ].xyz / vSpotLightCoord[ i ].w;\n\t\t\tinSpotLightMap = all( lessThan( abs( spotLightCoord * 2. - 1. ), vec3( 1.0 ) ) );\n\t\t\tspotColor = texture2D( spotLightMap[ SPOT_LIGHT_MAP_INDEX ], spotLightCoord.xy );\n\t\t\tdirectLight.color = inSpotLightMap ? directLight.color * spotColor.rgb : directLight.color;\n\t\t#endif\n\t\t#undef SPOT_LIGHT_MAP_INDEX\n\t\t#if defined( USE_SHADOWMAP ) && ( UNROLLED_LOOP_INDEX < NUM_SPOT_LIGHT_SHADOWS )\n\t\tspotLightShadow = spotLightShadows[ i ];\n\t\tdirectLight.color *= ( directLight.visible && receiveShadow ) ? getShadow( spotShadowMap[ i ], spotLightShadow.shadowMapSize, spotLightShadow.shadowIntensity, spotLightShadow.shadowBias, spotLightShadow.shadowRadius, vSpotLightCoord[ i ] ) : 1.0;\n\t\t#endif\n\t\tRE_Direct( directLight, geometryPosition, geometryNormal, geometryViewDir, geometryClearcoatNormal, material, reflectedLight );\n\t}\n\t#pragma unroll_loop_end\n#endif\n#if ( NUM_SUN_LIGHTS > 0 ) && defined( RE_Direct )\n\tSunLight sunLight;\n\t#if defined( USE_SHADOWMAP ) && NUM_SUN_LIGHT_SHADOWS > 0\n\tSunLightShadow sunLightShadow;\n\t#endif\n\t#pragma unroll_loop_start\n\tfor ( int i = 0; i < NUM_SUN_LIGHTS; i ++ ) {\n\t\tsunLight = sunLights[ i ];\n\t\tgetSunLightInfo( sunLight, directLight );\n\t\t#if defined( USE_SHADOWMAP ) && ( UNROLLED_LOOP_INDEX < NUM_SUN_LIGHT_SHADOWS )\n\t\tsunLightShadow = sunLightShadows[ i ];\n\t\tdirectLight.color *= ( directLight.visible && receiveShadow ) ? getSunShadow( sunShadowMap[ i ], sunLightShadow, UNROLLED_LOOP_INDEX ) : 1.0;\n\t\t#endif\n\t\tRE_Direct( directLight, geometryPosition, geometryNormal, geometryViewDir, geometryClearcoatNormal, material, reflectedLight );\n\t}\n\t#pragma unroll_loop_end\n#endif\n#if ( NUM_DIR_LIGHTS > 0 ) && defined( RE_Direct )\n\tDirectionalLight directionalLight;\n\t#if defined( USE_SHADOWMAP ) && NUM_DIR_LIGHT_SHADOWS > 0\n\tDirectionalLightShadow directionalLightShadow;\n\t#endif\n\t#pragma unroll_loop_start\n\tfor ( int i = 0; i < NUM_DIR_LIGHTS; i ++ ) {\n\t\tdirectionalLight = directionalLights[ i ];\n\t\tgetDirectionalLightInfo( directionalLight, directLight );\n\t\t#if defined( USE_SHADOWMAP ) && ( UNROLLED_LOOP_INDEX < NUM_DIR_LIGHT_SHADOWS )\n\t\tdirectionalLightShadow = directionalLightShadows[ i ];\n\t\tdirectLight.color *= ( directLight.visible && receiveShadow ) ? getShadow( directionalShadowMap[ i ], directionalLightShadow.shadowMapSize, directionalLightShadow.shadowIntensity, directionalLightShadow.shadowBias, directionalLightShadow.shadowRadius, vDirectionalShadowCoord[ i ] ) : 1.0;\n\t\t#endif\n\t\tRE_Direct( directLight, geometryPosition, geometryNormal, geometryViewDir, geometryClearcoatNormal, material, reflectedLight );\n\t}\n\t#pragma unroll_loop_end\n#endif\n#if ( NUM_RECT_AREA_LIGHTS > 0 ) && defined( RE_Direct_RectArea )\n\tRectAreaLight rectAreaLight;\n\t#pragma unroll_loop_start\n\tfor ( int i = 0; i < NUM_RECT_AREA_LIGHTS; i ++ ) {\n\t\trectAreaLight = rectAreaLights[ i ];\n\t\tRE_Direct_RectArea( rectAreaLight, geometryPosition, geometryNormal, geometryViewDir, geometryClearcoatNormal, material, reflectedLight );\n\t}\n\t#pragma unroll_loop_end\n#endif\n#if defined( RE_IndirectDiffuse )\n\tvec3 iblIrradiance = vec3( 0.0 );\n\tvec3 irradiance = getAmbientLightIrradiance( ambientLightColor );\n\t#if defined( USE_LIGHT_PROBES )\n\t\tirradiance += getLightProbeIrradiance( lightProbe, geometryNormal );\n\t#endif\n\t#if ( NUM_HEMI_LIGHTS > 0 )\n\t\t#pragma unroll_loop_start\n\t\tfor ( int i = 0; i < NUM_HEMI_LIGHTS; i ++ ) {\n\t\t\tirradiance += getHemisphereLightIrradiance( hemisphereLights[ i ], geometryNormal );\n\t\t}\n\t\t#pragma unroll_loop_end\n\t#endif\n\t#ifdef USE_LIGHT_PROBES_GRID\n\t\tvec3 probeWorldPos = ( ( vec4( geometryPosition, 1.0 ) - viewMatrix[ 3 ] ) * viewMatrix ).xyz;\n\t\tvec3 probeWorldNormal = transformNormalByInverseViewMatrix( geometryNormal, viewMatrix );\n\t\tirradiance += getLightProbeGridIrradiance( probeWorldPos, probeWorldNormal );\n\t#endif\n#endif\n#if defined( RE_IndirectSpecular )\n\tvec3 radiance = vec3( 0.0 );\n\tvec3 clearcoatRadiance = vec3( 0.0 );\n#endif";
+
+var lights_fragment_maps = "#if defined( RE_IndirectDiffuse )\n\t#ifdef USE_LIGHTMAP\n\t\tvec4 lightMapTexel = texture2D( lightMap, vLightMapUv );\n\t\tvec3 lightMapIrradiance = lightMapTexel.rgb * lightMapIntensity;\n\t\tirradiance += lightMapIrradiance;\n\t#endif\n\t#if defined( USE_ENVMAP ) && defined( ENVMAP_TYPE_CUBE_UV )\n\t\t#if defined( STANDARD ) || defined( LAMBERT ) || defined( PHONG )\n\t\t\tiblIrradiance += getIBLIrradiance( geometryNormal );\n\t\t#endif\n\t#endif\n#endif\n#if defined( USE_ENVMAP ) && defined( RE_IndirectSpecular )\n\t#ifdef USE_ANISOTROPY\n\t\tvec3 iblRadiance = getIBLAnisotropyRadiance( geometryViewDir, geometryNormal, material.roughness, material.anisotropyB, material.anisotropy );\n\t#else\n\t\tvec3 iblRadiance = getIBLRadiance( geometryViewDir, geometryNormal, material.roughness );\n\t#endif\n\t#ifdef USE_RETROREFLECTION\n\t\t#ifdef USE_ANISOTROPY\n\t\t\tvec3 retroIBLRadiance = getIBLAnisotropyRetroRadiance( geometryViewDir, geometryNormal, material.roughness, material.anisotropyB, material.anisotropy );\n\t\t#else\n\t\t\tvec3 retroIBLRadiance = getIBLRetroRadiance( geometryViewDir, geometryNormal, material.roughness );\n\t\t#endif\n\t\tiblRadiance = mix( iblRadiance, retroIBLRadiance, saturate( material.retroreflectivity ) );\n\t#endif\n\tradiance += iblRadiance;\n\t#ifdef USE_CLEARCOAT\n\t\tclearcoatRadiance += getIBLRadiance( geometryViewDir, geometryClearcoatNormal, material.clearcoatRoughness );\n\t#endif\n#endif";
+
+var lights_fragment_end = "#if defined( RE_IndirectDiffuse )\n\t#if defined( LAMBERT ) || defined( PHONG )\n\t\tirradiance += iblIrradiance;\n\t#endif\n\tRE_IndirectDiffuse( irradiance, geometryPosition, geometryNormal, geometryViewDir, geometryClearcoatNormal, material, reflectedLight );\n#endif\n#if defined( RE_IndirectSpecular )\n\tRE_IndirectSpecular( radiance, iblIrradiance, clearcoatRadiance, geometryPosition, geometryNormal, geometryViewDir, geometryClearcoatNormal, material, reflectedLight );\n#endif";
+
+var lightprobes_pars_fragment = "#ifdef USE_LIGHT_PROBES_GRID\nuniform highp sampler3D probesSH;\nuniform vec3 probesMin;\nuniform vec3 probesMax;\nuniform vec3 probesResolution;\nvec3 getLightProbeGridIrradiance( vec3 worldPos, vec3 worldNormal ) {\n\tvec3 res = probesResolution;\n\tvec3 gridRange = probesMax - probesMin;\n\tvec3 resMinusOne = res - 1.0;\n\tvec3 probeSpacing = gridRange / resMinusOne;\n\tvec3 samplePos = worldPos + worldNormal * probeSpacing * 0.5;\n\tvec3 uvw = clamp( ( samplePos - probesMin ) / gridRange, 0.0, 1.0 );\n\tuvw = uvw * resMinusOne / res + 0.5 / res;\n\tfloat nz          = res.z;\n\tfloat paddedSlices = nz + 2.0;\n\tfloat atlasDepth  = 7.0 * paddedSlices;\n\tfloat uvZBase     = uvw.z * nz + 1.0;\n\tvec4 s0 = texture( probesSH, vec3( uvw.xy, ( uvZBase                       ) / atlasDepth ) );\n\tvec4 s1 = texture( probesSH, vec3( uvw.xy, ( uvZBase +       paddedSlices   ) / atlasDepth ) );\n\tvec4 s2 = texture( probesSH, vec3( uvw.xy, ( uvZBase + 2.0 * paddedSlices   ) / atlasDepth ) );\n\tvec4 s3 = texture( probesSH, vec3( uvw.xy, ( uvZBase + 3.0 * paddedSlices   ) / atlasDepth ) );\n\tvec4 s4 = texture( probesSH, vec3( uvw.xy, ( uvZBase + 4.0 * paddedSlices   ) / atlasDepth ) );\n\tvec4 s5 = texture( probesSH, vec3( uvw.xy, ( uvZBase + 5.0 * paddedSlices   ) / atlasDepth ) );\n\tvec4 s6 = texture( probesSH, vec3( uvw.xy, ( uvZBase + 6.0 * paddedSlices   ) / atlasDepth ) );\n\tvec3 c0 = s0.xyz;\n\tvec3 c1 = vec3( s0.w, s1.xy );\n\tvec3 c2 = vec3( s1.zw, s2.x );\n\tvec3 c3 = s2.yzw;\n\tvec3 c4 = s3.xyz;\n\tvec3 c5 = vec3( s3.w, s4.xy );\n\tvec3 c6 = vec3( s4.zw, s5.x );\n\tvec3 c7 = s5.yzw;\n\tvec3 c8 = s6.xyz;\n\tfloat x = worldNormal.x, y = worldNormal.y, z = worldNormal.z;\n\tvec3 result = c0 * 0.886227;\n\tresult += c1 * 2.0 * 0.511664 * y;\n\tresult += c2 * 2.0 * 0.511664 * z;\n\tresult += c3 * 2.0 * 0.511664 * x;\n\tresult += c4 * 2.0 * 0.429043 * x * y;\n\tresult += c5 * 2.0 * 0.429043 * y * z;\n\tresult += c6 * ( 0.743125 * z * z - 0.247708 );\n\tresult += c7 * 2.0 * 0.429043 * x * z;\n\tresult += c8 * 0.429043 * ( x * x - y * y );\n\treturn max( result, vec3( 0.0 ) );\n}\n#endif";
+
+var logdepthbuf_fragment = "#if defined( USE_LOGARITHMIC_DEPTH_BUFFER )\n\tgl_FragDepth = vIsPerspective == 0.0 ? gl_FragCoord.z : log2( vFragDepth ) * logDepthBufFC * 0.5;\n#endif";
+
+var logdepthbuf_pars_fragment = "#if defined( USE_LOGARITHMIC_DEPTH_BUFFER )\n\tuniform float logDepthBufFC;\n\tvarying float vFragDepth;\n\tvarying float vIsPerspective;\n#endif";
+
+var logdepthbuf_pars_vertex = "#ifdef USE_LOGARITHMIC_DEPTH_BUFFER\n\tvarying float vFragDepth;\n\tvarying float vIsPerspective;\n#endif";
+
+var logdepthbuf_vertex = "#ifdef USE_LOGARITHMIC_DEPTH_BUFFER\n\tvFragDepth = 1.0 + gl_Position.w;\n\tvIsPerspective = float( isPerspectiveMatrix( projectionMatrix ) );\n#endif";
+
+var map_fragment = "#ifdef USE_MAP\n\tvec4 sampledDiffuseColor = texture2D( map, vMapUv );\n\t#ifdef DECODE_VIDEO_TEXTURE\n\t\tsampledDiffuseColor = sRGBTransferEOTF( sampledDiffuseColor );\n\t#endif\n\tdiffuseColor *= sampledDiffuseColor;\n#endif";
+
+var map_pars_fragment = "#ifdef USE_MAP\n\tuniform sampler2D map;\n#endif";
+
+var map_particle_fragment = "#if defined( USE_MAP ) || defined( USE_ALPHAMAP )\n\t#if defined( USE_POINTS_UV )\n\t\tvec2 uv = vUv;\n\t#else\n\t\tvec2 uv = ( uvTransform * vec3( gl_PointCoord.x, 1.0 - gl_PointCoord.y, 1 ) ).xy;\n\t#endif\n#endif\n#ifdef USE_MAP\n\tdiffuseColor *= texture2D( map, uv );\n#endif\n#ifdef USE_ALPHAMAP\n\tdiffuseColor.a *= texture2D( alphaMap, uv ).g;\n#endif";
+
+var map_particle_pars_fragment = "#if defined( USE_POINTS_UV )\n\tvarying vec2 vUv;\n#else\n\t#if defined( USE_MAP ) || defined( USE_ALPHAMAP )\n\t\tuniform mat3 uvTransform;\n\t#endif\n#endif\n#ifdef USE_MAP\n\tuniform sampler2D map;\n#endif\n#ifdef USE_ALPHAMAP\n\tuniform sampler2D alphaMap;\n#endif";
+
+var metalnessmap_fragment = "float metalnessFactor = metalness;\n#ifdef USE_METALNESSMAP\n\tvec4 texelMetalness = texture2D( metalnessMap, vMetalnessMapUv );\n\tmetalnessFactor *= texelMetalness.b;\n#endif";
+
+var metalnessmap_pars_fragment = "#ifdef USE_METALNESSMAP\n\tuniform sampler2D metalnessMap;\n#endif";
+
+var morphinstance_vertex = "#ifdef USE_INSTANCING_MORPH\n\tfloat morphTargetInfluences[ MORPHTARGETS_COUNT ];\n\tfloat morphTargetBaseInfluence = texelFetch( morphTexture, ivec2( 0, gl_InstanceID ), 0 ).r;\n\tfor ( int i = 0; i < MORPHTARGETS_COUNT; i ++ ) {\n\t\tmorphTargetInfluences[i] =  texelFetch( morphTexture, ivec2( i + 1, gl_InstanceID ), 0 ).r;\n\t}\n#endif";
+
+var morphcolor_vertex = "#if defined( USE_MORPHCOLORS )\n\tvColor *= morphTargetBaseInfluence;\n\tfor ( int i = 0; i < MORPHTARGETS_COUNT; i ++ ) {\n\t\t#if defined( USE_COLOR_ALPHA )\n\t\t\tif ( morphTargetInfluences[ i ] != 0.0 ) vColor += getMorph( gl_VertexID, i, 2 ) * morphTargetInfluences[ i ];\n\t\t#elif defined( USE_COLOR )\n\t\t\tif ( morphTargetInfluences[ i ] != 0.0 ) vColor += getMorph( gl_VertexID, i, 2 ).rgb * morphTargetInfluences[ i ];\n\t\t#endif\n\t}\n#endif";
+
+var morphnormal_vertex = "#ifdef USE_MORPHNORMALS\n\tobjectNormal *= morphTargetBaseInfluence;\n\tfor ( int i = 0; i < MORPHTARGETS_COUNT; i ++ ) {\n\t\tif ( morphTargetInfluences[ i ] != 0.0 ) objectNormal += getMorph( gl_VertexID, i, 1 ).xyz * morphTargetInfluences[ i ];\n\t}\n#endif";
+
+var morphtarget_pars_vertex = "#ifdef USE_MORPHTARGETS\n\t#ifndef USE_INSTANCING_MORPH\n\t\tuniform float morphTargetBaseInfluence;\n\t\tuniform float morphTargetInfluences[ MORPHTARGETS_COUNT ];\n\t#endif\n\tuniform sampler2DArray morphTargetsTexture;\n\tuniform ivec2 morphTargetsTextureSize;\n\tvec4 getMorph( const in int vertexIndex, const in int morphTargetIndex, const in int offset ) {\n\t\tint texelIndex = vertexIndex * MORPHTARGETS_TEXTURE_STRIDE + offset;\n\t\tint y = texelIndex / morphTargetsTextureSize.x;\n\t\tint x = texelIndex - y * morphTargetsTextureSize.x;\n\t\tivec3 morphUV = ivec3( x, y, morphTargetIndex );\n\t\treturn texelFetch( morphTargetsTexture, morphUV, 0 );\n\t}\n#endif";
+
+var morphtarget_vertex = "#ifdef USE_MORPHTARGETS\n\ttransformed *= morphTargetBaseInfluence;\n\tfor ( int i = 0; i < MORPHTARGETS_COUNT; i ++ ) {\n\t\tif ( morphTargetInfluences[ i ] != 0.0 ) transformed += getMorph( gl_VertexID, i, 0 ).xyz * morphTargetInfluences[ i ];\n\t}\n#endif";
+
+var normal_fragment_begin = "float faceDirection = gl_FrontFacing ? 1.0 : - 1.0;\n#ifdef FLAT_SHADED\n\tvec3 fdx = dFdx( vViewPosition );\n\tvec3 fdy = dFdy( vViewPosition );\n\tvec3 normal = normalize( cross( fdx, fdy ) );\n#else\n\tvec3 normal = normalize( vNormal );\n\t#ifdef DOUBLE_SIDED\n\t\tnormal *= faceDirection;\n\t#endif\n#endif\n#if defined( USE_NORMALMAP_TANGENTSPACE ) || defined( USE_CLEARCOAT_NORMALMAP ) || defined( USE_ANISOTROPY )\n\t#ifdef USE_TANGENT\n\t\tmat3 tbn = mat3( normalize( vTangent ), normalize( vBitangent ), normal );\n\t#else\n\t\tmat3 tbn = getTangentFrame( - vViewPosition, normal,\n\t\t#if defined( USE_NORMALMAP )\n\t\t\tvNormalMapUv\n\t\t#elif defined( USE_CLEARCOAT_NORMALMAP )\n\t\t\tvClearcoatNormalMapUv\n\t\t#else\n\t\t\tvUv\n\t\t#endif\n\t\t);\n\t#endif\n\t#ifdef DOUBLE_SIDED\n\t\ttbn[0] *= faceDirection;\n\t\ttbn[1] *= faceDirection;\n\t#endif\n#endif\n#ifdef USE_CLEARCOAT_NORMALMAP\n\t#ifdef USE_TANGENT\n\t\tmat3 tbn2 = mat3( normalize( vTangent ), normalize( vBitangent ), normal );\n\t#else\n\t\tmat3 tbn2 = getTangentFrame( - vViewPosition, normal, vClearcoatNormalMapUv );\n\t#endif\n\t#ifdef DOUBLE_SIDED\n\t\ttbn2[0] *= faceDirection;\n\t\ttbn2[1] *= faceDirection;\n\t#endif\n#endif\nvec3 nonPerturbedNormal = normal;";
+
+var normal_fragment_maps = "#ifdef USE_NORMALMAP_OBJECTSPACE\n\tnormal = texture2D( normalMap, vNormalMapUv ).xyz * 2.0 - 1.0;\n\t#ifdef FLIP_SIDED\n\t\tnormal = - normal;\n\t#endif\n\t#ifdef DOUBLE_SIDED\n\t\tnormal = normal * faceDirection;\n\t#endif\n\tnormal = normalize( normalMatrix * normal );\n#elif defined( USE_NORMALMAP_TANGENTSPACE )\n\tvec3 mapN = texture2D( normalMap, vNormalMapUv ).xyz * 2.0 - 1.0;\n\t#if defined( USE_PACKED_NORMALMAP )\n\t\tmapN = vec3( mapN.xy, sqrt( saturate( 1.0 - dot( mapN.xy, mapN.xy ) ) ) );\n\t#endif\n\tmapN.xy *= normalScale;\n\tnormal = normalize( tbn * mapN );\n#elif defined( USE_BUMPMAP )\n\tnormal = perturbNormalArb( - vViewPosition, normal, dHdxy_fwd(), faceDirection );\n#endif";
+
+var normal_pars_fragment = "#ifndef FLAT_SHADED\n\tvarying vec3 vNormal;\n\t#ifdef USE_TANGENT\n\t\tvarying vec3 vTangent;\n\t\tvarying vec3 vBitangent;\n\t#endif\n#endif";
+
+var normal_pars_vertex = "#ifndef FLAT_SHADED\n\tvarying vec3 vNormal;\n\t#ifdef USE_TANGENT\n\t\tvarying vec3 vTangent;\n\t\tvarying vec3 vBitangent;\n\t#endif\n#endif";
+
+var normal_vertex = "#ifndef FLAT_SHADED\n\tvNormal = normalize( transformedNormal );\n\t#ifdef USE_TANGENT\n\t\tvTangent = normalize( transformedTangent );\n\t\tvBitangent = normalize( cross( vNormal, vTangent ) * tangent.w );\n\t\t#ifdef FLIP_SIDED\n\t\t\tvBitangent = - vBitangent;\n\t\t#endif\n\t#endif\n#endif";
+
+var normalmap_pars_fragment = "#ifdef USE_NORMALMAP\n\tuniform sampler2D normalMap;\n\tuniform vec2 normalScale;\n#endif\n#ifdef USE_NORMALMAP_OBJECTSPACE\n\tuniform mat3 normalMatrix;\n#endif\n#if ! defined ( USE_TANGENT ) && ( defined ( USE_NORMALMAP_TANGENTSPACE ) || defined ( USE_CLEARCOAT_NORMALMAP ) || defined( USE_ANISOTROPY ) )\n\tmat3 getTangentFrame( vec3 eye_pos, vec3 surf_norm, vec2 uv ) {\n\t\tvec3 q0 = dFdx( eye_pos.xyz );\n\t\tvec3 q1 = dFdy( eye_pos.xyz );\n\t\tvec2 st0 = dFdx( uv.st );\n\t\tvec2 st1 = dFdy( uv.st );\n\t\tvec3 N = surf_norm;\n\t\tvec3 q1perp = cross( q1, N );\n\t\tvec3 q0perp = cross( N, q0 );\n\t\tvec3 T = q1perp * st0.x + q0perp * st1.x;\n\t\tvec3 B = q1perp * st0.y + q0perp * st1.y;\n\t\tfloat det = max( dot( T, T ), dot( B, B ) );\n\t\tfloat scale = ( det == 0.0 ) ? 0.0 : inversesqrt( det );\n\t\treturn mat3( T * scale, B * scale, N );\n\t}\n#endif";
+
+var clearcoat_normal_fragment_begin = "#ifdef USE_CLEARCOAT\n\tvec3 clearcoatNormal = nonPerturbedNormal;\n#endif";
+
+var clearcoat_normal_fragment_maps = "#ifdef USE_CLEARCOAT_NORMALMAP\n\tvec3 clearcoatMapN = texture2D( clearcoatNormalMap, vClearcoatNormalMapUv ).xyz * 2.0 - 1.0;\n\tclearcoatMapN.xy *= clearcoatNormalScale;\n\tclearcoatNormal = normalize( tbn2 * clearcoatMapN );\n#endif";
+
+var clearcoat_pars_fragment = "#ifdef USE_CLEARCOATMAP\n\tuniform sampler2D clearcoatMap;\n#endif\n#ifdef USE_CLEARCOAT_NORMALMAP\n\tuniform sampler2D clearcoatNormalMap;\n\tuniform vec2 clearcoatNormalScale;\n#endif\n#ifdef USE_CLEARCOAT_ROUGHNESSMAP\n\tuniform sampler2D clearcoatRoughnessMap;\n#endif";
+
+var iridescence_pars_fragment = "#ifdef USE_IRIDESCENCEMAP\n\tuniform sampler2D iridescenceMap;\n#endif\n#ifdef USE_IRIDESCENCE_THICKNESSMAP\n\tuniform sampler2D iridescenceThicknessMap;\n#endif";
+
+var opaque_fragment = "#ifdef OPAQUE\ndiffuseColor.a = 1.0;\n#endif\n#ifdef USE_TRANSMISSION\ndiffuseColor.a *= material.transmissionAlpha;\n#endif\ngl_FragColor = vec4( outgoingLight, diffuseColor.a );";
+
+var packing = "vec3 packNormalToRGB( const in vec3 normal ) {\n\treturn normalize( normal ) * 0.5 + 0.5;\n}\nvec3 unpackRGBToNormal( const in vec3 rgb ) {\n\treturn 2.0 * rgb.xyz - 1.0;\n}\nconst float PackUpscale = 256. / 255.;const float UnpackDownscale = 255. / 256.;const float ShiftRight8 = 1. / 256.;\nconst float Inv255 = 1. / 255.;\nconst vec4 PackFactors = vec4( 1.0, 256.0, 256.0 * 256.0, 256.0 * 256.0 * 256.0 );\nconst vec2 UnpackFactors2 = vec2( UnpackDownscale, 1.0 / PackFactors.g );\nconst vec3 UnpackFactors3 = vec3( UnpackDownscale / PackFactors.rg, 1.0 / PackFactors.b );\nconst vec4 UnpackFactors4 = vec4( UnpackDownscale / PackFactors.rgb, 1.0 / PackFactors.a );\nvec4 packDepthToRGBA( const in float v ) {\n\tif( v <= 0.0 )\n\t\treturn vec4( 0., 0., 0., 0. );\n\tif( v >= 1.0 )\n\t\treturn vec4( 1., 1., 1., 1. );\n\tfloat vuf;\n\tfloat af = modf( v * PackFactors.a, vuf );\n\tfloat bf = modf( vuf * ShiftRight8, vuf );\n\tfloat gf = modf( vuf * ShiftRight8, vuf );\n\treturn vec4( vuf * Inv255, gf * PackUpscale, bf * PackUpscale, af );\n}\nvec3 packDepthToRGB( const in float v ) {\n\tif( v <= 0.0 )\n\t\treturn vec3( 0., 0., 0. );\n\tif( v >= 1.0 )\n\t\treturn vec3( 1., 1., 1. );\n\tfloat vuf;\n\tfloat bf = modf( v * PackFactors.b, vuf );\n\tfloat gf = modf( vuf * ShiftRight8, vuf );\n\treturn vec3( vuf * Inv255, gf * PackUpscale, bf );\n}\nvec2 packDepthToRG( const in float v ) {\n\tif( v <= 0.0 )\n\t\treturn vec2( 0., 0. );\n\tif( v >= 1.0 )\n\t\treturn vec2( 1., 1. );\n\tfloat vuf;\n\tfloat gf = modf( v * 256., vuf );\n\treturn vec2( vuf * Inv255, gf );\n}\nfloat unpackRGBAToDepth( const in vec4 v ) {\n\treturn dot( v, UnpackFactors4 );\n}\nfloat unpackRGBToDepth( const in vec3 v ) {\n\treturn dot( v, UnpackFactors3 );\n}\nfloat unpackRGToDepth( const in vec2 v ) {\n\treturn v.r * UnpackFactors2.r + v.g * UnpackFactors2.g;\n}\nvec4 pack2HalfToRGBA( const in vec2 v ) {\n\tvec4 r = vec4( v.x, fract( v.x * 255.0 ), v.y, fract( v.y * 255.0 ) );\n\treturn vec4( r.x - r.y / 255.0, r.y, r.z - r.w / 255.0, r.w );\n}\nvec2 unpackRGBATo2Half( const in vec4 v ) {\n\treturn vec2( v.x + ( v.y / 255.0 ), v.z + ( v.w / 255.0 ) );\n}\nfloat viewZToOrthographicDepth( const in float viewZ, const in float near, const in float far ) {\n\treturn ( viewZ + near ) / ( near - far );\n}\nfloat orthographicDepthToViewZ( const in float depth, const in float near, const in float far ) {\n\t#ifdef USE_REVERSED_DEPTH_BUFFER\n\t\n\t\treturn depth * ( far - near ) - far;\n\t#else\n\t\treturn depth * ( near - far ) - near;\n\t#endif\n}\nfloat viewZToPerspectiveDepth( const in float viewZ, const in float near, const in float far ) {\n\treturn ( ( near + viewZ ) * far ) / ( ( far - near ) * viewZ );\n}\nfloat perspectiveDepthToViewZ( const in float depth, const in float near, const in float far ) {\n\t\n\t#ifdef USE_REVERSED_DEPTH_BUFFER\n\t\treturn ( near * far ) / ( ( near - far ) * depth - near );\n\t#else\n\t\treturn ( near * far ) / ( ( far - near ) * depth - far );\n\t#endif\n}";
+
+var premultiplied_alpha_fragment = "#ifdef PREMULTIPLIED_ALPHA\n\tgl_FragColor.rgb *= gl_FragColor.a;\n#endif";
+
+var project_vertex = "vec4 mvPosition = vec4( transformed, 1.0 );\n#ifdef USE_BATCHING\n\tmvPosition = batchingMatrix * mvPosition;\n#endif\n#ifdef USE_INSTANCING\n\tmvPosition = instanceMatrix * mvPosition;\n#endif\nmvPosition = modelViewMatrix * mvPosition;\ngl_Position = projectionMatrix * mvPosition;";
+
+var dithering_fragment = "#ifdef DITHERING\n\tgl_FragColor.rgb = dithering( gl_FragColor.rgb );\n#endif";
+
+var dithering_pars_fragment = "#ifdef DITHERING\n\tvec3 dithering( vec3 color ) {\n\t\tfloat grid_position = rand( gl_FragCoord.xy );\n\t\tvec3 dither_shift_RGB = vec3( 0.25 / 255.0, -0.25 / 255.0, 0.25 / 255.0 );\n\t\tdither_shift_RGB = mix( 2.0 * dither_shift_RGB, -2.0 * dither_shift_RGB, grid_position );\n\t\treturn color + dither_shift_RGB;\n\t}\n#endif";
+
+var roughnessmap_fragment = "float roughnessFactor = roughness;\n#ifdef USE_ROUGHNESSMAP\n\tvec4 texelRoughness = texture2D( roughnessMap, vRoughnessMapUv );\n\troughnessFactor *= texelRoughness.g;\n#endif";
+
+var roughnessmap_pars_fragment = "#ifdef USE_ROUGHNESSMAP\n\tuniform sampler2D roughnessMap;\n#endif";
+
+var shadowmap_pars_fragment = "#if NUM_SPOT_LIGHT_COORDS > 0\n\tvarying vec4 vSpotLightCoord[ NUM_SPOT_LIGHT_COORDS ];\n#endif\n#if NUM_SPOT_LIGHT_MAPS > 0\n\tuniform sampler2D spotLightMap[ NUM_SPOT_LIGHT_MAPS ];\n#endif\n#ifdef USE_SHADOWMAP\n\t#if NUM_SUN_LIGHT_SHADOWS > 0\n\t\t#define SUN_LIGHT_CASCADES 2\n\t\t#if defined( SHADOWMAP_TYPE_PCF )\n\t\t\tuniform sampler2DShadow sunShadowMap[ NUM_SUN_LIGHT_SHADOWS ];\n\t\t#else\n\t\t\tuniform sampler2D sunShadowMap[ NUM_SUN_LIGHT_SHADOWS ];\n\t\t#endif\n\t\tuniform mat4 sunShadowMatrix[ NUM_SUN_LIGHT_SHADOWS * SUN_LIGHT_CASCADES ];\n\t\tuniform vec4 sunShadowCascade[ NUM_SUN_LIGHT_SHADOWS * SUN_LIGHT_CASCADES ];\n\t\tvarying vec4 vSunShadowWorldPosition;\n\t\tvarying vec3 vSunShadowWorldNormal;\n\t\tstruct SunLightShadow {\n\t\t\tfloat shadowIntensity;\n\t\t\tfloat shadowBias;\n\t\t\tfloat shadowNormalBias;\n\t\t\tfloat shadowRadius;\n\t\t\tvec2 shadowMapSize;\n\t\t};\n\t\tuniform SunLightShadow sunLightShadows[ NUM_SUN_LIGHT_SHADOWS ];\n\t#endif\n\t#if NUM_DIR_LIGHT_SHADOWS > 0\n\t\t#if defined( SHADOWMAP_TYPE_PCF )\n\t\t\tuniform sampler2DShadow directionalShadowMap[ NUM_DIR_LIGHT_SHADOWS ];\n\t\t#else\n\t\t\tuniform sampler2D directionalShadowMap[ NUM_DIR_LIGHT_SHADOWS ];\n\t\t#endif\n\t\tvarying vec4 vDirectionalShadowCoord[ NUM_DIR_LIGHT_SHADOWS ];\n\t\tstruct DirectionalLightShadow {\n\t\t\tfloat shadowIntensity;\n\t\t\tfloat shadowBias;\n\t\t\tfloat shadowNormalBias;\n\t\t\tfloat shadowRadius;\n\t\t\tvec2 shadowMapSize;\n\t\t};\n\t\tuniform DirectionalLightShadow directionalLightShadows[ NUM_DIR_LIGHT_SHADOWS ];\n\t#endif\n\t#if NUM_SPOT_LIGHT_SHADOWS > 0\n\t\t#if defined( SHADOWMAP_TYPE_PCF )\n\t\t\tuniform sampler2DShadow spotShadowMap[ NUM_SPOT_LIGHT_SHADOWS ];\n\t\t#else\n\t\t\tuniform sampler2D spotShadowMap[ NUM_SPOT_LIGHT_SHADOWS ];\n\t\t#endif\n\t\tstruct SpotLightShadow {\n\t\t\tfloat shadowIntensity;\n\t\t\tfloat shadowBias;\n\t\t\tfloat shadowNormalBias;\n\t\t\tfloat shadowRadius;\n\t\t\tvec2 shadowMapSize;\n\t\t};\n\t\tuniform SpotLightShadow spotLightShadows[ NUM_SPOT_LIGHT_SHADOWS ];\n\t#endif\n\t#if NUM_POINT_LIGHT_SHADOWS > 0\n\t\t#if defined( SHADOWMAP_TYPE_PCF )\n\t\t\tuniform samplerCubeShadow pointShadowMap[ NUM_POINT_LIGHT_SHADOWS ];\n\t\t#elif defined( SHADOWMAP_TYPE_BASIC )\n\t\t\tuniform samplerCube pointShadowMap[ NUM_POINT_LIGHT_SHADOWS ];\n\t\t#endif\n\t\tvarying vec4 vPointShadowCoord[ NUM_POINT_LIGHT_SHADOWS ];\n\t\tstruct PointLightShadow {\n\t\t\tfloat shadowIntensity;\n\t\t\tfloat shadowBias;\n\t\t\tfloat shadowNormalBias;\n\t\t\tfloat shadowRadius;\n\t\t\tvec2 shadowMapSize;\n\t\t\tfloat shadowCameraNear;\n\t\t\tfloat shadowCameraFar;\n\t\t};\n\t\tuniform PointLightShadow pointLightShadows[ NUM_POINT_LIGHT_SHADOWS ];\n\t#endif\n\t#if defined( SHADOWMAP_TYPE_PCF )\n\t\tfloat interleavedGradientNoise( vec2 position ) {\n\t\t\treturn fract( 52.9829189 * fract( dot( position, vec2( 0.06711056, 0.00583715 ) ) ) );\n\t\t}\n\t\tvec2 vogelDiskSample( int sampleIndex, int samplesCount, float phi ) {\n\t\t\tconst float goldenAngle = 2.399963229728653;\n\t\t\tfloat r = sqrt( ( float( sampleIndex ) + 0.5 ) / float( samplesCount ) );\n\t\t\tfloat theta = float( sampleIndex ) * goldenAngle + phi;\n\t\t\treturn vec2( cos( theta ), sin( theta ) ) * r;\n\t\t}\n\t#endif\n\t#if defined( SHADOWMAP_TYPE_PCF )\n\t\tfloat getShadow( sampler2DShadow shadowMap, vec2 shadowMapSize, float shadowIntensity, float shadowBias, float shadowRadius, vec4 shadowCoord ) {\n\t\t\tfloat shadow = 1.0;\n\t\t\tshadowCoord.xyz /= shadowCoord.w;\n\t\t\tshadowCoord.z += shadowBias;\n\t\t\tbool inFrustum = shadowCoord.x >= 0.0 && shadowCoord.x <= 1.0 && shadowCoord.y >= 0.0 && shadowCoord.y <= 1.0;\n\t\t\tbool frustumTest = inFrustum && shadowCoord.z <= 1.0;\n\t\t\tif ( frustumTest ) {\n\t\t\t\tvec2 texelSize = vec2( 1.0 ) / shadowMapSize;\n\t\t\t\tfloat radius = shadowRadius * texelSize.x;\n\t\t\t\tfloat phi = interleavedGradientNoise( gl_FragCoord.xy ) * PI2;\n\t\t\t\tshadow = (\n\t\t\t\t\ttexture( shadowMap, vec3( shadowCoord.xy + vogelDiskSample( 0, 5, phi ) * radius, shadowCoord.z ) ) +\n\t\t\t\t\ttexture( shadowMap, vec3( shadowCoord.xy + vogelDiskSample( 1, 5, phi ) * radius, shadowCoord.z ) ) +\n\t\t\t\t\ttexture( shadowMap, vec3( shadowCoord.xy + vogelDiskSample( 2, 5, phi ) * radius, shadowCoord.z ) ) +\n\t\t\t\t\ttexture( shadowMap, vec3( shadowCoord.xy + vogelDiskSample( 3, 5, phi ) * radius, shadowCoord.z ) ) +\n\t\t\t\t\ttexture( shadowMap, vec3( shadowCoord.xy + vogelDiskSample( 4, 5, phi ) * radius, shadowCoord.z ) )\n\t\t\t\t) * 0.2;\n\t\t\t}\n\t\t\treturn mix( 1.0, shadow, shadowIntensity );\n\t\t}\n\t#elif defined( SHADOWMAP_TYPE_VSM )\n\t\tfloat getShadow( sampler2D shadowMap, vec2 shadowMapSize, float shadowIntensity, float shadowBias, float shadowRadius, vec4 shadowCoord ) {\n\t\t\tfloat shadow = 1.0;\n\t\t\tshadowCoord.xyz /= shadowCoord.w;\n\t\t\t#ifdef USE_REVERSED_DEPTH_BUFFER\n\t\t\t\tshadowCoord.z -= shadowBias;\n\t\t\t#else\n\t\t\t\tshadowCoord.z += shadowBias;\n\t\t\t#endif\n\t\t\tbool inFrustum = shadowCoord.x >= 0.0 && shadowCoord.x <= 1.0 && shadowCoord.y >= 0.0 && shadowCoord.y <= 1.0;\n\t\t\tbool frustumTest = inFrustum && shadowCoord.z <= 1.0;\n\t\t\tif ( frustumTest ) {\n\t\t\t\tvec2 distribution = texture2D( shadowMap, shadowCoord.xy ).rg;\n\t\t\t\tfloat mean = distribution.x;\n\t\t\t\tfloat variance = distribution.y * distribution.y;\n\t\t\t\t#ifdef USE_REVERSED_DEPTH_BUFFER\n\t\t\t\t\tfloat hard_shadow = step( mean, shadowCoord.z );\n\t\t\t\t#else\n\t\t\t\t\tfloat hard_shadow = step( shadowCoord.z, mean );\n\t\t\t\t#endif\n\t\t\t\t\n\t\t\t\tif ( hard_shadow == 1.0 ) {\n\t\t\t\t\tshadow = 1.0;\n\t\t\t\t} else {\n\t\t\t\t\tvariance = max( variance, 0.0000001 );\n\t\t\t\t\tfloat d = shadowCoord.z - mean;\n\t\t\t\t\tfloat p_max = variance / ( variance + d * d );\n\t\t\t\t\tp_max = clamp( ( p_max - 0.3 ) / 0.65, 0.0, 1.0 );\n\t\t\t\t\tshadow = max( hard_shadow, p_max );\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn mix( 1.0, shadow, shadowIntensity );\n\t\t}\n\t#else\n\t\tfloat getShadow( sampler2D shadowMap, vec2 shadowMapSize, float shadowIntensity, float shadowBias, float shadowRadius, vec4 shadowCoord ) {\n\t\t\tfloat shadow = 1.0;\n\t\t\tshadowCoord.xyz /= shadowCoord.w;\n\t\t\t#ifdef USE_REVERSED_DEPTH_BUFFER\n\t\t\t\tshadowCoord.z -= shadowBias;\n\t\t\t#else\n\t\t\t\tshadowCoord.z += shadowBias;\n\t\t\t#endif\n\t\t\tbool inFrustum = shadowCoord.x >= 0.0 && shadowCoord.x <= 1.0 && shadowCoord.y >= 0.0 && shadowCoord.y <= 1.0;\n\t\t\tbool frustumTest = inFrustum && shadowCoord.z <= 1.0;\n\t\t\tif ( frustumTest ) {\n\t\t\t\tfloat depth = texture2D( shadowMap, shadowCoord.xy ).r;\n\t\t\t\t#ifdef USE_REVERSED_DEPTH_BUFFER\n\t\t\t\t\tshadow = step( depth, shadowCoord.z );\n\t\t\t\t#else\n\t\t\t\t\tshadow = step( shadowCoord.z, depth );\n\t\t\t\t#endif\n\t\t\t}\n\t\t\treturn mix( 1.0, shadow, shadowIntensity );\n\t\t}\n\t#endif\n\t#if NUM_SUN_LIGHT_SHADOWS > 0\n\t\tfloat getSunShadow(\n\t\t\t#if defined( SHADOWMAP_TYPE_PCF )\n\t\t\t\tsampler2DShadow shadowMap,\n\t\t\t#else\n\t\t\t\tsampler2D shadowMap,\n\t\t\t#endif\n\t\t\tSunLightShadow sunLightShadow,\n\t\t\tint shadowIndex\n\t\t) {\n\t\t\tvec4 shadowWorldPosition = vec4( vSunShadowWorldPosition.xyz + vSunShadowWorldNormal * sunLightShadow.shadowNormalBias, 1.0 );\n\t\t\tfloat viewDepth = vSunShadowWorldPosition.w;\n\t\t\tint cascadeOffset = shadowIndex * SUN_LIGHT_CASCADES;\n\t\t\tfloat shadow = 1.0;\n\t\t\tfor ( int i = SUN_LIGHT_CASCADES - 1; i >= 0; i -- ) {\n\t\t\t\tvec4 cascade = sunShadowCascade[ cascadeOffset + i ];\n\t\t\t\tif ( viewDepth >= cascade.x && viewDepth < cascade.y ) {\n\t\t\t\t\tfloat cascadeShadow = getShadow(\n\t\t\t\t\t\tshadowMap,\n\t\t\t\t\t\tsunLightShadow.shadowMapSize,\n\t\t\t\t\t\tsunLightShadow.shadowIntensity,\n\t\t\t\t\t\tsunLightShadow.shadowBias,\n\t\t\t\t\t\tsunLightShadow.shadowRadius,\n\t\t\t\t\t\tsunShadowMatrix[ cascadeOffset + i ] * shadowWorldPosition\n\t\t\t\t\t);\n\t\t\t\t\tshadow = mix( cascadeShadow, shadow, smoothstep( cascade.z, cascade.y, viewDepth ) );\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn shadow;\n\t\t}\n\t#endif\n\t#if NUM_POINT_LIGHT_SHADOWS > 0\n\t#if defined( SHADOWMAP_TYPE_PCF )\n\tfloat getPointShadow( samplerCubeShadow shadowMap, vec2 shadowMapSize, float shadowIntensity, float shadowBias, float shadowRadius, vec4 shadowCoord, float shadowCameraNear, float shadowCameraFar ) {\n\t\tfloat shadow = 1.0;\n\t\tvec3 lightToPosition = shadowCoord.xyz;\n\t\tvec3 bd3D = normalize( lightToPosition );\n\t\tvec3 absVec = abs( lightToPosition );\n\t\tfloat viewSpaceZ = max( max( absVec.x, absVec.y ), absVec.z );\n\t\tif ( viewSpaceZ - shadowCameraFar <= 0.0 && viewSpaceZ - shadowCameraNear >= 0.0 ) {\n\t\t\t#ifdef USE_REVERSED_DEPTH_BUFFER\n\t\t\t\tfloat dp = ( shadowCameraNear * ( shadowCameraFar - viewSpaceZ ) ) / ( viewSpaceZ * ( shadowCameraFar - shadowCameraNear ) );\n\t\t\t\tdp -= shadowBias;\n\t\t\t#else\n\t\t\t\tfloat dp = ( shadowCameraFar * ( viewSpaceZ - shadowCameraNear ) ) / ( viewSpaceZ * ( shadowCameraFar - shadowCameraNear ) );\n\t\t\t\tdp += shadowBias;\n\t\t\t#endif\n\t\t\tfloat texelSize = shadowRadius / shadowMapSize.x;\n\t\t\tvec3 absDir = abs( bd3D );\n\t\t\tvec3 tangent = absDir.x > absDir.z ? vec3( 0.0, 1.0, 0.0 ) : vec3( 1.0, 0.0, 0.0 );\n\t\t\ttangent = normalize( cross( bd3D, tangent ) );\n\t\t\tvec3 bitangent = cross( bd3D, tangent );\n\t\t\tfloat phi = interleavedGradientNoise( gl_FragCoord.xy ) * PI2;\n\t\t\tvec2 sample0 = vogelDiskSample( 0, 5, phi );\n\t\t\tvec2 sample1 = vogelDiskSample( 1, 5, phi );\n\t\t\tvec2 sample2 = vogelDiskSample( 2, 5, phi );\n\t\t\tvec2 sample3 = vogelDiskSample( 3, 5, phi );\n\t\t\tvec2 sample4 = vogelDiskSample( 4, 5, phi );\n\t\t\tshadow = (\n\t\t\t\ttexture( shadowMap, vec4( bd3D + ( tangent * sample0.x + bitangent * sample0.y ) * texelSize, dp ) ) +\n\t\t\t\ttexture( shadowMap, vec4( bd3D + ( tangent * sample1.x + bitangent * sample1.y ) * texelSize, dp ) ) +\n\t\t\t\ttexture( shadowMap, vec4( bd3D + ( tangent * sample2.x + bitangent * sample2.y ) * texelSize, dp ) ) +\n\t\t\t\ttexture( shadowMap, vec4( bd3D + ( tangent * sample3.x + bitangent * sample3.y ) * texelSize, dp ) ) +\n\t\t\t\ttexture( shadowMap, vec4( bd3D + ( tangent * sample4.x + bitangent * sample4.y ) * texelSize, dp ) )\n\t\t\t) * 0.2;\n\t\t}\n\t\treturn mix( 1.0, shadow, shadowIntensity );\n\t}\n\t#elif defined( SHADOWMAP_TYPE_BASIC )\n\tfloat getPointShadow( samplerCube shadowMap, vec2 shadowMapSize, float shadowIntensity, float shadowBias, float shadowRadius, vec4 shadowCoord, float shadowCameraNear, float shadowCameraFar ) {\n\t\tfloat shadow = 1.0;\n\t\tvec3 lightToPosition = shadowCoord.xyz;\n\t\tvec3 absVec = abs( lightToPosition );\n\t\tfloat viewSpaceZ = max( max( absVec.x, absVec.y ), absVec.z );\n\t\tif ( viewSpaceZ - shadowCameraFar <= 0.0 && viewSpaceZ - shadowCameraNear >= 0.0 ) {\n\t\t\tfloat dp = ( shadowCameraFar * ( viewSpaceZ - shadowCameraNear ) ) / ( viewSpaceZ * ( shadowCameraFar - shadowCameraNear ) );\n\t\t\tdp += shadowBias;\n\t\t\tvec3 bd3D = normalize( lightToPosition );\n\t\t\tfloat depth = textureCube( shadowMap, bd3D ).r;\n\t\t\t#ifdef USE_REVERSED_DEPTH_BUFFER\n\t\t\t\tdepth = 1.0 - depth;\n\t\t\t#endif\n\t\t\tshadow = step( dp, depth );\n\t\t}\n\t\treturn mix( 1.0, shadow, shadowIntensity );\n\t}\n\t#endif\n\t#endif\n#endif";
+
+var shadowmap_pars_vertex = "#if NUM_SPOT_LIGHT_COORDS > 0\n\tuniform mat4 spotLightMatrix[ NUM_SPOT_LIGHT_COORDS ];\n\tvarying vec4 vSpotLightCoord[ NUM_SPOT_LIGHT_COORDS ];\n#endif\n#ifdef USE_SHADOWMAP\n\t#if NUM_SUN_LIGHT_SHADOWS > 0\n\t\tvarying vec4 vSunShadowWorldPosition;\n\t\tvarying vec3 vSunShadowWorldNormal;\n\t#endif\n\t#if NUM_DIR_LIGHT_SHADOWS > 0\n\t\tuniform mat4 directionalShadowMatrix[ NUM_DIR_LIGHT_SHADOWS ];\n\t\tvarying vec4 vDirectionalShadowCoord[ NUM_DIR_LIGHT_SHADOWS ];\n\t\tstruct DirectionalLightShadow {\n\t\t\tfloat shadowIntensity;\n\t\t\tfloat shadowBias;\n\t\t\tfloat shadowNormalBias;\n\t\t\tfloat shadowRadius;\n\t\t\tvec2 shadowMapSize;\n\t\t};\n\t\tuniform DirectionalLightShadow directionalLightShadows[ NUM_DIR_LIGHT_SHADOWS ];\n\t#endif\n\t#if NUM_SPOT_LIGHT_SHADOWS > 0\n\t\tstruct SpotLightShadow {\n\t\t\tfloat shadowIntensity;\n\t\t\tfloat shadowBias;\n\t\t\tfloat shadowNormalBias;\n\t\t\tfloat shadowRadius;\n\t\t\tvec2 shadowMapSize;\n\t\t};\n\t\tuniform SpotLightShadow spotLightShadows[ NUM_SPOT_LIGHT_SHADOWS ];\n\t#endif\n\t#if NUM_POINT_LIGHT_SHADOWS > 0\n\t\tuniform mat4 pointShadowMatrix[ NUM_POINT_LIGHT_SHADOWS ];\n\t\tvarying vec4 vPointShadowCoord[ NUM_POINT_LIGHT_SHADOWS ];\n\t\tstruct PointLightShadow {\n\t\t\tfloat shadowIntensity;\n\t\t\tfloat shadowBias;\n\t\t\tfloat shadowNormalBias;\n\t\t\tfloat shadowRadius;\n\t\t\tvec2 shadowMapSize;\n\t\t\tfloat shadowCameraNear;\n\t\t\tfloat shadowCameraFar;\n\t\t};\n\t\tuniform PointLightShadow pointLightShadows[ NUM_POINT_LIGHT_SHADOWS ];\n\t#endif\n#endif";
+
+var shadowmap_vertex = "#if ( defined( USE_SHADOWMAP ) && ( NUM_DIR_LIGHT_SHADOWS > 0 || NUM_SUN_LIGHT_SHADOWS > 0 || NUM_POINT_LIGHT_SHADOWS > 0 ) ) || ( NUM_SPOT_LIGHT_COORDS > 0 )\n\t#ifdef HAS_NORMAL\n\t\tvec3 shadowWorldNormal = transformNormalByInverseViewMatrix( transformedNormal, viewMatrix );\n\t#else\n\t\tvec3 shadowWorldNormal = vec3( 0.0 );\n\t#endif\n\tvec4 shadowWorldPosition;\n#endif\n#if defined( USE_SHADOWMAP )\n\t#if NUM_SUN_LIGHT_SHADOWS > 0\n\t\tvSunShadowWorldPosition = vec4( worldPosition.xyz, - mvPosition.z );\n\t\tvSunShadowWorldNormal = shadowWorldNormal;\n\t#endif\n\t#if NUM_DIR_LIGHT_SHADOWS > 0\n\t\t#pragma unroll_loop_start\n\t\tfor ( int i = 0; i < NUM_DIR_LIGHT_SHADOWS; i ++ ) {\n\t\t\tshadowWorldPosition = worldPosition + vec4( shadowWorldNormal * directionalLightShadows[ i ].shadowNormalBias, 0 );\n\t\t\tvDirectionalShadowCoord[ i ] = directionalShadowMatrix[ i ] * shadowWorldPosition;\n\t\t}\n\t\t#pragma unroll_loop_end\n\t#endif\n\t#if NUM_POINT_LIGHT_SHADOWS > 0\n\t\t#pragma unroll_loop_start\n\t\tfor ( int i = 0; i < NUM_POINT_LIGHT_SHADOWS; i ++ ) {\n\t\t\tshadowWorldPosition = worldPosition + vec4( shadowWorldNormal * pointLightShadows[ i ].shadowNormalBias, 0 );\n\t\t\tvPointShadowCoord[ i ] = pointShadowMatrix[ i ] * shadowWorldPosition;\n\t\t}\n\t\t#pragma unroll_loop_end\n\t#endif\n#endif\n#if NUM_SPOT_LIGHT_COORDS > 0\n\t#pragma unroll_loop_start\n\tfor ( int i = 0; i < NUM_SPOT_LIGHT_COORDS; i ++ ) {\n\t\tshadowWorldPosition = worldPosition;\n\t\t#if ( defined( USE_SHADOWMAP ) && UNROLLED_LOOP_INDEX < NUM_SPOT_LIGHT_SHADOWS )\n\t\t\tshadowWorldPosition.xyz += shadowWorldNormal * spotLightShadows[ i ].shadowNormalBias;\n\t\t#endif\n\t\tvSpotLightCoord[ i ] = spotLightMatrix[ i ] * shadowWorldPosition;\n\t}\n\t#pragma unroll_loop_end\n#endif";
+
+var shadowmask_pars_fragment = "float getShadowMask() {\n\tfloat shadow = 1.0;\n\t#ifdef USE_SHADOWMAP\n\t#if NUM_SUN_LIGHT_SHADOWS > 0\n\tSunLightShadow sunLight;\n\t#pragma unroll_loop_start\n\tfor ( int i = 0; i < NUM_SUN_LIGHT_SHADOWS; i ++ ) {\n\t\tsunLight = sunLightShadows[ i ];\n\t\tshadow *= receiveShadow ? getSunShadow( sunShadowMap[ i ], sunLight, UNROLLED_LOOP_INDEX ) : 1.0;\n\t}\n\t#pragma unroll_loop_end\n\t#endif\n\t#if NUM_DIR_LIGHT_SHADOWS > 0\n\tDirectionalLightShadow directionalLight;\n\t#pragma unroll_loop_start\n\tfor ( int i = 0; i < NUM_DIR_LIGHT_SHADOWS; i ++ ) {\n\t\tdirectionalLight = directionalLightShadows[ i ];\n\t\tshadow *= receiveShadow ? getShadow( directionalShadowMap[ i ], directionalLight.shadowMapSize, directionalLight.shadowIntensity, directionalLight.shadowBias, directionalLight.shadowRadius, vDirectionalShadowCoord[ i ] ) : 1.0;\n\t}\n\t#pragma unroll_loop_end\n\t#endif\n\t#if NUM_SPOT_LIGHT_SHADOWS > 0\n\tSpotLightShadow spotLight;\n\t#pragma unroll_loop_start\n\tfor ( int i = 0; i < NUM_SPOT_LIGHT_SHADOWS; i ++ ) {\n\t\tspotLight = spotLightShadows[ i ];\n\t\tshadow *= receiveShadow ? getShadow( spotShadowMap[ i ], spotLight.shadowMapSize, spotLight.shadowIntensity, spotLight.shadowBias, spotLight.shadowRadius, vSpotLightCoord[ i ] ) : 1.0;\n\t}\n\t#pragma unroll_loop_end\n\t#endif\n\t#if NUM_POINT_LIGHT_SHADOWS > 0 && ( defined( SHADOWMAP_TYPE_PCF ) || defined( SHADOWMAP_TYPE_BASIC ) )\n\tPointLightShadow pointLight;\n\t#pragma unroll_loop_start\n\tfor ( int i = 0; i < NUM_POINT_LIGHT_SHADOWS; i ++ ) {\n\t\tpointLight = pointLightShadows[ i ];\n\t\tshadow *= receiveShadow ? getPointShadow( pointShadowMap[ i ], pointLight.shadowMapSize, pointLight.shadowIntensity, pointLight.shadowBias, pointLight.shadowRadius, vPointShadowCoord[ i ], pointLight.shadowCameraNear, pointLight.shadowCameraFar ) : 1.0;\n\t}\n\t#pragma unroll_loop_end\n\t#endif\n\t#endif\n\treturn shadow;\n}";
+
+var skinbase_vertex = "#ifdef USE_SKINNING\n\tmat4 boneMatX = getBoneMatrix( skinIndex.x );\n\tmat4 boneMatY = getBoneMatrix( skinIndex.y );\n\tmat4 boneMatZ = getBoneMatrix( skinIndex.z );\n\tmat4 boneMatW = getBoneMatrix( skinIndex.w );\n#endif";
+
+var skinning_pars_vertex = "#ifdef USE_SKINNING\n\tuniform mat4 bindMatrix;\n\tuniform mat4 bindMatrixInverse;\n\tuniform highp sampler2D boneTexture;\n\tmat4 getBoneMatrix( const in float i ) {\n\t\tint size = textureSize( boneTexture, 0 ).x;\n\t\tint j = int( i ) * 4;\n\t\tint x = j % size;\n\t\tint y = j / size;\n\t\tvec4 v1 = texelFetch( boneTexture, ivec2( x, y ), 0 );\n\t\tvec4 v2 = texelFetch( boneTexture, ivec2( x + 1, y ), 0 );\n\t\tvec4 v3 = texelFetch( boneTexture, ivec2( x + 2, y ), 0 );\n\t\tvec4 v4 = texelFetch( boneTexture, ivec2( x + 3, y ), 0 );\n\t\treturn mat4( v1, v2, v3, v4 );\n\t}\n#endif";
+
+var skinning_vertex = "#ifdef USE_SKINNING\n\tvec4 skinVertex = bindMatrix * vec4( transformed, 1.0 );\n\tvec4 skinned = vec4( 0.0 );\n\tskinned += boneMatX * skinVertex * skinWeight.x;\n\tskinned += boneMatY * skinVertex * skinWeight.y;\n\tskinned += boneMatZ * skinVertex * skinWeight.z;\n\tskinned += boneMatW * skinVertex * skinWeight.w;\n\ttransformed = ( bindMatrixInverse * skinned ).xyz;\n#endif";
+
+var skinnormal_vertex = "#ifdef USE_SKINNING\n\tmat4 skinMatrix = mat4( 0.0 );\n\tskinMatrix += skinWeight.x * boneMatX;\n\tskinMatrix += skinWeight.y * boneMatY;\n\tskinMatrix += skinWeight.z * boneMatZ;\n\tskinMatrix += skinWeight.w * boneMatW;\n\tskinMatrix = bindMatrixInverse * skinMatrix * bindMatrix;\n\tobjectNormal = vec4( skinMatrix * vec4( objectNormal, 0.0 ) ).xyz;\n\t#ifdef USE_TANGENT\n\t\tobjectTangent = vec4( skinMatrix * vec4( objectTangent, 0.0 ) ).xyz;\n\t#endif\n#endif";
+
+var specularmap_fragment = "float specularStrength;\n#ifdef USE_SPECULARMAP\n\tvec4 texelSpecular = texture2D( specularMap, vSpecularMapUv );\n\tspecularStrength = texelSpecular.r;\n#else\n\tspecularStrength = 1.0;\n#endif";
+
+var specularmap_pars_fragment = "#ifdef USE_SPECULARMAP\n\tuniform sampler2D specularMap;\n#endif";
+
+var tonemapping_fragment = "#if defined( TONE_MAPPING )\n\tgl_FragColor.rgb = toneMapping( gl_FragColor.rgb );\n#endif";
+
+var tonemapping_pars_fragment = "#ifndef saturate\n#define saturate( a ) clamp( a, 0.0, 1.0 )\n#endif\nuniform float toneMappingExposure;\nvec3 LinearToneMapping( vec3 color ) {\n\treturn saturate( toneMappingExposure * color );\n}\nvec3 ReinhardToneMapping( vec3 color ) {\n\tcolor *= toneMappingExposure;\n\treturn saturate( color / ( vec3( 1.0 ) + color ) );\n}\nvec3 CineonToneMapping( vec3 color ) {\n\tcolor *= toneMappingExposure;\n\tcolor = max( vec3( 0.0 ), color - 0.004 );\n\treturn pow( ( color * ( 6.2 * color + 0.5 ) ) / ( color * ( 6.2 * color + 1.7 ) + 0.06 ), vec3( 2.2 ) );\n}\nvec3 RRTAndODTFit( vec3 v ) {\n\tvec3 a = v * ( v + 0.0245786 ) - 0.000090537;\n\tvec3 b = v * ( 0.983729 * v + 0.4329510 ) + 0.238081;\n\treturn a / b;\n}\nvec3 ACESFilmicToneMapping( vec3 color ) {\n\tconst mat3 ACESInputMat = mat3(\n\t\tvec3( 0.59719, 0.07600, 0.02840 ),\t\tvec3( 0.35458, 0.90834, 0.13383 ),\n\t\tvec3( 0.04823, 0.01566, 0.83777 )\n\t);\n\tconst mat3 ACESOutputMat = mat3(\n\t\tvec3(  1.60475, -0.10208, -0.00327 ),\t\tvec3( -0.53108,  1.10813, -0.07276 ),\n\t\tvec3( -0.07367, -0.00605,  1.07602 )\n\t);\n\tcolor *= toneMappingExposure / 0.6;\n\tcolor = ACESInputMat * color;\n\tcolor = RRTAndODTFit( color );\n\tcolor = ACESOutputMat * color;\n\treturn saturate( color );\n}\nconst mat3 LINEAR_REC2020_TO_LINEAR_SRGB = mat3(\n\tvec3( 1.6605, - 0.1246, - 0.0182 ),\n\tvec3( - 0.5876, 1.1329, - 0.1006 ),\n\tvec3( - 0.0728, - 0.0083, 1.1187 )\n);\nconst mat3 LINEAR_SRGB_TO_LINEAR_REC2020 = mat3(\n\tvec3( 0.6274, 0.0691, 0.0164 ),\n\tvec3( 0.3293, 0.9195, 0.0880 ),\n\tvec3( 0.0433, 0.0113, 0.8956 )\n);\nvec3 agxDefaultContrastApprox( vec3 x ) {\n\tvec3 x2 = x * x;\n\tvec3 x4 = x2 * x2;\n\treturn + 15.5 * x4 * x2\n\t\t- 40.14 * x4 * x\n\t\t+ 31.96 * x4\n\t\t- 6.868 * x2 * x\n\t\t+ 0.4298 * x2\n\t\t+ 0.1191 * x\n\t\t- 0.00232;\n}\nvec3 AgXToneMapping( vec3 color ) {\n\tconst mat3 AgXInsetMatrix = mat3(\n\t\tvec3( 0.856627153315983, 0.137318972929847, 0.11189821299995 ),\n\t\tvec3( 0.0951212405381588, 0.761241990602591, 0.0767994186031903 ),\n\t\tvec3( 0.0482516061458583, 0.101439036467562, 0.811302368396859 )\n\t);\n\tconst mat3 AgXOutsetMatrix = mat3(\n\t\tvec3( 1.1271005818144368, - 0.1413297634984383, - 0.14132976349843826 ),\n\t\tvec3( - 0.11060664309660323, 1.157823702216272, - 0.11060664309660294 ),\n\t\tvec3( - 0.016493938717834573, - 0.016493938717834257, 1.2519364065950405 )\n\t);\n\tconst float AgxMinEv = - 12.47393;\tconst float AgxMaxEv = 4.026069;\n\tcolor *= toneMappingExposure;\n\tcolor = LINEAR_SRGB_TO_LINEAR_REC2020 * color;\n\tcolor = AgXInsetMatrix * color;\n\tcolor = max( color, 1e-10 );\tcolor = log2( color );\n\tcolor = ( color - AgxMinEv ) / ( AgxMaxEv - AgxMinEv );\n\tcolor = clamp( color, 0.0, 1.0 );\n\tcolor = agxDefaultContrastApprox( color );\n\tcolor = AgXOutsetMatrix * color;\n\tcolor = pow( max( vec3( 0.0 ), color ), vec3( 2.2 ) );\n\tcolor = LINEAR_REC2020_TO_LINEAR_SRGB * color;\n\tcolor = clamp( color, 0.0, 1.0 );\n\treturn color;\n}\nvec3 NeutralToneMapping( vec3 color ) {\n\tconst float StartCompression = 0.8 - 0.04;\n\tconst float Desaturation = 0.15;\n\tcolor *= toneMappingExposure;\n\tfloat x = min( color.r, min( color.g, color.b ) );\n\tfloat offset = x < 0.08 ? x - 6.25 * x * x : 0.04;\n\tcolor -= offset;\n\tfloat peak = max( color.r, max( color.g, color.b ) );\n\tif ( peak < StartCompression ) return color;\n\tfloat d = 1. - StartCompression;\n\tfloat newPeak = 1. - d * d / ( peak + d - StartCompression );\n\tcolor *= newPeak / peak;\n\tfloat g = 1. - 1. / ( Desaturation * ( peak - newPeak ) + 1. );\n\treturn mix( color, vec3( newPeak ), g );\n}\nvec3 CustomToneMapping( vec3 color ) { return color; }";
+
+var transmission_fragment = "#ifdef USE_TRANSMISSION\n\tmaterial.transmission = transmission;\n\tmaterial.transmissionAlpha = 1.0;\n\tmaterial.thickness = thickness;\n\tmaterial.attenuationDistance = attenuationDistance;\n\tmaterial.attenuationColor = attenuationColor;\n\t#ifdef USE_TRANSMISSIONMAP\n\t\tmaterial.transmission *= texture2D( transmissionMap, vTransmissionMapUv ).r;\n\t#endif\n\t#ifdef USE_THICKNESSMAP\n\t\tmaterial.thickness *= texture2D( thicknessMap, vThicknessMapUv ).g;\n\t#endif\n\tvec3 pos = vWorldPosition;\n\tvec3 v = normalize( cameraPosition - pos );\n\tvec3 n = transformNormalByInverseViewMatrix( normal, viewMatrix );\n\tvec4 transmitted = getIBLVolumeRefraction(\n\t\tn, v, material.roughness, material.diffuseContribution, material.specularColorBlended, material.specularF90,\n\t\tpos, modelMatrix, viewMatrix, projectionMatrix, material.dispersion, material.ior, material.thickness,\n\t\tmaterial.attenuationColor, material.attenuationDistance );\n\tmaterial.transmissionAlpha = mix( material.transmissionAlpha, transmitted.a, material.transmission );\n\ttotalDiffuse = mix( totalDiffuse, transmitted.rgb, material.transmission );\n#endif";
+
+var transmission_pars_fragment = "#ifdef USE_TRANSMISSION\n\tuniform float transmission;\n\tuniform float thickness;\n\tuniform float attenuationDistance;\n\tuniform vec3 attenuationColor;\n\t#ifdef USE_TRANSMISSIONMAP\n\t\tuniform sampler2D transmissionMap;\n\t#endif\n\t#ifdef USE_THICKNESSMAP\n\t\tuniform sampler2D thicknessMap;\n\t#endif\n\tuniform vec2 transmissionSamplerSize;\n\tuniform sampler2D transmissionSamplerMap;\n\tuniform mat4 modelMatrix;\n\tuniform mat4 projectionMatrix;\n\tvarying vec3 vWorldPosition;\n\tfloat w0( float a ) {\n\t\treturn ( 1.0 / 6.0 ) * ( a * ( a * ( - a + 3.0 ) - 3.0 ) + 1.0 );\n\t}\n\tfloat w1( float a ) {\n\t\treturn ( 1.0 / 6.0 ) * ( a *  a * ( 3.0 * a - 6.0 ) + 4.0 );\n\t}\n\tfloat w2( float a ){\n\t\treturn ( 1.0 / 6.0 ) * ( a * ( a * ( - 3.0 * a + 3.0 ) + 3.0 ) + 1.0 );\n\t}\n\tfloat w3( float a ) {\n\t\treturn ( 1.0 / 6.0 ) * ( a * a * a );\n\t}\n\tfloat g0( float a ) {\n\t\treturn w0( a ) + w1( a );\n\t}\n\tfloat g1( float a ) {\n\t\treturn w2( a ) + w3( a );\n\t}\n\tfloat h0( float a ) {\n\t\treturn - 1.0 + w1( a ) / ( w0( a ) + w1( a ) );\n\t}\n\tfloat h1( float a ) {\n\t\treturn 1.0 + w3( a ) / ( w2( a ) + w3( a ) );\n\t}\n\tvec4 bicubic( sampler2D tex, vec2 uv, vec4 texelSize, float lod ) {\n\t\tuv = uv * texelSize.zw + 0.5;\n\t\tvec2 iuv = floor( uv );\n\t\tvec2 fuv = fract( uv );\n\t\tfloat g0x = g0( fuv.x );\n\t\tfloat g1x = g1( fuv.x );\n\t\tfloat h0x = h0( fuv.x );\n\t\tfloat h1x = h1( fuv.x );\n\t\tfloat h0y = h0( fuv.y );\n\t\tfloat h1y = h1( fuv.y );\n\t\tvec2 p0 = ( vec2( iuv.x + h0x, iuv.y + h0y ) - 0.5 ) * texelSize.xy;\n\t\tvec2 p1 = ( vec2( iuv.x + h1x, iuv.y + h0y ) - 0.5 ) * texelSize.xy;\n\t\tvec2 p2 = ( vec2( iuv.x + h0x, iuv.y + h1y ) - 0.5 ) * texelSize.xy;\n\t\tvec2 p3 = ( vec2( iuv.x + h1x, iuv.y + h1y ) - 0.5 ) * texelSize.xy;\n\t\treturn g0( fuv.y ) * ( g0x * textureLod( tex, p0, lod ) + g1x * textureLod( tex, p1, lod ) ) +\n\t\t\tg1( fuv.y ) * ( g0x * textureLod( tex, p2, lod ) + g1x * textureLod( tex, p3, lod ) );\n\t}\n\tvec4 textureBicubic( sampler2D sampler, vec2 uv, float lod ) {\n\t\tvec2 fLodSize = vec2( textureSize( sampler, int( lod ) ) );\n\t\tvec2 cLodSize = vec2( textureSize( sampler, int( lod + 1.0 ) ) );\n\t\tvec2 fLodSizeInv = 1.0 / fLodSize;\n\t\tvec2 cLodSizeInv = 1.0 / cLodSize;\n\t\tvec4 fSample = bicubic( sampler, uv, vec4( fLodSizeInv, fLodSize ), floor( lod ) );\n\t\tvec4 cSample = bicubic( sampler, uv, vec4( cLodSizeInv, cLodSize ), ceil( lod ) );\n\t\treturn mix( fSample, cSample, fract( lod ) );\n\t}\n\tvec3 getVolumeTransmissionRay( const in vec3 n, const in vec3 v, const in float thickness, const in float ior, const in mat4 modelMatrix ) {\n\t\tvec3 refractionVector = refract( - v, normalize( n ), 1.0 / ior );\n\t\tvec3 modelScale;\n\t\tmodelScale.x = length( vec3( modelMatrix[ 0 ].xyz ) );\n\t\tmodelScale.y = length( vec3( modelMatrix[ 1 ].xyz ) );\n\t\tmodelScale.z = length( vec3( modelMatrix[ 2 ].xyz ) );\n\t\treturn normalize( refractionVector ) * thickness * modelScale;\n\t}\n\tfloat applyIorToRoughness( const in float roughness, const in float ior ) {\n\t\treturn roughness * clamp( ior * 2.0 - 2.0, 0.0, 1.0 );\n\t}\n\tvec4 getTransmissionSample( const in vec2 fragCoord, const in float roughness, const in float ior ) {\n\t\tfloat lod = log2( transmissionSamplerSize.x ) * applyIorToRoughness( roughness, ior );\n\t\treturn textureBicubic( transmissionSamplerMap, fragCoord.xy, lod );\n\t}\n\tvec3 volumeAttenuation( const in float transmissionDistance, const in vec3 attenuationColor, const in float attenuationDistance ) {\n\t\tif ( isinf( attenuationDistance ) ) {\n\t\t\treturn vec3( 1.0 );\n\t\t} else {\n\t\t\tvec3 attenuationCoefficient = -log( attenuationColor ) / attenuationDistance;\n\t\t\tvec3 transmittance = exp( - attenuationCoefficient * transmissionDistance );\t\t\treturn transmittance;\n\t\t}\n\t}\n\tvec4 getIBLVolumeRefraction( const in vec3 n, const in vec3 v, const in float roughness, const in vec3 diffuseColor,\n\t\tconst in vec3 specularColor, const in float specularF90, const in vec3 position, const in mat4 modelMatrix,\n\t\tconst in mat4 viewMatrix, const in mat4 projMatrix, const in float dispersion, const in float ior, const in float thickness,\n\t\tconst in vec3 attenuationColor, const in float attenuationDistance ) {\n\t\tvec4 transmittedLight;\n\t\tvec3 transmittance;\n\t\t#ifdef USE_DISPERSION\n\t\t\tfloat halfSpread = ( ior - 1.0 ) * 0.025 * dispersion;\n\t\t\tvec3 iors = vec3( ior - halfSpread, ior, ior + halfSpread );\n\t\t\tfor ( int i = 0; i < 3; i ++ ) {\n\t\t\t\tvec3 transmissionRay = getVolumeTransmissionRay( n, v, thickness, iors[ i ], modelMatrix );\n\t\t\t\tvec3 refractedRayExit = position + transmissionRay;\n\t\t\t\tvec4 ndcPos = projMatrix * viewMatrix * vec4( refractedRayExit, 1.0 );\n\t\t\t\tvec2 refractionCoords = ndcPos.xy / ndcPos.w;\n\t\t\t\trefractionCoords += 1.0;\n\t\t\t\trefractionCoords /= 2.0;\n\t\t\t\tvec4 transmissionSample = getTransmissionSample( refractionCoords, roughness, iors[ i ] );\n\t\t\t\ttransmittedLight[ i ] = transmissionSample[ i ];\n\t\t\t\ttransmittedLight.a += transmissionSample.a;\n\t\t\t\ttransmittance[ i ] = diffuseColor[ i ] * volumeAttenuation( length( transmissionRay ), attenuationColor, attenuationDistance )[ i ];\n\t\t\t}\n\t\t\ttransmittedLight.a /= 3.0;\n\t\t#else\n\t\t\tvec3 transmissionRay = getVolumeTransmissionRay( n, v, thickness, ior, modelMatrix );\n\t\t\tvec3 refractedRayExit = position + transmissionRay;\n\t\t\tvec4 ndcPos = projMatrix * viewMatrix * vec4( refractedRayExit, 1.0 );\n\t\t\tvec2 refractionCoords = ndcPos.xy / ndcPos.w;\n\t\t\trefractionCoords += 1.0;\n\t\t\trefractionCoords /= 2.0;\n\t\t\ttransmittedLight = getTransmissionSample( refractionCoords, roughness, ior );\n\t\t\ttransmittance = diffuseColor * volumeAttenuation( length( transmissionRay ), attenuationColor, attenuationDistance );\n\t\t#endif\n\t\tvec3 attenuatedColor = transmittance * transmittedLight.rgb;\n\t\tvec3 F = EnvironmentBRDF( n, v, specularColor, specularF90, roughness );\n\t\tfloat transmittanceFactor = ( transmittance.r + transmittance.g + transmittance.b ) / 3.0;\n\t\treturn vec4( ( 1.0 - F ) * attenuatedColor, 1.0 - ( 1.0 - transmittedLight.a ) * transmittanceFactor );\n\t}\n#endif";
+
+var uv_pars_fragment = "#if defined( USE_UV ) || defined( USE_ANISOTROPY )\n\tvarying vec2 vUv;\n#endif\n#ifdef USE_MAP\n\tvarying vec2 vMapUv;\n#endif\n#ifdef USE_ALPHAMAP\n\tvarying vec2 vAlphaMapUv;\n#endif\n#ifdef USE_LIGHTMAP\n\tvarying vec2 vLightMapUv;\n#endif\n#ifdef USE_AOMAP\n\tvarying vec2 vAoMapUv;\n#endif\n#ifdef USE_BUMPMAP\n\tvarying vec2 vBumpMapUv;\n#endif\n#ifdef USE_NORMALMAP\n\tvarying vec2 vNormalMapUv;\n#endif\n#ifdef USE_EMISSIVEMAP\n\tvarying vec2 vEmissiveMapUv;\n#endif\n#ifdef USE_METALNESSMAP\n\tvarying vec2 vMetalnessMapUv;\n#endif\n#ifdef USE_ROUGHNESSMAP\n\tvarying vec2 vRoughnessMapUv;\n#endif\n#ifdef USE_ANISOTROPYMAP\n\tvarying vec2 vAnisotropyMapUv;\n#endif\n#ifdef USE_CLEARCOATMAP\n\tvarying vec2 vClearcoatMapUv;\n#endif\n#ifdef USE_CLEARCOAT_NORMALMAP\n\tvarying vec2 vClearcoatNormalMapUv;\n#endif\n#ifdef USE_CLEARCOAT_ROUGHNESSMAP\n\tvarying vec2 vClearcoatRoughnessMapUv;\n#endif\n#ifdef USE_IRIDESCENCEMAP\n\tvarying vec2 vIridescenceMapUv;\n#endif\n#ifdef USE_IRIDESCENCE_THICKNESSMAP\n\tvarying vec2 vIridescenceThicknessMapUv;\n#endif\n#ifdef USE_SHEEN_COLORMAP\n\tvarying vec2 vSheenColorMapUv;\n#endif\n#ifdef USE_SHEEN_ROUGHNESSMAP\n\tvarying vec2 vSheenRoughnessMapUv;\n#endif\n#ifdef USE_SPECULARMAP\n\tvarying vec2 vSpecularMapUv;\n#endif\n#ifdef USE_SPECULAR_COLORMAP\n\tvarying vec2 vSpecularColorMapUv;\n#endif\n#ifdef USE_SPECULAR_INTENSITYMAP\n\tvarying vec2 vSpecularIntensityMapUv;\n#endif\n#ifdef USE_TRANSMISSIONMAP\n\tuniform mat3 transmissionMapTransform;\n\tvarying vec2 vTransmissionMapUv;\n#endif\n#ifdef USE_THICKNESSMAP\n\tuniform mat3 thicknessMapTransform;\n\tvarying vec2 vThicknessMapUv;\n#endif";
+
+var uv_pars_vertex = "#if defined( USE_UV ) || defined( USE_ANISOTROPY )\n\tvarying vec2 vUv;\n#endif\n#ifdef USE_MAP\n\tuniform mat3 mapTransform;\n\tvarying vec2 vMapUv;\n#endif\n#ifdef USE_ALPHAMAP\n\tuniform mat3 alphaMapTransform;\n\tvarying vec2 vAlphaMapUv;\n#endif\n#ifdef USE_LIGHTMAP\n\tuniform mat3 lightMapTransform;\n\tvarying vec2 vLightMapUv;\n#endif\n#ifdef USE_AOMAP\n\tuniform mat3 aoMapTransform;\n\tvarying vec2 vAoMapUv;\n#endif\n#ifdef USE_BUMPMAP\n\tuniform mat3 bumpMapTransform;\n\tvarying vec2 vBumpMapUv;\n#endif\n#ifdef USE_NORMALMAP\n\tuniform mat3 normalMapTransform;\n\tvarying vec2 vNormalMapUv;\n#endif\n#ifdef USE_DISPLACEMENTMAP\n\tuniform mat3 displacementMapTransform;\n\tvarying vec2 vDisplacementMapUv;\n#endif\n#ifdef USE_EMISSIVEMAP\n\tuniform mat3 emissiveMapTransform;\n\tvarying vec2 vEmissiveMapUv;\n#endif\n#ifdef USE_METALNESSMAP\n\tuniform mat3 metalnessMapTransform;\n\tvarying vec2 vMetalnessMapUv;\n#endif\n#ifdef USE_ROUGHNESSMAP\n\tuniform mat3 roughnessMapTransform;\n\tvarying vec2 vRoughnessMapUv;\n#endif\n#ifdef USE_ANISOTROPYMAP\n\tuniform mat3 anisotropyMapTransform;\n\tvarying vec2 vAnisotropyMapUv;\n#endif\n#ifdef USE_CLEARCOATMAP\n\tuniform mat3 clearcoatMapTransform;\n\tvarying vec2 vClearcoatMapUv;\n#endif\n#ifdef USE_CLEARCOAT_NORMALMAP\n\tuniform mat3 clearcoatNormalMapTransform;\n\tvarying vec2 vClearcoatNormalMapUv;\n#endif\n#ifdef USE_CLEARCOAT_ROUGHNESSMAP\n\tuniform mat3 clearcoatRoughnessMapTransform;\n\tvarying vec2 vClearcoatRoughnessMapUv;\n#endif\n#ifdef USE_SHEEN_COLORMAP\n\tuniform mat3 sheenColorMapTransform;\n\tvarying vec2 vSheenColorMapUv;\n#endif\n#ifdef USE_SHEEN_ROUGHNESSMAP\n\tuniform mat3 sheenRoughnessMapTransform;\n\tvarying vec2 vSheenRoughnessMapUv;\n#endif\n#ifdef USE_IRIDESCENCEMAP\n\tuniform mat3 iridescenceMapTransform;\n\tvarying vec2 vIridescenceMapUv;\n#endif\n#ifdef USE_IRIDESCENCE_THICKNESSMAP\n\tuniform mat3 iridescenceThicknessMapTransform;\n\tvarying vec2 vIridescenceThicknessMapUv;\n#endif\n#ifdef USE_SPECULARMAP\n\tuniform mat3 specularMapTransform;\n\tvarying vec2 vSpecularMapUv;\n#endif\n#ifdef USE_SPECULAR_COLORMAP\n\tuniform mat3 specularColorMapTransform;\n\tvarying vec2 vSpecularColorMapUv;\n#endif\n#ifdef USE_SPECULAR_INTENSITYMAP\n\tuniform mat3 specularIntensityMapTransform;\n\tvarying vec2 vSpecularIntensityMapUv;\n#endif\n#ifdef USE_TRANSMISSIONMAP\n\tuniform mat3 transmissionMapTransform;\n\tvarying vec2 vTransmissionMapUv;\n#endif\n#ifdef USE_THICKNESSMAP\n\tuniform mat3 thicknessMapTransform;\n\tvarying vec2 vThicknessMapUv;\n#endif";
+
+var uv_vertex = "#if defined( USE_UV ) || defined( USE_ANISOTROPY )\n\tvUv = vec3( uv, 1 ).xy;\n#endif\n#ifdef USE_MAP\n\tvMapUv = ( mapTransform * vec3( MAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_ALPHAMAP\n\tvAlphaMapUv = ( alphaMapTransform * vec3( ALPHAMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_LIGHTMAP\n\tvLightMapUv = ( lightMapTransform * vec3( LIGHTMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_AOMAP\n\tvAoMapUv = ( aoMapTransform * vec3( AOMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_BUMPMAP\n\tvBumpMapUv = ( bumpMapTransform * vec3( BUMPMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_NORMALMAP\n\tvNormalMapUv = ( normalMapTransform * vec3( NORMALMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_DISPLACEMENTMAP\n\tvDisplacementMapUv = ( displacementMapTransform * vec3( DISPLACEMENTMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_EMISSIVEMAP\n\tvEmissiveMapUv = ( emissiveMapTransform * vec3( EMISSIVEMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_METALNESSMAP\n\tvMetalnessMapUv = ( metalnessMapTransform * vec3( METALNESSMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_ROUGHNESSMAP\n\tvRoughnessMapUv = ( roughnessMapTransform * vec3( ROUGHNESSMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_ANISOTROPYMAP\n\tvAnisotropyMapUv = ( anisotropyMapTransform * vec3( ANISOTROPYMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_CLEARCOATMAP\n\tvClearcoatMapUv = ( clearcoatMapTransform * vec3( CLEARCOATMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_CLEARCOAT_NORMALMAP\n\tvClearcoatNormalMapUv = ( clearcoatNormalMapTransform * vec3( CLEARCOAT_NORMALMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_CLEARCOAT_ROUGHNESSMAP\n\tvClearcoatRoughnessMapUv = ( clearcoatRoughnessMapTransform * vec3( CLEARCOAT_ROUGHNESSMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_IRIDESCENCEMAP\n\tvIridescenceMapUv = ( iridescenceMapTransform * vec3( IRIDESCENCEMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_IRIDESCENCE_THICKNESSMAP\n\tvIridescenceThicknessMapUv = ( iridescenceThicknessMapTransform * vec3( IRIDESCENCE_THICKNESSMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_SHEEN_COLORMAP\n\tvSheenColorMapUv = ( sheenColorMapTransform * vec3( SHEEN_COLORMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_SHEEN_ROUGHNESSMAP\n\tvSheenRoughnessMapUv = ( sheenRoughnessMapTransform * vec3( SHEEN_ROUGHNESSMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_SPECULARMAP\n\tvSpecularMapUv = ( specularMapTransform * vec3( SPECULARMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_SPECULAR_COLORMAP\n\tvSpecularColorMapUv = ( specularColorMapTransform * vec3( SPECULAR_COLORMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_SPECULAR_INTENSITYMAP\n\tvSpecularIntensityMapUv = ( specularIntensityMapTransform * vec3( SPECULAR_INTENSITYMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_TRANSMISSIONMAP\n\tvTransmissionMapUv = ( transmissionMapTransform * vec3( TRANSMISSIONMAP_UV, 1 ) ).xy;\n#endif\n#ifdef USE_THICKNESSMAP\n\tvThicknessMapUv = ( thicknessMapTransform * vec3( THICKNESSMAP_UV, 1 ) ).xy;\n#endif";
+
+var worldpos_vertex = "#if defined( USE_ENVMAP ) || defined( DISTANCE ) || defined ( USE_SHADOWMAP ) || defined ( USE_TRANSMISSION ) || NUM_SPOT_LIGHT_COORDS > 0\n\tvec4 worldPosition = vec4( transformed, 1.0 );\n\t#ifdef USE_BATCHING\n\t\tworldPosition = batchingMatrix * worldPosition;\n\t#endif\n\t#ifdef USE_INSTANCING\n\t\tworldPosition = instanceMatrix * worldPosition;\n\t#endif\n\tworldPosition = modelMatrix * worldPosition;\n#endif";
+
+const vertex$h = "varying vec2 vUv;\nuniform mat3 uvTransform;\nvoid main() {\n\tvUv = ( uvTransform * vec3( uv, 1 ) ).xy;\n\tgl_Position = vec4( position.xy, 1.0, 1.0 );\n}";
+
+const fragment$h = "uniform sampler2D t2D;\nuniform float backgroundIntensity;\nvarying vec2 vUv;\nvoid main() {\n\tvec4 texColor = texture2D( t2D, vUv );\n\t#ifdef DECODE_VIDEO_TEXTURE\n\t\ttexColor = vec4( mix( pow( texColor.rgb * 0.9478672986 + vec3( 0.0521327014 ), vec3( 2.4 ) ), texColor.rgb * 0.0773993808, vec3( lessThanEqual( texColor.rgb, vec3( 0.04045 ) ) ) ), texColor.w );\n\t#endif\n\ttexColor.rgb *= backgroundIntensity;\n\tgl_FragColor = texColor;\n\t#include <tonemapping_fragment>\n\t#include <colorspace_fragment>\n}";
+
+const vertex$g = "varying vec3 vWorldDirection;\n#include <common>\nvoid main() {\n\tvWorldDirection = transformDirection( position, modelMatrix );\n\t#include <begin_vertex>\n\t#include <project_vertex>\n\tgl_Position.z = gl_Position.w;\n}";
+
+const fragment$g = "#ifdef ENVMAP_TYPE_CUBE\n\tuniform samplerCube envMap;\n#elif defined( ENVMAP_TYPE_CUBE_UV )\n\tuniform sampler2D envMap;\n#endif\nuniform float backgroundBlurriness;\nuniform float backgroundIntensity;\nuniform mat3 backgroundRotation;\nvarying vec3 vWorldDirection;\n#include <cube_uv_reflection_fragment>\nvoid main() {\n\t#ifdef ENVMAP_TYPE_CUBE\n\t\tvec4 texColor = textureCube( envMap, backgroundRotation * vWorldDirection );\n\t#elif defined( ENVMAP_TYPE_CUBE_UV )\n\t\tvec4 texColor = textureCubeUV( envMap, backgroundRotation * vWorldDirection, backgroundBlurriness );\n\t#else\n\t\tvec4 texColor = vec4( 0.0, 0.0, 0.0, 1.0 );\n\t#endif\n\ttexColor.rgb *= backgroundIntensity;\n\tgl_FragColor = texColor;\n\t#include <tonemapping_fragment>\n\t#include <colorspace_fragment>\n}";
+
+const vertex$f = "varying vec3 vWorldDirection;\n#include <common>\nvoid main() {\n\tvWorldDirection = transformDirection( position, modelMatrix );\n\t#include <begin_vertex>\n\t#include <project_vertex>\n\tgl_Position.z = gl_Position.w;\n}";
+
+const fragment$f = "uniform samplerCube tCube;\nuniform float tFlip;\nuniform float opacity;\nvarying vec3 vWorldDirection;\nvoid main() {\n\tvec4 texColor = textureCube( tCube, vec3( tFlip * vWorldDirection.x, vWorldDirection.yz ) );\n\tgl_FragColor = texColor;\n\tgl_FragColor.a *= opacity;\n\t#include <tonemapping_fragment>\n\t#include <colorspace_fragment>\n}";
+
+const vertex$e = "#include <common>\n#include <batching_pars_vertex>\n#include <uv_pars_vertex>\n#include <displacementmap_pars_vertex>\n#include <morphtarget_pars_vertex>\n#include <skinning_pars_vertex>\n#include <logdepthbuf_pars_vertex>\n#include <clipping_planes_pars_vertex>\nvarying vec2 vHighPrecisionZW;\nvoid main() {\n\t#include <uv_vertex>\n\t#include <batching_vertex>\n\t#include <skinbase_vertex>\n\t#include <morphinstance_vertex>\n\t#ifdef USE_DISPLACEMENTMAP\n\t\t#include <beginnormal_vertex>\n\t\t#include <morphnormal_vertex>\n\t\t#include <skinnormal_vertex>\n\t#endif\n\t#include <begin_vertex>\n\t#include <morphtarget_vertex>\n\t#include <skinning_vertex>\n\t#include <displacementmap_vertex>\n\t#include <project_vertex>\n\t#include <logdepthbuf_vertex>\n\t#include <clipping_planes_vertex>\n\tvHighPrecisionZW = gl_Position.zw;\n}";
+
+const fragment$e = "#if DEPTH_PACKING == 3200\n\tuniform float opacity;\n#endif\n#include <common>\n#include <packing>\n#include <uv_pars_fragment>\n#include <map_pars_fragment>\n#include <alphamap_pars_fragment>\n#include <alphatest_pars_fragment>\n#include <alphahash_pars_fragment>\n#include <logdepthbuf_pars_fragment>\n#include <clipping_planes_pars_fragment>\nvarying vec2 vHighPrecisionZW;\nvoid main() {\n\tvec4 diffuseColor = vec4( 1.0 );\n\t#include <clipping_planes_fragment>\n\t#if DEPTH_PACKING == 3200\n\t\tdiffuseColor.a = opacity;\n\t#endif\n\t#include <map_fragment>\n\t#include <alphamap_fragment>\n\t#include <alphatest_fragment>\n\t#include <alphahash_fragment>\n\t#include <logdepthbuf_fragment>\n\t#ifdef USE_REVERSED_DEPTH_BUFFER\n\t\tfloat fragCoordZ = vHighPrecisionZW[ 0 ] / vHighPrecisionZW[ 1 ];\n\t#else\n\t\tfloat fragCoordZ = 0.5 * vHighPrecisionZW[ 0 ] / vHighPrecisionZW[ 1 ] + 0.5;\n\t#endif\n\t#if DEPTH_PACKING == 3200\n\t\tgl_FragColor = vec4( vec3( 1.0 - fragCoordZ ), opacity );\n\t#elif DEPTH_PACKING == 3201\n\t\tgl_FragColor = packDepthToRGBA( fragCoordZ );\n\t#elif DEPTH_PACKING == 3202\n\t\tgl_FragColor = vec4( packDepthToRGB( fragCoordZ ), 1.0 );\n\t#elif DEPTH_PACKING == 3203\n\t\tgl_FragColor = vec4( packDepthToRG( fragCoordZ ), 0.0, 1.0 );\n\t#endif\n}";
+
+const vertex$d = "#define DISTANCE\nvarying vec3 vWorldPosition;\n#include <common>\n#include <batching_pars_vertex>\n#include <uv_pars_vertex>\n#include <displacementmap_pars_vertex>\n#include <morphtarget_pars_vertex>\n#include <skinning_pars_vertex>\n#include <clipping_planes_pars_vertex>\nvoid main() {\n\t#include <uv_vertex>\n\t#include <batching_vertex>\n\t#include <skinbase_vertex>\n\t#include <morphinstance_vertex>\n\t#ifdef USE_DISPLACEMENTMAP\n\t\t#include <beginnormal_vertex>\n\t\t#include <morphnormal_vertex>\n\t\t#include <skinnormal_vertex>\n\t#endif\n\t#include <begin_vertex>\n\t#include <morphtarget_vertex>\n\t#include <skinning_vertex>\n\t#include <displacementmap_vertex>\n\t#include <project_vertex>\n\t#include <worldpos_vertex>\n\t#include <clipping_planes_vertex>\n\tvWorldPosition = worldPosition.xyz;\n}";
+
+const fragment$d = "#define DISTANCE\nuniform vec3 referencePosition;\nuniform float nearDistance;\nuniform float farDistance;\nvarying vec3 vWorldPosition;\n#include <common>\n#include <uv_pars_fragment>\n#include <map_pars_fragment>\n#include <alphamap_pars_fragment>\n#include <alphatest_pars_fragment>\n#include <alphahash_pars_fragment>\n#include <clipping_planes_pars_fragment>\nvoid main() {\n\tvec4 diffuseColor = vec4( 1.0 );\n\t#include <clipping_planes_fragment>\n\t#include <map_fragment>\n\t#include <alphamap_fragment>\n\t#include <alphatest_fragment>\n\t#include <alphahash_fragment>\n\tfloat dist = length( vWorldPosition - referencePosition );\n\tdist = ( dist - nearDistance ) / ( farDistance - nearDistance );\n\tdist = saturate( dist );\n\tgl_FragColor = vec4( dist, 0.0, 0.0, 1.0 );\n}";
+
+const vertex$c = "varying vec3 vWorldDirection;\n#include <common>\nvoid main() {\n\tvWorldDirection = transformDirection( position, modelMatrix );\n\t#include <begin_vertex>\n\t#include <project_vertex>\n}";
+
+const fragment$c = "uniform sampler2D tEquirect;\nvarying vec3 vWorldDirection;\n#include <common>\nvoid main() {\n\tvec3 direction = normalize( vWorldDirection );\n\tvec2 sampleUV = equirectUv( direction );\n\tgl_FragColor = texture2D( tEquirect, sampleUV );\n\t#include <tonemapping_fragment>\n\t#include <colorspace_fragment>\n}";
+
+const vertex$b = "uniform float scale;\nattribute float lineDistance;\nvarying float vLineDistance;\n#include <common>\n#include <uv_pars_vertex>\n#include <color_pars_vertex>\n#include <fog_pars_vertex>\n#include <morphtarget_pars_vertex>\n#include <logdepthbuf_pars_vertex>\n#include <clipping_planes_pars_vertex>\nvoid main() {\n\tvLineDistance = scale * lineDistance;\n\t#include <uv_vertex>\n\t#include <color_vertex>\n\t#include <morphinstance_vertex>\n\t#include <morphcolor_vertex>\n\t#include <begin_vertex>\n\t#include <morphtarget_vertex>\n\t#include <project_vertex>\n\t#include <logdepthbuf_vertex>\n\t#include <clipping_planes_vertex>\n\t#include <fog_vertex>\n}";
+
+const fragment$b = "uniform vec3 diffuse;\nuniform float opacity;\nuniform float dashSize;\nuniform float totalSize;\nvarying float vLineDistance;\n#include <common>\n#include <color_pars_fragment>\n#include <uv_pars_fragment>\n#include <map_pars_fragment>\n#include <fog_pars_fragment>\n#include <logdepthbuf_pars_fragment>\n#include <clipping_planes_pars_fragment>\nvoid main() {\n\tvec4 diffuseColor = vec4( diffuse, opacity );\n\t#include <clipping_planes_fragment>\n\tif ( mod( vLineDistance, totalSize ) > dashSize ) {\n\t\tdiscard;\n\t}\n\tvec3 outgoingLight = vec3( 0.0 );\n\t#include <logdepthbuf_fragment>\n\t#include <map_fragment>\n\t#include <color_fragment>\n\toutgoingLight = diffuseColor.rgb;\n\t#include <opaque_fragment>\n\t#include <tonemapping_fragment>\n\t#include <colorspace_fragment>\n\t#include <fog_fragment>\n\t#include <premultiplied_alpha_fragment>\n}";
+
+const vertex$a = "#include <common>\n#include <batching_pars_vertex>\n#include <uv_pars_vertex>\n#include <envmap_pars_vertex>\n#include <color_pars_vertex>\n#include <fog_pars_vertex>\n#include <morphtarget_pars_vertex>\n#include <skinning_pars_vertex>\n#include <logdepthbuf_pars_vertex>\n#include <clipping_planes_pars_vertex>\nvoid main() {\n\t#include <uv_vertex>\n\t#include <color_vertex>\n\t#include <morphinstance_vertex>\n\t#include <morphcolor_vertex>\n\t#include <batching_vertex>\n\t#if defined ( USE_ENVMAP ) || defined ( USE_SKINNING )\n\t\t#include <beginnormal_vertex>\n\t\t#include <morphnormal_vertex>\n\t\t#include <skinbase_vertex>\n\t\t#include <skinnormal_vertex>\n\t\t#include <defaultnormal_vertex>\n\t#endif\n\t#include <begin_vertex>\n\t#include <morphtarget_vertex>\n\t#include <skinning_vertex>\n\t#include <project_vertex>\n\t#include <logdepthbuf_vertex>\n\t#include <clipping_planes_vertex>\n\t#include <worldpos_vertex>\n\t#include <envmap_vertex>\n\t#include <fog_vertex>\n}";
+
+const fragment$a = "uniform vec3 diffuse;\nuniform float opacity;\n#ifndef FLAT_SHADED\n\tvarying vec3 vNormal;\n#endif\n#include <common>\n#include <dithering_pars_fragment>\n#include <color_pars_fragment>\n#include <uv_pars_fragment>\n#include <map_pars_fragment>\n#include <alphamap_pars_fragment>\n#include <alphatest_pars_fragment>\n#include <alphahash_pars_fragment>\n#include <aomap_pars_fragment>\n#include <lightmap_pars_fragment>\n#include <envmap_common_pars_fragment>\n#include <envmap_pars_fragment>\n#include <fog_pars_fragment>\n#include <specularmap_pars_fragment>\n#include <logdepthbuf_pars_fragment>\n#include <clipping_planes_pars_fragment>\nvoid main() {\n\tvec4 diffuseColor = vec4( diffuse, opacity );\n\t#include <clipping_planes_fragment>\n\t#include <logdepthbuf_fragment>\n\t#include <map_fragment>\n\t#include <color_fragment>\n\t#include <alphamap_fragment>\n\t#include <alphatest_fragment>\n\t#include <alphahash_fragment>\n\t#include <specularmap_fragment>\n\tReflectedLight reflectedLight = ReflectedLight( vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ) );\n\t#ifdef USE_LIGHTMAP\n\t\tvec4 lightMapTexel = texture2D( lightMap, vLightMapUv );\n\t\treflectedLight.indirectDiffuse += lightMapTexel.rgb * lightMapIntensity * RECIPROCAL_PI;\n\t#else\n\t\treflectedLight.indirectDiffuse += vec3( 1.0 );\n\t#endif\n\t#include <aomap_fragment>\n\treflectedLight.indirectDiffuse *= diffuseColor.rgb;\n\tvec3 outgoingLight = reflectedLight.indirectDiffuse;\n\t#include <envmap_fragment>\n\t#include <opaque_fragment>\n\t#include <tonemapping_fragment>\n\t#include <colorspace_fragment>\n\t#include <fog_fragment>\n\t#include <premultiplied_alpha_fragment>\n\t#include <dithering_fragment>\n}";
+
+const vertex$9 = "#define LAMBERT\nvarying vec3 vViewPosition;\n#include <common>\n#include <batching_pars_vertex>\n#include <uv_pars_vertex>\n#include <displacementmap_pars_vertex>\n#include <envmap_pars_vertex>\n#include <color_pars_vertex>\n#include <fog_pars_vertex>\n#include <normal_pars_vertex>\n#include <morphtarget_pars_vertex>\n#include <skinning_pars_vertex>\n#include <shadowmap_pars_vertex>\n#include <logdepthbuf_pars_vertex>\n#include <clipping_planes_pars_vertex>\nvoid main() {\n\t#include <uv_vertex>\n\t#include <color_vertex>\n\t#include <morphinstance_vertex>\n\t#include <morphcolor_vertex>\n\t#include <batching_vertex>\n\t#include <beginnormal_vertex>\n\t#include <morphnormal_vertex>\n\t#include <skinbase_vertex>\n\t#include <skinnormal_vertex>\n\t#include <defaultnormal_vertex>\n\t#include <normal_vertex>\n\t#include <begin_vertex>\n\t#include <morphtarget_vertex>\n\t#include <skinning_vertex>\n\t#include <displacementmap_vertex>\n\t#include <project_vertex>\n\t#include <logdepthbuf_vertex>\n\t#include <clipping_planes_vertex>\n\tvViewPosition = - mvPosition.xyz;\n\t#include <worldpos_vertex>\n\t#include <envmap_vertex>\n\t#include <shadowmap_vertex>\n\t#include <fog_vertex>\n}";
+
+const fragment$9 = "#define LAMBERT\nuniform vec3 diffuse;\nuniform vec3 emissive;\nuniform float opacity;\n#include <common>\n#include <dithering_pars_fragment>\n#include <color_pars_fragment>\n#include <uv_pars_fragment>\n#include <map_pars_fragment>\n#include <alphamap_pars_fragment>\n#include <alphatest_pars_fragment>\n#include <alphahash_pars_fragment>\n#include <aomap_pars_fragment>\n#include <lightmap_pars_fragment>\n#include <emissivemap_pars_fragment>\n#include <cube_uv_reflection_fragment>\n#include <envmap_common_pars_fragment>\n#include <envmap_pars_fragment>\n#include <envmap_physical_pars_fragment>\n#include <fog_pars_fragment>\n#include <bsdfs>\n#include <lights_pars_begin>\n#include <normal_pars_fragment>\n#include <lights_lambert_pars_fragment>\n#include <shadowmap_pars_fragment>\n#include <bumpmap_pars_fragment>\n#include <normalmap_pars_fragment>\n#include <specularmap_pars_fragment>\n#include <logdepthbuf_pars_fragment>\n#include <clipping_planes_pars_fragment>\nvoid main() {\n\tvec4 diffuseColor = vec4( diffuse, opacity );\n\t#include <clipping_planes_fragment>\n\tReflectedLight reflectedLight = ReflectedLight( vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ) );\n\tvec3 totalEmissiveRadiance = emissive;\n\t#include <logdepthbuf_fragment>\n\t#include <map_fragment>\n\t#include <color_fragment>\n\t#include <alphamap_fragment>\n\t#include <alphatest_fragment>\n\t#include <alphahash_fragment>\n\t#include <specularmap_fragment>\n\t#include <normal_fragment_begin>\n\t#include <normal_fragment_maps>\n\t#include <emissivemap_fragment>\n\t#include <lights_lambert_fragment>\n\t#include <lights_fragment_begin>\n\t#include <lights_fragment_maps>\n\t#include <lights_fragment_end>\n\t#include <aomap_fragment>\n\tvec3 outgoingLight = reflectedLight.directDiffuse + reflectedLight.indirectDiffuse + totalEmissiveRadiance;\n\t#include <envmap_fragment>\n\t#include <opaque_fragment>\n\t#include <tonemapping_fragment>\n\t#include <colorspace_fragment>\n\t#include <fog_fragment>\n\t#include <premultiplied_alpha_fragment>\n\t#include <dithering_fragment>\n}";
+
+const vertex$8 = "#define MATCAP\nvarying vec3 vViewPosition;\n#include <common>\n#include <batching_pars_vertex>\n#include <uv_pars_vertex>\n#include <color_pars_vertex>\n#include <displacementmap_pars_vertex>\n#include <fog_pars_vertex>\n#include <normal_pars_vertex>\n#include <morphtarget_pars_vertex>\n#include <skinning_pars_vertex>\n#include <logdepthbuf_pars_vertex>\n#include <clipping_planes_pars_vertex>\nvoid main() {\n\t#include <uv_vertex>\n\t#include <color_vertex>\n\t#include <morphinstance_vertex>\n\t#include <morphcolor_vertex>\n\t#include <batching_vertex>\n\t#include <beginnormal_vertex>\n\t#include <morphnormal_vertex>\n\t#include <skinbase_vertex>\n\t#include <skinnormal_vertex>\n\t#include <defaultnormal_vertex>\n\t#include <normal_vertex>\n\t#include <begin_vertex>\n\t#include <morphtarget_vertex>\n\t#include <skinning_vertex>\n\t#include <displacementmap_vertex>\n\t#include <project_vertex>\n\t#include <logdepthbuf_vertex>\n\t#include <clipping_planes_vertex>\n\t#include <fog_vertex>\n\tvViewPosition = - mvPosition.xyz;\n}";
+
+const fragment$8 = "#define MATCAP\nuniform vec3 diffuse;\nuniform float opacity;\nuniform sampler2D matcap;\nvarying vec3 vViewPosition;\n#include <common>\n#include <dithering_pars_fragment>\n#include <color_pars_fragment>\n#include <uv_pars_fragment>\n#include <map_pars_fragment>\n#include <alphamap_pars_fragment>\n#include <alphatest_pars_fragment>\n#include <alphahash_pars_fragment>\n#include <fog_pars_fragment>\n#include <normal_pars_fragment>\n#include <bumpmap_pars_fragment>\n#include <normalmap_pars_fragment>\n#include <logdepthbuf_pars_fragment>\n#include <clipping_planes_pars_fragment>\nvoid main() {\n\tvec4 diffuseColor = vec4( diffuse, opacity );\n\t#include <clipping_planes_fragment>\n\t#include <logdepthbuf_fragment>\n\t#include <map_fragment>\n\t#include <color_fragment>\n\t#include <alphamap_fragment>\n\t#include <alphatest_fragment>\n\t#include <alphahash_fragment>\n\t#include <normal_fragment_begin>\n\t#include <normal_fragment_maps>\n\tvec3 viewDir = normalize( vViewPosition );\n\tvec3 x = normalize( vec3( viewDir.z, 0.0, - viewDir.x ) );\n\tvec3 y = cross( viewDir, x );\n\tvec2 uv = vec2( dot( x, normal ), dot( y, normal ) ) * 0.495 + 0.5;\n\t#ifdef USE_MATCAP\n\t\tvec4 matcapColor = texture2D( matcap, uv );\n\t#else\n\t\tvec4 matcapColor = vec4( vec3( mix( 0.2, 0.8, uv.y ) ), 1.0 );\n\t#endif\n\tvec3 outgoingLight = diffuseColor.rgb * matcapColor.rgb;\n\t#include <opaque_fragment>\n\t#include <tonemapping_fragment>\n\t#include <colorspace_fragment>\n\t#include <fog_fragment>\n\t#include <premultiplied_alpha_fragment>\n\t#include <dithering_fragment>\n}";
+
+const vertex$7 = "#define NORMAL\n#if defined( FLAT_SHADED ) || defined( USE_BUMPMAP ) || defined( USE_NORMALMAP_TANGENTSPACE )\n\tvarying vec3 vViewPosition;\n#endif\n#include <common>\n#include <batching_pars_vertex>\n#include <uv_pars_vertex>\n#include <displacementmap_pars_vertex>\n#include <normal_pars_vertex>\n#include <morphtarget_pars_vertex>\n#include <skinning_pars_vertex>\n#include <logdepthbuf_pars_vertex>\n#include <clipping_planes_pars_vertex>\nvoid main() {\n\t#include <uv_vertex>\n\t#include <batching_vertex>\n\t#include <beginnormal_vertex>\n\t#include <morphinstance_vertex>\n\t#include <morphnormal_vertex>\n\t#include <skinbase_vertex>\n\t#include <skinnormal_vertex>\n\t#include <defaultnormal_vertex>\n\t#include <normal_vertex>\n\t#include <begin_vertex>\n\t#include <morphtarget_vertex>\n\t#include <skinning_vertex>\n\t#include <displacementmap_vertex>\n\t#include <project_vertex>\n\t#include <logdepthbuf_vertex>\n\t#include <clipping_planes_vertex>\n#if defined( FLAT_SHADED ) || defined( USE_BUMPMAP ) || defined( USE_NORMALMAP_TANGENTSPACE )\n\tvViewPosition = - mvPosition.xyz;\n#endif\n}";
+
+const fragment$7 = "#define NORMAL\nuniform float opacity;\n#if defined( FLAT_SHADED ) || defined( USE_BUMPMAP ) || defined( USE_NORMALMAP_TANGENTSPACE )\n\tvarying vec3 vViewPosition;\n#endif\n#include <uv_pars_fragment>\n#include <normal_pars_fragment>\n#include <bumpmap_pars_fragment>\n#include <normalmap_pars_fragment>\n#include <logdepthbuf_pars_fragment>\n#include <clipping_planes_pars_fragment>\nvoid main() {\n\tvec4 diffuseColor = vec4( 0.0, 0.0, 0.0, opacity );\n\t#include <clipping_planes_fragment>\n\t#include <logdepthbuf_fragment>\n\t#include <normal_fragment_begin>\n\t#include <normal_fragment_maps>\n\tgl_FragColor = vec4( normalize( normal ) * 0.5 + 0.5, diffuseColor.a );\n\t#ifdef OPAQUE\n\t\tgl_FragColor.a = 1.0;\n\t#endif\n}";
+
+const vertex$6 = "#define PHONG\nvarying vec3 vViewPosition;\n#include <common>\n#include <batching_pars_vertex>\n#include <uv_pars_vertex>\n#include <displacementmap_pars_vertex>\n#include <envmap_pars_vertex>\n#include <color_pars_vertex>\n#include <fog_pars_vertex>\n#include <normal_pars_vertex>\n#include <morphtarget_pars_vertex>\n#include <skinning_pars_vertex>\n#include <shadowmap_pars_vertex>\n#include <logdepthbuf_pars_vertex>\n#include <clipping_planes_pars_vertex>\nvoid main() {\n\t#include <uv_vertex>\n\t#include <color_vertex>\n\t#include <morphcolor_vertex>\n\t#include <batching_vertex>\n\t#include <beginnormal_vertex>\n\t#include <morphinstance_vertex>\n\t#include <morphnormal_vertex>\n\t#include <skinbase_vertex>\n\t#include <skinnormal_vertex>\n\t#include <defaultnormal_vertex>\n\t#include <normal_vertex>\n\t#include <begin_vertex>\n\t#include <morphtarget_vertex>\n\t#include <skinning_vertex>\n\t#include <displacementmap_vertex>\n\t#include <project_vertex>\n\t#include <logdepthbuf_vertex>\n\t#include <clipping_planes_vertex>\n\tvViewPosition = - mvPosition.xyz;\n\t#include <worldpos_vertex>\n\t#include <envmap_vertex>\n\t#include <shadowmap_vertex>\n\t#include <fog_vertex>\n}";
+
+const fragment$6 = "#define PHONG\nuniform vec3 diffuse;\nuniform vec3 emissive;\nuniform vec3 specular;\nuniform float shininess;\nuniform float opacity;\n#include <common>\n#include <dithering_pars_fragment>\n#include <color_pars_fragment>\n#include <uv_pars_fragment>\n#include <map_pars_fragment>\n#include <alphamap_pars_fragment>\n#include <alphatest_pars_fragment>\n#include <alphahash_pars_fragment>\n#include <aomap_pars_fragment>\n#include <lightmap_pars_fragment>\n#include <emissivemap_pars_fragment>\n#include <cube_uv_reflection_fragment>\n#include <envmap_common_pars_fragment>\n#include <envmap_pars_fragment>\n#include <envmap_physical_pars_fragment>\n#include <fog_pars_fragment>\n#include <bsdfs>\n#include <lights_pars_begin>\n#include <normal_pars_fragment>\n#include <lights_phong_pars_fragment>\n#include <shadowmap_pars_fragment>\n#include <bumpmap_pars_fragment>\n#include <normalmap_pars_fragment>\n#include <specularmap_pars_fragment>\n#include <logdepthbuf_pars_fragment>\n#include <clipping_planes_pars_fragment>\nvoid main() {\n\tvec4 diffuseColor = vec4( diffuse, opacity );\n\t#include <clipping_planes_fragment>\n\tReflectedLight reflectedLight = ReflectedLight( vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ) );\n\tvec3 totalEmissiveRadiance = emissive;\n\t#include <logdepthbuf_fragment>\n\t#include <map_fragment>\n\t#include <color_fragment>\n\t#include <alphamap_fragment>\n\t#include <alphatest_fragment>\n\t#include <alphahash_fragment>\n\t#include <specularmap_fragment>\n\t#include <normal_fragment_begin>\n\t#include <normal_fragment_maps>\n\t#include <emissivemap_fragment>\n\t#include <lights_phong_fragment>\n\t#include <lights_fragment_begin>\n\t#include <lights_fragment_maps>\n\t#include <lights_fragment_end>\n\t#include <aomap_fragment>\n\tvec3 outgoingLight = reflectedLight.directDiffuse + reflectedLight.indirectDiffuse + reflectedLight.directSpecular + reflectedLight.indirectSpecular + totalEmissiveRadiance;\n\t#include <envmap_fragment>\n\t#include <opaque_fragment>\n\t#include <tonemapping_fragment>\n\t#include <colorspace_fragment>\n\t#include <fog_fragment>\n\t#include <premultiplied_alpha_fragment>\n\t#include <dithering_fragment>\n}";
+
+const vertex$5 = "#define STANDARD\nvarying vec3 vViewPosition;\n#ifdef USE_TRANSMISSION\n\tvarying vec3 vWorldPosition;\n#endif\n#include <common>\n#include <batching_pars_vertex>\n#include <uv_pars_vertex>\n#include <displacementmap_pars_vertex>\n#include <color_pars_vertex>\n#include <fog_pars_vertex>\n#include <normal_pars_vertex>\n#include <morphtarget_pars_vertex>\n#include <skinning_pars_vertex>\n#include <shadowmap_pars_vertex>\n#include <logdepthbuf_pars_vertex>\n#include <clipping_planes_pars_vertex>\nvoid main() {\n\t#include <uv_vertex>\n\t#include <color_vertex>\n\t#include <morphinstance_vertex>\n\t#include <morphcolor_vertex>\n\t#include <batching_vertex>\n\t#include <beginnormal_vertex>\n\t#include <morphnormal_vertex>\n\t#include <skinbase_vertex>\n\t#include <skinnormal_vertex>\n\t#include <defaultnormal_vertex>\n\t#include <normal_vertex>\n\t#include <begin_vertex>\n\t#include <morphtarget_vertex>\n\t#include <skinning_vertex>\n\t#include <displacementmap_vertex>\n\t#include <project_vertex>\n\t#include <logdepthbuf_vertex>\n\t#include <clipping_planes_vertex>\n\tvViewPosition = - mvPosition.xyz;\n\t#include <worldpos_vertex>\n\t#include <shadowmap_vertex>\n\t#include <fog_vertex>\n#ifdef USE_TRANSMISSION\n\tvWorldPosition = worldPosition.xyz;\n#endif\n}";
+
+const fragment$5 = "#define STANDARD\n#ifdef PHYSICAL\n\t#define IOR\n\t#define USE_SPECULAR\n#endif\nuniform vec3 diffuse;\nuniform vec3 emissive;\nuniform float roughness;\nuniform float metalness;\nuniform float opacity;\n#ifdef IOR\n\tuniform float ior;\n#endif\n#ifdef USE_SPECULAR\n\tuniform float specularIntensity;\n\tuniform vec3 specularColor;\n\t#ifdef USE_SPECULAR_COLORMAP\n\t\tuniform sampler2D specularColorMap;\n\t#endif\n\t#ifdef USE_SPECULAR_INTENSITYMAP\n\t\tuniform sampler2D specularIntensityMap;\n\t#endif\n#endif\n#ifdef USE_CLEARCOAT\n\tuniform float clearcoat;\n\tuniform float clearcoatRoughness;\n#endif\n#ifdef USE_DISPERSION\n\tuniform float dispersion;\n#endif\n#ifdef USE_RETROREFLECTION\n\tuniform float retroreflectivity;\n#endif\n#ifdef USE_IRIDESCENCE\n\tuniform float iridescence;\n\tuniform float iridescenceIOR;\n\tuniform float iridescenceThicknessMinimum;\n\tuniform float iridescenceThicknessMaximum;\n#endif\n#ifdef USE_SHEEN\n\tuniform vec3 sheenColor;\n\tuniform float sheenRoughness;\n\t#ifdef USE_SHEEN_COLORMAP\n\t\tuniform sampler2D sheenColorMap;\n\t#endif\n\t#ifdef USE_SHEEN_ROUGHNESSMAP\n\t\tuniform sampler2D sheenRoughnessMap;\n\t#endif\n#endif\n#ifdef USE_ANISOTROPY\n\tuniform vec2 anisotropyVector;\n\t#ifdef USE_ANISOTROPYMAP\n\t\tuniform sampler2D anisotropyMap;\n\t#endif\n#endif\nvarying vec3 vViewPosition;\n#include <common>\n#include <dithering_pars_fragment>\n#include <color_pars_fragment>\n#include <uv_pars_fragment>\n#include <map_pars_fragment>\n#include <alphamap_pars_fragment>\n#include <alphatest_pars_fragment>\n#include <alphahash_pars_fragment>\n#include <aomap_pars_fragment>\n#include <lightmap_pars_fragment>\n#include <emissivemap_pars_fragment>\n#include <iridescence_fragment>\n#include <cube_uv_reflection_fragment>\n#include <envmap_common_pars_fragment>\n#include <envmap_physical_pars_fragment>\n#include <fog_pars_fragment>\n#include <lights_pars_begin>\n#include <normal_pars_fragment>\n#include <lights_physical_pars_fragment>\n#include <transmission_pars_fragment>\n#include <shadowmap_pars_fragment>\n#include <bumpmap_pars_fragment>\n#include <normalmap_pars_fragment>\n#include <clearcoat_pars_fragment>\n#include <iridescence_pars_fragment>\n#include <roughnessmap_pars_fragment>\n#include <metalnessmap_pars_fragment>\n#include <logdepthbuf_pars_fragment>\n#include <clipping_planes_pars_fragment>\nvoid main() {\n\tvec4 diffuseColor = vec4( diffuse, opacity );\n\t#include <clipping_planes_fragment>\n\tReflectedLight reflectedLight = ReflectedLight( vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ) );\n\tvec3 totalEmissiveRadiance = emissive;\n\t#include <logdepthbuf_fragment>\n\t#include <map_fragment>\n\t#include <color_fragment>\n\t#include <alphamap_fragment>\n\t#include <alphatest_fragment>\n\t#include <alphahash_fragment>\n\t#include <roughnessmap_fragment>\n\t#include <metalnessmap_fragment>\n\t#include <normal_fragment_begin>\n\t#include <normal_fragment_maps>\n\t#include <clearcoat_normal_fragment_begin>\n\t#include <clearcoat_normal_fragment_maps>\n\t#include <emissivemap_fragment>\n\t#include <lights_physical_fragment>\n\t#include <lights_fragment_begin>\n\t#include <lights_fragment_maps>\n\t#include <lights_fragment_end>\n\t#include <aomap_fragment>\n\tvec3 totalDiffuse = reflectedLight.directDiffuse + reflectedLight.indirectDiffuse;\n\tvec3 totalSpecular = reflectedLight.directSpecular + reflectedLight.indirectSpecular;\n\t#include <transmission_fragment>\n\tvec3 outgoingLight = totalDiffuse + totalSpecular + totalEmissiveRadiance;\n\t#ifdef USE_SHEEN\n \n\t\toutgoingLight = outgoingLight + sheenSpecularDirect + sheenSpecularIndirect;\n \n \t#endif\n\t#ifdef USE_CLEARCOAT\n\t\tfloat dotNVcc = saturate( dot( geometryClearcoatNormal, geometryViewDir ) );\n\t\tvec3 Fcc = F_Schlick( material.clearcoatF0, material.clearcoatF90, dotNVcc );\n\t\toutgoingLight = outgoingLight * ( 1.0 - material.clearcoat * Fcc ) + ( clearcoatSpecularDirect + clearcoatSpecularIndirect ) * material.clearcoat;\n\t#endif\n\t#include <opaque_fragment>\n\t#include <tonemapping_fragment>\n\t#include <colorspace_fragment>\n\t#include <fog_fragment>\n\t#include <premultiplied_alpha_fragment>\n\t#include <dithering_fragment>\n}";
+
+const vertex$4 = "#define TOON\nvarying vec3 vViewPosition;\n#include <common>\n#include <batching_pars_vertex>\n#include <uv_pars_vertex>\n#include <displacementmap_pars_vertex>\n#include <color_pars_vertex>\n#include <fog_pars_vertex>\n#include <normal_pars_vertex>\n#include <morphtarget_pars_vertex>\n#include <skinning_pars_vertex>\n#include <shadowmap_pars_vertex>\n#include <logdepthbuf_pars_vertex>\n#include <clipping_planes_pars_vertex>\nvoid main() {\n\t#include <uv_vertex>\n\t#include <color_vertex>\n\t#include <morphinstance_vertex>\n\t#include <morphcolor_vertex>\n\t#include <batching_vertex>\n\t#include <beginnormal_vertex>\n\t#include <morphnormal_vertex>\n\t#include <skinbase_vertex>\n\t#include <skinnormal_vertex>\n\t#include <defaultnormal_vertex>\n\t#include <normal_vertex>\n\t#include <begin_vertex>\n\t#include <morphtarget_vertex>\n\t#include <skinning_vertex>\n\t#include <displacementmap_vertex>\n\t#include <project_vertex>\n\t#include <logdepthbuf_vertex>\n\t#include <clipping_planes_vertex>\n\tvViewPosition = - mvPosition.xyz;\n\t#include <worldpos_vertex>\n\t#include <shadowmap_vertex>\n\t#include <fog_vertex>\n}";
+
+const fragment$4 = "#define TOON\nuniform vec3 diffuse;\nuniform vec3 emissive;\nuniform float opacity;\n#include <common>\n#include <dithering_pars_fragment>\n#include <color_pars_fragment>\n#include <uv_pars_fragment>\n#include <map_pars_fragment>\n#include <alphamap_pars_fragment>\n#include <alphatest_pars_fragment>\n#include <alphahash_pars_fragment>\n#include <aomap_pars_fragment>\n#include <lightmap_pars_fragment>\n#include <emissivemap_pars_fragment>\n#include <gradientmap_pars_fragment>\n#include <fog_pars_fragment>\n#include <bsdfs>\n#include <lights_pars_begin>\n#include <normal_pars_fragment>\n#include <lights_toon_pars_fragment>\n#include <shadowmap_pars_fragment>\n#include <bumpmap_pars_fragment>\n#include <normalmap_pars_fragment>\n#include <logdepthbuf_pars_fragment>\n#include <clipping_planes_pars_fragment>\nvoid main() {\n\tvec4 diffuseColor = vec4( diffuse, opacity );\n\t#include <clipping_planes_fragment>\n\tReflectedLight reflectedLight = ReflectedLight( vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ) );\n\tvec3 totalEmissiveRadiance = emissive;\n\t#include <logdepthbuf_fragment>\n\t#include <map_fragment>\n\t#include <color_fragment>\n\t#include <alphamap_fragment>\n\t#include <alphatest_fragment>\n\t#include <alphahash_fragment>\n\t#include <normal_fragment_begin>\n\t#include <normal_fragment_maps>\n\t#include <emissivemap_fragment>\n\t#include <lights_toon_fragment>\n\t#include <lights_fragment_begin>\n\t#include <lights_fragment_maps>\n\t#include <lights_fragment_end>\n\t#include <aomap_fragment>\n\tvec3 outgoingLight = reflectedLight.directDiffuse + reflectedLight.indirectDiffuse + totalEmissiveRadiance;\n\t#include <opaque_fragment>\n\t#include <tonemapping_fragment>\n\t#include <colorspace_fragment>\n\t#include <fog_fragment>\n\t#include <premultiplied_alpha_fragment>\n\t#include <dithering_fragment>\n}";
+
+const vertex$3 = "uniform float size;\nuniform float scale;\n#include <common>\n#include <color_pars_vertex>\n#include <fog_pars_vertex>\n#include <morphtarget_pars_vertex>\n#include <logdepthbuf_pars_vertex>\n#include <clipping_planes_pars_vertex>\n#ifdef USE_POINTS_UV\n\tvarying vec2 vUv;\n\tuniform mat3 uvTransform;\n#endif\nvoid main() {\n\t#ifdef USE_POINTS_UV\n\t\tvUv = ( uvTransform * vec3( uv, 1 ) ).xy;\n\t#endif\n\t#include <color_vertex>\n\t#include <morphinstance_vertex>\n\t#include <morphcolor_vertex>\n\t#include <begin_vertex>\n\t#include <morphtarget_vertex>\n\t#include <project_vertex>\n\tgl_PointSize = size;\n\t#ifdef USE_SIZEATTENUATION\n\t\tbool isPerspective = isPerspectiveMatrix( projectionMatrix );\n\t\tif ( isPerspective ) gl_PointSize *= ( scale / - mvPosition.z );\n\t#endif\n\t#include <logdepthbuf_vertex>\n\t#include <clipping_planes_vertex>\n\t#include <worldpos_vertex>\n\t#include <fog_vertex>\n}";
+
+const fragment$3 = "uniform vec3 diffuse;\nuniform float opacity;\n#include <common>\n#include <color_pars_fragment>\n#include <map_particle_pars_fragment>\n#include <alphatest_pars_fragment>\n#include <alphahash_pars_fragment>\n#include <fog_pars_fragment>\n#include <logdepthbuf_pars_fragment>\n#include <clipping_planes_pars_fragment>\nvoid main() {\n\tvec4 diffuseColor = vec4( diffuse, opacity );\n\t#include <clipping_planes_fragment>\n\tvec3 outgoingLight = vec3( 0.0 );\n\t#include <logdepthbuf_fragment>\n\t#include <map_particle_fragment>\n\t#include <color_fragment>\n\t#include <alphatest_fragment>\n\t#include <alphahash_fragment>\n\toutgoingLight = diffuseColor.rgb;\n\t#include <opaque_fragment>\n\t#include <tonemapping_fragment>\n\t#include <colorspace_fragment>\n\t#include <fog_fragment>\n\t#include <premultiplied_alpha_fragment>\n}";
+
+const vertex$2 = "#include <common>\n#include <batching_pars_vertex>\n#include <fog_pars_vertex>\n#include <morphtarget_pars_vertex>\n#include <skinning_pars_vertex>\n#include <logdepthbuf_pars_vertex>\n#include <shadowmap_pars_vertex>\nvoid main() {\n\t#include <batching_vertex>\n\t#include <beginnormal_vertex>\n\t#include <morphinstance_vertex>\n\t#include <morphnormal_vertex>\n\t#include <skinbase_vertex>\n\t#include <skinnormal_vertex>\n\t#include <defaultnormal_vertex>\n\t#include <begin_vertex>\n\t#include <morphtarget_vertex>\n\t#include <skinning_vertex>\n\t#include <project_vertex>\n\t#include <logdepthbuf_vertex>\n\t#include <worldpos_vertex>\n\t#include <shadowmap_vertex>\n\t#include <fog_vertex>\n}";
+
+const fragment$2 = "uniform vec3 color;\nuniform float opacity;\n#include <common>\n#include <fog_pars_fragment>\n#include <bsdfs>\n#include <lights_pars_begin>\n#include <logdepthbuf_pars_fragment>\n#include <shadowmap_pars_fragment>\n#include <shadowmask_pars_fragment>\nvoid main() {\n\t#include <logdepthbuf_fragment>\n\tgl_FragColor = vec4( color, opacity * ( 1.0 - getShadowMask() ) );\n\t#include <tonemapping_fragment>\n\t#include <colorspace_fragment>\n\t#include <fog_fragment>\n\t#include <premultiplied_alpha_fragment>\n}";
+
+const vertex$1 = "uniform float rotation;\nuniform vec2 center;\n#include <common>\n#include <uv_pars_vertex>\n#include <fog_pars_vertex>\n#include <logdepthbuf_pars_vertex>\n#include <clipping_planes_pars_vertex>\nvoid main() {\n\t#include <uv_vertex>\n\tvec4 mvPosition = modelViewMatrix[ 3 ];\n\tvec2 scale = vec2( length( modelMatrix[ 0 ].xyz ), length( modelMatrix[ 1 ].xyz ) );\n\t#ifndef USE_SIZEATTENUATION\n\t\tbool isPerspective = isPerspectiveMatrix( projectionMatrix );\n\t\tif ( isPerspective ) scale *= - mvPosition.z;\n\t#endif\n\tvec2 alignedPosition = ( position.xy - ( center - vec2( 0.5 ) ) ) * scale;\n\tvec2 rotatedPosition;\n\trotatedPosition.x = cos( rotation ) * alignedPosition.x - sin( rotation ) * alignedPosition.y;\n\trotatedPosition.y = sin( rotation ) * alignedPosition.x + cos( rotation ) * alignedPosition.y;\n\tmvPosition.xy += rotatedPosition;\n\tgl_Position = projectionMatrix * mvPosition;\n\t#include <logdepthbuf_vertex>\n\t#include <clipping_planes_vertex>\n\t#include <fog_vertex>\n}";
+
+const fragment$1 = "uniform vec3 diffuse;\nuniform float opacity;\n#include <common>\n#include <uv_pars_fragment>\n#include <map_pars_fragment>\n#include <alphamap_pars_fragment>\n#include <alphatest_pars_fragment>\n#include <alphahash_pars_fragment>\n#include <fog_pars_fragment>\n#include <logdepthbuf_pars_fragment>\n#include <clipping_planes_pars_fragment>\nvoid main() {\n\tvec4 diffuseColor = vec4( diffuse, opacity );\n\t#include <clipping_planes_fragment>\n\tvec3 outgoingLight = vec3( 0.0 );\n\t#include <logdepthbuf_fragment>\n\t#include <map_fragment>\n\t#include <alphamap_fragment>\n\t#include <alphatest_fragment>\n\t#include <alphahash_fragment>\n\toutgoingLight = diffuseColor.rgb;\n\t#include <opaque_fragment>\n\t#include <tonemapping_fragment>\n\t#include <colorspace_fragment>\n\t#include <fog_fragment>\n}";
+
+const ShaderChunk = {
+	alphahash_fragment: alphahash_fragment,
+	alphahash_pars_fragment: alphahash_pars_fragment,
+	alphamap_fragment: alphamap_fragment,
+	alphamap_pars_fragment: alphamap_pars_fragment,
+	alphatest_fragment: alphatest_fragment,
+	alphatest_pars_fragment: alphatest_pars_fragment,
+	aomap_fragment: aomap_fragment,
+	aomap_pars_fragment: aomap_pars_fragment,
+	batching_pars_vertex: batching_pars_vertex,
+	batching_vertex: batching_vertex,
+	begin_vertex: begin_vertex,
+	beginnormal_vertex: beginnormal_vertex,
+	bsdfs: bsdfs,
+	iridescence_fragment: iridescence_fragment,
+	bumpmap_pars_fragment: bumpmap_pars_fragment,
+	clipping_planes_fragment: clipping_planes_fragment,
+	clipping_planes_pars_fragment: clipping_planes_pars_fragment,
+	clipping_planes_pars_vertex: clipping_planes_pars_vertex,
+	clipping_planes_vertex: clipping_planes_vertex,
+	color_fragment: color_fragment,
+	color_pars_fragment: color_pars_fragment,
+	color_pars_vertex: color_pars_vertex,
+	color_vertex: color_vertex,
+	common: common,
+	cube_uv_reflection_fragment: cube_uv_reflection_fragment,
+	defaultnormal_vertex: defaultnormal_vertex,
+	displacementmap_pars_vertex: displacementmap_pars_vertex,
+	displacementmap_vertex: displacementmap_vertex,
+	emissivemap_fragment: emissivemap_fragment,
+	emissivemap_pars_fragment: emissivemap_pars_fragment,
+	colorspace_fragment: colorspace_fragment,
+	colorspace_pars_fragment: colorspace_pars_fragment,
+	envmap_fragment: envmap_fragment,
+	envmap_common_pars_fragment: envmap_common_pars_fragment,
+	envmap_pars_fragment: envmap_pars_fragment,
+	envmap_pars_vertex: envmap_pars_vertex,
+	envmap_physical_pars_fragment: envmap_physical_pars_fragment,
+	envmap_vertex: envmap_vertex,
+	fog_vertex: fog_vertex,
+	fog_pars_vertex: fog_pars_vertex,
+	fog_fragment: fog_fragment,
+	fog_pars_fragment: fog_pars_fragment,
+	gradientmap_pars_fragment: gradientmap_pars_fragment,
+	lightmap_pars_fragment: lightmap_pars_fragment,
+	lights_lambert_fragment: lights_lambert_fragment,
+	lights_lambert_pars_fragment: lights_lambert_pars_fragment,
+	lights_pars_begin: lights_pars_begin,
+	lights_toon_fragment: lights_toon_fragment,
+	lights_toon_pars_fragment: lights_toon_pars_fragment,
+	lights_phong_fragment: lights_phong_fragment,
+	lights_phong_pars_fragment: lights_phong_pars_fragment,
+	lights_physical_fragment: lights_physical_fragment,
+	lights_physical_pars_fragment: lights_physical_pars_fragment,
+	lights_fragment_begin: lights_fragment_begin,
+	lights_fragment_maps: lights_fragment_maps,
+	lights_fragment_end: lights_fragment_end,
+	lightprobes_pars_fragment: lightprobes_pars_fragment,
+	logdepthbuf_fragment: logdepthbuf_fragment,
+	logdepthbuf_pars_fragment: logdepthbuf_pars_fragment,
+	logdepthbuf_pars_vertex: logdepthbuf_pars_vertex,
+	logdepthbuf_vertex: logdepthbuf_vertex,
+	map_fragment: map_fragment,
+	map_pars_fragment: map_pars_fragment,
+	map_particle_fragment: map_particle_fragment,
+	map_particle_pars_fragment: map_particle_pars_fragment,
+	metalnessmap_fragment: metalnessmap_fragment,
+	metalnessmap_pars_fragment: metalnessmap_pars_fragment,
+	morphinstance_vertex: morphinstance_vertex,
+	morphcolor_vertex: morphcolor_vertex,
+	morphnormal_vertex: morphnormal_vertex,
+	morphtarget_pars_vertex: morphtarget_pars_vertex,
+	morphtarget_vertex: morphtarget_vertex,
+	normal_fragment_begin: normal_fragment_begin,
+	normal_fragment_maps: normal_fragment_maps,
+	normal_pars_fragment: normal_pars_fragment,
+	normal_pars_vertex: normal_pars_vertex,
+	normal_vertex: normal_vertex,
+	normalmap_pars_fragment: normalmap_pars_fragment,
+	clearcoat_normal_fragment_begin: clearcoat_normal_fragment_begin,
+	clearcoat_normal_fragment_maps: clearcoat_normal_fragment_maps,
+	clearcoat_pars_fragment: clearcoat_pars_fragment,
+	iridescence_pars_fragment: iridescence_pars_fragment,
+	opaque_fragment: opaque_fragment,
+	packing: packing,
+	premultiplied_alpha_fragment: premultiplied_alpha_fragment,
+	project_vertex: project_vertex,
+	dithering_fragment: dithering_fragment,
+	dithering_pars_fragment: dithering_pars_fragment,
+	roughnessmap_fragment: roughnessmap_fragment,
+	roughnessmap_pars_fragment: roughnessmap_pars_fragment,
+	shadowmap_pars_fragment: shadowmap_pars_fragment,
+	shadowmap_pars_vertex: shadowmap_pars_vertex,
+	shadowmap_vertex: shadowmap_vertex,
+	shadowmask_pars_fragment: shadowmask_pars_fragment,
+	skinbase_vertex: skinbase_vertex,
+	skinning_pars_vertex: skinning_pars_vertex,
+	skinning_vertex: skinning_vertex,
+	skinnormal_vertex: skinnormal_vertex,
+	specularmap_fragment: specularmap_fragment,
+	specularmap_pars_fragment: specularmap_pars_fragment,
+	tonemapping_fragment: tonemapping_fragment,
+	tonemapping_pars_fragment: tonemapping_pars_fragment,
+	transmission_fragment: transmission_fragment,
+	transmission_pars_fragment: transmission_pars_fragment,
+	uv_pars_fragment: uv_pars_fragment,
+	uv_pars_vertex: uv_pars_vertex,
+	uv_vertex: uv_vertex,
+	worldpos_vertex: worldpos_vertex,
+
+	background_vert: vertex$h,
+	background_frag: fragment$h,
+	backgroundCube_vert: vertex$g,
+	backgroundCube_frag: fragment$g,
+	cube_vert: vertex$f,
+	cube_frag: fragment$f,
+	depth_vert: vertex$e,
+	depth_frag: fragment$e,
+	distance_vert: vertex$d,
+	distance_frag: fragment$d,
+	equirect_vert: vertex$c,
+	equirect_frag: fragment$c,
+	linedashed_vert: vertex$b,
+	linedashed_frag: fragment$b,
+	meshbasic_vert: vertex$a,
+	meshbasic_frag: fragment$a,
+	meshlambert_vert: vertex$9,
+	meshlambert_frag: fragment$9,
+	meshmatcap_vert: vertex$8,
+	meshmatcap_frag: fragment$8,
+	meshnormal_vert: vertex$7,
+	meshnormal_frag: fragment$7,
+	meshphong_vert: vertex$6,
+	meshphong_frag: fragment$6,
+	meshphysical_vert: vertex$5,
+	meshphysical_frag: fragment$5,
+	meshtoon_vert: vertex$4,
+	meshtoon_frag: fragment$4,
+	points_vert: vertex$3,
+	points_frag: fragment$3,
+	shadow_vert: vertex$2,
+	shadow_frag: fragment$2,
+	sprite_vert: vertex$1,
+	sprite_frag: fragment$1
+};
+
+// Uniforms library for shared webgl shaders
+const UniformsLib = {
+
+	common: {
+
+		diffuse: { value: /*@__PURE__*/ new Color( 0xffffff ) },
+		opacity: { value: 1.0 },
+
+		map: { value: null },
+		mapTransform: { value: /*@__PURE__*/ new Matrix3() },
+
+		alphaMap: { value: null },
+		alphaMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+
+		alphaTest: { value: 0 }
+
+	},
+
+	specularmap: {
+
+		specularMap: { value: null },
+		specularMapTransform: { value: /*@__PURE__*/ new Matrix3() }
+
+	},
+
+	envmap: {
+
+		envMap: { value: null },
+		envMapRotation: { value: /*@__PURE__*/ new Matrix3() },
+		reflectivity: { value: 1.0 }, // basic, lambert, phong
+		ior: { value: 1.5 }, // physical
+		refractionRatio: { value: 0.98 }, // basic, lambert, phong
+		dfgLUT: { value: null } // DFG LUT for physically-based rendering
+
+	},
+
+	aomap: {
+
+		aoMap: { value: null },
+		aoMapIntensity: { value: 1 },
+		aoMapTransform: { value: /*@__PURE__*/ new Matrix3() }
+
+	},
+
+	lightmap: {
+
+		lightMap: { value: null },
+		lightMapIntensity: { value: 1 },
+		lightMapTransform: { value: /*@__PURE__*/ new Matrix3() }
+
+	},
+
+	bumpmap: {
+
+		bumpMap: { value: null },
+		bumpMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+		bumpScale: { value: 1 }
+
+	},
+
+	normalmap: {
+
+		normalMap: { value: null },
+		normalMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+		normalScale: { value: /*@__PURE__*/ new Vector2( 1, 1 ) }
+
+	},
+
+	displacementmap: {
+
+		displacementMap: { value: null },
+		displacementMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+		displacementScale: { value: 1 },
+		displacementBias: { value: 0 }
+
+	},
+
+	emissivemap: {
+
+		emissiveMap: { value: null },
+		emissiveMapTransform: { value: /*@__PURE__*/ new Matrix3() }
+
+	},
+
+	metalnessmap: {
+
+		metalnessMap: { value: null },
+		metalnessMapTransform: { value: /*@__PURE__*/ new Matrix3() }
+
+	},
+
+	roughnessmap: {
+
+		roughnessMap: { value: null },
+		roughnessMapTransform: { value: /*@__PURE__*/ new Matrix3() }
+
+	},
+
+	gradientmap: {
+
+		gradientMap: { value: null }
+
+	},
+
+	fog: {
+
+		fogDensity: { value: 0.00025 },
+		fogNear: { value: 1 },
+		fogFar: { value: 2000 },
+		fogColor: { value: /*@__PURE__*/ new Color( 0xffffff ) }
+
+	},
+
+	lights: {
+
+		ambientLightColor: { value: [] },
+
+		lightProbe: { value: [] },
+
+		sunLights: { value: [], properties: {
+			direction: {},
+			color: {}
+		} },
+
+		sunLightShadows: { value: [], properties: {
+			shadowIntensity: 1,
+			shadowBias: {},
+			shadowNormalBias: {},
+			shadowRadius: {},
+			shadowMapSize: {}
+		} },
+
+		sunShadowMatrix: { value: [] },
+		sunShadowCascade: { value: [] },
+
+		directionalLights: { value: [], properties: {
+			direction: {},
+			color: {}
+		} },
+
+		directionalLightShadows: { value: [], properties: {
+			shadowIntensity: 1,
+			shadowBias: {},
+			shadowNormalBias: {},
+			shadowRadius: {},
+			shadowMapSize: {}
+		} },
+
+		directionalShadowMatrix: { value: [] },
+
+		spotLights: { value: [], properties: {
+			color: {},
+			position: {},
+			direction: {},
+			distance: {},
+			coneCos: {},
+			penumbraCos: {},
+			decay: {}
+		} },
+
+		spotLightShadows: { value: [], properties: {
+			shadowIntensity: 1,
+			shadowBias: {},
+			shadowNormalBias: {},
+			shadowRadius: {},
+			shadowMapSize: {}
+		} },
+
+		spotLightMap: { value: [] },
+		spotLightMatrix: { value: [] },
+
+		pointLights: { value: [], properties: {
+			color: {},
+			position: {},
+			decay: {},
+			distance: {}
+		} },
+
+		pointLightShadows: { value: [], properties: {
+			shadowIntensity: 1,
+			shadowBias: {},
+			shadowNormalBias: {},
+			shadowRadius: {},
+			shadowMapSize: {},
+			shadowCameraNear: {},
+			shadowCameraFar: {}
+		} },
+
+		pointShadowMatrix: { value: [] },
+
+		hemisphereLights: { value: [], properties: {
+			direction: {},
+			skyColor: {},
+			groundColor: {}
+		} },
+
+		// TODO (abelnation): RectAreaLight BRDF data needs to be moved from example to main src
+		rectAreaLights: { value: [], properties: {
+			color: {},
+			position: {},
+			width: {},
+			height: {}
+		} },
+
+		ltc_1: { value: null },
+		ltc_2: { value: null },
+
+		probesSH: { value: null },
+		probesMin: { value: /*@__PURE__*/ new Vector3() },
+		probesMax: { value: /*@__PURE__*/ new Vector3() },
+		probesResolution: { value: /*@__PURE__*/ new Vector3() }
+
+	},
+
+	points: {
+
+		diffuse: { value: /*@__PURE__*/ new Color( 0xffffff ) },
+		opacity: { value: 1.0 },
+		size: { value: 1.0 },
+		scale: { value: 1.0 },
+		map: { value: null },
+		alphaMap: { value: null },
+		alphaMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+		alphaTest: { value: 0 },
+		uvTransform: { value: /*@__PURE__*/ new Matrix3() }
+
+	},
+
+	sprite: {
+
+		diffuse: { value: /*@__PURE__*/ new Color( 0xffffff ) },
+		opacity: { value: 1.0 },
+		center: { value: /*@__PURE__*/ new Vector2( 0.5, 0.5 ) },
+		rotation: { value: 0.0 },
+		map: { value: null },
+		mapTransform: { value: /*@__PURE__*/ new Matrix3() },
+		alphaMap: { value: null },
+		alphaMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+		alphaTest: { value: 0 }
+
+	}
+
+};
+
+const ShaderLib = {
+
+	basic: {
+
+		uniforms: /*@__PURE__*/ mergeUniforms( [
+			UniformsLib.common,
+			UniformsLib.specularmap,
+			UniformsLib.envmap,
+			UniformsLib.aomap,
+			UniformsLib.lightmap,
+			UniformsLib.fog
+		] ),
+
+		vertexShader: ShaderChunk.meshbasic_vert,
+		fragmentShader: ShaderChunk.meshbasic_frag
+
+	},
+
+	lambert: {
+
+		uniforms: /*@__PURE__*/ mergeUniforms( [
+			UniformsLib.common,
+			UniformsLib.specularmap,
+			UniformsLib.envmap,
+			UniformsLib.aomap,
+			UniformsLib.lightmap,
+			UniformsLib.emissivemap,
+			UniformsLib.bumpmap,
+			UniformsLib.normalmap,
+			UniformsLib.displacementmap,
+			UniformsLib.fog,
+			UniformsLib.lights,
+			{
+				emissive: { value: /*@__PURE__*/ new Color( 0x000000 ) },
+				envMapIntensity: { value: 1 }
+			}
+		] ),
+
+		vertexShader: ShaderChunk.meshlambert_vert,
+		fragmentShader: ShaderChunk.meshlambert_frag
+
+	},
+
+	phong: {
+
+		uniforms: /*@__PURE__*/ mergeUniforms( [
+			UniformsLib.common,
+			UniformsLib.specularmap,
+			UniformsLib.envmap,
+			UniformsLib.aomap,
+			UniformsLib.lightmap,
+			UniformsLib.emissivemap,
+			UniformsLib.bumpmap,
+			UniformsLib.normalmap,
+			UniformsLib.displacementmap,
+			UniformsLib.fog,
+			UniformsLib.lights,
+			{
+				emissive: { value: /*@__PURE__*/ new Color( 0x000000 ) },
+				specular: { value: /*@__PURE__*/ new Color( 0x111111 ) },
+				shininess: { value: 30 },
+				envMapIntensity: { value: 1 }
+			}
+		] ),
+
+		vertexShader: ShaderChunk.meshphong_vert,
+		fragmentShader: ShaderChunk.meshphong_frag
+
+	},
+
+	standard: {
+
+		uniforms: /*@__PURE__*/ mergeUniforms( [
+			UniformsLib.common,
+			UniformsLib.envmap,
+			UniformsLib.aomap,
+			UniformsLib.lightmap,
+			UniformsLib.emissivemap,
+			UniformsLib.bumpmap,
+			UniformsLib.normalmap,
+			UniformsLib.displacementmap,
+			UniformsLib.roughnessmap,
+			UniformsLib.metalnessmap,
+			UniformsLib.fog,
+			UniformsLib.lights,
+			{
+				emissive: { value: /*@__PURE__*/ new Color( 0x000000 ) },
+				roughness: { value: 1.0 },
+				metalness: { value: 0.0 },
+				envMapIntensity: { value: 1 }
+			}
+		] ),
+
+		vertexShader: ShaderChunk.meshphysical_vert,
+		fragmentShader: ShaderChunk.meshphysical_frag
+
+	},
+
+	toon: {
+
+		uniforms: /*@__PURE__*/ mergeUniforms( [
+			UniformsLib.common,
+			UniformsLib.aomap,
+			UniformsLib.lightmap,
+			UniformsLib.emissivemap,
+			UniformsLib.bumpmap,
+			UniformsLib.normalmap,
+			UniformsLib.displacementmap,
+			UniformsLib.gradientmap,
+			UniformsLib.fog,
+			UniformsLib.lights,
+			{
+				emissive: { value: /*@__PURE__*/ new Color( 0x000000 ) }
+			}
+		] ),
+
+		vertexShader: ShaderChunk.meshtoon_vert,
+		fragmentShader: ShaderChunk.meshtoon_frag
+
+	},
+
+	matcap: {
+
+		uniforms: /*@__PURE__*/ mergeUniforms( [
+			UniformsLib.common,
+			UniformsLib.bumpmap,
+			UniformsLib.normalmap,
+			UniformsLib.displacementmap,
+			UniformsLib.fog,
+			{
+				matcap: { value: null }
+			}
+		] ),
+
+		vertexShader: ShaderChunk.meshmatcap_vert,
+		fragmentShader: ShaderChunk.meshmatcap_frag
+
+	},
+
+	points: {
+
+		uniforms: /*@__PURE__*/ mergeUniforms( [
+			UniformsLib.points,
+			UniformsLib.fog
+		] ),
+
+		vertexShader: ShaderChunk.points_vert,
+		fragmentShader: ShaderChunk.points_frag
+
+	},
+
+	dashed: {
+
+		uniforms: /*@__PURE__*/ mergeUniforms( [
+			UniformsLib.common,
+			UniformsLib.fog,
+			{
+				scale: { value: 1 },
+				dashSize: { value: 1 },
+				totalSize: { value: 2 }
+			}
+		] ),
+
+		vertexShader: ShaderChunk.linedashed_vert,
+		fragmentShader: ShaderChunk.linedashed_frag
+
+	},
+
+	depth: {
+
+		uniforms: /*@__PURE__*/ mergeUniforms( [
+			UniformsLib.common,
+			UniformsLib.displacementmap
+		] ),
+
+		vertexShader: ShaderChunk.depth_vert,
+		fragmentShader: ShaderChunk.depth_frag
+
+	},
+
+	normal: {
+
+		uniforms: /*@__PURE__*/ mergeUniforms( [
+			UniformsLib.common,
+			UniformsLib.bumpmap,
+			UniformsLib.normalmap,
+			UniformsLib.displacementmap,
+			{
+				opacity: { value: 1.0 }
+			}
+		] ),
+
+		vertexShader: ShaderChunk.meshnormal_vert,
+		fragmentShader: ShaderChunk.meshnormal_frag
+
+	},
+
+	sprite: {
+
+		uniforms: /*@__PURE__*/ mergeUniforms( [
+			UniformsLib.sprite,
+			UniformsLib.fog
+		] ),
+
+		vertexShader: ShaderChunk.sprite_vert,
+		fragmentShader: ShaderChunk.sprite_frag
+
+	},
+
+	background: {
+
+		uniforms: {
+			uvTransform: { value: /*@__PURE__*/ new Matrix3() },
+			t2D: { value: null },
+			backgroundIntensity: { value: 1 }
+		},
+
+		vertexShader: ShaderChunk.background_vert,
+		fragmentShader: ShaderChunk.background_frag
+
+	},
+
+	backgroundCube: {
+
+		uniforms: {
+			envMap: { value: null },
+			backgroundBlurriness: { value: 0 },
+			backgroundIntensity: { value: 1 },
+			backgroundRotation: { value: /*@__PURE__*/ new Matrix3() }
+		},
+
+		vertexShader: ShaderChunk.backgroundCube_vert,
+		fragmentShader: ShaderChunk.backgroundCube_frag
+
+	},
+
+	cube: {
+
+		uniforms: {
+			tCube: { value: null },
+			tFlip: { value: -1 },
+			opacity: { value: 1.0 }
+		},
+
+		vertexShader: ShaderChunk.cube_vert,
+		fragmentShader: ShaderChunk.cube_frag
+
+	},
+
+	equirect: {
+
+		uniforms: {
+			tEquirect: { value: null },
+		},
+
+		vertexShader: ShaderChunk.equirect_vert,
+		fragmentShader: ShaderChunk.equirect_frag
+
+	},
+
+	distance: {
+
+		uniforms: /*@__PURE__*/ mergeUniforms( [
+			UniformsLib.common,
+			UniformsLib.displacementmap,
+			{
+				referencePosition: { value: /*@__PURE__*/ new Vector3() },
+				nearDistance: { value: 1 },
+				farDistance: { value: 1000 }
+			}
+		] ),
+
+		vertexShader: ShaderChunk.distance_vert,
+		fragmentShader: ShaderChunk.distance_frag
+
+	},
+
+	shadow: {
+
+		uniforms: /*@__PURE__*/ mergeUniforms( [
+			UniformsLib.lights,
+			UniformsLib.fog,
+			{
+				color: { value: /*@__PURE__*/ new Color( 0x00000 ) },
+				opacity: { value: 1.0 }
+			},
+		] ),
+
+		vertexShader: ShaderChunk.shadow_vert,
+		fragmentShader: ShaderChunk.shadow_frag
+
+	}
+
+};
+
+ShaderLib.physical = {
+
+	uniforms: /*@__PURE__*/ mergeUniforms( [
+		ShaderLib.standard.uniforms,
+		{
+			clearcoat: { value: 0 },
+			clearcoatMap: { value: null },
+			clearcoatMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+			clearcoatNormalMap: { value: null },
+			clearcoatNormalMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+			clearcoatNormalScale: { value: /*@__PURE__*/ new Vector2( 1, 1 ) },
+			clearcoatRoughness: { value: 0 },
+			clearcoatRoughnessMap: { value: null },
+			clearcoatRoughnessMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+			dispersion: { value: 0 },
+			retroreflectivity: { value: 0 },
+			iridescence: { value: 0 },
+			iridescenceMap: { value: null },
+			iridescenceMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+			iridescenceIOR: { value: 1.3 },
+			iridescenceThicknessMinimum: { value: 100 },
+			iridescenceThicknessMaximum: { value: 400 },
+			iridescenceThicknessMap: { value: null },
+			iridescenceThicknessMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+			sheen: { value: 0 },
+			sheenColor: { value: /*@__PURE__*/ new Color( 0x000000 ) },
+			sheenColorMap: { value: null },
+			sheenColorMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+			sheenRoughness: { value: 1 },
+			sheenRoughnessMap: { value: null },
+			sheenRoughnessMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+			transmission: { value: 0 },
+			transmissionMap: { value: null },
+			transmissionMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+			transmissionSamplerSize: { value: /*@__PURE__*/ new Vector2() },
+			transmissionSamplerMap: { value: null },
+			thickness: { value: 0 },
+			thicknessMap: { value: null },
+			thicknessMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+			attenuationDistance: { value: 0 },
+			attenuationColor: { value: /*@__PURE__*/ new Color( 0x000000 ) },
+			specularColor: { value: /*@__PURE__*/ new Color( 1, 1, 1 ) },
+			specularColorMap: { value: null },
+			specularColorMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+			specularIntensity: { value: 1 },
+			specularIntensityMap: { value: null },
+			specularIntensityMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+			anisotropyVector: { value: /*@__PURE__*/ new Vector2() },
+			anisotropyMap: { value: null },
+			anisotropyMapTransform: { value: /*@__PURE__*/ new Matrix3() },
+		}
+	] ),
+
+	vertexShader: ShaderChunk.meshphysical_vert,
+	fragmentShader: ShaderChunk.meshphysical_frag
+
+};
+
+const _rgb = { r: 0, b: 0, g: 0 };
+const _m1$1 = /*@__PURE__*/ new Matrix4();
+const _m$1 = /*@__PURE__*/ new Matrix3();
+
+_m$1.set( -1, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 1.0 );
+
+function WebGLBackground( renderer, environments, state, objects, alpha, premultipliedAlpha ) {
+
+	const clearColor = new Color( 0x000000 );
+	let clearAlpha = alpha === true ? 0 : 1;
+
+	let planeMesh;
+	let boxMesh;
+
+	let currentBackground = null;
+	let currentBackgroundVersion = 0;
+	let currentTonemapping = null;
+
+	function getBackground( scene ) {
+
+		let background = scene.isScene === true ? scene.background : null;
+
+		if ( background && background.isTexture ) {
+
+			const usePMREM = scene.backgroundBlurriness > 0; // use PMREM if the user wants to blur the background
+			background = environments.get( background, usePMREM );
+
+		}
+
+		return background;
+
+	}
+
+	function render( scene ) {
+
+		let forceClear = false;
+		const background = getBackground( scene );
+
+		if ( background === null ) {
+
+			setClear( clearColor, clearAlpha );
+
+		} else if ( background && background.isColor ) {
+
+			setClear( background, 1 );
+			forceClear = true;
+
+		}
+
+		const environmentBlendMode = renderer.xr.getEnvironmentBlendMode();
+
+		if ( environmentBlendMode === 'additive' ) {
+
+			state.buffers.color.setClear( 0, 0, 0, 1, premultipliedAlpha );
+
+		} else if ( environmentBlendMode === 'alpha-blend' ) {
+
+			state.buffers.color.setClear( 0, 0, 0, 0, premultipliedAlpha );
+
+		}
+
+		if ( renderer.autoClear || forceClear ) {
+
+			// buffers might not be writable which is required to ensure a correct clear
+
+			state.buffers.depth.setTest( true );
+			state.buffers.depth.setMask( true );
+			state.buffers.color.setMask( true );
+
+			renderer.clear( renderer.autoClearColor, renderer.autoClearDepth, renderer.autoClearStencil );
+
+		}
+
+	}
+
+	function addToRenderList( renderList, scene ) {
+
+		const background = getBackground( scene );
+
+		if ( background && ( background.isCubeTexture || background.mapping === CubeUVReflectionMapping ) ) {
+
+			if ( boxMesh === undefined ) {
+
+				boxMesh = new Mesh(
+					new BoxGeometry( 1, 1, 1 ),
+					new ShaderMaterial( {
+						name: 'BackgroundCubeMaterial',
+						uniforms: cloneUniforms( ShaderLib.backgroundCube.uniforms ),
+						vertexShader: ShaderLib.backgroundCube.vertexShader,
+						fragmentShader: ShaderLib.backgroundCube.fragmentShader,
+						side: BackSide,
+						depthTest: false,
+						depthWrite: false,
+						fog: false,
+						allowOverride: false
+					} )
+				);
+
+				boxMesh.geometry.deleteAttribute( 'normal' );
+				boxMesh.geometry.deleteAttribute( 'uv' );
+
+				boxMesh.onBeforeRender = function ( renderer, scene, camera ) {
+
+					this.matrixWorld.copyPosition( camera.matrixWorld );
+
+				};
+
+				// add "envMap" material property so the renderer can evaluate it like for built-in materials
+				Object.defineProperty( boxMesh.material, 'envMap', {
+
+					get: function () {
+
+						return this.uniforms.envMap.value;
+
+					}
+
+				} );
+
+				objects.update( boxMesh );
+
+			}
+
+
+			boxMesh.material.uniforms.envMap.value = background;
+			boxMesh.material.uniforms.backgroundBlurriness.value = scene.backgroundBlurriness;
+			boxMesh.material.uniforms.backgroundIntensity.value = scene.backgroundIntensity;
+
+
+			// note: since the matrix is orthonormal, we can use the more-efficient transpose() in lieu of invert()
+			boxMesh.material.uniforms.backgroundRotation.value.setFromMatrix4( _m1$1.makeRotationFromEuler( scene.backgroundRotation ) ).transpose();
+
+			if ( background.isCubeTexture && background.isRenderTargetTexture === false ) {
+
+				boxMesh.material.uniforms.backgroundRotation.value.premultiply( _m$1 );
+
+			}
+
+
+			boxMesh.material.toneMapped = ColorManagement.getTransfer( background.colorSpace ) !== SRGBTransfer;
+
+			if ( currentBackground !== background ||
+				currentBackgroundVersion !== background.version ||
+				currentTonemapping !== renderer.toneMapping ) {
+
+				boxMesh.material.needsUpdate = true;
+
+				currentBackground = background;
+				currentBackgroundVersion = background.version;
+				currentTonemapping = renderer.toneMapping;
+
+			}
+
+			boxMesh.layers.enableAll();
+
+			// push to the pre-sorted opaque render list
+			renderList.unshift( boxMesh, boxMesh.geometry, boxMesh.material, 0, 0, null );
+
+		} else if ( background && background.isTexture ) {
+
+			if ( planeMesh === undefined ) {
+
+				planeMesh = new Mesh(
+					new PlaneGeometry( 2, 2 ),
+					new ShaderMaterial( {
+						name: 'BackgroundMaterial',
+						uniforms: cloneUniforms( ShaderLib.background.uniforms ),
+						vertexShader: ShaderLib.background.vertexShader,
+						fragmentShader: ShaderLib.background.fragmentShader,
+						side: FrontSide,
+						depthTest: false,
+						depthWrite: false,
+						fog: false,
+						allowOverride: false
+					} )
+				);
+
+				planeMesh.geometry.deleteAttribute( 'normal' );
+
+				// add "map" material property so the renderer can evaluate it like for built-in materials
+				Object.defineProperty( planeMesh.material, 'map', {
+
+					get: function () {
+
+						return this.uniforms.t2D.value;
+
+					}
+
+				} );
+
+				objects.update( planeMesh );
+
+			}
+
+			planeMesh.material.uniforms.t2D.value = background;
+			planeMesh.material.uniforms.backgroundIntensity.value = scene.backgroundIntensity;
+			planeMesh.material.toneMapped = ColorManagement.getTransfer( background.colorSpace ) !== SRGBTransfer;
+
+			if ( background.matrixAutoUpdate === true ) {
+
+				background.updateMatrix();
+
+			}
+
+			planeMesh.material.uniforms.uvTransform.value.copy( background.matrix );
+
+			if ( currentBackground !== background ||
+				currentBackgroundVersion !== background.version ||
+				currentTonemapping !== renderer.toneMapping ) {
+
+				planeMesh.material.needsUpdate = true;
+
+				currentBackground = background;
+				currentBackgroundVersion = background.version;
+				currentTonemapping = renderer.toneMapping;
+
+			}
+
+			planeMesh.layers.enableAll();
+
+			// push to the pre-sorted opaque render list
+			renderList.unshift( planeMesh, planeMesh.geometry, planeMesh.material, 0, 0, null );
+
+		}
+
+	}
+
+	function setClear( color, alpha ) {
+
+		color.getRGB( _rgb, getUnlitUniformColorSpace( renderer ) );
+
+		state.buffers.color.setClear( _rgb.r, _rgb.g, _rgb.b, alpha, premultipliedAlpha );
+
+	}
+
+	function dispose() {
+
+		if ( boxMesh !== undefined ) {
+
+			boxMesh.geometry.dispose();
+			boxMesh.material.dispose();
+
+			boxMesh = undefined;
+
+		}
+
+		if ( planeMesh !== undefined ) {
+
+			planeMesh.geometry.dispose();
+			planeMesh.material.dispose();
+
+			planeMesh = undefined;
+
+		}
+
+	}
+
+	return {
+
+		getClearColor: function () {
+
+			return clearColor;
+
+		},
+		setClearColor: function ( color, alpha = 1 ) {
+
+			clearColor.set( color );
+			clearAlpha = alpha;
+			setClear( clearColor, clearAlpha );
+
+		},
+		getClearAlpha: function () {
+
+			return clearAlpha;
+
+		},
+		setClearAlpha: function ( alpha ) {
+
+			clearAlpha = alpha;
+			setClear( clearColor, clearAlpha );
+
+		},
+		render: render,
+		addToRenderList: addToRenderList,
+		dispose: dispose
+
+	};
+
+}
+
+function WebGLBindingStates( gl, attributes ) {
+
+	const maxVertexAttributes = gl.getParameter( gl.MAX_VERTEX_ATTRIBS );
+
+	const bindingStates = {};
+
+	const defaultState = createBindingState( null );
+	let currentState = defaultState;
+	let forceUpdate = false;
+
+	function setup( object, material, program, geometry, index ) {
+
+		let updateBuffers = false;
+
+		const state = getBindingState( object, geometry, program, material );
+
+		if ( currentState !== state ) {
+
+			currentState = state;
+			bindVertexArrayObject( currentState.object );
+
+		}
+
+		updateBuffers = needsUpdate( object, geometry, program, index );
+
+		if ( updateBuffers ) saveCache( object, geometry, program, index );
+
+		if ( index !== null ) {
+
+			attributes.update( index, gl.ELEMENT_ARRAY_BUFFER );
+
+		}
+
+		if ( updateBuffers || forceUpdate ) {
+
+			forceUpdate = false;
+
+			setupVertexAttributes( object, material, program, geometry );
+
+			if ( index !== null ) {
+
+				gl.bindBuffer( gl.ELEMENT_ARRAY_BUFFER, attributes.get( index ).buffer );
+
+			}
+
+		}
+
+	}
+
+	function createVertexArrayObject() {
+
+		return gl.createVertexArray();
+
+	}
+
+	function bindVertexArrayObject( vao ) {
+
+		return gl.bindVertexArray( vao );
+
+	}
+
+	function deleteVertexArrayObject( vao ) {
+
+		return gl.deleteVertexArray( vao );
+
+	}
+
+	function getBindingState( object, geometry, program, material ) {
+
+		const wireframe = ( material.wireframe === true );
+
+		let objectMap = bindingStates[ geometry.id ];
+
+		if ( objectMap === undefined ) {
+
+			objectMap = {};
+			bindingStates[ geometry.id ] = objectMap;
+
+		}
+
+		// Each InstancedMesh requires unique binding states because it contains instanced attributes.
+		const objectId = ( object.isInstancedMesh === true ) ? object.id : 0;
+
+		let programMap = objectMap[ objectId ];
+
+		if ( programMap === undefined ) {
+
+			programMap = {};
+			objectMap[ objectId ] = programMap;
+
+		}
+
+		let stateMap = programMap[ program.id ];
+
+		if ( stateMap === undefined ) {
+
+			stateMap = {};
+			programMap[ program.id ] = stateMap;
+
+		}
+
+		let state = stateMap[ wireframe ];
+
+		if ( state === undefined ) {
+
+			state = createBindingState( createVertexArrayObject() );
+			stateMap[ wireframe ] = state;
+
+		}
+
+		return state;
+
+	}
+
+	function createBindingState( vao ) {
+
+		const newAttributes = [];
+		const enabledAttributes = [];
+		const attributeDivisors = [];
+
+		for ( let i = 0; i < maxVertexAttributes; i ++ ) {
+
+			newAttributes[ i ] = 0;
+			enabledAttributes[ i ] = 0;
+			attributeDivisors[ i ] = 0;
+
+		}
+
+		return {
+
+			// for backward compatibility on non-VAO support browser
+			geometry: null,
+			program: null,
+			wireframe: false,
+
+			newAttributes: newAttributes,
+			enabledAttributes: enabledAttributes,
+			attributeDivisors: attributeDivisors,
+			object: vao,
+			attributes: {},
+			index: null
+
+		};
+
+	}
+
+	function needsUpdate( object, geometry, program, index ) {
+
+		const cachedAttributes = currentState.attributes;
+		const geometryAttributes = geometry.attributes;
+
+		let attributesNum = 0;
+
+		const programAttributes = program.getAttributes();
+
+		for ( const name in programAttributes ) {
+
+			const programAttribute = programAttributes[ name ];
+
+			if ( programAttribute.location >= 0 ) {
+
+				const cachedAttribute = cachedAttributes[ name ];
+				let geometryAttribute = geometryAttributes[ name ];
+
+				if ( geometryAttribute === undefined ) {
+
+					if ( name === 'instanceMatrix' && object.instanceMatrix ) geometryAttribute = object.instanceMatrix;
+					if ( name === 'instanceColor' && object.instanceColor ) geometryAttribute = object.instanceColor;
+
+				}
+
+				if ( cachedAttribute === undefined ) return true;
+
+				if ( cachedAttribute.attribute !== geometryAttribute ) return true;
+
+				if ( geometryAttribute && cachedAttribute.data !== geometryAttribute.data ) return true;
+
+				attributesNum ++;
+
+			}
+
+		}
+
+		if ( currentState.attributesNum !== attributesNum ) return true;
+
+		if ( currentState.index !== index ) return true;
+
+		return false;
+
+	}
+
+	function saveCache( object, geometry, program, index ) {
+
+		const cache = {};
+		const attributes = geometry.attributes;
+		let attributesNum = 0;
+
+		const programAttributes = program.getAttributes();
+
+		for ( const name in programAttributes ) {
+
+			const programAttribute = programAttributes[ name ];
+
+			if ( programAttribute.location >= 0 ) {
+
+				let attribute = attributes[ name ];
+
+				if ( attribute === undefined ) {
+
+					if ( name === 'instanceMatrix' && object.instanceMatrix ) attribute = object.instanceMatrix;
+					if ( name === 'instanceColor' && object.instanceColor ) attribute = object.instanceColor;
+
+				}
+
+				const data = {};
+				data.attribute = attribute;
+
+				if ( attribute && attribute.data ) {
+
+					data.data = attribute.data;
+
+				}
+
+				cache[ name ] = data;
+
+				attributesNum ++;
+
+			}
+
+		}
+
+		currentState.attributes = cache;
+		currentState.attributesNum = attributesNum;
+
+		currentState.index = index;
+
+	}
+
+	function initAttributes() {
+
+		const newAttributes = currentState.newAttributes;
+
+		for ( let i = 0, il = newAttributes.length; i < il; i ++ ) {
+
+			newAttributes[ i ] = 0;
+
+		}
+
+	}
+
+	function enableAttribute( attribute ) {
+
+		enableAttributeAndDivisor( attribute, 0 );
+
+	}
+
+	function enableAttributeAndDivisor( attribute, meshPerAttribute ) {
+
+		const newAttributes = currentState.newAttributes;
+		const enabledAttributes = currentState.enabledAttributes;
+		const attributeDivisors = currentState.attributeDivisors;
+
+		newAttributes[ attribute ] = 1;
+
+		if ( enabledAttributes[ attribute ] === 0 ) {
+
+			gl.enableVertexAttribArray( attribute );
+			enabledAttributes[ attribute ] = 1;
+
+		}
+
+		if ( attributeDivisors[ attribute ] !== meshPerAttribute ) {
+
+			gl.vertexAttribDivisor( attribute, meshPerAttribute );
+			attributeDivisors[ attribute ] = meshPerAttribute;
+
+		}
+
+	}
+
+	function disableUnusedAttributes() {
+
+		const newAttributes = currentState.newAttributes;
+		const enabledAttributes = currentState.enabledAttributes;
+
+		for ( let i = 0, il = enabledAttributes.length; i < il; i ++ ) {
+
+			if ( enabledAttributes[ i ] !== newAttributes[ i ] ) {
+
+				gl.disableVertexAttribArray( i );
+				enabledAttributes[ i ] = 0;
+
+			}
+
+		}
+
+	}
+
+	function vertexAttribPointer( index, size, type, normalized, stride, offset, integer ) {
+
+		if ( integer === true ) {
+
+			gl.vertexAttribIPointer( index, size, type, stride, offset );
+
+		} else {
+
+			gl.vertexAttribPointer( index, size, type, normalized, stride, offset );
+
+		}
+
+	}
+
+	function setupVertexAttributes( object, material, program, geometry ) {
+
+		initAttributes();
+
+		const geometryAttributes = geometry.attributes;
+
+		const programAttributes = program.getAttributes();
+
+		const materialDefaultAttributeValues = material.defaultAttributeValues;
+
+		for ( const name in programAttributes ) {
+
+			const programAttribute = programAttributes[ name ];
+
+			if ( programAttribute.location >= 0 ) {
+
+				let geometryAttribute = geometryAttributes[ name ];
+
+				if ( geometryAttribute === undefined ) {
+
+					if ( name === 'instanceMatrix' && object.instanceMatrix ) geometryAttribute = object.instanceMatrix;
+					if ( name === 'instanceColor' && object.instanceColor ) geometryAttribute = object.instanceColor;
+
+				}
+
+				if ( geometryAttribute !== undefined ) {
+
+					const normalized = geometryAttribute.normalized;
+					const size = geometryAttribute.itemSize;
+
+					const attribute = attributes.get( geometryAttribute );
+
+					// TODO Attribute may not be available on context restore
+
+					if ( attribute === undefined ) continue;
+
+					const buffer = attribute.buffer;
+					const type = attribute.type;
+					const bytesPerElement = attribute.bytesPerElement;
+
+					// check for integer attributes
+
+					const integer = ( type === gl.INT || type === gl.UNSIGNED_INT || geometryAttribute.gpuType === IntType );
+
+					if ( geometryAttribute.isInterleavedBufferAttribute ) {
+
+						const data = geometryAttribute.data;
+						const stride = data.stride;
+						const offset = geometryAttribute.offset;
+
+						if ( data.isInstancedInterleavedBuffer ) {
+
+							for ( let i = 0; i < programAttribute.locationSize; i ++ ) {
+
+								enableAttributeAndDivisor( programAttribute.location + i, data.meshPerAttribute );
+
+							}
+
+							if ( object.isInstancedMesh !== true && geometry._maxInstanceCount === undefined ) {
+
+								geometry._maxInstanceCount = data.meshPerAttribute * data.count;
+
+							}
+
+						} else {
+
+							for ( let i = 0; i < programAttribute.locationSize; i ++ ) {
+
+								enableAttribute( programAttribute.location + i );
+
+							}
+
+						}
+
+						gl.bindBuffer( gl.ARRAY_BUFFER, buffer );
+
+						for ( let i = 0; i < programAttribute.locationSize; i ++ ) {
+
+							vertexAttribPointer(
+								programAttribute.location + i,
+								size / programAttribute.locationSize,
+								type,
+								normalized,
+								stride * bytesPerElement,
+								( offset + ( size / programAttribute.locationSize ) * i ) * bytesPerElement,
+								integer
+							);
+
+						}
+
+					} else {
+
+						if ( geometryAttribute.isInstancedBufferAttribute ) {
+
+							for ( let i = 0; i < programAttribute.locationSize; i ++ ) {
+
+								enableAttributeAndDivisor( programAttribute.location + i, geometryAttribute.meshPerAttribute );
+
+							}
+
+							if ( object.isInstancedMesh !== true && geometry._maxInstanceCount === undefined ) {
+
+								geometry._maxInstanceCount = geometryAttribute.meshPerAttribute * geometryAttribute.count;
+
+							}
+
+						} else {
+
+							for ( let i = 0; i < programAttribute.locationSize; i ++ ) {
+
+								enableAttribute( programAttribute.location + i );
+
+							}
+
+						}
+
+						gl.bindBuffer( gl.ARRAY_BUFFER, buffer );
+
+						for ( let i = 0; i < programAttribute.locationSize; i ++ ) {
+
+							vertexAttribPointer(
+								programAttribute.location + i,
+								size / programAttribute.locationSize,
+								type,
+								normalized,
+								size * bytesPerElement,
+								( size / programAttribute.locationSize ) * i * bytesPerElement,
+								integer
+							);
+
+						}
+
+					}
+
+				} else if ( materialDefaultAttributeValues !== undefined ) {
+
+					const value = materialDefaultAttributeValues[ name ];
+
+					if ( value !== undefined ) {
+
+						switch ( value.length ) {
+
+							case 2:
+								gl.vertexAttrib2fv( programAttribute.location, value );
+								break;
+
+							case 3:
+								gl.vertexAttrib3fv( programAttribute.location, value );
+								break;
+
+							case 4:
+								gl.vertexAttrib4fv( programAttribute.location, value );
+								break;
+
+							default:
+								gl.vertexAttrib1fv( programAttribute.location, value );
+
+						}
+
+					}
+
+				}
+
+			}
+
+		}
+
+		disableUnusedAttributes();
+
+	}
+
+	function dispose() {
+
+		reset();
+
+		for ( const geometryId in bindingStates ) {
+
+			const objectMap = bindingStates[ geometryId ];
+
+			for ( const objectId in objectMap ) {
+
+				const programMap = objectMap[ objectId ];
+
+				for ( const programId in programMap ) {
+
+					const stateMap = programMap[ programId ];
+
+					for ( const wireframe in stateMap ) {
+
+						deleteVertexArrayObject( stateMap[ wireframe ].object );
+
+						delete stateMap[ wireframe ];
+
+					}
+
+					delete programMap[ programId ];
+
+				}
+
+			}
+
+			delete bindingStates[ geometryId ];
+
+		}
+
+	}
+
+	function releaseStatesOfGeometry( geometry ) {
+
+		if ( bindingStates[ geometry.id ] === undefined ) return;
+
+		const objectMap = bindingStates[ geometry.id ];
+
+		for ( const objectId in objectMap ) {
+
+			const programMap = objectMap[ objectId ];
+
+			for ( const programId in programMap ) {
+
+				const stateMap = programMap[ programId ];
+
+				for ( const wireframe in stateMap ) {
+
+					deleteVertexArrayObject( stateMap[ wireframe ].object );
+
+					delete stateMap[ wireframe ];
+
+				}
+
+				delete programMap[ programId ];
+
+			}
+
+		}
+
+		delete bindingStates[ geometry.id ];
+
+	}
+
+	function releaseStatesOfProgram( program ) {
+
+		for ( const geometryId in bindingStates ) {
+
+			const objectMap = bindingStates[ geometryId ];
+
+			for ( const objectId in objectMap ) {
+
+				const programMap = objectMap[ objectId ];
+
+				if ( programMap[ program.id ] === undefined ) continue;
+
+				const stateMap = programMap[ program.id ];
+
+				for ( const wireframe in stateMap ) {
+
+					deleteVertexArrayObject( stateMap[ wireframe ].object );
+
+					delete stateMap[ wireframe ];
+
+				}
+
+				delete programMap[ program.id ];
+
+			}
+
+		}
+
+	}
+
+	function releaseStatesOfObject( object ) {
+
+		for ( const geometryId in bindingStates ) {
+
+			const objectMap = bindingStates[ geometryId ];
+
+			const objectId = ( object.isInstancedMesh === true ) ? object.id : 0;
+
+			const programMap = objectMap[ objectId ];
+
+			if ( programMap === undefined ) continue;
+
+			for ( const programId in programMap ) {
+
+				const stateMap = programMap[ programId ];
+
+				for ( const wireframe in stateMap ) {
+
+					deleteVertexArrayObject( stateMap[ wireframe ].object );
+
+					delete stateMap[ wireframe ];
+
+				}
+
+				delete programMap[ programId ];
+
+			}
+
+			delete objectMap[ objectId ];
+
+			if ( Object.keys( objectMap ).length === 0 ) {
+
+				delete bindingStates[ geometryId ];
+
+			}
+
+		}
+
+	}
+
+
+	function reset() {
+
+		resetDefaultState();
+		forceUpdate = true;
+
+		if ( currentState === defaultState ) return;
+
+		currentState = defaultState;
+		bindVertexArrayObject( currentState.object );
+
+	}
+
+	// for backward-compatibility
+
+	function resetDefaultState() {
+
+		defaultState.geometry = null;
+		defaultState.program = null;
+		defaultState.wireframe = false;
+
+	}
+
+	return {
+
+		setup: setup,
+		reset: reset,
+		resetDefaultState: resetDefaultState,
+		dispose: dispose,
+		releaseStatesOfGeometry: releaseStatesOfGeometry,
+		releaseStatesOfObject: releaseStatesOfObject,
+		releaseStatesOfProgram: releaseStatesOfProgram,
+
+		initAttributes: initAttributes,
+		enableAttribute: enableAttribute,
+		disableUnusedAttributes: disableUnusedAttributes
+
+	};
+
+}
+
+function WebGLBufferRenderer( gl, extensions, info ) {
+
+	let mode;
+
+	function setMode( value ) {
+
+		mode = value;
+
+	}
+
+	function render( start, count ) {
+
+		gl.drawArrays( mode, start, count );
+
+		info.update( count, mode, 1 );
+
+	}
+
+	function renderInstances( start, count, primcount ) {
+
+		if ( primcount === 0 ) return;
+
+		gl.drawArraysInstanced( mode, start, count, primcount );
+
+		info.update( count, mode, primcount );
+
+	}
+
+	function renderMultiDraw( starts, counts, drawCount ) {
+
+		if ( drawCount === 0 ) return;
+
+		const extension = extensions.get( 'WEBGL_multi_draw' );
+		extension.multiDrawArraysWEBGL( mode, starts, 0, counts, 0, drawCount );
+
+		let elementCount = 0;
+		for ( let i = 0; i < drawCount; i ++ ) {
+
+			elementCount += counts[ i ];
+
+		}
+
+		info.update( elementCount, mode, 1 );
+
+	}
+
+	//
+
+	this.setMode = setMode;
+	this.render = render;
+	this.renderInstances = renderInstances;
+	this.renderMultiDraw = renderMultiDraw;
+
+}
+
+function WebGLCapabilities( gl, extensions, parameters, utils ) {
+
+	let maxAnisotropy;
+
+	function getMaxAnisotropy() {
+
+		if ( maxAnisotropy !== undefined ) return maxAnisotropy;
+
+		if ( extensions.has( 'EXT_texture_filter_anisotropic' ) === true ) {
+
+			const extension = extensions.get( 'EXT_texture_filter_anisotropic' );
+
+			maxAnisotropy = gl.getParameter( extension.MAX_TEXTURE_MAX_ANISOTROPY_EXT );
+
+		} else {
+
+			maxAnisotropy = 0;
+
+		}
+
+		return maxAnisotropy;
+
+	}
+
+	function textureFormatReadable( textureFormat ) {
+
+		if ( textureFormat !== RGBAFormat && utils.convert( textureFormat ) !== gl.getParameter( gl.IMPLEMENTATION_COLOR_READ_FORMAT ) ) {
+
+			return false;
+
+		}
+
+		return true;
+
+	}
+
+	function textureTypeReadable( textureType ) {
+
+		const halfFloatSupportedByExt = ( textureType === HalfFloatType ) && ( extensions.has( 'EXT_color_buffer_half_float' ) || extensions.has( 'EXT_color_buffer_float' ) );
+
+		if ( textureType !== UnsignedByteType && textureType !== FloatType && ! halfFloatSupportedByExt &&
+			utils.convert( textureType ) !== gl.getParameter( gl.IMPLEMENTATION_COLOR_READ_TYPE ) ) { // Edge and Chrome Mac < 52 (#9513)
+
+			return false;
+
+		}
+
+		return true;
+
+	}
+
+	function getMaxPrecision( precision ) {
+
+		if ( precision === 'highp' ) {
+
+			if ( gl.getShaderPrecisionFormat( gl.VERTEX_SHADER, gl.HIGH_FLOAT ).precision > 0 &&
+				gl.getShaderPrecisionFormat( gl.FRAGMENT_SHADER, gl.HIGH_FLOAT ).precision > 0 ) {
+
+				return 'highp';
+
+			}
+
+			precision = 'mediump';
+
+		}
+
+		if ( precision === 'mediump' ) {
+
+			if ( gl.getShaderPrecisionFormat( gl.VERTEX_SHADER, gl.MEDIUM_FLOAT ).precision > 0 &&
+				gl.getShaderPrecisionFormat( gl.FRAGMENT_SHADER, gl.MEDIUM_FLOAT ).precision > 0 ) {
+
+				return 'mediump';
+
+			}
+
+		}
+
+		return 'lowp';
+
+	}
+
+	let precision = parameters.precision !== undefined ? parameters.precision : 'highp';
+	const maxPrecision = getMaxPrecision( precision );
+
+	if ( maxPrecision !== precision ) {
+
+		warn( 'WebGLRenderer:', precision, 'not supported, using', maxPrecision, 'instead.' );
+		precision = maxPrecision;
+
+	}
+
+	const logarithmicDepthBuffer = parameters.logarithmicDepthBuffer === true;
+	const reversedDepthBuffer = parameters.reversedDepthBuffer === true && extensions.has( 'EXT_clip_control' );
+
+	if ( parameters.reversedDepthBuffer === true && reversedDepthBuffer === false ) {
+
+		warn( 'WebGLRenderer: Unable to use reversed depth buffer due to missing EXT_clip_control extension. Fallback to default depth buffer.' );
+
+	}
+
+	const maxTextures = gl.getParameter( gl.MAX_TEXTURE_IMAGE_UNITS );
+	const maxVertexTextures = gl.getParameter( gl.MAX_VERTEX_TEXTURE_IMAGE_UNITS );
+	const maxTextureSize = gl.getParameter( gl.MAX_TEXTURE_SIZE );
+	const maxCubemapSize = gl.getParameter( gl.MAX_CUBE_MAP_TEXTURE_SIZE );
+
+	const maxAttributes = gl.getParameter( gl.MAX_VERTEX_ATTRIBS );
+	const maxVertexUniforms = gl.getParameter( gl.MAX_VERTEX_UNIFORM_VECTORS );
+	const maxVaryings = gl.getParameter( gl.MAX_VARYING_VECTORS );
+	const maxFragmentUniforms = gl.getParameter( gl.MAX_FRAGMENT_UNIFORM_VECTORS );
+
+	const maxSamples = gl.getParameter( gl.MAX_SAMPLES );
+	const samples = gl.getParameter( gl.SAMPLES );
+
+	return {
+
+		isWebGL2: true, // keeping this for backwards compatibility
+
+		getMaxAnisotropy: getMaxAnisotropy,
+		getMaxPrecision: getMaxPrecision,
+
+		textureFormatReadable: textureFormatReadable,
+		textureTypeReadable: textureTypeReadable,
+
+		precision: precision,
+		logarithmicDepthBuffer: logarithmicDepthBuffer,
+		reversedDepthBuffer: reversedDepthBuffer,
+
+		maxTextures: maxTextures,
+		maxVertexTextures: maxVertexTextures,
+		maxTextureSize: maxTextureSize,
+		maxCubemapSize: maxCubemapSize,
+
+		maxAttributes: maxAttributes,
+		maxVertexUniforms: maxVertexUniforms,
+		maxVaryings: maxVaryings,
+		maxFragmentUniforms: maxFragmentUniforms,
+
+		maxSamples: maxSamples,
+
+		samples: samples
+
+	};
+
+}
+
+function WebGLClipping( properties ) {
+
+	const scope = this;
+
+	let globalState = null,
+		numGlobalPlanes = 0,
+		localClippingEnabled = false,
+		renderingShadows = false;
+
+	const plane = new Plane(),
+		viewNormalMatrix = new Matrix3(),
+
+		uniform = { value: null, needsUpdate: false };
+
+	this.uniform = uniform;
+	this.numPlanes = 0;
+	this.numIntersection = 0;
+
+	this.init = function ( planes, enableLocalClipping ) {
+
+		const enabled =
+			planes.length !== 0 ||
+			enableLocalClipping ||
+			// enable state of previous frame - the clipping code has to
+			// run another frame in order to reset the state:
+			numGlobalPlanes !== 0 ||
+			localClippingEnabled;
+
+		localClippingEnabled = enableLocalClipping;
+
+		numGlobalPlanes = planes.length;
+
+		return enabled;
+
+	};
+
+	this.beginShadows = function () {
+
+		renderingShadows = true;
+		projectPlanes( null );
+
+	};
+
+	this.endShadows = function () {
+
+		renderingShadows = false;
+
+	};
+
+	this.setGlobalState = function ( planes, camera ) {
+
+		globalState = projectPlanes( planes, camera, 0 );
+
+	};
+
+	this.setState = function ( material, camera, useCache ) {
+
+		const planes = material.clippingPlanes,
+			clipIntersection = material.clipIntersection,
+			clipShadows = material.clipShadows;
+
+		const materialProperties = properties.get( material );
+
+		if ( ! localClippingEnabled || planes === null || planes.length === 0 || renderingShadows && ! clipShadows ) {
+
+			// there's no local clipping
+
+			if ( renderingShadows ) {
+
+				// there's no global clipping
+
+				projectPlanes( null );
+
+			} else {
+
+				resetGlobalState();
+
+			}
+
+		} else {
+
+			const nGlobal = renderingShadows ? 0 : numGlobalPlanes,
+				lGlobal = nGlobal * 4;
+
+			let dstArray = materialProperties.clippingState || null;
+
+			uniform.value = dstArray; // ensure unique state
+
+			dstArray = projectPlanes( planes, camera, lGlobal, useCache );
+
+			for ( let i = 0; i !== lGlobal; ++ i ) {
+
+				dstArray[ i ] = globalState[ i ];
+
+			}
+
+			materialProperties.clippingState = dstArray;
+			this.numIntersection = clipIntersection ? this.numPlanes : 0;
+			this.numPlanes += nGlobal;
+
+		}
+
+
+	};
+
+	function resetGlobalState() {
+
+		if ( uniform.value !== globalState ) {
+
+			uniform.value = globalState;
+			uniform.needsUpdate = numGlobalPlanes > 0;
+
+		}
+
+		scope.numPlanes = numGlobalPlanes;
+		scope.numIntersection = 0;
+
+	}
+
+	function projectPlanes( planes, camera, dstOffset, skipTransform ) {
+
+		const nPlanes = planes !== null ? planes.length : 0;
+		let dstArray = null;
+
+		if ( nPlanes !== 0 ) {
+
+			dstArray = uniform.value;
+
+			if ( skipTransform !== true || dstArray === null ) {
+
+				const flatSize = dstOffset + nPlanes * 4,
+					viewMatrix = camera.matrixWorldInverse;
+
+				viewNormalMatrix.getNormalMatrix( viewMatrix );
+
+				if ( dstArray === null || dstArray.length < flatSize ) {
+
+					dstArray = new Float32Array( flatSize );
+
+				}
+
+				for ( let i = 0, i4 = dstOffset; i !== nPlanes; ++ i, i4 += 4 ) {
+
+					plane.copy( planes[ i ] ).applyMatrix4( viewMatrix, viewNormalMatrix );
+
+					plane.normal.toArray( dstArray, i4 );
+					dstArray[ i4 + 3 ] = plane.constant;
+
+				}
+
+			}
+
+			uniform.value = dstArray;
+			uniform.needsUpdate = true;
+
+		}
+
+		scope.numPlanes = nPlanes;
+		scope.numIntersection = 0;
+
+		return dstArray;
+
+	}
+
+}
+
+const LOD_MIN = 4;
+
+// The number of extra mips.
+// Used for scene blur in fromScene() method.
+const EXTRA_LODS = 6;
+
+// The number of spiral samples per blur pass.
+// Used for scene blur in fromScene() method.
+const BLUR_SAMPLES = 20;
+
+// GGX VNDF importance sampling configuration
+const GGX_SAMPLES = 256;
+
+const _flatCamera = /*@__PURE__*/ new OrthographicCamera();
+const _clearColor = /*@__PURE__*/ new Color();
+let _oldTarget = null;
+let _oldActiveCubeFace = 0;
+let _oldActiveMipmapLevel = 0;
+let _oldXrEnabled = false;
+
+const _origin = /*@__PURE__*/ new Vector3();
+const _direction = /*@__PURE__*/ new Vector3();
+
+/**
+ * This class generates a Prefiltered, Mipmapped Radiance Environment Map
+ * (PMREM) from a cubeMap environment texture. This allows different levels of
+ * blur to be quickly accessed based on material roughness. It is packed into a
+ * special CubeUV format that allows us to perform custom interpolation so that
+ * we can support nonlinear formats such as RGBE. Unlike a traditional mipmap
+ * chain, it only goes down to the LOD_MIN level (above), and then creates extra
+ * even more filtered 'mips' at the same LOD_MIN resolution, associated with
+ * higher roughness levels. In this way we maintain resolution to smoothly
+ * interpolate diffuse lighting while limiting sampling computation.
+ *
+ * The prefiltering uses GGX VNDF (Visible Normal Distribution Function)
+ * importance sampling based on "Sampling the GGX Distribution of Visible Normals"
+ * (Heitz, 2018) to generate environment maps that accurately match the GGX BRDF
+ * used in material rendering for physically-based image-based lighting.
+ */
+class PMREMGenerator {
+
+	/**
+	 * Constructs a new PMREM generator.
+	 *
+	 * @param {WebGLRenderer} renderer - The renderer.
+	 */
+	constructor( renderer ) {
+
+		this._renderer = renderer;
+		this._pingPongRenderTarget = null;
+
+		this._lodMax = 0;
+		this._cubeSize = 0;
+		this._sizeLods = [];
+		this._lodMeshes = [];
+
+		this._backgroundBox = null;
+
+		this._cubemapMaterial = null;
+		this._equirectMaterial = null;
+
+		this._blurMaterial = null;
+		this._ggxMaterial = null;
+
+	}
+
+	/**
+	 * Generates a PMREM from a supplied Scene, which can be faster than using an
+	 * image if networking bandwidth is low. Optional sigma specifies a blur radius
+	 * in radians to be applied to the scene before PMREM generation. Optional near
+	 * and far planes ensure the scene is rendered in its entirety.
+	 *
+	 * @param {Scene} scene - The scene to be captured.
+	 * @param {number} [sigma=0] - The blur radius in radians.
+	 * @param {number} [near=0.1] - The near plane distance.
+	 * @param {number} [far=100] - The far plane distance.
+	 * @param {Object} [options={}] - The configuration options.
+	 * @param {number} [options.size=256] - The texture size of the PMREM.
+	 * @param {Vector3} [options.position=origin] - The position of the internal cube camera that renders the scene.
+	 * @return {WebGLRenderTarget} The resulting PMREM.
+	 */
+	fromScene( scene, sigma = 0, near = 0.1, far = 100, options = {} ) {
+
+		const {
+			size = 256,
+			position = _origin,
+		} = options;
+
+		_oldTarget = this._renderer.getRenderTarget();
+		_oldActiveCubeFace = this._renderer.getActiveCubeFace();
+		_oldActiveMipmapLevel = this._renderer.getActiveMipmapLevel();
+		_oldXrEnabled = this._renderer.xr.enabled;
+
+		this._renderer.xr.enabled = false;
+
+		this._setSize( size );
+
+		const cubeUVRenderTarget = this._allocateTargets();
+		cubeUVRenderTarget.depthBuffer = true;
+
+		this._sceneToCubeUV( scene, near, far, cubeUVRenderTarget, position );
+
+		if ( sigma > 0 ) {
+
+			this._blur( cubeUVRenderTarget, 0, 0, sigma );
+
+		}
+
+		this._applyPMREM( cubeUVRenderTarget );
+		this._cleanup( cubeUVRenderTarget );
+
+		return cubeUVRenderTarget;
+
+	}
+
+	/**
+	 * Generates a PMREM from an equirectangular texture, which can be either LDR
+	 * or HDR. The ideal input image size is 1k (1024 x 512), as this matches best
+	 * with the 256 x 256 cubemap output. The minimum supported input image size
+	 * is 64 x 32.
+	 *
+	 * @param {Texture} equirectangular - The equirectangular texture to be converted.
+	 * @param {?WebGLRenderTarget} [renderTarget=null] - The render target to use.
+	 * @return {WebGLRenderTarget} The resulting PMREM.
+	 */
+	fromEquirectangular( equirectangular, renderTarget = null ) {
+
+		return this._fromTexture( equirectangular, renderTarget );
+
+	}
+
+	/**
+	 * Generates a PMREM from an cubemap texture, which can be either LDR
+	 * or HDR. The ideal input cube size is 256 x 256, as this matches best
+	 * with the 256 x 256 cubemap output. The minimum supported input cube
+	 * size is 16 x 16 per face.
+	 *
+	 * @param {Texture} cubemap - The cubemap texture to be converted.
+	 * @param {?WebGLRenderTarget} [renderTarget=null] - The render target to use.
+	 * @return {WebGLRenderTarget} The resulting PMREM.
+	 */
+	fromCubemap( cubemap, renderTarget = null ) {
+
+		return this._fromTexture( cubemap, renderTarget );
+
+	}
+
+	/**
+	 * Pre-compiles the cubemap shader. You can get faster start-up by invoking this method during
+	 * your texture's network fetch for increased concurrency.
+	 */
+	compileCubemapShader() {
+
+		if ( this._cubemapMaterial === null ) {
+
+			this._cubemapMaterial = _getCubemapMaterial();
+			this._compileMaterial( this._cubemapMaterial );
+
+		}
+
+	}
+
+	/**
+	 * Pre-compiles the equirectangular shader. You can get faster start-up by invoking this method during
+	 * your texture's network fetch for increased concurrency.
+	 */
+	compileEquirectangularShader() {
+
+		if ( this._equirectMaterial === null ) {
+
+			this._equirectMaterial = _getEquirectMaterial();
+			this._compileMaterial( this._equirectMaterial );
+
+		}
+
+	}
+
+	/**
+	 * Disposes of the PMREMGenerator's internal memory. Note that PMREMGenerator is a static class,
+	 * so you should not need more than one PMREMGenerator object. If you do, calling dispose() on
+	 * one of them will cause any others to also become unusable.
+	 */
+	dispose() {
+
+		this._dispose();
+
+		if ( this._cubemapMaterial !== null ) this._cubemapMaterial.dispose();
+		if ( this._equirectMaterial !== null ) this._equirectMaterial.dispose();
+
+		if ( this._backgroundBox !== null ) {
+
+			this._backgroundBox.geometry.dispose();
+			this._backgroundBox.material.dispose();
+
+		}
+
+	}
+
+	// private interface
+
+	_setSize( cubeSize ) {
+
+		this._lodMax = Math.floor( Math.log2( cubeSize ) );
+		this._cubeSize = Math.pow( 2, this._lodMax );
+
+	}
+
+	_dispose() {
+
+		if ( this._blurMaterial !== null ) this._blurMaterial.dispose();
+		if ( this._ggxMaterial !== null ) this._ggxMaterial.dispose();
+
+		if ( this._pingPongRenderTarget !== null ) this._pingPongRenderTarget.dispose();
+
+		for ( let i = 0; i < this._lodMeshes.length; i ++ ) {
+
+			this._lodMeshes[ i ].geometry.dispose();
+
+		}
+
+	}
+
+	_cleanup( outputTarget ) {
+
+		this._renderer.setRenderTarget( _oldTarget, _oldActiveCubeFace, _oldActiveMipmapLevel );
+		this._renderer.xr.enabled = _oldXrEnabled;
+
+		outputTarget.scissorTest = false;
+		_setViewport( outputTarget, 0, 0, outputTarget.width, outputTarget.height );
+
+	}
+
+	_fromTexture( texture, renderTarget ) {
+
+		if ( texture.mapping === CubeReflectionMapping || texture.mapping === CubeRefractionMapping ) {
+
+			this._setSize( texture.image.length === 0 ? 16 : ( texture.image[ 0 ].width || texture.image[ 0 ].image.width ) );
+
+		} else { // Equirectangular
+
+			this._setSize( texture.image.width / 4 );
+
+		}
+
+		_oldTarget = this._renderer.getRenderTarget();
+		_oldActiveCubeFace = this._renderer.getActiveCubeFace();
+		_oldActiveMipmapLevel = this._renderer.getActiveMipmapLevel();
+		_oldXrEnabled = this._renderer.xr.enabled;
+
+		this._renderer.xr.enabled = false;
+
+		const cubeUVRenderTarget = renderTarget || this._allocateTargets();
+		this._textureToCubeUV( texture, cubeUVRenderTarget );
+		this._applyPMREM( cubeUVRenderTarget );
+		this._cleanup( cubeUVRenderTarget );
+
+		return cubeUVRenderTarget;
+
+	}
+
+	_allocateTargets() {
+
+		const width = 3 * Math.max( this._cubeSize, 16 * 7 );
+		const height = 4 * this._cubeSize;
+
+		const params = {
+			magFilter: LinearFilter,
+			minFilter: LinearFilter,
+			generateMipmaps: false,
+			type: HalfFloatType,
+			format: RGBAFormat,
+			colorSpace: LinearSRGBColorSpace,
+			depthBuffer: false
+		};
+
+		const cubeUVRenderTarget = _createRenderTarget( width, height, params );
+
+		if ( this._pingPongRenderTarget === null || this._pingPongRenderTarget.width !== width || this._pingPongRenderTarget.height !== height ) {
+
+			if ( this._pingPongRenderTarget !== null ) {
+
+				this._dispose();
+
+			}
+
+			this._pingPongRenderTarget = _createRenderTarget( width, height, params );
+
+			const { _lodMax } = this;
+			( { lodMeshes: this._lodMeshes, sizeLods: this._sizeLods } = _createPlanes( _lodMax ) );
+
+			this._blurMaterial = _getBlurShader( _lodMax, width, height );
+			this._ggxMaterial = _getGGXShader( _lodMax, width, height );
+
+		}
+
+		return cubeUVRenderTarget;
+
+	}
+
+	_compileMaterial( material ) {
+
+		const mesh = new Mesh( new BufferGeometry(), material );
+		this._renderer.compile( mesh, _flatCamera );
+
+	}
+
+	_sceneToCubeUV( scene, near, far, cubeUVRenderTarget, position ) {
+
+		const fov = 90;
+		const aspect = 1;
+		const cubeCamera = new PerspectiveCamera( fov, aspect, near, far );
+		const upSign = [ 1, -1, 1, 1, 1, 1 ];
+		const forwardSign = [ 1, 1, 1, -1, -1, -1 ];
+		const renderer = this._renderer;
+
+		const originalAutoClear = renderer.autoClear;
+		const toneMapping = renderer.toneMapping;
+		renderer.getClearColor( _clearColor );
+
+		renderer.toneMapping = NoToneMapping;
+		renderer.autoClear = false;
+
+		// https://github.com/mrdoob/three.js/issues/31413#issuecomment-3095966812
+		const reversedDepthBuffer = renderer.state.buffers.depth.getReversed();
+
+		if ( reversedDepthBuffer ) {
+
+			renderer.setRenderTarget( cubeUVRenderTarget );
+			renderer.clearDepth();
+			renderer.setRenderTarget( null );
+
+		}
+
+		if ( this._backgroundBox === null ) {
+
+			this._backgroundBox = new Mesh(
+				new BoxGeometry(),
+				new MeshBasicMaterial( {
+					name: 'PMREM.Background',
+					side: BackSide,
+					depthWrite: false,
+					depthTest: false,
+				} )
+			);
+
+		}
+
+		const backgroundBox = this._backgroundBox;
+		const backgroundMaterial = backgroundBox.material;
+
+		let useSolidColor = false;
+
+		const background = scene.background;
+
+		if ( background ) {
+
+			if ( background.isColor ) {
+
+				backgroundMaterial.color.copy( background );
+				scene.background = null;
+				useSolidColor = true;
+
+			}
+
+		} else {
+
+			backgroundMaterial.color.copy( _clearColor );
+			useSolidColor = true;
+
+		}
+
+		for ( let i = 0; i < 6; i ++ ) {
+
+			const col = i % 3;
+
+			if ( col === 0 ) {
+
+				cubeCamera.up.set( 0, upSign[ i ], 0 );
+				cubeCamera.position.set( position.x, position.y, position.z );
+				cubeCamera.lookAt( position.x + forwardSign[ i ], position.y, position.z );
+
+			} else if ( col === 1 ) {
+
+				cubeCamera.up.set( 0, 0, upSign[ i ] );
+				cubeCamera.position.set( position.x, position.y, position.z );
+				cubeCamera.lookAt( position.x, position.y + forwardSign[ i ], position.z );
+
+
+			} else {
+
+				cubeCamera.up.set( 0, upSign[ i ], 0 );
+				cubeCamera.position.set( position.x, position.y, position.z );
+				cubeCamera.lookAt( position.x, position.y, position.z + forwardSign[ i ] );
+
+			}
+
+			const size = this._cubeSize;
+
+			_setViewport( cubeUVRenderTarget, col * size, i > 2 ? size : 0, size, size );
+
+			renderer.setRenderTarget( cubeUVRenderTarget );
+
+			if ( useSolidColor ) {
+
+				renderer.render( backgroundBox, cubeCamera );
+
+			}
+
+			renderer.render( scene, cubeCamera );
+
+		}
+
+		renderer.toneMapping = toneMapping;
+		renderer.autoClear = originalAutoClear;
+		scene.background = background;
+
+	}
+
+	_textureToCubeUV( texture, cubeUVRenderTarget ) {
+
+		const renderer = this._renderer;
+
+		const isCubeTexture = ( texture.mapping === CubeReflectionMapping || texture.mapping === CubeRefractionMapping );
+
+		if ( isCubeTexture ) {
+
+			if ( this._cubemapMaterial === null ) {
+
+				this._cubemapMaterial = _getCubemapMaterial();
+
+			}
+
+			this._cubemapMaterial.uniforms.flipEnvMap.value = ( texture.isRenderTargetTexture === false ) ? -1 : 1;
+
+		} else {
+
+			if ( this._equirectMaterial === null ) {
+
+				this._equirectMaterial = _getEquirectMaterial();
+
+			}
+
+		}
+
+		const material = isCubeTexture ? this._cubemapMaterial : this._equirectMaterial;
+
+		const mesh = this._lodMeshes[ 0 ];
+		mesh.material = material;
+
+		const uniforms = material.uniforms;
+
+		uniforms[ 'envMap' ].value = texture;
+
+		const size = this._cubeSize;
+
+		_setViewport( cubeUVRenderTarget, 0, 0, 3 * size, 2 * size );
+
+		renderer.setRenderTarget( cubeUVRenderTarget );
+		renderer.render( mesh, _flatCamera );
+
+	}
+
+	_applyPMREM( cubeUVRenderTarget ) {
+
+		const renderer = this._renderer;
+		const autoClear = renderer.autoClear;
+		renderer.autoClear = false;
+
+		const n = this._lodMeshes.length;
+
+		// Use GGX VNDF importance sampling
+		for ( let i = 1; i < n; i ++ ) {
+
+			this._applyGGXFilter( cubeUVRenderTarget, i - 1, i );
+
+		}
+
+		renderer.autoClear = autoClear;
+
+	}
+
+	/**
+	 * Applies GGX VNDF importance sampling filter to generate a prefiltered environment map.
+	 * Uses Monte Carlo integration with VNDF importance sampling to accurately represent the
+	 * GGX BRDF for physically-based rendering. Reads from the previous LOD level and
+	 * applies incremental roughness filtering to avoid over-blurring.
+	 *
+	 * @private
+	 * @param {WebGLRenderTarget} cubeUVRenderTarget
+	 * @param {number} lodIn - Source LOD level to read from
+	 * @param {number} lodOut - Target LOD level to write to
+	 */
+	_applyGGXFilter( cubeUVRenderTarget, lodIn, lodOut ) {
+
+		const renderer = this._renderer;
+		const pingPongRenderTarget = this._pingPongRenderTarget;
+
+		const ggxMaterial = this._ggxMaterial;
+		const ggxMesh = this._lodMeshes[ lodOut ];
+		ggxMesh.material = ggxMaterial;
+
+		const ggxUniforms = ggxMaterial.uniforms;
+
+		// Calculate incremental roughness between LOD levels
+		const targetRoughness = lodOut / ( this._lodMeshes.length - 1 );
+		const sourceRoughness = lodIn / ( this._lodMeshes.length - 1 );
+		const incrementalRoughness = Math.sqrt( targetRoughness * targetRoughness - sourceRoughness * sourceRoughness );
+
+		// Apply blur strength mapping for better quality across the roughness range
+		const blurStrength = targetRoughness * 1.25;
+		const adjustedRoughness = incrementalRoughness * blurStrength;
+
+		// Calculate viewport position based on output LOD level
+		const { _lodMax } = this;
+		const outputSize = this._sizeLods[ lodOut ];
+		const x = 3 * outputSize * ( lodOut > _lodMax - LOD_MIN ? lodOut - _lodMax + LOD_MIN : 0 );
+		const y = 4 * ( this._cubeSize - outputSize );
+
+		// Read from previous LOD with incremental roughness
+		ggxUniforms[ 'envMap' ].value = cubeUVRenderTarget.texture;
+		ggxUniforms[ 'roughness' ].value = adjustedRoughness;
+		ggxUniforms[ 'mipInt' ].value = _lodMax - lodIn; // Sample from input LOD
+
+		_setViewport( pingPongRenderTarget, x, y, 3 * outputSize, 2 * outputSize );
+		renderer.setRenderTarget( pingPongRenderTarget );
+		renderer.render( ggxMesh, _flatCamera );
+
+		// Copy from pingPong back to cubeUV (simple direct copy)
+		ggxUniforms[ 'envMap' ].value = pingPongRenderTarget.texture;
+		ggxUniforms[ 'roughness' ].value = 0.0; // Direct copy
+		ggxUniforms[ 'mipInt' ].value = _lodMax - lodOut; // Read from the level we just wrote
+
+		_setViewport( cubeUVRenderTarget, x, y, 3 * outputSize, 2 * outputSize );
+		renderer.setRenderTarget( cubeUVRenderTarget );
+		renderer.render( ggxMesh, _flatCamera );
+
+	}
+
+	/**
+	 * This is a two-pass Gaussian blur for a cubemap. Each pass importance-samples
+	 * the Gaussian along a spiral kernel (Golden Angle), which distributes samples
+	 * isotropically on the sphere (no pole artifacts).
+	 *
+	 * Used for initial scene blur in fromScene() method when sigma > 0.
+	 *
+	 * @private
+	 * @param {WebGLRenderTarget} cubeUVRenderTarget
+	 * @param {number} lodIn
+	 * @param {number} lodOut
+	 * @param {number} sigma
+	 */
+	_blur( cubeUVRenderTarget, lodIn, lodOut, sigma ) {
+
+		const pingPongRenderTarget = this._pingPongRenderTarget;
+
+		// Two passes of sigma / sqrt( 2 ) compose to a blur of sigma while squaring
+		// the effective sample count. Sigmas beyond PI are visually indistinguishable
+		// from a uniform blur, so clamp to keep the shader math finite.
+		const blurSigma = Math.min( sigma, Math.PI ) / Math.SQRT2;
+
+		this._blurPass( cubeUVRenderTarget, pingPongRenderTarget, lodIn, lodOut, blurSigma );
+		this._blurPass( pingPongRenderTarget, cubeUVRenderTarget, lodOut, lodOut, blurSigma );
+
+	}
+
+	_blurPass( targetIn, targetOut, lodIn, lodOut, sigmaRadians ) {
+
+		const renderer = this._renderer;
+		const blurMaterial = this._blurMaterial;
+
+		const blurMesh = this._lodMeshes[ lodOut ];
+		blurMesh.material = blurMaterial;
+
+		const blurUniforms = blurMaterial.uniforms;
+
+		blurUniforms[ 'envMap' ].value = targetIn.texture;
+		blurUniforms[ 'sigma' ].value = sigmaRadians;
+		blurUniforms[ 'mipInt' ].value = this._lodMax - lodIn;
+
+		const outputSize = this._sizeLods[ lodOut ];
+		const x = 3 * outputSize * ( lodOut > this._lodMax - LOD_MIN ? lodOut - this._lodMax + LOD_MIN : 0 );
+		const y = 4 * ( this._cubeSize - outputSize );
+
+		_setViewport( targetOut, x, y, 3 * outputSize, 2 * outputSize );
+		renderer.setRenderTarget( targetOut );
+		renderer.render( blurMesh, _flatCamera );
+
+	}
+
+}
+
+
+
+function _createPlanes( lodMax ) {
+
+	const sizeLods = [];
+	const lodMeshes = [];
+
+	let lod = lodMax;
+
+	const totalLods = lodMax - LOD_MIN + 1 + EXTRA_LODS;
+
+	for ( let i = 0; i < totalLods; i ++ ) {
+
+		const sizeLod = Math.pow( 2, lod );
+		sizeLods.push( sizeLod );
+
+		// UVs overshoot the face by one texel to bake the CubeUV border into the directions.
+		const texelSize = 1.0 / ( sizeLod - 2 );
+		const min = - texelSize;
+		const max = 1 + texelSize;
+		const uv1 = [ min, min, max, min, max, max, min, min, max, max, min, max ];
+
+		const cubeFaces = 6;
+		const vertices = 6;
+		const positionSize = 3;
+
+		const position = new Float32Array( positionSize * vertices * cubeFaces );
+		const outputDirection = new Float32Array( positionSize * vertices * cubeFaces );
+
+		for ( let face = 0; face < cubeFaces; face ++ ) {
+
+			const x = ( face % 3 ) * 2 / 3 - 1;
+			const y = face > 2 ? 0 : -1;
+			const coordinates = [
+				x, y, 0,
+				x + 2 / 3, y, 0,
+				x + 2 / 3, y + 1, 0,
+				x, y, 0,
+				x + 2 / 3, y + 1, 0,
+				x, y + 1, 0
+			];
+			position.set( coordinates, positionSize * vertices * face );
+
+			for ( let vertex = 0; vertex < vertices; vertex ++ ) {
+
+				const u = uv1[ vertex * 2 ] * 2 - 1;
+				const v = uv1[ vertex * 2 + 1 ] * 2 - 1;
+
+				// RH coordinate system; PMREM face-indexing convention
+				if ( face === 0 ) {
+
+					_direction.set( 1, v, u ); // pos x
+
+				} else if ( face === 1 ) {
+
+					_direction.set( - u, 1, - v ); // pos y
+
+				} else if ( face === 2 ) {
+
+					_direction.set( - u, v, 1 ); // pos z
+
+				} else if ( face === 3 ) {
+
+					_direction.set( -1, v, - u ); // neg x
+
+				} else if ( face === 4 ) {
+
+					_direction.set( - u, -1, v ); // neg y
+
+				} else {
+
+					_direction.set( u, v, -1 ); // neg z
+
+				}
+
+				_direction.toArray( outputDirection, ( face * vertices + vertex ) * positionSize );
+
+			}
+
+		}
+
+		const planes = new BufferGeometry();
+		planes.setAttribute( 'position', new BufferAttribute( position, positionSize ) );
+		planes.setAttribute( 'outputDirection', new BufferAttribute( outputDirection, positionSize ) );
+		lodMeshes.push( new Mesh( planes, null ) );
+
+		if ( lod > LOD_MIN ) {
+
+			lod --;
+
+		}
+
+	}
+
+	return { lodMeshes, sizeLods };
+
+}
+
+function _createRenderTarget( width, height, params ) {
+
+	const cubeUVRenderTarget = new WebGLRenderTarget( width, height, params );
+	cubeUVRenderTarget.texture.mapping = CubeUVReflectionMapping;
+	cubeUVRenderTarget.texture.name = 'PMREM.cubeUv';
+	cubeUVRenderTarget.scissorTest = true;
+	return cubeUVRenderTarget;
+
+}
+
+function _setViewport( target, x, y, width, height ) {
+
+	target.viewport.set( x, y, width, height );
+	target.scissor.set( x, y, width, height );
+
+}
+
+function _getGGXShader( lodMax, width, height ) {
+
+	const shaderMaterial = new ShaderMaterial( {
+
+		name: 'PMREMGGXConvolution',
+
+		defines: {
+			'GGX_SAMPLES': GGX_SAMPLES,
+			'CUBEUV_TEXEL_WIDTH': 1.0 / width,
+			'CUBEUV_TEXEL_HEIGHT': 1.0 / height,
+			'CUBEUV_MAX_MIP': `${lodMax}.0`,
+		},
+
+		uniforms: {
+			'envMap': { value: null },
+			'roughness': { value: 0.0 },
+			'mipInt': { value: 0 }
+		},
+
+		vertexShader: _getCommonVertexShader(),
+
+		fragmentShader: /* glsl */`
+
+			precision highp float;
+			precision highp int;
+
+			varying vec3 vOutputDirection;
+
+			uniform sampler2D envMap;
+			uniform float roughness;
+			uniform float mipInt;
+
+			#define ENVMAP_TYPE_CUBE_UV
+			#include <cube_uv_reflection_fragment>
+
+			#define PI 3.14159265359
+
+			// Van der Corput radical inverse
+			float radicalInverse_VdC(uint bits) {
+				bits = (bits << 16u) | (bits >> 16u);
+				bits = ((bits & 0x55555555u) << 1u) | ((bits & 0xAAAAAAAAu) >> 1u);
+				bits = ((bits & 0x33333333u) << 2u) | ((bits & 0xCCCCCCCCu) >> 2u);
+				bits = ((bits & 0x0F0F0F0Fu) << 4u) | ((bits & 0xF0F0F0F0u) >> 4u);
+				bits = ((bits & 0x00FF00FFu) << 8u) | ((bits & 0xFF00FF00u) >> 8u);
+				return float(bits) * 2.3283064365386963e-10; // / 0x100000000
+			}
+
+			// Hammersley sequence
+			vec2 hammersley(uint i, uint N) {
+				return vec2(float(i) / float(N), radicalInverse_VdC(i));
+			}
+
+			// GGX VNDF importance sampling (Eric Heitz 2018)
+			// "Sampling the GGX Distribution of Visible Normals"
+			// https://jcgt.org/published/0007/04/01/
+			vec3 importanceSampleGGX_VNDF(vec2 Xi, vec3 V, float roughness) {
+				float alpha = roughness * roughness;
+
+				// Section 4.1: Orthonormal basis
+				vec3 T1 = vec3(1.0, 0.0, 0.0);
+				vec3 T2 = cross(V, T1);
+
+				// Section 4.2: Parameterization of projected area
+				float r = sqrt(Xi.x);
+				float phi = 2.0 * PI * Xi.y;
+				float t1 = r * cos(phi);
+				float t2 = r * sin(phi);
+				float s = 0.5 * (1.0 + V.z);
+				t2 = (1.0 - s) * sqrt(1.0 - t1 * t1) + s * t2;
+
+				// Section 4.3: Reprojection onto hemisphere
+				vec3 Nh = t1 * T1 + t2 * T2 + sqrt(max(0.0, 1.0 - t1 * t1 - t2 * t2)) * V;
+
+				// Section 3.4: Transform back to ellipsoid configuration
+				return normalize(vec3(alpha * Nh.x, alpha * Nh.y, max(0.0, Nh.z)));
+			}
+
+			void main() {
+				vec3 N = normalize(vOutputDirection);
+				vec3 V = N; // Assume view direction equals normal for pre-filtering
+
+				vec3 prefilteredColor = vec3(0.0);
+				float totalWeight = 0.0;
+
+				// For very low roughness, just sample the environment directly
+				if (roughness < 0.001) {
+					gl_FragColor = vec4(bilinearCubeUV(envMap, N, mipInt), 1.0);
+					return;
+				}
+
+				// Tangent space basis for VNDF sampling
+				vec3 up = abs(N.z) < 0.999 ? vec3(0.0, 0.0, 1.0) : vec3(1.0, 0.0, 0.0);
+				vec3 tangent = normalize(cross(up, N));
+				vec3 bitangent = cross(N, tangent);
+
+				for(uint i = 0u; i < uint(GGX_SAMPLES); i++) {
+					vec2 Xi = hammersley(i, uint(GGX_SAMPLES));
+
+					// For PMREM, V = N, so in tangent space V is always (0, 0, 1)
+					vec3 H_tangent = importanceSampleGGX_VNDF(Xi, vec3(0.0, 0.0, 1.0), roughness);
+
+					// Transform H back to world space
+					vec3 H = normalize(tangent * H_tangent.x + bitangent * H_tangent.y + N * H_tangent.z);
+					vec3 L = normalize(2.0 * dot(V, H) * H - V);
+
+					float NdotL = max(dot(N, L), 0.0);
+
+					if(NdotL > 0.0) {
+						// Sample environment at fixed mip level
+						// VNDF importance sampling handles the distribution filtering
+						vec3 sampleColor = bilinearCubeUV(envMap, L, mipInt);
+
+						// Weight by NdotL for the split-sum approximation
+						// VNDF PDF naturally accounts for the visible microfacet distribution
+						prefilteredColor += sampleColor * NdotL;
+						totalWeight += NdotL;
+					}
+				}
+
+				if (totalWeight > 0.0) {
+					prefilteredColor = prefilteredColor / totalWeight;
+				}
+
+				gl_FragColor = vec4(prefilteredColor, 1.0);
+			}
+		`,
+
+		blending: NoBlending,
+		depthTest: false,
+		depthWrite: false
+
+	} );
+
+	return shaderMaterial;
+
+}
+
+function _getBlurShader( lodMax, width, height ) {
+
+	const shaderMaterial = new ShaderMaterial( {
+
+		name: 'SphericalGaussianBlur',
+
+		defines: {
+			'SAMPLES': BLUR_SAMPLES,
+			'CUBEUV_TEXEL_WIDTH': 1.0 / width,
+			'CUBEUV_TEXEL_HEIGHT': 1.0 / height,
+			'CUBEUV_MAX_MIP': `${lodMax}.0`,
+		},
+
+		uniforms: {
+			'envMap': { value: null },
+			'sigma': { value: 0 },
+			'mipInt': { value: 0 },
+		},
+
+		vertexShader: _getCommonVertexShader(),
+
+		fragmentShader: /* glsl */`
+
+			precision highp float;
+			precision highp int;
+
+			varying vec3 vOutputDirection;
+
+			uniform sampler2D envMap;
+			uniform float sigma;
+			uniform float mipInt;
+
+			#define ENVMAP_TYPE_CUBE_UV
+			#include <cube_uv_reflection_fragment>
+
+			#define PI 3.14159265359
+			#define GOLDEN_ANGLE 2.39996322973
+
+			void main() {
+
+				if ( sigma == 0.0 ) {
+
+					gl_FragColor = vec4( bilinearCubeUV( envMap, vOutputDirection, mipInt ), 1.0 );
+					return;
+
+				}
+
+				vec3 outputDirection = normalize( vOutputDirection );
+
+				vec3 up = abs( outputDirection.z ) < 0.999 ? vec3( 0.0, 0.0, 1.0 ) : vec3( 1.0, 0.0, 0.0 );
+				vec3 tangent = normalize( cross( up, outputDirection ) );
+				vec3 bitangent = cross( outputDirection, tangent );
+
+				// Truncate the kernel at three standard deviations or at the antipode.
+				float thetaMax = min( 3.0 * sigma, PI );
+				float truncation = 1.0 - exp( - 0.5 * thetaMax * thetaMax / ( sigma * sigma ) );
+
+				vec3 accumColor = vec3( 0.0 );
+				float accumWeight = 0.0;
+
+				for ( int i = 0; i < SAMPLES; i ++ ) {
+
+					// Stratified inverse-CDF sampling of the Gaussian, placed on a golden-angle spiral.
+					float stratum = ( float( i ) + 0.5 ) / float( SAMPLES );
+					float theta = sigma * sqrt( - 2.0 * log( 1.0 - stratum * truncation ) );
+					float phi = float( i ) * GOLDEN_ANGLE;
+
+					vec3 offset = cos( phi ) * tangent + sin( phi ) * bitangent;
+					vec3 sampleDirection = cos( theta ) * outputDirection + sin( theta ) * offset;
+
+					// Correct the planar sample density to solid angle.
+					float weight = sin( theta ) / theta;
+
+					accumColor += weight * bilinearCubeUV( envMap, sampleDirection, mipInt );
+					accumWeight += weight;
+
+				}
+
+				gl_FragColor = vec4( accumColor / accumWeight, 1.0 );
+
+			}
+		`,
+
+		blending: NoBlending,
+		depthTest: false,
+		depthWrite: false
+
+	} );
+
+	return shaderMaterial;
+
+}
+
+function _getEquirectMaterial() {
+
+	return new ShaderMaterial( {
+
+		name: 'EquirectangularToCubeUV',
+
+		uniforms: {
+			'envMap': { value: null }
+		},
+
+		vertexShader: _getCommonVertexShader(),
+
+		fragmentShader: /* glsl */`
+
+			precision mediump float;
+			precision mediump int;
+
+			varying vec3 vOutputDirection;
+
+			uniform sampler2D envMap;
+
+			#include <common>
+
+			void main() {
+
+				vec3 outputDirection = normalize( vOutputDirection );
+				vec2 uv = equirectUv( outputDirection );
+
+				gl_FragColor = vec4( texture2D ( envMap, uv ).rgb, 1.0 );
+
+			}
+		`,
+
+		blending: NoBlending,
+		depthTest: false,
+		depthWrite: false
+
+	} );
+
+}
+
+function _getCubemapMaterial() {
+
+	return new ShaderMaterial( {
+
+		name: 'CubemapToCubeUV',
+
+		uniforms: {
+			'envMap': { value: null },
+			'flipEnvMap': { value: -1 }
+		},
+
+		vertexShader: _getCommonVertexShader(),
+
+		fragmentShader: /* glsl */`
+
+			precision mediump float;
+			precision mediump int;
+
+			uniform float flipEnvMap;
+
+			varying vec3 vOutputDirection;
+
+			uniform samplerCube envMap;
+
+			void main() {
+
+				gl_FragColor = textureCube( envMap, vec3( flipEnvMap * vOutputDirection.x, vOutputDirection.yz ) );
+
+			}
+		`,
+
+		blending: NoBlending,
+		depthTest: false,
+		depthWrite: false
+
+	} );
+
+}
+
+function _getCommonVertexShader() {
+
+	return /* glsl */`
+
+		precision mediump float;
+		precision mediump int;
+
+		attribute vec3 outputDirection;
+
+		varying vec3 vOutputDirection;
+
+		void main() {
+
+			vOutputDirection = outputDirection;
+			gl_Position = vec4( position, 1.0 );
+
+		}
+	`;
+
+}
+
+/**
+ * A cube render target used in context of {@link WebGLRenderer}.
+ *
+ * @augments WebGLRenderTarget
+ */
+class WebGLCubeRenderTarget extends WebGLRenderTarget {
+
+	/**
+	 * Constructs a new cube render target.
+	 *
+	 * @param {number} [size=1] - The size of the render target.
+	 * @param {RenderTarget~Options} [options] - The configuration object.
+	 */
+	constructor( size = 1, options = {} ) {
+
+		super( size, size, options );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isWebGLCubeRenderTarget = true;
+
+		const image = { width: size, height: size, depth: 1 };
+		const images = [ image, image, image, image, image, image ];
+
+		/**
+		 * Overwritten with a different texture type.
+		 *
+		 * @type {DataArrayTexture}
+		 */
+		this.texture = new CubeTexture( images );
+		this._setTextureOptions( options );
+
+		// By convention -- likely based on the RenderMan spec from the 1990's -- cube maps are specified by WebGL (and three.js)
+		// in a coordinate system in which positive-x is to the right when looking up the positive-z axis -- in other words,
+		// in a left-handed coordinate system. By continuing this convention, preexisting cube maps continued to render correctly.
+
+		// three.js uses a right-handed coordinate system. So environment maps used in three.js appear to have px and nx swapped
+		// and the flag isRenderTargetTexture controls this conversion. The flip is not required when using WebGLCubeRenderTarget.texture
+		// as a cube texture (this is detected when isRenderTargetTexture is set to true for cube textures).
+
+		this.texture.isRenderTargetTexture = true;
+
+	}
+
+	/**
+	 * Converts the given equirectangular texture to a cube map.
+	 *
+	 * @param {WebGLRenderer} renderer - The renderer.
+	 * @param {Texture} texture - The equirectangular texture.
+	 * @return {WebGLCubeRenderTarget} A reference to this cube render target.
+	 */
+	fromEquirectangularTexture( renderer, texture ) {
+
+		this.texture.type = texture.type;
+		this.texture.colorSpace = texture.colorSpace;
+
+		this.texture.generateMipmaps = texture.generateMipmaps;
+		this.texture.minFilter = texture.minFilter;
+		this.texture.magFilter = texture.magFilter;
+
+		const shader = {
+
+			uniforms: {
+				tEquirect: { value: null },
+			},
+
+			vertexShader: /* glsl */`
+
+				varying vec3 vWorldDirection;
+
+				vec3 transformDirection( in vec3 dir, in mat4 matrix ) {
+
+					return normalize( ( matrix * vec4( dir, 0.0 ) ).xyz );
+
+				}
+
+				void main() {
+
+					vWorldDirection = transformDirection( position, modelMatrix );
+
+					#include <begin_vertex>
+					#include <project_vertex>
+
+				}
+			`,
+
+			fragmentShader: /* glsl */`
+
+				uniform sampler2D tEquirect;
+
+				varying vec3 vWorldDirection;
+
+				#include <common>
+
+				void main() {
+
+					vec3 direction = normalize( vWorldDirection );
+
+					vec2 sampleUV = equirectUv( direction );
+
+					gl_FragColor = texture2D( tEquirect, sampleUV );
+
+				}
+			`
+		};
+
+		const geometry = new BoxGeometry( 5, 5, 5 );
+
+		const material = new ShaderMaterial( {
+
+			name: 'CubemapFromEquirect',
+
+			uniforms: cloneUniforms( shader.uniforms ),
+			vertexShader: shader.vertexShader,
+			fragmentShader: shader.fragmentShader,
+			side: BackSide,
+			blending: NoBlending
+
+		} );
+
+		material.uniforms.tEquirect.value = texture;
+
+		const mesh = new Mesh( geometry, material );
+
+		const currentMinFilter = texture.minFilter;
+
+		// Avoid blurred poles
+		if ( texture.minFilter === LinearMipmapLinearFilter ) texture.minFilter = LinearFilter;
+
+		const camera = new CubeCamera( 1, 10, this );
+		camera.update( renderer, mesh );
+
+		texture.minFilter = currentMinFilter;
+
+		mesh.geometry.dispose();
+		mesh.material.dispose();
+
+		return this;
+
+	}
+
+	/**
+	 * Clears this cube render target.
+	 *
+	 * @param {WebGLRenderer} renderer - The renderer.
+	 * @param {boolean} [color=true] - Whether the color buffer should be cleared or not.
+	 * @param {boolean} [depth=true] - Whether the depth buffer should be cleared or not.
+	 * @param {boolean} [stencil=true] - Whether the stencil buffer should be cleared or not.
+	 */
+	clear( renderer, color = true, depth = true, stencil = true ) {
+
+		const currentRenderTarget = renderer.getRenderTarget();
+
+		for ( let i = 0; i < 6; i ++ ) {
+
+			renderer.setRenderTarget( this, i );
+
+			renderer.clear( color, depth, stencil );
+
+		}
+
+		renderer.setRenderTarget( currentRenderTarget );
+
+	}
+
+}
+
+function WebGLEnvironments( renderer ) {
+
+	let cubeMaps = new WeakMap();
+	let pmremMaps = new WeakMap();
+
+	let pmremGenerator = null;
+
+	function get( texture, usePMREM = false ) {
+
+		if ( texture === null || texture === undefined ) return null;
+
+		if ( usePMREM ) {
+
+			return getPMREM( texture );
+
+		}
+
+		return getCube( texture );
+
+	}
+
+	function getCube( texture ) {
+
+		if ( texture && texture.isTexture ) {
+
+			const mapping = texture.mapping;
+
+			if ( mapping === EquirectangularReflectionMapping || mapping === EquirectangularRefractionMapping ) {
+
+				if ( cubeMaps.has( texture ) ) {
+
+					const cubemap = cubeMaps.get( texture ).texture;
+					return mapTextureMapping( cubemap, texture.mapping );
+
+				} else {
+
+					const image = texture.image;
+
+					if ( image && image.height > 0 ) {
+
+						const renderTarget = new WebGLCubeRenderTarget( image.height );
+						renderTarget.fromEquirectangularTexture( renderer, texture );
+						cubeMaps.set( texture, renderTarget );
+
+						texture.addEventListener( 'dispose', onCubemapDispose );
+
+						return mapTextureMapping( renderTarget.texture, texture.mapping );
+
+					} else {
+
+						// image not yet ready. try the conversion next frame
+
+						return null;
+
+					}
+
+				}
+
+			}
+
+		}
+
+		return texture;
+
+	}
+
+	function getPMREM( texture ) {
+
+		if ( texture && texture.isTexture ) {
+
+			const mapping = texture.mapping;
+
+			const isEquirectMap = ( mapping === EquirectangularReflectionMapping || mapping === EquirectangularRefractionMapping );
+			const isCubeMap = ( mapping === CubeReflectionMapping || mapping === CubeRefractionMapping );
+
+			// equirect/cube map to cubeUV conversion
+
+			if ( isEquirectMap || isCubeMap ) {
+
+				let renderTarget = pmremMaps.get( texture );
+
+				const currentPMREMVersion = renderTarget !== undefined ? renderTarget.texture.pmremVersion : 0;
+
+				if ( texture.isRenderTargetTexture && texture.pmremVersion !== currentPMREMVersion ) {
+
+					if ( pmremGenerator === null ) pmremGenerator = new PMREMGenerator( renderer );
+
+					renderTarget = isEquirectMap ? pmremGenerator.fromEquirectangular( texture, renderTarget ) : pmremGenerator.fromCubemap( texture, renderTarget );
+					renderTarget.texture.pmremVersion = texture.pmremVersion;
+
+					pmremMaps.set( texture, renderTarget );
+
+					return renderTarget.texture;
+
+				} else {
+
+					if ( renderTarget !== undefined ) {
+
+						return renderTarget.texture;
+
+					} else {
+
+						const image = texture.image;
+
+						if ( ( isEquirectMap && image && image.height > 0 ) || ( isCubeMap && image && isCubeTextureComplete( image ) ) ) {
+
+							if ( pmremGenerator === null ) pmremGenerator = new PMREMGenerator( renderer );
+
+							renderTarget = isEquirectMap ? pmremGenerator.fromEquirectangular( texture ) : pmremGenerator.fromCubemap( texture );
+							renderTarget.texture.pmremVersion = texture.pmremVersion;
+
+							pmremMaps.set( texture, renderTarget );
+
+							texture.addEventListener( 'dispose', onPMREMDispose );
+
+							return renderTarget.texture;
+
+						} else {
+
+							// image not yet ready. try the conversion next frame
+
+							return null;
+
+						}
+
+					}
+
+				}
+
+			}
+
+		}
+
+		return texture;
+
+	}
+
+	function mapTextureMapping( texture, mapping ) {
+
+		if ( mapping === EquirectangularReflectionMapping ) {
+
+			texture.mapping = CubeReflectionMapping;
+
+		} else if ( mapping === EquirectangularRefractionMapping ) {
+
+			texture.mapping = CubeRefractionMapping;
+
+		}
+
+		return texture;
+
+	}
+
+	function isCubeTextureComplete( image ) {
+
+		let count = 0;
+		const length = 6;
+
+		for ( let i = 0; i < length; i ++ ) {
+
+			if ( image[ i ] !== undefined ) count ++;
+
+		}
+
+		return count === length;
+
+	}
+
+	function onCubemapDispose( event ) {
+
+		const texture = event.target;
+
+		texture.removeEventListener( 'dispose', onCubemapDispose );
+
+		const cubemap = cubeMaps.get( texture );
+
+		if ( cubemap !== undefined ) {
+
+			cubeMaps.delete( texture );
+			cubemap.dispose();
+
+		}
+
+	}
+
+	function onPMREMDispose( event ) {
+
+		const texture = event.target;
+
+		texture.removeEventListener( 'dispose', onPMREMDispose );
+
+		const pmrem = pmremMaps.get( texture );
+
+		if ( pmrem !== undefined ) {
+
+			pmremMaps.delete( texture );
+			pmrem.dispose();
+
+		}
+
+	}
+
+	function dispose() {
+
+		cubeMaps = new WeakMap();
+		pmremMaps = new WeakMap();
+
+		if ( pmremGenerator !== null ) {
+
+			pmremGenerator.dispose();
+			pmremGenerator = null;
+
+		}
+
+	}
+
+	return {
+		get: get,
+		dispose: dispose
+	};
+
+}
+
+function WebGLExtensions( gl ) {
+
+	const extensions = {};
+
+	function getExtension( name ) {
+
+		if ( extensions[ name ] !== undefined ) {
+
+			return extensions[ name ];
+
+		}
+
+		const extension = gl.getExtension( name );
+
+		extensions[ name ] = extension;
+
+		return extension;
+
+	}
+
+	return {
+
+		has: function ( name ) {
+
+			return getExtension( name ) !== null;
+
+		},
+
+		init: function () {
+
+			getExtension( 'EXT_color_buffer_float' );
+			getExtension( 'WEBGL_clip_cull_distance' );
+			getExtension( 'OES_texture_float_linear' );
+			getExtension( 'EXT_color_buffer_half_float' );
+			getExtension( 'WEBGL_multisampled_render_to_texture' );
+			getExtension( 'WEBGL_render_shared_exponent' );
+
+		},
+
+		get: function ( name ) {
+
+			const extension = getExtension( name );
+
+			if ( extension === null ) {
+
+				warnOnce( 'WebGLRenderer: ' + name + ' extension not supported.' );
+
+			}
+
+			return extension;
+
+		}
+
+	};
+
+}
+
+function WebGLGeometries( gl, attributes, info, bindingStates ) {
+
+	const geometries = {};
+	const wireframeAttributes = new WeakMap();
+
+	function onGeometryDispose( event ) {
+
+		const geometry = event.target;
+
+		if ( geometry.index !== null ) {
+
+			attributes.remove( geometry.index );
+
+		}
+
+		for ( const name in geometry.attributes ) {
+
+			attributes.remove( geometry.attributes[ name ] );
+
+		}
+
+		geometry.removeEventListener( 'dispose', onGeometryDispose );
+
+		delete geometries[ geometry.id ];
+
+		const attribute = wireframeAttributes.get( geometry );
+
+		if ( attribute ) {
+
+			attributes.remove( attribute );
+			wireframeAttributes.delete( geometry );
+
+		}
+
+		bindingStates.releaseStatesOfGeometry( geometry );
+
+		if ( geometry.isInstancedBufferGeometry === true ) {
+
+			delete geometry._maxInstanceCount;
+
+		}
+
+		//
+
+		info.memory.geometries --;
+
+	}
+
+	function get( object, geometry ) {
+
+		if ( geometries[ geometry.id ] === true ) return geometry;
+
+		geometry.addEventListener( 'dispose', onGeometryDispose );
+
+		geometries[ geometry.id ] = true;
+
+		info.memory.geometries ++;
+
+		return geometry;
+
+	}
+
+	function update( geometry ) {
+
+		const geometryAttributes = geometry.attributes;
+
+		// Updating index buffer in VAO now. See WebGLBindingStates.
+
+		for ( const name in geometryAttributes ) {
+
+			attributes.update( geometryAttributes[ name ], gl.ARRAY_BUFFER );
+
+		}
+
+	}
+
+	function updateWireframeAttribute( geometry ) {
+
+		const indices = [];
+
+		const geometryIndex = geometry.index;
+		const geometryPosition = geometry.attributes.position;
+		let version = 0;
+
+		if ( geometryPosition === undefined ) {
+
+			return;
+
+		}
+
+		if ( geometryIndex !== null ) {
+
+			const array = geometryIndex.array;
+			version = geometryIndex.version;
+
+			for ( let i = 0, l = array.length; i < l; i += 3 ) {
+
+				const a = array[ i + 0 ];
+				const b = array[ i + 1 ];
+				const c = array[ i + 2 ];
+
+				indices.push( a, b, b, c, c, a );
+
+			}
+
+		} else {
+
+			const array = geometryPosition.array;
+			version = geometryPosition.version;
+
+			for ( let i = 0, l = ( array.length / 3 ) - 1; i < l; i += 3 ) {
+
+				const a = i + 0;
+				const b = i + 1;
+				const c = i + 2;
+
+				indices.push( a, b, b, c, c, a );
+
+			}
+
+		}
+
+		// check whether a 32 bit or 16 bit buffer is required to store the indices
+		// account for PRIMITIVE_RESTART_FIXED_INDEX, #24565
+		const attribute = new ( geometryPosition.count >= 65535 ? Uint32BufferAttribute : Uint16BufferAttribute )( indices, 1 );
+		attribute.version = version;
+
+		// Updating index buffer in VAO now. See WebGLBindingStates
+
+		//
+
+		const previousAttribute = wireframeAttributes.get( geometry );
+
+		if ( previousAttribute ) attributes.remove( previousAttribute );
+
+		//
+
+		wireframeAttributes.set( geometry, attribute );
+
+	}
+
+	function getWireframeAttribute( geometry ) {
+
+		const currentAttribute = wireframeAttributes.get( geometry );
+
+		if ( currentAttribute ) {
+
+			const geometryIndex = geometry.index;
+
+			if ( geometryIndex !== null ) {
+
+				// if the attribute is obsolete, create a new one
+
+				if ( currentAttribute.version < geometryIndex.version ) {
+
+					updateWireframeAttribute( geometry );
+
+				}
+
+			}
+
+		} else {
+
+			updateWireframeAttribute( geometry );
+
+		}
+
+		return wireframeAttributes.get( geometry );
+
+	}
+
+	return {
+
+		get: get,
+		update: update,
+
+		getWireframeAttribute: getWireframeAttribute
+
+	};
+
+}
+
+function WebGLIndexedBufferRenderer( gl, extensions, info ) {
+
+	let mode;
+
+	function setMode( value ) {
+
+		mode = value;
+
+	}
+
+	let type, bytesPerElement;
+
+	function setIndex( value ) {
+
+		type = value.type;
+		bytesPerElement = value.bytesPerElement;
+
+	}
+
+	function render( start, count ) {
+
+		gl.drawElements( mode, count, type, start * bytesPerElement );
+
+		info.update( count, mode, 1 );
+
+	}
+
+	function renderInstances( start, count, primcount ) {
+
+		if ( primcount === 0 ) return;
+
+		gl.drawElementsInstanced( mode, count, type, start * bytesPerElement, primcount );
+
+		info.update( count, mode, primcount );
+
+	}
+
+	function renderMultiDraw( starts, counts, drawCount ) {
+
+		if ( drawCount === 0 ) return;
+
+		const extension = extensions.get( 'WEBGL_multi_draw' );
+		extension.multiDrawElementsWEBGL( mode, counts, 0, type, starts, 0, drawCount );
+
+		let elementCount = 0;
+		for ( let i = 0; i < drawCount; i ++ ) {
+
+			elementCount += counts[ i ];
+
+		}
+
+		info.update( elementCount, mode, 1 );
+
+
+	}
+
+	//
+
+	this.setMode = setMode;
+	this.setIndex = setIndex;
+	this.render = render;
+	this.renderInstances = renderInstances;
+	this.renderMultiDraw = renderMultiDraw;
+
+}
+
+function WebGLInfo( gl ) {
+
+	const memory = {
+		geometries: 0,
+		textures: 0
+	};
+
+	const render = {
+		frame: 0,
+		calls: 0,
+		triangles: 0,
+		points: 0,
+		lines: 0
+	};
+
+	function update( count, mode, instanceCount ) {
+
+		render.calls ++;
+
+		switch ( mode ) {
+
+			case gl.TRIANGLES:
+				render.triangles += instanceCount * ( count / 3 );
+				break;
+
+			case gl.LINES:
+				render.lines += instanceCount * ( count / 2 );
+				break;
+
+			case gl.LINE_STRIP:
+				render.lines += instanceCount * ( count - 1 );
+				break;
+
+			case gl.LINE_LOOP:
+				render.lines += instanceCount * count;
+				break;
+
+			case gl.POINTS:
+				render.points += instanceCount * count;
+				break;
+
+			default:
+				error( 'WebGLInfo: Unknown draw mode:', mode );
+				break;
+
+		}
+
+	}
+
+	function reset() {
+
+		render.calls = 0;
+		render.triangles = 0;
+		render.points = 0;
+		render.lines = 0;
+
+	}
+
+	return {
+		memory: memory,
+		render: render,
+		programs: null,
+		autoReset: true,
+		reset: reset,
+		update: update
+	};
+
+}
+
+function WebGLMorphtargets( gl, capabilities, textures ) {
+
+	const morphTextures = new WeakMap();
+	const morph = new Vector4();
+
+	function update( object, geometry, program ) {
+
+		const objectInfluences = object.morphTargetInfluences;
+
+		// the following encodes morph targets into an array of data textures. Each layer represents a single morph target.
+
+		const morphAttribute = geometry.morphAttributes.position || geometry.morphAttributes.normal || geometry.morphAttributes.color;
+		const morphTargetsCount = ( morphAttribute !== undefined ) ? morphAttribute.length : 0;
+
+		let entry = morphTextures.get( geometry );
+
+		if ( entry === undefined || entry.count !== morphTargetsCount ) {
+
+			if ( entry !== undefined ) entry.texture.dispose();
+
+			const hasMorphPosition = geometry.morphAttributes.position !== undefined;
+			const hasMorphNormals = geometry.morphAttributes.normal !== undefined;
+			const hasMorphColors = geometry.morphAttributes.color !== undefined;
+
+			const morphTargets = geometry.morphAttributes.position || [];
+			const morphNormals = geometry.morphAttributes.normal || [];
+			const morphColors = geometry.morphAttributes.color || [];
+
+			let vertexDataCount = 0;
+
+			if ( hasMorphPosition === true ) vertexDataCount = 1;
+			if ( hasMorphNormals === true ) vertexDataCount = 2;
+			if ( hasMorphColors === true ) vertexDataCount = 3;
+
+			let width = geometry.attributes.position.count * vertexDataCount;
+			let height = 1;
+
+			if ( width > capabilities.maxTextureSize ) {
+
+				height = Math.ceil( width / capabilities.maxTextureSize );
+				width = capabilities.maxTextureSize;
+
+			}
+
+			const buffer = new Float32Array( width * height * 4 * morphTargetsCount );
+
+			const texture = new DataArrayTexture( buffer, width, height, morphTargetsCount );
+			texture.type = FloatType;
+			texture.needsUpdate = true;
+
+			// fill buffer
+
+			const vertexDataStride = vertexDataCount * 4;
+
+			for ( let i = 0; i < morphTargetsCount; i ++ ) {
+
+				const morphTarget = morphTargets[ i ];
+				const morphNormal = morphNormals[ i ];
+				const morphColor = morphColors[ i ];
+
+				const offset = width * height * 4 * i;
+
+				for ( let j = 0; j < morphTarget.count; j ++ ) {
+
+					const stride = j * vertexDataStride;
+
+					if ( hasMorphPosition === true ) {
+
+						morph.fromBufferAttribute( morphTarget, j );
+
+						buffer[ offset + stride + 0 ] = morph.x;
+						buffer[ offset + stride + 1 ] = morph.y;
+						buffer[ offset + stride + 2 ] = morph.z;
+						buffer[ offset + stride + 3 ] = 0;
+
+					}
+
+					if ( hasMorphNormals === true ) {
+
+						morph.fromBufferAttribute( morphNormal, j );
+
+						buffer[ offset + stride + 4 ] = morph.x;
+						buffer[ offset + stride + 5 ] = morph.y;
+						buffer[ offset + stride + 6 ] = morph.z;
+						buffer[ offset + stride + 7 ] = 0;
+
+					}
+
+					if ( hasMorphColors === true ) {
+
+						morph.fromBufferAttribute( morphColor, j );
+
+						buffer[ offset + stride + 8 ] = morph.x;
+						buffer[ offset + stride + 9 ] = morph.y;
+						buffer[ offset + stride + 10 ] = morph.z;
+						buffer[ offset + stride + 11 ] = ( morphColor.itemSize === 4 ) ? morph.w : 1;
+
+					}
+
+				}
+
+			}
+
+			entry = {
+				count: morphTargetsCount,
+				texture: texture,
+				size: new Vector2( width, height )
+			};
+
+			morphTextures.set( geometry, entry );
+
+			function disposeTexture() {
+
+				texture.dispose();
+
+				morphTextures.delete( geometry );
+
+				geometry.removeEventListener( 'dispose', disposeTexture );
+
+			}
+
+			geometry.addEventListener( 'dispose', disposeTexture );
+
+		}
+
+		//
+		if ( object.isInstancedMesh === true && object.morphTexture !== null ) {
+
+			program.getUniforms().setValue( gl, 'morphTexture', object.morphTexture, textures );
+
+		} else {
+
+			let morphInfluencesSum = 0;
+
+			for ( let i = 0; i < objectInfluences.length; i ++ ) {
+
+				morphInfluencesSum += objectInfluences[ i ];
+
+			}
+
+			const morphBaseInfluence = geometry.morphTargetsRelative ? 1 : 1 - morphInfluencesSum;
+
+
+			program.getUniforms().setValue( gl, 'morphTargetBaseInfluence', morphBaseInfluence );
+			program.getUniforms().setValue( gl, 'morphTargetInfluences', objectInfluences );
+
+		}
+
+		program.getUniforms().setValue( gl, 'morphTargetsTexture', entry.texture, textures );
+		program.getUniforms().setValue( gl, 'morphTargetsTextureSize', entry.size );
+
+	}
+
+	return {
+
+		update: update
+
+	};
+
+}
+
+function WebGLObjects( gl, geometries, attributes, bindingStates, info ) {
+
+	let updateMap = new WeakMap();
+
+	function update( object ) {
+
+		const frame = info.render.frame;
+
+		const geometry = object.geometry;
+		const buffergeometry = geometries.get( object, geometry );
+
+		// Update once per frame
+
+		if ( updateMap.get( buffergeometry ) !== frame ) {
+
+			geometries.update( buffergeometry );
+
+			updateMap.set( buffergeometry, frame );
+
+		}
+
+		if ( object.isInstancedMesh ) {
+
+			if ( object.hasEventListener( 'dispose', onInstancedMeshDispose ) === false ) {
+
+				object.addEventListener( 'dispose', onInstancedMeshDispose );
+
+			}
+
+			if ( updateMap.get( object ) !== frame ) {
+
+				attributes.update( object.instanceMatrix, gl.ARRAY_BUFFER );
+
+				if ( object.instanceColor !== null ) {
+
+					attributes.update( object.instanceColor, gl.ARRAY_BUFFER );
+
+				}
+
+				updateMap.set( object, frame );
+
+			}
+
+		}
+
+		if ( object.isSkinnedMesh ) {
+
+			const skeleton = object.skeleton;
+
+			if ( updateMap.get( skeleton ) !== frame ) {
+
+				skeleton.update();
+
+				updateMap.set( skeleton, frame );
+
+			}
+
+		}
+
+		return buffergeometry;
+
+	}
+
+	function dispose() {
+
+		updateMap = new WeakMap();
+
+	}
+
+	function onInstancedMeshDispose( event ) {
+
+		const instancedMesh = event.target;
+
+		instancedMesh.removeEventListener( 'dispose', onInstancedMeshDispose );
+
+		bindingStates.releaseStatesOfObject( instancedMesh );
+
+		attributes.remove( instancedMesh.instanceMatrix );
+
+		if ( instancedMesh.instanceColor !== null ) attributes.remove( instancedMesh.instanceColor );
+
+	}
+
+	return {
+
+		update: update,
+		dispose: dispose
+
+	};
+
+}
+
+const toneMappingMap = {
+	[ LinearToneMapping ]: 'LINEAR_TONE_MAPPING',
+	[ ReinhardToneMapping ]: 'REINHARD_TONE_MAPPING',
+	[ CineonToneMapping ]: 'CINEON_TONE_MAPPING',
+	[ ACESFilmicToneMapping ]: 'ACES_FILMIC_TONE_MAPPING',
+	[ AgXToneMapping ]: 'AGX_TONE_MAPPING',
+	[ NeutralToneMapping ]: 'NEUTRAL_TONE_MAPPING',
+	[ CustomToneMapping ]: 'CUSTOM_TONE_MAPPING'
+};
+
+function WebGLOutput( type, width, height, antialias, depth, stencil ) {
+
+	// render target for the scene pass (potentially multisampled)
+	const targetScene = new WebGLRenderTarget( width, height, {
+		type: type,
+		depthBuffer: depth,
+		stencilBuffer: stencil,
+		samples: antialias ? 4 : 0,
+		storeMultisampledDepthBuffer: false,
+		storeMultisampledStencilBuffer: false,
+		resolveDepthBuffer: false,
+		resolveStencilBuffer: false
+	} );
+
+	// single-sampled ping-pong buffers for post-processing effects, allocated on demand
+	let targetA = null;
+	let targetB = null;
+
+	// create fullscreen triangle geometry
+	const geometry = new BufferGeometry();
+	geometry.setAttribute( 'position', new Float32BufferAttribute( [ -1, 3, 0, -1, -1, 0, 3, -1, 0 ], 3 ) );
+	geometry.setAttribute( 'uv', new Float32BufferAttribute( [ 0, 2, 0, 0, 2, 0 ], 2 ) );
+
+	// create output material with tone mapping support
+	const material = new RawShaderMaterial( {
+		uniforms: {
+			tDiffuse: { value: null }
+		},
+		vertexShader: /* glsl */`
+			precision highp float;
+
+			uniform mat4 modelViewMatrix;
+			uniform mat4 projectionMatrix;
+
+			attribute vec3 position;
+			attribute vec2 uv;
+
+			varying vec2 vUv;
+
+			void main() {
+				vUv = uv;
+				gl_Position = projectionMatrix * modelViewMatrix * vec4( position, 1.0 );
+			}`,
+		fragmentShader: /* glsl */`
+			precision highp float;
+
+			uniform sampler2D tDiffuse;
+
+			varying vec2 vUv;
+
+			#include <tonemapping_pars_fragment>
+			#include <colorspace_pars_fragment>
+
+			void main() {
+				gl_FragColor = texture2D( tDiffuse, vUv );
+
+				#ifdef LINEAR_TONE_MAPPING
+					gl_FragColor.rgb = LinearToneMapping( gl_FragColor.rgb );
+				#elif defined( REINHARD_TONE_MAPPING )
+					gl_FragColor.rgb = ReinhardToneMapping( gl_FragColor.rgb );
+				#elif defined( CINEON_TONE_MAPPING )
+					gl_FragColor.rgb = CineonToneMapping( gl_FragColor.rgb );
+				#elif defined( ACES_FILMIC_TONE_MAPPING )
+					gl_FragColor.rgb = ACESFilmicToneMapping( gl_FragColor.rgb );
+				#elif defined( AGX_TONE_MAPPING )
+					gl_FragColor.rgb = AgXToneMapping( gl_FragColor.rgb );
+				#elif defined( NEUTRAL_TONE_MAPPING )
+					gl_FragColor.rgb = NeutralToneMapping( gl_FragColor.rgb );
+				#elif defined( CUSTOM_TONE_MAPPING )
+					gl_FragColor.rgb = CustomToneMapping( gl_FragColor.rgb );
+				#endif
+
+				#ifdef SRGB_TRANSFER
+					gl_FragColor = sRGBTransferOETF( gl_FragColor );
+				#endif
+			}`,
+		depthTest: false,
+		depthWrite: false
+	} );
+
+	const mesh = new Mesh( geometry, material );
+	const camera = new OrthographicCamera( -1, 1, 1, -1, 0, 1 );
+
+	let _outputColorSpace = null;
+	let _outputToneMapping = null;
+	let _isCompositing = false;
+	let _savedToneMapping;
+	let _savedRenderTarget = null;
+	let _effects = [];
+	let _hasRenderPass = false;
+
+	this.setSize = function ( width, height ) {
+
+		targetScene.setSize( width, height );
+
+		if ( targetA !== null ) targetA.setSize( width, height );
+		if ( targetB !== null ) targetB.setSize( width, height );
+
+		for ( let i = 0; i < _effects.length; i ++ ) {
+
+			const effect = _effects[ i ];
+			if ( effect.setSize ) effect.setSize( width, height );
+
+		}
+
+	};
+
+	this.setEffects = function ( effects ) {
+
+		_effects = effects;
+		_hasRenderPass = _effects.length > 0 && _effects[ 0 ].isRenderPass === true;
+
+		const width = targetScene.width;
+		const height = targetScene.height;
+
+		if ( _effects.length > 0 && targetA === null ) {
+
+			targetA = new WebGLRenderTarget( width, height, { type: HalfFloatType, depthBuffer: false, stencilBuffer: false } );
+			targetB = new WebGLRenderTarget( width, height, { type: HalfFloatType, depthBuffer: false, stencilBuffer: false } );
+
+		}
+
+		for ( let i = 0; i < _effects.length; i ++ ) {
+
+			const effect = _effects[ i ];
+			if ( effect.setSize ) effect.setSize( width, height );
+
+		}
+
+	};
+
+	this.begin = function ( renderer, renderTarget ) {
+
+		// Don't begin during compositing phase (post-processing effects call render())
+		if ( _isCompositing ) return false;
+
+		if ( renderer.toneMapping === NoToneMapping && _effects.length === 0 ) return false;
+
+		_savedRenderTarget = renderTarget;
+
+		// resize internal buffers to match render target (e.g. XR resolution)
+		if ( renderTarget !== null ) {
+
+			const width = renderTarget.width;
+			const height = renderTarget.height;
+
+			if ( targetScene.width !== width || targetScene.height !== height ) {
+
+				this.setSize( width, height );
+
+			}
+
+		}
+
+		// if the first effect is a RenderPass, it renders the scene itself (see end())
+		if ( _hasRenderPass === false ) {
+
+			renderer.setRenderTarget( targetScene );
+
+		}
+
+		// disable tone mapping during render - it will be applied in end()
+		_savedToneMapping = renderer.toneMapping;
+		renderer.toneMapping = NoToneMapping;
+
+		return true;
+
+	};
+
+	this.hasRenderPass = function () {
+
+		return _hasRenderPass;
+
+	};
+
+	this.end = function ( renderer, deltaTime ) {
+
+		// restore tone mapping
+		renderer.toneMapping = _savedToneMapping;
+
+		_isCompositing = true;
+
+		// run post-processing effects - the scene lives in the multisampled targetScene,
+		// effects ping-pong between the single-sampled targetA and targetB
+		let readBuffer = targetScene;
+		let writeBuffer = targetA;
+
+		for ( let i = 0; i < _effects.length; i ++ ) {
+
+			const effect = _effects[ i ];
+
+			if ( effect.enabled === false ) continue;
+
+			effect.render( renderer, writeBuffer, readBuffer, deltaTime );
+
+			if ( effect.needsSwap !== false ) {
+
+				// keep targetScene out of the rotation so only the scene pass is multisampled
+				readBuffer = writeBuffer;
+				writeBuffer = ( writeBuffer === targetA ) ? targetB : targetA;
+
+			}
+
+		}
+
+		// update output material defines if settings changed
+		if ( _outputColorSpace !== renderer.outputColorSpace || _outputToneMapping !== renderer.toneMapping ) {
+
+			_outputColorSpace = renderer.outputColorSpace;
+			_outputToneMapping = renderer.toneMapping;
+
+			material.defines = {};
+
+			if ( ColorManagement.getTransfer( _outputColorSpace ) === SRGBTransfer ) material.defines.SRGB_TRANSFER = '';
+
+			const toneMapping = toneMappingMap[ _outputToneMapping ];
+			if ( toneMapping ) material.defines[ toneMapping ] = '';
+
+			material.needsUpdate = true;
+
+		}
+
+		// final output to canvas (or XR render target)
+		material.uniforms.tDiffuse.value = readBuffer.texture;
+		renderer.setRenderTarget( _savedRenderTarget );
+		renderer.render( mesh, camera );
+
+		_savedRenderTarget = null;
+		_isCompositing = false;
+
+	};
+
+	this.isCompositing = function () {
+
+		return _isCompositing;
+
+	};
+
+	this.dispose = function () {
+
+		targetScene.dispose();
+
+		if ( targetA !== null ) targetA.dispose();
+		if ( targetB !== null ) targetB.dispose();
+
+		geometry.dispose();
+		material.dispose();
+
+	};
+
+}
+
+/**
+ * Uniforms of a program.
+ * Those form a tree structure with a special top-level container for the root,
+ * which you get by calling 'new WebGLUniforms( gl, program )'.
+ *
+ *
+ * Properties of inner nodes including the top-level container:
+ *
+ * .seq - array of nested uniforms
+ * .map - nested uniforms by name
+ *
+ *
+ * Methods of all nodes except the top-level container:
+ *
+ * .setValue( gl, value, [textures] )
+ *
+ * 		uploads a uniform value(s)
+ *  	the 'textures' parameter is needed for sampler uniforms
+ *
+ *
+ * Static methods of the top-level container (textures factorizations):
+ *
+ * .upload( gl, seq, values, textures )
+ *
+ * 		sets uniforms in 'seq' to 'values[id].value'
+ *
+ * .seqWithValue( seq, values ) : filteredSeq
+ *
+ * 		filters 'seq' entries with corresponding entry in values
+ *
+ *
+ * Methods of the top-level container (textures factorizations):
+ *
+ * .setValue( gl, name, value, textures )
+ *
+ * 		sets uniform with  name 'name' to 'value'
+ *
+ * .setOptional( gl, obj, prop )
+ *
+ * 		like .set for an optional property of the object
+ *
+ */
+
+
+const emptyTexture = /*@__PURE__*/ new Texture();
+
+const emptyShadowTexture = /*@__PURE__*/ new DepthTexture( 1, 1 );
+
+const emptyArrayTexture = /*@__PURE__*/ new DataArrayTexture();
+const empty3dTexture = /*@__PURE__*/ new Data3DTexture();
+const emptyCubeTexture = /*@__PURE__*/ new CubeTexture();
+
+// --- Utilities ---
+
+// Array Caches (provide typed arrays for temporary by size)
+
+const arrayCacheF32 = [];
+const arrayCacheI32 = [];
+
+// Float32Array caches used for uploading Matrix uniforms
+
+const mat4array = new Float32Array( 16 );
+const mat3array = new Float32Array( 9 );
+const mat2array = new Float32Array( 4 );
+
+// Flattening for arrays of vectors and matrices
+
+function flatten( array, nBlocks, blockSize ) {
+
+	const firstElem = array[ 0 ];
+
+	if ( firstElem <= 0 || firstElem > 0 ) return array;
+	// unoptimized: ! isNaN( firstElem )
+	// see http://jacksondunstan.com/articles/983
+
+	const n = nBlocks * blockSize;
+	let r = arrayCacheF32[ n ];
+
+	if ( r === undefined ) {
+
+		r = new Float32Array( n );
+		arrayCacheF32[ n ] = r;
+
+	}
+
+	if ( nBlocks !== 0 ) {
+
+		firstElem.toArray( r, 0 );
+
+		for ( let i = 1, offset = 0; i !== nBlocks; ++ i ) {
+
+			offset += blockSize;
+			array[ i ].toArray( r, offset );
+
+		}
+
+	}
+
+	return r;
+
+}
+
+function arraysEqual( a, b ) {
+
+	if ( a.length !== b.length ) return false;
+
+	for ( let i = 0, l = a.length; i < l; i ++ ) {
+
+		if ( a[ i ] !== b[ i ] ) return false;
+
+	}
+
+	return true;
+
+}
+
+function copyArray( a, b ) {
+
+	for ( let i = 0, l = b.length; i < l; i ++ ) {
+
+		a[ i ] = b[ i ];
+
+	}
+
+}
+
+// Texture unit allocation
+
+function allocTexUnits( textures, n ) {
+
+	let r = arrayCacheI32[ n ];
+
+	if ( r === undefined ) {
+
+		r = new Int32Array( n );
+		arrayCacheI32[ n ] = r;
+
+	}
+
+	for ( let i = 0; i !== n; ++ i ) {
+
+		r[ i ] = textures.allocateTextureUnit();
+
+	}
+
+	return r;
+
+}
+
+// --- Setters ---
+
+// Note: Defining these methods externally, because they come in a bunch
+// and this way their names minify.
+
+// Single scalar
+
+function setValueV1f( gl, v ) {
+
+	const cache = this.cache;
+
+	if ( cache[ 0 ] === v ) return;
+
+	gl.uniform1f( this.addr, v );
+
+	cache[ 0 ] = v;
+
+}
+
+// Single float vector (from flat array or THREE.VectorN)
+
+function setValueV2f( gl, v ) {
+
+	const cache = this.cache;
+
+	if ( v.x !== undefined ) {
+
+		if ( cache[ 0 ] !== v.x || cache[ 1 ] !== v.y ) {
+
+			gl.uniform2f( this.addr, v.x, v.y );
+
+			cache[ 0 ] = v.x;
+			cache[ 1 ] = v.y;
+
+		}
+
+	} else {
+
+		if ( arraysEqual( cache, v ) ) return;
+
+		gl.uniform2fv( this.addr, v );
+
+		copyArray( cache, v );
+
+	}
+
+}
+
+function setValueV3f( gl, v ) {
+
+	const cache = this.cache;
+
+	if ( v.x !== undefined ) {
+
+		if ( cache[ 0 ] !== v.x || cache[ 1 ] !== v.y || cache[ 2 ] !== v.z ) {
+
+			gl.uniform3f( this.addr, v.x, v.y, v.z );
+
+			cache[ 0 ] = v.x;
+			cache[ 1 ] = v.y;
+			cache[ 2 ] = v.z;
+
+		}
+
+	} else if ( v.r !== undefined ) {
+
+		if ( cache[ 0 ] !== v.r || cache[ 1 ] !== v.g || cache[ 2 ] !== v.b ) {
+
+			gl.uniform3f( this.addr, v.r, v.g, v.b );
+
+			cache[ 0 ] = v.r;
+			cache[ 1 ] = v.g;
+			cache[ 2 ] = v.b;
+
+		}
+
+	} else {
+
+		if ( arraysEqual( cache, v ) ) return;
+
+		gl.uniform3fv( this.addr, v );
+
+		copyArray( cache, v );
+
+	}
+
+}
+
+function setValueV4f( gl, v ) {
+
+	const cache = this.cache;
+
+	if ( v.x !== undefined ) {
+
+		if ( cache[ 0 ] !== v.x || cache[ 1 ] !== v.y || cache[ 2 ] !== v.z || cache[ 3 ] !== v.w ) {
+
+			gl.uniform4f( this.addr, v.x, v.y, v.z, v.w );
+
+			cache[ 0 ] = v.x;
+			cache[ 1 ] = v.y;
+			cache[ 2 ] = v.z;
+			cache[ 3 ] = v.w;
+
+		}
+
+	} else {
+
+		if ( arraysEqual( cache, v ) ) return;
+
+		gl.uniform4fv( this.addr, v );
+
+		copyArray( cache, v );
+
+	}
+
+}
+
+// Single matrix (from flat array or THREE.MatrixN)
+
+function setValueM2( gl, v ) {
+
+	const cache = this.cache;
+	const elements = v.elements;
+
+	if ( elements === undefined ) {
+
+		if ( arraysEqual( cache, v ) ) return;
+
+		gl.uniformMatrix2fv( this.addr, false, v );
+
+		copyArray( cache, v );
+
+	} else {
+
+		if ( arraysEqual( cache, elements ) ) return;
+
+		mat2array.set( elements );
+
+		gl.uniformMatrix2fv( this.addr, false, mat2array );
+
+		copyArray( cache, elements );
+
+	}
+
+}
+
+function setValueM3( gl, v ) {
+
+	const cache = this.cache;
+	const elements = v.elements;
+
+	if ( elements === undefined ) {
+
+		if ( arraysEqual( cache, v ) ) return;
+
+		gl.uniformMatrix3fv( this.addr, false, v );
+
+		copyArray( cache, v );
+
+	} else {
+
+		if ( arraysEqual( cache, elements ) ) return;
+
+		mat3array.set( elements );
+
+		gl.uniformMatrix3fv( this.addr, false, mat3array );
+
+		copyArray( cache, elements );
+
+	}
+
+}
+
+function setValueM4( gl, v ) {
+
+	const cache = this.cache;
+	const elements = v.elements;
+
+	if ( elements === undefined ) {
+
+		if ( arraysEqual( cache, v ) ) return;
+
+		gl.uniformMatrix4fv( this.addr, false, v );
+
+		copyArray( cache, v );
+
+	} else {
+
+		if ( arraysEqual( cache, elements ) ) return;
+
+		mat4array.set( elements );
+
+		gl.uniformMatrix4fv( this.addr, false, mat4array );
+
+		copyArray( cache, elements );
+
+	}
+
+}
+
+// Single integer / boolean
+
+function setValueV1i( gl, v ) {
+
+	const cache = this.cache;
+
+	if ( cache[ 0 ] === v ) return;
+
+	gl.uniform1i( this.addr, v );
+
+	cache[ 0 ] = v;
+
+}
+
+// Single integer / boolean vector (from flat array or THREE.VectorN)
+
+function setValueV2i( gl, v ) {
+
+	const cache = this.cache;
+
+	if ( v.x !== undefined ) {
+
+		if ( cache[ 0 ] !== v.x || cache[ 1 ] !== v.y ) {
+
+			gl.uniform2i( this.addr, v.x, v.y );
+
+			cache[ 0 ] = v.x;
+			cache[ 1 ] = v.y;
+
+		}
+
+	} else {
+
+		if ( arraysEqual( cache, v ) ) return;
+
+		gl.uniform2iv( this.addr, v );
+
+		copyArray( cache, v );
+
+	}
+
+}
+
+function setValueV3i( gl, v ) {
+
+	const cache = this.cache;
+
+	if ( v.x !== undefined ) {
+
+		if ( cache[ 0 ] !== v.x || cache[ 1 ] !== v.y || cache[ 2 ] !== v.z ) {
+
+			gl.uniform3i( this.addr, v.x, v.y, v.z );
+
+			cache[ 0 ] = v.x;
+			cache[ 1 ] = v.y;
+			cache[ 2 ] = v.z;
+
+		}
+
+	} else {
+
+		if ( arraysEqual( cache, v ) ) return;
+
+		gl.uniform3iv( this.addr, v );
+
+		copyArray( cache, v );
+
+	}
+
+}
+
+function setValueV4i( gl, v ) {
+
+	const cache = this.cache;
+
+	if ( v.x !== undefined ) {
+
+		if ( cache[ 0 ] !== v.x || cache[ 1 ] !== v.y || cache[ 2 ] !== v.z || cache[ 3 ] !== v.w ) {
+
+			gl.uniform4i( this.addr, v.x, v.y, v.z, v.w );
+
+			cache[ 0 ] = v.x;
+			cache[ 1 ] = v.y;
+			cache[ 2 ] = v.z;
+			cache[ 3 ] = v.w;
+
+		}
+
+	} else {
+
+		if ( arraysEqual( cache, v ) ) return;
+
+		gl.uniform4iv( this.addr, v );
+
+		copyArray( cache, v );
+
+	}
+
+}
+
+// Single unsigned integer
+
+function setValueV1ui( gl, v ) {
+
+	const cache = this.cache;
+
+	if ( cache[ 0 ] === v ) return;
+
+	gl.uniform1ui( this.addr, v );
+
+	cache[ 0 ] = v;
+
+}
+
+// Single unsigned integer vector (from flat array or THREE.VectorN)
+
+function setValueV2ui( gl, v ) {
+
+	const cache = this.cache;
+
+	if ( v.x !== undefined ) {
+
+		if ( cache[ 0 ] !== v.x || cache[ 1 ] !== v.y ) {
+
+			gl.uniform2ui( this.addr, v.x, v.y );
+
+			cache[ 0 ] = v.x;
+			cache[ 1 ] = v.y;
+
+		}
+
+	} else {
+
+		if ( arraysEqual( cache, v ) ) return;
+
+		gl.uniform2uiv( this.addr, v );
+
+		copyArray( cache, v );
+
+	}
+
+}
+
+function setValueV3ui( gl, v ) {
+
+	const cache = this.cache;
+
+	if ( v.x !== undefined ) {
+
+		if ( cache[ 0 ] !== v.x || cache[ 1 ] !== v.y || cache[ 2 ] !== v.z ) {
+
+			gl.uniform3ui( this.addr, v.x, v.y, v.z );
+
+			cache[ 0 ] = v.x;
+			cache[ 1 ] = v.y;
+			cache[ 2 ] = v.z;
+
+		}
+
+	} else {
+
+		if ( arraysEqual( cache, v ) ) return;
+
+		gl.uniform3uiv( this.addr, v );
+
+		copyArray( cache, v );
+
+	}
+
+}
+
+function setValueV4ui( gl, v ) {
+
+	const cache = this.cache;
+
+	if ( v.x !== undefined ) {
+
+		if ( cache[ 0 ] !== v.x || cache[ 1 ] !== v.y || cache[ 2 ] !== v.z || cache[ 3 ] !== v.w ) {
+
+			gl.uniform4ui( this.addr, v.x, v.y, v.z, v.w );
+
+			cache[ 0 ] = v.x;
+			cache[ 1 ] = v.y;
+			cache[ 2 ] = v.z;
+			cache[ 3 ] = v.w;
+
+		}
+
+	} else {
+
+		if ( arraysEqual( cache, v ) ) return;
+
+		gl.uniform4uiv( this.addr, v );
+
+		copyArray( cache, v );
+
+	}
+
+}
+
+
+// Single texture (2D / Cube)
+
+function setValueT1( gl, v, textures ) {
+
+	const cache = this.cache;
+	const unit = textures.allocateTextureUnit();
+
+	if ( cache[ 0 ] !== unit ) {
+
+		gl.uniform1i( this.addr, unit );
+		cache[ 0 ] = unit;
+
+	}
+
+	let emptyTexture2D;
+
+	if ( this.type === gl.SAMPLER_2D_SHADOW ) {
+
+		emptyShadowTexture.compareFunction = textures.isReversedDepthBuffer() ? GreaterEqualCompare : LessEqualCompare;
+		emptyTexture2D = emptyShadowTexture;
+
+	} else {
+
+		emptyTexture2D = emptyTexture;
+
+	}
+
+	textures.setTexture2D( v || emptyTexture2D, unit );
+
+}
+
+function setValueT3D1( gl, v, textures ) {
+
+	const cache = this.cache;
+	const unit = textures.allocateTextureUnit();
+
+	if ( cache[ 0 ] !== unit ) {
+
+		gl.uniform1i( this.addr, unit );
+		cache[ 0 ] = unit;
+
+	}
+
+	textures.setTexture3D( v || empty3dTexture, unit );
+
+}
+
+function setValueT6( gl, v, textures ) {
+
+	const cache = this.cache;
+	const unit = textures.allocateTextureUnit();
+
+	if ( cache[ 0 ] !== unit ) {
+
+		gl.uniform1i( this.addr, unit );
+		cache[ 0 ] = unit;
+
+	}
+
+	textures.setTextureCube( v || emptyCubeTexture, unit );
+
+}
+
+function setValueT2DArray1( gl, v, textures ) {
+
+	const cache = this.cache;
+	const unit = textures.allocateTextureUnit();
+
+	if ( cache[ 0 ] !== unit ) {
+
+		gl.uniform1i( this.addr, unit );
+		cache[ 0 ] = unit;
+
+	}
+
+	textures.setTexture2DArray( v || emptyArrayTexture, unit );
+
+}
+
+// Helper to pick the right setter for the singular case
+
+function getSingularSetter( type ) {
+
+	switch ( type ) {
+
+		case 0x1406: return setValueV1f; // FLOAT
+		case 0x8b50: return setValueV2f; // _VEC2
+		case 0x8b51: return setValueV3f; // _VEC3
+		case 0x8b52: return setValueV4f; // _VEC4
+
+		case 0x8b5a: return setValueM2; // _MAT2
+		case 0x8b5b: return setValueM3; // _MAT3
+		case 0x8b5c: return setValueM4; // _MAT4
+
+		case 0x1404: case 0x8b56: return setValueV1i; // INT, BOOL
+		case 0x8b53: case 0x8b57: return setValueV2i; // _VEC2
+		case 0x8b54: case 0x8b58: return setValueV3i; // _VEC3
+		case 0x8b55: case 0x8b59: return setValueV4i; // _VEC4
+
+		case 0x1405: return setValueV1ui; // UINT
+		case 0x8dc6: return setValueV2ui; // _VEC2
+		case 0x8dc7: return setValueV3ui; // _VEC3
+		case 0x8dc8: return setValueV4ui; // _VEC4
+
+		case 0x8b5e: // SAMPLER_2D
+		case 0x8d66: // SAMPLER_EXTERNAL_OES
+		case 0x8dca: // INT_SAMPLER_2D
+		case 0x8dd2: // UNSIGNED_INT_SAMPLER_2D
+		case 0x8b62: // SAMPLER_2D_SHADOW
+			return setValueT1;
+
+		case 0x8b5f: // SAMPLER_3D
+		case 0x8dcb: // INT_SAMPLER_3D
+		case 0x8dd3: // UNSIGNED_INT_SAMPLER_3D
+			return setValueT3D1;
+
+		case 0x8b60: // SAMPLER_CUBE
+		case 0x8dcc: // INT_SAMPLER_CUBE
+		case 0x8dd4: // UNSIGNED_INT_SAMPLER_CUBE
+		case 0x8dc5: // SAMPLER_CUBE_SHADOW
+			return setValueT6;
+
+		case 0x8dc1: // SAMPLER_2D_ARRAY
+		case 0x8dcf: // INT_SAMPLER_2D_ARRAY
+		case 0x8dd7: // UNSIGNED_INT_SAMPLER_2D_ARRAY
+		case 0x8dc4: // SAMPLER_2D_ARRAY_SHADOW
+			return setValueT2DArray1;
+
+	}
+
+}
+
+
+// Array of scalars
+
+function setValueV1fArray( gl, v ) {
+
+	gl.uniform1fv( this.addr, v );
+
+}
+
+// Array of vectors (from flat array or array of THREE.VectorN)
+
+function setValueV2fArray( gl, v ) {
+
+	const data = flatten( v, this.size, 2 );
+
+	gl.uniform2fv( this.addr, data );
+
+}
+
+function setValueV3fArray( gl, v ) {
+
+	const data = flatten( v, this.size, 3 );
+
+	gl.uniform3fv( this.addr, data );
+
+}
+
+function setValueV4fArray( gl, v ) {
+
+	const data = flatten( v, this.size, 4 );
+
+	gl.uniform4fv( this.addr, data );
+
+}
+
+// Array of matrices (from flat array or array of THREE.MatrixN)
+
+function setValueM2Array( gl, v ) {
+
+	const data = flatten( v, this.size, 4 );
+
+	gl.uniformMatrix2fv( this.addr, false, data );
+
+}
+
+function setValueM3Array( gl, v ) {
+
+	const data = flatten( v, this.size, 9 );
+
+	gl.uniformMatrix3fv( this.addr, false, data );
+
+}
+
+function setValueM4Array( gl, v ) {
+
+	const data = flatten( v, this.size, 16 );
+
+	gl.uniformMatrix4fv( this.addr, false, data );
+
+}
+
+// Array of integer / boolean
+
+function setValueV1iArray( gl, v ) {
+
+	gl.uniform1iv( this.addr, v );
+
+}
+
+// Array of integer / boolean vectors (from flat array)
+
+function setValueV2iArray( gl, v ) {
+
+	gl.uniform2iv( this.addr, v );
+
+}
+
+function setValueV3iArray( gl, v ) {
+
+	gl.uniform3iv( this.addr, v );
+
+}
+
+function setValueV4iArray( gl, v ) {
+
+	gl.uniform4iv( this.addr, v );
+
+}
+
+// Array of unsigned integer
+
+function setValueV1uiArray( gl, v ) {
+
+	gl.uniform1uiv( this.addr, v );
+
+}
+
+// Array of unsigned integer vectors (from flat array)
+
+function setValueV2uiArray( gl, v ) {
+
+	gl.uniform2uiv( this.addr, v );
+
+}
+
+function setValueV3uiArray( gl, v ) {
+
+	gl.uniform3uiv( this.addr, v );
+
+}
+
+function setValueV4uiArray( gl, v ) {
+
+	gl.uniform4uiv( this.addr, v );
+
+}
+
+
+// Array of textures (2D / 3D / Cube / 2DArray)
+
+function setValueT1Array( gl, v, textures ) {
+
+	const cache = this.cache;
+
+	const n = v.length;
+
+	const units = allocTexUnits( textures, n );
+
+	if ( ! arraysEqual( cache, units ) ) {
+
+		gl.uniform1iv( this.addr, units );
+
+		copyArray( cache, units );
+
+	}
+
+	let emptyTexture2D;
+
+	if ( this.type === gl.SAMPLER_2D_SHADOW ) {
+
+		emptyTexture2D = emptyShadowTexture;
+
+	} else {
+
+		emptyTexture2D = emptyTexture;
+
+	}
+
+	for ( let i = 0; i !== n; ++ i ) {
+
+		textures.setTexture2D( v[ i ] || emptyTexture2D, units[ i ] );
+
+	}
+
+}
+
+function setValueT3DArray( gl, v, textures ) {
+
+	const cache = this.cache;
+
+	const n = v.length;
+
+	const units = allocTexUnits( textures, n );
+
+	if ( ! arraysEqual( cache, units ) ) {
+
+		gl.uniform1iv( this.addr, units );
+
+		copyArray( cache, units );
+
+	}
+
+	for ( let i = 0; i !== n; ++ i ) {
+
+		textures.setTexture3D( v[ i ] || empty3dTexture, units[ i ] );
+
+	}
+
+}
+
+function setValueT6Array( gl, v, textures ) {
+
+	const cache = this.cache;
+
+	const n = v.length;
+
+	const units = allocTexUnits( textures, n );
+
+	if ( ! arraysEqual( cache, units ) ) {
+
+		gl.uniform1iv( this.addr, units );
+
+		copyArray( cache, units );
+
+	}
+
+	for ( let i = 0; i !== n; ++ i ) {
+
+		textures.setTextureCube( v[ i ] || emptyCubeTexture, units[ i ] );
+
+	}
+
+}
+
+function setValueT2DArrayArray( gl, v, textures ) {
+
+	const cache = this.cache;
+
+	const n = v.length;
+
+	const units = allocTexUnits( textures, n );
+
+	if ( ! arraysEqual( cache, units ) ) {
+
+		gl.uniform1iv( this.addr, units );
+
+		copyArray( cache, units );
+
+	}
+
+	for ( let i = 0; i !== n; ++ i ) {
+
+		textures.setTexture2DArray( v[ i ] || emptyArrayTexture, units[ i ] );
+
+	}
+
+}
+
+
+// Helper to pick the right setter for a pure (bottom-level) array
+
+function getPureArraySetter( type ) {
+
+	switch ( type ) {
+
+		case 0x1406: return setValueV1fArray; // FLOAT
+		case 0x8b50: return setValueV2fArray; // _VEC2
+		case 0x8b51: return setValueV3fArray; // _VEC3
+		case 0x8b52: return setValueV4fArray; // _VEC4
+
+		case 0x8b5a: return setValueM2Array; // _MAT2
+		case 0x8b5b: return setValueM3Array; // _MAT3
+		case 0x8b5c: return setValueM4Array; // _MAT4
+
+		case 0x1404: case 0x8b56: return setValueV1iArray; // INT, BOOL
+		case 0x8b53: case 0x8b57: return setValueV2iArray; // _VEC2
+		case 0x8b54: case 0x8b58: return setValueV3iArray; // _VEC3
+		case 0x8b55: case 0x8b59: return setValueV4iArray; // _VEC4
+
+		case 0x1405: return setValueV1uiArray; // UINT
+		case 0x8dc6: return setValueV2uiArray; // _VEC2
+		case 0x8dc7: return setValueV3uiArray; // _VEC3
+		case 0x8dc8: return setValueV4uiArray; // _VEC4
+
+		case 0x8b5e: // SAMPLER_2D
+		case 0x8d66: // SAMPLER_EXTERNAL_OES
+		case 0x8dca: // INT_SAMPLER_2D
+		case 0x8dd2: // UNSIGNED_INT_SAMPLER_2D
+		case 0x8b62: // SAMPLER_2D_SHADOW
+			return setValueT1Array;
+
+		case 0x8b5f: // SAMPLER_3D
+		case 0x8dcb: // INT_SAMPLER_3D
+		case 0x8dd3: // UNSIGNED_INT_SAMPLER_3D
+			return setValueT3DArray;
+
+		case 0x8b60: // SAMPLER_CUBE
+		case 0x8dcc: // INT_SAMPLER_CUBE
+		case 0x8dd4: // UNSIGNED_INT_SAMPLER_CUBE
+		case 0x8dc5: // SAMPLER_CUBE_SHADOW
+			return setValueT6Array;
+
+		case 0x8dc1: // SAMPLER_2D_ARRAY
+		case 0x8dcf: // INT_SAMPLER_2D_ARRAY
+		case 0x8dd7: // UNSIGNED_INT_SAMPLER_2D_ARRAY
+		case 0x8dc4: // SAMPLER_2D_ARRAY_SHADOW
+			return setValueT2DArrayArray;
+
+	}
+
+}
+
+// --- Uniform Classes ---
+
+class SingleUniform {
+
+	constructor( id, activeInfo, addr ) {
+
+		this.id = id;
+		this.addr = addr;
+		this.cache = [];
+		this.type = activeInfo.type;
+		this.setValue = getSingularSetter( activeInfo.type );
+
+		// this.path = activeInfo.name; // DEBUG
+
+	}
+
+}
+
+class PureArrayUniform {
+
+	constructor( id, activeInfo, addr ) {
+
+		this.id = id;
+		this.addr = addr;
+		this.cache = [];
+		this.type = activeInfo.type;
+		this.size = activeInfo.size;
+		this.setValue = getPureArraySetter( activeInfo.type );
+
+		// this.path = activeInfo.name; // DEBUG
+
+	}
+
+}
+
+class StructuredUniform {
+
+	constructor( id ) {
+
+		this.id = id;
+
+		this.seq = [];
+		this.map = {};
+
+	}
+
+	setValue( gl, value, textures ) {
+
+		const seq = this.seq;
+
+		for ( let i = 0, n = seq.length; i !== n; ++ i ) {
+
+			const u = seq[ i ];
+			u.setValue( gl, value[ u.id ], textures );
+
+		}
+
+	}
+
+}
+
+// --- Top-level ---
+
+// Parser - builds up the property tree from the path strings
+
+const RePathPart = /(\w+)(\])?(\[|\.)?/g;
+
+// extracts
+// 	- the identifier (member name or array index)
+//  - followed by an optional right bracket (found when array index)
+//  - followed by an optional left bracket or dot (type of subscript)
+//
+// Note: These portions can be read in a non-overlapping fashion and
+// allow straightforward parsing of the hierarchy that WebGL encodes
+// in the uniform names.
+
+function addUniform( container, uniformObject ) {
+
+	container.seq.push( uniformObject );
+	container.map[ uniformObject.id ] = uniformObject;
+
+}
+
+function parseUniform( activeInfo, addr, container ) {
+
+	const path = activeInfo.name,
+		pathLength = path.length;
+
+	// reset RegExp object, because of the early exit of a previous run
+	RePathPart.lastIndex = 0;
+
+	while ( true ) {
+
+		const match = RePathPart.exec( path ),
+			matchEnd = RePathPart.lastIndex;
+
+		let id = match[ 1 ];
+		const idIsIndex = match[ 2 ] === ']',
+			subscript = match[ 3 ];
+
+		if ( idIsIndex ) id = id | 0; // convert to integer
+
+		if ( subscript === undefined || subscript === '[' && matchEnd + 2 === pathLength ) {
+
+			// bare name or "pure" bottom-level array "[0]" suffix
+
+			addUniform( container, subscript === undefined ?
+				new SingleUniform( id, activeInfo, addr ) :
+				new PureArrayUniform( id, activeInfo, addr ) );
+
+			break;
+
+		} else {
+
+			// step into inner node / create it in case it doesn't exist
+
+			const map = container.map;
+			let next = map[ id ];
+
+			if ( next === undefined ) {
+
+				next = new StructuredUniform( id );
+				addUniform( container, next );
+
+			}
+
+			container = next;
+
+		}
+
+	}
+
+}
+
+// Root Container
+
+class WebGLUniforms {
+
+	constructor( gl, program ) {
+
+		this.seq = [];
+		this.map = {};
+
+		const n = gl.getProgramParameter( program, gl.ACTIVE_UNIFORMS );
+
+		for ( let i = 0; i < n; ++ i ) {
+
+			const info = gl.getActiveUniform( program, i ),
+				addr = gl.getUniformLocation( program, info.name );
+
+			parseUniform( info, addr, this );
+
+		}
+
+		// Sort uniforms to prioritize shadow samplers first (for optimal texture unit allocation)
+
+		const shadowSamplers = [];
+		const otherUniforms = [];
+
+		for ( const u of this.seq ) {
+
+			if ( u.type === gl.SAMPLER_2D_SHADOW || u.type === gl.SAMPLER_CUBE_SHADOW || u.type === gl.SAMPLER_2D_ARRAY_SHADOW ) {
+
+				shadowSamplers.push( u );
+
+			} else {
+
+				otherUniforms.push( u );
+
+			}
+
+		}
+
+		if ( shadowSamplers.length > 0 ) {
+
+			this.seq = shadowSamplers.concat( otherUniforms );
+
+		}
+
+	}
+
+	setValue( gl, name, value, textures ) {
+
+		const u = this.map[ name ];
+
+		if ( u !== undefined ) u.setValue( gl, value, textures );
+
+	}
+
+	setOptional( gl, object, name ) {
+
+		const v = object[ name ];
+
+		if ( v !== undefined ) this.setValue( gl, name, v );
+
+	}
+
+	static upload( gl, seq, values, textures ) {
+
+		for ( let i = 0, n = seq.length; i !== n; ++ i ) {
+
+			const u = seq[ i ],
+				v = values[ u.id ];
+
+			if ( v.needsUpdate !== false ) {
+
+				// note: always updating when .needsUpdate is undefined
+				u.setValue( gl, v.value, textures );
+
+			}
+
+		}
+
+	}
+
+	static seqWithValue( seq, values ) {
+
+		const r = [];
+
+		for ( let i = 0, n = seq.length; i !== n; ++ i ) {
+
+			const u = seq[ i ];
+			if ( u.id in values ) r.push( u );
+
+		}
+
+		return r;
+
+	}
+
+}
+
+function WebGLShader( gl, type, string ) {
+
+	const shader = gl.createShader( type );
+
+	gl.shaderSource( shader, string );
+	gl.compileShader( shader );
+
+	return shader;
+
+}
+
+// From https://www.khronos.org/registry/webgl/extensions/KHR_parallel_shader_compile/
+const COMPLETION_STATUS_KHR = 0x91B1;
+
+let programIdCount = 0;
+
+function handleSource( string, errorLine ) {
+
+	const lines = string.split( '\n' );
+	const lines2 = [];
+
+	const from = Math.max( errorLine - 6, 0 );
+	const to = Math.min( errorLine + 6, lines.length );
+
+	for ( let i = from; i < to; i ++ ) {
+
+		const line = i + 1;
+		lines2.push( `${line === errorLine ? '>' : ' '} ${line}: ${lines[ i ]}` );
+
+	}
+
+	return lines2.join( '\n' );
+
+}
+
+const _m0 = /*@__PURE__*/ new Matrix3();
+
+function getEncodingComponents( colorSpace ) {
+
+	ColorManagement._getMatrix( _m0, ColorManagement.workingColorSpace, colorSpace );
+
+	const encodingMatrix = `mat3( ${ _m0.elements.map( ( v ) => v.toFixed( 4 ) ) } )`;
+
+	switch ( ColorManagement.getTransfer( colorSpace ) ) {
+
+		case LinearTransfer:
+			return [ encodingMatrix, 'LinearTransferOETF' ];
+
+		case SRGBTransfer:
+			return [ encodingMatrix, 'sRGBTransferOETF' ];
+
+		default:
+			warn( 'WebGLProgram: Unsupported color space: ', colorSpace );
+			return [ encodingMatrix, 'LinearTransferOETF' ];
+
+	}
+
+}
+
+function getShaderErrors( gl, shader, type ) {
+
+	const status = gl.getShaderParameter( shader, gl.COMPILE_STATUS );
+
+	const shaderInfoLog = gl.getShaderInfoLog( shader ) || '';
+	const errors = shaderInfoLog.trim();
+
+	if ( status && errors === '' ) return '';
+
+	const errorMatches = /ERROR: 0:(\d+)/.exec( errors );
+	if ( errorMatches ) {
+
+		// --enable-privileged-webgl-extension
+		// log( '**' + type + '**', gl.getExtension( 'WEBGL_debug_shaders' ).getTranslatedShaderSource( shader ) );
+
+		const errorLine = parseInt( errorMatches[ 1 ] );
+		return type.toUpperCase() + '\n\n' + errors + '\n\n' + handleSource( gl.getShaderSource( shader ), errorLine );
+
+	} else {
+
+		return errors;
+
+	}
+
+}
+
+function getTexelEncodingFunction( functionName, colorSpace ) {
+
+	const components = getEncodingComponents( colorSpace );
+
+	return [
+
+		`vec4 ${functionName}( vec4 value ) {`,
+
+		`	return ${components[ 1 ]}( vec4( value.rgb * ${components[ 0 ]}, value.a ) );`,
+
+		'}',
+
+	].join( '\n' );
+
+}
+
+const toneMappingFunctions = {
+	[ LinearToneMapping ]: 'Linear',
+	[ ReinhardToneMapping ]: 'Reinhard',
+	[ CineonToneMapping ]: 'Cineon',
+	[ ACESFilmicToneMapping ]: 'ACESFilmic',
+	[ AgXToneMapping ]: 'AgX',
+	[ NeutralToneMapping ]: 'Neutral',
+	[ CustomToneMapping ]: 'Custom'
+};
+
+function getToneMappingFunction( functionName, toneMapping ) {
+
+	const toneMappingName = toneMappingFunctions[ toneMapping ];
+
+	if ( toneMappingName === undefined ) {
+
+		warn( 'WebGLProgram: Unsupported toneMapping:', toneMapping );
+		return 'vec3 ' + functionName + '( vec3 color ) { return LinearToneMapping( color ); }';
+
+	}
+
+	return 'vec3 ' + functionName + '( vec3 color ) { return ' + toneMappingName + 'ToneMapping( color ); }';
+
+}
+
+const _v0 = /*@__PURE__*/ new Vector3();
+
+function getLuminanceFunction() {
+
+	ColorManagement.getLuminanceCoefficients( _v0 );
+
+	const r = _v0.x.toFixed( 4 );
+	const g = _v0.y.toFixed( 4 );
+	const b = _v0.z.toFixed( 4 );
+
+	return [
+
+		'float luminance( const in vec3 rgb ) {',
+
+		`	const vec3 weights = vec3( ${ r }, ${ g }, ${ b } );`,
+
+		'	return dot( weights, rgb );',
+
+		'}'
+
+	].join( '\n' );
+
+}
+
+function generateVertexExtensions( parameters ) {
+
+	const chunks = [
+		parameters.extensionClipCullDistance ? '#extension GL_ANGLE_clip_cull_distance : require' : '',
+		parameters.extensionMultiDraw ? '#extension GL_ANGLE_multi_draw : require' : '',
+	];
+
+	return chunks.filter( filterEmptyLine ).join( '\n' );
+
+}
+
+function generateDefines( defines ) {
+
+	const chunks = [];
+
+	for ( const name in defines ) {
+
+		const value = defines[ name ];
+
+		if ( value === false ) continue;
+
+		chunks.push( '#define ' + name + ' ' + value );
+
+	}
+
+	return chunks.join( '\n' );
+
+}
+
+function fetchAttributeLocations( gl, program ) {
+
+	const attributes = {};
+
+	const n = gl.getProgramParameter( program, gl.ACTIVE_ATTRIBUTES );
+
+	for ( let i = 0; i < n; i ++ ) {
+
+		const info = gl.getActiveAttrib( program, i );
+		const name = info.name;
+
+		let locationSize = 1;
+		if ( info.type === gl.FLOAT_MAT2 ) locationSize = 2;
+		if ( info.type === gl.FLOAT_MAT3 ) locationSize = 3;
+		if ( info.type === gl.FLOAT_MAT4 ) locationSize = 4;
+
+		// log( 'WebGLProgram: ACTIVE VERTEX ATTRIBUTE:', name, i );
+
+		attributes[ name ] = {
+			type: info.type,
+			location: gl.getAttribLocation( program, name ),
+			locationSize: locationSize
+		};
+
+	}
+
+	return attributes;
+
+}
+
+function filterEmptyLine( string ) {
+
+	return string !== '';
+
+}
+
+function replaceLightNums( string, parameters ) {
+
+	const numSpotLightCoords = parameters.numSpotLightShadows + parameters.numSpotLightMaps - parameters.numSpotLightShadowsWithMaps;
+
+	return string
+		.replace( /NUM_SUN_LIGHTS/g, parameters.numSunLights )
+		.replace( /NUM_DIR_LIGHTS/g, parameters.numDirLights )
+		.replace( /NUM_SPOT_LIGHTS/g, parameters.numSpotLights )
+		.replace( /NUM_SPOT_LIGHT_MAPS/g, parameters.numSpotLightMaps )
+		.replace( /NUM_SPOT_LIGHT_COORDS/g, numSpotLightCoords )
+		.replace( /NUM_RECT_AREA_LIGHTS/g, parameters.numRectAreaLights )
+		.replace( /NUM_POINT_LIGHTS/g, parameters.numPointLights )
+		.replace( /NUM_HEMI_LIGHTS/g, parameters.numHemiLights )
+		.replace( /NUM_SUN_LIGHT_SHADOWS/g, parameters.numSunLightShadows )
+		.replace( /NUM_DIR_LIGHT_SHADOWS/g, parameters.numDirLightShadows )
+		.replace( /NUM_SPOT_LIGHT_SHADOWS_WITH_MAPS/g, parameters.numSpotLightShadowsWithMaps )
+		.replace( /NUM_SPOT_LIGHT_SHADOWS/g, parameters.numSpotLightShadows )
+		.replace( /NUM_POINT_LIGHT_SHADOWS/g, parameters.numPointLightShadows );
+
+}
+
+function replaceClippingPlaneNums( string, parameters ) {
+
+	return string
+		.replace( /NUM_CLIPPING_PLANES/g, parameters.numClippingPlanes )
+		.replace( /UNION_CLIPPING_PLANES/g, ( parameters.numClippingPlanes - parameters.numClipIntersection ) );
+
+}
+
+// Resolve Includes
+
+const includePattern = /^[ \t]*#include +<([\w\d./]+)>/gm;
+
+function resolveIncludes( string ) {
+
+	return string.replace( includePattern, includeReplacer );
+
+}
+
+const shaderChunkMap = new Map();
+
+function includeReplacer( match, include ) {
+
+	let string = ShaderChunk[ include ];
+
+	if ( string === undefined ) {
+
+		const newInclude = shaderChunkMap.get( include );
+
+		if ( newInclude !== undefined ) {
+
+			string = ShaderChunk[ newInclude ];
+			warn( 'WebGLRenderer: Shader chunk "%s" has been deprecated. Use "%s" instead.', include, newInclude );
+
+		} else {
+
+			throw new Error( 'THREE.WebGLProgram: Can not resolve #include <' + include + '>' );
+
+		}
+
+	}
+
+	return resolveIncludes( string );
+
+}
+
+// Unroll Loops
+
+const unrollLoopPattern = /#pragma unroll_loop_start\s+for\s*\(\s*int\s+i\s*=\s*(\d+)\s*;\s*i\s*<\s*(\d+)\s*;\s*i\s*\+\+\s*\)\s*{([\s\S]+?)}\s+#pragma unroll_loop_end/g;
+
+function unrollLoops( string ) {
+
+	return string.replace( unrollLoopPattern, loopReplacer );
+
+}
+
+function loopReplacer( match, start, end, snippet ) {
+
+	let string = '';
+
+	for ( let i = parseInt( start ); i < parseInt( end ); i ++ ) {
+
+		string += snippet
+			.replace( /\[\s*i\s*\]/g, '[ ' + i + ' ]' )
+			.replace( /UNROLLED_LOOP_INDEX/g, i );
+
+	}
+
+	return string;
+
+}
+
+//
+
+function generatePrecision( parameters ) {
+
+	let precisionstring = `precision ${parameters.precision} float;
+	precision ${parameters.precision} int;
+	precision ${parameters.precision} sampler2D;
+	precision ${parameters.precision} samplerCube;
+	precision ${parameters.precision} sampler3D;
+	precision ${parameters.precision} sampler2DArray;
+	precision ${parameters.precision} sampler2DShadow;
+	precision ${parameters.precision} samplerCubeShadow;
+	precision ${parameters.precision} sampler2DArrayShadow;
+	precision ${parameters.precision} isampler2D;
+	precision ${parameters.precision} isampler3D;
+	precision ${parameters.precision} isamplerCube;
+	precision ${parameters.precision} isampler2DArray;
+	precision ${parameters.precision} usampler2D;
+	precision ${parameters.precision} usampler3D;
+	precision ${parameters.precision} usamplerCube;
+	precision ${parameters.precision} usampler2DArray;
+	`;
+
+	if ( parameters.precision === 'highp' ) {
+
+		precisionstring += '\n#define HIGH_PRECISION';
+
+	} else if ( parameters.precision === 'mediump' ) {
+
+		precisionstring += '\n#define MEDIUM_PRECISION';
+
+	} else if ( parameters.precision === 'lowp' ) {
+
+		precisionstring += '\n#define LOW_PRECISION';
+
+	}
+
+	return precisionstring;
+
+}
+
+const shadowMapTypeDefines = {
+	[ PCFShadowMap ]: 'SHADOWMAP_TYPE_PCF',
+	[ VSMShadowMap ]: 'SHADOWMAP_TYPE_VSM'
+};
+
+function generateShadowMapTypeDefine( parameters ) {
+
+	return shadowMapTypeDefines[ parameters.shadowMapType ] || 'SHADOWMAP_TYPE_BASIC';
+
+}
+
+const envMapTypeDefines = {
+	[ CubeReflectionMapping ]: 'ENVMAP_TYPE_CUBE',
+	[ CubeRefractionMapping ]: 'ENVMAP_TYPE_CUBE',
+	[ CubeUVReflectionMapping ]: 'ENVMAP_TYPE_CUBE_UV'
+};
+
+function generateEnvMapTypeDefine( parameters ) {
+
+	if ( parameters.envMap === false ) return 'ENVMAP_TYPE_CUBE';
+
+	return envMapTypeDefines[ parameters.envMapMode ] || 'ENVMAP_TYPE_CUBE';
+
+}
+
+const envMapModeDefines = {
+	[ CubeRefractionMapping ]: 'ENVMAP_MODE_REFRACTION'
+};
+
+function generateEnvMapModeDefine( parameters ) {
+
+	if ( parameters.envMap === false ) return 'ENVMAP_MODE_REFLECTION';
+
+	return envMapModeDefines[ parameters.envMapMode ] || 'ENVMAP_MODE_REFLECTION';
+
+}
+
+const envMapBlendingDefines = {
+	[ MultiplyOperation ]: 'ENVMAP_BLENDING_MULTIPLY',
+	[ MixOperation ]: 'ENVMAP_BLENDING_MIX',
+	[ AddOperation ]: 'ENVMAP_BLENDING_ADD'
+};
+
+function generateEnvMapBlendingDefine( parameters ) {
+
+	if ( parameters.envMap === false ) return 'ENVMAP_BLENDING_NONE';
+
+	return envMapBlendingDefines[ parameters.combine ] || 'ENVMAP_BLENDING_NONE';
+
+}
+
+function generateCubeUVSize( parameters ) {
+
+	const imageHeight = parameters.envMapCubeUVHeight;
+
+	if ( imageHeight === null ) return null;
+
+	const maxMip = Math.log2( imageHeight ) - 2;
+
+	const texelHeight = 1.0 / imageHeight;
+
+	const texelWidth = 1.0 / ( 3 * Math.max( Math.pow( 2, maxMip ), 7 * 16 ) );
+
+	return { texelWidth, texelHeight, maxMip };
+
+}
+
+function WebGLProgram( renderer, cacheKey, parameters, bindingStates ) {
+
+	// TODO Send this event to Three.js DevTools
+	// log( 'WebGLProgram', cacheKey );
+
+	const gl = renderer.getContext();
+
+	const defines = parameters.defines;
+
+	let vertexShader = parameters.vertexShader;
+	let fragmentShader = parameters.fragmentShader;
+
+	const shadowMapTypeDefine = generateShadowMapTypeDefine( parameters );
+	const envMapTypeDefine = generateEnvMapTypeDefine( parameters );
+	const envMapModeDefine = generateEnvMapModeDefine( parameters );
+	const envMapBlendingDefine = generateEnvMapBlendingDefine( parameters );
+	const envMapCubeUVSize = generateCubeUVSize( parameters );
+
+	const customVertexExtensions = generateVertexExtensions( parameters );
+
+	const customDefines = generateDefines( defines );
+
+	const program = gl.createProgram();
+
+	let prefixVertex, prefixFragment;
+	let versionString = parameters.glslVersion ? '#version ' + parameters.glslVersion + '\n' : '';
+
+	if ( parameters.isRawShaderMaterial ) {
+
+		prefixVertex = [
+
+			'#define SHADER_TYPE ' + parameters.shaderType,
+			'#define SHADER_NAME ' + parameters.shaderName,
+
+			customDefines
+
+		].filter( filterEmptyLine ).join( '\n' );
+
+		if ( prefixVertex.length > 0 ) {
+
+			prefixVertex += '\n';
+
+		}
+
+		prefixFragment = [
+
+			'#define SHADER_TYPE ' + parameters.shaderType,
+			'#define SHADER_NAME ' + parameters.shaderName,
+
+			customDefines
+
+		].filter( filterEmptyLine ).join( '\n' );
+
+		if ( prefixFragment.length > 0 ) {
+
+			prefixFragment += '\n';
+
+		}
+
+	} else {
+
+		prefixVertex = [
+
+			generatePrecision( parameters ),
+
+			'#define SHADER_TYPE ' + parameters.shaderType,
+			'#define SHADER_NAME ' + parameters.shaderName,
+
+			customDefines,
+
+			parameters.extensionClipCullDistance ? '#define USE_CLIP_DISTANCE' : '',
+			parameters.batching ? '#define USE_BATCHING' : '',
+			parameters.batchingColor ? '#define USE_BATCHING_COLOR' : '',
+			parameters.instancing ? '#define USE_INSTANCING' : '',
+			parameters.instancingColor ? '#define USE_INSTANCING_COLOR' : '',
+			parameters.instancingMorph ? '#define USE_INSTANCING_MORPH' : '',
+
+			parameters.useFog && parameters.fog ? '#define USE_FOG' : '',
+			parameters.useFog && parameters.fogExp2 ? '#define FOG_EXP2' : '',
+
+			parameters.map ? '#define USE_MAP' : '',
+			parameters.envMap ? '#define USE_ENVMAP' : '',
+			parameters.envMap ? '#define ' + envMapModeDefine : '',
+			parameters.lightMap ? '#define USE_LIGHTMAP' : '',
+			parameters.aoMap ? '#define USE_AOMAP' : '',
+			parameters.bumpMap ? '#define USE_BUMPMAP' : '',
+			parameters.normalMap ? '#define USE_NORMALMAP' : '',
+			parameters.normalMapObjectSpace ? '#define USE_NORMALMAP_OBJECTSPACE' : '',
+			parameters.normalMapTangentSpace ? '#define USE_NORMALMAP_TANGENTSPACE' : '',
+			parameters.displacementMap ? '#define USE_DISPLACEMENTMAP' : '',
+			parameters.emissiveMap ? '#define USE_EMISSIVEMAP' : '',
+
+			parameters.anisotropy ? '#define USE_ANISOTROPY' : '',
+			parameters.anisotropyMap ? '#define USE_ANISOTROPYMAP' : '',
+
+			parameters.clearcoatMap ? '#define USE_CLEARCOATMAP' : '',
+			parameters.clearcoatRoughnessMap ? '#define USE_CLEARCOAT_ROUGHNESSMAP' : '',
+			parameters.clearcoatNormalMap ? '#define USE_CLEARCOAT_NORMALMAP' : '',
+
+			parameters.iridescenceMap ? '#define USE_IRIDESCENCEMAP' : '',
+			parameters.iridescenceThicknessMap ? '#define USE_IRIDESCENCE_THICKNESSMAP' : '',
+
+			parameters.specularMap ? '#define USE_SPECULARMAP' : '',
+			parameters.specularColorMap ? '#define USE_SPECULAR_COLORMAP' : '',
+			parameters.specularIntensityMap ? '#define USE_SPECULAR_INTENSITYMAP' : '',
+
+			parameters.roughnessMap ? '#define USE_ROUGHNESSMAP' : '',
+			parameters.metalnessMap ? '#define USE_METALNESSMAP' : '',
+			parameters.alphaMap ? '#define USE_ALPHAMAP' : '',
+			parameters.alphaHash ? '#define USE_ALPHAHASH' : '',
+
+			parameters.transmission ? '#define USE_TRANSMISSION' : '',
+			parameters.transmissionMap ? '#define USE_TRANSMISSIONMAP' : '',
+			parameters.thicknessMap ? '#define USE_THICKNESSMAP' : '',
+
+			parameters.sheenColorMap ? '#define USE_SHEEN_COLORMAP' : '',
+			parameters.sheenRoughnessMap ? '#define USE_SHEEN_ROUGHNESSMAP' : '',
+
+			//
+
+			parameters.mapUv ? '#define MAP_UV ' + parameters.mapUv : '',
+			parameters.alphaMapUv ? '#define ALPHAMAP_UV ' + parameters.alphaMapUv : '',
+			parameters.lightMapUv ? '#define LIGHTMAP_UV ' + parameters.lightMapUv : '',
+			parameters.aoMapUv ? '#define AOMAP_UV ' + parameters.aoMapUv : '',
+			parameters.emissiveMapUv ? '#define EMISSIVEMAP_UV ' + parameters.emissiveMapUv : '',
+			parameters.bumpMapUv ? '#define BUMPMAP_UV ' + parameters.bumpMapUv : '',
+			parameters.normalMapUv ? '#define NORMALMAP_UV ' + parameters.normalMapUv : '',
+			parameters.displacementMapUv ? '#define DISPLACEMENTMAP_UV ' + parameters.displacementMapUv : '',
+
+			parameters.metalnessMapUv ? '#define METALNESSMAP_UV ' + parameters.metalnessMapUv : '',
+			parameters.roughnessMapUv ? '#define ROUGHNESSMAP_UV ' + parameters.roughnessMapUv : '',
+
+			parameters.anisotropyMapUv ? '#define ANISOTROPYMAP_UV ' + parameters.anisotropyMapUv : '',
+
+			parameters.clearcoatMapUv ? '#define CLEARCOATMAP_UV ' + parameters.clearcoatMapUv : '',
+			parameters.clearcoatNormalMapUv ? '#define CLEARCOAT_NORMALMAP_UV ' + parameters.clearcoatNormalMapUv : '',
+			parameters.clearcoatRoughnessMapUv ? '#define CLEARCOAT_ROUGHNESSMAP_UV ' + parameters.clearcoatRoughnessMapUv : '',
+
+			parameters.iridescenceMapUv ? '#define IRIDESCENCEMAP_UV ' + parameters.iridescenceMapUv : '',
+			parameters.iridescenceThicknessMapUv ? '#define IRIDESCENCE_THICKNESSMAP_UV ' + parameters.iridescenceThicknessMapUv : '',
+
+			parameters.sheenColorMapUv ? '#define SHEEN_COLORMAP_UV ' + parameters.sheenColorMapUv : '',
+			parameters.sheenRoughnessMapUv ? '#define SHEEN_ROUGHNESSMAP_UV ' + parameters.sheenRoughnessMapUv : '',
+
+			parameters.specularMapUv ? '#define SPECULARMAP_UV ' + parameters.specularMapUv : '',
+			parameters.specularColorMapUv ? '#define SPECULAR_COLORMAP_UV ' + parameters.specularColorMapUv : '',
+			parameters.specularIntensityMapUv ? '#define SPECULAR_INTENSITYMAP_UV ' + parameters.specularIntensityMapUv : '',
+
+			parameters.transmissionMapUv ? '#define TRANSMISSIONMAP_UV ' + parameters.transmissionMapUv : '',
+			parameters.thicknessMapUv ? '#define THICKNESSMAP_UV ' + parameters.thicknessMapUv : '',
+
+			//
+
+			parameters.vertexTangents && parameters.flatShading === false ? '#define USE_TANGENT' : '',
+			parameters.vertexNormals ? '#define HAS_NORMAL' : '',
+			parameters.vertexColors ? '#define USE_COLOR' : '',
+			parameters.vertexAlphas ? '#define USE_COLOR_ALPHA' : '',
+			parameters.vertexUv1s ? '#define USE_UV1' : '',
+			parameters.vertexUv2s ? '#define USE_UV2' : '',
+			parameters.vertexUv3s ? '#define USE_UV3' : '',
+
+			parameters.pointsUvs ? '#define USE_POINTS_UV' : '',
+
+			parameters.flatShading ? '#define FLAT_SHADED' : '',
+
+			parameters.skinning ? '#define USE_SKINNING' : '',
+
+			parameters.morphTargets ? '#define USE_MORPHTARGETS' : '',
+			parameters.morphNormals && parameters.flatShading === false ? '#define USE_MORPHNORMALS' : '',
+			( parameters.morphColors ) ? '#define USE_MORPHCOLORS' : '',
+			( parameters.morphTargetsCount > 0 ) ? '#define MORPHTARGETS_TEXTURE_STRIDE ' + parameters.morphTextureStride : '',
+			( parameters.morphTargetsCount > 0 ) ? '#define MORPHTARGETS_COUNT ' + parameters.morphTargetsCount : '',
+			parameters.doubleSided ? '#define DOUBLE_SIDED' : '',
+			parameters.flipSided ? '#define FLIP_SIDED' : '',
+
+			parameters.shadowMapEnabled ? '#define USE_SHADOWMAP' : '',
+			parameters.shadowMapEnabled ? '#define ' + shadowMapTypeDefine : '',
+
+			parameters.sizeAttenuation ? '#define USE_SIZEATTENUATION' : '',
+
+			parameters.numLightProbes > 0 ? '#define USE_LIGHT_PROBES' : '',
+
+			parameters.logarithmicDepthBuffer ? '#define USE_LOGARITHMIC_DEPTH_BUFFER' : '',
+			parameters.reversedDepthBuffer ? '#define USE_REVERSED_DEPTH_BUFFER' : '',
+
+			'uniform mat4 modelMatrix;',
+			'uniform mat4 modelViewMatrix;',
+			'uniform mat4 projectionMatrix;',
+			'uniform mat4 viewMatrix;',
+			'uniform mat3 normalMatrix;',
+			'uniform vec3 cameraPosition;',
+			'uniform bool isOrthographic;',
+
+			'#ifdef USE_INSTANCING',
+
+			'	attribute mat4 instanceMatrix;',
+
+			'#endif',
+
+			'#ifdef USE_INSTANCING_COLOR',
+
+			'	attribute vec3 instanceColor;',
+
+			'#endif',
+
+			'#ifdef USE_INSTANCING_MORPH',
+
+			'	uniform sampler2D morphTexture;',
+
+			'#endif',
+
+			'attribute vec3 position;',
+			'attribute vec3 normal;',
+			'attribute vec2 uv;',
+
+			'#ifdef USE_UV1',
+
+			'	attribute vec2 uv1;',
+
+			'#endif',
+
+			'#ifdef USE_UV2',
+
+			'	attribute vec2 uv2;',
+
+			'#endif',
+
+			'#ifdef USE_UV3',
+
+			'	attribute vec2 uv3;',
+
+			'#endif',
+
+			'#ifdef USE_TANGENT',
+
+			'	attribute vec4 tangent;',
+
+			'#endif',
+
+			'#if defined( USE_COLOR_ALPHA )',
+
+			'	attribute vec4 color;',
+
+			'#elif defined( USE_COLOR )',
+
+			'	attribute vec3 color;',
+
+			'#endif',
+
+			'#ifdef USE_SKINNING',
+
+			'	attribute vec4 skinIndex;',
+			'	attribute vec4 skinWeight;',
+
+			'#endif',
+
+			'\n'
+
+		].filter( filterEmptyLine ).join( '\n' );
+
+		prefixFragment = [
+
+			generatePrecision( parameters ),
+
+			'#define SHADER_TYPE ' + parameters.shaderType,
+			'#define SHADER_NAME ' + parameters.shaderName,
+
+			customDefines,
+
+			parameters.useFog && parameters.fog ? '#define USE_FOG' : '',
+			parameters.useFog && parameters.fogExp2 ? '#define FOG_EXP2' : '',
+
+			parameters.alphaToCoverage ? '#define ALPHA_TO_COVERAGE' : '',
+			parameters.map ? '#define USE_MAP' : '',
+			parameters.matcap ? '#define USE_MATCAP' : '',
+			parameters.envMap ? '#define USE_ENVMAP' : '',
+			parameters.envMap ? '#define ' + envMapTypeDefine : '',
+			parameters.envMap ? '#define ' + envMapModeDefine : '',
+			parameters.envMap ? '#define ' + envMapBlendingDefine : '',
+			envMapCubeUVSize ? '#define CUBEUV_TEXEL_WIDTH ' + envMapCubeUVSize.texelWidth : '',
+			envMapCubeUVSize ? '#define CUBEUV_TEXEL_HEIGHT ' + envMapCubeUVSize.texelHeight : '',
+			envMapCubeUVSize ? '#define CUBEUV_MAX_MIP ' + envMapCubeUVSize.maxMip + '.0' : '',
+			parameters.lightMap ? '#define USE_LIGHTMAP' : '',
+			parameters.aoMap ? '#define USE_AOMAP' : '',
+			parameters.bumpMap ? '#define USE_BUMPMAP' : '',
+			parameters.normalMap ? '#define USE_NORMALMAP' : '',
+			parameters.normalMapObjectSpace ? '#define USE_NORMALMAP_OBJECTSPACE' : '',
+			parameters.normalMapTangentSpace ? '#define USE_NORMALMAP_TANGENTSPACE' : '',
+			parameters.packedNormalMap ? '#define USE_PACKED_NORMALMAP' : '',
+			parameters.emissiveMap ? '#define USE_EMISSIVEMAP' : '',
+
+			parameters.anisotropy ? '#define USE_ANISOTROPY' : '',
+			parameters.anisotropyMap ? '#define USE_ANISOTROPYMAP' : '',
+
+			parameters.clearcoat ? '#define USE_CLEARCOAT' : '',
+			parameters.clearcoatMap ? '#define USE_CLEARCOATMAP' : '',
+			parameters.clearcoatRoughnessMap ? '#define USE_CLEARCOAT_ROUGHNESSMAP' : '',
+			parameters.clearcoatNormalMap ? '#define USE_CLEARCOAT_NORMALMAP' : '',
+
+			parameters.dispersion ? '#define USE_DISPERSION' : '',
+			parameters.retroreflection ? '#define USE_RETROREFLECTION' : '',
+
+			parameters.iridescence ? '#define USE_IRIDESCENCE' : '',
+			parameters.iridescenceMap ? '#define USE_IRIDESCENCEMAP' : '',
+			parameters.iridescenceThicknessMap ? '#define USE_IRIDESCENCE_THICKNESSMAP' : '',
+
+			parameters.specularMap ? '#define USE_SPECULARMAP' : '',
+			parameters.specularColorMap ? '#define USE_SPECULAR_COLORMAP' : '',
+			parameters.specularIntensityMap ? '#define USE_SPECULAR_INTENSITYMAP' : '',
+
+			parameters.roughnessMap ? '#define USE_ROUGHNESSMAP' : '',
+			parameters.metalnessMap ? '#define USE_METALNESSMAP' : '',
+
+			parameters.alphaMap ? '#define USE_ALPHAMAP' : '',
+			parameters.alphaTest ? '#define USE_ALPHATEST' : '',
+			parameters.alphaHash ? '#define USE_ALPHAHASH' : '',
+
+			parameters.sheen ? '#define USE_SHEEN' : '',
+			parameters.sheenColorMap ? '#define USE_SHEEN_COLORMAP' : '',
+			parameters.sheenRoughnessMap ? '#define USE_SHEEN_ROUGHNESSMAP' : '',
+
+			parameters.transmission ? '#define USE_TRANSMISSION' : '',
+			parameters.transmissionMap ? '#define USE_TRANSMISSIONMAP' : '',
+			parameters.thicknessMap ? '#define USE_THICKNESSMAP' : '',
+
+			parameters.vertexTangents && parameters.flatShading === false ? '#define USE_TANGENT' : '',
+			parameters.vertexColors || parameters.instancingColor ? '#define USE_COLOR' : '',
+			parameters.vertexAlphas || parameters.batchingColor ? '#define USE_COLOR_ALPHA' : '',
+			parameters.vertexUv1s ? '#define USE_UV1' : '',
+			parameters.vertexUv2s ? '#define USE_UV2' : '',
+			parameters.vertexUv3s ? '#define USE_UV3' : '',
+
+			parameters.pointsUvs ? '#define USE_POINTS_UV' : '',
+
+			parameters.gradientMap ? '#define USE_GRADIENTMAP' : '',
+
+			parameters.flatShading ? '#define FLAT_SHADED' : '',
+
+			parameters.doubleSided ? '#define DOUBLE_SIDED' : '',
+			parameters.flipSided ? '#define FLIP_SIDED' : '',
+
+			parameters.shadowMapEnabled ? '#define USE_SHADOWMAP' : '',
+			parameters.shadowMapEnabled ? '#define ' + shadowMapTypeDefine : '',
+
+			parameters.premultipliedAlpha ? '#define PREMULTIPLIED_ALPHA' : '',
+
+			parameters.numLightProbes > 0 ? '#define USE_LIGHT_PROBES' : '',
+
+			parameters.numLightProbeGrids > 0 ? '#define USE_LIGHT_PROBES_GRID' : '',
+
+			parameters.decodeVideoTexture ? '#define DECODE_VIDEO_TEXTURE' : '',
+			parameters.decodeVideoTextureEmissive ? '#define DECODE_VIDEO_TEXTURE_EMISSIVE' : '',
+
+			parameters.logarithmicDepthBuffer ? '#define USE_LOGARITHMIC_DEPTH_BUFFER' : '',
+			parameters.reversedDepthBuffer ? '#define USE_REVERSED_DEPTH_BUFFER' : '',
+
+			'uniform mat4 viewMatrix;',
+			'uniform vec3 cameraPosition;',
+			'uniform bool isOrthographic;',
+
+			( parameters.toneMapping !== NoToneMapping ) ? '#define TONE_MAPPING' : '',
+			( parameters.toneMapping !== NoToneMapping ) ? ShaderChunk[ 'tonemapping_pars_fragment' ] : '', // this code is required here because it is used by the toneMapping() function defined below
+			( parameters.toneMapping !== NoToneMapping ) ? getToneMappingFunction( 'toneMapping', parameters.toneMapping ) : '',
+
+			parameters.dithering ? '#define DITHERING' : '',
+			parameters.opaque ? '#define OPAQUE' : '',
+
+			ShaderChunk[ 'colorspace_pars_fragment' ], // this code is required here because it is used by the various encoding/decoding function defined below
+			getTexelEncodingFunction( 'linearToOutputTexel', parameters.outputColorSpace ),
+			getLuminanceFunction(),
+
+			parameters.useDepthPacking ? '#define DEPTH_PACKING ' + parameters.depthPacking : '',
+
+			'\n'
+
+		].filter( filterEmptyLine ).join( '\n' );
+
+	}
+
+	vertexShader = resolveIncludes( vertexShader );
+	vertexShader = replaceLightNums( vertexShader, parameters );
+	vertexShader = replaceClippingPlaneNums( vertexShader, parameters );
+
+	fragmentShader = resolveIncludes( fragmentShader );
+	fragmentShader = replaceLightNums( fragmentShader, parameters );
+	fragmentShader = replaceClippingPlaneNums( fragmentShader, parameters );
+
+	vertexShader = unrollLoops( vertexShader );
+	fragmentShader = unrollLoops( fragmentShader );
+
+	if ( parameters.isRawShaderMaterial !== true ) {
+
+		// GLSL 3.0 conversion for built-in materials and ShaderMaterial
+
+		versionString = '#version 300 es\n';
+
+		prefixVertex = [
+			customVertexExtensions,
+			'#define attribute in',
+			'#define varying out',
+			'#define texture2D texture'
+		].join( '\n' ) + '\n' + prefixVertex;
+
+		prefixFragment = [
+			'#define varying in',
+			( parameters.glslVersion === GLSL3 ) ? '' : 'layout(location = 0) out highp vec4 pc_fragColor;',
+			( parameters.glslVersion === GLSL3 ) ? '' : '#define gl_FragColor pc_fragColor',
+			'#define gl_FragDepthEXT gl_FragDepth',
+			'#define texture2D texture',
+			'#define textureCube texture',
+			'#define texture2DProj textureProj',
+			'#define texture2DLodEXT textureLod',
+			'#define texture2DProjLodEXT textureProjLod',
+			'#define textureCubeLodEXT textureLod',
+			'#define texture2DGradEXT textureGrad',
+			'#define texture2DProjGradEXT textureProjGrad',
+			'#define textureCubeGradEXT textureGrad'
+		].join( '\n' ) + '\n' + prefixFragment;
+
+	}
+
+	const vertexGlsl = versionString + prefixVertex + vertexShader;
+	const fragmentGlsl = versionString + prefixFragment + fragmentShader;
+
+	// log( '*VERTEX*', vertexGlsl );
+	// log( '*FRAGMENT*', fragmentGlsl );
+
+	const glVertexShader = WebGLShader( gl, gl.VERTEX_SHADER, vertexGlsl );
+	const glFragmentShader = WebGLShader( gl, gl.FRAGMENT_SHADER, fragmentGlsl );
+
+	gl.attachShader( program, glVertexShader );
+	gl.attachShader( program, glFragmentShader );
+
+	// Force a particular attribute to index 0.
+
+	if ( parameters.index0AttributeName !== undefined ) {
+
+		gl.bindAttribLocation( program, 0, parameters.index0AttributeName );
+
+	} else if ( parameters.hasPositionAttribute === true ) {
+
+		// below avoids the "Attribute 0 is disabled" performance penalty
+
+		gl.bindAttribLocation( program, 0, 'position' );
+
+	}
+
+	gl.linkProgram( program );
+
+	function onFirstUse( self ) {
+
+		// check for link errors
+		if ( renderer.debug.checkShaderErrors ) {
+
+			const programInfoLog = gl.getProgramInfoLog( program ) || '';
+			const vertexShaderInfoLog = gl.getShaderInfoLog( glVertexShader ) || '';
+			const fragmentShaderInfoLog = gl.getShaderInfoLog( glFragmentShader ) || '';
+
+			const programLog = programInfoLog.trim();
+			const vertexLog = vertexShaderInfoLog.trim();
+			const fragmentLog = fragmentShaderInfoLog.trim();
+
+			let runnable = true;
+			let haveDiagnostics = true;
+
+			if ( gl.getProgramParameter( program, gl.LINK_STATUS ) === false ) {
+
+				runnable = false;
+
+				if ( typeof renderer.debug.onShaderError === 'function' ) {
+
+					renderer.debug.onShaderError( gl, program, glVertexShader, glFragmentShader );
+
+				} else {
+
+					// default error reporting
+
+					const vertexErrors = getShaderErrors( gl, glVertexShader, 'vertex' );
+					const fragmentErrors = getShaderErrors( gl, glFragmentShader, 'fragment' );
+
+					error(
+						'WebGLProgram: Shader Error ' + gl.getError() + ' - ' +
+						'VALIDATE_STATUS ' + gl.getProgramParameter( program, gl.VALIDATE_STATUS ) + '\n\n' +
+						'Material Name: ' + self.name + '\n' +
+						'Material Type: ' + self.type + '\n\n' +
+						'Program Info Log: ' + programLog + '\n' +
+						vertexErrors + '\n' +
+						fragmentErrors
+					);
+
+				}
+
+			} else if ( programLog !== '' ) {
+
+				warn( 'WebGLProgram: Program Info Log:', programLog );
+
+			} else if ( vertexLog === '' || fragmentLog === '' ) {
+
+				haveDiagnostics = false;
+
+			}
+
+			if ( haveDiagnostics ) {
+
+				self.diagnostics = {
+
+					runnable: runnable,
+
+					programLog: programLog,
+
+					vertexShader: {
+
+						log: vertexLog,
+						prefix: prefixVertex
+
+					},
+
+					fragmentShader: {
+
+						log: fragmentLog,
+						prefix: prefixFragment
+
+					}
+
+				};
+
+			}
+
+		}
+
+		// Clean up
+
+		// Crashes in iOS9 and iOS10. #18402
+		// gl.detachShader( program, glVertexShader );
+		// gl.detachShader( program, glFragmentShader );
+
+		gl.deleteShader( glVertexShader );
+		gl.deleteShader( glFragmentShader );
+
+		cachedUniforms = new WebGLUniforms( gl, program );
+		cachedAttributes = fetchAttributeLocations( gl, program );
+
+	}
+
+	// set up caching for uniform locations
+
+	let cachedUniforms;
+
+	this.getUniforms = function () {
+
+		if ( cachedUniforms === undefined ) {
+
+			// Populates cachedUniforms and cachedAttributes
+			onFirstUse( this );
+
+		}
+
+		return cachedUniforms;
+
+	};
+
+	// set up caching for attribute locations
+
+	let cachedAttributes;
+
+	this.getAttributes = function () {
+
+		if ( cachedAttributes === undefined ) {
+
+			// Populates cachedAttributes and cachedUniforms
+			onFirstUse( this );
+
+		}
+
+		return cachedAttributes;
+
+	};
+
+	// indicate when the program is ready to be used. if the KHR_parallel_shader_compile extension isn't supported,
+	// flag the program as ready immediately. It may cause a stall when it's first used.
+
+	let programReady = ( parameters.rendererExtensionParallelShaderCompile === false );
+
+	this.isReady = function () {
+
+		if ( programReady === false ) {
+
+			programReady = gl.getProgramParameter( program, COMPLETION_STATUS_KHR );
+
+		}
+
+		return programReady;
+
+	};
+
+	// free resource
+
+	this.destroy = function () {
+
+		bindingStates.releaseStatesOfProgram( this );
+
+		gl.deleteProgram( program );
+		this.program = undefined;
+
+	};
+
+	//
+
+	this.type = parameters.shaderType;
+	this.name = parameters.shaderName;
+	this.id = programIdCount ++;
+	this.cacheKey = cacheKey;
+	this.usedTimes = 1;
+	this.program = program;
+	this.vertexShader = glVertexShader;
+	this.fragmentShader = glFragmentShader;
+
+	return this;
+
+}
+
+let _id = 0;
+
+class WebGLShaderCache {
+
+	constructor() {
+
+		this.shaderCache = new Map();
+		this.materialCache = new Map();
+
+	}
+
+	update( material, vertexShaderStage, fragmentShaderStage ) {
+
+		const materialShaders = this._getShaderCacheForMaterial( material );
+
+		if ( materialShaders.has( vertexShaderStage ) === false ) {
+
+			materialShaders.add( vertexShaderStage );
+			vertexShaderStage.usedTimes ++;
+
+		}
+
+		if ( materialShaders.has( fragmentShaderStage ) === false ) {
+
+			materialShaders.add( fragmentShaderStage );
+			fragmentShaderStage.usedTimes ++;
+
+		}
+
+		return this;
+
+	}
+
+	remove( material ) {
+
+		const materialShaders = this.materialCache.get( material );
+
+		for ( const shaderStage of materialShaders ) {
+
+			shaderStage.usedTimes --;
+
+			if ( shaderStage.usedTimes === 0 ) this.shaderCache.delete( shaderStage.code );
+
+		}
+
+		this.materialCache.delete( material );
+
+		return this;
+
+	}
+
+	getVertexShaderStage( material ) {
+
+		return this._getShaderStage( material.vertexShader );
+
+	}
+
+	getFragmentShaderStage( material ) {
+
+		return this._getShaderStage( material.fragmentShader );
+
+	}
+
+	dispose() {
+
+		this.shaderCache.clear();
+		this.materialCache.clear();
+
+	}
+
+	_getShaderCacheForMaterial( material ) {
+
+		const cache = this.materialCache;
+		let set = cache.get( material );
+
+		if ( set === undefined ) {
+
+			set = new Set();
+			cache.set( material, set );
+
+		}
+
+		return set;
+
+	}
+
+	_getShaderStage( code ) {
+
+		const cache = this.shaderCache;
+		let stage = cache.get( code );
+
+		if ( stage === undefined ) {
+
+			stage = new WebGLShaderStage( code );
+			cache.set( code, stage );
+
+		}
+
+		return stage;
+
+	}
+
+}
+
+class WebGLShaderStage {
+
+	constructor( code ) {
+
+		this.id = _id ++;
+
+		this.code = code;
+		this.usedTimes = 0;
+
+	}
+
+}
+
+function isPackedRGFormat( format ) {
+
+	return format === RGFormat || format === RG11_EAC_Format || format === RED_GREEN_RGTC2_Format;
+
+}
+
+function WebGLPrograms( renderer, environments, extensions, capabilities, bindingStates, clipping ) {
+
+	const _programLayers = new Layers();
+	const _customShaders = new WebGLShaderCache();
+	const _activeChannels = new Set();
+	const programs = [];
+	const programsMap = new Map();
+
+	const logarithmicDepthBuffer = capabilities.logarithmicDepthBuffer;
+
+	let precision = capabilities.precision;
+
+	const shaderIDs = {
+		MeshDepthMaterial: 'depth',
+		MeshDistanceMaterial: 'distance',
+		MeshNormalMaterial: 'normal',
+		MeshBasicMaterial: 'basic',
+		MeshLambertMaterial: 'lambert',
+		MeshPhongMaterial: 'phong',
+		MeshToonMaterial: 'toon',
+		MeshStandardMaterial: 'physical',
+		MeshPhysicalMaterial: 'physical',
+		MeshMatcapMaterial: 'matcap',
+		LineBasicMaterial: 'basic',
+		LineDashedMaterial: 'dashed',
+		PointsMaterial: 'points',
+		ShadowMaterial: 'shadow',
+		SpriteMaterial: 'sprite'
+	};
+
+	function getChannel( value ) {
+
+		_activeChannels.add( value );
+
+		if ( value === 0 ) return 'uv';
+
+		return `uv${ value }`;
+
+	}
+
+	function getParameters( material, lights, shadows, scene, object, lightProbeGrids ) {
+
+		const fog = scene.fog;
+		const geometry = object.geometry;
+		const environment = ( material.isMeshStandardMaterial || material.isMeshLambertMaterial || material.isMeshPhongMaterial ) ? scene.environment : null;
+
+		const usePMREM = material.isMeshStandardMaterial || ( material.isMeshLambertMaterial && ! material.envMap ) || ( material.isMeshPhongMaterial && ! material.envMap );
+		const envMap = environments.get( material.envMap || environment, usePMREM );
+		const envMapCubeUVHeight = ( !! envMap ) && ( envMap.mapping === CubeUVReflectionMapping ) ? envMap.image.height : null;
+
+		const shaderID = shaderIDs[ material.type ];
+
+		// heuristics to create shader parameters according to lights in the scene
+		// (not to blow over maxLights budget)
+
+		if ( material.precision !== null ) {
+
+			precision = capabilities.getMaxPrecision( material.precision );
+
+			if ( precision !== material.precision ) {
+
+				warn( 'WebGLProgram.getParameters:', material.precision, 'not supported, using', precision, 'instead.' );
+
+			}
+
+		}
+
+		//
+
+		const morphAttribute = geometry.morphAttributes.position || geometry.morphAttributes.normal || geometry.morphAttributes.color;
+		const morphTargetsCount = ( morphAttribute !== undefined ) ? morphAttribute.length : 0;
+
+		let morphTextureStride = 0;
+
+		if ( geometry.morphAttributes.position !== undefined ) morphTextureStride = 1;
+		if ( geometry.morphAttributes.normal !== undefined ) morphTextureStride = 2;
+		if ( geometry.morphAttributes.color !== undefined ) morphTextureStride = 3;
+
+		//
+
+		let vertexShader, fragmentShader;
+		let customVertexShaderID, customFragmentShaderID;
+
+		if ( shaderID ) {
+
+			const shader = ShaderLib[ shaderID ];
+
+			vertexShader = shader.vertexShader;
+			fragmentShader = shader.fragmentShader;
+
+		} else {
+
+			vertexShader = material.vertexShader;
+			fragmentShader = material.fragmentShader;
+
+			const vertexShaderStage = _customShaders.getVertexShaderStage( material );
+			const fragmentShaderStage = _customShaders.getFragmentShaderStage( material );
+
+			_customShaders.update( material, vertexShaderStage, fragmentShaderStage );
+
+			customVertexShaderID = vertexShaderStage.id;
+			customFragmentShaderID = fragmentShaderStage.id;
+
+		}
+
+		const currentRenderTarget = renderer.getRenderTarget();
+		const reversedDepthBuffer = renderer.state.buffers.depth.getReversed();
+
+		const IS_INSTANCEDMESH = object.isInstancedMesh === true;
+		const IS_BATCHEDMESH = object.isBatchedMesh === true;
+
+		const HAS_MAP = !! material.map;
+		const HAS_MATCAP = !! material.matcap;
+		const HAS_ENVMAP = !! envMap;
+		const HAS_AOMAP = !! material.aoMap;
+		const HAS_LIGHTMAP = !! material.lightMap;
+		const HAS_BUMPMAP = !! material.bumpMap && material.wireframe === false;
+		const HAS_NORMALMAP = !! material.normalMap;
+		const HAS_DISPLACEMENTMAP = !! material.displacementMap;
+		const HAS_EMISSIVEMAP = !! material.emissiveMap;
+
+		const HAS_METALNESSMAP = !! material.metalnessMap;
+		const HAS_ROUGHNESSMAP = !! material.roughnessMap;
+
+		const HAS_ANISOTROPY = material.anisotropy > 0;
+		const HAS_CLEARCOAT = material.clearcoat > 0;
+		const HAS_DISPERSION = material.dispersion > 0;
+		const HAS_RETROREFLECTION = material.retroreflectivity > 0;
+		const HAS_IRIDESCENCE = material.iridescence > 0;
+		const HAS_SHEEN = material.sheen > 0;
+		const HAS_TRANSMISSION = material.transmission > 0;
+
+		const HAS_ANISOTROPYMAP = HAS_ANISOTROPY && !! material.anisotropyMap;
+
+		const HAS_CLEARCOATMAP = HAS_CLEARCOAT && !! material.clearcoatMap;
+		const HAS_CLEARCOAT_NORMALMAP = HAS_CLEARCOAT && !! material.clearcoatNormalMap;
+		const HAS_CLEARCOAT_ROUGHNESSMAP = HAS_CLEARCOAT && !! material.clearcoatRoughnessMap;
+
+		const HAS_IRIDESCENCEMAP = HAS_IRIDESCENCE && !! material.iridescenceMap;
+		const HAS_IRIDESCENCE_THICKNESSMAP = HAS_IRIDESCENCE && !! material.iridescenceThicknessMap;
+
+		const HAS_SHEEN_COLORMAP = HAS_SHEEN && !! material.sheenColorMap;
+		const HAS_SHEEN_ROUGHNESSMAP = HAS_SHEEN && !! material.sheenRoughnessMap;
+
+		const HAS_SPECULARMAP = !! material.specularMap;
+		const HAS_SPECULAR_COLORMAP = !! material.specularColorMap;
+		const HAS_SPECULAR_INTENSITYMAP = !! material.specularIntensityMap;
+
+		const HAS_TRANSMISSIONMAP = HAS_TRANSMISSION && !! material.transmissionMap;
+		const HAS_THICKNESSMAP = HAS_TRANSMISSION && !! material.thicknessMap;
+
+		const HAS_GRADIENTMAP = !! material.gradientMap;
+
+		const HAS_ALPHAMAP = !! material.alphaMap;
+
+		const HAS_ALPHATEST = material.alphaTest > 0;
+
+		const HAS_ALPHAHASH = !! material.alphaHash;
+
+		const HAS_EXTENSIONS = !! material.extensions;
+
+		let toneMapping = NoToneMapping;
+
+		if ( material.toneMapped ) {
+
+			if ( currentRenderTarget === null || currentRenderTarget.isXRRenderTarget === true ) {
+
+				toneMapping = renderer.toneMapping;
+
+			}
+
+		}
+
+		const parameters = {
+
+			shaderID: shaderID,
+			shaderType: material.type,
+			shaderName: material.name,
+
+			vertexShader: vertexShader,
+			fragmentShader: fragmentShader,
+			defines: material.defines,
+
+			customVertexShaderID: customVertexShaderID,
+			customFragmentShaderID: customFragmentShaderID,
+
+			isRawShaderMaterial: material.isRawShaderMaterial === true,
+			glslVersion: material.glslVersion,
+
+			precision: precision,
+
+			batching: IS_BATCHEDMESH,
+			batchingColor: IS_BATCHEDMESH && object._colorsTexture !== null,
+			instancing: IS_INSTANCEDMESH,
+			instancingColor: IS_INSTANCEDMESH && object.instanceColor !== null,
+			instancingMorph: IS_INSTANCEDMESH && object.morphTexture !== null,
+
+			outputColorSpace: ( currentRenderTarget === null ) ? renderer.outputColorSpace : ( currentRenderTarget.isXRRenderTarget === true ? currentRenderTarget.texture.colorSpace : ColorManagement.workingColorSpace ),
+			alphaToCoverage: !! material.alphaToCoverage,
+
+			map: HAS_MAP,
+			matcap: HAS_MATCAP,
+			envMap: HAS_ENVMAP,
+			envMapMode: HAS_ENVMAP && envMap.mapping,
+			envMapCubeUVHeight: envMapCubeUVHeight,
+			aoMap: HAS_AOMAP,
+			lightMap: HAS_LIGHTMAP,
+			bumpMap: HAS_BUMPMAP,
+			normalMap: HAS_NORMALMAP,
+			displacementMap: HAS_DISPLACEMENTMAP,
+			emissiveMap: HAS_EMISSIVEMAP,
+
+			normalMapObjectSpace: HAS_NORMALMAP && material.normalMapType === ObjectSpaceNormalMap,
+			normalMapTangentSpace: HAS_NORMALMAP && material.normalMapType === TangentSpaceNormalMap,
+			packedNormalMap: HAS_NORMALMAP && material.normalMapType === TangentSpaceNormalMap && isPackedRGFormat( material.normalMap.format	),
+
+			metalnessMap: HAS_METALNESSMAP,
+			roughnessMap: HAS_ROUGHNESSMAP,
+
+			anisotropy: HAS_ANISOTROPY,
+			anisotropyMap: HAS_ANISOTROPYMAP,
+
+			clearcoat: HAS_CLEARCOAT,
+			clearcoatMap: HAS_CLEARCOATMAP,
+			clearcoatNormalMap: HAS_CLEARCOAT_NORMALMAP,
+			clearcoatRoughnessMap: HAS_CLEARCOAT_ROUGHNESSMAP,
+
+			dispersion: HAS_DISPERSION,
+			retroreflection: HAS_RETROREFLECTION,
+
+			iridescence: HAS_IRIDESCENCE,
+			iridescenceMap: HAS_IRIDESCENCEMAP,
+			iridescenceThicknessMap: HAS_IRIDESCENCE_THICKNESSMAP,
+
+			sheen: HAS_SHEEN,
+			sheenColorMap: HAS_SHEEN_COLORMAP,
+			sheenRoughnessMap: HAS_SHEEN_ROUGHNESSMAP,
+
+			specularMap: HAS_SPECULARMAP,
+			specularColorMap: HAS_SPECULAR_COLORMAP,
+			specularIntensityMap: HAS_SPECULAR_INTENSITYMAP,
+
+			transmission: HAS_TRANSMISSION,
+			transmissionMap: HAS_TRANSMISSIONMAP,
+			thicknessMap: HAS_THICKNESSMAP,
+
+			gradientMap: HAS_GRADIENTMAP,
+
+			opaque: material.transparent === false && material.blending === NormalBlending && material.alphaToCoverage === false,
+
+			alphaMap: HAS_ALPHAMAP,
+			alphaTest: HAS_ALPHATEST,
+			alphaHash: HAS_ALPHAHASH,
+
+			combine: material.combine,
+
+			//
+
+			mapUv: HAS_MAP && getChannel( material.map.channel ),
+			aoMapUv: HAS_AOMAP && getChannel( material.aoMap.channel ),
+			lightMapUv: HAS_LIGHTMAP && getChannel( material.lightMap.channel ),
+			bumpMapUv: HAS_BUMPMAP && getChannel( material.bumpMap.channel ),
+			normalMapUv: HAS_NORMALMAP && getChannel( material.normalMap.channel ),
+			displacementMapUv: HAS_DISPLACEMENTMAP && getChannel( material.displacementMap.channel ),
+			emissiveMapUv: HAS_EMISSIVEMAP && getChannel( material.emissiveMap.channel ),
+
+			metalnessMapUv: HAS_METALNESSMAP && getChannel( material.metalnessMap.channel ),
+			roughnessMapUv: HAS_ROUGHNESSMAP && getChannel( material.roughnessMap.channel ),
+
+			anisotropyMapUv: HAS_ANISOTROPYMAP && getChannel( material.anisotropyMap.channel ),
+
+			clearcoatMapUv: HAS_CLEARCOATMAP && getChannel( material.clearcoatMap.channel ),
+			clearcoatNormalMapUv: HAS_CLEARCOAT_NORMALMAP && getChannel( material.clearcoatNormalMap.channel ),
+			clearcoatRoughnessMapUv: HAS_CLEARCOAT_ROUGHNESSMAP && getChannel( material.clearcoatRoughnessMap.channel ),
+
+			iridescenceMapUv: HAS_IRIDESCENCEMAP && getChannel( material.iridescenceMap.channel ),
+			iridescenceThicknessMapUv: HAS_IRIDESCENCE_THICKNESSMAP && getChannel( material.iridescenceThicknessMap.channel ),
+
+			sheenColorMapUv: HAS_SHEEN_COLORMAP && getChannel( material.sheenColorMap.channel ),
+			sheenRoughnessMapUv: HAS_SHEEN_ROUGHNESSMAP && getChannel( material.sheenRoughnessMap.channel ),
+
+			specularMapUv: HAS_SPECULARMAP && getChannel( material.specularMap.channel ),
+			specularColorMapUv: HAS_SPECULAR_COLORMAP && getChannel( material.specularColorMap.channel ),
+			specularIntensityMapUv: HAS_SPECULAR_INTENSITYMAP && getChannel( material.specularIntensityMap.channel ),
+
+			transmissionMapUv: HAS_TRANSMISSIONMAP && getChannel( material.transmissionMap.channel ),
+			thicknessMapUv: HAS_THICKNESSMAP && getChannel( material.thicknessMap.channel ),
+
+			alphaMapUv: HAS_ALPHAMAP && getChannel( material.alphaMap.channel ),
+
+			//
+
+			vertexTangents: !! geometry.attributes.tangent && ( HAS_NORMALMAP || HAS_ANISOTROPY ),
+			vertexNormals: !! geometry.attributes.normal,
+			vertexColors: material.vertexColors,
+			vertexAlphas: material.vertexColors === true && !! geometry.attributes.color && geometry.attributes.color.itemSize === 4,
+
+			pointsUvs: object.isPoints === true && !! geometry.attributes.uv && ( HAS_MAP || HAS_ALPHAMAP ),
+
+			fog: !! fog,
+			useFog: material.fog === true,
+			fogExp2: ( !! fog && fog.isFogExp2 ),
+
+			flatShading: material.wireframe === false && (
+				material.flatShading === true ||
+				( geometry.attributes.normal === undefined && HAS_NORMALMAP === false &&
+					( material.isMeshLambertMaterial || material.isMeshPhongMaterial || material.isMeshStandardMaterial || material.isMeshPhysicalMaterial )
+				)
+			),
+
+			sizeAttenuation: material.sizeAttenuation === true,
+			logarithmicDepthBuffer: logarithmicDepthBuffer,
+			reversedDepthBuffer: reversedDepthBuffer,
+
+			skinning: object.isSkinnedMesh === true,
+
+			hasPositionAttribute: geometry.attributes.position !== undefined,
+
+			morphTargets: geometry.morphAttributes.position !== undefined,
+			morphNormals: geometry.morphAttributes.normal !== undefined,
+			morphColors: geometry.morphAttributes.color !== undefined,
+			morphTargetsCount: morphTargetsCount,
+			morphTextureStride: morphTextureStride,
+
+			numSunLights: lights.sun.length,
+			numDirLights: lights.directional.length,
+			numPointLights: lights.point.length,
+			numSpotLights: lights.spot.length,
+			numSpotLightMaps: lights.spotLightMap.length,
+			numRectAreaLights: lights.rectArea.length,
+			numHemiLights: lights.hemi.length,
+
+			numSunLightShadows: lights.sunShadowMap.length,
+			numDirLightShadows: lights.directionalShadowMap.length,
+			numPointLightShadows: lights.pointShadowMap.length,
+			numSpotLightShadows: lights.spotShadowMap.length,
+			numSpotLightShadowsWithMaps: lights.numSpotLightShadowsWithMaps,
+
+			numLightProbes: lights.numLightProbes,
+
+			numLightProbeGrids: lightProbeGrids.length,
+
+			numClippingPlanes: clipping.numPlanes,
+			numClipIntersection: clipping.numIntersection,
+
+			dithering: material.dithering,
+
+			shadowMapEnabled: renderer.shadowMap.enabled && shadows.length > 0,
+			shadowMapType: renderer.shadowMap.type,
+
+			toneMapping: toneMapping,
+
+			decodeVideoTexture: HAS_MAP && ( material.map.isVideoTexture === true ) && ( ColorManagement.getTransfer( material.map.colorSpace ) === SRGBTransfer ),
+			decodeVideoTextureEmissive: HAS_EMISSIVEMAP && ( material.emissiveMap.isVideoTexture === true ) && ( ColorManagement.getTransfer( material.emissiveMap.colorSpace ) === SRGBTransfer ),
+
+			premultipliedAlpha: material.premultipliedAlpha,
+
+			doubleSided: material.side === DoubleSide,
+			flipSided: material.side === BackSide,
+
+			useDepthPacking: material.depthPacking >= 0,
+			depthPacking: material.depthPacking || 0,
+
+			index0AttributeName: material.index0AttributeName,
+
+			extensionClipCullDistance: HAS_EXTENSIONS && material.extensions.clipCullDistance === true && extensions.has( 'WEBGL_clip_cull_distance' ),
+			extensionMultiDraw: ( HAS_EXTENSIONS && material.extensions.multiDraw === true || IS_BATCHEDMESH ) && extensions.has( 'WEBGL_multi_draw' ),
+
+			rendererExtensionParallelShaderCompile: extensions.has( 'KHR_parallel_shader_compile' ),
+
+			customProgramCacheKey: material.customProgramCacheKey()
+
+		};
+
+		// the usage of getChannel() determines the active texture channels for this shader
+
+		parameters.vertexUv1s = _activeChannels.has( 1 );
+		parameters.vertexUv2s = _activeChannels.has( 2 );
+		parameters.vertexUv3s = _activeChannels.has( 3 );
+
+		_activeChannels.clear();
+
+		return parameters;
+
+	}
+
+	function getProgramCacheKey( parameters ) {
+
+		const array = [];
+
+		if ( parameters.shaderID ) {
+
+			array.push( parameters.shaderID );
+
+		} else {
+
+			array.push( parameters.customVertexShaderID );
+			array.push( parameters.customFragmentShaderID );
+
+		}
+
+		if ( parameters.defines !== undefined ) {
+
+			for ( const name in parameters.defines ) {
+
+				array.push( name );
+				array.push( parameters.defines[ name ] );
+
+			}
+
+		}
+
+		if ( parameters.isRawShaderMaterial === false ) {
+
+			getProgramCacheKeyParameters( array, parameters );
+			getProgramCacheKeyBooleans( array, parameters );
+			array.push( renderer.outputColorSpace );
+
+		}
+
+		array.push( parameters.customProgramCacheKey );
+
+		return array.join();
+
+	}
+
+	function getProgramCacheKeyParameters( array, parameters ) {
+
+		array.push( parameters.precision );
+		array.push( parameters.outputColorSpace );
+		array.push( parameters.envMapMode );
+		array.push( parameters.envMapCubeUVHeight );
+		array.push( parameters.mapUv );
+		array.push( parameters.alphaMapUv );
+		array.push( parameters.lightMapUv );
+		array.push( parameters.aoMapUv );
+		array.push( parameters.bumpMapUv );
+		array.push( parameters.normalMapUv );
+		array.push( parameters.displacementMapUv );
+		array.push( parameters.emissiveMapUv );
+		array.push( parameters.metalnessMapUv );
+		array.push( parameters.roughnessMapUv );
+		array.push( parameters.anisotropyMapUv );
+		array.push( parameters.clearcoatMapUv );
+		array.push( parameters.clearcoatNormalMapUv );
+		array.push( parameters.clearcoatRoughnessMapUv );
+		array.push( parameters.iridescenceMapUv );
+		array.push( parameters.iridescenceThicknessMapUv );
+		array.push( parameters.sheenColorMapUv );
+		array.push( parameters.sheenRoughnessMapUv );
+		array.push( parameters.specularMapUv );
+		array.push( parameters.specularColorMapUv );
+		array.push( parameters.specularIntensityMapUv );
+		array.push( parameters.transmissionMapUv );
+		array.push( parameters.thicknessMapUv );
+		array.push( parameters.combine );
+		array.push( parameters.fogExp2 );
+		array.push( parameters.sizeAttenuation );
+		array.push( parameters.morphTargetsCount );
+		array.push( parameters.morphAttributeCount );
+		array.push( parameters.numSunLights );
+		array.push( parameters.numDirLights );
+		array.push( parameters.numPointLights );
+		array.push( parameters.numSpotLights );
+		array.push( parameters.numSpotLightMaps );
+		array.push( parameters.numHemiLights );
+		array.push( parameters.numRectAreaLights );
+		array.push( parameters.numSunLightShadows );
+		array.push( parameters.numDirLightShadows );
+		array.push( parameters.numPointLightShadows );
+		array.push( parameters.numSpotLightShadows );
+		array.push( parameters.numSpotLightShadowsWithMaps );
+		array.push( parameters.numLightProbes );
+		array.push( parameters.shadowMapType );
+		array.push( parameters.toneMapping );
+		array.push( parameters.numClippingPlanes );
+		array.push( parameters.numClipIntersection );
+		array.push( parameters.depthPacking );
+
+	}
+
+	function getProgramCacheKeyBooleans( array, parameters ) {
+
+		_programLayers.disableAll();
+
+		if ( parameters.instancing )
+			_programLayers.enable( 0 );
+		if ( parameters.instancingColor )
+			_programLayers.enable( 1 );
+		if ( parameters.instancingMorph )
+			_programLayers.enable( 2 );
+		if ( parameters.matcap )
+			_programLayers.enable( 3 );
+		if ( parameters.envMap )
+			_programLayers.enable( 4 );
+		if ( parameters.normalMapObjectSpace )
+			_programLayers.enable( 5 );
+		if ( parameters.normalMapTangentSpace )
+			_programLayers.enable( 6 );
+		if ( parameters.clearcoat )
+			_programLayers.enable( 7 );
+		if ( parameters.iridescence )
+			_programLayers.enable( 8 );
+		if ( parameters.alphaTest )
+			_programLayers.enable( 9 );
+		if ( parameters.vertexColors )
+			_programLayers.enable( 10 );
+		if ( parameters.vertexAlphas )
+			_programLayers.enable( 11 );
+		if ( parameters.vertexUv1s )
+			_programLayers.enable( 12 );
+		if ( parameters.vertexUv2s )
+			_programLayers.enable( 13 );
+		if ( parameters.vertexUv3s )
+			_programLayers.enable( 14 );
+		if ( parameters.vertexTangents )
+			_programLayers.enable( 15 );
+		if ( parameters.anisotropy )
+			_programLayers.enable( 16 );
+		if ( parameters.alphaHash )
+			_programLayers.enable( 17 );
+		if ( parameters.batching )
+			_programLayers.enable( 18 );
+		if ( parameters.dispersion )
+			_programLayers.enable( 19 );
+		if ( parameters.retroreflection )
+			_programLayers.enable( 24 );
+		if ( parameters.batchingColor )
+			_programLayers.enable( 20 );
+		if ( parameters.gradientMap )
+			_programLayers.enable( 21 );
+		if ( parameters.packedNormalMap )
+			_programLayers.enable( 22 );
+		if ( parameters.vertexNormals )
+			_programLayers.enable( 23 );
+
+		array.push( _programLayers.mask );
+		_programLayers.disableAll();
+
+		if ( parameters.fog )
+			_programLayers.enable( 0 );
+		if ( parameters.useFog )
+			_programLayers.enable( 1 );
+		if ( parameters.flatShading )
+			_programLayers.enable( 2 );
+		if ( parameters.logarithmicDepthBuffer )
+			_programLayers.enable( 3 );
+		if ( parameters.reversedDepthBuffer )
+			_programLayers.enable( 4 );
+		if ( parameters.skinning )
+			_programLayers.enable( 5 );
+		if ( parameters.morphTargets )
+			_programLayers.enable( 6 );
+		if ( parameters.morphNormals )
+			_programLayers.enable( 7 );
+		if ( parameters.morphColors )
+			_programLayers.enable( 8 );
+		if ( parameters.premultipliedAlpha )
+			_programLayers.enable( 9 );
+		if ( parameters.shadowMapEnabled )
+			_programLayers.enable( 10 );
+		if ( parameters.doubleSided )
+			_programLayers.enable( 11 );
+		if ( parameters.flipSided )
+			_programLayers.enable( 12 );
+		if ( parameters.useDepthPacking )
+			_programLayers.enable( 13 );
+		if ( parameters.dithering )
+			_programLayers.enable( 14 );
+		if ( parameters.transmission )
+			_programLayers.enable( 15 );
+		if ( parameters.sheen )
+			_programLayers.enable( 16 );
+		if ( parameters.opaque )
+			_programLayers.enable( 17 );
+		if ( parameters.pointsUvs )
+			_programLayers.enable( 18 );
+		if ( parameters.decodeVideoTexture )
+			_programLayers.enable( 19 );
+		if ( parameters.decodeVideoTextureEmissive )
+			_programLayers.enable( 20 );
+		if ( parameters.alphaToCoverage )
+			_programLayers.enable( 21 );
+		if ( parameters.numLightProbeGrids > 0 )
+			_programLayers.enable( 22 );
+		if ( parameters.hasPositionAttribute )
+			_programLayers.enable( 23 );
+
+		array.push( _programLayers.mask );
+
+	}
+
+	function getUniforms( material ) {
+
+		const shaderID = shaderIDs[ material.type ];
+		let uniforms;
+
+		if ( shaderID ) {
+
+			const shader = ShaderLib[ shaderID ];
+			uniforms = UniformsUtils.clone( shader.uniforms );
+
+		} else {
+
+			uniforms = material.uniforms;
+
+		}
+
+		return uniforms;
+
+	}
+
+	function acquireProgram( parameters, cacheKey ) {
+
+		let program = programsMap.get( cacheKey );
+
+		if ( program !== undefined ) {
+
+			++ program.usedTimes;
+
+		} else {
+
+			program = new WebGLProgram( renderer, cacheKey, parameters, bindingStates );
+			programs.push( program );
+
+			programsMap.set( cacheKey, program );
+
+		}
+
+		return program;
+
+	}
+
+	function releaseProgram( program ) {
+
+		if ( -- program.usedTimes === 0 ) {
+
+			// Remove from unordered set
+			const i = programs.indexOf( program );
+			programs[ i ] = programs[ programs.length - 1 ];
+			programs.pop();
+
+			// Remove from map
+			programsMap.delete( program.cacheKey );
+
+			// Free WebGL resources
+			program.destroy();
+
+		}
+
+	}
+
+	function releaseShaderCache( material ) {
+
+		_customShaders.remove( material );
+
+	}
+
+	function dispose() {
+
+		_customShaders.dispose();
+
+	}
+
+	return {
+		getParameters: getParameters,
+		getProgramCacheKey: getProgramCacheKey,
+		getUniforms: getUniforms,
+		acquireProgram: acquireProgram,
+		releaseProgram: releaseProgram,
+		releaseShaderCache: releaseShaderCache,
+		// Exposed for resource monitoring & error feedback via renderer.info:
+		programs: programs,
+		dispose: dispose
+	};
+
+}
+
+function WebGLProperties() {
+
+	let properties = new WeakMap();
+
+	function has( object ) {
+
+		return properties.has( object );
+
+	}
+
+	function get( object ) {
+
+		let map = properties.get( object );
+
+		if ( map === undefined ) {
+
+			map = {};
+			properties.set( object, map );
+
+		}
+
+		return map;
+
+	}
+
+	function remove( object ) {
+
+		properties.delete( object );
+
+	}
+
+	function update( object, key, value ) {
+
+		properties.get( object )[ key ] = value;
+
+	}
+
+	function dispose() {
+
+		properties = new WeakMap();
+
+	}
+
+	return {
+		has: has,
+		get: get,
+		remove: remove,
+		update: update,
+		dispose: dispose
+	};
+
+}
+
+function painterSortStable( a, b ) {
+
+	if ( a.groupOrder !== b.groupOrder ) {
+
+		return a.groupOrder - b.groupOrder;
+
+	} else if ( a.renderOrder !== b.renderOrder ) {
+
+		return a.renderOrder - b.renderOrder;
+
+	} else if ( a.material.id !== b.material.id ) {
+
+		return a.material.id - b.material.id;
+
+	} else if ( a.materialVariant !== b.materialVariant ) {
+
+		return a.materialVariant - b.materialVariant;
+
+	} else if ( a.z !== b.z ) {
+
+		return a.z - b.z;
+
+	} else {
+
+		return a.id - b.id;
+
+	}
+
+}
+
+function reversePainterSortStable( a, b ) {
+
+	if ( a.groupOrder !== b.groupOrder ) {
+
+		return a.groupOrder - b.groupOrder;
+
+	} else if ( a.renderOrder !== b.renderOrder ) {
+
+		return a.renderOrder - b.renderOrder;
+
+	} else if ( a.z !== b.z ) {
+
+		return b.z - a.z;
+
+	} else {
+
+		return a.id - b.id;
+
+	}
+
+}
+
+
+function WebGLRenderList() {
+
+	const renderItems = [];
+	let renderItemsIndex = 0;
+
+	const opaque = [];
+	const transmissive = [];
+	const transparent = [];
+
+	function init() {
+
+		renderItemsIndex = 0;
+
+		opaque.length = 0;
+		transmissive.length = 0;
+		transparent.length = 0;
+
+	}
+
+	function materialVariant( object ) {
+
+		let variant = 0;
+		if ( object.isInstancedMesh ) variant += 2;
+		if ( object.isSkinnedMesh ) variant += 1;
+		return variant;
+
+	}
+
+	function getNextRenderItem( object, geometry, material, groupOrder, z, group ) {
+
+		let renderItem = renderItems[ renderItemsIndex ];
+
+		if ( renderItem === undefined ) {
+
+			renderItem = {
+				id: object.id,
+				object: object,
+				geometry: geometry,
+				material: material,
+				materialVariant: materialVariant( object ),
+				groupOrder: groupOrder,
+				renderOrder: object.renderOrder,
+				z: z,
+				group: group
+			};
+
+			renderItems[ renderItemsIndex ] = renderItem;
+
+		} else {
+
+			renderItem.id = object.id;
+			renderItem.object = object;
+			renderItem.geometry = geometry;
+			renderItem.material = material;
+			renderItem.materialVariant = materialVariant( object );
+			renderItem.groupOrder = groupOrder;
+			renderItem.renderOrder = object.renderOrder;
+			renderItem.z = z;
+			renderItem.group = group;
+
+		}
+
+		renderItemsIndex ++;
+
+		return renderItem;
+
+	}
+
+	function push( object, geometry, material, groupOrder, z, group, camera ) {
+
+		// with a reversed depth buffer the projected z is inverted
+
+		if ( camera.reversedDepth === true ) z = - z;
+
+		const renderItem = getNextRenderItem( object, geometry, material, groupOrder, z, group );
+
+		if ( material.transmission > 0.0 ) {
+
+			transmissive.push( renderItem );
+
+		} else if ( material.transparent === true ) {
+
+			transparent.push( renderItem );
+
+		} else {
+
+			opaque.push( renderItem );
+
+		}
+
+	}
+
+	function unshift( object, geometry, material, groupOrder, z, group ) {
+
+		const renderItem = getNextRenderItem( object, geometry, material, groupOrder, z, group );
+
+		if ( material.transmission > 0.0 ) {
+
+			transmissive.unshift( renderItem );
+
+		} else if ( material.transparent === true ) {
+
+			transparent.unshift( renderItem );
+
+		} else {
+
+			opaque.unshift( renderItem );
+
+		}
+
+	}
+
+	function sort( customOpaqueSort, customTransparentSort ) {
+
+		if ( opaque.length > 1 ) opaque.sort( customOpaqueSort || painterSortStable );
+		if ( transmissive.length > 1 ) transmissive.sort( customTransparentSort || reversePainterSortStable );
+		if ( transparent.length > 1 ) transparent.sort( customTransparentSort || reversePainterSortStable );
+
+	}
+
+	function finish() {
+
+		// Clear references from inactive renderItems in the list
+
+		for ( let i = renderItemsIndex, il = renderItems.length; i < il; i ++ ) {
+
+			const renderItem = renderItems[ i ];
+
+			if ( renderItem.id === null ) break;
+
+			renderItem.id = null;
+			renderItem.object = null;
+			renderItem.geometry = null;
+			renderItem.material = null;
+			renderItem.group = null;
+
+		}
+
+	}
+
+	return {
+
+		opaque: opaque,
+		transmissive: transmissive,
+		transparent: transparent,
+
+		init: init,
+		push: push,
+		unshift: unshift,
+		finish: finish,
+
+		sort: sort
+	};
+
+}
+
+function WebGLRenderLists() {
+
+	let lists = new WeakMap();
+
+	function get( scene, renderCallDepth ) {
+
+		const listArray = lists.get( scene );
+		let list;
+
+		if ( listArray === undefined ) {
+
+			list = new WebGLRenderList();
+			lists.set( scene, [ list ] );
+
+		} else {
+
+			if ( renderCallDepth >= listArray.length ) {
+
+				list = new WebGLRenderList();
+				listArray.push( list );
+
+			} else {
+
+				list = listArray[ renderCallDepth ];
+
+			}
+
+		}
+
+		return list;
+
+	}
+
+	function dispose() {
+
+		lists = new WeakMap();
+
+	}
+
+	return {
+		get: get,
+		dispose: dispose
+	};
+
+}
+
+function UniformsCache() {
+
+	const lights = {};
+
+	return {
+
+		get: function ( light ) {
+
+			if ( lights[ light.id ] !== undefined ) {
+
+				return lights[ light.id ];
+
+			}
+
+			let uniforms;
+
+			switch ( light.type ) {
+
+				case 'SunLight':
+				case 'DirectionalLight':
+					uniforms = {
+						direction: new Vector3(),
+						color: new Color()
+					};
+					break;
+
+				case 'SpotLight':
+					uniforms = {
+						position: new Vector3(),
+						direction: new Vector3(),
+						color: new Color(),
+						distance: 0,
+						coneCos: 0,
+						penumbraCos: 0,
+						decay: 0
+					};
+					break;
+
+				case 'PointLight':
+					uniforms = {
+						position: new Vector3(),
+						color: new Color(),
+						distance: 0,
+						decay: 0
+					};
+					break;
+
+				case 'HemisphereLight':
+					uniforms = {
+						direction: new Vector3(),
+						skyColor: new Color(),
+						groundColor: new Color()
+					};
+					break;
+
+				case 'RectAreaLight':
+					uniforms = {
+						color: new Color(),
+						position: new Vector3(),
+						halfWidth: new Vector3(),
+						halfHeight: new Vector3()
+					};
+					break;
+
+			}
+
+			lights[ light.id ] = uniforms;
+
+			return uniforms;
+
+		}
+
+	};
+
+}
+
+function ShadowUniformsCache() {
+
+	const lights = {};
+
+	return {
+
+		get: function ( light ) {
+
+			if ( lights[ light.id ] !== undefined ) {
+
+				return lights[ light.id ];
+
+			}
+
+			let uniforms;
+
+			switch ( light.type ) {
+
+				case 'SunLight':
+				case 'DirectionalLight':
+					uniforms = {
+						shadowIntensity: 1,
+						shadowBias: 0,
+						shadowNormalBias: 0,
+						shadowRadius: 1,
+						shadowMapSize: new Vector2()
+					};
+					break;
+
+				case 'SpotLight':
+					uniforms = {
+						shadowIntensity: 1,
+						shadowBias: 0,
+						shadowNormalBias: 0,
+						shadowRadius: 1,
+						shadowMapSize: new Vector2()
+					};
+					break;
+
+				case 'PointLight':
+					uniforms = {
+						shadowIntensity: 1,
+						shadowBias: 0,
+						shadowNormalBias: 0,
+						shadowRadius: 1,
+						shadowMapSize: new Vector2(),
+						shadowCameraNear: 1,
+						shadowCameraFar: 1000
+					};
+					break;
+
+				// TODO (abelnation): set RectAreaLight shadow uniforms
+
+			}
+
+			lights[ light.id ] = uniforms;
+
+			return uniforms;
+
+		}
+
+	};
+
+}
+
+
+
+let nextVersion = 0;
+
+function shadowCastingAndTexturingLightsFirst( lightA, lightB ) {
+
+	return ( lightB.castShadow ? 2 : 0 ) - ( lightA.castShadow ? 2 : 0 ) + ( lightB.map ? 1 : 0 ) - ( lightA.map ? 1 : 0 );
+
+}
+
+function WebGLLights( extensions ) {
+
+	const cache = new UniformsCache();
+
+	const shadowCache = ShadowUniformsCache();
+
+	const state = {
+
+		version: 0,
+
+		hash: {
+			sunLength: -1,
+			directionalLength: -1,
+			pointLength: -1,
+			spotLength: -1,
+			rectAreaLength: -1,
+			hemiLength: -1,
+
+			numSunShadows: -1,
+			numDirectionalShadows: -1,
+			numPointShadows: -1,
+			numSpotShadows: -1,
+			numSpotMaps: -1,
+
+			numLightProbes: -1
+		},
+
+		ambient: [ 0, 0, 0 ],
+		probe: [],
+		sun: [],
+		sunShadow: [],
+		sunShadowMap: [],
+		sunShadowMatrix: [],
+		sunShadowCascade: [],
+		directional: [],
+		directionalShadow: [],
+		directionalShadowMap: [],
+		directionalShadowMatrix: [],
+		spot: [],
+		spotLightMap: [],
+		spotShadow: [],
+		spotShadowMap: [],
+		spotLightMatrix: [],
+		rectArea: [],
+		rectAreaLTC1: null,
+		rectAreaLTC2: null,
+		point: [],
+		pointShadow: [],
+		pointShadowMap: [],
+		pointShadowMatrix: [],
+		hemi: [],
+		numSpotLightShadowsWithMaps: 0,
+		numLightProbes: 0
+
+	};
+
+	for ( let i = 0; i < 9; i ++ ) state.probe.push( new Vector3() );
+
+	const vector3 = new Vector3();
+	const matrix4 = new Matrix4();
+	const matrix42 = new Matrix4();
+
+	function setup( lights ) {
+
+		let r = 0, g = 0, b = 0;
+
+		for ( let i = 0; i < 9; i ++ ) state.probe[ i ].set( 0, 0, 0 );
+
+		let sunLength = 0;
+		let numSunShadows = 0;
+		let numSunShadowCascades = 0;
+		let directionalLength = 0;
+		let pointLength = 0;
+		let spotLength = 0;
+		let rectAreaLength = 0;
+		let hemiLength = 0;
+
+		let numDirectionalShadows = 0;
+		let numPointShadows = 0;
+		let numSpotShadows = 0;
+		let numSpotMaps = 0;
+		let numSpotShadowsWithMaps = 0;
+
+		let numLightProbes = 0;
+
+		// ordering : [shadow casting + map texturing, map texturing, shadow casting, none ]
+		lights.sort( shadowCastingAndTexturingLightsFirst );
+
+		for ( let i = 0, l = lights.length; i < l; i ++ ) {
+
+			const light = lights[ i ];
+
+			const color = light.color;
+			const intensity = light.intensity;
+			const distance = light.distance;
+
+			let shadowMap = null;
+
+			if ( light.shadow && light.shadow.map ) {
+
+				if ( light.shadow.map.texture.format === RGFormat ) {
+
+					// VSM uses color texture with blurred mean/std_dev
+					shadowMap = light.shadow.map.texture;
+
+				} else {
+
+					// Other types use depth texture
+					shadowMap = light.shadow.map.depthTexture || light.shadow.map.texture;
+
+				}
+
+			}
+
+			if ( light.isAmbientLight ) {
+
+				r += color.r * intensity;
+				g += color.g * intensity;
+				b += color.b * intensity;
+
+			} else if ( light.isLightProbe ) {
+
+				for ( let j = 0; j < 9; j ++ ) {
+
+					state.probe[ j ].addScaledVector( light.sh.coefficients[ j ], intensity );
+
+				}
+
+				numLightProbes ++;
+
+			} else if ( light.isSunLight ) {
+
+				const uniforms = cache.get( light );
+
+				uniforms.color.copy( light.color ).multiplyScalar( light.intensity );
+
+				if ( light.castShadow ) {
+
+					const shadow = light.shadow;
+
+					const shadowUniforms = shadowCache.get( light );
+
+					shadowUniforms.shadowIntensity = shadow.intensity;
+					shadowUniforms.shadowBias = shadow.bias;
+					shadowUniforms.shadowNormalBias = shadow.normalBias;
+					shadowUniforms.shadowRadius = shadow.radius;
+					shadowUniforms.shadowMapSize.copy( shadow.mapSize ).multiply( shadow.getFrameExtents() );
+
+					state.sunShadow[ numSunShadows ] = shadowUniforms;
+					state.sunShadowMap[ numSunShadows ] = shadowMap;
+
+					const cascadeCount = shadow.getViewportCount();
+
+					for ( let j = 0; j < cascadeCount; j ++ ) {
+
+						state.sunShadowMatrix[ numSunShadowCascades + j ] = shadow.getMatrix( j );
+						state.sunShadowCascade[ numSunShadowCascades + j ] = shadow._cascadeData[ j ];
+
+					}
+
+					numSunShadowCascades += cascadeCount;
+					numSunShadows ++;
+
+				}
+
+				state.sun[ sunLength ] = uniforms;
+
+				sunLength ++;
+
+			} else if ( light.isDirectionalLight ) {
+
+				const uniforms = cache.get( light );
+
+				uniforms.color.copy( light.color ).multiplyScalar( light.intensity );
+
+				if ( light.castShadow ) {
+
+					const shadow = light.shadow;
+
+					const shadowUniforms = shadowCache.get( light );
+
+					shadowUniforms.shadowIntensity = shadow.intensity;
+					shadowUniforms.shadowBias = shadow.bias;
+					shadowUniforms.shadowNormalBias = shadow.normalBias;
+					shadowUniforms.shadowRadius = shadow.radius;
+					shadowUniforms.shadowMapSize = shadow.mapSize;
+
+					state.directionalShadow[ directionalLength ] = shadowUniforms;
+					state.directionalShadowMap[ directionalLength ] = shadowMap;
+					state.directionalShadowMatrix[ directionalLength ] = light.shadow.matrix;
+
+					numDirectionalShadows ++;
+
+				}
+
+				state.directional[ directionalLength ] = uniforms;
+
+				directionalLength ++;
+
+			} else if ( light.isSpotLight ) {
+
+				const uniforms = cache.get( light );
+
+				uniforms.position.setFromMatrixPosition( light.matrixWorld );
+
+				uniforms.color.copy( color ).multiplyScalar( intensity );
+				uniforms.distance = distance;
+
+				uniforms.coneCos = Math.cos( light.angle );
+				uniforms.penumbraCos = Math.cos( light.angle * ( 1 - light.penumbra ) );
+				uniforms.decay = light.decay;
+
+				state.spot[ spotLength ] = uniforms;
+
+				const shadow = light.shadow;
+
+				if ( light.map ) {
+
+					state.spotLightMap[ numSpotMaps ] = light.map;
+					numSpotMaps ++;
+
+					// make sure the lightMatrix is up to date
+					// TODO : do it if required only
+					shadow.updateMatrices( light );
+
+					if ( light.castShadow ) numSpotShadowsWithMaps ++;
+
+				}
+
+				state.spotLightMatrix[ spotLength ] = shadow.matrix;
+
+				if ( light.castShadow ) {
+
+					const shadowUniforms = shadowCache.get( light );
+
+					shadowUniforms.shadowIntensity = shadow.intensity;
+					shadowUniforms.shadowBias = shadow.bias;
+					shadowUniforms.shadowNormalBias = shadow.normalBias;
+					shadowUniforms.shadowRadius = shadow.radius;
+					shadowUniforms.shadowMapSize = shadow.mapSize;
+
+					state.spotShadow[ spotLength ] = shadowUniforms;
+					state.spotShadowMap[ spotLength ] = shadowMap;
+
+					numSpotShadows ++;
+
+				}
+
+				spotLength ++;
+
+			} else if ( light.isRectAreaLight ) {
+
+				const uniforms = cache.get( light );
+
+				uniforms.color.copy( color ).multiplyScalar( intensity );
+
+				uniforms.halfWidth.set( light.width * 0.5, 0.0, 0.0 );
+				uniforms.halfHeight.set( 0.0, light.height * 0.5, 0.0 );
+
+				state.rectArea[ rectAreaLength ] = uniforms;
+
+				rectAreaLength ++;
+
+			} else if ( light.isPointLight ) {
+
+				const uniforms = cache.get( light );
+
+				uniforms.color.copy( light.color ).multiplyScalar( light.intensity );
+				uniforms.distance = light.distance;
+				uniforms.decay = light.decay;
+
+				if ( light.castShadow ) {
+
+					const shadow = light.shadow;
+
+					const shadowUniforms = shadowCache.get( light );
+
+					shadowUniforms.shadowIntensity = shadow.intensity;
+					shadowUniforms.shadowBias = shadow.bias;
+					shadowUniforms.shadowNormalBias = shadow.normalBias;
+					shadowUniforms.shadowRadius = shadow.radius;
+					shadowUniforms.shadowMapSize = shadow.mapSize;
+					shadowUniforms.shadowCameraNear = shadow.camera.near;
+					shadowUniforms.shadowCameraFar = shadow.camera.far;
+
+					state.pointShadow[ pointLength ] = shadowUniforms;
+					state.pointShadowMap[ pointLength ] = shadowMap;
+					state.pointShadowMatrix[ pointLength ] = light.shadow.matrix;
+
+					numPointShadows ++;
+
+				}
+
+				state.point[ pointLength ] = uniforms;
+
+				pointLength ++;
+
+			} else if ( light.isHemisphereLight ) {
+
+				const uniforms = cache.get( light );
+
+				uniforms.skyColor.copy( light.color ).multiplyScalar( intensity );
+				uniforms.groundColor.copy( light.groundColor ).multiplyScalar( intensity );
+
+				state.hemi[ hemiLength ] = uniforms;
+
+				hemiLength ++;
+
+			}
+
+		}
+
+		if ( rectAreaLength > 0 ) {
+
+			if ( extensions.has( 'OES_texture_float_linear' ) === true ) {
+
+				state.rectAreaLTC1 = UniformsLib.LTC_FLOAT_1;
+				state.rectAreaLTC2 = UniformsLib.LTC_FLOAT_2;
+
+			} else {
+
+				state.rectAreaLTC1 = UniformsLib.LTC_HALF_1;
+				state.rectAreaLTC2 = UniformsLib.LTC_HALF_2;
+
+			}
+
+		}
+
+		state.ambient[ 0 ] = r;
+		state.ambient[ 1 ] = g;
+		state.ambient[ 2 ] = b;
+
+		const hash = state.hash;
+
+		if ( hash.sunLength !== sunLength ||
+			hash.directionalLength !== directionalLength ||
+			hash.pointLength !== pointLength ||
+			hash.spotLength !== spotLength ||
+			hash.rectAreaLength !== rectAreaLength ||
+			hash.hemiLength !== hemiLength ||
+			hash.numSunShadows !== numSunShadows ||
+			hash.numDirectionalShadows !== numDirectionalShadows ||
+			hash.numPointShadows !== numPointShadows ||
+			hash.numSpotShadows !== numSpotShadows ||
+			hash.numSpotMaps !== numSpotMaps ||
+			hash.numLightProbes !== numLightProbes ) {
+
+			state.sun.length = sunLength;
+			state.directional.length = directionalLength;
+			state.spot.length = spotLength;
+			state.rectArea.length = rectAreaLength;
+			state.point.length = pointLength;
+			state.hemi.length = hemiLength;
+
+			state.sunShadow.length = numSunShadows;
+			state.sunShadowMap.length = numSunShadows;
+			state.sunShadowMatrix.length = numSunShadowCascades;
+			state.sunShadowCascade.length = numSunShadowCascades;
+			state.directionalShadow.length = numDirectionalShadows;
+			state.directionalShadowMap.length = numDirectionalShadows;
+			state.directionalShadowMatrix.length = numDirectionalShadows;
+			state.pointShadow.length = numPointShadows;
+			state.pointShadowMap.length = numPointShadows;
+			state.pointShadowMatrix.length = numPointShadows;
+			state.spotShadow.length = numSpotShadows;
+			state.spotShadowMap.length = numSpotShadows;
+			state.spotLightMatrix.length = numSpotShadows + numSpotMaps - numSpotShadowsWithMaps;
+			state.spotLightMap.length = numSpotMaps;
+			state.numSpotLightShadowsWithMaps = numSpotShadowsWithMaps;
+			state.numLightProbes = numLightProbes;
+
+			hash.sunLength = sunLength;
+			hash.directionalLength = directionalLength;
+			hash.pointLength = pointLength;
+			hash.spotLength = spotLength;
+			hash.rectAreaLength = rectAreaLength;
+			hash.hemiLength = hemiLength;
+
+			hash.numSunShadows = numSunShadows;
+			hash.numDirectionalShadows = numDirectionalShadows;
+			hash.numPointShadows = numPointShadows;
+			hash.numSpotShadows = numSpotShadows;
+			hash.numSpotMaps = numSpotMaps;
+
+			hash.numLightProbes = numLightProbes;
+
+			state.version = nextVersion ++;
+
+		}
+
+	}
+
+	function setupView( lights, camera ) {
+
+		let sunLength = 0;
+		let directionalLength = 0;
+		let pointLength = 0;
+		let spotLength = 0;
+		let rectAreaLength = 0;
+		let hemiLength = 0;
+
+		const viewMatrix = camera.matrixWorldInverse;
+
+		for ( let i = 0, l = lights.length; i < l; i ++ ) {
+
+			const light = lights[ i ];
+
+			if ( light.isSunLight ) {
+
+				const uniforms = state.sun[ sunLength ];
+
+				uniforms.direction.setFromMatrixPosition( light.matrixWorld );
+				uniforms.direction.transformDirection( viewMatrix );
+
+				sunLength ++;
+
+			} else if ( light.isDirectionalLight ) {
+
+				const uniforms = state.directional[ directionalLength ];
+
+				uniforms.direction.setFromMatrixPosition( light.matrixWorld );
+				vector3.setFromMatrixPosition( light.target.matrixWorld );
+				uniforms.direction.sub( vector3 );
+				uniforms.direction.transformDirection( viewMatrix );
+
+				directionalLength ++;
+
+			} else if ( light.isSpotLight ) {
+
+				const uniforms = state.spot[ spotLength ];
+
+				uniforms.position.setFromMatrixPosition( light.matrixWorld );
+				uniforms.position.applyMatrix4( viewMatrix );
+
+				uniforms.direction.setFromMatrixPosition( light.matrixWorld );
+				vector3.setFromMatrixPosition( light.target.matrixWorld );
+				uniforms.direction.sub( vector3 );
+				uniforms.direction.transformDirection( viewMatrix );
+
+				spotLength ++;
+
+			} else if ( light.isRectAreaLight ) {
+
+				const uniforms = state.rectArea[ rectAreaLength ];
+
+				uniforms.position.setFromMatrixPosition( light.matrixWorld );
+				uniforms.position.applyMatrix4( viewMatrix );
+
+				// extract local rotation of light to derive width/height half vectors
+				matrix42.identity();
+				matrix4.copy( light.matrixWorld );
+				matrix4.premultiply( viewMatrix );
+				matrix42.extractRotation( matrix4 );
+
+				uniforms.halfWidth.set( light.width * 0.5, 0.0, 0.0 );
+				uniforms.halfHeight.set( 0.0, light.height * 0.5, 0.0 );
+
+				uniforms.halfWidth.applyMatrix4( matrix42 );
+				uniforms.halfHeight.applyMatrix4( matrix42 );
+
+				rectAreaLength ++;
+
+			} else if ( light.isPointLight ) {
+
+				const uniforms = state.point[ pointLength ];
+
+				uniforms.position.setFromMatrixPosition( light.matrixWorld );
+				uniforms.position.applyMatrix4( viewMatrix );
+
+				pointLength ++;
+
+			} else if ( light.isHemisphereLight ) {
+
+				const uniforms = state.hemi[ hemiLength ];
+
+				uniforms.direction.setFromMatrixPosition( light.matrixWorld );
+				uniforms.direction.transformDirection( viewMatrix );
+
+				hemiLength ++;
+
+			}
+
+		}
+
+	}
+
+	return {
+		setup: setup,
+		setupView: setupView,
+		state: state
+	};
+
+}
+
+function WebGLRenderState( extensions ) {
+
+	const lights = new WebGLLights( extensions );
+
+	const lightsArray = [];
+	const shadowsArray = [];
+	const lightProbeGridArray = [];
+
+	function init( camera ) {
+
+		state.camera = camera;
+
+		lightsArray.length = 0;
+		shadowsArray.length = 0;
+		lightProbeGridArray.length = 0;
+
+	}
+
+	function pushLight( light ) {
+
+		lightsArray.push( light );
+
+	}
+
+	function pushShadow( shadowLight ) {
+
+		shadowsArray.push( shadowLight );
+
+	}
+
+	function pushLightProbeGrid( volume ) {
+
+		lightProbeGridArray.push( volume );
+
+	}
+
+	function setupLights() {
+
+		lights.setup( lightsArray );
+
+	}
+
+	function setupLightsView( camera ) {
+
+		lights.setupView( lightsArray, camera );
+
+	}
+
+	const state = {
+		lightsArray: lightsArray,
+		shadowsArray: shadowsArray,
+		lightProbeGridArray: lightProbeGridArray,
+
+		camera: null,
+
+		lights: lights,
+
+		transmissionRenderTarget: {},
+		textureUnits: 0
+	};
+
+	return {
+		init: init,
+		state: state,
+		setupLights: setupLights,
+		setupLightsView: setupLightsView,
+
+		pushLight: pushLight,
+		pushShadow: pushShadow,
+		pushLightProbeGrid: pushLightProbeGrid
+	};
+
+}
+
+function WebGLRenderStates( extensions ) {
+
+	let renderStates = new WeakMap();
+
+	function get( scene, renderCallDepth = 0 ) {
+
+		const renderStateArray = renderStates.get( scene );
+		let renderState;
+
+		if ( renderStateArray === undefined ) {
+
+			renderState = new WebGLRenderState( extensions );
+			renderStates.set( scene, [ renderState ] );
+
+		} else {
+
+			if ( renderCallDepth >= renderStateArray.length ) {
+
+				renderState = new WebGLRenderState( extensions );
+				renderStateArray.push( renderState );
+
+			} else {
+
+				renderState = renderStateArray[ renderCallDepth ];
+
+			}
+
+		}
+
+		return renderState;
+
+	}
+
+	function dispose() {
+
+		renderStates = new WeakMap();
+
+	}
+
+	return {
+		get: get,
+		dispose: dispose
+	};
+
+}
+
+const vertex = "void main() {\n\tgl_Position = vec4( position, 1.0 );\n}";
+
+const fragment = "uniform sampler2D shadow_pass;\nuniform vec2 resolution;\nuniform float radius;\nvoid main() {\n\tconst float samples = float( VSM_SAMPLES );\n\tfloat mean = 0.0;\n\tfloat squared_mean = 0.0;\n\tfloat uvStride = samples <= 1.0 ? 0.0 : 2.0 / ( samples - 1.0 );\n\tfloat uvStart = samples <= 1.0 ? 0.0 : - 1.0;\n\tfor ( float i = 0.0; i < samples; i ++ ) {\n\t\tfloat uvOffset = uvStart + i * uvStride;\n\t\t#ifdef HORIZONTAL_PASS\n\t\t\tvec2 distribution = texture2D( shadow_pass, ( gl_FragCoord.xy + vec2( uvOffset, 0.0 ) * radius ) / resolution ).rg;\n\t\t\tmean += distribution.x;\n\t\t\tsquared_mean += distribution.y * distribution.y + distribution.x * distribution.x;\n\t\t#else\n\t\t\tfloat depth = texture2D( shadow_pass, ( gl_FragCoord.xy + vec2( 0.0, uvOffset ) * radius ) / resolution ).r;\n\t\t\tmean += depth;\n\t\t\tsquared_mean += depth * depth;\n\t\t#endif\n\t}\n\tmean = mean / samples;\n\tsquared_mean = squared_mean / samples;\n\tfloat std_dev = sqrt( max( 0.0, squared_mean - mean * mean ) );\n\tgl_FragColor = vec4( mean, std_dev, 0.0, 1.0 );\n}";
+
+const _cubeDirections = [
+	/*@__PURE__*/ new Vector3( 1, 0, 0 ), /*@__PURE__*/ new Vector3( -1, 0, 0 ), /*@__PURE__*/ new Vector3( 0, 1, 0 ),
+	/*@__PURE__*/ new Vector3( 0, -1, 0 ), /*@__PURE__*/ new Vector3( 0, 0, 1 ), /*@__PURE__*/ new Vector3( 0, 0, -1 )
+];
+
+const _cubeUps = [
+	/*@__PURE__*/ new Vector3( 0, -1, 0 ), /*@__PURE__*/ new Vector3( 0, -1, 0 ), /*@__PURE__*/ new Vector3( 0, 0, 1 ),
+	/*@__PURE__*/ new Vector3( 0, 0, -1 ), /*@__PURE__*/ new Vector3( 0, -1, 0 ), /*@__PURE__*/ new Vector3( 0, -1, 0 )
+];
+
+const _projScreenMatrix = /*@__PURE__*/ new Matrix4();
+const _lightPositionWorld = /*@__PURE__*/ new Vector3();
+const _lookTarget = /*@__PURE__*/ new Vector3();
+
+function WebGLShadowMap( renderer, objects, capabilities ) {
+
+	let _frustum = new Frustum();
+
+	const _shadowMapSize = new Vector2(),
+		_viewportSize = new Vector2(),
+
+		_viewport = new Vector4(),
+
+		_depthMaterial = new MeshDepthMaterial(),
+		_distanceMaterial = new MeshDistanceMaterial(),
+
+		_materialCache = {},
+
+		_maxTextureSize = capabilities.maxTextureSize;
+
+	const shadowSide = { [ FrontSide ]: BackSide, [ BackSide ]: FrontSide, [ DoubleSide ]: DoubleSide };
+
+	const shadowMaterialVertical = new ShaderMaterial( {
+		defines: {
+			VSM_SAMPLES: 8
+		},
+		uniforms: {
+			shadow_pass: { value: null },
+			resolution: { value: new Vector2() },
+			radius: { value: 4.0 }
+		},
+
+		vertexShader: vertex,
+		fragmentShader: fragment
+
+	} );
+
+	const shadowMaterialHorizontal = shadowMaterialVertical.clone();
+	shadowMaterialHorizontal.defines.HORIZONTAL_PASS = 1;
+
+	const fullScreenTri = new BufferGeometry();
+	fullScreenTri.setAttribute(
+		'position',
+		new BufferAttribute(
+			new Float32Array( [ -1, -1, 0.5, 3, -1, 0.5, -1, 3, 0.5 ] ),
+			3
+		)
+	);
+
+	const fullScreenMesh = new Mesh( fullScreenTri, shadowMaterialVertical );
+
+	const scope = this;
+
+	this.enabled = false;
+
+	this.autoUpdate = true;
+	this.needsUpdate = false;
+
+	this.type = PCFShadowMap;
+	let _previousType = this.type;
+
+	this.render = function ( lights, scene, camera ) {
+
+		if ( scope.enabled === false ) return;
+		if ( scope.autoUpdate === false && scope.needsUpdate === false ) return;
+
+		if ( lights.length === 0 ) return;
+
+		if ( this.type === PCFSoftShadowMap ) {
+
+			warn( 'WebGLShadowMap: PCFSoftShadowMap has been removed. Using PCFShadowMap instead.' );
+			this.type = PCFShadowMap;
+
+		}
+
+		const currentRenderTarget = renderer.getRenderTarget();
+		const activeCubeFace = renderer.getActiveCubeFace();
+		const activeMipmapLevel = renderer.getActiveMipmapLevel();
+
+		const _state = renderer.state;
+
+		// Set GL state for depth map.
+		_state.setBlending( NoBlending );
+
+		if ( _state.buffers.depth.getReversed() === true ) {
+
+			_state.buffers.color.setClear( 0, 0, 0, 0 );
+
+		} else {
+
+			_state.buffers.color.setClear( 1, 1, 1, 1 );
+
+		}
+
+		_state.buffers.depth.setTest( true );
+		_state.setScissorTest( false );
+
+		// check for shadow map type changes
+
+		const typeChanged = _previousType !== this.type;
+
+		// When shadow map type changes, materials need recompilation because sampler types change
+		// (sampler2DShadow for PCF vs sampler2D for Basic)
+		if ( typeChanged ) {
+
+			scene.traverse( function ( object ) {
+
+				if ( object.material ) {
+
+					if ( Array.isArray( object.material ) ) {
+
+						object.material.forEach( mat => mat.needsUpdate = true );
+
+					} else {
+
+						object.material.needsUpdate = true;
+
+					}
+
+				}
+
+			} );
+
+		}
+
+		// render depth map
+
+		for ( let i = 0, il = lights.length; i < il; i ++ ) {
+
+			const light = lights[ i ];
+			const shadow = light.shadow;
+
+			if ( shadow === undefined ) {
+
+				warn( 'WebGLShadowMap:', light, 'has no shadow.' );
+				continue;
+
+			}
+
+			if ( shadow.autoUpdate === false && shadow.needsUpdate === false ) continue;
+
+			_shadowMapSize.copy( shadow.mapSize );
+
+			const shadowFrameExtents = shadow.getFrameExtents();
+
+			_shadowMapSize.multiply( shadowFrameExtents );
+
+			_viewportSize.copy( shadow.mapSize );
+
+			if ( _shadowMapSize.x > _maxTextureSize || _shadowMapSize.y > _maxTextureSize ) {
+
+				if ( _shadowMapSize.x > _maxTextureSize ) {
+
+					_viewportSize.x = Math.floor( _maxTextureSize / shadowFrameExtents.x );
+					_shadowMapSize.x = _viewportSize.x * shadowFrameExtents.x;
+					shadow.mapSize.x = _viewportSize.x;
+
+				}
+
+				if ( _shadowMapSize.y > _maxTextureSize ) {
+
+					_viewportSize.y = Math.floor( _maxTextureSize / shadowFrameExtents.y );
+					_shadowMapSize.y = _viewportSize.y * shadowFrameExtents.y;
+					shadow.mapSize.y = _viewportSize.y;
+
+				}
+
+			}
+
+			const reversedDepthBuffer = renderer.state.buffers.depth.getReversed();
+			shadow.camera._reversedDepth = reversedDepthBuffer;
+
+			if ( shadow.map === null || typeChanged === true ) {
+
+				if ( shadow.map !== null ) {
+
+					if ( shadow.map.depthTexture !== null ) {
+
+						shadow.map.depthTexture.dispose();
+						shadow.map.depthTexture = null;
+
+					}
+
+					shadow.map.dispose();
+
+				}
+
+				if ( this.type === VSMShadowMap ) {
+
+					if ( light.isPointLight ) {
+
+						warn( 'WebGLShadowMap: VSM shadow maps are not supported for PointLights. Use PCF or BasicShadowMap instead.' );
+						continue;
+
+					}
+
+					shadow.map = new WebGLRenderTarget( _shadowMapSize.x, _shadowMapSize.y, {
+						format: RGFormat,
+						type: HalfFloatType,
+						minFilter: LinearFilter,
+						magFilter: LinearFilter,
+						generateMipmaps: false
+					} );
+					shadow.map.texture.name = light.name + '.shadowMap';
+
+					// Native depth texture for VSM - depth is captured here, then blurred into the color texture
+					shadow.map.depthTexture = new DepthTexture( _shadowMapSize.x, _shadowMapSize.y, FloatType );
+					shadow.map.depthTexture.name = light.name + '.shadowMapDepth';
+					shadow.map.depthTexture.format = DepthFormat;
+					shadow.map.depthTexture.compareFunction = null; // For regular sampling (not shadow comparison)
+					shadow.map.depthTexture.minFilter = NearestFilter;
+					shadow.map.depthTexture.magFilter = NearestFilter;
+
+				} else {
+
+					if ( light.isPointLight ) {
+
+						shadow.map = new WebGLCubeRenderTarget( _shadowMapSize.x );
+						shadow.map.depthTexture = new CubeDepthTexture( _shadowMapSize.x, UnsignedIntType );
+
+					} else {
+
+						shadow.map = new WebGLRenderTarget( _shadowMapSize.x, _shadowMapSize.y );
+						shadow.map.depthTexture = new DepthTexture( _shadowMapSize.x, _shadowMapSize.y, UnsignedIntType );
+
+					}
+
+					shadow.map.depthTexture.name = light.name + '.shadowMap';
+					shadow.map.depthTexture.format = DepthFormat;
+
+					if ( this.type === PCFShadowMap ) {
+
+						shadow.map.depthTexture.compareFunction = reversedDepthBuffer ? GreaterEqualCompare : LessEqualCompare;
+						shadow.map.depthTexture.minFilter = LinearFilter;
+						shadow.map.depthTexture.magFilter = LinearFilter;
+
+					} else {
+
+						shadow.map.depthTexture.compareFunction = null;
+						shadow.map.depthTexture.minFilter = NearestFilter;
+						shadow.map.depthTexture.magFilter = NearestFilter;
+
+					}
+
+				}
+
+				shadow.camera.updateProjectionMatrix();
+
+			}
+
+			if ( shadow.map.isWebGLCubeRenderTarget !== true && ( shadow.map.width !== _shadowMapSize.x || shadow.map.height !== _shadowMapSize.y ) ) {
+
+				shadow.map.setSize( _shadowMapSize.x, _shadowMapSize.y );
+
+			}
+
+			// For cube render targets (PointLights), render all 6 faces. Sun lights
+			// render one atlas viewport per cascade.
+			const faceCount = shadow.map.isWebGLCubeRenderTarget ? 6 : shadow.getViewportCount();
+
+			if ( light.isPointLight !== true ) shadow.updateMatrices( light, camera );
+
+			for ( let face = 0; face < faceCount; face ++ ) {
+
+				const shadowCamera = shadow.getCamera( face );
+
+				if ( light.isPointLight ) {
+
+					const camera = shadow.camera;
+					const shadowMatrix = shadow.matrix;
+
+					const far = light.distance || camera.far;
+
+					if ( far !== camera.far ) {
+
+						camera.far = far;
+						camera.updateProjectionMatrix();
+
+					}
+
+					_lightPositionWorld.setFromMatrixPosition( light.matrixWorld );
+					camera.position.copy( _lightPositionWorld );
+
+					_lookTarget.copy( camera.position );
+					_lookTarget.add( _cubeDirections[ face ] );
+					camera.up.copy( _cubeUps[ face ] );
+					camera.lookAt( _lookTarget );
+					camera.updateMatrixWorld();
+
+					shadowMatrix.makeTranslation( - _lightPositionWorld.x, - _lightPositionWorld.y, - _lightPositionWorld.z );
+
+					_projScreenMatrix.multiplyMatrices( camera.projectionMatrix, camera.matrixWorldInverse );
+					shadow._frustum.setFromProjectionMatrix( _projScreenMatrix, camera.coordinateSystem, camera.reversedDepth );
+
+				}
+
+				// For cube render targets, render to each face separately
+				if ( shadow.map.isWebGLCubeRenderTarget ) {
+
+					renderer.setRenderTarget( shadow.map, face );
+					renderer.clear();
+
+				} else {
+
+					// For 2D render targets, use viewports
+					if ( face === 0 ) {
+
+						renderer.setRenderTarget( shadow.map );
+						renderer.clear();
+
+					}
+
+					const viewport = shadow.getViewport( face );
+
+					_viewport.set(
+						_viewportSize.x * viewport.x,
+						_viewportSize.y * viewport.y,
+						_viewportSize.x * viewport.z,
+						_viewportSize.y * viewport.w
+					);
+
+					_state.viewport( _viewport );
+
+				}
+
+				_frustum = shadow.getFrustum( face );
+
+				renderObject( scene, camera, shadowCamera, light, this.type );
+
+			}
+
+			// do blur pass for VSM
+
+			if ( shadow.isPointLightShadow !== true && this.type === VSMShadowMap ) {
+
+				VSMPass( shadow, camera );
+
+			}
+
+			shadow.needsUpdate = false;
+
+		}
+
+		_previousType = this.type;
+
+		scope.needsUpdate = false;
+
+		renderer.setRenderTarget( currentRenderTarget, activeCubeFace, activeMipmapLevel );
+
+	};
+
+	function VSMPass( shadow, camera ) {
+
+		const geometry = objects.update( fullScreenMesh );
+
+		if ( shadowMaterialVertical.defines.VSM_SAMPLES !== shadow.blurSamples ) {
+
+			shadowMaterialVertical.defines.VSM_SAMPLES = shadow.blurSamples;
+			shadowMaterialHorizontal.defines.VSM_SAMPLES = shadow.blurSamples;
+
+			shadowMaterialVertical.needsUpdate = true;
+			shadowMaterialHorizontal.needsUpdate = true;
+
+		}
+
+		if ( shadow.mapPass === null ) {
+
+			shadow.mapPass = new WebGLRenderTarget( _shadowMapSize.x, _shadowMapSize.y, {
+				format: RGFormat,
+				type: HalfFloatType
+			} );
+
+		} else if ( shadow.mapPass.width !== shadow.map.width || shadow.mapPass.height !== shadow.map.height ) {
+
+			shadow.mapPass.setSize( shadow.map.width, shadow.map.height );
+
+		}
+
+		// vertical pass - read from native depth texture
+
+		shadowMaterialVertical.uniforms.shadow_pass.value = shadow.map.depthTexture;
+		shadowMaterialVertical.uniforms.resolution.value.set( shadow.map.width, shadow.map.height );
+		shadowMaterialVertical.uniforms.radius.value = shadow.radius;
+		renderer.setRenderTarget( shadow.mapPass );
+		renderer.clear();
+		renderer.renderBufferDirect( camera, null, geometry, shadowMaterialVertical, fullScreenMesh, null );
+
+		// horizontal pass
+
+		shadowMaterialHorizontal.uniforms.shadow_pass.value = shadow.mapPass.texture;
+		shadowMaterialHorizontal.uniforms.resolution.value.set( shadow.map.width, shadow.map.height );
+		shadowMaterialHorizontal.uniforms.radius.value = shadow.radius;
+		renderer.setRenderTarget( shadow.map );
+		renderer.clear();
+		renderer.renderBufferDirect( camera, null, geometry, shadowMaterialHorizontal, fullScreenMesh, null );
+
+	}
+
+	function getDepthMaterial( object, material, light, type ) {
+
+		let result = null;
+
+		const customMaterial = ( light.isPointLight === true ) ? object.customDistanceMaterial : object.customDepthMaterial;
+
+		if ( customMaterial !== undefined ) {
+
+			result = customMaterial;
+
+		} else {
+
+			result = ( light.isPointLight === true ) ? _distanceMaterial : _depthMaterial;
+
+			if ( ( renderer.localClippingEnabled && material.clipShadows === true && Array.isArray( material.clippingPlanes ) && material.clippingPlanes.length !== 0 ) ||
+				( material.displacementMap && material.displacementScale !== 0 ) ||
+				( material.alphaMap && material.alphaTest > 0 ) ||
+				( material.map && material.alphaTest > 0 ) ||
+				( material.alphaToCoverage === true ) ) {
+
+				// in this case we need a unique material instance reflecting the
+				// appropriate state
+
+				const keyA = result.uuid, keyB = material.uuid;
+
+				let materialsForVariant = _materialCache[ keyA ];
+
+				if ( materialsForVariant === undefined ) {
+
+					materialsForVariant = {};
+					_materialCache[ keyA ] = materialsForVariant;
+
+				}
+
+				let cachedMaterial = materialsForVariant[ keyB ];
+
+				if ( cachedMaterial === undefined ) {
+
+					cachedMaterial = result.clone();
+					materialsForVariant[ keyB ] = cachedMaterial;
+					material.addEventListener( 'dispose', onMaterialDispose );
+
+				}
+
+				result = cachedMaterial;
+
+			}
+
+		}
+
+		result.visible = material.visible;
+		result.wireframe = material.wireframe;
+
+		if ( type === VSMShadowMap ) {
+
+			result.side = ( material.shadowSide !== null ) ? material.shadowSide : material.side;
+
+		} else {
+
+			result.side = ( material.shadowSide !== null ) ? material.shadowSide : shadowSide[ material.side ];
+
+		}
+
+		result.alphaMap = material.alphaMap;
+		result.alphaTest = ( material.alphaToCoverage === true ) ? 0.5 : material.alphaTest; // approximate alphaToCoverage by using a fixed alphaTest value
+		result.map = material.map;
+
+		result.clipShadows = material.clipShadows;
+		result.clippingPlanes = material.clippingPlanes;
+		result.clipIntersection = material.clipIntersection;
+
+		result.displacementMap = material.displacementMap;
+		result.displacementScale = material.displacementScale;
+		result.displacementBias = material.displacementBias;
+
+		result.wireframeLinewidth = material.wireframeLinewidth;
+		result.linewidth = material.linewidth;
+
+		if ( light.isPointLight === true && result.isMeshDistanceMaterial === true ) {
+
+			const materialProperties = renderer.properties.get( result );
+			materialProperties.light = light;
+
+		}
+
+		return result;
+
+	}
+
+	function renderObject( object, camera, shadowCamera, light, type ) {
+
+		if ( object.visible === false ) return;
+
+		const visible = object.layers.test( camera.layers );
+
+		if ( visible && ( object.isMesh || object.isLine || object.isPoints ) ) {
+
+			if ( ( object.castShadow || ( object.receiveShadow && type === VSMShadowMap ) ) && ( ! object.frustumCulled || object.intersectsFrustum( _frustum ) ) ) {
+
+				object.modelViewMatrix.multiplyMatrices( shadowCamera.matrixWorldInverse, object.matrixWorld );
+
+				const geometry = objects.update( object );
+				const material = object.material;
+
+				if ( Array.isArray( material ) ) {
+
+					const groups = geometry.groups;
+
+					for ( let k = 0, kl = groups.length; k < kl; k ++ ) {
+
+						const group = groups[ k ];
+						const groupMaterial = material[ group.materialIndex ];
+
+						if ( groupMaterial && groupMaterial.visible ) {
+
+							const depthMaterial = getDepthMaterial( object, groupMaterial, light, type );
+
+							object.onBeforeShadow( renderer, object, camera, shadowCamera, geometry, depthMaterial, group );
+
+							renderer.renderBufferDirect( shadowCamera, null, geometry, depthMaterial, object, group );
+
+							object.onAfterShadow( renderer, object, camera, shadowCamera, geometry, depthMaterial, group );
+
+						}
+
+					}
+
+				} else if ( material.visible ) {
+
+					const depthMaterial = getDepthMaterial( object, material, light, type );
+
+					object.onBeforeShadow( renderer, object, camera, shadowCamera, geometry, depthMaterial, null );
+
+					renderer.renderBufferDirect( shadowCamera, null, geometry, depthMaterial, object, null );
+
+					object.onAfterShadow( renderer, object, camera, shadowCamera, geometry, depthMaterial, null );
+
+				}
+
+			}
+
+		}
+
+		const children = object.children;
+
+		for ( let i = 0, l = children.length; i < l; i ++ ) {
+
+			renderObject( children[ i ], camera, shadowCamera, light, type );
+
+		}
+
+	}
+
+	function onMaterialDispose( event ) {
+
+		const material = event.target;
+
+		material.removeEventListener( 'dispose', onMaterialDispose );
+
+		// make sure to remove the unique distance/depth materials used for shadow map rendering
+
+		for ( const id in _materialCache ) {
+
+			const cache = _materialCache[ id ];
+
+			const uuid = event.target.uuid;
+
+			if ( uuid in cache ) {
+
+				const shadowMaterial = cache[ uuid ];
+				shadowMaterial.dispose();
+				delete cache[ uuid ];
+
+			}
+
+		}
+
+	}
+
+}
+
+function WebGLState( gl, extensions ) {
+
+	function ColorBuffer() {
+
+		let locked = false;
+
+		const color = new Vector4();
+		let currentColorMask = null;
+		const currentColorClear = new Vector4( 0, 0, 0, 0 );
+
+		return {
+
+			setMask: function ( colorMask ) {
+
+				if ( currentColorMask !== colorMask && ! locked ) {
+
+					gl.colorMask( colorMask, colorMask, colorMask, colorMask );
+					currentColorMask = colorMask;
+
+				}
+
+			},
+
+			setLocked: function ( lock ) {
+
+				locked = lock;
+
+			},
+
+			setClear: function ( r, g, b, a, premultipliedAlpha ) {
+
+				if ( premultipliedAlpha === true ) {
+
+					r *= a; g *= a; b *= a;
+
+				}
+
+				color.set( r, g, b, a );
+
+				if ( currentColorClear.equals( color ) === false ) {
+
+					gl.clearColor( r, g, b, a );
+					currentColorClear.copy( color );
+
+				}
+
+			},
+
+			reset: function () {
+
+				locked = false;
+
+				currentColorMask = null;
+				currentColorClear.set( -1, 0, 0, 0 ); // set to invalid state
+
+			}
+
+		};
+
+	}
+
+	function DepthBuffer() {
+
+		let locked = false;
+
+		let currentReversed = false;
+		let currentDepthMask = null;
+		let currentDepthFunc = null;
+		let currentDepthClear = null;
+
+		return {
+
+			setReversed: function ( reversed ) {
+
+				if ( currentReversed !== reversed ) {
+
+					const ext = extensions.get( 'EXT_clip_control' );
+
+					if ( reversed ) {
+
+						ext.clipControlEXT( ext.LOWER_LEFT_EXT, ext.ZERO_TO_ONE_EXT );
+
+					} else {
+
+						ext.clipControlEXT( ext.LOWER_LEFT_EXT, ext.NEGATIVE_ONE_TO_ONE_EXT );
+
+					}
+
+					currentReversed = reversed;
+
+					const oldDepth = currentDepthClear;
+					currentDepthClear = null;
+					this.setClear( oldDepth );
+
+				}
+
+			},
+
+			getReversed: function () {
+
+				return currentReversed;
+
+			},
+
+			setTest: function ( depthTest ) {
+
+				if ( depthTest ) {
+
+					enable( gl.DEPTH_TEST );
+
+				} else {
+
+					disable( gl.DEPTH_TEST );
+
+				}
+
+			},
+
+			setMask: function ( depthMask ) {
+
+				if ( currentDepthMask !== depthMask && ! locked ) {
+
+					gl.depthMask( depthMask );
+					currentDepthMask = depthMask;
+
+				}
+
+			},
+
+			setFunc: function ( depthFunc ) {
+
+				if ( currentReversed ) depthFunc = ReversedDepthFuncs[ depthFunc ];
+
+				if ( currentDepthFunc !== depthFunc ) {
+
+					switch ( depthFunc ) {
+
+						case NeverDepth:
+
+							gl.depthFunc( gl.NEVER );
+							break;
+
+						case AlwaysDepth:
+
+							gl.depthFunc( gl.ALWAYS );
+							break;
+
+						case LessDepth:
+
+							gl.depthFunc( gl.LESS );
+							break;
+
+						case LessEqualDepth:
+
+							gl.depthFunc( gl.LEQUAL );
+							break;
+
+						case EqualDepth:
+
+							gl.depthFunc( gl.EQUAL );
+							break;
+
+						case GreaterEqualDepth:
+
+							gl.depthFunc( gl.GEQUAL );
+							break;
+
+						case GreaterDepth:
+
+							gl.depthFunc( gl.GREATER );
+							break;
+
+						case NotEqualDepth:
+
+							gl.depthFunc( gl.NOTEQUAL );
+							break;
+
+						default:
+
+							gl.depthFunc( gl.LEQUAL );
+
+					}
+
+					currentDepthFunc = depthFunc;
+
+				}
+
+			},
+
+			setLocked: function ( lock ) {
+
+				locked = lock;
+
+			},
+
+			setClear: function ( depth ) {
+
+				if ( currentDepthClear !== depth ) {
+
+					currentDepthClear = depth;
+
+					if ( currentReversed ) {
+
+						depth = 1 - depth;
+
+					}
+
+					gl.clearDepth( depth );
+
+				}
+
+			},
+
+			reset: function () {
+
+				locked = false;
+
+				currentDepthMask = null;
+				currentDepthFunc = null;
+				currentDepthClear = null;
+				currentReversed = false;
+
+			}
+
+		};
+
+	}
+
+	function StencilBuffer() {
+
+		let locked = false;
+
+		let currentStencilMask = null;
+		let currentStencilFunc = null;
+		let currentStencilRef = null;
+		let currentStencilFuncMask = null;
+		let currentStencilFail = null;
+		let currentStencilZFail = null;
+		let currentStencilZPass = null;
+		let currentStencilClear = null;
+
+		return {
+
+			setTest: function ( stencilTest ) {
+
+				if ( ! locked ) {
+
+					if ( stencilTest ) {
+
+						enable( gl.STENCIL_TEST );
+
+					} else {
+
+						disable( gl.STENCIL_TEST );
+
+					}
+
+				}
+
+			},
+
+			setMask: function ( stencilMask ) {
+
+				if ( currentStencilMask !== stencilMask && ! locked ) {
+
+					gl.stencilMask( stencilMask );
+					currentStencilMask = stencilMask;
+
+				}
+
+			},
+
+			setFunc: function ( stencilFunc, stencilRef, stencilMask ) {
+
+				if ( currentStencilFunc !== stencilFunc ||
+				     currentStencilRef !== stencilRef ||
+				     currentStencilFuncMask !== stencilMask ) {
+
+					gl.stencilFunc( stencilFunc, stencilRef, stencilMask );
+
+					currentStencilFunc = stencilFunc;
+					currentStencilRef = stencilRef;
+					currentStencilFuncMask = stencilMask;
+
+				}
+
+			},
+
+			setOp: function ( stencilFail, stencilZFail, stencilZPass ) {
+
+				if ( currentStencilFail !== stencilFail ||
+				     currentStencilZFail !== stencilZFail ||
+				     currentStencilZPass !== stencilZPass ) {
+
+					gl.stencilOp( stencilFail, stencilZFail, stencilZPass );
+
+					currentStencilFail = stencilFail;
+					currentStencilZFail = stencilZFail;
+					currentStencilZPass = stencilZPass;
+
+				}
+
+			},
+
+			setLocked: function ( lock ) {
+
+				locked = lock;
+
+			},
+
+			setClear: function ( stencil ) {
+
+				if ( currentStencilClear !== stencil ) {
+
+					gl.clearStencil( stencil );
+					currentStencilClear = stencil;
+
+				}
+
+			},
+
+			reset: function () {
+
+				locked = false;
+
+				currentStencilMask = null;
+				currentStencilFunc = null;
+				currentStencilRef = null;
+				currentStencilFuncMask = null;
+				currentStencilFail = null;
+				currentStencilZFail = null;
+				currentStencilZPass = null;
+				currentStencilClear = null;
+
+			}
+
+		};
+
+	}
+
+	//
+
+	const colorBuffer = new ColorBuffer();
+	const depthBuffer = new DepthBuffer();
+	const stencilBuffer = new StencilBuffer();
+
+	const uboBindings = new WeakMap();
+	const uboProgramMap = new WeakMap();
+
+	let enabledCapabilities = {};
+	let parameters = {};
+
+	let currentBoundFramebuffers = {};
+	let currentDrawbuffers = new WeakMap();
+	let defaultDrawbuffers = [];
+
+	let currentProgram = null;
+
+	let currentBlendingEnabled = false;
+	let currentBlending = null;
+	let currentBlendEquation = null;
+	let currentBlendSrc = null;
+	let currentBlendDst = null;
+	let currentBlendEquationAlpha = null;
+	let currentBlendSrcAlpha = null;
+	let currentBlendDstAlpha = null;
+	let currentBlendColor = new Color( 0, 0, 0 );
+	let currentBlendAlpha = 0;
+	let currentPremultipledAlpha = false;
+
+	let currentFlipSided = null;
+	let currentCullFace = null;
+
+	let currentLineWidth = null;
+
+	let currentPolygonOffsetFactor = null;
+	let currentPolygonOffsetUnits = null;
+
+	const maxTextures = gl.getParameter( gl.MAX_COMBINED_TEXTURE_IMAGE_UNITS );
+
+	let lineWidthAvailable = false;
+	let version = 0;
+	const glVersion = gl.getParameter( gl.VERSION );
+
+	if ( glVersion.indexOf( 'WebGL' ) !== -1 ) {
+
+		version = parseFloat( /^WebGL (\d)/.exec( glVersion )[ 1 ] );
+		lineWidthAvailable = ( version >= 1.0 );
+
+	} else if ( glVersion.indexOf( 'OpenGL ES' ) !== -1 ) {
+
+		version = parseFloat( /^OpenGL ES (\d)/.exec( glVersion )[ 1 ] );
+		lineWidthAvailable = ( version >= 2.0 );
+
+	}
+
+	let currentTextureSlot = null;
+	let currentBoundTextures = {};
+
+	const scissorParam = gl.getParameter( gl.SCISSOR_BOX );
+	const viewportParam = gl.getParameter( gl.VIEWPORT );
+
+	const currentScissor = new Vector4().fromArray( scissorParam );
+	const currentViewport = new Vector4().fromArray( viewportParam );
+
+	function createTexture( type, target, count, dimensions ) {
+
+		const data = new Uint8Array( 4 ); // 4 is required to match default unpack alignment of 4.
+		const texture = gl.createTexture();
+
+		gl.bindTexture( type, texture );
+		gl.texParameteri( type, gl.TEXTURE_MIN_FILTER, gl.NEAREST );
+		gl.texParameteri( type, gl.TEXTURE_MAG_FILTER, gl.NEAREST );
+
+		for ( let i = 0; i < count; i ++ ) {
+
+			if ( type === gl.TEXTURE_3D || type === gl.TEXTURE_2D_ARRAY ) {
+
+				gl.texImage3D( target, 0, gl.RGBA, 1, 1, dimensions, 0, gl.RGBA, gl.UNSIGNED_BYTE, data );
+
+			} else {
+
+				gl.texImage2D( target + i, 0, gl.RGBA, 1, 1, 0, gl.RGBA, gl.UNSIGNED_BYTE, data );
+
+			}
+
+		}
+
+		return texture;
+
+	}
+
+	const emptyTextures = {};
+	emptyTextures[ gl.TEXTURE_2D ] = createTexture( gl.TEXTURE_2D, gl.TEXTURE_2D, 1 );
+	emptyTextures[ gl.TEXTURE_CUBE_MAP ] = createTexture( gl.TEXTURE_CUBE_MAP, gl.TEXTURE_CUBE_MAP_POSITIVE_X, 6 );
+	emptyTextures[ gl.TEXTURE_2D_ARRAY ] = createTexture( gl.TEXTURE_2D_ARRAY, gl.TEXTURE_2D_ARRAY, 1, 1 );
+	emptyTextures[ gl.TEXTURE_3D ] = createTexture( gl.TEXTURE_3D, gl.TEXTURE_3D, 1, 1 );
+
+	// init
+
+	colorBuffer.setClear( 0, 0, 0, 1 );
+	depthBuffer.setClear( 1 );
+	stencilBuffer.setClear( 0 );
+
+	enable( gl.DEPTH_TEST );
+	depthBuffer.setFunc( LessEqualDepth );
+
+	setFlipSided( false );
+	setCullFace( CullFaceBack );
+	enable( gl.CULL_FACE );
+
+	setBlending( NoBlending );
+
+	//
+
+	function enable( id ) {
+
+		if ( enabledCapabilities[ id ] !== true ) {
+
+			gl.enable( id );
+			enabledCapabilities[ id ] = true;
+
+		}
+
+	}
+
+	function disable( id ) {
+
+		if ( enabledCapabilities[ id ] !== false ) {
+
+			gl.disable( id );
+			enabledCapabilities[ id ] = false;
+
+		}
+
+	}
+
+	function bindFramebuffer( target, framebuffer ) {
+
+		if ( currentBoundFramebuffers[ target ] !== framebuffer ) {
+
+			gl.bindFramebuffer( target, framebuffer );
+
+			currentBoundFramebuffers[ target ] = framebuffer;
+
+			// gl.DRAW_FRAMEBUFFER is equivalent to gl.FRAMEBUFFER
+
+			if ( target === gl.DRAW_FRAMEBUFFER ) {
+
+				currentBoundFramebuffers[ gl.FRAMEBUFFER ] = framebuffer;
+
+			}
+
+			if ( target === gl.FRAMEBUFFER ) {
+
+				currentBoundFramebuffers[ gl.DRAW_FRAMEBUFFER ] = framebuffer;
+
+			}
+
+			return true;
+
+		}
+
+		return false;
+
+	}
+
+	function drawBuffers( renderTarget, framebuffer ) {
+
+		let drawBuffers = defaultDrawbuffers;
+
+		let needsUpdate = false;
+
+		if ( renderTarget ) {
+
+			drawBuffers = currentDrawbuffers.get( framebuffer );
+
+			if ( drawBuffers === undefined ) {
+
+				drawBuffers = [];
+				currentDrawbuffers.set( framebuffer, drawBuffers );
+
+			}
+
+			const textures = renderTarget.textures;
+
+			if ( drawBuffers.length !== textures.length || drawBuffers[ 0 ] !== gl.COLOR_ATTACHMENT0 ) {
+
+				for ( let i = 0, il = textures.length; i < il; i ++ ) {
+
+					drawBuffers[ i ] = gl.COLOR_ATTACHMENT0 + i;
+
+				}
+
+				drawBuffers.length = textures.length;
+
+				needsUpdate = true;
+
+			}
+
+		} else {
+
+			if ( drawBuffers[ 0 ] !== gl.BACK ) {
+
+				drawBuffers[ 0 ] = gl.BACK;
+
+				needsUpdate = true;
+
+			}
+
+		}
+
+		if ( needsUpdate ) {
+
+			gl.drawBuffers( drawBuffers );
+
+		}
+
+	}
+
+	function useProgram( program ) {
+
+		if ( currentProgram !== program ) {
+
+			gl.useProgram( program );
+
+			currentProgram = program;
+
+			return true;
+
+		}
+
+		return false;
+
+	}
+
+	const equationToGL = {
+		[ AddEquation ]: gl.FUNC_ADD,
+		[ SubtractEquation ]: gl.FUNC_SUBTRACT,
+		[ ReverseSubtractEquation ]: gl.FUNC_REVERSE_SUBTRACT
+	};
+
+	equationToGL[ MinEquation ] = gl.MIN;
+	equationToGL[ MaxEquation ] = gl.MAX;
+
+	const factorToGL = {
+		[ ZeroFactor ]: gl.ZERO,
+		[ OneFactor ]: gl.ONE,
+		[ SrcColorFactor ]: gl.SRC_COLOR,
+		[ SrcAlphaFactor ]: gl.SRC_ALPHA,
+		[ SrcAlphaSaturateFactor ]: gl.SRC_ALPHA_SATURATE,
+		[ DstColorFactor ]: gl.DST_COLOR,
+		[ DstAlphaFactor ]: gl.DST_ALPHA,
+		[ OneMinusSrcColorFactor ]: gl.ONE_MINUS_SRC_COLOR,
+		[ OneMinusSrcAlphaFactor ]: gl.ONE_MINUS_SRC_ALPHA,
+		[ OneMinusDstColorFactor ]: gl.ONE_MINUS_DST_COLOR,
+		[ OneMinusDstAlphaFactor ]: gl.ONE_MINUS_DST_ALPHA,
+		[ ConstantColorFactor ]: gl.CONSTANT_COLOR,
+		[ OneMinusConstantColorFactor ]: gl.ONE_MINUS_CONSTANT_COLOR,
+		[ ConstantAlphaFactor ]: gl.CONSTANT_ALPHA,
+		[ OneMinusConstantAlphaFactor ]: gl.ONE_MINUS_CONSTANT_ALPHA
+	};
+
+	function setBlending( blending, blendEquation, blendSrc, blendDst, blendEquationAlpha, blendSrcAlpha, blendDstAlpha, blendColor, blendAlpha, premultipliedAlpha ) {
+
+		if ( blending === NoBlending ) {
+
+			if ( currentBlendingEnabled === true ) {
+
+				disable( gl.BLEND );
+				currentBlendingEnabled = false;
+
+			}
+
+			return;
+
+		}
+
+		if ( currentBlendingEnabled === false ) {
+
+			enable( gl.BLEND );
+			currentBlendingEnabled = true;
+
+		}
+
+		if ( blending !== CustomBlending ) {
+
+			if ( blending !== currentBlending || premultipliedAlpha !== currentPremultipledAlpha ) {
+
+				if ( currentBlendEquation !== AddEquation || currentBlendEquationAlpha !== AddEquation ) {
+
+					gl.blendEquation( gl.FUNC_ADD );
+
+					currentBlendEquation = AddEquation;
+					currentBlendEquationAlpha = AddEquation;
+
+				}
+
+				if ( premultipliedAlpha ) {
+
+					switch ( blending ) {
+
+						case NormalBlending:
+							gl.blendFuncSeparate( gl.ONE, gl.ONE_MINUS_SRC_ALPHA, gl.ONE, gl.ONE_MINUS_SRC_ALPHA );
+							break;
+
+						case AdditiveBlending:
+							gl.blendFunc( gl.ONE, gl.ONE );
+							break;
+
+						case SubtractiveBlending:
+							gl.blendFuncSeparate( gl.ZERO, gl.ONE_MINUS_SRC_COLOR, gl.ZERO, gl.ONE );
+							break;
+
+						case MultiplyBlending:
+							gl.blendFuncSeparate( gl.DST_COLOR, gl.ONE_MINUS_SRC_ALPHA, gl.ZERO, gl.ONE );
+							break;
+
+						default:
+							error( 'WebGLState: Invalid blending: ', blending );
+							break;
+
+					}
+
+				} else {
+
+					switch ( blending ) {
+
+						case NormalBlending:
+							gl.blendFuncSeparate( gl.SRC_ALPHA, gl.ONE_MINUS_SRC_ALPHA, gl.ONE, gl.ONE_MINUS_SRC_ALPHA );
+							break;
+
+						case AdditiveBlending:
+							gl.blendFuncSeparate( gl.SRC_ALPHA, gl.ONE, gl.ONE, gl.ONE );
+							break;
+
+						case SubtractiveBlending:
+							error( 'WebGLState: SubtractiveBlending requires material.premultipliedAlpha = true' );
+							break;
+
+						case MultiplyBlending:
+							error( 'WebGLState: MultiplyBlending requires material.premultipliedAlpha = true' );
+							break;
+
+						default:
+							error( 'WebGLState: Invalid blending: ', blending );
+							break;
+
+					}
+
+				}
+
+				currentBlendSrc = null;
+				currentBlendDst = null;
+				currentBlendSrcAlpha = null;
+				currentBlendDstAlpha = null;
+				currentBlendColor.set( 0, 0, 0 );
+				currentBlendAlpha = 0;
+
+				currentBlending = blending;
+				currentPremultipledAlpha = premultipliedAlpha;
+
+			}
+
+			return;
+
+		}
+
+		// custom blending
+
+		blendEquationAlpha = blendEquationAlpha || blendEquation;
+		blendSrcAlpha = blendSrcAlpha || blendSrc;
+		blendDstAlpha = blendDstAlpha || blendDst;
+
+		if ( blendEquation !== currentBlendEquation || blendEquationAlpha !== currentBlendEquationAlpha ) {
+
+			gl.blendEquationSeparate( equationToGL[ blendEquation ], equationToGL[ blendEquationAlpha ] );
+
+			currentBlendEquation = blendEquation;
+			currentBlendEquationAlpha = blendEquationAlpha;
+
+		}
+
+		if ( blendSrc !== currentBlendSrc || blendDst !== currentBlendDst || blendSrcAlpha !== currentBlendSrcAlpha || blendDstAlpha !== currentBlendDstAlpha ) {
+
+			gl.blendFuncSeparate( factorToGL[ blendSrc ], factorToGL[ blendDst ], factorToGL[ blendSrcAlpha ], factorToGL[ blendDstAlpha ] );
+
+			currentBlendSrc = blendSrc;
+			currentBlendDst = blendDst;
+			currentBlendSrcAlpha = blendSrcAlpha;
+			currentBlendDstAlpha = blendDstAlpha;
+
+		}
+
+		if ( blendColor.equals( currentBlendColor ) === false || blendAlpha !== currentBlendAlpha ) {
+
+			gl.blendColor( blendColor.r, blendColor.g, blendColor.b, blendAlpha );
+
+			currentBlendColor.copy( blendColor );
+			currentBlendAlpha = blendAlpha;
+
+		}
+
+		currentBlending = blending;
+		currentPremultipledAlpha = false;
+
+	}
+
+	function setMaterial( material, frontFaceCW ) {
+
+		material.side === DoubleSide
+			? disable( gl.CULL_FACE )
+			: enable( gl.CULL_FACE );
+
+		let flipSided = ( material.side === BackSide );
+		if ( frontFaceCW ) flipSided = ! flipSided;
+
+		setFlipSided( flipSided );
+
+		( material.blending === NormalBlending && material.transparent === false )
+			? setBlending( NoBlending )
+			: setBlending( material.blending, material.blendEquation, material.blendSrc, material.blendDst, material.blendEquationAlpha, material.blendSrcAlpha, material.blendDstAlpha, material.blendColor, material.blendAlpha, material.premultipliedAlpha );
+
+		depthBuffer.setFunc( material.depthFunc );
+		depthBuffer.setTest( material.depthTest );
+		depthBuffer.setMask( material.depthWrite );
+		colorBuffer.setMask( material.colorWrite );
+
+		const stencilWrite = material.stencilWrite;
+		stencilBuffer.setTest( stencilWrite );
+		if ( stencilWrite ) {
+
+			stencilBuffer.setMask( material.stencilWriteMask );
+			stencilBuffer.setFunc( material.stencilFunc, material.stencilRef, material.stencilFuncMask );
+			stencilBuffer.setOp( material.stencilFail, material.stencilZFail, material.stencilZPass );
+
+		}
+
+		setPolygonOffset( material.polygonOffset, material.polygonOffsetFactor, material.polygonOffsetUnits );
+
+		material.alphaToCoverage === true
+			? enable( gl.SAMPLE_ALPHA_TO_COVERAGE )
+			: disable( gl.SAMPLE_ALPHA_TO_COVERAGE );
+
+	}
+
+	//
+
+	function setFlipSided( flipSided ) {
+
+		if ( currentFlipSided !== flipSided ) {
+
+			if ( flipSided ) {
+
+				gl.frontFace( gl.CW );
+
+			} else {
+
+				gl.frontFace( gl.CCW );
+
+			}
+
+			currentFlipSided = flipSided;
+
+		}
+
+	}
+
+	function setCullFace( cullFace ) {
+
+		if ( cullFace !== CullFaceNone ) {
+
+			enable( gl.CULL_FACE );
+
+			if ( cullFace !== currentCullFace ) {
+
+				if ( cullFace === CullFaceBack ) {
+
+					gl.cullFace( gl.BACK );
+
+				} else if ( cullFace === CullFaceFront ) {
+
+					gl.cullFace( gl.FRONT );
+
+				} else {
+
+					gl.cullFace( gl.FRONT_AND_BACK );
+
+				}
+
+			}
+
+		} else {
+
+			disable( gl.CULL_FACE );
+
+		}
+
+		currentCullFace = cullFace;
+
+	}
+
+	function setLineWidth( width ) {
+
+		if ( width !== currentLineWidth ) {
+
+			if ( lineWidthAvailable ) gl.lineWidth( width );
+
+			currentLineWidth = width;
+
+		}
+
+	}
+
+	function setPolygonOffset( polygonOffset, factor, units ) {
+
+		if ( polygonOffset ) {
+
+			enable( gl.POLYGON_OFFSET_FILL );
+
+			if ( currentPolygonOffsetFactor !== factor || currentPolygonOffsetUnits !== units ) {
+
+				currentPolygonOffsetFactor = factor;
+				currentPolygonOffsetUnits = units;
+
+				if ( depthBuffer.getReversed() ) {
+
+					factor = - factor;
+
+				}
+
+				gl.polygonOffset( factor, units );
+
+			}
+
+		} else {
+
+			disable( gl.POLYGON_OFFSET_FILL );
+
+		}
+
+	}
+
+	function setScissorTest( scissorTest ) {
+
+		if ( scissorTest ) {
+
+			enable( gl.SCISSOR_TEST );
+
+		} else {
+
+			disable( gl.SCISSOR_TEST );
+
+		}
+
+	}
+
+	// texture
+
+	function activeTexture( webglSlot ) {
+
+		if ( webglSlot === undefined ) webglSlot = gl.TEXTURE0 + maxTextures - 1;
+
+		if ( currentTextureSlot !== webglSlot ) {
+
+			gl.activeTexture( webglSlot );
+			currentTextureSlot = webglSlot;
+
+		}
+
+	}
+
+	function bindTexture( webglType, webglTexture, webglSlot ) {
+
+		if ( webglSlot === undefined ) {
+
+			if ( currentTextureSlot === null ) {
+
+				webglSlot = gl.TEXTURE0 + maxTextures - 1;
+
+			} else {
+
+				webglSlot = currentTextureSlot;
+
+			}
+
+		}
+
+		let boundTexture = currentBoundTextures[ webglSlot ];
+
+		if ( boundTexture === undefined ) {
+
+			boundTexture = { type: undefined, texture: undefined };
+			currentBoundTextures[ webglSlot ] = boundTexture;
+
+		}
+
+		if ( boundTexture.type !== webglType || boundTexture.texture !== webglTexture ) {
+
+			if ( currentTextureSlot !== webglSlot ) {
+
+				gl.activeTexture( webglSlot );
+				currentTextureSlot = webglSlot;
+
+			}
+
+			gl.bindTexture( webglType, webglTexture || emptyTextures[ webglType ] );
+
+			boundTexture.type = webglType;
+			boundTexture.texture = webglTexture;
+
+		}
+
+	}
+
+	function unbindTexture() {
+
+		const boundTexture = currentBoundTextures[ currentTextureSlot ];
+
+		if ( boundTexture !== undefined && boundTexture.type !== undefined ) {
+
+			gl.bindTexture( boundTexture.type, null );
+
+			boundTexture.type = undefined;
+			boundTexture.texture = undefined;
+
+		}
+
+	}
+
+	function compressedTexImage2D() {
+
+		try {
+
+			gl.compressedTexImage2D( ...arguments );
+
+		} catch ( e ) {
+
+			error( 'WebGLState:', e );
+
+		}
+
+	}
+
+	function compressedTexImage3D() {
+
+		try {
+
+			gl.compressedTexImage3D( ...arguments );
+
+		} catch ( e ) {
+
+			error( 'WebGLState:', e );
+
+		}
+
+	}
+
+	function texSubImage2D() {
+
+		try {
+
+			gl.texSubImage2D( ...arguments );
+
+		} catch ( e ) {
+
+			error( 'WebGLState:', e );
+
+		}
+
+	}
+
+	function texSubImage3D() {
+
+		try {
+
+			gl.texSubImage3D( ...arguments );
+
+		} catch ( e ) {
+
+			error( 'WebGLState:', e );
+
+		}
+
+	}
+
+	function compressedTexSubImage2D() {
+
+		try {
+
+			gl.compressedTexSubImage2D( ...arguments );
+
+		} catch ( e ) {
+
+			error( 'WebGLState:', e );
+
+		}
+
+	}
+
+	function compressedTexSubImage3D() {
+
+		try {
+
+			gl.compressedTexSubImage3D( ...arguments );
+
+		} catch ( e ) {
+
+			error( 'WebGLState:', e );
+
+		}
+
+	}
+
+	function texStorage2D() {
+
+		try {
+
+			gl.texStorage2D( ...arguments );
+
+		} catch ( e ) {
+
+			error( 'WebGLState:', e );
+
+		}
+
+	}
+
+	function texStorage3D() {
+
+		try {
+
+			gl.texStorage3D( ...arguments );
+
+		} catch ( e ) {
+
+			error( 'WebGLState:', e );
+
+		}
+
+	}
+
+	function texImage2D() {
+
+		try {
+
+			gl.texImage2D( ...arguments );
+
+		} catch ( e ) {
+
+			error( 'WebGLState:', e );
+
+		}
+
+	}
+
+	function texImage3D() {
+
+		try {
+
+			gl.texImage3D( ...arguments );
+
+		} catch ( e ) {
+
+			error( 'WebGLState:', e );
+
+		}
+
+	}
+
+	function getParameter( name ) {
+
+		if ( parameters[ name ] !== undefined ) {
+
+			return parameters[ name ];
+
+		} else {
+
+			return gl.getParameter( name );
+
+		}
+
+	}
+
+	function pixelStorei( name, value ) {
+
+		if ( parameters[ name ] !== value ) {
+
+			gl.pixelStorei( name, value );
+			parameters[ name ] = value;
+
+		}
+
+	}
+
+	//
+
+	function scissor( scissor ) {
+
+		if ( currentScissor.equals( scissor ) === false ) {
+
+			gl.scissor( scissor.x, scissor.y, scissor.z, scissor.w );
+			currentScissor.copy( scissor );
+
+		}
+
+	}
+
+	function viewport( viewport ) {
+
+		if ( currentViewport.equals( viewport ) === false ) {
+
+			gl.viewport( viewport.x, viewport.y, viewport.z, viewport.w );
+			currentViewport.copy( viewport );
+
+		}
+
+	}
+
+	function updateUBOMapping( uniformsGroup, program ) {
+
+		let mapping = uboProgramMap.get( program );
+
+		if ( mapping === undefined ) {
+
+			mapping = new WeakMap();
+
+			uboProgramMap.set( program, mapping );
+
+		}
+
+		let blockIndex = mapping.get( uniformsGroup );
+
+		if ( blockIndex === undefined ) {
+
+			blockIndex = gl.getUniformBlockIndex( program, uniformsGroup.name );
+
+			mapping.set( uniformsGroup, blockIndex );
+
+		}
+
+	}
+
+	function uniformBlockBinding( uniformsGroup, program ) {
+
+		const mapping = uboProgramMap.get( program );
+		const blockIndex = mapping.get( uniformsGroup );
+
+		if ( uboBindings.get( program ) !== blockIndex ) {
+
+			// bind shader specific block index to global block point
+			gl.uniformBlockBinding( program, blockIndex, uniformsGroup.__bindingPointIndex );
+
+			uboBindings.set( program, blockIndex );
+
+		}
+
+	}
+
+	//
+
+	function reset() {
+
+		// reset state
+
+		gl.disable( gl.BLEND );
+		gl.disable( gl.CULL_FACE );
+		gl.disable( gl.DEPTH_TEST );
+		gl.disable( gl.POLYGON_OFFSET_FILL );
+		gl.disable( gl.SCISSOR_TEST );
+		gl.disable( gl.STENCIL_TEST );
+		gl.disable( gl.SAMPLE_ALPHA_TO_COVERAGE );
+
+		gl.blendEquation( gl.FUNC_ADD );
+		gl.blendFunc( gl.ONE, gl.ZERO );
+		gl.blendFuncSeparate( gl.ONE, gl.ZERO, gl.ONE, gl.ZERO );
+		gl.blendColor( 0, 0, 0, 0 );
+
+		gl.colorMask( true, true, true, true );
+		gl.clearColor( 0, 0, 0, 0 );
+
+		gl.depthMask( true );
+		gl.depthFunc( gl.LESS );
+
+		depthBuffer.setReversed( false );
+
+		gl.clearDepth( 1 );
+
+		gl.stencilMask( 0xffffffff );
+		gl.stencilFunc( gl.ALWAYS, 0, 0xffffffff );
+		gl.stencilOp( gl.KEEP, gl.KEEP, gl.KEEP );
+		gl.clearStencil( 0 );
+
+		gl.cullFace( gl.BACK );
+		gl.frontFace( gl.CCW );
+
+		gl.polygonOffset( 0, 0 );
+
+		gl.activeTexture( gl.TEXTURE0 );
+
+		gl.bindFramebuffer( gl.FRAMEBUFFER, null );
+		gl.bindFramebuffer( gl.DRAW_FRAMEBUFFER, null );
+		gl.bindFramebuffer( gl.READ_FRAMEBUFFER, null );
+
+		gl.useProgram( null );
+
+		gl.lineWidth( 1 );
+
+		gl.scissor( 0, 0, gl.canvas.width, gl.canvas.height );
+		gl.viewport( 0, 0, gl.canvas.width, gl.canvas.height );
+
+		gl.pixelStorei( gl.PACK_ALIGNMENT, 4 );
+		gl.pixelStorei( gl.UNPACK_ALIGNMENT, 4 );
+		gl.pixelStorei( gl.UNPACK_FLIP_Y_WEBGL, false );
+		gl.pixelStorei( gl.UNPACK_PREMULTIPLY_ALPHA_WEBGL, false );
+		gl.pixelStorei( gl.UNPACK_COLORSPACE_CONVERSION_WEBGL, gl.BROWSER_DEFAULT_WEBGL );
+		gl.pixelStorei( gl.PACK_ROW_LENGTH, 0 );
+		gl.pixelStorei( gl.PACK_SKIP_PIXELS, 0 );
+		gl.pixelStorei( gl.PACK_SKIP_ROWS, 0 );
+		gl.pixelStorei( gl.UNPACK_ROW_LENGTH, 0 );
+		gl.pixelStorei( gl.UNPACK_IMAGE_HEIGHT, 0 );
+		gl.pixelStorei( gl.UNPACK_SKIP_PIXELS, 0 );
+		gl.pixelStorei( gl.UNPACK_SKIP_ROWS, 0 );
+		gl.pixelStorei( gl.UNPACK_SKIP_IMAGES, 0 );
+
+		// reset internals
+
+		enabledCapabilities = {};
+		parameters = {};
+
+		currentTextureSlot = null;
+		currentBoundTextures = {};
+
+		currentBoundFramebuffers = {};
+		currentDrawbuffers = new WeakMap();
+		defaultDrawbuffers = [];
+
+		currentProgram = null;
+
+		currentBlendingEnabled = false;
+		currentBlending = null;
+		currentBlendEquation = null;
+		currentBlendSrc = null;
+		currentBlendDst = null;
+		currentBlendEquationAlpha = null;
+		currentBlendSrcAlpha = null;
+		currentBlendDstAlpha = null;
+		currentBlendColor = new Color( 0, 0, 0 );
+		currentBlendAlpha = 0;
+		currentPremultipledAlpha = false;
+
+		currentFlipSided = null;
+		currentCullFace = null;
+
+		currentLineWidth = null;
+
+		currentPolygonOffsetFactor = null;
+		currentPolygonOffsetUnits = null;
+
+		currentScissor.set( 0, 0, gl.canvas.width, gl.canvas.height );
+		currentViewport.set( 0, 0, gl.canvas.width, gl.canvas.height );
+
+		colorBuffer.reset();
+		depthBuffer.reset();
+		stencilBuffer.reset();
+
+	}
+
+	return {
+
+		buffers: {
+			color: colorBuffer,
+			depth: depthBuffer,
+			stencil: stencilBuffer
+		},
+
+		enable: enable,
+		disable: disable,
+
+		bindFramebuffer: bindFramebuffer,
+		drawBuffers: drawBuffers,
+
+		useProgram: useProgram,
+
+		setBlending: setBlending,
+		setMaterial: setMaterial,
+
+		setFlipSided: setFlipSided,
+		setCullFace: setCullFace,
+
+		setLineWidth: setLineWidth,
+		setPolygonOffset: setPolygonOffset,
+
+		setScissorTest: setScissorTest,
+
+		activeTexture: activeTexture,
+		bindTexture: bindTexture,
+		unbindTexture: unbindTexture,
+		compressedTexImage2D: compressedTexImage2D,
+		compressedTexImage3D: compressedTexImage3D,
+		texImage2D: texImage2D,
+		texImage3D: texImage3D,
+		pixelStorei: pixelStorei,
+		getParameter: getParameter,
+
+		updateUBOMapping: updateUBOMapping,
+		uniformBlockBinding: uniformBlockBinding,
+
+		texStorage2D: texStorage2D,
+		texStorage3D: texStorage3D,
+		texSubImage2D: texSubImage2D,
+		texSubImage3D: texSubImage3D,
+		compressedTexSubImage2D: compressedTexSubImage2D,
+		compressedTexSubImage3D: compressedTexSubImage3D,
+
+		scissor: scissor,
+		viewport: viewport,
+
+		reset: reset
+
+	};
+
+}
+
+function WebGLTextures( _gl, extensions, state, properties, capabilities, utils, info ) {
+
+	const multisampledRTTExt = extensions.has( 'WEBGL_multisampled_render_to_texture' ) ? extensions.get( 'WEBGL_multisampled_render_to_texture' ) : null;
+	const supportsInvalidateFramebuffer = typeof navigator === 'undefined' ? false : /OculusBrowser/g.test( navigator.userAgent );
+
+	const _imageDimensions = new Vector2();
+	const _videoTextures = new WeakMap();
+	const _htmlTextures = new Set();
+	let _canvas;
+
+	const _sources = new WeakMap(); // maps WebglTexture objects to instances of TextureSource
+
+	// cordova iOS (as of 5.0) still uses UIWebView, which provides OffscreenCanvas,
+	// also OffscreenCanvas.getContext("webgl"), but not OffscreenCanvas.getContext("2d")!
+	// Some implementations may only implement OffscreenCanvas partially (e.g. lacking 2d).
+
+	let useOffscreenCanvas = false;
+
+	try {
+
+		useOffscreenCanvas = typeof OffscreenCanvas !== 'undefined'
+			&& ( new OffscreenCanvas( 1, 1 ).getContext( '2d' ) ) !== null;
+
+
+	} catch ( err ) {
+
+		// Ignore any errors
+
+	}
+
+	function createCanvas( width, height ) {
+
+		// Use OffscreenCanvas when available. Specially needed in web workers
+
+		return useOffscreenCanvas ?
+			new OffscreenCanvas( width, height ) : createElementNS( 'canvas' );
+
+	}
+
+	function resizeImage( image, needsNewCanvas, maxSize ) {
+
+		let scale = 1;
+
+		const dimensions = getDimensions( image );
+
+		// handle case if texture exceeds max size
+
+		if ( dimensions.width > maxSize || dimensions.height > maxSize ) {
+
+			scale = maxSize / Math.max( dimensions.width, dimensions.height );
+
+		}
+
+		// only perform resize if necessary
+
+		if ( scale < 1 ) {
+
+			// only perform resize for certain image types
+
+			if ( ( typeof HTMLImageElement !== 'undefined' && image instanceof HTMLImageElement ) ||
+				( typeof HTMLCanvasElement !== 'undefined' && image instanceof HTMLCanvasElement ) ||
+				( typeof ImageBitmap !== 'undefined' && image instanceof ImageBitmap ) ||
+				( typeof VideoFrame !== 'undefined' && image instanceof VideoFrame ) ) {
+
+				const width = Math.floor( scale * dimensions.width );
+				const height = Math.floor( scale * dimensions.height );
+
+				if ( _canvas === undefined ) _canvas = createCanvas( width, height );
+
+				// cube textures can't reuse the same canvas
+
+				const canvas = needsNewCanvas ? createCanvas( width, height ) : _canvas;
+
+				canvas.width = width;
+				canvas.height = height;
+
+				const context = canvas.getContext( '2d' );
+				context.drawImage( image, 0, 0, width, height );
+
+				warn( 'WebGLRenderer: Texture has been resized from (' + dimensions.width + 'x' + dimensions.height + ') to (' + width + 'x' + height + ').' );
+
+				return canvas;
+
+			} else {
+
+				if ( 'data' in image ) {
+
+					warn( 'WebGLRenderer: Image in DataTexture is too big (' + dimensions.width + 'x' + dimensions.height + ').' );
+
+				}
+
+				return image;
+
+			}
+
+		}
+
+		return image;
+
+	}
+
+	function textureNeedsGenerateMipmaps( texture ) {
+
+		return texture.generateMipmaps;
+
+	}
+
+	function generateMipmap( target ) {
+
+		_gl.generateMipmap( target );
+
+	}
+
+	function getTargetType( texture ) {
+
+		if ( texture.isWebGLCubeRenderTarget ) return _gl.TEXTURE_CUBE_MAP;
+		if ( texture.isWebGL3DRenderTarget ) return _gl.TEXTURE_3D;
+		if ( texture.isWebGLArrayRenderTarget || texture.isCompressedArrayTexture ) return _gl.TEXTURE_2D_ARRAY;
+		return _gl.TEXTURE_2D;
+
+	}
+
+	function getInternalFormat( internalFormatName, glFormat, glType, normalized, colorSpace, forceLinearTransfer = false ) {
+
+		if ( internalFormatName !== null ) {
+
+			if ( _gl[ internalFormatName ] !== undefined ) return _gl[ internalFormatName ];
+
+			warn( 'WebGLRenderer: Attempt to use non-existing WebGL internal format \'' + internalFormatName + '\'' );
+
+		}
+
+		let ext_texture_norm16;
+
+		if ( normalized ) {
+
+			ext_texture_norm16 = extensions.get( 'EXT_texture_norm16' );
+
+			if ( ! ext_texture_norm16 ) {
+
+				warn( 'WebGLRenderer: Unable to use normalized textures without EXT_texture_norm16 extension' );
+
+			}
+
+		}
+
+		let internalFormat = glFormat;
+
+		if ( glFormat === _gl.RED ) {
+
+			if ( glType === _gl.FLOAT ) internalFormat = _gl.R32F;
+			if ( glType === _gl.HALF_FLOAT ) internalFormat = _gl.R16F;
+			if ( glType === _gl.UNSIGNED_BYTE ) internalFormat = _gl.R8;
+			if ( glType === _gl.UNSIGNED_SHORT && ext_texture_norm16 ) internalFormat = ext_texture_norm16.R16_EXT;
+			if ( glType === _gl.SHORT && ext_texture_norm16 ) internalFormat = ext_texture_norm16.R16_SNORM_EXT;
+
+		}
+
+		if ( glFormat === _gl.RED_INTEGER ) {
+
+			if ( glType === _gl.UNSIGNED_BYTE ) internalFormat = _gl.R8UI;
+			if ( glType === _gl.UNSIGNED_SHORT ) internalFormat = _gl.R16UI;
+			if ( glType === _gl.UNSIGNED_INT ) internalFormat = _gl.R32UI;
+			if ( glType === _gl.BYTE ) internalFormat = _gl.R8I;
+			if ( glType === _gl.SHORT ) internalFormat = _gl.R16I;
+			if ( glType === _gl.INT ) internalFormat = _gl.R32I;
+
+		}
+
+		if ( glFormat === _gl.RG ) {
+
+			if ( glType === _gl.FLOAT ) internalFormat = _gl.RG32F;
+			if ( glType === _gl.HALF_FLOAT ) internalFormat = _gl.RG16F;
+			if ( glType === _gl.UNSIGNED_BYTE ) internalFormat = _gl.RG8;
+			if ( glType === _gl.UNSIGNED_SHORT && ext_texture_norm16 ) internalFormat = ext_texture_norm16.RG16_EXT;
+			if ( glType === _gl.SHORT && ext_texture_norm16 ) internalFormat = ext_texture_norm16.RG16_SNORM_EXT;
+
+		}
+
+		if ( glFormat === _gl.RG_INTEGER ) {
+
+			if ( glType === _gl.UNSIGNED_BYTE ) internalFormat = _gl.RG8UI;
+			if ( glType === _gl.UNSIGNED_SHORT ) internalFormat = _gl.RG16UI;
+			if ( glType === _gl.UNSIGNED_INT ) internalFormat = _gl.RG32UI;
+			if ( glType === _gl.BYTE ) internalFormat = _gl.RG8I;
+			if ( glType === _gl.SHORT ) internalFormat = _gl.RG16I;
+			if ( glType === _gl.INT ) internalFormat = _gl.RG32I;
+
+		}
+
+		if ( glFormat === _gl.RGB_INTEGER ) {
+
+			if ( glType === _gl.UNSIGNED_BYTE ) internalFormat = _gl.RGB8UI;
+			if ( glType === _gl.UNSIGNED_SHORT ) internalFormat = _gl.RGB16UI;
+			if ( glType === _gl.UNSIGNED_INT ) internalFormat = _gl.RGB32UI;
+			if ( glType === _gl.BYTE ) internalFormat = _gl.RGB8I;
+			if ( glType === _gl.SHORT ) internalFormat = _gl.RGB16I;
+			if ( glType === _gl.INT ) internalFormat = _gl.RGB32I;
+
+		}
+
+		if ( glFormat === _gl.RGBA_INTEGER ) {
+
+			if ( glType === _gl.UNSIGNED_BYTE ) internalFormat = _gl.RGBA8UI;
+			if ( glType === _gl.UNSIGNED_SHORT ) internalFormat = _gl.RGBA16UI;
+			if ( glType === _gl.UNSIGNED_INT ) internalFormat = _gl.RGBA32UI;
+			if ( glType === _gl.BYTE ) internalFormat = _gl.RGBA8I;
+			if ( glType === _gl.SHORT ) internalFormat = _gl.RGBA16I;
+			if ( glType === _gl.INT ) internalFormat = _gl.RGBA32I;
+
+		}
+
+		if ( glFormat === _gl.RGB ) {
+
+			if ( glType === _gl.UNSIGNED_SHORT && ext_texture_norm16 ) internalFormat = ext_texture_norm16.RGB16_EXT;
+			if ( glType === _gl.SHORT && ext_texture_norm16 ) internalFormat = ext_texture_norm16.RGB16_SNORM_EXT;
+			if ( glType === _gl.UNSIGNED_INT_5_9_9_9_REV ) internalFormat = _gl.RGB9_E5;
+			if ( glType === _gl.UNSIGNED_INT_10F_11F_11F_REV ) internalFormat = _gl.R11F_G11F_B10F;
+
+		}
+
+		if ( glFormat === _gl.RGBA ) {
+
+			const transfer = forceLinearTransfer ? LinearTransfer : ColorManagement.getTransfer( colorSpace );
+
+			if ( glType === _gl.FLOAT ) internalFormat = _gl.RGBA32F;
+			if ( glType === _gl.HALF_FLOAT ) internalFormat = _gl.RGBA16F;
+			if ( glType === _gl.UNSIGNED_BYTE ) internalFormat = ( transfer === SRGBTransfer ) ? _gl.SRGB8_ALPHA8 : _gl.RGBA8;
+			if ( glType === _gl.UNSIGNED_SHORT && ext_texture_norm16 ) internalFormat = ext_texture_norm16.RGBA16_EXT;
+			if ( glType === _gl.SHORT && ext_texture_norm16 ) internalFormat = ext_texture_norm16.RGBA16_SNORM_EXT;
+			if ( glType === _gl.UNSIGNED_SHORT_4_4_4_4 ) internalFormat = _gl.RGBA4;
+			if ( glType === _gl.UNSIGNED_SHORT_5_5_5_1 ) internalFormat = _gl.RGB5_A1;
+
+		}
+
+		if ( internalFormat === _gl.R16F || internalFormat === _gl.R32F ||
+			internalFormat === _gl.RG16F || internalFormat === _gl.RG32F ||
+			internalFormat === _gl.RGBA16F || internalFormat === _gl.RGBA32F ) {
+
+			extensions.get( 'EXT_color_buffer_float' );
+
+		}
+
+		return internalFormat;
+
+	}
+
+	function getInternalDepthFormat( useStencil, depthType ) {
+
+		let glInternalFormat;
+		if ( useStencil ) {
+
+			if ( depthType === null || depthType === UnsignedIntType || depthType === UnsignedInt248Type ) {
+
+				glInternalFormat = _gl.DEPTH24_STENCIL8;
+
+			} else if ( depthType === FloatType ) {
+
+				glInternalFormat = _gl.DEPTH32F_STENCIL8;
+
+			} else if ( depthType === UnsignedShortType ) {
+
+				glInternalFormat = _gl.DEPTH24_STENCIL8;
+				warn( 'DepthTexture: 16 bit depth attachment is not supported with stencil. Using 24-bit attachment.' );
+
+			}
+
+		} else {
+
+			if ( depthType === null || depthType === UnsignedIntType || depthType === UnsignedInt248Type ) {
+
+				glInternalFormat = _gl.DEPTH_COMPONENT24;
+
+			} else if ( depthType === FloatType ) {
+
+				glInternalFormat = _gl.DEPTH_COMPONENT32F;
+
+			} else if ( depthType === UnsignedShortType ) {
+
+				glInternalFormat = _gl.DEPTH_COMPONENT16;
+
+			}
+
+		}
+
+		return glInternalFormat;
+
+	}
+
+	function getMipLevels( texture, image ) {
+
+		if ( textureNeedsGenerateMipmaps( texture ) === true || ( texture.isFramebufferTexture && texture.minFilter !== NearestFilter && texture.minFilter !== LinearFilter ) ) {
+
+			return Math.log2( Math.max( image.width, image.height ) ) + 1;
+
+		} else if ( texture.mipmaps !== undefined && texture.mipmaps.length > 0 ) {
+
+			// user-defined mipmaps
+
+			return texture.mipmaps.length;
+
+		} else if ( texture.isCompressedTexture && Array.isArray( texture.image ) ) {
+
+			return image.mipmaps.length;
+
+		} else {
+
+			// texture without mipmaps (only base level)
+
+			return 1;
+
+		}
+
+	}
+
+	//
+
+	function onTextureDispose( event ) {
+
+		const texture = event.target;
+
+		texture.removeEventListener( 'dispose', onTextureDispose );
+
+		deallocateTexture( texture );
+
+		if ( texture.isVideoTexture ) {
+
+			_videoTextures.delete( texture );
+
+		}
+
+		if ( texture.isHTMLTexture ) {
+
+			_htmlTextures.delete( texture );
+
+		}
+
+	}
+
+	function onRenderTargetDispose( event ) {
+
+		const renderTarget = event.target;
+
+		renderTarget.removeEventListener( 'dispose', onRenderTargetDispose );
+
+		deallocateRenderTarget( renderTarget );
+
+	}
+
+	//
+
+	function deallocateTexture( texture ) {
+
+		const textureProperties = properties.get( texture );
+
+		if ( textureProperties.__webglInit === undefined ) return;
+
+		// check if it's necessary to remove the WebGLTexture object
+
+		const source = texture.source;
+		const webglTextures = _sources.get( source );
+
+		if ( webglTextures ) {
+
+			const webglTexture = webglTextures[ textureProperties.__cacheKey ];
+			webglTexture.usedTimes --;
+
+			// the WebGLTexture object is not used anymore, remove it
+
+			if ( webglTexture.usedTimes === 0 ) {
+
+				deleteTexture( texture );
+
+			}
+
+			// remove the weak map entry if no WebGLTexture uses the source anymore
+
+			if ( Object.keys( webglTextures ).length === 0 ) {
+
+				_sources.delete( source );
+
+			}
+
+		}
+
+		properties.remove( texture );
+
+	}
+
+	function deleteTexture( texture ) {
+
+		const textureProperties = properties.get( texture );
+		_gl.deleteTexture( textureProperties.__webglTexture );
+
+		const source = texture.source;
+		const webglTextures = _sources.get( source );
+		delete webglTextures[ textureProperties.__cacheKey ];
+
+		info.memory.textures --;
+
+	}
+
+	function deallocateRenderTarget( renderTarget ) {
+
+		const renderTargetProperties = properties.get( renderTarget );
+
+		if ( renderTarget.depthTexture ) {
+
+			renderTarget.depthTexture.dispose();
+
+			properties.remove( renderTarget.depthTexture );
+
+		}
+
+		if ( renderTarget.isWebGLCubeRenderTarget ) {
+
+			for ( let i = 0; i < 6; i ++ ) {
+
+				if ( Array.isArray( renderTargetProperties.__webglFramebuffer[ i ] ) ) {
+
+					for ( let level = 0; level < renderTargetProperties.__webglFramebuffer[ i ].length; level ++ ) _gl.deleteFramebuffer( renderTargetProperties.__webglFramebuffer[ i ][ level ] );
+
+				} else {
+
+					_gl.deleteFramebuffer( renderTargetProperties.__webglFramebuffer[ i ] );
+
+				}
+
+				if ( renderTargetProperties.__webglDepthbuffer ) _gl.deleteRenderbuffer( renderTargetProperties.__webglDepthbuffer[ i ] );
+
+			}
+
+		} else {
+
+			if ( Array.isArray( renderTargetProperties.__webglFramebuffer ) ) {
+
+				for ( let level = 0; level < renderTargetProperties.__webglFramebuffer.length; level ++ ) _gl.deleteFramebuffer( renderTargetProperties.__webglFramebuffer[ level ] );
+
+			} else {
+
+				_gl.deleteFramebuffer( renderTargetProperties.__webglFramebuffer );
+
+			}
+
+			if ( renderTargetProperties.__webglDepthbuffer ) _gl.deleteRenderbuffer( renderTargetProperties.__webglDepthbuffer );
+			if ( renderTargetProperties.__webglMultisampledFramebuffer ) _gl.deleteFramebuffer( renderTargetProperties.__webglMultisampledFramebuffer );
+
+			if ( renderTargetProperties.__webglColorRenderbuffer ) {
+
+				for ( let i = 0; i < renderTargetProperties.__webglColorRenderbuffer.length; i ++ ) {
+
+					if ( renderTargetProperties.__webglColorRenderbuffer[ i ] ) _gl.deleteRenderbuffer( renderTargetProperties.__webglColorRenderbuffer[ i ] );
+
+				}
+
+			}
+
+			if ( renderTargetProperties.__webglDepthRenderbuffer ) _gl.deleteRenderbuffer( renderTargetProperties.__webglDepthRenderbuffer );
+
+		}
+
+		const textures = renderTarget.textures;
+
+		for ( let i = 0, il = textures.length; i < il; i ++ ) {
+
+			const attachmentProperties = properties.get( textures[ i ] );
+
+			if ( attachmentProperties.__webglTexture ) {
+
+				_gl.deleteTexture( attachmentProperties.__webglTexture );
+
+				info.memory.textures --;
+
+			}
+
+			properties.remove( textures[ i ] );
+
+		}
+
+		properties.remove( renderTarget );
+
+	}
+
+	//
+
+	let textureUnits = 0;
+
+	function resetTextureUnits() {
+
+		textureUnits = 0;
+
+	}
+
+	function getTextureUnits() {
+
+		return textureUnits;
+
+	}
+
+	function setTextureUnits( value ) {
+
+		textureUnits = value;
+
+	}
+
+	function allocateTextureUnit() {
+
+		const textureUnit = textureUnits;
+
+		if ( textureUnit >= capabilities.maxTextures ) {
+
+			warn( 'WebGLTextures: Trying to use ' + ( textureUnit + 1 ) + ' texture units while this GPU supports only ' + capabilities.maxTextures );
+
+		}
+
+		textureUnits += 1;
+
+		return textureUnit;
+
+	}
+
+	function getTextureCacheKey( texture ) {
+
+		const array = [];
+
+		array.push( texture.wrapS );
+		array.push( texture.wrapT );
+		array.push( texture.wrapR || 0 );
+		array.push( texture.magFilter );
+		array.push( texture.minFilter );
+		array.push( texture.anisotropy );
+		array.push( texture.internalFormat );
+		array.push( texture.format );
+		array.push( texture.type );
+		array.push( texture.generateMipmaps );
+		array.push( texture.premultiplyAlpha );
+		array.push( texture.flipY );
+		array.push( texture.unpackAlignment );
+		array.push( texture.colorSpace );
+
+		return array.join();
+
+	}
+
+	//
+
+	function setTexture2D( texture, slot ) {
+
+		const textureProperties = properties.get( texture );
+
+		if ( texture.isVideoTexture ) updateVideoTexture( texture );
+
+		if ( texture.isRenderTargetTexture === false && texture.isExternalTexture !== true && texture.version > 0 && textureProperties.__version !== texture.version ) {
+
+			const image = texture.image;
+
+			if ( image === null ) {
+
+				warn( 'WebGLRenderer: Texture marked for update but no image data found.' );
+
+			} else if ( image.complete === false ) {
+
+				warn( 'WebGLRenderer: Texture marked for update but image is incomplete' );
+
+			} else {
+
+				uploadTexture( textureProperties, texture, slot );
+				return;
+
+			}
+
+		} else if ( texture.isExternalTexture ) {
+
+			textureProperties.__webglTexture = texture.sourceTexture ? texture.sourceTexture : null;
+
+		}
+
+		state.bindTexture( _gl.TEXTURE_2D, textureProperties.__webglTexture, _gl.TEXTURE0 + slot );
+
+	}
+
+	function setTexture2DArray( texture, slot ) {
+
+		const textureProperties = properties.get( texture );
+
+		if ( texture.isRenderTargetTexture === false && texture.version > 0 && textureProperties.__version !== texture.version ) {
+
+			uploadTexture( textureProperties, texture, slot );
+			return;
+
+		} else if ( texture.isExternalTexture ) {
+
+			textureProperties.__webglTexture = texture.sourceTexture ? texture.sourceTexture : null;
+
+		}
+
+		state.bindTexture( _gl.TEXTURE_2D_ARRAY, textureProperties.__webglTexture, _gl.TEXTURE0 + slot );
+
+	}
+
+	function setTexture3D( texture, slot ) {
+
+		const textureProperties = properties.get( texture );
+
+		if ( texture.isRenderTargetTexture === false && texture.version > 0 && textureProperties.__version !== texture.version ) {
+
+			uploadTexture( textureProperties, texture, slot );
+			return;
+
+		}
+
+		state.bindTexture( _gl.TEXTURE_3D, textureProperties.__webglTexture, _gl.TEXTURE0 + slot );
+
+	}
+
+	function setTextureCube( texture, slot ) {
+
+		const textureProperties = properties.get( texture );
+
+		if ( texture.isCubeDepthTexture !== true && texture.version > 0 && textureProperties.__version !== texture.version ) {
+
+			uploadCubeTexture( textureProperties, texture, slot );
+			return;
+
+		}
+
+		state.bindTexture( _gl.TEXTURE_CUBE_MAP, textureProperties.__webglTexture, _gl.TEXTURE0 + slot );
+
+	}
+
+	const wrappingToGL = {
+		[ RepeatWrapping ]: _gl.REPEAT,
+		[ ClampToEdgeWrapping ]: _gl.CLAMP_TO_EDGE,
+		[ MirroredRepeatWrapping ]: _gl.MIRRORED_REPEAT
+	};
+
+	const filterToGL = {
+		[ NearestFilter ]: _gl.NEAREST,
+		[ NearestMipmapNearestFilter ]: _gl.NEAREST_MIPMAP_NEAREST,
+		[ NearestMipmapLinearFilter ]: _gl.NEAREST_MIPMAP_LINEAR,
+
+		[ LinearFilter ]: _gl.LINEAR,
+		[ LinearMipmapNearestFilter ]: _gl.LINEAR_MIPMAP_NEAREST,
+		[ LinearMipmapLinearFilter ]: _gl.LINEAR_MIPMAP_LINEAR
+	};
+
+	const compareToGL = {
+		[ NeverCompare ]: _gl.NEVER,
+		[ AlwaysCompare ]: _gl.ALWAYS,
+		[ LessCompare ]: _gl.LESS,
+		[ LessEqualCompare ]: _gl.LEQUAL,
+		[ EqualCompare ]: _gl.EQUAL,
+		[ GreaterEqualCompare ]: _gl.GEQUAL,
+		[ GreaterCompare ]: _gl.GREATER,
+		[ NotEqualCompare ]: _gl.NOTEQUAL
+	};
+
+	function setTextureParameters( textureType, texture ) {
+
+		if ( texture.type === FloatType && extensions.has( 'OES_texture_float_linear' ) === false &&
+			( texture.magFilter === LinearFilter || texture.magFilter === LinearMipmapNearestFilter || texture.magFilter === NearestMipmapLinearFilter || texture.magFilter === LinearMipmapLinearFilter ||
+			texture.minFilter === LinearFilter || texture.minFilter === LinearMipmapNearestFilter || texture.minFilter === NearestMipmapLinearFilter || texture.minFilter === LinearMipmapLinearFilter ) ) {
+
+			warn( 'WebGLRenderer: Unable to use linear filtering with floating point textures. OES_texture_float_linear not supported on this device.' );
+
+		}
+
+		_gl.texParameteri( textureType, _gl.TEXTURE_WRAP_S, wrappingToGL[ texture.wrapS ] );
+		_gl.texParameteri( textureType, _gl.TEXTURE_WRAP_T, wrappingToGL[ texture.wrapT ] );
+
+		if ( textureType === _gl.TEXTURE_3D || textureType === _gl.TEXTURE_2D_ARRAY ) {
+
+			_gl.texParameteri( textureType, _gl.TEXTURE_WRAP_R, wrappingToGL[ texture.wrapR ] );
+
+		}
+
+		_gl.texParameteri( textureType, _gl.TEXTURE_MAG_FILTER, filterToGL[ texture.magFilter ] );
+		_gl.texParameteri( textureType, _gl.TEXTURE_MIN_FILTER, filterToGL[ texture.minFilter ] );
+
+		if ( texture.compareFunction ) {
+
+			_gl.texParameteri( textureType, _gl.TEXTURE_COMPARE_MODE, _gl.COMPARE_REF_TO_TEXTURE );
+			_gl.texParameteri( textureType, _gl.TEXTURE_COMPARE_FUNC, compareToGL[ texture.compareFunction ] );
+
+		}
+
+		if ( extensions.has( 'EXT_texture_filter_anisotropic' ) === true ) {
+
+			if ( texture.magFilter === NearestFilter ) return;
+			if ( texture.minFilter !== NearestMipmapLinearFilter && texture.minFilter !== LinearMipmapLinearFilter ) return;
+			if ( texture.type === FloatType && extensions.has( 'OES_texture_float_linear' ) === false ) return; // verify extension
+
+			if ( texture.anisotropy > 1 || properties.get( texture ).__currentAnisotropy ) {
+
+				const extension = extensions.get( 'EXT_texture_filter_anisotropic' );
+				_gl.texParameterf( textureType, extension.TEXTURE_MAX_ANISOTROPY_EXT, Math.min( texture.anisotropy, capabilities.getMaxAnisotropy() ) );
+				properties.get( texture ).__currentAnisotropy = texture.anisotropy;
+
+			}
+
+		}
+
+	}
+
+	function initTexture( textureProperties, texture ) {
+
+		let forceUpload = false;
+
+		if ( textureProperties.__webglInit === undefined ) {
+
+			textureProperties.__webglInit = true;
+
+			texture.addEventListener( 'dispose', onTextureDispose );
+
+		}
+
+		// create TextureSource <-> WebGLTextures mapping if necessary
+
+		const source = texture.source;
+		let webglTextures = _sources.get( source );
+
+		if ( webglTextures === undefined ) {
+
+			webglTextures = {};
+			_sources.set( source, webglTextures );
+
+		}
+
+		// check if there is already a WebGLTexture object for the given texture parameters
+
+		const textureCacheKey = getTextureCacheKey( texture );
+
+		if ( textureCacheKey !== textureProperties.__cacheKey ) {
+
+			// if not, create a new instance of WebGLTexture
+
+			if ( webglTextures[ textureCacheKey ] === undefined ) {
+
+				// create new entry
+
+				webglTextures[ textureCacheKey ] = {
+					texture: _gl.createTexture(),
+					usedTimes: 0
+				};
+
+				info.memory.textures ++;
+
+				// when a new instance of WebGLTexture was created, a texture upload is required
+				// even if the image contents are identical
+
+				forceUpload = true;
+
+			}
+
+			webglTextures[ textureCacheKey ].usedTimes ++;
+
+			// every time the texture cache key changes, it's necessary to check if an instance of
+			// WebGLTexture can be deleted in order to avoid a memory leak.
+
+			const webglTexture = webglTextures[ textureProperties.__cacheKey ];
+
+			if ( webglTexture !== undefined ) {
+
+				webglTextures[ textureProperties.__cacheKey ].usedTimes --;
+
+				if ( webglTexture.usedTimes === 0 ) {
+
+					deleteTexture( texture );
+
+				}
+
+			}
+
+			// store references to cache key and WebGLTexture object
+
+			textureProperties.__cacheKey = textureCacheKey;
+			textureProperties.__webglTexture = webglTextures[ textureCacheKey ].texture;
+
+		}
+
+		return forceUpload;
+
+	}
+
+	function getRow( index, rowLength, componentStride ) {
+
+		return Math.floor( Math.floor( index / componentStride ) / rowLength );
+
+	}
+
+	function updateTexture( texture, image, glFormat, glType ) {
+
+		const componentStride = 4; // only RGBA supported
+
+		const updateRanges = texture.updateRanges;
+
+		if ( updateRanges.length === 0 ) {
+
+			state.texSubImage2D( _gl.TEXTURE_2D, 0, 0, 0, image.width, image.height, glFormat, glType, image.data );
+
+		} else {
+
+			// Before applying update ranges, we merge any adjacent / overlapping
+			// ranges to reduce load on `gl.texSubImage2D`. Empirically, this has led
+			// to performance improvements for applications which make heavy use of
+			// update ranges. Likely due to GPU command overhead.
+			//
+			// Note that to reduce garbage collection between frames, we merge the
+			// update ranges in-place. This is safe because this method will clear the
+			// update ranges once updated.
+
+			updateRanges.sort( ( a, b ) => a.start - b.start );
+
+			// To merge the update ranges in-place, we work from left to right in the
+			// existing updateRanges array, merging ranges. This may result in a final
+			// array which is smaller than the original. This index tracks the last
+			// index representing a merged range, any data after this index can be
+			// trimmed once the merge algorithm is completed.
+			let mergeIndex = 0;
+
+			for ( let i = 1; i < updateRanges.length; i ++ ) {
+
+				const previousRange = updateRanges[ mergeIndex ];
+				const range = updateRanges[ i ];
+
+				// Only merge if in the same row and overlapping/adjacent
+				const previousEnd = previousRange.start + previousRange.count;
+				const currentRow = getRow( range.start, image.width, componentStride );
+				const previousRow = getRow( previousRange.start, image.width, componentStride );
+
+				// We add one here to merge adjacent ranges. This is safe because ranges
+				// operate over positive integers.
+				if (
+					range.start <= previousEnd + 1 &&
+					currentRow === previousRow &&
+					getRow( range.start + range.count - 1, image.width, componentStride ) === currentRow // ensure range doesn't spill
+				) {
+
+					previousRange.count = Math.max(
+						previousRange.count,
+						range.start + range.count - previousRange.start
+					);
+
+				} else {
+
+					++ mergeIndex;
+					updateRanges[ mergeIndex ] = range;
+
+				}
+
+
+			}
+
+			// Trim the array to only contain the merged ranges.
+			updateRanges.length = mergeIndex + 1;
+
+			const currentUnpackRowLen = state.getParameter( _gl.UNPACK_ROW_LENGTH );
+			const currentUnpackSkipPixels = state.getParameter( _gl.UNPACK_SKIP_PIXELS );
+			const currentUnpackSkipRows = state.getParameter( _gl.UNPACK_SKIP_ROWS );
+
+			state.pixelStorei( _gl.UNPACK_ROW_LENGTH, image.width );
+
+			for ( let i = 0, l = updateRanges.length; i < l; i ++ ) {
+
+				const range = updateRanges[ i ];
+
+				const pixelStart = Math.floor( range.start / componentStride );
+				const pixelCount = Math.ceil( range.count / componentStride );
+
+				const x = pixelStart % image.width;
+				const y = Math.floor( pixelStart / image.width );
+
+				// Assumes update ranges refer to contiguous memory
+				const width = pixelCount;
+				const height = 1;
+
+				state.pixelStorei( _gl.UNPACK_SKIP_PIXELS, x );
+				state.pixelStorei( _gl.UNPACK_SKIP_ROWS, y );
+
+				state.texSubImage2D( _gl.TEXTURE_2D, 0, x, y, width, height, glFormat, glType, image.data );
+
+			}
+
+			texture.clearUpdateRanges();
+
+			state.pixelStorei( _gl.UNPACK_ROW_LENGTH, currentUnpackRowLen );
+			state.pixelStorei( _gl.UNPACK_SKIP_PIXELS, currentUnpackSkipPixels );
+			state.pixelStorei( _gl.UNPACK_SKIP_ROWS, currentUnpackSkipRows );
+
+		}
+
+	}
+
+	function uploadTexture( textureProperties, texture, slot ) {
+
+		let textureType = _gl.TEXTURE_2D;
+
+		if ( texture.isDataArrayTexture || texture.isCompressedArrayTexture ) textureType = _gl.TEXTURE_2D_ARRAY;
+		if ( texture.isData3DTexture ) textureType = _gl.TEXTURE_3D;
+
+		const forceUpload = initTexture( textureProperties, texture );
+		const source = texture.source;
+
+		state.bindTexture( textureType, textureProperties.__webglTexture, _gl.TEXTURE0 + slot );
+
+		const sourceProperties = properties.get( source );
+
+		if ( source.version !== sourceProperties.__version || forceUpload === true ) {
+
+			state.activeTexture( _gl.TEXTURE0 + slot );
+
+			const isImageBitmap = ( typeof ImageBitmap !== 'undefined' && texture.image instanceof ImageBitmap );
+
+			if ( isImageBitmap === false ) {
+
+				const workingPrimaries = ColorManagement.getPrimaries( ColorManagement.workingColorSpace );
+				const texturePrimaries = texture.colorSpace === NoColorSpace ? null : ColorManagement.getPrimaries( texture.colorSpace );
+				const unpackConversion = texture.colorSpace === NoColorSpace || workingPrimaries === texturePrimaries ? _gl.NONE : _gl.BROWSER_DEFAULT_WEBGL;
+
+				state.pixelStorei( _gl.UNPACK_FLIP_Y_WEBGL, texture.flipY );
+				state.pixelStorei( _gl.UNPACK_PREMULTIPLY_ALPHA_WEBGL, texture.premultiplyAlpha );
+				state.pixelStorei( _gl.UNPACK_COLORSPACE_CONVERSION_WEBGL, unpackConversion );
+
+			}
+
+			state.pixelStorei( _gl.UNPACK_ALIGNMENT, texture.unpackAlignment );
+
+			let image = resizeImage( texture.image, false, capabilities.maxTextureSize );
+			image = verifyColorSpace( texture, image );
+
+			const glFormat = utils.convert( texture.format, texture.colorSpace );
+
+			const glType = utils.convert( texture.type );
+			let glInternalFormat = getInternalFormat( texture.internalFormat, glFormat, glType, texture.normalized, texture.colorSpace, texture.isVideoTexture );
+
+			setTextureParameters( textureType, texture );
+
+			let mipmap;
+			const mipmaps = texture.mipmaps;
+
+			const useTexStorage = ( texture.isVideoTexture !== true );
+			const allocateMemory = ( sourceProperties.__version === undefined ) || ( forceUpload === true );
+			const dataReady = source.dataReady;
+			const levels = getMipLevels( texture, image );
+
+			if ( texture.isDepthTexture ) {
+
+				glInternalFormat = getInternalDepthFormat( texture.format === DepthStencilFormat, texture.type );
+
+				//
+
+				if ( allocateMemory ) {
+
+					if ( useTexStorage ) {
+
+						state.texStorage2D( _gl.TEXTURE_2D, 1, glInternalFormat, image.width, image.height );
+
+					} else {
+
+						state.texImage2D( _gl.TEXTURE_2D, 0, glInternalFormat, image.width, image.height, 0, glFormat, glType, null );
+
+					}
+
+				}
+
+			} else if ( texture.isDataTexture ) {
+
+				// use manually created mipmaps if available
+				// if there are no manual mipmaps
+				// set 0 level mipmap and then use GL to generate other mipmap levels
+
+				if ( mipmaps.length > 0 ) {
+
+					if ( useTexStorage && allocateMemory ) {
+
+						state.texStorage2D( _gl.TEXTURE_2D, levels, glInternalFormat, mipmaps[ 0 ].width, mipmaps[ 0 ].height );
+
+					}
+
+					for ( let i = 0, il = mipmaps.length; i < il; i ++ ) {
+
+						mipmap = mipmaps[ i ];
+
+						if ( useTexStorage ) {
+
+							if ( dataReady ) {
+
+								state.texSubImage2D( _gl.TEXTURE_2D, i, 0, 0, mipmap.width, mipmap.height, glFormat, glType, mipmap.data );
+
+							}
+
+						} else {
+
+							state.texImage2D( _gl.TEXTURE_2D, i, glInternalFormat, mipmap.width, mipmap.height, 0, glFormat, glType, mipmap.data );
+
+						}
+
+					}
+
+					texture.generateMipmaps = false;
+
+				} else {
+
+					if ( useTexStorage ) {
+
+						if ( allocateMemory ) {
+
+							state.texStorage2D( _gl.TEXTURE_2D, levels, glInternalFormat, image.width, image.height );
+
+						}
+
+						if ( dataReady ) {
+
+							updateTexture( texture, image, glFormat, glType );
+
+						}
+
+					} else {
+
+						state.texImage2D( _gl.TEXTURE_2D, 0, glInternalFormat, image.width, image.height, 0, glFormat, glType, image.data );
+
+					}
+
+				}
+
+			} else if ( texture.isCompressedTexture ) {
+
+				if ( texture.isCompressedArrayTexture ) {
+
+					if ( useTexStorage && allocateMemory ) {
+
+						state.texStorage3D( _gl.TEXTURE_2D_ARRAY, levels, glInternalFormat, mipmaps[ 0 ].width, mipmaps[ 0 ].height, image.depth );
+
+					}
+
+					for ( let i = 0, il = mipmaps.length; i < il; i ++ ) {
+
+						mipmap = mipmaps[ i ];
+
+						if ( texture.format !== RGBAFormat ) {
+
+							if ( glFormat !== null ) {
+
+								if ( useTexStorage ) {
+
+									if ( dataReady ) {
+
+										if ( texture.layerUpdates.size > 0 ) {
+
+											const layerByteLength = getByteLength( mipmap.width, mipmap.height, texture.format, texture.type );
+
+											for ( const layerIndex of texture.layerUpdates ) {
+
+												const layerData = mipmap.data.subarray(
+													layerIndex * layerByteLength / mipmap.data.BYTES_PER_ELEMENT,
+													( layerIndex + 1 ) * layerByteLength / mipmap.data.BYTES_PER_ELEMENT
+												);
+												state.compressedTexSubImage3D( _gl.TEXTURE_2D_ARRAY, i, 0, 0, layerIndex, mipmap.width, mipmap.height, 1, glFormat, layerData );
+
+											}
+
+										} else {
+
+											state.compressedTexSubImage3D( _gl.TEXTURE_2D_ARRAY, i, 0, 0, 0, mipmap.width, mipmap.height, image.depth, glFormat, mipmap.data );
+
+										}
+
+									}
+
+								} else {
+
+									state.compressedTexImage3D( _gl.TEXTURE_2D_ARRAY, i, glInternalFormat, mipmap.width, mipmap.height, image.depth, 0, mipmap.data, 0, 0 );
+
+								}
+
+							} else {
+
+								warn( 'WebGLRenderer: Attempt to load unsupported compressed texture format in .uploadTexture()' );
+
+							}
+
+						} else {
+
+							if ( useTexStorage ) {
+
+								if ( dataReady ) {
+
+									state.texSubImage3D( _gl.TEXTURE_2D_ARRAY, i, 0, 0, 0, mipmap.width, mipmap.height, image.depth, glFormat, glType, mipmap.data );
+
+								}
+
+							} else {
+
+								state.texImage3D( _gl.TEXTURE_2D_ARRAY, i, glInternalFormat, mipmap.width, mipmap.height, image.depth, 0, glFormat, glType, mipmap.data );
+
+							}
+
+						}
+
+					}
+
+					if ( texture.layerUpdates.size > 0 ) texture.clearLayerUpdates();
+
+				} else {
+
+					if ( useTexStorage && allocateMemory ) {
+
+						state.texStorage2D( _gl.TEXTURE_2D, levels, glInternalFormat, mipmaps[ 0 ].width, mipmaps[ 0 ].height );
+
+					}
+
+					for ( let i = 0, il = mipmaps.length; i < il; i ++ ) {
+
+						mipmap = mipmaps[ i ];
+
+						if ( texture.format !== RGBAFormat ) {
+
+							if ( glFormat !== null ) {
+
+								if ( useTexStorage ) {
+
+									if ( dataReady ) {
+
+										state.compressedTexSubImage2D( _gl.TEXTURE_2D, i, 0, 0, mipmap.width, mipmap.height, glFormat, mipmap.data );
+
+									}
+
+								} else {
+
+									state.compressedTexImage2D( _gl.TEXTURE_2D, i, glInternalFormat, mipmap.width, mipmap.height, 0, mipmap.data );
+
+								}
+
+							} else {
+
+								warn( 'WebGLRenderer: Attempt to load unsupported compressed texture format in .uploadTexture()' );
+
+							}
+
+						} else {
+
+							if ( useTexStorage ) {
+
+								if ( dataReady ) {
+
+									state.texSubImage2D( _gl.TEXTURE_2D, i, 0, 0, mipmap.width, mipmap.height, glFormat, glType, mipmap.data );
+
+								}
+
+							} else {
+
+								state.texImage2D( _gl.TEXTURE_2D, i, glInternalFormat, mipmap.width, mipmap.height, 0, glFormat, glType, mipmap.data );
+
+							}
+
+						}
+
+					}
+
+				}
+
+			} else if ( texture.isDataArrayTexture ) {
+
+				if ( useTexStorage ) {
+
+					if ( allocateMemory ) {
+
+						state.texStorage3D( _gl.TEXTURE_2D_ARRAY, levels, glInternalFormat, image.width, image.height, image.depth );
+
+					}
+
+					if ( dataReady ) {
+
+						if ( texture.layerUpdates.size > 0 ) {
+
+							const layerByteLength = getByteLength( image.width, image.height, texture.format, texture.type );
+
+							for ( const layerIndex of texture.layerUpdates ) {
+
+								const layerData = image.data.subarray(
+									layerIndex * layerByteLength / image.data.BYTES_PER_ELEMENT,
+									( layerIndex + 1 ) * layerByteLength / image.data.BYTES_PER_ELEMENT
+								);
+								state.texSubImage3D( _gl.TEXTURE_2D_ARRAY, 0, 0, 0, layerIndex, image.width, image.height, 1, glFormat, glType, layerData );
+
+							}
+
+							texture.clearLayerUpdates();
+
+						} else {
+
+							state.texSubImage3D( _gl.TEXTURE_2D_ARRAY, 0, 0, 0, 0, image.width, image.height, image.depth, glFormat, glType, image.data );
+
+						}
+
+					}
+
+				} else {
+
+					state.texImage3D( _gl.TEXTURE_2D_ARRAY, 0, glInternalFormat, image.width, image.height, image.depth, 0, glFormat, glType, image.data );
+
+				}
+
+			} else if ( texture.isData3DTexture ) {
+
+				if ( useTexStorage ) {
+
+					if ( allocateMemory ) {
+
+						state.texStorage3D( _gl.TEXTURE_3D, levels, glInternalFormat, image.width, image.height, image.depth );
+
+					}
+
+					if ( dataReady ) {
+
+						state.texSubImage3D( _gl.TEXTURE_3D, 0, 0, 0, 0, image.width, image.height, image.depth, glFormat, glType, image.data );
+
+					}
+
+				} else {
+
+					state.texImage3D( _gl.TEXTURE_3D, 0, glInternalFormat, image.width, image.height, image.depth, 0, glFormat, glType, image.data );
+
+				}
+
+			} else if ( texture.isFramebufferTexture ) {
+
+				if ( allocateMemory ) {
+
+					if ( useTexStorage ) {
+
+						state.texStorage2D( _gl.TEXTURE_2D, levels, glInternalFormat, image.width, image.height );
+
+					} else {
+
+						let width = image.width, height = image.height;
+
+						for ( let i = 0; i < levels; i ++ ) {
+
+							state.texImage2D( _gl.TEXTURE_2D, i, glInternalFormat, width, height, 0, glFormat, glType, null );
+
+							width >>= 1;
+							height >>= 1;
+
+						}
+
+					}
+
+				}
+
+			} else if ( texture.isHTMLTexture ) {
+
+				if ( 'texElementImage2D' in _gl ) {
+
+					const canvas = _gl.canvas;
+
+					// Ensure the canvas supports HTML-in-Canvas and the element is a child.
+					if ( ! canvas.hasAttribute( 'layoutsubtree' ) ) {
+
+						canvas.setAttribute( 'layoutsubtree', 'true' );
+
+					}
+
+					if ( image.parentNode !== canvas ) {
+
+						canvas.appendChild( image );
+
+						// Register and set up a shared paint callback for all HTMLTextures.
+						_htmlTextures.add( texture );
+
+						canvas.onpaint = ( event ) => {
+
+							const changed = event.changedElements;
+
+							for ( const t of _htmlTextures ) {
+
+								if ( changed.includes( t.image ) ) {
+
+									t.needsUpdate = true;
+
+								}
+
+							}
+
+						};
+
+						canvas.requestPaint();
+						return;
+
+					}
+
+					if ( _gl.texElementImage2D.length === 3 ) {
+
+						// Chrome 150+
+
+						_gl.texElementImage2D( _gl.TEXTURE_2D, _gl.RGBA8, image );
+
+					} else {
+
+						// Chrome 138 - 149
+
+						const level = 0;
+						const internalFormat = _gl.RGBA;
+						const srcFormat = _gl.RGBA;
+						const srcType = _gl.UNSIGNED_BYTE;
+
+						_gl.texElementImage2D( _gl.TEXTURE_2D, level, internalFormat, srcFormat, srcType, image );
+
+					}
+
+					_gl.texParameteri( _gl.TEXTURE_2D, _gl.TEXTURE_MIN_FILTER, _gl.LINEAR );
+					_gl.texParameteri( _gl.TEXTURE_2D, _gl.TEXTURE_WRAP_S, _gl.CLAMP_TO_EDGE );
+					_gl.texParameteri( _gl.TEXTURE_2D, _gl.TEXTURE_WRAP_T, _gl.CLAMP_TO_EDGE );
+
+				}
+
+			} else {
+
+				// regular Texture (image, video, canvas)
+
+				// use manually created mipmaps if available
+				// if there are no manual mipmaps
+				// set 0 level mipmap and then use GL to generate other mipmap levels
+
+				if ( mipmaps.length > 0 ) {
+
+					if ( useTexStorage && allocateMemory ) {
+
+						const dimensions = getDimensions( mipmaps[ 0 ] );
+
+						state.texStorage2D( _gl.TEXTURE_2D, levels, glInternalFormat, dimensions.width, dimensions.height );
+
+					}
+
+					for ( let i = 0, il = mipmaps.length; i < il; i ++ ) {
+
+						mipmap = mipmaps[ i ];
+
+						if ( useTexStorage ) {
+
+							if ( dataReady ) {
+
+								state.texSubImage2D( _gl.TEXTURE_2D, i, 0, 0, glFormat, glType, mipmap );
+
+							}
+
+						} else {
+
+							state.texImage2D( _gl.TEXTURE_2D, i, glInternalFormat, glFormat, glType, mipmap );
+
+						}
+
+					}
+
+					texture.generateMipmaps = false;
+
+				} else {
+
+					if ( useTexStorage ) {
+
+						if ( allocateMemory ) {
+
+							const dimensions = getDimensions( image );
+
+							state.texStorage2D( _gl.TEXTURE_2D, levels, glInternalFormat, dimensions.width, dimensions.height );
+
+						}
+
+						if ( dataReady ) {
+
+							state.texSubImage2D( _gl.TEXTURE_2D, 0, 0, 0, glFormat, glType, image );
+
+						}
+
+					} else {
+
+						state.texImage2D( _gl.TEXTURE_2D, 0, glInternalFormat, glFormat, glType, image );
+
+					}
+
+				}
+
+			}
+
+			if ( textureNeedsGenerateMipmaps( texture ) ) {
+
+				generateMipmap( textureType );
+
+			}
+
+			sourceProperties.__version = source.version;
+
+			if ( texture.onUpdate ) texture.onUpdate( texture );
+
+		}
+
+		textureProperties.__version = texture.version;
+
+	}
+
+	function uploadCubeTexture( textureProperties, texture, slot ) {
+
+		if ( texture.image.length !== 6 ) return;
+
+		const forceUpload = initTexture( textureProperties, texture );
+		const source = texture.source;
+
+		state.bindTexture( _gl.TEXTURE_CUBE_MAP, textureProperties.__webglTexture, _gl.TEXTURE0 + slot );
+
+		const sourceProperties = properties.get( source );
+
+		if ( source.version !== sourceProperties.__version || forceUpload === true ) {
+
+			state.activeTexture( _gl.TEXTURE0 + slot );
+
+			const workingPrimaries = ColorManagement.getPrimaries( ColorManagement.workingColorSpace );
+			const texturePrimaries = texture.colorSpace === NoColorSpace ? null : ColorManagement.getPrimaries( texture.colorSpace );
+			const unpackConversion = texture.colorSpace === NoColorSpace || workingPrimaries === texturePrimaries ? _gl.NONE : _gl.BROWSER_DEFAULT_WEBGL;
+
+			state.pixelStorei( _gl.UNPACK_FLIP_Y_WEBGL, texture.flipY );
+			state.pixelStorei( _gl.UNPACK_PREMULTIPLY_ALPHA_WEBGL, texture.premultiplyAlpha );
+			state.pixelStorei( _gl.UNPACK_ALIGNMENT, texture.unpackAlignment );
+			state.pixelStorei( _gl.UNPACK_COLORSPACE_CONVERSION_WEBGL, unpackConversion );
+
+			const isCompressed = ( texture.isCompressedTexture || texture.image[ 0 ].isCompressedTexture );
+			const isDataTexture = ( texture.image[ 0 ] && texture.image[ 0 ].isDataTexture );
+
+			const cubeImage = [];
+
+			for ( let i = 0; i < 6; i ++ ) {
+
+				if ( ! isCompressed && ! isDataTexture ) {
+
+					cubeImage[ i ] = resizeImage( texture.image[ i ], true, capabilities.maxCubemapSize );
+
+				} else {
+
+					cubeImage[ i ] = isDataTexture ? texture.image[ i ].image : texture.image[ i ];
+
+				}
+
+				cubeImage[ i ] = verifyColorSpace( texture, cubeImage[ i ] );
+
+			}
+
+			const image = cubeImage[ 0 ],
+				glFormat = utils.convert( texture.format, texture.colorSpace ),
+				glType = utils.convert( texture.type ),
+				glInternalFormat = getInternalFormat( texture.internalFormat, glFormat, glType, texture.normalized, texture.colorSpace );
+
+			const useTexStorage = ( texture.isVideoTexture !== true );
+			const allocateMemory = ( sourceProperties.__version === undefined ) || ( forceUpload === true );
+			const dataReady = source.dataReady;
+			let levels = getMipLevels( texture, image );
+
+			setTextureParameters( _gl.TEXTURE_CUBE_MAP, texture );
+
+			let mipmaps;
+
+			if ( isCompressed ) {
+
+				if ( useTexStorage && allocateMemory ) {
+
+					state.texStorage2D( _gl.TEXTURE_CUBE_MAP, levels, glInternalFormat, image.width, image.height );
+
+				}
+
+				for ( let i = 0; i < 6; i ++ ) {
+
+					mipmaps = cubeImage[ i ].mipmaps;
+
+					for ( let j = 0; j < mipmaps.length; j ++ ) {
+
+						const mipmap = mipmaps[ j ];
+
+						if ( texture.format !== RGBAFormat ) {
+
+							if ( glFormat !== null ) {
+
+								if ( useTexStorage ) {
+
+									if ( dataReady ) {
+
+										state.compressedTexSubImage2D( _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, j, 0, 0, mipmap.width, mipmap.height, glFormat, mipmap.data );
+
+									}
+
+								} else {
+
+									state.compressedTexImage2D( _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, j, glInternalFormat, mipmap.width, mipmap.height, 0, mipmap.data );
+
+								}
+
+							} else {
+
+								warn( 'WebGLRenderer: Attempt to load unsupported compressed texture format in .setTextureCube()' );
+
+							}
+
+						} else {
+
+							if ( useTexStorage ) {
+
+								if ( dataReady ) {
+
+									state.texSubImage2D( _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, j, 0, 0, mipmap.width, mipmap.height, glFormat, glType, mipmap.data );
+
+								}
+
+							} else {
+
+								state.texImage2D( _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, j, glInternalFormat, mipmap.width, mipmap.height, 0, glFormat, glType, mipmap.data );
+
+							}
+
+						}
+
+					}
+
+				}
+
+			} else {
+
+				mipmaps = texture.mipmaps;
+
+				if ( useTexStorage && allocateMemory ) {
+
+					// TODO: Uniformly handle mipmap definitions
+					// Normal textures and compressed cube textures define base level + mips with their mipmap array
+					// Uncompressed cube textures use their mipmap array only for mips (no base level)
+
+					if ( mipmaps.length > 0 ) levels ++;
+
+					const dimensions = getDimensions( cubeImage[ 0 ] );
+
+					state.texStorage2D( _gl.TEXTURE_CUBE_MAP, levels, glInternalFormat, dimensions.width, dimensions.height );
+
+				}
+
+				for ( let i = 0; i < 6; i ++ ) {
+
+					if ( isDataTexture ) {
+
+						if ( useTexStorage ) {
+
+							if ( dataReady ) {
+
+								state.texSubImage2D( _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, 0, 0, 0, cubeImage[ i ].width, cubeImage[ i ].height, glFormat, glType, cubeImage[ i ].data );
+
+							}
+
+						} else {
+
+							state.texImage2D( _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, 0, glInternalFormat, cubeImage[ i ].width, cubeImage[ i ].height, 0, glFormat, glType, cubeImage[ i ].data );
+
+						}
+
+						for ( let j = 0; j < mipmaps.length; j ++ ) {
+
+							const mipmap = mipmaps[ j ];
+							const mipmapImage = mipmap.image[ i ].image;
+
+							if ( useTexStorage ) {
+
+								if ( dataReady ) {
+
+									state.texSubImage2D( _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, j + 1, 0, 0, mipmapImage.width, mipmapImage.height, glFormat, glType, mipmapImage.data );
+
+								}
+
+							} else {
+
+								state.texImage2D( _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, j + 1, glInternalFormat, mipmapImage.width, mipmapImage.height, 0, glFormat, glType, mipmapImage.data );
+
+							}
+
+						}
+
+					} else {
+
+						if ( useTexStorage ) {
+
+							if ( dataReady ) {
+
+								state.texSubImage2D( _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, 0, 0, 0, glFormat, glType, cubeImage[ i ] );
+
+							}
+
+						} else {
+
+							state.texImage2D( _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, 0, glInternalFormat, glFormat, glType, cubeImage[ i ] );
+
+						}
+
+						for ( let j = 0; j < mipmaps.length; j ++ ) {
+
+							const mipmap = mipmaps[ j ];
+
+							if ( useTexStorage ) {
+
+								if ( dataReady ) {
+
+									state.texSubImage2D( _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, j + 1, 0, 0, glFormat, glType, mipmap.image[ i ] );
+
+								}
+
+							} else {
+
+								state.texImage2D( _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, j + 1, glInternalFormat, glFormat, glType, mipmap.image[ i ] );
+
+							}
+
+						}
+
+					}
+
+				}
+
+			}
+
+			if ( textureNeedsGenerateMipmaps( texture ) ) {
+
+				// We assume images for cube map have the same size.
+				generateMipmap( _gl.TEXTURE_CUBE_MAP );
+
+			}
+
+			sourceProperties.__version = source.version;
+
+			if ( texture.onUpdate ) texture.onUpdate( texture );
+
+		}
+
+		textureProperties.__version = texture.version;
+
+	}
+
+	// Render targets
+
+	// Setup storage for target texture and bind it to correct framebuffer
+	function setupFrameBufferTexture( framebuffer, renderTarget, texture, attachment, textureTarget, level ) {
+
+		const glFormat = utils.convert( texture.format, texture.colorSpace );
+		const glType = utils.convert( texture.type );
+		const glInternalFormat = getInternalFormat( texture.internalFormat, glFormat, glType, texture.normalized, texture.colorSpace );
+		const renderTargetProperties = properties.get( renderTarget );
+		const textureProperties = properties.get( texture );
+
+		textureProperties.__renderTarget = renderTarget;
+
+		if ( ! renderTargetProperties.__hasExternalTextures ) {
+
+			const width = Math.max( 1, renderTarget.width >> level );
+			const height = Math.max( 1, renderTarget.height >> level );
+
+			if ( textureTarget === _gl.TEXTURE_3D || textureTarget === _gl.TEXTURE_2D_ARRAY ) {
+
+				state.texImage3D( textureTarget, level, glInternalFormat, width, height, renderTarget.depth, 0, glFormat, glType, null );
+
+			} else {
+
+				state.texImage2D( textureTarget, level, glInternalFormat, width, height, 0, glFormat, glType, null );
+
+			}
+
+		}
+
+		state.bindFramebuffer( _gl.FRAMEBUFFER, framebuffer );
+
+		if ( useMultisampledRTT( renderTarget ) ) {
+
+			multisampledRTTExt.framebufferTexture2DMultisampleEXT( _gl.FRAMEBUFFER, attachment, textureTarget, textureProperties.__webglTexture, 0, getRenderTargetSamples( renderTarget ) );
+
+		} else if ( textureTarget === _gl.TEXTURE_2D || ( textureTarget >= _gl.TEXTURE_CUBE_MAP_POSITIVE_X && textureTarget <= _gl.TEXTURE_CUBE_MAP_NEGATIVE_Z ) ) { // see #24753
+
+			_gl.framebufferTexture2D( _gl.FRAMEBUFFER, attachment, textureTarget, textureProperties.__webglTexture, level );
+
+		}
+
+		state.bindFramebuffer( _gl.FRAMEBUFFER, null );
+
+	}
+
+	// Setup storage for internal depth/stencil buffers and bind to correct framebuffer
+	function setupRenderBufferStorage( renderbuffer, renderTarget, useMultisample ) {
+
+		_gl.bindRenderbuffer( _gl.RENDERBUFFER, renderbuffer );
+
+		if ( renderTarget.depthBuffer ) {
+
+			// retrieve the depth attachment types
+			const depthTexture = renderTarget.depthTexture;
+			const depthType = depthTexture && depthTexture.isDepthTexture ? depthTexture.type : null;
+			const glInternalFormat = getInternalDepthFormat( renderTarget.stencilBuffer, depthType );
+			const glAttachmentType = renderTarget.stencilBuffer ? _gl.DEPTH_STENCIL_ATTACHMENT : _gl.DEPTH_ATTACHMENT;
+
+			// set up the attachment
+			if ( useMultisampledRTT( renderTarget ) ) {
+
+				multisampledRTTExt.renderbufferStorageMultisampleEXT( _gl.RENDERBUFFER, getRenderTargetSamples( renderTarget ), glInternalFormat, renderTarget.width, renderTarget.height );
+
+			} else if ( useMultisample ) {
+
+				_gl.renderbufferStorageMultisample( _gl.RENDERBUFFER, getRenderTargetSamples( renderTarget ), glInternalFormat, renderTarget.width, renderTarget.height );
+
+			} else {
+
+				_gl.renderbufferStorage( _gl.RENDERBUFFER, glInternalFormat, renderTarget.width, renderTarget.height );
+
+			}
+
+			_gl.framebufferRenderbuffer( _gl.FRAMEBUFFER, glAttachmentType, _gl.RENDERBUFFER, renderbuffer );
+
+		} else {
+
+			const textures = renderTarget.textures;
+
+			for ( let i = 0; i < textures.length; i ++ ) {
+
+				const texture = textures[ i ];
+
+				const glFormat = utils.convert( texture.format, texture.colorSpace );
+				const glType = utils.convert( texture.type );
+				const glInternalFormat = getInternalFormat( texture.internalFormat, glFormat, glType, texture.normalized, texture.colorSpace );
+
+				if ( useMultisampledRTT( renderTarget ) ) {
+
+					multisampledRTTExt.renderbufferStorageMultisampleEXT( _gl.RENDERBUFFER, getRenderTargetSamples( renderTarget ), glInternalFormat, renderTarget.width, renderTarget.height );
+
+				} else if ( useMultisample ) {
+
+					_gl.renderbufferStorageMultisample( _gl.RENDERBUFFER, getRenderTargetSamples( renderTarget ), glInternalFormat, renderTarget.width, renderTarget.height );
+
+				} else {
+
+					_gl.renderbufferStorage( _gl.RENDERBUFFER, glInternalFormat, renderTarget.width, renderTarget.height );
+
+				}
+
+			}
+
+		}
+
+		_gl.bindRenderbuffer( _gl.RENDERBUFFER, null );
+
+	}
+
+	// Setup resources for a Depth Texture for a FBO (needs an extension)
+	function setupDepthTexture( framebuffer, renderTarget, cubeFace ) {
+
+		const isCube = ( renderTarget.isWebGLCubeRenderTarget === true );
+
+		state.bindFramebuffer( _gl.FRAMEBUFFER, framebuffer );
+
+		if ( ! ( renderTarget.depthTexture && renderTarget.depthTexture.isDepthTexture ) ) {
+
+			throw new Error( 'THREE.WebGLTextures: renderTarget.depthTexture must be an instance of THREE.DepthTexture.' );
+
+		}
+
+		const textureProperties = properties.get( renderTarget.depthTexture );
+		textureProperties.__renderTarget = renderTarget;
+
+		// upload an empty depth texture with framebuffer size
+		if ( ! textureProperties.__webglTexture ||
+				renderTarget.depthTexture.image.width !== renderTarget.width ||
+				renderTarget.depthTexture.image.height !== renderTarget.height ) {
+
+			renderTarget.depthTexture.image.width = renderTarget.width;
+			renderTarget.depthTexture.image.height = renderTarget.height;
+			renderTarget.depthTexture.needsUpdate = true;
+
+		}
+
+		if ( isCube ) {
+
+			// For cube depth textures, initialize and bind without uploading image data
+			if ( textureProperties.__webglInit === undefined ) {
+
+				textureProperties.__webglInit = true;
+				renderTarget.depthTexture.addEventListener( 'dispose', onTextureDispose );
+
+			}
+
+			// Only create and allocate storage once
+			if ( textureProperties.__webglTexture === undefined ) {
+
+				textureProperties.__webglTexture = _gl.createTexture();
+
+				state.bindTexture( _gl.TEXTURE_CUBE_MAP, textureProperties.__webglTexture );
+				setTextureParameters( _gl.TEXTURE_CUBE_MAP, renderTarget.depthTexture );
+
+				// Allocate storage for all 6 faces with correct depth texture format
+				const glFormat = utils.convert( renderTarget.depthTexture.format );
+				const glType = utils.convert( renderTarget.depthTexture.type );
+
+				// Use proper internal format for depth textures
+				let glInternalFormat;
+				if ( renderTarget.depthTexture.format === DepthFormat ) {
+
+					glInternalFormat = _gl.DEPTH_COMPONENT24;
+
+				} else if ( renderTarget.depthTexture.format === DepthStencilFormat ) {
+
+					glInternalFormat = _gl.DEPTH24_STENCIL8;
+
+				}
+
+				for ( let i = 0; i < 6; i ++ ) {
+
+					_gl.texImage2D( _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, 0, glInternalFormat, renderTarget.width, renderTarget.height, 0, glFormat, glType, null );
+
+				}
+
+			}
+
+		} else {
+
+			setTexture2D( renderTarget.depthTexture, 0 );
+
+		}
+
+		const webglDepthTexture = textureProperties.__webglTexture;
+		const samples = getRenderTargetSamples( renderTarget );
+
+		const glTextureType = isCube ? _gl.TEXTURE_CUBE_MAP_POSITIVE_X + cubeFace : _gl.TEXTURE_2D;
+		const glAttachmentType = renderTarget.depthTexture.format === DepthStencilFormat ? _gl.DEPTH_STENCIL_ATTACHMENT : _gl.DEPTH_ATTACHMENT;
+
+		if ( renderTarget.depthTexture.format === DepthFormat ) {
+
+			if ( useMultisampledRTT( renderTarget ) ) {
+
+				multisampledRTTExt.framebufferTexture2DMultisampleEXT( _gl.FRAMEBUFFER, glAttachmentType, glTextureType, webglDepthTexture, 0, samples );
+
+			} else {
+
+				_gl.framebufferTexture2D( _gl.FRAMEBUFFER, glAttachmentType, glTextureType, webglDepthTexture, 0 );
+
+			}
+
+		} else if ( renderTarget.depthTexture.format === DepthStencilFormat ) {
+
+			if ( useMultisampledRTT( renderTarget ) ) {
+
+				multisampledRTTExt.framebufferTexture2DMultisampleEXT( _gl.FRAMEBUFFER, glAttachmentType, glTextureType, webglDepthTexture, 0, samples );
+
+			} else {
+
+				_gl.framebufferTexture2D( _gl.FRAMEBUFFER, glAttachmentType, glTextureType, webglDepthTexture, 0 );
+
+			}
+
+		} else {
+
+			throw new Error( 'THREE.WebGLTextures: Unknown depthTexture format.' );
+
+		}
+
+	}
+
+	// Setup GL resources for a non-texture depth buffer
+	function setupDepthRenderbuffer( renderTarget ) {
+
+		const renderTargetProperties = properties.get( renderTarget );
+		const isCube = ( renderTarget.isWebGLCubeRenderTarget === true );
+
+		// if the bound depth texture has changed
+		if ( renderTargetProperties.__boundDepthTexture !== renderTarget.depthTexture ) {
+
+			// fire the dispose event to get rid of stored state associated with the previously bound depth buffer
+			const depthTexture = renderTarget.depthTexture;
+			if ( renderTargetProperties.__depthDisposeCallback ) {
+
+				renderTargetProperties.__depthDisposeCallback();
+
+			}
+
+			// set up dispose listeners to track when the currently attached buffer is implicitly unbound
+			if ( depthTexture ) {
+
+				const disposeEvent = () => {
+
+					delete renderTargetProperties.__boundDepthTexture;
+					delete renderTargetProperties.__depthDisposeCallback;
+					depthTexture.removeEventListener( 'dispose', disposeEvent );
+
+				};
+
+				depthTexture.addEventListener( 'dispose', disposeEvent );
+				renderTargetProperties.__depthDisposeCallback = disposeEvent;
+
+			}
+
+			renderTargetProperties.__boundDepthTexture = depthTexture;
+
+		}
+
+		if ( renderTarget.depthTexture && ! renderTargetProperties.__autoAllocateDepthBuffer ) {
+
+			if ( isCube ) {
+
+				// For cube render targets with depth texture, setup each face
+				for ( let i = 0; i < 6; i ++ ) {
+
+					setupDepthTexture( renderTargetProperties.__webglFramebuffer[ i ], renderTarget, i );
+
+				}
+
+			} else {
+
+				const mipmaps = renderTarget.texture.mipmaps;
+
+				if ( mipmaps && mipmaps.length > 0 ) {
+
+					setupDepthTexture( renderTargetProperties.__webglFramebuffer[ 0 ], renderTarget, 0 );
+
+				} else {
+
+					setupDepthTexture( renderTargetProperties.__webglFramebuffer, renderTarget, 0 );
+
+				}
+
+			}
+
+		} else {
+
+			if ( isCube ) {
+
+				renderTargetProperties.__webglDepthbuffer = [];
+
+				for ( let i = 0; i < 6; i ++ ) {
+
+					state.bindFramebuffer( _gl.FRAMEBUFFER, renderTargetProperties.__webglFramebuffer[ i ] );
+
+					if ( renderTargetProperties.__webglDepthbuffer[ i ] === undefined ) {
+
+						renderTargetProperties.__webglDepthbuffer[ i ] = _gl.createRenderbuffer();
+						setupRenderBufferStorage( renderTargetProperties.__webglDepthbuffer[ i ], renderTarget, false );
+
+					} else {
+
+						// attach buffer if it's been created already
+						const glAttachmentType = renderTarget.stencilBuffer ? _gl.DEPTH_STENCIL_ATTACHMENT : _gl.DEPTH_ATTACHMENT;
+						const renderbuffer = renderTargetProperties.__webglDepthbuffer[ i ];
+						_gl.bindRenderbuffer( _gl.RENDERBUFFER, renderbuffer );
+						_gl.framebufferRenderbuffer( _gl.FRAMEBUFFER, glAttachmentType, _gl.RENDERBUFFER, renderbuffer );
+
+					}
+
+				}
+
+			} else {
+
+				const mipmaps = renderTarget.texture.mipmaps;
+
+				if ( mipmaps && mipmaps.length > 0 ) {
+
+					state.bindFramebuffer( _gl.FRAMEBUFFER, renderTargetProperties.__webglFramebuffer[ 0 ] );
+
+				} else {
+
+					state.bindFramebuffer( _gl.FRAMEBUFFER, renderTargetProperties.__webglFramebuffer );
+
+				}
+
+				if ( renderTargetProperties.__webglDepthbuffer === undefined ) {
+
+					renderTargetProperties.__webglDepthbuffer = _gl.createRenderbuffer();
+					setupRenderBufferStorage( renderTargetProperties.__webglDepthbuffer, renderTarget, false );
+
+				} else {
+
+					// attach buffer if it's been created already
+					const glAttachmentType = renderTarget.stencilBuffer ? _gl.DEPTH_STENCIL_ATTACHMENT : _gl.DEPTH_ATTACHMENT;
+					const renderbuffer = renderTargetProperties.__webglDepthbuffer;
+					_gl.bindRenderbuffer( _gl.RENDERBUFFER, renderbuffer );
+					_gl.framebufferRenderbuffer( _gl.FRAMEBUFFER, glAttachmentType, _gl.RENDERBUFFER, renderbuffer );
+
+				}
+
+			}
+
+		}
+
+		state.bindFramebuffer( _gl.FRAMEBUFFER, null );
+
+	}
+
+	// rebind framebuffer with external textures
+	function rebindTextures( renderTarget, colorTexture, depthTexture ) {
+
+		const renderTargetProperties = properties.get( renderTarget );
+
+		if ( colorTexture !== undefined ) {
+
+			setupFrameBufferTexture( renderTargetProperties.__webglFramebuffer, renderTarget, renderTarget.texture, _gl.COLOR_ATTACHMENT0, _gl.TEXTURE_2D, 0 );
+
+		}
+
+		if ( depthTexture !== undefined ) {
+
+			setupDepthRenderbuffer( renderTarget );
+
+		}
+
+	}
+
+	// Set up GL resources for the render target
+	function setupRenderTarget( renderTarget ) {
+
+		const texture = renderTarget.texture;
+
+		const renderTargetProperties = properties.get( renderTarget );
+		const textureProperties = properties.get( texture );
+
+		renderTarget.addEventListener( 'dispose', onRenderTargetDispose );
+
+		const textures = renderTarget.textures;
+
+		const isCube = ( renderTarget.isWebGLCubeRenderTarget === true );
+		const isMultipleRenderTargets = ( textures.length > 1 );
+
+		if ( ! isMultipleRenderTargets ) {
+
+			if ( textureProperties.__webglTexture === undefined ) {
+
+				textureProperties.__webglTexture = _gl.createTexture();
+
+			}
+
+			textureProperties.__version = texture.version;
+			info.memory.textures ++;
+
+		}
+
+		// Setup framebuffer
+
+		if ( isCube ) {
+
+			renderTargetProperties.__webglFramebuffer = [];
+
+			for ( let i = 0; i < 6; i ++ ) {
+
+				if ( texture.mipmaps && texture.mipmaps.length > 0 ) {
+
+					renderTargetProperties.__webglFramebuffer[ i ] = [];
+
+					for ( let level = 0; level < texture.mipmaps.length; level ++ ) {
+
+						renderTargetProperties.__webglFramebuffer[ i ][ level ] = _gl.createFramebuffer();
+
+					}
+
+				} else {
+
+					renderTargetProperties.__webglFramebuffer[ i ] = _gl.createFramebuffer();
+
+				}
+
+			}
+
+		} else {
+
+			if ( texture.mipmaps && texture.mipmaps.length > 0 ) {
+
+				renderTargetProperties.__webglFramebuffer = [];
+
+				for ( let level = 0; level < texture.mipmaps.length; level ++ ) {
+
+					renderTargetProperties.__webglFramebuffer[ level ] = _gl.createFramebuffer();
+
+				}
+
+			} else {
+
+				renderTargetProperties.__webglFramebuffer = _gl.createFramebuffer();
+
+			}
+
+			if ( isMultipleRenderTargets ) {
+
+				for ( let i = 0, il = textures.length; i < il; i ++ ) {
+
+					const attachmentProperties = properties.get( textures[ i ] );
+
+					if ( attachmentProperties.__webglTexture === undefined ) {
+
+						attachmentProperties.__webglTexture = _gl.createTexture();
+
+						info.memory.textures ++;
+
+					}
+
+				}
+
+			}
+
+			if ( ( renderTarget.samples > 0 ) && useMultisampledRTT( renderTarget ) === false ) {
+
+				renderTargetProperties.__webglMultisampledFramebuffer = _gl.createFramebuffer();
+				renderTargetProperties.__webglColorRenderbuffer = [];
+
+				state.bindFramebuffer( _gl.FRAMEBUFFER, renderTargetProperties.__webglMultisampledFramebuffer );
+
+				for ( let i = 0; i < textures.length; i ++ ) {
+
+					const texture = textures[ i ];
+					renderTargetProperties.__webglColorRenderbuffer[ i ] = _gl.createRenderbuffer();
+
+					_gl.bindRenderbuffer( _gl.RENDERBUFFER, renderTargetProperties.__webglColorRenderbuffer[ i ] );
+
+					const glFormat = utils.convert( texture.format, texture.colorSpace );
+					const glType = utils.convert( texture.type );
+					const glInternalFormat = getInternalFormat( texture.internalFormat, glFormat, glType, texture.normalized, texture.colorSpace, renderTarget.isXRRenderTarget === true );
+					const samples = getRenderTargetSamples( renderTarget );
+					_gl.renderbufferStorageMultisample( _gl.RENDERBUFFER, samples, glInternalFormat, renderTarget.width, renderTarget.height );
+
+					_gl.framebufferRenderbuffer( _gl.FRAMEBUFFER, _gl.COLOR_ATTACHMENT0 + i, _gl.RENDERBUFFER, renderTargetProperties.__webglColorRenderbuffer[ i ] );
+
+				}
+
+				_gl.bindRenderbuffer( _gl.RENDERBUFFER, null );
+
+				if ( renderTarget.depthBuffer ) {
+
+					renderTargetProperties.__webglDepthRenderbuffer = _gl.createRenderbuffer();
+					setupRenderBufferStorage( renderTargetProperties.__webglDepthRenderbuffer, renderTarget, true );
+
+				}
+
+				state.bindFramebuffer( _gl.FRAMEBUFFER, null );
+
+			}
+
+		}
+
+		// Setup color buffer
+
+		if ( isCube ) {
+
+			state.bindTexture( _gl.TEXTURE_CUBE_MAP, textureProperties.__webglTexture );
+			setTextureParameters( _gl.TEXTURE_CUBE_MAP, texture );
+
+			for ( let i = 0; i < 6; i ++ ) {
+
+				if ( texture.mipmaps && texture.mipmaps.length > 0 ) {
+
+					for ( let level = 0; level < texture.mipmaps.length; level ++ ) {
+
+						setupFrameBufferTexture( renderTargetProperties.__webglFramebuffer[ i ][ level ], renderTarget, texture, _gl.COLOR_ATTACHMENT0, _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, level );
+
+					}
+
+				} else {
+
+					setupFrameBufferTexture( renderTargetProperties.__webglFramebuffer[ i ], renderTarget, texture, _gl.COLOR_ATTACHMENT0, _gl.TEXTURE_CUBE_MAP_POSITIVE_X + i, 0 );
+
+				}
+
+			}
+
+			if ( textureNeedsGenerateMipmaps( texture ) ) {
+
+				generateMipmap( _gl.TEXTURE_CUBE_MAP );
+
+			}
+
+			state.unbindTexture();
+
+		} else if ( isMultipleRenderTargets ) {
+
+			for ( let i = 0, il = textures.length; i < il; i ++ ) {
+
+				const attachment = textures[ i ];
+				const attachmentProperties = properties.get( attachment );
+
+				let glTextureType = _gl.TEXTURE_2D;
+
+				if ( renderTarget.isWebGL3DRenderTarget || renderTarget.isWebGLArrayRenderTarget ) {
+
+					glTextureType = renderTarget.isWebGL3DRenderTarget ? _gl.TEXTURE_3D : _gl.TEXTURE_2D_ARRAY;
+
+				}
+
+				state.bindTexture( glTextureType, attachmentProperties.__webglTexture );
+				setTextureParameters( glTextureType, attachment );
+				setupFrameBufferTexture( renderTargetProperties.__webglFramebuffer, renderTarget, attachment, _gl.COLOR_ATTACHMENT0 + i, glTextureType, 0 );
+
+				if ( textureNeedsGenerateMipmaps( attachment ) ) {
+
+					generateMipmap( glTextureType );
+
+				}
+
+			}
+
+			state.unbindTexture();
+
+		} else {
+
+			let glTextureType = _gl.TEXTURE_2D;
+
+			if ( renderTarget.isWebGL3DRenderTarget || renderTarget.isWebGLArrayRenderTarget ) {
+
+				glTextureType = renderTarget.isWebGL3DRenderTarget ? _gl.TEXTURE_3D : _gl.TEXTURE_2D_ARRAY;
+
+			}
+
+			state.bindTexture( glTextureType, textureProperties.__webglTexture );
+			setTextureParameters( glTextureType, texture );
+
+			if ( texture.mipmaps && texture.mipmaps.length > 0 ) {
+
+				for ( let level = 0; level < texture.mipmaps.length; level ++ ) {
+
+					setupFrameBufferTexture( renderTargetProperties.__webglFramebuffer[ level ], renderTarget, texture, _gl.COLOR_ATTACHMENT0, glTextureType, level );
+
+				}
+
+			} else {
+
+				setupFrameBufferTexture( renderTargetProperties.__webglFramebuffer, renderTarget, texture, _gl.COLOR_ATTACHMENT0, glTextureType, 0 );
+
+			}
+
+			if ( textureNeedsGenerateMipmaps( texture ) ) {
+
+				generateMipmap( glTextureType );
+
+			}
+
+			state.unbindTexture();
+
+		}
+
+		// Setup depth and stencil buffers
+
+		if ( renderTarget.depthBuffer ) {
+
+			setupDepthRenderbuffer( renderTarget );
+
+		}
+
+	}
+
+	function updateRenderTargetMipmap( renderTarget ) {
+
+		const textures = renderTarget.textures;
+
+		for ( let i = 0, il = textures.length; i < il; i ++ ) {
+
+			const texture = textures[ i ];
+
+			if ( textureNeedsGenerateMipmaps( texture ) ) {
+
+				const targetType = getTargetType( renderTarget );
+				const webglTexture = properties.get( texture ).__webglTexture;
+
+				state.bindTexture( targetType, webglTexture );
+				generateMipmap( targetType );
+				state.unbindTexture();
+
+			}
+
+		}
+
+	}
+
+	const invalidationArrayRead = [];
+	const invalidationArrayDraw = [];
+
+	function updateMultisampleRenderTarget( renderTarget ) {
+
+		if ( renderTarget.samples > 0 ) {
+
+			if ( useMultisampledRTT( renderTarget ) === false ) {
+
+				const textures = renderTarget.textures;
+				const width = renderTarget.width;
+				const height = renderTarget.height;
+				let mask = _gl.COLOR_BUFFER_BIT;
+				const depthStyle = renderTarget.stencilBuffer ? _gl.DEPTH_STENCIL_ATTACHMENT : _gl.DEPTH_ATTACHMENT;
+				const renderTargetProperties = properties.get( renderTarget );
+				const isMultipleRenderTargets = ( textures.length > 1 );
+
+				// If MRT we need to remove FBO attachments
+				if ( isMultipleRenderTargets ) {
+
+					for ( let i = 0; i < textures.length; i ++ ) {
+
+						state.bindFramebuffer( _gl.FRAMEBUFFER, renderTargetProperties.__webglMultisampledFramebuffer );
+						_gl.framebufferRenderbuffer( _gl.FRAMEBUFFER, _gl.COLOR_ATTACHMENT0 + i, _gl.RENDERBUFFER, null );
+
+						state.bindFramebuffer( _gl.FRAMEBUFFER, renderTargetProperties.__webglFramebuffer );
+						_gl.framebufferTexture2D( _gl.DRAW_FRAMEBUFFER, _gl.COLOR_ATTACHMENT0 + i, _gl.TEXTURE_2D, null, 0 );
+
+					}
+
+				}
+
+				state.bindFramebuffer( _gl.READ_FRAMEBUFFER, renderTargetProperties.__webglMultisampledFramebuffer );
+
+				const mipmaps = renderTarget.texture.mipmaps;
+
+				if ( mipmaps && mipmaps.length > 0 ) {
+
+					state.bindFramebuffer( _gl.DRAW_FRAMEBUFFER, renderTargetProperties.__webglFramebuffer[ 0 ] );
+
+				} else {
+
+					state.bindFramebuffer( _gl.DRAW_FRAMEBUFFER, renderTargetProperties.__webglFramebuffer );
+
+				}
+
+				for ( let i = 0; i < textures.length; i ++ ) {
+
+					if ( renderTarget.resolveDepthBuffer ) {
+
+						if ( renderTarget.depthBuffer ) mask |= _gl.DEPTH_BUFFER_BIT;
+
+						// resolving stencil is slow with a D3D backend. disable it for all transmission render targets (see #27799)
+
+						if ( renderTarget.stencilBuffer && renderTarget.resolveStencilBuffer ) mask |= _gl.STENCIL_BUFFER_BIT;
+
+					}
+
+					if ( isMultipleRenderTargets ) {
+
+						_gl.framebufferRenderbuffer( _gl.READ_FRAMEBUFFER, _gl.COLOR_ATTACHMENT0, _gl.RENDERBUFFER, renderTargetProperties.__webglColorRenderbuffer[ i ] );
+
+						const webglTexture = properties.get( textures[ i ] ).__webglTexture;
+						_gl.framebufferTexture2D( _gl.DRAW_FRAMEBUFFER, _gl.COLOR_ATTACHMENT0, _gl.TEXTURE_2D, webglTexture, 0 );
+
+					}
+
+					_gl.blitFramebuffer( 0, 0, width, height, 0, 0, width, height, mask, _gl.NEAREST );
+
+					if ( supportsInvalidateFramebuffer === true ) {
+
+						invalidationArrayRead.length = 0;
+						invalidationArrayDraw.length = 0;
+
+						invalidationArrayRead.push( _gl.COLOR_ATTACHMENT0 + i );
+
+						if ( renderTarget.depthBuffer && renderTarget.storeMultisampledDepthBuffer === false ) {
+
+							invalidationArrayRead.push( depthStyle );
+							invalidationArrayDraw.push( depthStyle );
+
+							_gl.invalidateFramebuffer( _gl.DRAW_FRAMEBUFFER, invalidationArrayDraw );
+
+						}
+
+						_gl.invalidateFramebuffer( _gl.READ_FRAMEBUFFER, invalidationArrayRead );
+
+					}
+
+				}
+
+				state.bindFramebuffer( _gl.READ_FRAMEBUFFER, null );
+				state.bindFramebuffer( _gl.DRAW_FRAMEBUFFER, null );
+
+				// If MRT since pre-blit we removed the FBO we need to reconstruct the attachments
+				if ( isMultipleRenderTargets ) {
+
+					for ( let i = 0; i < textures.length; i ++ ) {
+
+						state.bindFramebuffer( _gl.FRAMEBUFFER, renderTargetProperties.__webglMultisampledFramebuffer );
+						_gl.framebufferRenderbuffer( _gl.FRAMEBUFFER, _gl.COLOR_ATTACHMENT0 + i, _gl.RENDERBUFFER, renderTargetProperties.__webglColorRenderbuffer[ i ] );
+
+						const webglTexture = properties.get( textures[ i ] ).__webglTexture;
+
+						state.bindFramebuffer( _gl.FRAMEBUFFER, renderTargetProperties.__webglFramebuffer );
+						_gl.framebufferTexture2D( _gl.DRAW_FRAMEBUFFER, _gl.COLOR_ATTACHMENT0 + i, _gl.TEXTURE_2D, webglTexture, 0 );
+
+					}
+
+				}
+
+				state.bindFramebuffer( _gl.DRAW_FRAMEBUFFER, renderTargetProperties.__webglMultisampledFramebuffer );
+
+			} else {
+
+				if ( renderTarget.depthBuffer && renderTarget.storeMultisampledDepthBuffer === false && supportsInvalidateFramebuffer ) {
+
+					const depthStyle = renderTarget.stencilBuffer ? _gl.DEPTH_STENCIL_ATTACHMENT : _gl.DEPTH_ATTACHMENT;
+
+					_gl.invalidateFramebuffer( _gl.DRAW_FRAMEBUFFER, [ depthStyle ] );
+
+				}
+
+			}
+
+		}
+
+	}
+
+	function getRenderTargetSamples( renderTarget ) {
+
+		return Math.min( capabilities.maxSamples, renderTarget.samples );
+
+	}
+
+	function useMultisampledRTT( renderTarget ) {
+
+		const renderTargetProperties = properties.get( renderTarget );
+
+		return renderTarget.samples > 0 && extensions.has( 'WEBGL_multisampled_render_to_texture' ) === true && renderTargetProperties.__useRenderToTexture !== false;
+
+	}
+
+	function updateVideoTexture( texture ) {
+
+		const frame = info.render.frame;
+
+		// Check the last frame we updated the VideoTexture
+
+		if ( _videoTextures.get( texture ) !== frame ) {
+
+			_videoTextures.set( texture, frame );
+			texture.update();
+
+		}
+
+	}
+
+	function verifyColorSpace( texture, image ) {
+
+		const colorSpace = texture.colorSpace;
+		const format = texture.format;
+		const type = texture.type;
+
+		if ( texture.isCompressedTexture === true || texture.isVideoTexture === true ) return image;
+
+		if ( colorSpace !== LinearSRGBColorSpace && colorSpace !== NoColorSpace ) {
+
+			// sRGB
+
+			if ( ColorManagement.getTransfer( colorSpace ) === SRGBTransfer ) {
+
+				// in WebGL 2 uncompressed textures can only be sRGB encoded if they have the RGBA8 format
+
+				if ( format !== RGBAFormat || type !== UnsignedByteType ) {
+
+					warn( 'WebGLTextures: sRGB encoded textures have to use RGBAFormat and UnsignedByteType.' );
+
+				}
+
+			} else {
+
+				error( 'WebGLTextures: Unsupported texture color space:', colorSpace );
+
+			}
+
+		}
+
+		return image;
+
+	}
+
+	function getDimensions( image ) {
+
+		if ( typeof HTMLImageElement !== 'undefined' && image instanceof HTMLImageElement ) {
+
+			// if intrinsic data are not available, fallback to width/height
+
+			_imageDimensions.width = image.naturalWidth || image.width;
+			_imageDimensions.height = image.naturalHeight || image.height;
+
+		} else if ( typeof VideoFrame !== 'undefined' && image instanceof VideoFrame ) {
+
+			_imageDimensions.width = image.displayWidth;
+			_imageDimensions.height = image.displayHeight;
+
+		} else {
+
+			_imageDimensions.width = image.width;
+			_imageDimensions.height = image.height;
+
+		}
+
+		return _imageDimensions;
+
+	}
+
+	//
+
+	this.allocateTextureUnit = allocateTextureUnit;
+	this.resetTextureUnits = resetTextureUnits;
+	this.getTextureUnits = getTextureUnits;
+	this.setTextureUnits = setTextureUnits;
+
+	this.setTexture2D = setTexture2D;
+	this.setTexture2DArray = setTexture2DArray;
+	this.setTexture3D = setTexture3D;
+	this.setTextureCube = setTextureCube;
+	this.rebindTextures = rebindTextures;
+	this.setupRenderTarget = setupRenderTarget;
+	this.updateRenderTargetMipmap = updateRenderTargetMipmap;
+	this.updateMultisampleRenderTarget = updateMultisampleRenderTarget;
+	this.setupDepthRenderbuffer = setupDepthRenderbuffer;
+	this.setupFrameBufferTexture = setupFrameBufferTexture;
+	this.useMultisampledRTT = useMultisampledRTT;
+
+	this.isReversedDepthBuffer = function () {
+
+		return state.buffers.depth.getReversed();
+
+	};
+
+}
+
+function WebGLUtils( gl, extensions ) {
+
+	function convert( p, colorSpace = NoColorSpace ) {
+
+		let extension;
+
+		const transfer = ColorManagement.getTransfer( colorSpace );
+
+		if ( p === UnsignedByteType ) return gl.UNSIGNED_BYTE;
+		if ( p === UnsignedShort4444Type ) return gl.UNSIGNED_SHORT_4_4_4_4;
+		if ( p === UnsignedShort5551Type ) return gl.UNSIGNED_SHORT_5_5_5_1;
+		if ( p === UnsignedInt5999Type ) return gl.UNSIGNED_INT_5_9_9_9_REV;
+		if ( p === UnsignedInt101111Type ) return gl.UNSIGNED_INT_10F_11F_11F_REV;
+
+		if ( p === ByteType ) return gl.BYTE;
+		if ( p === ShortType ) return gl.SHORT;
+		if ( p === UnsignedShortType ) return gl.UNSIGNED_SHORT;
+		if ( p === IntType ) return gl.INT;
+		if ( p === UnsignedIntType ) return gl.UNSIGNED_INT;
+		if ( p === FloatType ) return gl.FLOAT;
+		if ( p === HalfFloatType ) return gl.HALF_FLOAT;
+
+		if ( p === AlphaFormat ) return gl.ALPHA;
+		if ( p === RGBFormat ) return gl.RGB;
+		if ( p === RGBAFormat ) return gl.RGBA;
+		if ( p === DepthFormat ) return gl.DEPTH_COMPONENT;
+		if ( p === DepthStencilFormat ) return gl.DEPTH_STENCIL;
+
+		// WebGL2 formats.
+
+		if ( p === RedFormat ) return gl.RED;
+		if ( p === RedIntegerFormat ) return gl.RED_INTEGER;
+		if ( p === RGFormat ) return gl.RG;
+		if ( p === RGIntegerFormat ) return gl.RG_INTEGER;
+		if ( p === RGBAIntegerFormat ) return gl.RGBA_INTEGER;
+
+		// S3TC
+
+		if ( p === RGB_S3TC_DXT1_Format || p === RGBA_S3TC_DXT1_Format || p === RGBA_S3TC_DXT3_Format || p === RGBA_S3TC_DXT5_Format ) {
+
+			if ( transfer === SRGBTransfer ) {
+
+				extension = extensions.get( 'WEBGL_compressed_texture_s3tc_srgb' );
+
+				if ( extension !== null ) {
+
+					if ( p === RGB_S3TC_DXT1_Format ) return extension.COMPRESSED_SRGB_S3TC_DXT1_EXT;
+					if ( p === RGBA_S3TC_DXT1_Format ) return extension.COMPRESSED_SRGB_ALPHA_S3TC_DXT1_EXT;
+					if ( p === RGBA_S3TC_DXT3_Format ) return extension.COMPRESSED_SRGB_ALPHA_S3TC_DXT3_EXT;
+					if ( p === RGBA_S3TC_DXT5_Format ) return extension.COMPRESSED_SRGB_ALPHA_S3TC_DXT5_EXT;
+
+				} else {
+
+					return null;
+
+				}
+
+			} else {
+
+				extension = extensions.get( 'WEBGL_compressed_texture_s3tc' );
+
+				if ( extension !== null ) {
+
+					if ( p === RGB_S3TC_DXT1_Format ) return extension.COMPRESSED_RGB_S3TC_DXT1_EXT;
+					if ( p === RGBA_S3TC_DXT1_Format ) return extension.COMPRESSED_RGBA_S3TC_DXT1_EXT;
+					if ( p === RGBA_S3TC_DXT3_Format ) return extension.COMPRESSED_RGBA_S3TC_DXT3_EXT;
+					if ( p === RGBA_S3TC_DXT5_Format ) return extension.COMPRESSED_RGBA_S3TC_DXT5_EXT;
+
+				} else {
+
+					return null;
+
+				}
+
+			}
+
+		}
+
+		// PVRTC
+
+		if ( p === RGB_PVRTC_4BPPV1_Format || p === RGB_PVRTC_2BPPV1_Format || p === RGBA_PVRTC_4BPPV1_Format || p === RGBA_PVRTC_2BPPV1_Format ) {
+
+			extension = extensions.get( 'WEBGL_compressed_texture_pvrtc' );
+
+			if ( extension !== null ) {
+
+				if ( p === RGB_PVRTC_4BPPV1_Format ) return extension.COMPRESSED_RGB_PVRTC_4BPPV1_IMG;
+				if ( p === RGB_PVRTC_2BPPV1_Format ) return extension.COMPRESSED_RGB_PVRTC_2BPPV1_IMG;
+				if ( p === RGBA_PVRTC_4BPPV1_Format ) return extension.COMPRESSED_RGBA_PVRTC_4BPPV1_IMG;
+				if ( p === RGBA_PVRTC_2BPPV1_Format ) return extension.COMPRESSED_RGBA_PVRTC_2BPPV1_IMG;
+
+			} else {
+
+				return null;
+
+			}
+
+		}
+
+		// ETC
+
+		if ( p === RGB_ETC1_Format || p === RGB_ETC2_Format || p === RGBA_ETC2_EAC_Format || p === R11_EAC_Format || p === SIGNED_R11_EAC_Format || p === RG11_EAC_Format || p === SIGNED_RG11_EAC_Format ) {
+
+			extension = extensions.get( 'WEBGL_compressed_texture_etc' );
+
+			if ( extension !== null ) {
+
+				if ( p === RGB_ETC1_Format || p === RGB_ETC2_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ETC2 : extension.COMPRESSED_RGB8_ETC2;
+				if ( p === RGBA_ETC2_EAC_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ETC2_EAC : extension.COMPRESSED_RGBA8_ETC2_EAC;
+				if ( p === R11_EAC_Format ) return extension.COMPRESSED_R11_EAC;
+				if ( p === SIGNED_R11_EAC_Format ) return extension.COMPRESSED_SIGNED_R11_EAC;
+				if ( p === RG11_EAC_Format ) return extension.COMPRESSED_RG11_EAC;
+				if ( p === SIGNED_RG11_EAC_Format ) return extension.COMPRESSED_SIGNED_RG11_EAC;
+
+			} else {
+
+				return null;
+
+			}
+
+		}
+
+		// ASTC
+
+		if ( p === RGBA_ASTC_4x4_Format || p === RGBA_ASTC_5x4_Format || p === RGBA_ASTC_5x5_Format ||
+			p === RGBA_ASTC_6x5_Format || p === RGBA_ASTC_6x6_Format || p === RGBA_ASTC_8x5_Format ||
+			p === RGBA_ASTC_8x6_Format || p === RGBA_ASTC_8x8_Format || p === RGBA_ASTC_10x5_Format ||
+			p === RGBA_ASTC_10x6_Format || p === RGBA_ASTC_10x8_Format || p === RGBA_ASTC_10x10_Format ||
+			p === RGBA_ASTC_12x10_Format || p === RGBA_ASTC_12x12_Format ) {
+
+			extension = extensions.get( 'WEBGL_compressed_texture_astc' );
+
+			if ( extension !== null ) {
+
+				if ( p === RGBA_ASTC_4x4_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ASTC_4x4_KHR : extension.COMPRESSED_RGBA_ASTC_4x4_KHR;
+				if ( p === RGBA_ASTC_5x4_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ASTC_5x4_KHR : extension.COMPRESSED_RGBA_ASTC_5x4_KHR;
+				if ( p === RGBA_ASTC_5x5_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ASTC_5x5_KHR : extension.COMPRESSED_RGBA_ASTC_5x5_KHR;
+				if ( p === RGBA_ASTC_6x5_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ASTC_6x5_KHR : extension.COMPRESSED_RGBA_ASTC_6x5_KHR;
+				if ( p === RGBA_ASTC_6x6_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ASTC_6x6_KHR : extension.COMPRESSED_RGBA_ASTC_6x6_KHR;
+				if ( p === RGBA_ASTC_8x5_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ASTC_8x5_KHR : extension.COMPRESSED_RGBA_ASTC_8x5_KHR;
+				if ( p === RGBA_ASTC_8x6_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ASTC_8x6_KHR : extension.COMPRESSED_RGBA_ASTC_8x6_KHR;
+				if ( p === RGBA_ASTC_8x8_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ASTC_8x8_KHR : extension.COMPRESSED_RGBA_ASTC_8x8_KHR;
+				if ( p === RGBA_ASTC_10x5_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ASTC_10x5_KHR : extension.COMPRESSED_RGBA_ASTC_10x5_KHR;
+				if ( p === RGBA_ASTC_10x6_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ASTC_10x6_KHR : extension.COMPRESSED_RGBA_ASTC_10x6_KHR;
+				if ( p === RGBA_ASTC_10x8_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ASTC_10x8_KHR : extension.COMPRESSED_RGBA_ASTC_10x8_KHR;
+				if ( p === RGBA_ASTC_10x10_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ASTC_10x10_KHR : extension.COMPRESSED_RGBA_ASTC_10x10_KHR;
+				if ( p === RGBA_ASTC_12x10_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ASTC_12x10_KHR : extension.COMPRESSED_RGBA_ASTC_12x10_KHR;
+				if ( p === RGBA_ASTC_12x12_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB8_ALPHA8_ASTC_12x12_KHR : extension.COMPRESSED_RGBA_ASTC_12x12_KHR;
+
+			} else {
+
+				return null;
+
+			}
+
+		}
+
+		// BPTC
+
+		if ( p === RGBA_BPTC_Format || p === RGB_BPTC_SIGNED_Format || p === RGB_BPTC_UNSIGNED_Format ) {
+
+			extension = extensions.get( 'EXT_texture_compression_bptc' );
+
+			if ( extension !== null ) {
+
+				if ( p === RGBA_BPTC_Format ) return ( transfer === SRGBTransfer ) ? extension.COMPRESSED_SRGB_ALPHA_BPTC_UNORM_EXT : extension.COMPRESSED_RGBA_BPTC_UNORM_EXT;
+				if ( p === RGB_BPTC_SIGNED_Format ) return extension.COMPRESSED_RGB_BPTC_SIGNED_FLOAT_EXT;
+				if ( p === RGB_BPTC_UNSIGNED_Format ) return extension.COMPRESSED_RGB_BPTC_UNSIGNED_FLOAT_EXT;
+
+			} else {
+
+				return null;
+
+			}
+
+		}
+
+		// RGTC
+
+		if ( p === RED_RGTC1_Format || p === SIGNED_RED_RGTC1_Format || p === RED_GREEN_RGTC2_Format || p === SIGNED_RED_GREEN_RGTC2_Format ) {
+
+			extension = extensions.get( 'EXT_texture_compression_rgtc' );
+
+			if ( extension !== null ) {
+
+				if ( p === RED_RGTC1_Format ) return extension.COMPRESSED_RED_RGTC1_EXT;
+				if ( p === SIGNED_RED_RGTC1_Format ) return extension.COMPRESSED_SIGNED_RED_RGTC1_EXT;
+				if ( p === RED_GREEN_RGTC2_Format ) return extension.COMPRESSED_RED_GREEN_RGTC2_EXT;
+				if ( p === SIGNED_RED_GREEN_RGTC2_Format ) return extension.COMPRESSED_SIGNED_RED_GREEN_RGTC2_EXT;
+
+			} else {
+
+				return null;
+
+			}
+
+		}
+
+		//
+
+		if ( p === UnsignedInt248Type ) return gl.UNSIGNED_INT_24_8;
+
+		// if "p" can't be resolved, assume the user defines a WebGL constant as a string (fallback/workaround for packed RGB formats)
+
+		return ( gl[ p ] !== undefined ) ? gl[ p ] : null;
+
+	}
+
+	return { convert: convert };
+
+}
+
+const _occlusion_vertex = `
+void main() {
+
+	gl_Position = vec4( position, 1.0 );
+
+}`;
+
+const _occlusion_fragment = `
+uniform sampler2DArray depthColor;
+uniform float depthWidth;
+uniform float depthHeight;
+
+void main() {
+
+	vec2 coord = vec2( gl_FragCoord.x / depthWidth, gl_FragCoord.y / depthHeight );
+
+	if ( coord.x >= 1.0 ) {
+
+		gl_FragDepth = texture( depthColor, vec3( coord.x - 1.0, coord.y, 1 ) ).r;
+
+	} else {
+
+		gl_FragDepth = texture( depthColor, vec3( coord.x, coord.y, 0 ) ).r;
+
+	}
+
+}`;
+
+/**
+ * A XR module that manages the access to the Depth Sensing API.
+ */
+class WebXRDepthSensing {
+
+	/**
+	 * Constructs a new depth sensing module.
+	 */
+	constructor() {
+
+		/**
+		 * An opaque texture representing the depth of the user's environment.
+		 *
+		 * @type {?ExternalTexture}
+		 */
+		this.texture = null;
+
+		/**
+		 * A plane mesh for visualizing the depth texture.
+		 *
+		 * @type {?Mesh}
+		 */
+		this.mesh = null;
+
+		/**
+		 * The depth near value.
+		 *
+		 * @type {number}
+		 */
+		this.depthNear = 0;
+
+		/**
+		 * The depth near far.
+		 *
+		 * @type {number}
+		 */
+		this.depthFar = 0;
+
+	}
+
+	/**
+	 * Inits the depth sensing module
+	 *
+	 * @param {XRWebGLDepthInformation} depthData - The XR depth data.
+	 * @param {XRRenderState} renderState - The XR render state.
+	 */
+	init( depthData, renderState ) {
+
+		if ( this.texture === null ) {
+
+			const texture = new ExternalTexture( depthData.texture );
+
+			if ( ( depthData.depthNear !== renderState.depthNear ) || ( depthData.depthFar !== renderState.depthFar ) ) {
+
+				this.depthNear = depthData.depthNear;
+				this.depthFar = depthData.depthFar;
+
+			}
+
+			this.texture = texture;
+
+		}
+
+	}
+
+	/**
+	 * Returns a plane mesh that visualizes the depth texture.
+	 *
+	 * @param {ArrayCamera} cameraXR - The XR camera.
+	 * @return {?Mesh} The plane mesh.
+	 */
+	getMesh( cameraXR ) {
+
+		if ( this.texture !== null ) {
+
+			if ( this.mesh === null ) {
+
+				const viewport = cameraXR.cameras[ 0 ].viewport;
+				const material = new ShaderMaterial( {
+					vertexShader: _occlusion_vertex,
+					fragmentShader: _occlusion_fragment,
+					uniforms: {
+						depthColor: { value: this.texture },
+						depthWidth: { value: viewport.z },
+						depthHeight: { value: viewport.w }
+					}
+				} );
+
+				this.mesh = new Mesh( new PlaneGeometry( 20, 20 ), material );
+
+			}
+
+		}
+
+		return this.mesh;
+
+	}
+
+	/**
+	 * Resets the module
+	 */
+	reset() {
+
+		this.texture = null;
+		this.mesh = null;
+
+	}
+
+	/**
+	 * Returns a texture representing the depth of the user's environment.
+	 *
+	 * @return {?ExternalTexture} The depth texture.
+	 */
+	getDepthTexture() {
+
+		return this.texture;
+
+	}
+
+}
+
+/**
+ * This class represents an abstraction of the WebXR Device API and is
+ * internally used by {@link WebGLRenderer}. `WebXRManager` also provides a public
+ * interface that allows users to enable/disable XR and perform XR related
+ * tasks like for instance retrieving controllers.
+ *
+ * @augments EventDispatcher
+ * @hideconstructor
+ */
+class WebXRManager extends EventDispatcher {
+
+	/**
+	 * Constructs a new WebGL renderer.
+	 *
+	 * @param {WebGLRenderer} renderer - The renderer.
+	 * @param {WebGL2RenderingContext} gl - The rendering context.
+	 */
+	constructor( renderer, gl ) {
+
+		super();
+
+		const scope = this;
+
+		let session = null;
+
+		let framebufferScaleFactor = 1.0;
+
+		let referenceSpace = null;
+		let referenceSpaceType = 'local-floor';
+		// Set default foveation to maximum.
+		let foveation = 1.0;
+		let customReferenceSpace = null;
+
+		let pose = null;
+		let glBinding = null;
+		let glProjLayer = null;
+		let glBaseLayer = null;
+		let xrFrame = null;
+
+		const supportsGlBinding = typeof XRWebGLBinding !== 'undefined';
+
+		const depthSensing = new WebXRDepthSensing();
+		const cameraAccessTextures = {};
+		const attributes = gl.getContextAttributes();
+
+		let initialRenderTarget = null;
+		let newRenderTarget = null;
+
+		const controllers = [];
+		const controllerInputSources = [];
+
+		const currentSize = new Vector2();
+		let currentPixelRatio = null;
+		let currentCameraSettings = null;
+
+		//
+
+		const cameraL = new PerspectiveCamera();
+		cameraL.viewport = new Vector4();
+
+		const cameraR = new PerspectiveCamera();
+		cameraR.viewport = new Vector4();
+
+		const cameras = [ cameraL, cameraR ];
+
+		const cameraXR = new ArrayCamera();
+
+		let _currentDepthNear = null;
+		let _currentDepthFar = null;
+
+		//
+
+		/**
+		 * Whether the manager's XR camera should be automatically updated or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.cameraAutoUpdate = true;
+
+		/**
+		 * This flag notifies the renderer to be ready for XR rendering. Set it to `true`
+		 * if you are going to use XR in your app.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.enabled = false;
+
+		/**
+		 * Whether XR presentation is active or not.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default false
+		 */
+		this.isPresenting = false;
+
+		/**
+		 * Returns a group representing the `target ray` space of the XR controller.
+		 * Use this space for visualizing 3D objects that support the user in pointing
+		 * tasks like UI interaction.
+		 *
+		 * @param {number} index - The index of the controller.
+		 * @return {Group} A group representing the `target ray` space.
+		 */
+		this.getController = function ( index ) {
+
+			let controller = controllers[ index ];
+
+			if ( controller === undefined ) {
+
+				controller = new WebXRController();
+				controllers[ index ] = controller;
+
+			}
+
+			return controller.getTargetRaySpace();
+
+		};
+
+		/**
+		 * Returns a group representing the `grip` space of the XR controller.
+		 * Use this space for visualizing 3D objects that support the user in pointing
+		 * tasks like UI interaction.
+		 *
+		 * Note: If you want to show something in the user's hand AND offer a
+		 * pointing ray at the same time, you'll want to attached the handheld object
+		 * to the group returned by `getControllerGrip()` and the ray to the
+		 * group returned by `getController()`. The idea is to have two
+		 * different groups in two different coordinate spaces for the same WebXR
+		 * controller.
+		 *
+		 * @param {number} index - The index of the controller.
+		 * @return {Group} A group representing the `grip` space.
+		 */
+		this.getControllerGrip = function ( index ) {
+
+			let controller = controllers[ index ];
+
+			if ( controller === undefined ) {
+
+				controller = new WebXRController();
+				controllers[ index ] = controller;
+
+			}
+
+			return controller.getGripSpace();
+
+		};
+
+		/**
+		 * Returns a group representing the `hand` space of the XR controller.
+		 * Use this space for visualizing 3D objects that support the user in pointing
+		 * tasks like UI interaction.
+		 *
+		 * @param {number} index - The index of the controller.
+		 * @return {Group} A group representing the `hand` space.
+		 */
+		this.getHand = function ( index ) {
+
+			let controller = controllers[ index ];
+
+			if ( controller === undefined ) {
+
+				controller = new WebXRController();
+				controllers[ index ] = controller;
+
+			}
+
+			return controller.getHandSpace();
+
+		};
+
+		//
+
+		function onSessionEvent( event ) {
+
+			const controllerIndex = controllerInputSources.indexOf( event.inputSource );
+
+			if ( controllerIndex === -1 ) {
+
+				return;
+
+			}
+
+			const controller = controllers[ controllerIndex ];
+
+			if ( controller !== undefined ) {
+
+				controller.update( event.inputSource, event.frame, customReferenceSpace || referenceSpace );
+				controller.dispatchEvent( { type: event.type, data: event.inputSource } );
+
+			}
+
+		}
+
+		function onSessionEnd() {
+
+			session.removeEventListener( 'select', onSessionEvent );
+			session.removeEventListener( 'selectstart', onSessionEvent );
+			session.removeEventListener( 'selectend', onSessionEvent );
+			session.removeEventListener( 'squeeze', onSessionEvent );
+			session.removeEventListener( 'squeezestart', onSessionEvent );
+			session.removeEventListener( 'squeezeend', onSessionEvent );
+			session.removeEventListener( 'end', onSessionEnd );
+			session.removeEventListener( 'inputsourceschange', onInputSourcesChange );
+
+			for ( let i = 0; i < controllers.length; i ++ ) {
+
+				const inputSource = controllerInputSources[ i ];
+
+				if ( inputSource === null ) continue;
+
+				controllerInputSources[ i ] = null;
+
+				controllers[ i ].disconnect( inputSource );
+
+			}
+
+			_currentDepthNear = null;
+			_currentDepthFar = null;
+
+			depthSensing.reset();
+			for ( const key in cameraAccessTextures ) {
+
+				delete cameraAccessTextures[ key ];
+
+			}
+
+			// restore framebuffer/rendering state
+
+			renderer.setRenderTarget( initialRenderTarget );
+
+			glBaseLayer = null;
+			glProjLayer = null;
+			glBinding = null;
+			session = null;
+			newRenderTarget = null;
+
+			//
+
+			animation.stop();
+
+			scope.isPresenting = false;
+
+			renderer.setPixelRatio( currentPixelRatio );
+			renderer.setSize( currentSize.width, currentSize.height, false );
+
+			if ( currentCameraSettings !== null ) {
+
+				const camera = currentCameraSettings.camera;
+
+				camera.fov = currentCameraSettings.fov;
+				camera.zoom = currentCameraSettings.zoom;
+				camera.updateProjectionMatrix();
+
+				currentCameraSettings = null;
+
+			}
+
+			scope.dispatchEvent( { type: 'sessionend' } );
+
+		}
+
+		/**
+		 * Sets the framebuffer scale factor.
+		 *
+		 * This method can not be used during a XR session.
+		 *
+		 * @param {number} value - The framebuffer scale factor.
+		 */
+		this.setFramebufferScaleFactor = function ( value ) {
+
+			framebufferScaleFactor = value;
+
+			if ( scope.isPresenting === true ) {
+
+				warn( 'WebXRManager: Cannot change framebuffer scale while presenting.' );
+
+			}
+
+		};
+
+		/**
+		 * Sets the reference space type. Can be used to configure a spatial relationship with the user's physical
+		 * environment. Depending on how the user moves in 3D space, setting an appropriate reference space can
+		 * improve tracking. Default is `local-floor`. Valid values can be found here
+		 * https://developer.mozilla.org/en-US/docs/Web/API/XRReferenceSpace#reference_space_types.
+		 *
+		 * This method can not be used during a XR session.
+		 *
+		 * @param {string} value - The reference space type.
+		 */
+		this.setReferenceSpaceType = function ( value ) {
+
+			referenceSpaceType = value;
+
+			if ( scope.isPresenting === true ) {
+
+				warn( 'WebXRManager: Cannot change reference space type while presenting.' );
+
+			}
+
+		};
+
+		/**
+		 * Returns the XR reference space.
+		 *
+		 * @return {XRReferenceSpace} The XR reference space.
+		 */
+		this.getReferenceSpace = function () {
+
+			return customReferenceSpace || referenceSpace;
+
+		};
+
+		/**
+		 * Sets a custom XR reference space.
+		 *
+		 * @param {XRReferenceSpace} space - The XR reference space.
+		 */
+		this.setReferenceSpace = function ( space ) {
+
+			customReferenceSpace = space;
+
+		};
+
+		/**
+		 * Returns the current base layer.
+		 *
+		 * This is an `XRProjectionLayer` when the targeted XR device supports the
+		 * WebXR Layers API, or an `XRWebGLLayer` otherwise.
+		 *
+		 * @return {?(XRWebGLLayer|XRProjectionLayer)} The XR base layer.
+		 */
+		this.getBaseLayer = function () {
+
+			return glProjLayer !== null ? glProjLayer : glBaseLayer;
+
+		};
+
+		/**
+		 * Returns the current XR binding.
+		 *
+		 * Creates a new binding if needed and the browser is
+		 * capable of doing so.
+		 *
+		 * @return {?XRWebGLBinding} The XR binding. Returns `null` if one cannot be created.
+		 */
+		this.getBinding = function () {
+
+			if ( glBinding === null && supportsGlBinding ) {
+
+				glBinding = new XRWebGLBinding( session, gl );
+
+			}
+
+			return glBinding;
+
+		};
+
+		/**
+		 * Returns the current XR frame.
+		 *
+		 * @return {?XRFrame} The XR frame. Returns `null` when used outside a XR session.
+		 */
+		this.getFrame = function () {
+
+			return xrFrame;
+
+		};
+
+		/**
+		 * Returns the current XR session.
+		 *
+		 * @return {?XRSession} The XR session. Returns `null` when used outside a XR session.
+		 */
+		this.getSession = function () {
+
+			return session;
+
+		};
+
+		/**
+		 * After a XR session has been requested usually with one of the `*Button` modules, it
+		 * is injected into the renderer with this method. This method triggers the start of
+		 * the actual XR rendering.
+		 *
+		 * @async
+		 * @param {XRSession} value - The XR session to set.
+		 * @return {Promise} A Promise that resolves when the session has been set.
+		 */
+		this.setSession = async function ( value ) {
+
+			session = value;
+
+			if ( session !== null ) {
+
+				initialRenderTarget = renderer.getRenderTarget();
+
+				session.addEventListener( 'select', onSessionEvent );
+				session.addEventListener( 'selectstart', onSessionEvent );
+				session.addEventListener( 'selectend', onSessionEvent );
+				session.addEventListener( 'squeeze', onSessionEvent );
+				session.addEventListener( 'squeezestart', onSessionEvent );
+				session.addEventListener( 'squeezeend', onSessionEvent );
+				session.addEventListener( 'end', onSessionEnd );
+				session.addEventListener( 'inputsourceschange', onInputSourcesChange );
+
+				if ( attributes.xrCompatible !== true ) {
+
+					await gl.makeXRCompatible();
+
+				}
+
+				currentPixelRatio = renderer.getPixelRatio();
+				renderer.getSize( currentSize );
+
+
+				// Check that the browser implements the necessary APIs to use an
+				// XRProjectionLayer rather than an XRWebGLLayer
+				const supportsLayers = supportsGlBinding && 'createProjectionLayer' in XRWebGLBinding.prototype;
+
+				if ( ! supportsLayers ) {
+
+					const layerInit = {
+						antialias: attributes.antialias,
+						alpha: true,
+						depth: attributes.depth,
+						stencil: attributes.stencil,
+						framebufferScaleFactor: framebufferScaleFactor
+					};
+
+					glBaseLayer = new XRWebGLLayer( session, gl, layerInit );
+
+					session.updateRenderState( { baseLayer: glBaseLayer } );
+
+					renderer.setPixelRatio( 1 );
+					renderer.setSize( glBaseLayer.framebufferWidth, glBaseLayer.framebufferHeight, false );
+
+					newRenderTarget = new WebGLRenderTarget(
+						glBaseLayer.framebufferWidth,
+						glBaseLayer.framebufferHeight,
+						{
+							format: RGBAFormat,
+							type: UnsignedByteType,
+							colorSpace: renderer.outputColorSpace,
+							stencilBuffer: attributes.stencil,
+							resolveDepthBuffer: ( glBaseLayer.ignoreDepthValues === false ),
+							resolveStencilBuffer: ( glBaseLayer.ignoreDepthValues === false ),
+							storeMultisampledDepthBuffer: ( glBaseLayer.ignoreDepthValues === false ),
+							storeMultisampledStencilBuffer: ( glBaseLayer.ignoreDepthValues === false )
+
+						}
+					);
+
+				} else {
+
+					let depthFormat = null;
+					let depthType = null;
+					let glDepthFormat = null;
+
+					if ( attributes.depth ) {
+
+						glDepthFormat = attributes.stencil ? gl.DEPTH24_STENCIL8 : gl.DEPTH_COMPONENT24;
+						depthFormat = attributes.stencil ? DepthStencilFormat : DepthFormat;
+						depthType = attributes.stencil ? UnsignedInt248Type : UnsignedIntType;
+
+					}
+
+					const projectionlayerInit = {
+						colorFormat: gl.RGBA8,
+						depthFormat: glDepthFormat,
+						scaleFactor: framebufferScaleFactor
+					};
+
+					glBinding = this.getBinding();
+
+					glProjLayer = glBinding.createProjectionLayer( projectionlayerInit );
+
+					session.updateRenderState( { layers: [ glProjLayer ] } );
+
+					renderer.setPixelRatio( 1 );
+					renderer.setSize( glProjLayer.textureWidth, glProjLayer.textureHeight, false );
+
+					newRenderTarget = new WebGLRenderTarget(
+						glProjLayer.textureWidth,
+						glProjLayer.textureHeight,
+						{
+							format: RGBAFormat,
+							type: UnsignedByteType,
+							depthTexture: new DepthTexture( glProjLayer.textureWidth, glProjLayer.textureHeight, depthType, undefined, undefined, undefined, undefined, undefined, undefined, depthFormat ),
+							stencilBuffer: attributes.stencil,
+							colorSpace: renderer.outputColorSpace,
+							samples: attributes.antialias ? 4 : 0,
+							resolveDepthBuffer: ( glProjLayer.ignoreDepthValues === false ),
+							resolveStencilBuffer: ( glProjLayer.ignoreDepthValues === false ),
+							storeMultisampledDepthBuffer: ( glProjLayer.ignoreDepthValues === false ),
+							storeMultisampledStencilBuffer: ( glProjLayer.ignoreDepthValues === false )
+						} );
+
+				}
+
+				newRenderTarget.isXRRenderTarget = true; // TODO Remove this when possible, see #23278
+
+				this.setFoveation( foveation );
+
+				customReferenceSpace = null;
+				referenceSpace = await session.requestReferenceSpace( referenceSpaceType );
+
+				animation.setContext( session );
+				animation.start();
+
+				scope.isPresenting = true;
+
+				scope.dispatchEvent( { type: 'sessionstart' } );
+
+			}
+
+		};
+
+		/**
+		 * Returns the environment blend mode from the current XR session.
+		 *
+		 * @return {'opaque'|'additive'|'alpha-blend'|undefined} The environment blend mode. Returns `undefined` when used outside of a XR session.
+		 */
+		this.getEnvironmentBlendMode = function () {
+
+			if ( session !== null ) {
+
+				return session.environmentBlendMode;
+
+			}
+
+		};
+
+		/**
+		 * Returns the current depth texture computed via depth sensing.
+		 *
+		 * See {@link WebXRDepthSensing#getDepthTexture}.
+		 *
+		 * @return {?Texture} The depth texture.
+		 */
+		this.getDepthTexture = function () {
+
+			return depthSensing.getDepthTexture();
+
+		};
+
+		function onInputSourcesChange( event ) {
+
+			// Notify disconnected
+
+			for ( let i = 0; i < event.removed.length; i ++ ) {
+
+				const inputSource = event.removed[ i ];
+				const index = controllerInputSources.indexOf( inputSource );
+
+				if ( index >= 0 ) {
+
+					controllerInputSources[ index ] = null;
+					controllers[ index ].disconnect( inputSource );
+
+				}
+
+			}
+
+			// Notify connected
+
+			for ( let i = 0; i < event.added.length; i ++ ) {
+
+				const inputSource = event.added[ i ];
+
+				let controllerIndex = controllerInputSources.indexOf( inputSource );
+
+				if ( controllerIndex === -1 ) {
+
+					// Assign input source a controller that currently has no input source
+
+					for ( let i = 0; i < controllers.length; i ++ ) {
+
+						if ( i >= controllerInputSources.length ) {
+
+							controllerInputSources.push( inputSource );
+							controllerIndex = i;
+							break;
+
+						} else if ( controllerInputSources[ i ] === null ) {
+
+							controllerInputSources[ i ] = inputSource;
+							controllerIndex = i;
+							break;
+
+						}
+
+					}
+
+					// If all controllers do currently receive input we ignore new ones
+
+					if ( controllerIndex === -1 ) break;
+
+				}
+
+				const controller = controllers[ controllerIndex ];
+
+				if ( controller ) {
+
+					controller.connect( inputSource );
+
+				}
+
+			}
+
+		}
+
+		//
+
+		const cameraLPos = new Vector3();
+		const cameraRPos = new Vector3();
+
+		/**
+		 * Assumes 2 cameras that are parallel and share an X-axis, and that
+		 * the cameras' projection and world matrices have already been set.
+		 * And that near and far planes are identical for both cameras.
+		 * Visualization of this technique: https://computergraphics.stackexchange.com/a/4765
+		 *
+		 * @param {ArrayCamera} camera - The camera to update.
+		 * @param {PerspectiveCamera} cameraL - The left camera.
+		 * @param {PerspectiveCamera} cameraR - The right camera.
+		 */
+		function setProjectionFromUnion( camera, cameraL, cameraR ) {
+
+			cameraLPos.setFromMatrixPosition( cameraL.matrixWorld );
+			cameraRPos.setFromMatrixPosition( cameraR.matrixWorld );
+
+			const ipd = cameraLPos.distanceTo( cameraRPos );
+
+			const projL = cameraL.projectionMatrix.elements;
+			const projR = cameraR.projectionMatrix.elements;
+
+			// VR systems will have identical far and near planes, and
+			// most likely identical top and bottom frustum extents.
+			// Use the left camera for these values.
+			const near = projL[ 14 ] / ( projL[ 10 ] - 1 );
+			const far = projL[ 14 ] / ( projL[ 10 ] + 1 );
+			const topFov = ( projL[ 9 ] + 1 ) / projL[ 5 ];
+			const bottomFov = ( projL[ 9 ] - 1 ) / projL[ 5 ];
+
+			const leftFov = ( projL[ 8 ] - 1 ) / projL[ 0 ];
+			const rightFov = ( projR[ 8 ] + 1 ) / projR[ 0 ];
+			const left = near * leftFov;
+			const right = near * rightFov;
+
+			// Calculate the new camera's position offset from the
+			// left camera. xOffset should be roughly half `ipd`.
+			const zOffset = ipd / ( - leftFov + rightFov );
+			const xOffset = zOffset * - leftFov;
+
+			// TODO: Better way to apply this offset?
+			cameraL.matrixWorld.decompose( camera.position, camera.quaternion, camera.scale );
+			camera.translateX( xOffset );
+			camera.translateZ( zOffset );
+			camera.matrixWorld.compose( camera.position, camera.quaternion, camera.scale );
+			camera.matrixWorldInverse.copy( camera.matrixWorld ).invert();
+
+			// Check if the projection uses an infinite far plane.
+			if ( projL[ 10 ] === -1 ) {
+
+				// Use the projection matrix from the left eye.
+				// The camera offset is sufficient to include the view volumes
+				// of both eyes (assuming symmetric projections).
+				camera.projectionMatrix.copy( cameraL.projectionMatrix );
+				camera.projectionMatrixInverse.copy( cameraL.projectionMatrixInverse );
+
+			} else {
+
+				// Find the union of the frustum values of the cameras and scale
+				// the values so that the near plane's position does not change in world space,
+				// although must now be relative to the new union camera.
+				const near2 = near + zOffset;
+				const far2 = far + zOffset;
+				const left2 = left - xOffset;
+				const right2 = right + ( ipd - xOffset );
+				const top2 = topFov * far / far2 * near2;
+				const bottom2 = bottomFov * far / far2 * near2;
+
+				camera.projectionMatrix.makePerspective( left2, right2, top2, bottom2, near2, far2 );
+				camera.projectionMatrixInverse.copy( camera.projectionMatrix ).invert();
+
+			}
+
+		}
+
+		function updateCamera( camera, parent ) {
+
+			if ( parent === null ) {
+
+				camera.matrixWorld.copy( camera.matrix );
+
+			} else {
+
+				camera.matrixWorld.multiplyMatrices( parent.matrixWorld, camera.matrix );
+
+			}
+
+			camera.matrixWorldInverse.copy( camera.matrixWorld ).invert();
+
+		}
+
+		/**
+		 * Updates the state of the XR camera. Use this method on app level if you
+		 * set `cameraAutoUpdate` to `false`. The method requires the non-XR
+		 * camera of the scene as a parameter. The passed in camera's transformation
+		 * is automatically adjusted to the position of the XR camera when calling
+		 * this method.
+		 *
+		 * @param {Camera} camera - The camera.
+		 */
+		this.updateCamera = function ( camera ) {
+
+			if ( session === null ) return;
+
+			let depthNear = camera.near;
+			let depthFar = camera.far;
+
+			if ( depthSensing.texture !== null ) {
+
+				if ( depthSensing.depthNear > 0 ) depthNear = depthSensing.depthNear;
+				if ( depthSensing.depthFar > 0 ) depthFar = depthSensing.depthFar;
+
+			}
+
+			cameraXR.near = cameraR.near = cameraL.near = depthNear;
+			cameraXR.far = cameraR.far = cameraL.far = depthFar;
+
+			if ( _currentDepthNear !== cameraXR.near || _currentDepthFar !== cameraXR.far ) {
+
+				// Note that the new renderState won't apply until the next frame. See #18320
+
+				session.updateRenderState( {
+					depthNear: cameraXR.near,
+					depthFar: cameraXR.far
+				} );
+
+				_currentDepthNear = cameraXR.near;
+				_currentDepthFar = cameraXR.far;
+
+			}
+
+			// inherit camera layers and enable eye layers (1 = left, 2 = right)
+			cameraXR.layers.mask = camera.layers.mask | 0b110;
+			cameraL.layers.mask = cameraXR.layers.mask & -5;
+			cameraR.layers.mask = cameraXR.layers.mask & -3;
+
+			const parent = camera.parent;
+			const cameras = cameraXR.cameras;
+
+			updateCamera( cameraXR, parent );
+
+			for ( let i = 0; i < cameras.length; i ++ ) {
+
+				updateCamera( cameras[ i ], parent );
+
+			}
+
+			// update projection matrix for proper view frustum culling
+
+			if ( cameras.length === 2 ) {
+
+				setProjectionFromUnion( cameraXR, cameraL, cameraR );
+
+			} else {
+
+				// assume single camera setup (AR)
+
+				cameraXR.projectionMatrix.copy( cameraL.projectionMatrix );
+
+			}
+
+			// update user camera and its children
+
+			if ( currentCameraSettings === null && camera.isPerspectiveCamera ) {
+
+				currentCameraSettings = { camera: camera, fov: camera.fov, zoom: camera.zoom };
+
+			}
+
+			updateUserCamera( camera, cameraXR, parent );
+
+		};
+
+		function updateUserCamera( camera, cameraXR, parent ) {
+
+			if ( parent === null ) {
+
+				camera.matrix.copy( cameraXR.matrixWorld );
+
+			} else {
+
+				camera.matrix.copy( parent.matrixWorld );
+				camera.matrix.invert();
+				camera.matrix.multiply( cameraXR.matrixWorld );
+
+			}
+
+			camera.matrix.decompose( camera.position, camera.quaternion, camera.scale );
+			camera.updateMatrixWorld( true );
+
+			camera.projectionMatrix.copy( cameraXR.projectionMatrix );
+			camera.projectionMatrixInverse.copy( cameraXR.projectionMatrixInverse );
+
+			if ( camera.isPerspectiveCamera ) {
+
+				camera.fov = RAD2DEG * 2 * Math.atan( 1 / camera.projectionMatrix.elements[ 5 ] );
+				camera.zoom = 1;
+
+			}
+
+		}
+
+		/**
+		 * Returns an instance of {@link ArrayCamera} which represents the XR camera
+		 * of the active XR session. For each view it holds a separate camera object.
+		 *
+		 * The camera's `fov` is currently not used and does not reflect the fov of
+		 * the XR camera. If you need the fov on app level, you have to compute in
+		 * manually from the XR camera's projection matrices.
+		 *
+		 * @return {ArrayCamera} The XR camera.
+		 */
+		this.getCamera = function () {
+
+			return cameraXR;
+
+		};
+
+		/**
+		 * Returns the amount of foveation used by the XR compositor for the projection layer.
+		 *
+		 * @return {number|undefined} The amount of foveation.
+		 */
+		this.getFoveation = function () {
+
+			if ( glProjLayer === null && glBaseLayer === null ) {
+
+				return undefined;
+
+			}
+
+			return foveation;
+
+		};
+
+		/**
+		 * Sets the foveation value.
+		 *
+		 * @param {number} value - A number in the range `[0,1]` where `0` means no foveation (full resolution)
+		 * and `1` means maximum foveation (the edges render at lower resolution).
+		 */
+		this.setFoveation = function ( value ) {
+
+			// 0 = no foveation = full resolution
+			// 1 = maximum foveation = the edges render at lower resolution
+
+			foveation = value;
+
+			if ( glProjLayer !== null ) {
+
+				glProjLayer.fixedFoveation = value;
+
+			}
+
+			if ( glBaseLayer !== null && glBaseLayer.fixedFoveation !== undefined ) {
+
+				glBaseLayer.fixedFoveation = value;
+
+			}
+
+		};
+
+		/**
+		 * Returns `true` if depth sensing is supported.
+		 *
+		 * @return {boolean} Whether depth sensing is supported or not.
+		 */
+		this.hasDepthSensing = function () {
+
+			return depthSensing.texture !== null;
+
+		};
+
+		/**
+		 * Returns the depth sensing mesh.
+		 *
+		 * See {@link WebXRDepthSensing#getMesh}.
+		 *
+		 * @return {Mesh} The depth sensing mesh.
+		 */
+		this.getDepthSensingMesh = function () {
+
+			return depthSensing.getMesh( cameraXR );
+
+		};
+
+		/**
+		 * Retrieves an opaque texture from the view-aligned {@link XRCamera}.
+		 * Only available during the current animation loop.
+		 *
+		 * @param {XRCamera} xrCamera - The camera to query.
+		 * @return {?Texture} An opaque texture representing the current raw camera frame.
+		 */
+		this.getCameraTexture = function ( xrCamera ) {
+
+			return cameraAccessTextures[ xrCamera ];
+
+		};
+
+		// Animation Loop
+
+		let onAnimationFrameCallback = null;
+
+		function onAnimationFrame( time, frame ) {
+
+			pose = frame.getViewerPose( customReferenceSpace || referenceSpace );
+			xrFrame = frame;
+
+			if ( pose !== null ) {
+
+				const views = pose.views;
+
+				if ( glBaseLayer !== null ) {
+
+					renderer.setRenderTargetFramebuffer( newRenderTarget, glBaseLayer.framebuffer );
+					renderer.setRenderTarget( newRenderTarget );
+
+				}
+
+				let cameraXRNeedsUpdate = false;
+
+				// check if it's necessary to rebuild cameraXR's camera list
+
+				if ( views.length !== cameraXR.cameras.length ) {
+
+					cameraXR.cameras.length = 0;
+					cameraXRNeedsUpdate = true;
+
+				}
+
+				for ( let i = 0; i < views.length; i ++ ) {
+
+					const view = views[ i ];
+
+					let viewport = null;
+
+					if ( glBaseLayer !== null ) {
+
+						viewport = glBaseLayer.getViewport( view );
+
+					} else {
+
+						const glSubImage = glBinding.getViewSubImage( glProjLayer, view );
+						viewport = glSubImage.viewport;
+
+						// For side-by-side projection, we only produce a single texture for both eyes.
+						if ( i === 0 ) {
+
+							renderer.setRenderTargetTextures(
+								newRenderTarget,
+								glSubImage.colorTexture,
+								glSubImage.depthStencilTexture );
+
+							renderer.setRenderTarget( newRenderTarget );
+
+						}
+
+					}
+
+					let camera = cameras[ i ];
+
+					if ( camera === undefined ) {
+
+						camera = new PerspectiveCamera();
+						camera.layers.enable( i );
+						camera.viewport = new Vector4();
+						cameras[ i ] = camera;
+
+					}
+
+					camera.matrix.fromArray( view.transform.matrix );
+					camera.matrix.decompose( camera.position, camera.quaternion, camera.scale );
+					camera.projectionMatrix.fromArray( view.projectionMatrix );
+					camera.projectionMatrixInverse.copy( camera.projectionMatrix ).invert();
+					camera.viewport.set( viewport.x, viewport.y, viewport.width, viewport.height );
+
+					if ( i === 0 ) {
+
+						cameraXR.matrix.copy( camera.matrix );
+						cameraXR.matrix.decompose( cameraXR.position, cameraXR.quaternion, cameraXR.scale );
+
+					}
+
+					if ( cameraXRNeedsUpdate === true ) {
+
+						cameraXR.cameras.push( camera );
+
+					}
+
+				}
+
+				//
+
+				const enabledFeatures = session.enabledFeatures;
+				const gpuDepthSensingEnabled = enabledFeatures &&
+					enabledFeatures.includes( 'depth-sensing' ) &&
+					session.depthUsage == 'gpu-optimized';
+
+				if ( gpuDepthSensingEnabled && supportsGlBinding ) {
+
+					glBinding = scope.getBinding();
+
+					const depthData = glBinding.getDepthInformation( views[ 0 ] );
+
+					if ( depthData && depthData.isValid && depthData.texture ) {
+
+						depthSensing.init( depthData, session.renderState );
+
+					}
+
+				}
+
+				const cameraAccessEnabled = enabledFeatures &&
+				    enabledFeatures.includes( 'camera-access' );
+
+				if ( cameraAccessEnabled && supportsGlBinding ) {
+
+					renderer.state.unbindTexture();
+
+					glBinding = scope.getBinding();
+
+					for ( let i = 0; i < views.length; i ++ ) {
+
+						const camera = views[ i ].camera;
+
+						if ( camera ) {
+
+							let cameraTex = cameraAccessTextures[ camera ];
+
+							if ( ! cameraTex ) {
+
+								cameraTex = new ExternalTexture();
+								cameraAccessTextures[ camera ] = cameraTex;
+
+							}
+
+							const glTexture = glBinding.getCameraImage( camera );
+							cameraTex.sourceTexture = glTexture;
+
+						}
+
+					}
+
+				}
+
+			}
+
+			//
+
+			for ( let i = 0; i < controllers.length; i ++ ) {
+
+				const inputSource = controllerInputSources[ i ];
+				const controller = controllers[ i ];
+
+				if ( inputSource !== null && controller !== undefined ) {
+
+					controller.update( inputSource, frame, customReferenceSpace || referenceSpace );
+
+				}
+
+			}
+
+			if ( onAnimationFrameCallback ) onAnimationFrameCallback( time, frame );
+
+			if ( frame.detectedPlanes ) {
+
+				scope.dispatchEvent( { type: 'planesdetected', data: frame } );
+
+			}
+
+			xrFrame = null;
+
+		}
+
+		const animation = new WebGLAnimation();
+
+		animation.setAnimationLoop( onAnimationFrame );
+
+		this.setAnimationLoop = function ( callback ) {
+
+			onAnimationFrameCallback = callback;
+
+		};
+
+		this.dispose = function () {};
+
+	}
+
+}
+
+const _m1 = /*@__PURE__*/ new Matrix4();
+const _m = /*@__PURE__*/ new Matrix3();
+
+_m.set( -1, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 1.0 );
+
+function WebGLMaterials( renderer, properties ) {
+
+	function refreshTransformUniform( map, uniform ) {
+
+		if ( map.matrixAutoUpdate === true ) {
+
+			map.updateMatrix();
+
+		}
+
+		uniform.value.copy( map.matrix );
+
+	}
+
+	function refreshFogUniforms( uniforms, fog ) {
+
+		fog.color.getRGB( uniforms.fogColor.value, getUnlitUniformColorSpace( renderer ) );
+
+		if ( fog.isFog ) {
+
+			uniforms.fogNear.value = fog.near;
+			uniforms.fogFar.value = fog.far;
+
+		} else if ( fog.isFogExp2 ) {
+
+			uniforms.fogDensity.value = fog.density;
+
+		}
+
+	}
+
+	function refreshMaterialUniforms( uniforms, material, pixelRatio, height, transmissionRenderTarget ) {
+
+		if ( material.isNodeMaterial ) {
+
+			material.uniformsNeedUpdate = false;
+
+		} else if ( material.isMeshBasicMaterial ) {
+
+			refreshUniformsCommon( uniforms, material );
+
+		} else if ( material.isMeshLambertMaterial ) {
+
+			refreshUniformsCommon( uniforms, material );
+
+			if ( material.envMap ) {
+
+				uniforms.envMapIntensity.value = material.envMapIntensity;
+
+			}
+
+		} else if ( material.isMeshToonMaterial ) {
+
+			refreshUniformsCommon( uniforms, material );
+			refreshUniformsToon( uniforms, material );
+
+		} else if ( material.isMeshPhongMaterial ) {
+
+			refreshUniformsCommon( uniforms, material );
+			refreshUniformsPhong( uniforms, material );
+
+			if ( material.envMap ) {
+
+				uniforms.envMapIntensity.value = material.envMapIntensity;
+
+			}
+
+		} else if ( material.isMeshStandardMaterial ) {
+
+			refreshUniformsCommon( uniforms, material );
+			refreshUniformsStandard( uniforms, material );
+
+			if ( material.isMeshPhysicalMaterial ) {
+
+				refreshUniformsPhysical( uniforms, material, transmissionRenderTarget );
+
+			}
+
+		} else if ( material.isMeshMatcapMaterial ) {
+
+			refreshUniformsCommon( uniforms, material );
+			refreshUniformsMatcap( uniforms, material );
+
+		} else if ( material.isMeshDepthMaterial ) {
+
+			refreshUniformsCommon( uniforms, material );
+
+		} else if ( material.isMeshDistanceMaterial ) {
+
+			refreshUniformsCommon( uniforms, material );
+			refreshUniformsDistance( uniforms, material );
+
+		} else if ( material.isMeshNormalMaterial ) {
+
+			refreshUniformsCommon( uniforms, material );
+
+		} else if ( material.isLineBasicMaterial ) {
+
+			refreshUniformsLine( uniforms, material );
+
+			if ( material.isLineDashedMaterial ) {
+
+				refreshUniformsDash( uniforms, material );
+
+			}
+
+		} else if ( material.isPointsMaterial ) {
+
+			refreshUniformsPoints( uniforms, material, pixelRatio, height );
+
+		} else if ( material.isSpriteMaterial ) {
+
+			refreshUniformsSprites( uniforms, material );
+
+		} else if ( material.isShadowMaterial ) {
+
+			uniforms.color.value.copy( material.color );
+			uniforms.opacity.value = material.opacity;
+
+		} else if ( material.isShaderMaterial ) {
+
+			material.uniformsNeedUpdate = false; // #15581
+
+		}
+
+	}
+
+	function refreshUniformsCommon( uniforms, material ) {
+
+		uniforms.opacity.value = material.opacity;
+
+		if ( material.color ) {
+
+			uniforms.diffuse.value.copy( material.color );
+
+		}
+
+		if ( material.emissive ) {
+
+			uniforms.emissive.value.copy( material.emissive ).multiplyScalar( material.emissiveIntensity );
+
+		}
+
+		if ( material.map ) {
+
+			uniforms.map.value = material.map;
+
+			refreshTransformUniform( material.map, uniforms.mapTransform );
+
+		}
+
+		if ( material.alphaMap ) {
+
+			uniforms.alphaMap.value = material.alphaMap;
+
+			refreshTransformUniform( material.alphaMap, uniforms.alphaMapTransform );
+
+		}
+
+		if ( material.bumpMap ) {
+
+			uniforms.bumpMap.value = material.bumpMap;
+
+			refreshTransformUniform( material.bumpMap, uniforms.bumpMapTransform );
+
+			uniforms.bumpScale.value = material.bumpScale;
+
+			if ( material.side === BackSide ) {
+
+				uniforms.bumpScale.value *= -1;
+
+			}
+
+		}
+
+		if ( material.normalMap ) {
+
+			uniforms.normalMap.value = material.normalMap;
+
+			refreshTransformUniform( material.normalMap, uniforms.normalMapTransform );
+
+			uniforms.normalScale.value.copy( material.normalScale );
+
+			if ( material.side === BackSide ) {
+
+				uniforms.normalScale.value.negate();
+
+			}
+
+		}
+
+		if ( material.displacementMap ) {
+
+			uniforms.displacementMap.value = material.displacementMap;
+
+			refreshTransformUniform( material.displacementMap, uniforms.displacementMapTransform );
+
+			uniforms.displacementScale.value = material.displacementScale;
+			uniforms.displacementBias.value = material.displacementBias;
+
+		}
+
+		if ( material.emissiveMap ) {
+
+			uniforms.emissiveMap.value = material.emissiveMap;
+
+			refreshTransformUniform( material.emissiveMap, uniforms.emissiveMapTransform );
+
+		}
+
+		if ( material.specularMap ) {
+
+			uniforms.specularMap.value = material.specularMap;
+
+			refreshTransformUniform( material.specularMap, uniforms.specularMapTransform );
+
+		}
+
+		if ( material.alphaTest > 0 ) {
+
+			uniforms.alphaTest.value = material.alphaTest;
+
+		}
+
+		const materialProperties = properties.get( material );
+
+		const envMap = materialProperties.envMap;
+		const envMapRotation = materialProperties.envMapRotation;
+
+		if ( envMap ) {
+
+			uniforms.envMap.value = envMap;
+
+			// note: since the matrix is orthonormal, we can use the more-efficient transpose() in lieu of invert()
+			uniforms.envMapRotation.value.setFromMatrix4( _m1.makeRotationFromEuler( envMapRotation ) ).transpose();
+
+
+			if ( envMap.isCubeTexture && envMap.isRenderTargetTexture === false ) {
+
+				uniforms.envMapRotation.value.premultiply( _m );
+
+			}
+
+			uniforms.reflectivity.value = material.reflectivity;
+			uniforms.ior.value = material.ior;
+			uniforms.refractionRatio.value = material.refractionRatio;
+
+		}
+
+		if ( material.lightMap ) {
+
+			uniforms.lightMap.value = material.lightMap;
+			uniforms.lightMapIntensity.value = material.lightMapIntensity;
+
+			refreshTransformUniform( material.lightMap, uniforms.lightMapTransform );
+
+		}
+
+		if ( material.aoMap ) {
+
+			uniforms.aoMap.value = material.aoMap;
+			uniforms.aoMapIntensity.value = material.aoMapIntensity;
+
+			refreshTransformUniform( material.aoMap, uniforms.aoMapTransform );
+
+		}
+
+	}
+
+	function refreshUniformsLine( uniforms, material ) {
+
+		uniforms.diffuse.value.copy( material.color );
+		uniforms.opacity.value = material.opacity;
+
+		if ( material.map ) {
+
+			uniforms.map.value = material.map;
+
+			refreshTransformUniform( material.map, uniforms.mapTransform );
+
+		}
+
+	}
+
+	function refreshUniformsDash( uniforms, material ) {
+
+		uniforms.dashSize.value = material.dashSize;
+		uniforms.totalSize.value = material.dashSize + material.gapSize;
+		uniforms.scale.value = material.scale;
+
+	}
+
+	function refreshUniformsPoints( uniforms, material, pixelRatio, height ) {
+
+		uniforms.diffuse.value.copy( material.color );
+		uniforms.opacity.value = material.opacity;
+		uniforms.size.value = material.size * pixelRatio;
+		uniforms.scale.value = height * 0.5;
+
+		if ( material.map ) {
+
+			uniforms.map.value = material.map;
+
+			refreshTransformUniform( material.map, uniforms.uvTransform );
+
+		}
+
+		if ( material.alphaMap ) {
+
+			uniforms.alphaMap.value = material.alphaMap;
+
+			refreshTransformUniform( material.alphaMap, uniforms.alphaMapTransform );
+
+		}
+
+		if ( material.alphaTest > 0 ) {
+
+			uniforms.alphaTest.value = material.alphaTest;
+
+		}
+
+	}
+
+	function refreshUniformsSprites( uniforms, material ) {
+
+		uniforms.diffuse.value.copy( material.color );
+		uniforms.opacity.value = material.opacity;
+		uniforms.rotation.value = material.rotation;
+
+		if ( material.map ) {
+
+			uniforms.map.value = material.map;
+
+			refreshTransformUniform( material.map, uniforms.mapTransform );
+
+		}
+
+		if ( material.alphaMap ) {
+
+			uniforms.alphaMap.value = material.alphaMap;
+
+			refreshTransformUniform( material.alphaMap, uniforms.alphaMapTransform );
+
+		}
+
+		if ( material.alphaTest > 0 ) {
+
+			uniforms.alphaTest.value = material.alphaTest;
+
+		}
+
+	}
+
+	function refreshUniformsPhong( uniforms, material ) {
+
+		uniforms.specular.value.copy( material.specular );
+		uniforms.shininess.value = Math.max( material.shininess, 1e-4 ); // to prevent pow( 0.0, 0.0 )
+
+	}
+
+	function refreshUniformsToon( uniforms, material ) {
+
+		if ( material.gradientMap ) {
+
+			uniforms.gradientMap.value = material.gradientMap;
+
+		}
+
+	}
+
+	function refreshUniformsStandard( uniforms, material ) {
+
+		uniforms.metalness.value = material.metalness;
+
+		if ( material.metalnessMap ) {
+
+			uniforms.metalnessMap.value = material.metalnessMap;
+
+			refreshTransformUniform( material.metalnessMap, uniforms.metalnessMapTransform );
+
+		}
+
+		uniforms.roughness.value = material.roughness;
+
+		if ( material.roughnessMap ) {
+
+			uniforms.roughnessMap.value = material.roughnessMap;
+
+			refreshTransformUniform( material.roughnessMap, uniforms.roughnessMapTransform );
+
+		}
+
+		if ( material.envMap ) {
+
+			//uniforms.envMap.value = material.envMap; // part of uniforms common
+
+			uniforms.envMapIntensity.value = material.envMapIntensity;
+
+		}
+
+	}
+
+	function refreshUniformsPhysical( uniforms, material, transmissionRenderTarget ) {
+
+		uniforms.ior.value = material.ior; // also part of uniforms common
+
+		if ( material.sheen > 0 ) {
+
+			uniforms.sheenColor.value.copy( material.sheenColor ).multiplyScalar( material.sheen );
+
+			uniforms.sheenRoughness.value = material.sheenRoughness;
+
+			if ( material.sheenColorMap ) {
+
+				uniforms.sheenColorMap.value = material.sheenColorMap;
+
+				refreshTransformUniform( material.sheenColorMap, uniforms.sheenColorMapTransform );
+
+			}
+
+			if ( material.sheenRoughnessMap ) {
+
+				uniforms.sheenRoughnessMap.value = material.sheenRoughnessMap;
+
+				refreshTransformUniform( material.sheenRoughnessMap, uniforms.sheenRoughnessMapTransform );
+
+			}
+
+		}
+
+		if ( material.clearcoat > 0 ) {
+
+			uniforms.clearcoat.value = material.clearcoat;
+			uniforms.clearcoatRoughness.value = material.clearcoatRoughness;
+
+			if ( material.clearcoatMap ) {
+
+				uniforms.clearcoatMap.value = material.clearcoatMap;
+
+				refreshTransformUniform( material.clearcoatMap, uniforms.clearcoatMapTransform );
+
+			}
+
+			if ( material.clearcoatRoughnessMap ) {
+
+				uniforms.clearcoatRoughnessMap.value = material.clearcoatRoughnessMap;
+
+				refreshTransformUniform( material.clearcoatRoughnessMap, uniforms.clearcoatRoughnessMapTransform );
+
+			}
+
+			if ( material.clearcoatNormalMap ) {
+
+				uniforms.clearcoatNormalMap.value = material.clearcoatNormalMap;
+
+				refreshTransformUniform( material.clearcoatNormalMap, uniforms.clearcoatNormalMapTransform );
+
+				uniforms.clearcoatNormalScale.value.copy( material.clearcoatNormalScale );
+
+				if ( material.side === BackSide ) {
+
+					uniforms.clearcoatNormalScale.value.negate();
+
+				}
+
+			}
+
+		}
+
+		if ( material.dispersion > 0 ) {
+
+			uniforms.dispersion.value = material.dispersion;
+
+		}
+
+		if ( material.retroreflectivity > 0 ) {
+
+			uniforms.retroreflectivity.value = material.retroreflectivity;
+
+		}
+
+		if ( material.iridescence > 0 ) {
+
+			uniforms.iridescence.value = material.iridescence;
+			uniforms.iridescenceIOR.value = material.iridescenceIOR;
+			uniforms.iridescenceThicknessMinimum.value = material.iridescenceThicknessRange[ 0 ];
+			uniforms.iridescenceThicknessMaximum.value = material.iridescenceThicknessRange[ 1 ];
+
+			if ( material.iridescenceMap ) {
+
+				uniforms.iridescenceMap.value = material.iridescenceMap;
+
+				refreshTransformUniform( material.iridescenceMap, uniforms.iridescenceMapTransform );
+
+			}
+
+			if ( material.iridescenceThicknessMap ) {
+
+				uniforms.iridescenceThicknessMap.value = material.iridescenceThicknessMap;
+
+				refreshTransformUniform( material.iridescenceThicknessMap, uniforms.iridescenceThicknessMapTransform );
+
+			}
+
+		}
+
+		if ( material.transmission > 0 ) {
+
+			uniforms.transmission.value = material.transmission;
+			uniforms.transmissionSamplerMap.value = transmissionRenderTarget.texture;
+			uniforms.transmissionSamplerSize.value.set( transmissionRenderTarget.width, transmissionRenderTarget.height );
+
+			if ( material.transmissionMap ) {
+
+				uniforms.transmissionMap.value = material.transmissionMap;
+
+				refreshTransformUniform( material.transmissionMap, uniforms.transmissionMapTransform );
+
+			}
+
+			uniforms.thickness.value = material.thickness;
+
+			if ( material.thicknessMap ) {
+
+				uniforms.thicknessMap.value = material.thicknessMap;
+
+				refreshTransformUniform( material.thicknessMap, uniforms.thicknessMapTransform );
+
+			}
+
+			uniforms.attenuationDistance.value = material.attenuationDistance;
+			uniforms.attenuationColor.value.copy( material.attenuationColor );
+
+		}
+
+		if ( material.anisotropy > 0 ) {
+
+			uniforms.anisotropyVector.value.set( material.anisotropy * Math.cos( material.anisotropyRotation ), material.anisotropy * Math.sin( material.anisotropyRotation ) );
+
+			if ( material.anisotropyMap ) {
+
+				uniforms.anisotropyMap.value = material.anisotropyMap;
+
+				refreshTransformUniform( material.anisotropyMap, uniforms.anisotropyMapTransform );
+
+			}
+
+		}
+
+		uniforms.specularIntensity.value = material.specularIntensity;
+		uniforms.specularColor.value.copy( material.specularColor );
+
+		if ( material.specularColorMap ) {
+
+			uniforms.specularColorMap.value = material.specularColorMap;
+
+			refreshTransformUniform( material.specularColorMap, uniforms.specularColorMapTransform );
+
+		}
+
+		if ( material.specularIntensityMap ) {
+
+			uniforms.specularIntensityMap.value = material.specularIntensityMap;
+
+			refreshTransformUniform( material.specularIntensityMap, uniforms.specularIntensityMapTransform );
+
+		}
+
+	}
+
+	function refreshUniformsMatcap( uniforms, material ) {
+
+		if ( material.matcap ) {
+
+			uniforms.matcap.value = material.matcap;
+
+		}
+
+	}
+
+	function refreshUniformsDistance( uniforms, material ) {
+
+		const light = properties.get( material ).light;
+
+		uniforms.referencePosition.value.setFromMatrixPosition( light.matrixWorld );
+		uniforms.nearDistance.value = light.shadow.camera.near;
+		uniforms.farDistance.value = light.shadow.camera.far;
+
+	}
+
+	return {
+		refreshFogUniforms: refreshFogUniforms,
+		refreshMaterialUniforms: refreshMaterialUniforms
+	};
+
+}
+
+function WebGLUniformsGroups( gl, info, capabilities, state ) {
+
+	let buffers = {};
+	let updateList = {};
+	let allocatedBindingPoints = [];
+
+	const maxBindingPoints = gl.getParameter( gl.MAX_UNIFORM_BUFFER_BINDINGS ); // binding points are global whereas block indices are per shader program
+
+	function bind( uniformsGroup, program ) {
+
+		const webglProgram = program.program;
+		state.uniformBlockBinding( uniformsGroup, webglProgram );
+
+	}
+
+	function update( uniformsGroup, program ) {
+
+		let buffer = buffers[ uniformsGroup.id ];
+
+		if ( buffer === undefined ) {
+
+			prepareUniformsGroup( uniformsGroup );
+
+			buffer = createBuffer( uniformsGroup );
+			buffers[ uniformsGroup.id ] = buffer;
+
+			uniformsGroup.addEventListener( 'dispose', onUniformsGroupsDispose );
+
+		}
+
+		// ensure to update the binding points/block indices mapping for this program
+
+		const webglProgram = program.program;
+		state.updateUBOMapping( uniformsGroup, webglProgram );
+
+		// update UBO once per frame
+
+		const frame = info.render.frame;
+
+		if ( updateList[ uniformsGroup.id ] !== frame ) {
+
+			updateBufferData( uniformsGroup );
+
+			updateList[ uniformsGroup.id ] = frame;
+
+		}
+
+	}
+
+	function createBuffer( uniformsGroup ) {
+
+		// the setup of an UBO is independent of a particular shader program but global
+
+		const bindingPointIndex = allocateBindingPointIndex();
+		uniformsGroup.__bindingPointIndex = bindingPointIndex;
+
+		const buffer = gl.createBuffer();
+		const size = uniformsGroup.__size;
+		const usage = uniformsGroup.usage;
+
+		gl.bindBuffer( gl.UNIFORM_BUFFER, buffer );
+		gl.bufferData( gl.UNIFORM_BUFFER, size, usage );
+		gl.bindBuffer( gl.UNIFORM_BUFFER, null );
+		gl.bindBufferBase( gl.UNIFORM_BUFFER, bindingPointIndex, buffer );
+
+		return buffer;
+
+	}
+
+	function allocateBindingPointIndex() {
+
+		for ( let i = 0; i < maxBindingPoints; i ++ ) {
+
+			if ( allocatedBindingPoints.indexOf( i ) === -1 ) {
+
+				allocatedBindingPoints.push( i );
+				return i;
+
+			}
+
+		}
+
+		error( 'WebGLRenderer: Maximum number of simultaneously usable uniforms groups reached.' );
+
+		return 0;
+
+	}
+
+	function updateBufferData( uniformsGroup ) {
+
+		const buffer = buffers[ uniformsGroup.id ];
+		const uniforms = uniformsGroup.uniforms;
+		const cache = uniformsGroup.__cache;
+
+		gl.bindBuffer( gl.UNIFORM_BUFFER, buffer );
+
+		for ( let i = 0, il = uniforms.length; i < il; i ++ ) {
+
+			const uniformItem = uniforms[ i ];
+
+			if ( Array.isArray( uniformItem ) ) {
+
+				for ( let j = 0, jl = uniformItem.length; j < jl; j ++ ) {
+
+					updateUniform( uniformItem[ j ], i, j, cache );
+
+				}
+
+			} else {
+
+				updateUniform( uniformItem, i, 0, cache );
+
+			}
+
+		}
+
+		gl.bindBuffer( gl.UNIFORM_BUFFER, null );
+
+	}
+
+	function updateUniform( uniform, index, indexArray, cache ) {
+
+		if ( hasUniformChanged( uniform, index, indexArray, cache ) === true ) {
+
+			const offset = uniform.__offset;
+			const value = uniform.value;
+
+			if ( Array.isArray( value ) ) {
+
+				let arrayOffset = 0;
+
+				for ( let k = 0; k < value.length; k ++ ) {
+
+					const val = value[ k ];
+					const info = getUniformSize( val );
+
+					writeUniformValue( val, uniform.__data, arrayOffset );
+
+					// only toArray() values advance arrayOffset
+					if ( typeof val !== 'number' && typeof val !== 'boolean' && ! val.isMatrix3 && ! ArrayBuffer.isView( val ) ) {
+
+						arrayOffset += info.storage / Float32Array.BYTES_PER_ELEMENT;
+
+					}
+
+				}
+
+			} else {
+
+				writeUniformValue( value, uniform.__data, 0 );
+
+			}
+
+			gl.bufferSubData( gl.UNIFORM_BUFFER, offset, uniform.__data );
+
+		}
+
+	}
+
+	function writeUniformValue( value, data, offset ) {
+
+		// TODO add integer and struct support
+		if ( typeof value === 'number' || typeof value === 'boolean' ) {
+
+			data[ 0 ] = value;
+
+		} else if ( value.isMatrix3 ) {
+
+			// manually converting 3x3 to 3x4
+
+			data[ 0 ] = value.elements[ 0 ];
+			data[ 1 ] = value.elements[ 1 ];
+			data[ 2 ] = value.elements[ 2 ];
+			data[ 3 ] = 0;
+			data[ 4 ] = value.elements[ 3 ];
+			data[ 5 ] = value.elements[ 4 ];
+			data[ 6 ] = value.elements[ 5 ];
+			data[ 7 ] = 0;
+			data[ 8 ] = value.elements[ 6 ];
+			data[ 9 ] = value.elements[ 7 ];
+			data[ 10 ] = value.elements[ 8 ];
+			data[ 11 ] = 0;
+
+		} else if ( ArrayBuffer.isView( value ) ) {
+
+			// copy the buffer data using "set"
+			data.set( new value.constructor( value.buffer, value.byteOffset, data.length ) );
+
+		} else {
+
+			value.toArray( data, offset );
+
+		}
+
+	}
+
+	function hasUniformChanged( uniform, index, indexArray, cache ) {
+
+		const value = uniform.value;
+		const indexString = index + '_' + indexArray;
+
+		if ( cache[ indexString ] === undefined ) {
+
+			// cache entry does not exist so far
+
+			if ( typeof value === 'number' || typeof value === 'boolean' ) {
+
+				cache[ indexString ] = value;
+
+			} else if ( ArrayBuffer.isView( value ) ) {
+
+				cache[ indexString ] = value.slice();
+
+			} else {
+
+				cache[ indexString ] = value.clone();
+
+			}
+
+			return true;
+
+		} else {
+
+			const cachedObject = cache[ indexString ];
+
+			// compare current value with cached entry
+
+			if ( typeof value === 'number' || typeof value === 'boolean' ) {
+
+				if ( cachedObject !== value ) {
+
+					cache[ indexString ] = value;
+					return true;
+
+				}
+
+			} else if ( ArrayBuffer.isView( value ) ) {
+
+				// always update the array buffers
+				return true;
+
+			} else {
+
+				if ( cachedObject.equals( value ) === false ) {
+
+					cachedObject.copy( value );
+					return true;
+
+				}
+
+			}
+
+		}
+
+		return false;
+
+	}
+
+	function prepareUniformsGroup( uniformsGroup ) {
+
+		// determine total buffer size according to the STD140 layout
+		// Hint: STD140 is the only supported layout in WebGL 2
+
+		const uniforms = uniformsGroup.uniforms;
+
+		let offset = 0; // global buffer offset in bytes
+		const chunkSize = 16; // size of a chunk in bytes
+
+		for ( let i = 0, l = uniforms.length; i < l; i ++ ) {
+
+			const uniformArray = Array.isArray( uniforms[ i ] ) ? uniforms[ i ] : [ uniforms[ i ] ];
+
+			for ( let j = 0, jl = uniformArray.length; j < jl; j ++ ) {
+
+				const uniform = uniformArray[ j ];
+
+				const values = Array.isArray( uniform.value ) ? uniform.value : [ uniform.value ];
+
+				for ( let k = 0, kl = values.length; k < kl; k ++ ) {
+
+					const value = values[ k ];
+
+					const info = getUniformSize( value );
+
+					const chunkOffset = offset % chunkSize; // offset in the current chunk
+					const chunkPadding = chunkOffset % info.boundary; // required padding to match boundary
+					const chunkStart = chunkOffset + chunkPadding; // the start position in the current chunk for the data
+
+					offset += chunkPadding;
+
+					// Check for chunk overflow
+					if ( chunkStart !== 0 && ( chunkSize - chunkStart ) < info.storage ) {
+
+						// Add padding and adjust offset
+						offset += ( chunkSize - chunkStart );
+
+					}
+
+					// the following two properties will be used for partial buffer updates
+					uniform.__data = new Float32Array( info.storage / Float32Array.BYTES_PER_ELEMENT );
+					uniform.__offset = offset;
+
+					// Update the global offset
+					offset += info.storage;
+
+				}
+
+			}
+
+		}
+
+		// ensure correct final padding
+
+		const chunkOffset = offset % chunkSize;
+
+		if ( chunkOffset > 0 ) offset += ( chunkSize - chunkOffset );
+
+		//
+
+		uniformsGroup.__size = offset;
+		uniformsGroup.__cache = {};
+
+		return this;
+
+	}
+
+	function getUniformSize( value ) {
+
+		const info = {
+			boundary: 0, // bytes
+			storage: 0 // bytes
+		};
+
+		// determine sizes according to STD140
+
+		if ( typeof value === 'number' || typeof value === 'boolean' ) {
+
+			// float/int/bool
+
+			info.boundary = 4;
+			info.storage = 4;
+
+		} else if ( value.isVector2 ) {
+
+			// vec2
+
+			info.boundary = 8;
+			info.storage = 8;
+
+		} else if ( value.isVector3 || value.isColor ) {
+
+			// vec3
+
+			info.boundary = 16;
+			info.storage = 12; // evil: vec3 must start on a 16-byte boundary but it only consumes 12 bytes
+
+		} else if ( value.isVector4 ) {
+
+			// vec4
+
+			info.boundary = 16;
+			info.storage = 16;
+
+		} else if ( value.isMatrix3 ) {
+
+			// mat3 (in STD140 a 3x3 matrix is represented as 3x4)
+
+			info.boundary = 48;
+			info.storage = 48;
+
+		} else if ( value.isMatrix4 ) {
+
+			// mat4
+
+			info.boundary = 64;
+			info.storage = 64;
+
+		} else if ( value.isTexture ) {
+
+			warn( 'WebGLRenderer: Texture samplers can not be part of an uniforms group.' );
+
+		} else if ( ArrayBuffer.isView( value ) ) {
+
+			info.boundary = 16;
+			info.storage = value.byteLength;
+
+		} else {
+
+			warn( 'WebGLRenderer: Unsupported uniform value type.', value );
+
+		}
+
+		return info;
+
+	}
+
+	function onUniformsGroupsDispose( event ) {
+
+		const uniformsGroup = event.target;
+
+		uniformsGroup.removeEventListener( 'dispose', onUniformsGroupsDispose );
+
+		const index = allocatedBindingPoints.indexOf( uniformsGroup.__bindingPointIndex );
+		allocatedBindingPoints.splice( index, 1 );
+
+		gl.deleteBuffer( buffers[ uniformsGroup.id ] );
+
+		delete buffers[ uniformsGroup.id ];
+		delete updateList[ uniformsGroup.id ];
+
+	}
+
+	function dispose() {
+
+		for ( const id in buffers ) {
+
+			gl.deleteBuffer( buffers[ id ] );
+
+		}
+
+		allocatedBindingPoints = [];
+		buffers = {};
+		updateList = {};
+
+	}
+
+	return {
+
+		bind: bind,
+		update: update,
+
+		dispose: dispose
+
+	};
+
+}
+
+/**
+ * Precomputed DFG LUT for physically based specular lighting, used by both
+ * image-based lighting and direct-light multi-scattering energy compensation
+ * Resolution: 16x16
+ * Samples: 4096 per texel
+ * Format: RG16F (2 half floats per texel: scale, bias)
+ */
+
+
+const DATA = new Uint16Array( [
+	0x30b5, 0x3ad1, 0x314c, 0x3a4d, 0x33d2, 0x391c, 0x35ef, 0x3828, 0x37f3, 0x36a6, 0x38d1, 0x3539, 0x3979, 0x3410, 0x39f8, 0x3252, 0x3a53, 0x30f0, 0x3a94, 0x2fc9, 0x3abf, 0x2e35, 0x3ada, 0x2d05, 0x3ae8, 0x2c1f, 0x3aed, 0x2ae0, 0x3aea, 0x29d1, 0x3ae1, 0x28ff,
+	0x3638, 0x38e4, 0x364a, 0x38ce, 0x3699, 0x385e, 0x374e, 0x372c, 0x3839, 0x35a4, 0x38dc, 0x3462, 0x396e, 0x32c4, 0x39de, 0x3134, 0x3a2b, 0x3003, 0x3a59, 0x2e3a, 0x3a6d, 0x2ce1, 0x3a6e, 0x2bba, 0x3a5f, 0x2a33, 0x3a49, 0x290a, 0x3a2d, 0x2826, 0x3a0a, 0x26e8,
+	0x3894, 0x36d7, 0x3897, 0x36c9, 0x38a3, 0x3675, 0x38bc, 0x35ac, 0x38ee, 0x349c, 0x393e, 0x3332, 0x3997, 0x3186, 0x39e2, 0x3038, 0x3a13, 0x2e75, 0x3a29, 0x2cf5, 0x3a2d, 0x2bac, 0x3a21, 0x29ff, 0x3a04, 0x28bc, 0x39dc, 0x2790, 0x39ad, 0x261a, 0x3978, 0x24fa,
+	0x39ac, 0x34a8, 0x39ac, 0x34a3, 0x39ae, 0x3480, 0x39ae, 0x3423, 0x39b1, 0x330e, 0x39c2, 0x31a9, 0x39e0, 0x3063, 0x39fc, 0x2eb5, 0x3a0c, 0x2d1d, 0x3a14, 0x2bcf, 0x3a07, 0x29ff, 0x39e9, 0x28a3, 0x39be, 0x273c, 0x3989, 0x25b3, 0x394a, 0x2488, 0x3907, 0x2345,
+	0x3a77, 0x3223, 0x3a76, 0x321f, 0x3a73, 0x3204, 0x3a6a, 0x31b3, 0x3a58, 0x3114, 0x3a45, 0x303b, 0x3a34, 0x2eb6, 0x3a26, 0x2d31, 0x3a1e, 0x2bef, 0x3a0b, 0x2a0d, 0x39ec, 0x28a1, 0x39c0, 0x271b, 0x3987, 0x2580, 0x3944, 0x2449, 0x38fa, 0x22bd, 0x38ac, 0x2155,
+	0x3b07, 0x2fca, 0x3b06, 0x2fca, 0x3b00, 0x2fb8, 0x3af4, 0x2f7c, 0x3adb, 0x2eea, 0x3ab4, 0x2e00, 0x3a85, 0x2cec, 0x3a5e, 0x2bc5, 0x3a36, 0x2a00, 0x3a0d, 0x2899, 0x39dc, 0x2707, 0x39a0, 0x2562, 0x395a, 0x2424, 0x390b, 0x2268, 0x38b7, 0x20fd, 0x385f, 0x1fd1,
+	0x3b69, 0x2cb9, 0x3b68, 0x2cbb, 0x3b62, 0x2cbb, 0x3b56, 0x2cae, 0x3b3b, 0x2c78, 0x3b0d, 0x2c0a, 0x3acf, 0x2ae3, 0x3a92, 0x2998, 0x3a54, 0x2867, 0x3a17, 0x26d0, 0x39d3, 0x253c, 0x3989, 0x2402, 0x3935, 0x2226, 0x38dc, 0x20bd, 0x387d, 0x1f54, 0x381d, 0x1db3,
+	0x3ba9, 0x296b, 0x3ba8, 0x296f, 0x3ba3, 0x297b, 0x3b98, 0x2987, 0x3b7f, 0x2976, 0x3b4e, 0x2927, 0x3b0e, 0x2895, 0x3ac2, 0x27b7, 0x3a73, 0x263b, 0x3a23, 0x24e7, 0x39d0, 0x239b, 0x3976, 0x21d9, 0x3917, 0x207e, 0x38b2, 0x1ee7, 0x384b, 0x1d53, 0x37c7, 0x1c1e,
+	0x3bd2, 0x25cb, 0x3bd1, 0x25d3, 0x3bcd, 0x25f0, 0x3bc2, 0x261f, 0x3bad, 0x2645, 0x3b7d, 0x262d, 0x3b3e, 0x25c4, 0x3aec, 0x250f, 0x3a93, 0x243a, 0x3a32, 0x22ce, 0x39d0, 0x215b, 0x3969, 0x202a, 0x38fe, 0x1e6e, 0x388f, 0x1cf1, 0x381f, 0x1b9b, 0x3762, 0x19dd,
+	0x3be9, 0x21ab, 0x3be9, 0x21b7, 0x3be5, 0x21e5, 0x3bdd, 0x2241, 0x3bc9, 0x22a7, 0x3ba0, 0x22ec, 0x3b62, 0x22cd, 0x3b0f, 0x2247, 0x3aae, 0x2175, 0x3a44, 0x2088, 0x39d4, 0x1f49, 0x3960, 0x1dbe, 0x38e9, 0x1c77, 0x3870, 0x1ae8, 0x37f1, 0x1953, 0x3708, 0x181b,
+	0x3bf6, 0x1cea, 0x3bf6, 0x1cfb, 0x3bf3, 0x1d38, 0x3bec, 0x1dbd, 0x3bda, 0x1e7c, 0x3bb7, 0x1f25, 0x3b7d, 0x1f79, 0x3b2c, 0x1f4c, 0x3ac6, 0x1ea6, 0x3a55, 0x1dbb, 0x39da, 0x1cbd, 0x395a, 0x1b9d, 0x38d8, 0x1a00, 0x3855, 0x18ac, 0x37ab, 0x173c, 0x36b7, 0x1598,
+	0x3bfc, 0x1736, 0x3bfc, 0x1759, 0x3bf9, 0x17e7, 0x3bf4, 0x1896, 0x3be4, 0x1997, 0x3bc6, 0x1aa8, 0x3b91, 0x1b84, 0x3b43, 0x1bd2, 0x3ade, 0x1b8a, 0x3a65, 0x1acd, 0x39e2, 0x19d3, 0x3957, 0x18cd, 0x38ca, 0x17b3, 0x383e, 0x1613, 0x376d, 0x14bf, 0x366f, 0x135e,
+	0x3bff, 0x101b, 0x3bff, 0x1039, 0x3bfc, 0x10c8, 0x3bf9, 0x1226, 0x3bea, 0x1428, 0x3bcf, 0x1584, 0x3b9f, 0x16c5, 0x3b54, 0x179a, 0x3af0, 0x17ce, 0x3a76, 0x1771, 0x39ea, 0x16a4, 0x3956, 0x15a7, 0x38bf, 0x14a7, 0x3829, 0x1379, 0x3735, 0x11ea, 0x362d, 0x10a1,
+	0x3c00, 0x061b, 0x3c00, 0x066a, 0x3bfe, 0x081c, 0x3bfa, 0x0a4c, 0x3bed, 0x0d16, 0x3bd5, 0x0fb3, 0x3ba9, 0x114d, 0x3b63, 0x127c, 0x3b01, 0x132f, 0x3a85, 0x1344, 0x39f4, 0x12d2, 0x3957, 0x120d, 0x38b5, 0x1122, 0x3817, 0x103c, 0x3703, 0x0ed3, 0x35f0, 0x0d6d,
+	0x3c00, 0x007a, 0x3c00, 0x0089, 0x3bfe, 0x011d, 0x3bfb, 0x027c, 0x3bf0, 0x04fa, 0x3bda, 0x0881, 0x3bb1, 0x0acd, 0x3b6f, 0x0c97, 0x3b10, 0x0d7b, 0x3a93, 0x0df1, 0x39fe, 0x0def, 0x3959, 0x0d8a, 0x38af, 0x0ce9, 0x3808, 0x0c31, 0x36d5, 0x0af0, 0x35b9, 0x09a3,
+	0x3c00, 0x0000, 0x3c00, 0x0001, 0x3bff, 0x0015, 0x3bfb, 0x0059, 0x3bf2, 0x00fd, 0x3bdd, 0x01df, 0x3bb7, 0x031c, 0x3b79, 0x047c, 0x3b1d, 0x05d4, 0x3aa0, 0x06d5, 0x3a08, 0x075a, 0x395d, 0x075e, 0x38aa, 0x06f7, 0x37f4, 0x0648, 0x36ac, 0x0576, 0x3586, 0x049f
+] );
+
+let lut = null;
+
+function getDFGLUT() {
+
+	if ( lut === null ) {
+
+		lut = new DataTexture( DATA, 16, 16, RGFormat, HalfFloatType );
+		lut.name = 'DFG_LUT';
+		lut.minFilter = LinearFilter;
+		lut.magFilter = LinearFilter;
+		lut.wrapS = ClampToEdgeWrapping;
+		lut.wrapT = ClampToEdgeWrapping;
+		lut.generateMipmaps = false;
+		lut.needsUpdate = true;
+
+	}
+
+	return lut;
+
+}
+
+/**
+ * This renderer uses WebGL 2 to display scenes.
+ *
+ * WebGL 1 is not supported since `r163`.
+ */
+class WebGLRenderer {
+
+	/**
+	 * Constructs a new WebGL renderer.
+	 *
+	 * @param {WebGLRenderer~Options} [parameters] - The configuration parameter.
+	 */
+	constructor( parameters = {} ) {
+
+		const {
+			canvas = createCanvasElement(),
+			context = null,
+			depth = true,
+			stencil = false,
+			alpha = false,
+			antialias = false,
+			premultipliedAlpha = true,
+			preserveDrawingBuffer = false,
+			powerPreference = 'default',
+			failIfMajorPerformanceCaveat = false,
+			reversedDepthBuffer = false,
+			outputBufferType = UnsignedByteType,
+		} = parameters;
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isWebGLRenderer = true;
+
+		let _alpha;
+
+		if ( context !== null ) {
+
+			if ( typeof WebGLRenderingContext !== 'undefined' && context instanceof WebGLRenderingContext ) {
+
+				throw new Error( 'THREE.WebGLRenderer: WebGL 1 is not supported since r163.' );
+
+			}
+
+			_alpha = context.getContextAttributes().alpha;
+
+		} else {
+
+			_alpha = alpha;
+
+		}
+
+		const _outputBufferType = outputBufferType;
+
+		const INTEGER_FORMATS = new Set( [
+			RGBAIntegerFormat,
+			RGIntegerFormat,
+			RedIntegerFormat
+		] );
+
+		const UNSIGNED_TYPES = new Set( [
+			UnsignedByteType,
+			UnsignedIntType,
+			UnsignedShortType,
+			UnsignedInt248Type,
+			UnsignedShort4444Type,
+			UnsignedShort5551Type
+		] );
+
+		const uintClearColor = new Uint32Array( 4 );
+		const intClearColor = new Int32Array( 4 );
+		const objectPosition = new Vector3();
+
+		let currentRenderList = null;
+		let currentRenderState = null;
+
+		// render() can be called from within a callback triggered by another render.
+		// We track this so that the nested render call gets its list and state isolated from the parent render call.
+
+		const renderListStack = [];
+		const renderStateStack = [];
+
+		// internal render target for non-UnsignedByteType color buffer
+
+		let output = null;
+
+		// public properties
+
+		/**
+		 * A canvas where the renderer draws its output. This is automatically created by the renderer
+		 * in the constructor (if not provided already); you just need to add it to your page like so:
+		 * ```js
+		 * document.body.appendChild( renderer.domElement );
+		 * ```
+		 *
+		 * @type {HTMLCanvasElement|OffscreenCanvas}
+		 */
+		this.domElement = canvas;
+
+		/**
+		 * A object with debug configuration settings.
+		 *
+		 * - `checkShaderErrors`: If it is `true`, defines whether material shader programs are
+		 * checked for errors during compilation and linkage process. It may be useful to disable
+		 * this check in production for performance gain. It is strongly recommended to keep these
+		 * checks enabled during development. If the shader does not compile and link, it will not
+		 * work and associated material will not render.
+		 * - `onShaderError(gl, program, glVertexShader,glFragmentShader)`: A callback function that
+		 * can be used for custom error reporting. The callback receives the WebGL context, an instance
+		 * of WebGLProgram as well two instances of WebGLShader representing the vertex and fragment shader.
+		 * Assigning a custom function disables the default error reporting.
+		 *
+		 * @type {Object}
+		 */
+		this.debug = {
+
+			/**
+			 * Enables error checking and reporting when shader programs are being compiled.
+			 * @type {boolean}
+			 */
+			checkShaderErrors: true,
+			/**
+			 * Diagnostics configuration for the shader generation. Only relevant for TSL.
+			 * @type {Object}
+			 * @property {boolean} keywords - Whether declaration names that collide with reserved keywords of the shading language should be renamed or not.
+			 */
+			diagnostics: {
+				keywords: false
+			},
+			/**
+			 * Callback for custom error reporting.
+			 * @type {?Function}
+			 */
+			onShaderError: null
+		};
+
+		// clearing
+
+		/**
+		 * Whether the renderer should automatically clear its output before rendering a frame or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.autoClear = true;
+
+		/**
+		 * If {@link WebGLRenderer#autoClear} set to `true`, whether the renderer should clear
+		 * the color buffer or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.autoClearColor = true;
+
+		/**
+		 * If {@link WebGLRenderer#autoClear} set to `true`, whether the renderer should clear
+		 * the depth buffer or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.autoClearDepth = true;
+
+		/**
+		 * If {@link WebGLRenderer#autoClear} set to `true`, whether the renderer should clear
+		 * the stencil buffer or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.autoClearStencil = true;
+
+		// scene graph
+
+		/**
+		 * Whether the renderer should sort objects or not.
+		 *
+		 * Note: Sorting is used to attempt to properly render objects that have some
+		 * degree of transparency. By definition, sorting objects may not work in all
+		 * cases. Depending on the needs of application, it may be necessary to turn
+		 * off sorting and use other methods to deal with transparency rendering e.g.
+		 * manually determining each object's rendering order.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.sortObjects = true;
+
+		// user-defined clipping
+
+		/**
+		 * User-defined clipping planes specified in world space. These planes apply globally.
+		 * Points in space whose dot product with the plane is negative are cut away.
+		 *
+		 * @type {Array<Plane>}
+		 */
+		this.clippingPlanes = [];
+
+		/**
+		 * Whether the renderer respects object-level clipping planes or not.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.localClippingEnabled = false;
+
+		// tone mapping
+
+		/**
+		 * The tone mapping technique of the renderer.
+		 *
+		 * @type {(NoToneMapping|LinearToneMapping|ReinhardToneMapping|CineonToneMapping|ACESFilmicToneMapping|CustomToneMapping|AgXToneMapping|NeutralToneMapping)}
+		 * @default NoToneMapping
+		 */
+		this.toneMapping = NoToneMapping;
+
+		/**
+		 * Exposure level of tone mapping.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.toneMappingExposure = 1.0;
+
+		// transmission
+
+		/**
+		 * The normalized resolution scale for the transmission render target, measured in percentage
+		 * of viewport dimensions. Lowering this value can result in significant performance improvements
+		 * when using {@link MeshPhysicalMaterial#transmission}.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.transmissionResolutionScale = 1.0;
+
+		// internal properties
+
+		const _this = this;
+
+		let _isContextLost = false;
+		let _nodesHandler = null;
+
+		let _scratchFramebuffer = null;
+		let _srcFramebuffer = null;
+		let _dstFramebuffer = null;
+
+		// internal state cache
+
+		this._outputColorSpace = SRGBColorSpace;
+
+		let _currentActiveCubeFace = 0;
+		let _currentActiveMipmapLevel = 0;
+		let _currentRenderTarget = null;
+		let _currentMaterialId = -1;
+
+		let _currentCamera = null;
+
+		const _currentViewport = new Vector4();
+		const _currentScissor = new Vector4();
+		let _currentScissorTest = null;
+
+		const _currentClearColor = new Color( 0x000000 );
+		let _currentClearAlpha = 0;
+
+		//
+
+		let _width = canvas.width;
+		let _height = canvas.height;
+
+		let _pixelRatio = 1;
+		let _opaqueSort = null;
+		let _transparentSort = null;
+
+		const _viewport = new Vector4( 0, 0, _width, _height );
+		const _scissor = new Vector4( 0, 0, _width, _height );
+		let _scissorTest = false;
+
+		// frustum
+
+		const _frustum = new Frustum();
+
+		// clipping
+
+		let _clippingEnabled = false;
+		let _localClippingEnabled = false;
+
+		// camera matrices cache
+
+		const _projScreenMatrix = new Matrix4();
+
+		const _vector3 = new Vector3();
+
+		const _vector4 = new Vector4();
+
+		const _emptyScene = { background: null, fog: null, environment: null, overrideMaterial: null, isScene: true };
+
+		let _renderBackground = false;
+
+		function getTargetPixelRatio() {
+
+			return _currentRenderTarget === null ? _pixelRatio : 1;
+
+		}
+
+		// initialize
+
+		let _gl = context;
+
+		function getContext( contextName, contextAttributes ) {
+
+			return canvas.getContext( contextName, contextAttributes );
+
+		}
+
+		let extensions, capabilities, state, info;
+		let properties, textures, environments, attributes, geometries, objects;
+		let programCache, materials, renderLists, renderStates, clipping, shadowMap;
+
+		let background, morphtargets, bufferRenderer, indexedBufferRenderer;
+
+		let utils, bindingStates, uniformsGroups;
+
+		try {
+
+			const contextAttributes = {
+				alpha: true,
+				depth,
+				stencil,
+				antialias,
+				premultipliedAlpha,
+				preserveDrawingBuffer,
+				powerPreference,
+				failIfMajorPerformanceCaveat,
+			};
+
+			// OffscreenCanvas does not have setAttribute, see #22811
+			if ( 'setAttribute' in canvas ) canvas.setAttribute( 'data-engine', `three.js r${REVISION}` );
+
+			// event listeners must be registered before WebGL context is created, see #12753
+			canvas.addEventListener( 'webglcontextlost', onContextLost, false );
+			canvas.addEventListener( 'webglcontextrestored', onContextRestore, false );
+			canvas.addEventListener( 'webglcontextcreationerror', onContextCreationError, false );
+
+			if ( _gl === null ) {
+
+				const contextName = 'webgl2';
+
+				_gl = getContext( contextName, contextAttributes );
+
+				if ( _gl === null ) {
+
+					if ( getContext( contextName ) ) {
+
+						throw new Error( 'THREE.WebGLRenderer: Error creating WebGL context with your selected attributes.' );
+
+					} else {
+
+						throw new Error( 'THREE.WebGLRenderer: Error creating WebGL context.' );
+
+					}
+
+				}
+
+			}
+
+			initGLContext();
+
+		} catch ( e ) {
+
+			canvas.removeEventListener( 'webglcontextlost', onContextLost, false );
+			canvas.removeEventListener( 'webglcontextrestored', onContextRestore, false );
+			canvas.removeEventListener( 'webglcontextcreationerror', onContextCreationError, false );
+
+			error( 'WebGLRenderer: ' + e.message );
+			throw e;
+
+		}
+
+		function initGLContext() {
+
+			extensions = new WebGLExtensions( _gl );
+			extensions.init();
+
+			utils = new WebGLUtils( _gl, extensions );
+
+			capabilities = new WebGLCapabilities( _gl, extensions, parameters, utils );
+
+			state = new WebGLState( _gl, extensions );
+
+			if ( capabilities.reversedDepthBuffer && reversedDepthBuffer ) {
+
+				state.buffers.depth.setReversed( true );
+
+			}
+
+			_scratchFramebuffer = _gl.createFramebuffer();
+			_srcFramebuffer = _gl.createFramebuffer();
+			_dstFramebuffer = _gl.createFramebuffer();
+
+			info = new WebGLInfo( _gl );
+			properties = new WebGLProperties();
+			textures = new WebGLTextures( _gl, extensions, state, properties, capabilities, utils, info );
+			environments = new WebGLEnvironments( _this );
+			attributes = new WebGLAttributes( _gl );
+			bindingStates = new WebGLBindingStates( _gl, attributes );
+			geometries = new WebGLGeometries( _gl, attributes, info, bindingStates );
+			objects = new WebGLObjects( _gl, geometries, attributes, bindingStates, info );
+			morphtargets = new WebGLMorphtargets( _gl, capabilities, textures );
+			clipping = new WebGLClipping( properties );
+			programCache = new WebGLPrograms( _this, environments, extensions, capabilities, bindingStates, clipping );
+			materials = new WebGLMaterials( _this, properties );
+			renderLists = new WebGLRenderLists();
+			renderStates = new WebGLRenderStates( extensions );
+			background = new WebGLBackground( _this, environments, state, objects, _alpha, premultipliedAlpha );
+			shadowMap = new WebGLShadowMap( _this, objects, capabilities );
+			uniformsGroups = new WebGLUniformsGroups( _gl, info, capabilities, state );
+
+			bufferRenderer = new WebGLBufferRenderer( _gl, extensions, info );
+			indexedBufferRenderer = new WebGLIndexedBufferRenderer( _gl, extensions, info );
+
+			info.programs = programCache.programs;
+
+			/**
+			 * Holds details about the capabilities of the current rendering context.
+			 *
+			 * @name WebGLRenderer#capabilities
+			 * @type {WebGLRenderer~Capabilities}
+			 */
+			_this.capabilities = capabilities;
+
+			/**
+			 * Provides methods for retrieving and testing WebGL extensions.
+			 *
+			 * - `get(extensionName:string)`: Used to check whether a WebGL extension is supported
+			 * and return the extension object if available.
+			 * - `has(extensionName:string)`: returns `true` if the extension is supported.
+			 *
+			 * @name WebGLRenderer#extensions
+			 * @type {Object}
+			 */
+			_this.extensions = extensions;
+
+			/**
+			 * Used to track properties of other objects like native WebGL objects.
+			 *
+			 * @name WebGLRenderer#properties
+			 * @type {Object}
+			 */
+			_this.properties = properties;
+
+			/**
+			 * Manages the render lists of the renderer.
+			 *
+			 * @name WebGLRenderer#renderLists
+			 * @type {Object}
+			 */
+			_this.renderLists = renderLists;
+
+
+
+			/**
+			 * Interface for managing shadows.
+			 *
+			 * @name WebGLRenderer#shadowMap
+			 * @type {WebGLRenderer~ShadowMap}
+			 */
+			_this.shadowMap = shadowMap;
+
+			/**
+			 * Interface for managing the WebGL state.
+			 *
+			 * @name WebGLRenderer#state
+			 * @type {Object}
+			 */
+			_this.state = state;
+
+			/**
+			 * Holds a series of statistical information about the GPU memory
+			 * and the rendering process. Useful for debugging and monitoring.
+			 *
+			 * By default these data are reset at each render call but when having
+			 * multiple render passes per frame (e.g. when using post processing) it can
+			 * be preferred to reset with a custom pattern. First, set `autoReset` to
+			 * `false`.
+			 * ```js
+			 * renderer.info.autoReset = false;
+			 * ```
+			 * Call `reset()` whenever you have finished to render a single frame.
+			 * ```js
+			 * renderer.info.reset();
+			 * ```
+			 *
+			 * @name WebGLRenderer#info
+			 * @type {WebGLRenderer~Info}
+			 */
+			_this.info = info;
+
+		}
+
+		// initialize internal render target for non-UnsignedByteType color buffer
+
+		if ( _outputBufferType !== UnsignedByteType ) {
+
+			output = new WebGLOutput( _outputBufferType, canvas.width, canvas.height, antialias, depth, stencil );
+
+		}
+
+		// xr
+
+		const xr = new WebXRManager( _this, _gl );
+
+		/**
+		 * A reference to the XR manager.
+		 *
+		 * @type {WebXRManager}
+		 */
+		this.xr = xr;
+
+		/**
+		 * Returns the rendering context.
+		 *
+		 * @return {WebGL2RenderingContext} The rendering context.
+		 */
+		this.getContext = function () {
+
+			return _gl;
+
+		};
+
+		/**
+		 * Returns the rendering context attributes.
+		 *
+		 * @return {WebGLContextAttributes} The rendering context attributes.
+		 */
+		this.getContextAttributes = function () {
+
+			return _gl.getContextAttributes();
+
+		};
+
+		/**
+		 * Simulates a loss of the WebGL context. This requires support for the `WEBGL_lose_context` extension.
+		 */
+		this.forceContextLoss = function () {
+
+			const extension = extensions.get( 'WEBGL_lose_context' );
+			if ( extension ) extension.loseContext();
+
+		};
+
+		/**
+		 * Simulates a restore of the WebGL context. This requires support for the `WEBGL_lose_context` extension.
+		 */
+		this.forceContextRestore = function () {
+
+			const extension = extensions.get( 'WEBGL_lose_context' );
+			if ( extension ) extension.restoreContext();
+
+		};
+
+		/**
+		 * Returns the pixel ratio.
+		 *
+		 * @return {number} The pixel ratio.
+		 */
+		this.getPixelRatio = function () {
+
+			return _pixelRatio;
+
+		};
+
+		/**
+		 * Sets the given pixel ratio and resizes the canvas if necessary.
+		 *
+		 * @param {number} value - The pixel ratio.
+		 */
+		this.setPixelRatio = function ( value ) {
+
+			if ( value === undefined ) return;
+
+			_pixelRatio = value;
+
+			this.setSize( _width, _height, false );
+
+		};
+
+		/**
+		 * Returns the renderer's size in logical pixels. This method does not honor the pixel ratio.
+		 *
+		 * @param {Vector2} target - The method writes the result in this target object.
+		 * @return {Vector2} The renderer's size in logical pixels.
+		 */
+		this.getSize = function ( target ) {
+
+			return target.set( _width, _height );
+
+		};
+
+		/**
+		 * Resizes the output canvas to (width, height) with device pixel ratio taken
+		 * into account, and also sets the viewport to fit that size, starting in (0,
+		 * 0). Setting `updateStyle` to false prevents any style changes to the output canvas.
+		 *
+		 * @param {number} width - The width in logical pixels.
+		 * @param {number} height - The height in logical pixels.
+		 * @param {boolean} [updateStyle=true] - Whether to update the `style` attribute of the canvas or not.
+		 */
+		this.setSize = function ( width, height, updateStyle = true ) {
+
+			if ( xr.isPresenting ) {
+
+				warn( 'WebGLRenderer: Can\'t change size while VR device is presenting.' );
+				return;
+
+			}
+
+			_width = width;
+			_height = height;
+
+			canvas.width = Math.floor( width * _pixelRatio );
+			canvas.height = Math.floor( height * _pixelRatio );
+
+			if ( updateStyle === true ) {
+
+				canvas.style.width = width + 'px';
+				canvas.style.height = height + 'px';
+
+			}
+
+			if ( output !== null ) {
+
+				output.setSize( canvas.width, canvas.height );
+
+			}
+
+			this.setViewport( 0, 0, width, height );
+
+		};
+
+		/**
+		 * Returns the drawing buffer size in physical pixels. This method honors the pixel ratio.
+		 *
+		 * @param {Vector2} target - The method writes the result in this target object.
+		 * @return {Vector2} The drawing buffer size.
+		 */
+		this.getDrawingBufferSize = function ( target ) {
+
+			return target.set( _width * _pixelRatio, _height * _pixelRatio ).floor();
+
+		};
+
+		/**
+		 * This method allows to define the drawing buffer size by specifying
+		 * width, height and pixel ratio all at once. The size of the drawing
+		 * buffer is computed with this formula:
+		 * ```js
+		 * size.x = width * pixelRatio;
+		 * size.y = height * pixelRatio;
+		 * ```
+		 *
+		 * @param {number} width - The width in logical pixels.
+		 * @param {number} height - The height in logical pixels.
+		 * @param {number} pixelRatio - The pixel ratio.
+		 */
+		this.setDrawingBufferSize = function ( width, height, pixelRatio ) {
+
+			_width = width;
+			_height = height;
+
+			_pixelRatio = pixelRatio;
+
+			canvas.width = Math.floor( width * pixelRatio );
+			canvas.height = Math.floor( height * pixelRatio );
+
+			this.setViewport( 0, 0, width, height );
+
+		};
+
+		/**
+		 * Sets the post-processing effects to be applied after rendering.
+		 *
+		 * @param {Array} effects - An array of post-processing effects.
+		 */
+		this.setEffects = function ( effects ) {
+
+			if ( _outputBufferType === UnsignedByteType ) {
+
+				error( 'WebGLRenderer: setEffects() requires outputBufferType set to HalfFloatType or FloatType.' );
+				return;
+
+			}
+
+			if ( effects ) {
+
+				for ( let i = 0; i < effects.length; i ++ ) {
+
+					if ( effects[ i ].isOutputPass === true ) {
+
+						warn( 'WebGLRenderer: OutputPass is not needed in setEffects(). Tone mapping and color space conversion are applied automatically.' );
+						break;
+
+					}
+
+				}
+
+			}
+
+			output.setEffects( effects || [] );
+
+		};
+
+		/**
+		 * Returns the current viewport definition.
+		 *
+		 * @param {Vector2} target - The method writes the result in this target object.
+		 * @return {Vector2} The current viewport definition.
+		 */
+		this.getCurrentViewport = function ( target ) {
+
+			return target.copy( _currentViewport );
+
+		};
+
+		/**
+		 * Returns the viewport definition.
+		 *
+		 * @param {Vector4} target - The method writes the result in this target object.
+		 * @return {Vector4} The viewport definition.
+		 */
+		this.getViewport = function ( target ) {
+
+			return target.copy( _viewport );
+
+		};
+
+		/**
+		 * Sets the viewport to render from `(x, y)` to `(x + width, y + height)`.
+		 *
+		 * @param {number | Vector4} x - The horizontal coordinate for the lower left corner of the viewport origin in logical pixel unit.
+		 * Or alternatively a four-component vector specifying all the parameters of the viewport.
+		 * @param {number} y - The vertical coordinate for the lower left corner of the viewport origin  in logical pixel unit.
+		 * @param {number} width - The width of the viewport in logical pixel unit.
+		 * @param {number} height - The height of the viewport in logical pixel unit.
+		 */
+		this.setViewport = function ( x, y, width, height ) {
+
+			if ( x.isVector4 ) {
+
+				_viewport.set( x.x, x.y, x.z, x.w );
+
+			} else {
+
+				_viewport.set( x, y, width, height );
+
+			}
+
+			state.viewport( _currentViewport.copy( _viewport ).multiplyScalar( _pixelRatio ).round() );
+
+		};
+
+		/**
+		 * Returns the scissor region.
+		 *
+		 * @param {Vector4} target - The method writes the result in this target object.
+		 * @return {Vector4} The scissor region.
+		 */
+		this.getScissor = function ( target ) {
+
+			return target.copy( _scissor );
+
+		};
+
+		/**
+		 * Sets the scissor region to render from `(x, y)` to `(x + width, y + height)`.
+		 *
+		 * @param {number | Vector4} x - The horizontal coordinate for the lower left corner of the scissor region origin in logical pixel unit.
+		 * Or alternatively a four-component vector specifying all the parameters of the scissor region.
+		 * @param {number} y - The vertical coordinate for the lower left corner of the scissor region origin  in logical pixel unit.
+		 * @param {number} width - The width of the scissor region in logical pixel unit.
+		 * @param {number} height - The height of the scissor region in logical pixel unit.
+		 */
+		this.setScissor = function ( x, y, width, height ) {
+
+			if ( x.isVector4 ) {
+
+				_scissor.set( x.x, x.y, x.z, x.w );
+
+			} else {
+
+				_scissor.set( x, y, width, height );
+
+			}
+
+			state.scissor( _currentScissor.copy( _scissor ).multiplyScalar( _pixelRatio ).round() );
+
+		};
+
+		/**
+		 * Returns `true` if the scissor test is enabled.
+		 *
+		 * @return {boolean} Whether the scissor test is enabled or not.
+		 */
+		this.getScissorTest = function () {
+
+			return _scissorTest;
+
+		};
+
+		/**
+		 * Enable or disable the scissor test. When this is enabled, only the pixels
+		 * within the defined scissor area will be affected by further renderer
+		 * actions.
+		 *
+		 * @param {boolean} boolean - Whether the scissor test is enabled or not.
+		 */
+		this.setScissorTest = function ( boolean ) {
+
+			state.setScissorTest( _scissorTest = boolean );
+
+		};
+
+		/**
+		 * Sets a custom opaque sort function for the render lists. Pass `null`
+		 * to use the default `painterSortStable` function.
+		 *
+		 * @param {?Function} method - The opaque sort function.
+		 */
+		this.setOpaqueSort = function ( method ) {
+
+			_opaqueSort = method;
+
+		};
+
+		/**
+		 * Sets a custom transparent sort function for the render lists. Pass `null`
+		 * to use the default `reversePainterSortStable` function.
+		 *
+		 * @param {?Function} method - The opaque sort function.
+		 */
+		this.setTransparentSort = function ( method ) {
+
+			_transparentSort = method;
+
+		};
+
+		// Clearing
+
+		/**
+		 * Returns the clear color.
+		 *
+		 * @param {Color} target - The method writes the result in this target object.
+		 * @return {Color} The clear color.
+		 */
+		this.getClearColor = function ( target ) {
+
+			return target.copy( background.getClearColor() );
+
+		};
+
+		/**
+		 * Sets the clear color and alpha.
+		 *
+		 * @param {Color} color - The clear color.
+		 * @param {number} [alpha=1] - The clear alpha.
+		 */
+		this.setClearColor = function () {
+
+			background.setClearColor( ...arguments );
+
+		};
+
+		/**
+		 * Returns the clear alpha. Ranges within `[0,1]`.
+		 *
+		 * @return {number} The clear alpha.
+		 */
+		this.getClearAlpha = function () {
+
+			return background.getClearAlpha();
+
+		};
+
+		/**
+		 * Sets the clear alpha.
+		 *
+		 * @param {number} alpha - The clear alpha.
+		 */
+		this.setClearAlpha = function () {
+
+			background.setClearAlpha( ...arguments );
+
+		};
+
+		/**
+		 * Tells the renderer to clear its color, depth or stencil drawing buffer(s).
+		 * This method initializes the buffers to the current clear color values.
+		 *
+		 * @param {boolean} [color=true] - Whether the color buffer should be cleared or not.
+		 * @param {boolean} [depth=true] - Whether the depth buffer should be cleared or not.
+		 * @param {boolean} [stencil=true] - Whether the stencil buffer should be cleared or not.
+		 */
+		this.clear = function ( color = true, depth = true, stencil = true ) {
+
+			let bits = 0;
+
+			if ( color ) {
+
+				// check if we're trying to clear an integer target
+				let isIntegerFormat = false;
+				if ( _currentRenderTarget !== null ) {
+
+					const targetFormat = _currentRenderTarget.texture.format;
+					isIntegerFormat = INTEGER_FORMATS.has( targetFormat );
+
+				}
+
+				// use the appropriate clear functions to clear the target if it's a signed
+				// or unsigned integer target
+				if ( isIntegerFormat ) {
+
+					const targetType = _currentRenderTarget.texture.type;
+					const isUnsignedType = UNSIGNED_TYPES.has( targetType );
+
+					const clearColor = background.getClearColor();
+					const a = background.getClearAlpha();
+					const r = clearColor.r;
+					const g = clearColor.g;
+					const b = clearColor.b;
+
+					if ( isUnsignedType ) {
+
+						uintClearColor[ 0 ] = r;
+						uintClearColor[ 1 ] = g;
+						uintClearColor[ 2 ] = b;
+						uintClearColor[ 3 ] = a;
+						_gl.clearBufferuiv( _gl.COLOR, 0, uintClearColor );
+
+					} else {
+
+						intClearColor[ 0 ] = r;
+						intClearColor[ 1 ] = g;
+						intClearColor[ 2 ] = b;
+						intClearColor[ 3 ] = a;
+						_gl.clearBufferiv( _gl.COLOR, 0, intClearColor );
+
+					}
+
+				} else {
+
+					bits |= _gl.COLOR_BUFFER_BIT;
+
+				}
+
+			}
+
+			if ( depth ) {
+
+				bits |= _gl.DEPTH_BUFFER_BIT;
+				this.state.buffers.depth.setMask( true );
+
+			}
+
+			if ( stencil ) {
+
+				bits |= _gl.STENCIL_BUFFER_BIT;
+				this.state.buffers.stencil.setMask( 0xffffffff );
+
+			}
+
+			if ( bits !== 0 ) {
+
+				_gl.clear( bits );
+
+			}
+
+		};
+
+		/**
+		 * Clears the color buffer. Equivalent to calling `renderer.clear( true, false, false )`.
+		 */
+		this.clearColor = function () {
+
+			this.clear( true, false, false );
+
+		};
+
+		/**
+		 * Clears the depth buffer. Equivalent to calling `renderer.clear( false, true, false )`.
+		 */
+		this.clearDepth = function () {
+
+			this.clear( false, true, false );
+
+		};
+
+		/**
+		 * Clears the stencil buffer. Equivalent to calling `renderer.clear( false, false, true )`.
+		 */
+		this.clearStencil = function () {
+
+			this.clear( false, false, true );
+
+		};
+
+		/**
+		 * Sets a compatibility node builder for rendering node materials with WebGLRenderer.
+		 * This enables using TSL (Three.js Shading Language) node materials to prepare
+		 * for migration to WebGPURenderer.
+		 *
+		 * @param {WebGLNodesHandler} nodesHandler - The node builder instance.
+		 */
+		this.setNodesHandler = function ( nodesHandler ) {
+
+			nodesHandler.setRenderer( this );
+			_nodesHandler = nodesHandler;
+
+		};
+
+		/**
+		 * Frees the GPU-related resources allocated by this instance. Call this
+		 * method whenever this instance is no longer used in your app.
+		 */
+		this.dispose = function () {
+
+			canvas.removeEventListener( 'webglcontextlost', onContextLost, false );
+			canvas.removeEventListener( 'webglcontextrestored', onContextRestore, false );
+			canvas.removeEventListener( 'webglcontextcreationerror', onContextCreationError, false );
+
+			background.dispose();
+			renderLists.dispose();
+			renderStates.dispose();
+			properties.dispose();
+			environments.dispose();
+			objects.dispose();
+			bindingStates.dispose();
+			uniformsGroups.dispose();
+			programCache.dispose();
+
+			xr.dispose();
+
+			xr.removeEventListener( 'sessionstart', onXRSessionStart );
+			xr.removeEventListener( 'sessionend', onXRSessionEnd );
+
+			animation.stop();
+
+		};
+
+		// Events
+
+		function onContextLost( event ) {
+
+			event.preventDefault();
+
+			log( 'WebGLRenderer: Context Lost.' );
+
+			_isContextLost = true;
+
+		}
+
+		function onContextRestore( /* event */ ) {
+
+			log( 'WebGLRenderer: Context Restored.' );
+
+			_isContextLost = false;
+
+			const infoAutoReset = info.autoReset;
+			const shadowMapEnabled = shadowMap.enabled;
+			const shadowMapAutoUpdate = shadowMap.autoUpdate;
+			const shadowMapNeedsUpdate = shadowMap.needsUpdate;
+			const shadowMapType = shadowMap.type;
+
+			initGLContext();
+
+			info.autoReset = infoAutoReset;
+			shadowMap.enabled = shadowMapEnabled;
+			shadowMap.autoUpdate = shadowMapAutoUpdate;
+			shadowMap.needsUpdate = shadowMapNeedsUpdate;
+			shadowMap.type = shadowMapType;
+
+		}
+
+		function onContextCreationError( event ) {
+
+			error( 'WebGLRenderer: A WebGL context could not be created. Reason: ', event.statusMessage );
+
+		}
+
+		function onMaterialDispose( event ) {
+
+			const material = event.target;
+
+			material.removeEventListener( 'dispose', onMaterialDispose );
+
+			deallocateMaterial( material );
+
+		}
+
+		// Buffer deallocation
+
+		function deallocateMaterial( material ) {
+
+			releaseMaterialProgramReferences( material );
+
+			properties.remove( material );
+
+		}
+
+
+		function releaseMaterialProgramReferences( material ) {
+
+			const programs = properties.get( material ).programs;
+
+			if ( programs !== undefined ) {
+
+				programs.forEach( function ( program ) {
+
+					programCache.releaseProgram( program );
+
+				} );
+
+				if ( material.isShaderMaterial ) {
+
+					programCache.releaseShaderCache( material );
+
+				}
+
+			}
+
+		}
+
+		// Buffer rendering
+
+		this.renderBufferDirect = function ( camera, scene, geometry, material, object, group ) {
+
+			if ( scene === null ) scene = _emptyScene; // renderBufferDirect second parameter used to be fog (could be null)
+
+			const frontFaceCW = ( object.isMesh && object.matrixWorld.determinantAffine() < 0 );
+
+			const program = setProgram( camera, scene, geometry, material, object );
+
+			state.setMaterial( material, frontFaceCW );
+
+			//
+
+			let index = geometry.index;
+			let rangeFactor = 1;
+
+			if ( material.wireframe === true ) {
+
+				index = geometries.getWireframeAttribute( geometry );
+
+				if ( index === undefined ) return;
+
+				rangeFactor = 2;
+
+			}
+
+			//
+
+			const drawRange = geometry.drawRange;
+			const position = geometry.attributes.position;
+
+			let drawStart = drawRange.start * rangeFactor;
+			let drawEnd = ( drawRange.start + drawRange.count ) * rangeFactor;
+
+			if ( group !== null ) {
+
+				drawStart = Math.max( drawStart, group.start * rangeFactor );
+				drawEnd = Math.min( drawEnd, ( group.start + group.count ) * rangeFactor );
+
+			}
+
+			if ( index !== null ) {
+
+				drawStart = Math.max( drawStart, 0 );
+				drawEnd = Math.min( drawEnd, index.count );
+
+			} else if ( position !== undefined && position !== null ) {
+
+				drawStart = Math.max( drawStart, 0 );
+				drawEnd = Math.min( drawEnd, position.count );
+
+			}
+
+			const drawCount = drawEnd - drawStart;
+
+			if ( drawCount < 0 || drawCount === Infinity ) return;
+
+			//
+
+			bindingStates.setup( object, material, program, geometry, index );
+
+			let attribute;
+			let renderer = bufferRenderer;
+
+			if ( index !== null ) {
+
+				attribute = attributes.get( index );
+
+				renderer = indexedBufferRenderer;
+				renderer.setIndex( attribute );
+
+			}
+
+			//
+
+			if ( object.isMesh ) {
+
+				if ( material.wireframe === true ) {
+
+					state.setLineWidth( material.wireframeLinewidth * getTargetPixelRatio() );
+					renderer.setMode( _gl.LINES );
+
+				} else {
+
+					renderer.setMode( _gl.TRIANGLES );
+
+				}
+
+			} else if ( object.isLine ) {
+
+				let lineWidth = material.linewidth;
+
+				if ( lineWidth === undefined ) lineWidth = 1; // Not using Line*Material
+
+				state.setLineWidth( lineWidth * getTargetPixelRatio() );
+
+				if ( object.isLineSegments ) {
+
+					renderer.setMode( _gl.LINES );
+
+				} else if ( object.isLineLoop ) {
+
+					renderer.setMode( _gl.LINE_LOOP );
+
+				} else {
+
+					renderer.setMode( _gl.LINE_STRIP );
+
+				}
+
+			} else if ( object.isPoints ) {
+
+				renderer.setMode( _gl.POINTS );
+
+			} else if ( object.isSprite ) {
+
+				renderer.setMode( _gl.TRIANGLES );
+
+			}
+
+			if ( object.isBatchedMesh ) {
+
+				if ( ! extensions.get( 'WEBGL_multi_draw' ) ) {
+
+					const starts = object._multiDrawStarts;
+					const counts = object._multiDrawCounts;
+					const drawCount = object._multiDrawCount;
+					const bytesPerElement = index ? attributes.get( index ).bytesPerElement : 1;
+					const uniforms = properties.get( material ).currentProgram.getUniforms();
+					for ( let i = 0; i < drawCount; i ++ ) {
+
+						uniforms.setValue( _gl, '_gl_DrawID', i );
+						renderer.render( starts[ i ] / bytesPerElement, counts[ i ] );
+
+					}
+
+				} else {
+
+					renderer.renderMultiDraw( object._multiDrawStarts, object._multiDrawCounts, object._multiDrawCount );
+
+				}
+
+			} else if ( object.isInstancedMesh ) {
+
+				renderer.renderInstances( drawStart, drawCount, object.count );
+
+			} else if ( geometry.isInstancedBufferGeometry ) {
+
+				const maxInstanceCount = geometry._maxInstanceCount !== undefined ? geometry._maxInstanceCount : Infinity;
+				const instanceCount = Math.min( geometry.instanceCount, maxInstanceCount );
+
+				renderer.renderInstances( drawStart, drawCount, instanceCount );
+
+			} else {
+
+				renderer.render( drawStart, drawCount );
+
+			}
+
+		};
+
+		// Compile
+
+		function prepareMaterial( material, scene, camera, object ) {
+
+			if ( _nodesHandler !== null && material.isNodeMaterial ) _nodesHandler.setObject( object, material );
+
+			if ( _clippingEnabled === true ) clipping.setState( material, camera, false );
+
+			if ( material.transparent === true && material.side === DoubleSide && material.forceSinglePass === false ) {
+
+				material.side = BackSide;
+				material.needsUpdate = true;
+				getProgram( material, scene, object );
+
+				material.side = FrontSide;
+				material.needsUpdate = true;
+				getProgram( material, scene, object );
+
+				material.side = DoubleSide;
+
+			} else {
+
+				getProgram( material, scene, object );
+
+			}
+
+		}
+
+		/**
+		 * Compiles all materials in the scene with the camera. This is useful to precompile shaders
+		 * before the first rendering. If you want to add a 3D object to an existing scene, use the third
+		 * optional parameter for applying the target scene.
+		 *
+		 * Note that the (target) scene's lighting and environment must be configured before calling this method.
+		 *
+		 * @param {Object3D} scene - The scene or another type of 3D object to precompile.
+		 * @param {Camera} camera - The camera.
+		 * @param {?Scene} [targetScene=null] - The target scene.
+		 * @return {Set<Material>} The precompiled materials.
+		 */
+		this.compile = function ( scene, camera, targetScene = null ) {
+
+			if ( targetScene === null ) targetScene = scene;
+			if ( _nodesHandler !== null ) _nodesHandler.renderStart( scene, camera, targetScene );
+
+			currentRenderState = renderStates.get( targetScene );
+			currentRenderState.init( camera );
+
+			renderStateStack.push( currentRenderState );
+
+			// gather lights from both the target scene and the new object that will be added to the scene.
+
+			targetScene.traverseVisible( function ( object ) {
+
+				if ( object.isLight && object.layers.test( camera.layers ) ) {
+
+					currentRenderState.pushLight( object );
+
+					if ( object.castShadow ) {
+
+						currentRenderState.pushShadow( object );
+
+					}
+
+				}
+
+			} );
+
+			if ( scene !== targetScene ) {
+
+				scene.traverseVisible( function ( object ) {
+
+					if ( object.isLight && object.layers.test( camera.layers ) ) {
+
+						currentRenderState.pushLight( object );
+
+						if ( object.castShadow ) {
+
+							currentRenderState.pushShadow( object );
+
+						}
+
+					}
+
+				} );
+
+			}
+
+			currentRenderState.setupLights();
+			if ( _nodesHandler !== null ) _nodesHandler.updateLights( currentRenderState.state.lightsArray );
+
+			_localClippingEnabled = this.localClippingEnabled;
+			_clippingEnabled = clipping.init( this.clippingPlanes, _localClippingEnabled );
+
+			if ( _clippingEnabled === true ) clipping.setGlobalState( this.clippingPlanes, camera );
+
+			// node materials reference the shadow map when they are built, so it must exist by now
+
+			if ( _nodesHandler !== null ) shadowMap.render( currentRenderState.state.shadowsArray, targetScene, camera );
+
+			// Only initialize materials in the new scene, not the targetScene.
+
+			const materials = new Set();
+
+			scene.traverse( function ( object ) {
+
+				if ( ! ( object.isMesh || object.isPoints || object.isLine || object.isSprite ) ) {
+
+					return;
+
+				}
+
+				const material = object.material;
+
+				if ( material ) {
+
+					if ( Array.isArray( material ) ) {
+
+						for ( let i = 0; i < material.length; i ++ ) {
+
+							const material2 = material[ i ];
+
+							prepareMaterial( material2, targetScene, camera, object );
+							materials.add( material2 );
+
+						}
+
+					} else {
+
+						prepareMaterial( material, targetScene, camera, object );
+						materials.add( material );
+
+					}
+
+				}
+
+			} );
+
+			currentRenderState = renderStateStack.pop();
+			if ( _nodesHandler !== null ) _nodesHandler.renderEnd();
+
+			return materials;
+
+		};
+
+		// compileAsync
+
+		/**
+		 * Asynchronous version of {@link WebGLRenderer#compile}.
+		 *
+		 * This method makes use of the `KHR_parallel_shader_compile` WebGL extension. Hence,
+		 * it is recommended to use this version of `compile()` whenever possible.
+		 *
+		 * @async
+		 * @param {Object3D} scene - The scene or another type of 3D object to precompile.
+		 * @param {Camera} camera - The camera.
+		 * @param {?Scene} [targetScene=null] - The target scene.
+		 * @return {Promise} A Promise that resolves when the given scene can be rendered without unnecessary stalling due to shader compilation.
+		 */
+		this.compileAsync = function ( scene, camera, targetScene = null ) {
+
+			const materials = this.compile( scene, camera, targetScene );
+
+			// Wait for all the materials in the new object to indicate that they're
+			// ready to be used before resolving the promise.
+
+			return new Promise( ( resolve ) => {
+
+				function checkMaterialsReady() {
+
+					materials.forEach( function ( material ) {
+
+						const materialProperties = properties.get( material );
+						const program = materialProperties.currentProgram;
+
+						if ( program === undefined || program.isReady() ) {
+
+							// stop waiting for materials that are ready to use or have been disposed
+							materials.delete( material );
+
+						}
+
+					} );
+
+					// once the list of compiling materials is empty, call the callback
+
+					if ( materials.size === 0 ) {
+
+						resolve( scene );
+						return;
+
+					}
+
+					// if some materials are still not ready, wait a bit and check again
+
+					setTimeout( checkMaterialsReady, 10 );
+
+				}
+
+				if ( extensions.get( 'KHR_parallel_shader_compile' ) !== null ) {
+
+					// If we can check the compilation status of the materials without
+					// blocking then do so right away.
+
+					checkMaterialsReady();
+
+				} else {
+
+					// Otherwise start by waiting a bit to give the materials we just
+					// initialized a chance to finish.
+
+					setTimeout( checkMaterialsReady, 10 );
+
+				}
+
+			} );
+
+		};
+
+		// Animation Loop
+
+		let onAnimationFrameCallback = null;
+
+		function onAnimationFrame( time ) {
+
+			if ( onAnimationFrameCallback ) onAnimationFrameCallback( time );
+
+		}
+
+		function onXRSessionStart() {
+
+			animation.stop();
+
+		}
+
+		function onXRSessionEnd() {
+
+			animation.start();
+
+		}
+
+		const animation = new WebGLAnimation();
+		animation.setAnimationLoop( onAnimationFrame );
+
+		if ( typeof self !== 'undefined' ) animation.setContext( self );
+
+		/**
+		 * Applications are advised to always define the animation loop
+		 * with this method and not manually with `requestAnimationFrame()`
+		 * for best compatibility.
+		 *
+		 * @param {?onAnimationCallback} callback - The application's animation loop.
+		 */
+		this.setAnimationLoop = function ( callback ) {
+
+			onAnimationFrameCallback = callback;
+			xr.setAnimationLoop( callback );
+
+			( callback === null ) ? animation.stop() : animation.start();
+
+		};
+
+		xr.addEventListener( 'sessionstart', onXRSessionStart );
+		xr.addEventListener( 'sessionend', onXRSessionEnd );
+
+		// Rendering
+
+		/**
+		 * Renders the given scene (or other type of 3D object) using the given camera.
+		 *
+		 * The render is done to a previously specified render target set by calling {@link WebGLRenderer#setRenderTarget}
+		 * or to the canvas as usual.
+		 *
+		 * By default render buffers are cleared before rendering but you can prevent
+		 * this by setting the property `autoClear` to `false`. If you want to prevent
+		 * only certain buffers being cleared you can `autoClearColor`, `autoClearDepth`
+		 * or `autoClearStencil` to `false`. To force a clear, use {@link WebGLRenderer#clear}.
+		 *
+		 * @param {Object3D} scene - The scene to render.
+		 * @param {Camera} camera - The camera.
+		 */
+		this.render = function ( scene, camera ) {
+
+			if ( camera !== undefined && camera.isCamera !== true ) {
+
+				error( 'WebGLRenderer.render: camera is not an instance of THREE.Camera.' );
+				return;
+
+			}
+
+			if ( _isContextLost === true ) return;
+
+			// update node builder if available
+			if ( _nodesHandler !== null ) {
+
+				_nodesHandler.renderStart( scene, camera );
+
+			}
+
+			// use internal render target for HalfFloatType color buffer (only when tone mapping is enabled)
+
+			const isXRPresenting = xr.enabled === true && xr.isPresenting === true;
+
+			const useOutput = output !== null && ( _currentRenderTarget === null || isXRPresenting ) && output.begin( _this, _currentRenderTarget );
+
+			// update scene graph
+
+			if ( scene.matrixWorldAutoUpdate === true ) scene.updateMatrixWorld();
+
+			// update camera matrices and frustum
+
+			if ( camera.parent === null && camera.matrixWorldAutoUpdate === true ) camera.updateMatrixWorld();
+
+			if ( xr.enabled === true && xr.isPresenting === true && ( output === null || output.isCompositing() === false ) ) {
+
+				if ( xr.cameraAutoUpdate === true ) xr.updateCamera( camera );
+
+				camera = xr.getCamera(); // use XR camera for rendering
+
+			}
+
+			//
+			if ( scene.isScene === true ) scene.onBeforeRender( _this, scene, camera, _currentRenderTarget );
+
+			currentRenderState = renderStates.get( scene, renderStateStack.length );
+			currentRenderState.init( camera );
+
+			currentRenderState.state.textureUnits = textures.getTextureUnits();
+			renderStateStack.push( currentRenderState );
+
+			_projScreenMatrix.multiplyMatrices( camera.projectionMatrix, camera.matrixWorldInverse );
+			_frustum.setFromProjectionMatrix( _projScreenMatrix, WebGLCoordinateSystem, camera.reversedDepth );
+
+			_localClippingEnabled = this.localClippingEnabled;
+			_clippingEnabled = clipping.init( this.clippingPlanes, _localClippingEnabled );
+
+			currentRenderList = renderLists.get( scene, renderListStack.length );
+			currentRenderList.init();
+
+			renderListStack.push( currentRenderList );
+
+			if ( xr.enabled === true && xr.isPresenting === true ) {
+
+				const depthSensingMesh = _this.xr.getDepthSensingMesh();
+
+				if ( depthSensingMesh !== null ) {
+
+					projectObject( depthSensingMesh, camera, - Infinity, _this.sortObjects );
+
+				}
+
+			}
+
+			projectObject( scene, camera, 0, _this.sortObjects );
+
+			currentRenderList.finish();
+			if ( _nodesHandler !== null ) _nodesHandler.updateLights( currentRenderState.state.lightsArray );
+
+			if ( _this.sortObjects === true ) {
+
+				currentRenderList.sort( _opaqueSort, _transparentSort );
+
+			}
+
+			_renderBackground = xr.enabled === false || xr.isPresenting === false || xr.hasDepthSensing() === false;
+			if ( _renderBackground ) {
+
+				background.addToRenderList( currentRenderList, scene );
+
+			}
+
+			//
+
+			this.info.render.frame ++;
+
+			if ( this.info.autoReset === true ) this.info.reset();
+
+			if ( _clippingEnabled === true ) clipping.beginShadows();
+
+			const shadowsArray = currentRenderState.state.shadowsArray;
+
+			shadowMap.render( shadowsArray, scene, camera );
+
+			if ( _clippingEnabled === true ) clipping.endShadows();
+
+			//
+
+			// render scene (skip if first effect is a render pass - it will render the scene itself)
+
+			const skipSceneRender = useOutput && output.hasRenderPass();
+
+			if ( skipSceneRender === false ) {
+
+				const opaqueObjects = currentRenderList.opaque;
+				const transmissiveObjects = currentRenderList.transmissive;
+
+				currentRenderState.setupLights();
+
+				if ( camera.isArrayCamera ) {
+
+					const cameras = camera.cameras;
+
+					if ( transmissiveObjects.length > 0 ) {
+
+						for ( let i = 0, l = cameras.length; i < l; i ++ ) {
+
+							const camera2 = cameras[ i ];
+
+							renderTransmissionPass( opaqueObjects, transmissiveObjects, scene, camera2 );
+
+						}
+
+					}
+
+					if ( _renderBackground ) background.render( scene );
+
+					for ( let i = 0, l = cameras.length; i < l; i ++ ) {
+
+						const camera2 = cameras[ i ];
+
+						renderScene( currentRenderList, scene, camera2, camera2.viewport );
+
+					}
+
+				} else {
+
+					if ( transmissiveObjects.length > 0 ) renderTransmissionPass( opaqueObjects, transmissiveObjects, scene, camera );
+
+					if ( _renderBackground ) background.render( scene );
+
+					renderScene( currentRenderList, scene, camera );
+
+				}
+
+			}
+
+			//
+
+			if ( _currentRenderTarget !== null && _currentActiveMipmapLevel === 0 ) {
+
+				// resolve multisample renderbuffers to a single-sample texture if necessary
+
+				textures.updateMultisampleRenderTarget( _currentRenderTarget );
+
+				// Generate mipmap if we're using any kind of mipmap filtering
+
+				textures.updateRenderTargetMipmap( _currentRenderTarget );
+
+			}
+
+			// copy from internal render target to canvas using fullscreen quad
+
+			if ( useOutput ) {
+
+				output.end( _this );
+
+			}
+
+			//
+
+			if ( scene.isScene === true ) scene.onAfterRender( _this, scene, camera );
+
+			// _gl.finish();
+
+			bindingStates.resetDefaultState();
+			_currentMaterialId = -1;
+			_currentCamera = null;
+
+			renderStateStack.pop();
+
+			if ( renderStateStack.length > 0 ) {
+
+				currentRenderState = renderStateStack[ renderStateStack.length - 1 ];
+
+				textures.setTextureUnits( currentRenderState.state.textureUnits );
+
+				if ( _clippingEnabled === true ) clipping.setGlobalState( _this.clippingPlanes, currentRenderState.state.camera );
+
+			} else {
+
+				currentRenderState = null;
+
+			}
+
+			renderListStack.pop();
+
+			if ( renderListStack.length > 0 ) {
+
+				currentRenderList = renderListStack[ renderListStack.length - 1 ];
+
+			} else {
+
+				currentRenderList = null;
+
+			}
+
+			if ( _nodesHandler !== null ) {
+
+				_nodesHandler.renderEnd();
+
+			}
+
+		};
+
+		function projectObject( object, camera, groupOrder, sortObjects ) {
+
+			if ( object.visible === false ) return;
+
+			const visible = object.layers.test( camera.layers );
+
+			if ( visible ) {
+
+				if ( object.isGroup ) {
+
+					groupOrder = object.renderOrder;
+
+				} else if ( object.isLOD ) {
+
+					if ( object.autoUpdate === true ) object.update( camera );
+
+				} else if ( object.isLightProbeGrid ) {
+
+					currentRenderState.pushLightProbeGrid( object );
+
+				} else if ( object.isLight ) {
+
+					currentRenderState.pushLight( object );
+
+					if ( object.castShadow ) {
+
+						currentRenderState.pushShadow( object );
+
+					}
+
+				} else if ( object.isSprite ) {
+
+					if ( ! object.frustumCulled || object.intersectsFrustum( _frustum ) ) {
+
+						if ( sortObjects ) {
+
+							_vector4.setFromMatrixPosition( object.matrixWorld )
+								.applyMatrix4( _projScreenMatrix );
+
+						}
+
+						const geometry = objects.update( object );
+						const material = object.material;
+
+						if ( material.visible ) {
+
+							currentRenderList.push( object, geometry, material, groupOrder, _vector4.z, null, camera );
+
+						}
+
+					}
+
+				} else if ( object.isMesh || object.isLine || object.isPoints ) {
+
+					if ( ! object.frustumCulled || object.intersectsFrustum( _frustum ) ) {
+
+						const geometry = objects.update( object );
+						const material = object.material;
+
+						if ( sortObjects ) {
+
+							if ( object.boundingSphere !== undefined ) {
+
+								if ( object.boundingSphere === null ) object.computeBoundingSphere();
+								_vector4.copy( object.boundingSphere.center );
+
+							} else {
+
+								if ( geometry.boundingSphere === null ) geometry.computeBoundingSphere();
+								_vector4.copy( geometry.boundingSphere.center );
+
+							}
+
+							_vector4
+								.applyMatrix4( object.matrixWorld )
+								.applyMatrix4( _projScreenMatrix );
+
+						}
+
+						if ( Array.isArray( material ) ) {
+
+							const groups = geometry.groups;
+
+							for ( let i = 0, l = groups.length; i < l; i ++ ) {
+
+								const group = groups[ i ];
+								const groupMaterial = material[ group.materialIndex ];
+
+								if ( groupMaterial && groupMaterial.visible ) {
+
+									currentRenderList.push( object, geometry, groupMaterial, groupOrder, _vector4.z, group, camera );
+
+								}
+
+							}
+
+						} else if ( material.visible ) {
+
+							currentRenderList.push( object, geometry, material, groupOrder, _vector4.z, null, camera );
+
+						}
+
+					}
+
+				}
+
+			}
+
+			const children = object.children;
+
+			for ( let i = 0, l = children.length; i < l; i ++ ) {
+
+				projectObject( children[ i ], camera, groupOrder, sortObjects );
+
+			}
+
+		}
+
+		function renderScene( currentRenderList, scene, camera, viewport ) {
+
+			const { opaque: opaqueObjects, transmissive: transmissiveObjects, transparent: transparentObjects } = currentRenderList;
+
+			currentRenderState.setupLightsView( camera );
+
+			if ( _clippingEnabled === true ) clipping.setGlobalState( _this.clippingPlanes, camera );
+
+			if ( viewport ) state.viewport( _currentViewport.copy( viewport ) );
+
+			if ( opaqueObjects.length > 0 ) renderObjects( opaqueObjects, scene, camera );
+			if ( transmissiveObjects.length > 0 ) renderObjects( transmissiveObjects, scene, camera );
+			if ( transparentObjects.length > 0 ) renderObjects( transparentObjects, scene, camera );
+
+			// Ensure depth buffer writing is enabled so it can be cleared on next render
+
+			state.buffers.depth.setTest( true );
+			state.buffers.depth.setMask( true );
+			state.buffers.color.setMask( true );
+
+			state.setPolygonOffset( false );
+
+		}
+
+		function renderTransmissionPass( opaqueObjects, transmissiveObjects, scene, camera ) {
+
+			const overrideMaterial = scene.isScene === true ? scene.overrideMaterial : null;
+
+			if ( overrideMaterial !== null ) {
+
+				return;
+
+			}
+
+			if ( currentRenderState.state.transmissionRenderTarget[ camera.id ] === undefined ) {
+
+				const hasHalfFloatSupport = extensions.has( 'EXT_color_buffer_half_float' ) || extensions.has( 'EXT_color_buffer_float' );
+
+				currentRenderState.state.transmissionRenderTarget[ camera.id ] = new WebGLRenderTarget( 1, 1, {
+					generateMipmaps: true,
+					type: hasHalfFloatSupport ? HalfFloatType : UnsignedByteType,
+					minFilter: LinearMipmapLinearFilter,
+					samples: Math.max( 4, capabilities.samples ), // to avoid feedback loops, the transmission render target requires a resolve, see #26177
+					stencilBuffer: stencil,
+					resolveDepthBuffer: false,
+					resolveStencilBuffer: false,
+					storeMultisampledDepthBuffer: false,
+					storeMultisampledStencilBuffer: false,
+					colorSpace: ColorManagement.workingColorSpace,
+				} );
+
+				// debug
+
+				/*
+				const geometry = new PlaneGeometry();
+				const material = new MeshBasicMaterial( { map: _transmissionRenderTarget.texture } );
+
+				const mesh = new Mesh( geometry, material );
+				scene.add( mesh );
+				*/
+
+			}
+
+			const transmissionRenderTarget = currentRenderState.state.transmissionRenderTarget[ camera.id ];
+
+			const activeViewport = camera.viewport || _currentViewport;
+			transmissionRenderTarget.setSize( activeViewport.z * _this.transmissionResolutionScale, activeViewport.w * _this.transmissionResolutionScale );
+
+			//
+
+			const currentRenderTarget = _this.getRenderTarget();
+			const currentActiveCubeFace = _this.getActiveCubeFace();
+			const currentActiveMipmapLevel = _this.getActiveMipmapLevel();
+
+			_this.setRenderTarget( transmissionRenderTarget );
+
+			_this.getClearColor( _currentClearColor );
+			_currentClearAlpha = _this.getClearAlpha();
+			if ( _currentClearAlpha < 1 ) _this.setClearColor( 0xffffff, 0.5 );
+
+			_this.clear();
+
+			if ( _renderBackground ) background.render( scene );
+
+			// Turn off the features which can affect the frag color for opaque objects pass.
+			// Otherwise they are applied twice in opaque objects pass and transmission objects pass.
+			const currentToneMapping = _this.toneMapping;
+			_this.toneMapping = NoToneMapping;
+
+			// Remove viewport from camera to avoid nested render calls resetting viewport to it (e.g Reflector).
+			// Transmission render pass requires viewport to match the transmissionRenderTarget.
+			const currentCameraViewport = camera.viewport;
+			if ( camera.viewport !== undefined ) camera.viewport = undefined;
+
+			currentRenderState.setupLightsView( camera );
+
+			if ( _clippingEnabled === true ) clipping.setGlobalState( _this.clippingPlanes, camera );
+
+			renderObjects( opaqueObjects, scene, camera );
+
+			textures.updateMultisampleRenderTarget( transmissionRenderTarget );
+			textures.updateRenderTargetMipmap( transmissionRenderTarget );
+
+			if ( extensions.has( 'WEBGL_multisampled_render_to_texture' ) === false ) { // see #28131
+
+				let renderTargetNeedsUpdate = false;
+
+				for ( let i = 0, l = transmissiveObjects.length; i < l; i ++ ) {
+
+					const renderItem = transmissiveObjects[ i ];
+
+					const { object, geometry, material, group } = renderItem;
+
+					if ( material.side === DoubleSide && object.layers.test( camera.layers ) ) {
+
+						const currentSide = material.side;
+
+						material.side = BackSide;
+						material.needsUpdate = true;
+
+						renderObject( object, scene, camera, geometry, material, group );
+
+						material.side = currentSide;
+						material.needsUpdate = true;
+
+						renderTargetNeedsUpdate = true;
+
+					}
+
+				}
+
+				if ( renderTargetNeedsUpdate === true ) {
+
+					textures.updateMultisampleRenderTarget( transmissionRenderTarget );
+					textures.updateRenderTargetMipmap( transmissionRenderTarget );
+
+				}
+
+			}
+
+			_this.setRenderTarget( currentRenderTarget, currentActiveCubeFace, currentActiveMipmapLevel );
+
+			_this.setClearColor( _currentClearColor, _currentClearAlpha );
+
+			if ( currentCameraViewport !== undefined ) camera.viewport = currentCameraViewport;
+
+			_this.toneMapping = currentToneMapping;
+
+		}
+
+		function renderObjects( renderList, scene, camera ) {
+
+			const overrideMaterial = scene.isScene === true ? scene.overrideMaterial : null;
+
+			for ( let i = 0, l = renderList.length; i < l; i ++ ) {
+
+				const renderItem = renderList[ i ];
+
+				const { object, geometry, group } = renderItem;
+				let material = renderItem.material;
+
+				if ( material.allowOverride === true && overrideMaterial !== null ) {
+
+					material = overrideMaterial;
+
+				}
+
+				if ( object.layers.test( camera.layers ) ) {
+
+					renderObject( object, scene, camera, geometry, material, group );
+
+				}
+
+			}
+
+		}
+
+		function renderObject( object, scene, camera, geometry, material, group ) {
+
+			if ( _nodesHandler !== null && material.isNodeMaterial ) _nodesHandler.setObject( object, material );
+			object.onBeforeRender( _this, scene, camera, geometry, material, group );
+
+			object.modelViewMatrix.multiplyMatrices( camera.matrixWorldInverse, object.matrixWorld );
+			object.normalMatrix.getNormalMatrix( object.modelViewMatrix );
+
+			material.onBeforeRender( _this, scene, camera, geometry, object, group );
+
+			if ( material.transparent === true && material.side === DoubleSide && material.forceSinglePass === false ) {
+
+				material.side = BackSide;
+				material.needsUpdate = true;
+				_this.renderBufferDirect( camera, scene, geometry, material, object, group );
+
+				material.side = FrontSide;
+				material.needsUpdate = true;
+				_this.renderBufferDirect( camera, scene, geometry, material, object, group );
+
+				material.side = DoubleSide;
+
+			} else {
+
+				_this.renderBufferDirect( camera, scene, geometry, material, object, group );
+
+			}
+
+			object.onAfterRender( _this, scene, camera, geometry, material, group );
+
+		}
+
+		function getProgram( material, scene, object ) {
+
+			if ( scene.isScene !== true ) scene = _emptyScene; // scene could be a Mesh, Line, Points, ...
+
+			const materialProperties = properties.get( material );
+
+			const lights = currentRenderState.state.lights;
+			const shadowsArray = currentRenderState.state.shadowsArray;
+
+			const lightsStateVersion = lights.state.version;
+
+			const parameters = programCache.getParameters( material, lights.state, shadowsArray, scene, object, currentRenderState.state.lightProbeGridArray );
+			const programCacheKey = programCache.getProgramCacheKey( parameters );
+
+			let programs = materialProperties.programs;
+
+			// always update environment and fog - changing these trigger an getProgram call, but it's possible that the program doesn't change
+
+			materialProperties.environment = ( material.isMeshStandardMaterial || material.isMeshLambertMaterial || material.isMeshPhongMaterial ) ? scene.environment : null;
+			materialProperties.fog = scene.fog;
+
+			const usePMREM = material.isMeshStandardMaterial || ( material.isMeshLambertMaterial && ! material.envMap ) || ( material.isMeshPhongMaterial && ! material.envMap );
+			materialProperties.envMap = environments.get( material.envMap || materialProperties.environment, usePMREM );
+			materialProperties.envMapRotation = ( materialProperties.environment !== null && material.envMap === null ) ? scene.environmentRotation : material.envMapRotation;
+
+			if ( programs === undefined ) {
+
+				// new material
+
+				material.addEventListener( 'dispose', onMaterialDispose );
+
+				programs = new Map();
+				materialProperties.programs = programs;
+
+			}
+
+			let program = programs.get( programCacheKey );
+
+			if ( program !== undefined ) {
+
+				// early out if program and light state is identical
+
+				if ( materialProperties.currentProgram === program && materialProperties.lightsStateVersion === lightsStateVersion ) {
+
+					updateCommonMaterialProperties( material, parameters );
+
+					return program;
+
+				}
+
+			} else {
+
+				parameters.uniforms = programCache.getUniforms( material );
+
+				// Use node builder for node materials if available
+				if ( _nodesHandler !== null && material.isNodeMaterial ) {
+
+					_nodesHandler.build( material, object, parameters );
+
+				}
+
+				material.onBeforeCompile( parameters, _this );
+
+				program = programCache.acquireProgram( parameters, programCacheKey );
+				programs.set( programCacheKey, program );
+
+				materialProperties.uniforms = parameters.uniforms;
+
+			}
+
+			const uniforms = materialProperties.uniforms;
+
+			if ( ( ! material.isShaderMaterial && ! material.isRawShaderMaterial ) || material.clipping === true ) {
+
+				uniforms.clippingPlanes = clipping.uniform;
+
+			}
+
+			updateCommonMaterialProperties( material, parameters );
+
+			// store the light setup it was created for
+
+			materialProperties.needsLights = materialNeedsLights( material );
+			materialProperties.lightsStateVersion = lightsStateVersion;
+
+			if ( materialProperties.needsLights ) {
+
+				// wire up the material to this renderer's lighting state
+
+				uniforms.ambientLightColor.value = lights.state.ambient;
+				uniforms.lightProbe.value = lights.state.probe;
+				uniforms.sunLights.value = lights.state.sun;
+				uniforms.sunLightShadows.value = lights.state.sunShadow;
+				uniforms.directionalLights.value = lights.state.directional;
+				uniforms.directionalLightShadows.value = lights.state.directionalShadow;
+				uniforms.spotLights.value = lights.state.spot;
+				uniforms.spotLightShadows.value = lights.state.spotShadow;
+				uniforms.rectAreaLights.value = lights.state.rectArea;
+				uniforms.ltc_1.value = lights.state.rectAreaLTC1;
+				uniforms.ltc_2.value = lights.state.rectAreaLTC2;
+				uniforms.pointLights.value = lights.state.point;
+				uniforms.pointLightShadows.value = lights.state.pointShadow;
+				uniforms.hemisphereLights.value = lights.state.hemi;
+
+				uniforms.sunShadowMatrix.value = lights.state.sunShadowMatrix;
+				uniforms.sunShadowCascade.value = lights.state.sunShadowCascade;
+				uniforms.directionalShadowMatrix.value = lights.state.directionalShadowMatrix;
+				uniforms.spotLightMatrix.value = lights.state.spotLightMatrix;
+				uniforms.spotLightMap.value = lights.state.spotLightMap;
+				uniforms.pointShadowMatrix.value = lights.state.pointShadowMatrix;
+				// TODO (abelnation): add area lights shadow info to uniforms
+
+			}
+
+			materialProperties.lightProbeGrid = currentRenderState.state.lightProbeGridArray.length > 0;
+
+			materialProperties.currentProgram = program;
+			materialProperties.uniformsList = null;
+
+			return program;
+
+		}
+
+		function getUniformList( materialProperties ) {
+
+			if ( materialProperties.uniformsList === null ) {
+
+				const progUniforms = materialProperties.currentProgram.getUniforms();
+				materialProperties.uniformsList = WebGLUniforms.seqWithValue( progUniforms.seq, materialProperties.uniforms );
+
+			}
+
+			return materialProperties.uniformsList;
+
+		}
+
+		function updateCommonMaterialProperties( material, parameters ) {
+
+			const materialProperties = properties.get( material );
+
+			materialProperties.outputColorSpace = parameters.outputColorSpace;
+			materialProperties.batching = parameters.batching;
+			materialProperties.batchingColor = parameters.batchingColor;
+			materialProperties.instancing = parameters.instancing;
+			materialProperties.instancingColor = parameters.instancingColor;
+			materialProperties.instancingMorph = parameters.instancingMorph;
+			materialProperties.skinning = parameters.skinning;
+			materialProperties.morphTargets = parameters.morphTargets;
+			materialProperties.morphNormals = parameters.morphNormals;
+			materialProperties.morphColors = parameters.morphColors;
+			materialProperties.morphTargetsCount = parameters.morphTargetsCount;
+			materialProperties.numClippingPlanes = parameters.numClippingPlanes;
+			materialProperties.numIntersection = parameters.numClipIntersection;
+			materialProperties.vertexAlphas = parameters.vertexAlphas;
+			materialProperties.vertexTangents = parameters.vertexTangents;
+			materialProperties.toneMapping = parameters.toneMapping;
+
+		}
+
+		function findLightProbeGrid( volumes, object ) {
+
+			if ( volumes.length === 0 ) return null;
+
+			if ( volumes.length === 1 ) {
+
+				return volumes[ 0 ].texture !== null ? volumes[ 0 ] : null;
+
+			}
+
+			objectPosition.setFromMatrixPosition( object.matrixWorld );
+
+			for ( let i = 0, l = volumes.length; i < l; i ++ ) {
+
+				const v = volumes[ i ];
+
+				if ( v.texture !== null && v.boundingBox.containsPoint( objectPosition ) ) return v;
+
+			}
+
+			return null;
+
+		}
+
+		function setProgram( camera, scene, geometry, material, object ) {
+
+			if ( scene.isScene !== true ) scene = _emptyScene; // scene could be a Mesh, Line, Points, ...
+
+			textures.resetTextureUnits();
+
+			const fog = scene.fog;
+			const environment = ( material.isMeshStandardMaterial || material.isMeshLambertMaterial || material.isMeshPhongMaterial ) ? scene.environment : null;
+			const colorSpace = ( _currentRenderTarget === null ) ? _this.outputColorSpace : ( _currentRenderTarget.isXRRenderTarget === true ? _currentRenderTarget.texture.colorSpace : ColorManagement.workingColorSpace );
+			const usePMREM = material.isMeshStandardMaterial || ( material.isMeshLambertMaterial && ! material.envMap ) || ( material.isMeshPhongMaterial && ! material.envMap );
+			const envMap = environments.get( material.envMap || environment, usePMREM );
+			const vertexAlphas = material.vertexColors === true && !! geometry.attributes.color && geometry.attributes.color.itemSize === 4;
+			const vertexTangents = !! geometry.attributes.tangent && ( !! material.normalMap || material.anisotropy > 0 );
+			const morphTargets = !! geometry.morphAttributes.position;
+			const morphNormals = !! geometry.morphAttributes.normal;
+			const morphColors = !! geometry.morphAttributes.color;
+
+			let toneMapping = NoToneMapping;
+
+			if ( material.toneMapped ) {
+
+				if ( _currentRenderTarget === null || _currentRenderTarget.isXRRenderTarget === true ) {
+
+					toneMapping = _this.toneMapping;
+
+				}
+
+			}
+
+			const morphAttribute = geometry.morphAttributes.position || geometry.morphAttributes.normal || geometry.morphAttributes.color;
+			const morphTargetsCount = ( morphAttribute !== undefined ) ? morphAttribute.length : 0;
+
+			const materialProperties = properties.get( material );
+			const lights = currentRenderState.state.lights;
+
+			if ( _clippingEnabled === true ) {
+
+				if ( _localClippingEnabled === true || camera !== _currentCamera ) {
+
+					const useCache =
+						camera === _currentCamera &&
+						material.id === _currentMaterialId;
+
+					// we might want to call this function with some ClippingGroup
+					// object instead of the material, once it becomes feasible
+					// (#8465, #8379)
+					clipping.setState( material, camera, useCache );
+
+				}
+
+			}
+
+			//
+
+			let needsProgramChange = false;
+
+			if ( material.version === materialProperties.__version ) {
+
+				if ( materialProperties.needsLights && ( materialProperties.lightsStateVersion !== lights.state.version ) ) {
+
+					needsProgramChange = true;
+
+				} else if ( materialProperties.outputColorSpace !== colorSpace ) {
+
+					needsProgramChange = true;
+
+				} else if ( object.isBatchedMesh && materialProperties.batching === false ) {
+
+					needsProgramChange = true;
+
+				} else if ( ! object.isBatchedMesh && materialProperties.batching === true ) {
+
+					needsProgramChange = true;
+
+				} else if ( object.isBatchedMesh && materialProperties.batchingColor === true && object._colorsTexture === null ) {
+
+					needsProgramChange = true;
+
+				} else if ( object.isBatchedMesh && materialProperties.batchingColor === false && object._colorsTexture !== null ) {
+
+					needsProgramChange = true;
+
+				} else if ( object.isInstancedMesh && materialProperties.instancing === false ) {
+
+					needsProgramChange = true;
+
+				} else if ( ! object.isInstancedMesh && materialProperties.instancing === true ) {
+
+					needsProgramChange = true;
+
+				} else if ( object.isSkinnedMesh && materialProperties.skinning === false ) {
+
+					needsProgramChange = true;
+
+				} else if ( ! object.isSkinnedMesh && materialProperties.skinning === true ) {
+
+					needsProgramChange = true;
+
+				} else if ( object.isInstancedMesh && materialProperties.instancingColor === true && object.instanceColor === null ) {
+
+					needsProgramChange = true;
+
+				} else if ( object.isInstancedMesh && materialProperties.instancingColor === false && object.instanceColor !== null ) {
+
+					needsProgramChange = true;
+
+				} else if ( object.isInstancedMesh && materialProperties.instancingMorph === true && object.morphTexture === null ) {
+
+					needsProgramChange = true;
+
+				} else if ( object.isInstancedMesh && materialProperties.instancingMorph === false && object.morphTexture !== null ) {
+
+					needsProgramChange = true;
+
+				} else if ( materialProperties.envMap !== envMap ) {
+
+					needsProgramChange = true;
+
+				} else if ( material.fog === true && materialProperties.fog !== fog ) {
+
+					needsProgramChange = true;
+
+				} else if ( materialProperties.numClippingPlanes !== undefined &&
+					( materialProperties.numClippingPlanes !== clipping.numPlanes ||
+					materialProperties.numIntersection !== clipping.numIntersection ) ) {
+
+					needsProgramChange = true;
+
+				} else if ( materialProperties.vertexAlphas !== vertexAlphas ) {
+
+					needsProgramChange = true;
+
+				} else if ( materialProperties.vertexTangents !== vertexTangents ) {
+
+					needsProgramChange = true;
+
+				} else if ( materialProperties.morphTargets !== morphTargets ) {
+
+					needsProgramChange = true;
+
+				} else if ( materialProperties.morphNormals !== morphNormals ) {
+
+					needsProgramChange = true;
+
+				} else if ( materialProperties.morphColors !== morphColors ) {
+
+					needsProgramChange = true;
+
+				} else if ( materialProperties.toneMapping !== toneMapping ) {
+
+					needsProgramChange = true;
+
+				} else if ( materialProperties.morphTargetsCount !== morphTargetsCount ) {
+
+					needsProgramChange = true;
+
+				} else if ( !! materialProperties.lightProbeGrid !== ( currentRenderState.state.lightProbeGridArray.length > 0 ) ) {
+
+					needsProgramChange = true;
+
+				}
+
+			} else {
+
+				needsProgramChange = true;
+				materialProperties.__version = material.version;
+
+			}
+
+			//
+
+			let program = materialProperties.currentProgram;
+
+			if ( needsProgramChange === true ) {
+
+				program = getProgram( material, scene, object );
+
+				// notify the node builder that the program has changed so uniforms and update nodes can
+				// be cached and triggered.
+				if ( _nodesHandler && material.isNodeMaterial ) {
+
+					_nodesHandler.onUpdateProgram( material, program, materialProperties );
+
+				}
+
+			}
+
+			let refreshProgram = false;
+			let refreshMaterial = false;
+			let refreshLights = false;
+
+			const p_uniforms = program.getUniforms(),
+				m_uniforms = materialProperties.uniforms;
+
+			if ( state.useProgram( program.program ) ) {
+
+				refreshProgram = true;
+				refreshMaterial = true;
+				refreshLights = true;
+
+			}
+
+			if ( material.id !== _currentMaterialId ) {
+
+				_currentMaterialId = material.id;
+
+				refreshMaterial = true;
+
+			}
+
+			if ( materialProperties.needsLights ) {
+
+				const objectVolume = findLightProbeGrid( currentRenderState.state.lightProbeGridArray, object );
+
+				if ( materialProperties.lightProbeGrid !== objectVolume ) {
+
+					materialProperties.lightProbeGrid = objectVolume;
+					refreshMaterial = true;
+
+				}
+
+			}
+
+			if ( refreshProgram || _currentCamera !== camera ) {
+
+				// common camera uniforms
+
+				const reversedDepthBuffer = state.buffers.depth.getReversed();
+
+				if ( reversedDepthBuffer && camera.reversedDepth !== true ) {
+
+					camera._reversedDepth = true;
+					camera.updateProjectionMatrix();
+
+				}
+
+				p_uniforms.setValue( _gl, 'projectionMatrix', camera.projectionMatrix );
+
+				p_uniforms.setValue( _gl, 'viewMatrix', camera.matrixWorldInverse );
+
+				const uCamPos = p_uniforms.map.cameraPosition;
+
+				if ( uCamPos !== undefined ) {
+
+					uCamPos.setValue( _gl, _vector3.setFromMatrixPosition( camera.matrixWorld ) );
+
+				}
+
+				if ( capabilities.logarithmicDepthBuffer ) {
+
+					p_uniforms.setValue( _gl, 'logDepthBufFC',
+						2.0 / ( Math.log( camera.far + 1.0 ) / Math.LN2 ) );
+
+				}
+
+				// consider moving isOrthographic to UniformLib and WebGLMaterials, see https://github.com/mrdoob/three.js/pull/26467#issuecomment-1645185067
+
+				if ( material.isMeshPhongMaterial ||
+					material.isMeshToonMaterial ||
+					material.isMeshLambertMaterial ||
+					material.isMeshBasicMaterial ||
+					material.isMeshStandardMaterial ||
+					material.isShaderMaterial ) {
+
+					p_uniforms.setValue( _gl, 'isOrthographic', camera.isOrthographicCamera === true );
+
+				}
+
+				if ( _currentCamera !== camera ) {
+
+					_currentCamera = camera;
+
+					// lighting uniforms depend on the camera so enforce an update
+					// now, in case this material supports lights - or later, when
+					// the next material that does gets activated:
+
+					refreshMaterial = true;		// set to true on material change
+					refreshLights = true;		// remains set until update done
+
+				}
+
+			}
+
+			// Pre-allocate texture units for shadow samplers before setting data textures
+			if ( materialProperties.needsLights ) {
+
+				// Set shadow map uniforms first to ensure they get the first texture units
+				if ( lights.state.sunShadowMap.length > 0 ) {
+
+					p_uniforms.setValue( _gl, 'sunShadowMap', lights.state.sunShadowMap, textures );
+
+				}
+
+				if ( lights.state.directionalShadowMap.length > 0 ) {
+
+					p_uniforms.setValue( _gl, 'directionalShadowMap', lights.state.directionalShadowMap, textures );
+
+				}
+
+				if ( lights.state.spotShadowMap.length > 0 ) {
+
+					p_uniforms.setValue( _gl, 'spotShadowMap', lights.state.spotShadowMap, textures );
+
+				}
+
+				if ( lights.state.pointShadowMap.length > 0 ) {
+
+					p_uniforms.setValue( _gl, 'pointShadowMap', lights.state.pointShadowMap, textures );
+
+				}
+
+			}
+
+			// skinning and morph target uniforms must be set even if material didn't change
+			// auto-setting of texture unit for bone and morph texture must go before other textures
+			// otherwise textures used for skinning and morphing can take over texture units reserved for other material textures
+
+			if ( object.isSkinnedMesh ) {
+
+				p_uniforms.setOptional( _gl, object, 'bindMatrix' );
+				p_uniforms.setOptional( _gl, object, 'bindMatrixInverse' );
+
+				const skeleton = object.skeleton;
+
+				if ( skeleton ) {
+
+					if ( skeleton.boneTexture === null ) skeleton.computeBoneTexture();
+
+					p_uniforms.setValue( _gl, 'boneTexture', skeleton.boneTexture, textures );
+
+				}
+
+			}
+
+			if ( object.isBatchedMesh ) {
+
+				p_uniforms.setOptional( _gl, object, 'batchingTexture' );
+				p_uniforms.setValue( _gl, 'batchingTexture', object._matricesTexture, textures );
+
+				p_uniforms.setOptional( _gl, object, 'batchingIdTexture' );
+				p_uniforms.setValue( _gl, 'batchingIdTexture', object._indirectTexture, textures );
+
+				p_uniforms.setOptional( _gl, object, 'batchingColorTexture' );
+				if ( object._colorsTexture !== null ) {
+
+					p_uniforms.setValue( _gl, 'batchingColorTexture', object._colorsTexture, textures );
+
+				}
+
+			}
+
+			const morphAttributes = geometry.morphAttributes;
+
+			if ( morphAttributes.position !== undefined || morphAttributes.normal !== undefined || ( morphAttributes.color !== undefined ) ) {
+
+				morphtargets.update( object, geometry, program );
+
+			}
+
+			if ( refreshMaterial || materialProperties.receiveShadow !== object.receiveShadow ) {
+
+				materialProperties.receiveShadow = object.receiveShadow;
+				p_uniforms.setValue( _gl, 'receiveShadow', object.receiveShadow );
+
+			}
+
+			if ( ( material.isMeshStandardMaterial || material.isMeshLambertMaterial || material.isMeshPhongMaterial ) && material.envMap === null && scene.environment !== null ) {
+
+				m_uniforms.envMapIntensity.value = scene.environmentIntensity;
+
+			}
+
+			// Set DFG LUT for physically-based materials
+			if ( m_uniforms.dfgLUT !== undefined ) {
+
+				m_uniforms.dfgLUT.value = getDFGLUT();
+
+			}
+
+			if ( refreshMaterial ) {
+
+				p_uniforms.setValue( _gl, 'toneMappingExposure', _this.toneMappingExposure );
+
+				if ( materialProperties.needsLights ) {
+
+					// the current material requires lighting info
+
+					// note: all lighting uniforms are always set correctly
+					// they simply reference the renderer's state for their
+					// values
+					//
+					// use the current material's .needsUpdate flags to set
+					// the GL state when required
+
+					markUniformsLightsNeedsUpdate( m_uniforms, refreshLights );
+
+				}
+
+				// refresh uniforms common to several materials
+
+				if ( fog && material.fog === true ) {
+
+					materials.refreshFogUniforms( m_uniforms, fog );
+
+				}
+
+				materials.refreshMaterialUniforms( m_uniforms, material, _pixelRatio, _height, currentRenderState.state.transmissionRenderTarget[ camera.id ] );
+
+				// light probe volume
+
+				if ( materialProperties.needsLights && materialProperties.lightProbeGrid ) {
+
+					const volume = materialProperties.lightProbeGrid;
+
+					m_uniforms.probesSH.value = volume.texture;
+					m_uniforms.probesMin.value.copy( volume.boundingBox.min );
+					m_uniforms.probesMax.value.copy( volume.boundingBox.max );
+					m_uniforms.probesResolution.value.copy( volume.resolution );
+
+				}
+
+				WebGLUniforms.upload( _gl, getUniformList( materialProperties ), m_uniforms, textures );
+
+			}
+
+			if ( material.isShaderMaterial && material.uniformsNeedUpdate === true ) {
+
+				WebGLUniforms.upload( _gl, getUniformList( materialProperties ), m_uniforms, textures );
+				material.uniformsNeedUpdate = false;
+
+			}
+
+			if ( material.isSpriteMaterial ) {
+
+				p_uniforms.setValue( _gl, 'center', object.center );
+
+			}
+
+			// common matrices
+
+			p_uniforms.setValue( _gl, 'modelViewMatrix', object.modelViewMatrix );
+			p_uniforms.setValue( _gl, 'normalMatrix', object.normalMatrix );
+			p_uniforms.setValue( _gl, 'modelMatrix', object.matrixWorld );
+
+			// UBOs
+
+			if ( material.uniformsGroups !== undefined ) {
+
+				const groups = material.uniformsGroups;
+
+				for ( let i = 0, l = groups.length; i < l; i ++ ) {
+
+					const group = groups[ i ];
+
+					uniformsGroups.update( group, program );
+					uniformsGroups.bind( group, program );
+
+				}
+
+			}
+
+			return program;
+
+		}
+
+		// If uniforms are marked as clean, they don't need to be loaded to the GPU.
+
+		function markUniformsLightsNeedsUpdate( uniforms, value ) {
+
+			uniforms.ambientLightColor.needsUpdate = value;
+			uniforms.lightProbe.needsUpdate = value;
+
+			uniforms.sunLights.needsUpdate = value;
+			uniforms.sunLightShadows.needsUpdate = value;
+			uniforms.directionalLights.needsUpdate = value;
+			uniforms.directionalLightShadows.needsUpdate = value;
+			uniforms.pointLights.needsUpdate = value;
+			uniforms.pointLightShadows.needsUpdate = value;
+			uniforms.spotLights.needsUpdate = value;
+			uniforms.spotLightShadows.needsUpdate = value;
+			uniforms.rectAreaLights.needsUpdate = value;
+			uniforms.hemisphereLights.needsUpdate = value;
+
+		}
+
+		function materialNeedsLights( material ) {
+
+			return material.isMeshLambertMaterial || material.isMeshToonMaterial || material.isMeshPhongMaterial ||
+				material.isMeshStandardMaterial || material.isShadowMaterial ||
+				( material.isShaderMaterial && material.lights === true );
+
+		}
+
+		/**
+		 * Returns the active cube face.
+		 *
+		 * @return {number} The active cube face.
+		 */
+		this.getActiveCubeFace = function () {
+
+			return _currentActiveCubeFace;
+
+		};
+
+		/**
+		 * Returns the active mipmap level.
+		 *
+		 * @return {number} The active mipmap level.
+		 */
+		this.getActiveMipmapLevel = function () {
+
+			return _currentActiveMipmapLevel;
+
+		};
+
+		/**
+		 * Returns the active render target.
+		 *
+		 * @return {?WebGLRenderTarget} The active render target. Returns `null` if no render target
+		 * is currently set.
+		 */
+		this.getRenderTarget = function () {
+
+			return _currentRenderTarget;
+
+		};
+
+		this.setRenderTargetTextures = function ( renderTarget, colorTexture, depthTexture ) {
+
+			const renderTargetProperties = properties.get( renderTarget );
+
+			renderTargetProperties.__autoAllocateDepthBuffer = renderTarget.resolveDepthBuffer === false;
+			if ( renderTargetProperties.__autoAllocateDepthBuffer === false ) {
+
+				// The multisample_render_to_texture extension doesn't work properly if there
+				// are midframe flushes and an external depth buffer. Disable use of the extension.
+				renderTargetProperties.__useRenderToTexture = false;
+
+			}
+
+			properties.get( renderTarget.texture ).__webglTexture = colorTexture;
+			properties.get( renderTarget.depthTexture ).__webglTexture = renderTargetProperties.__autoAllocateDepthBuffer ? undefined : depthTexture;
+
+			renderTargetProperties.__hasExternalTextures = true;
+
+		};
+
+		this.setRenderTargetFramebuffer = function ( renderTarget, defaultFramebuffer ) {
+
+			const renderTargetProperties = properties.get( renderTarget );
+			renderTargetProperties.__webglFramebuffer = defaultFramebuffer;
+			renderTargetProperties.__useDefaultFramebuffer = defaultFramebuffer === undefined;
+
+		};
+
+		/**
+		 * Sets the active rendertarget.
+		 *
+		 * @param {?WebGLRenderTarget} renderTarget - The render target to set. When `null` is given,
+		 * the canvas is set as the active render target instead.
+		 * @param {number} [activeCubeFace=0] - The active cube face when using a cube render target.
+		 * Indicates the z layer to render in to when using 3D or array render targets.
+		 * @param {number} [activeMipmapLevel=0] - The active mipmap level.
+		 */
+		this.setRenderTarget = function ( renderTarget, activeCubeFace = 0, activeMipmapLevel = 0 ) {
+
+			_currentRenderTarget = renderTarget;
+			_currentActiveCubeFace = activeCubeFace;
+			_currentActiveMipmapLevel = activeMipmapLevel;
+
+			let framebuffer = null;
+			let isCube = false;
+			let isRenderTarget3D = false;
+
+			if ( renderTarget ) {
+
+				const renderTargetProperties = properties.get( renderTarget );
+
+				if ( renderTargetProperties.__useDefaultFramebuffer !== undefined ) {
+
+					// Externally-managed framebuffer (e.g. XR)
+					// Bind to the stored framebuffer (may be null for default, or a WebGLFramebuffer)
+					state.bindFramebuffer( _gl.FRAMEBUFFER, renderTargetProperties.__webglFramebuffer );
+
+					_currentViewport.copy( renderTarget.viewport );
+					_currentScissor.copy( renderTarget.scissor );
+					_currentScissorTest = renderTarget.scissorTest;
+
+					state.viewport( _currentViewport );
+					state.scissor( _currentScissor );
+					state.setScissorTest( _currentScissorTest );
+
+					_currentMaterialId = -1;
+
+					return;
+
+				} else if ( renderTargetProperties.__webglFramebuffer === undefined ) {
+
+					textures.setupRenderTarget( renderTarget );
+
+				} else if ( renderTargetProperties.__hasExternalTextures ) {
+
+					// Color and depth texture must be rebound in order for the swapchain to update.
+					textures.rebindTextures( renderTarget, properties.get( renderTarget.texture ).__webglTexture, properties.get( renderTarget.depthTexture ).__webglTexture );
+
+				} else if ( renderTarget.depthBuffer ) {
+
+					// check if the depth texture is already bound to the frame buffer and that it's been initialized
+					const depthTexture = renderTarget.depthTexture;
+					if ( renderTargetProperties.__boundDepthTexture !== depthTexture ) {
+
+						// check if the depth texture is compatible
+						if (
+							depthTexture !== null &&
+							properties.has( depthTexture ) &&
+							( renderTarget.width !== depthTexture.image.width || renderTarget.height !== depthTexture.image.height )
+						) {
+
+							throw new Error( 'THREE.WebGLRenderer: Attached DepthTexture is initialized to the incorrect size.' );
+
+						}
+
+						// Swap the depth buffer to the currently attached one
+						textures.setupDepthRenderbuffer( renderTarget );
+
+					}
+
+				}
+
+				const texture = renderTarget.texture;
+
+				if ( texture.isData3DTexture || texture.isDataArrayTexture || texture.isCompressedArrayTexture ) {
+
+					isRenderTarget3D = true;
+
+				}
+
+				const __webglFramebuffer = properties.get( renderTarget ).__webglFramebuffer;
+
+				if ( renderTarget.isWebGLCubeRenderTarget ) {
+
+					if ( Array.isArray( __webglFramebuffer[ activeCubeFace ] ) ) {
+
+						framebuffer = __webglFramebuffer[ activeCubeFace ][ activeMipmapLevel ];
+
+					} else {
+
+						framebuffer = __webglFramebuffer[ activeCubeFace ];
+
+					}
+
+					isCube = true;
+
+				} else if ( ( renderTarget.samples > 0 ) && textures.useMultisampledRTT( renderTarget ) === false ) {
+
+					framebuffer = properties.get( renderTarget ).__webglMultisampledFramebuffer;
+
+				} else {
+
+					if ( Array.isArray( __webglFramebuffer ) ) {
+
+						framebuffer = __webglFramebuffer[ activeMipmapLevel ];
+
+					} else {
+
+						framebuffer = __webglFramebuffer;
+
+					}
+
+				}
+
+				_currentViewport.copy( renderTarget.viewport );
+				_currentScissor.copy( renderTarget.scissor );
+				_currentScissorTest = renderTarget.scissorTest;
+
+			} else {
+
+				_currentViewport.copy( _viewport ).multiplyScalar( _pixelRatio ).floor();
+				_currentScissor.copy( _scissor ).multiplyScalar( _pixelRatio ).floor();
+				_currentScissorTest = _scissorTest;
+
+			}
+
+			// Use a scratch frame buffer if rendering to a mip level to avoid depth buffers
+			// being bound that are different sizes.
+			if ( activeMipmapLevel !== 0 ) {
+
+				framebuffer = _scratchFramebuffer;
+
+			}
+
+			const framebufferBound = state.bindFramebuffer( _gl.FRAMEBUFFER, framebuffer );
+
+			if ( framebufferBound ) {
+
+				state.drawBuffers( renderTarget, framebuffer );
+
+			}
+
+			state.viewport( _currentViewport );
+			state.scissor( _currentScissor );
+			state.setScissorTest( _currentScissorTest );
+
+			if ( isCube ) {
+
+				const textureProperties = properties.get( renderTarget.texture );
+				_gl.framebufferTexture2D( _gl.FRAMEBUFFER, _gl.COLOR_ATTACHMENT0, _gl.TEXTURE_CUBE_MAP_POSITIVE_X + activeCubeFace, textureProperties.__webglTexture, activeMipmapLevel );
+
+			} else if ( isRenderTarget3D ) {
+
+				const layer = activeCubeFace;
+
+				for ( let i = 0; i < renderTarget.textures.length; i ++ ) {
+
+					const textureProperties = properties.get( renderTarget.textures[ i ] );
+
+					_gl.framebufferTextureLayer( _gl.FRAMEBUFFER, _gl.COLOR_ATTACHMENT0 + i, textureProperties.__webglTexture, activeMipmapLevel, layer );
+
+				}
+
+			} else if ( renderTarget !== null && activeMipmapLevel !== 0 ) {
+
+				// Only bind the frame buffer if we are using a scratch frame buffer to render to a mipmap.
+				// If we rebind the texture when using a multi sample buffer then an error about inconsistent samples will be thrown.
+				const textureProperties = properties.get( renderTarget.texture );
+				_gl.framebufferTexture2D( _gl.FRAMEBUFFER, _gl.COLOR_ATTACHMENT0, _gl.TEXTURE_2D, textureProperties.__webglTexture, activeMipmapLevel );
+
+			}
+
+			_currentMaterialId = -1; // reset current material to ensure correct uniform bindings
+
+		};
+
+		function getReadableState( texture ) {
+
+			const textureProperties = properties.get( texture );
+
+			if ( textureProperties.__readFormat !== texture.format || textureProperties.__readType !== texture.type ) {
+
+				textureProperties.__readFormat = texture.format;
+				textureProperties.__readType = texture.type;
+				textureProperties.__formatReadable = capabilities.textureFormatReadable( texture.format );
+				textureProperties.__typeReadable = capabilities.textureTypeReadable( texture.type );
+
+			}
+
+			return textureProperties;
+
+		}
+
+		/**
+		 * Reads the pixel data from the given render target into the given buffer.
+		 *
+		 * @param {WebGLRenderTarget} renderTarget - The render target to read from.
+		 * @param {number} x - The `x` coordinate of the copy region's origin.
+		 * @param {number} y - The `y` coordinate of the copy region's origin.
+		 * @param {number} width - The width of the copy region.
+		 * @param {number} height - The height of the copy region.
+		 * @param {TypedArray} buffer - The result buffer.
+		 * @param {number} [activeCubeFaceIndex] - The active cube face index.
+		 * @param {number} [textureIndex=0] - The texture index of an MRT render target.
+		 */
+		this.readRenderTargetPixels = function ( renderTarget, x, y, width, height, buffer, activeCubeFaceIndex, textureIndex = 0 ) {
+
+			if ( ! ( renderTarget && renderTarget.isWebGLRenderTarget ) ) {
+
+				error( 'WebGLRenderer.readRenderTargetPixels: renderTarget is not THREE.WebGLRenderTarget.' );
+				return;
+
+			}
+
+			let framebuffer = properties.get( renderTarget ).__webglFramebuffer;
+
+			if ( renderTarget.isWebGLCubeRenderTarget && activeCubeFaceIndex !== undefined ) {
+
+				framebuffer = framebuffer[ activeCubeFaceIndex ];
+
+			}
+
+			if ( framebuffer ) {
+
+				state.bindFramebuffer( _gl.FRAMEBUFFER, framebuffer );
+
+				try {
+
+					const texture = renderTarget.textures[ textureIndex ];
+					const textureFormat = texture.format;
+					const textureType = texture.type;
+
+					// when using MRT, select the correct color buffer for the subsequent read command
+
+					if ( renderTarget.textures.length > 1 ) _gl.readBuffer( _gl.COLOR_ATTACHMENT0 + textureIndex );
+
+					const readableState = getReadableState( texture );
+
+					if ( readableState.__formatReadable === false ) {
+
+						error( 'WebGLRenderer.readRenderTargetPixels: renderTarget is not in RGBA or implementation defined format.' );
+						return;
+
+					}
+
+					if ( readableState.__typeReadable === false ) {
+
+						error( 'WebGLRenderer.readRenderTargetPixels: renderTarget is not in UnsignedByteType or implementation defined type.' );
+						return;
+
+					}
+
+					// the following if statement ensures valid read requests (no out-of-bounds pixels, see #8604)
+
+					if ( ( x >= 0 && x <= ( renderTarget.width - width ) ) && ( y >= 0 && y <= ( renderTarget.height - height ) ) ) {
+
+						_gl.readPixels( x, y, width, height, utils.convert( textureFormat ), utils.convert( textureType ), buffer );
+
+					}
+
+				} finally {
+
+					// restore framebuffer of current render target if necessary
+
+					const framebuffer = ( _currentRenderTarget !== null ) ? properties.get( _currentRenderTarget ).__webglFramebuffer : null;
+					state.bindFramebuffer( _gl.FRAMEBUFFER, framebuffer );
+
+				}
+
+			}
+
+		};
+
+		/**
+		 * Asynchronous, non-blocking version of {@link WebGLRenderer#readRenderTargetPixels}.
+		 *
+		 * It is recommended to use this version of `readRenderTargetPixels()` whenever possible.
+		 *
+		 * @async
+		 * @param {WebGLRenderTarget} renderTarget - The render target to read from.
+		 * @param {number} x - The `x` coordinate of the copy region's origin.
+		 * @param {number} y - The `y` coordinate of the copy region's origin.
+		 * @param {number} width - The width of the copy region.
+		 * @param {number} height - The height of the copy region.
+		 * @param {TypedArray} buffer - The result buffer.
+		 * @param {number} [activeCubeFaceIndex] - The active cube face index.
+		 * @param {number} [textureIndex=0] - The texture index of an MRT render target.
+		 * @return {Promise<TypedArray>} A Promise that resolves when the read has been finished. The resolve provides the read data as a typed array.
+		 */
+		this.readRenderTargetPixelsAsync = async function ( renderTarget, x, y, width, height, buffer, activeCubeFaceIndex, textureIndex = 0 ) {
+
+			if ( ! ( renderTarget && renderTarget.isWebGLRenderTarget ) ) {
+
+				throw new Error( 'THREE.WebGLRenderer.readRenderTargetPixels: renderTarget is not THREE.WebGLRenderTarget.' );
+
+			}
+
+			let framebuffer = properties.get( renderTarget ).__webglFramebuffer;
+			if ( renderTarget.isWebGLCubeRenderTarget && activeCubeFaceIndex !== undefined ) {
+
+				framebuffer = framebuffer[ activeCubeFaceIndex ];
+
+			}
+
+			if ( framebuffer ) {
+
+				// the following if statement ensures valid read requests (no out-of-bounds pixels, see #8604)
+				if ( ( x >= 0 && x <= ( renderTarget.width - width ) ) && ( y >= 0 && y <= ( renderTarget.height - height ) ) ) {
+
+					// set the active frame buffer to the one we want to read
+					state.bindFramebuffer( _gl.FRAMEBUFFER, framebuffer );
+
+					const texture = renderTarget.textures[ textureIndex ];
+					const textureFormat = texture.format;
+					const textureType = texture.type;
+
+					// when using MRT, select the correct color buffer for the subsequent read command
+
+					if ( renderTarget.textures.length > 1 ) _gl.readBuffer( _gl.COLOR_ATTACHMENT0 + textureIndex );
+
+					const readableState = getReadableState( texture );
+
+					if ( readableState.__formatReadable === false ) {
+
+						throw new Error( 'THREE.WebGLRenderer.readRenderTargetPixelsAsync: renderTarget is not in RGBA or implementation defined format.' );
+
+					}
+
+					if ( readableState.__typeReadable === false ) {
+
+						throw new Error( 'THREE.WebGLRenderer.readRenderTargetPixelsAsync: renderTarget is not in UnsignedByteType or implementation defined type.' );
+
+					}
+
+					const glBuffer = _gl.createBuffer();
+					_gl.bindBuffer( _gl.PIXEL_PACK_BUFFER, glBuffer );
+					_gl.bufferData( _gl.PIXEL_PACK_BUFFER, buffer.byteLength, _gl.STREAM_READ );
+
+					_gl.readPixels( x, y, width, height, utils.convert( textureFormat ), utils.convert( textureType ), 0 );
+					_gl.bindBuffer( _gl.PIXEL_PACK_BUFFER, null );
+
+					// reset the frame buffer to the currently set buffer before waiting
+					const currFramebuffer = _currentRenderTarget !== null ? properties.get( _currentRenderTarget ).__webglFramebuffer : null;
+					state.bindFramebuffer( _gl.FRAMEBUFFER, currFramebuffer );
+
+					// check if the commands have finished every 8 ms
+					const sync = _gl.fenceSync( _gl.SYNC_GPU_COMMANDS_COMPLETE, 0 );
+
+					_gl.flush();
+
+					await probeAsync( _gl, sync, 4 );
+
+					// read the data and delete the buffer
+					_gl.bindBuffer( _gl.PIXEL_PACK_BUFFER, glBuffer );
+					_gl.getBufferSubData( _gl.PIXEL_PACK_BUFFER, 0, buffer );
+					_gl.bindBuffer( _gl.PIXEL_PACK_BUFFER, null );
+					_gl.deleteBuffer( glBuffer );
+					_gl.deleteSync( sync );
+
+					return buffer;
+
+				} else {
+
+					throw new Error( 'THREE.WebGLRenderer.readRenderTargetPixelsAsync: requested read bounds are out of range.' );
+
+				}
+
+			}
+
+		};
+
+		/**
+		 * Copies pixels from the current bound framebuffer into the given texture.
+		 *
+		 * @param {FramebufferTexture} texture - The texture.
+		 * @param {?Vector2} [position=null] - The start position of the copy operation.
+		 * @param {number} [level=0] - The mip level. The default represents the base mip.
+		 */
+		this.copyFramebufferToTexture = function ( texture, position = null, level = 0 ) {
+
+			const levelScale = Math.pow( 2, - level );
+			const width = Math.floor( texture.image.width * levelScale );
+			const height = Math.floor( texture.image.height * levelScale );
+
+			const x = position !== null ? position.x : 0;
+			const y = position !== null ? position.y : 0;
+
+			textures.setTexture2D( texture, 0 );
+
+			_gl.copyTexSubImage2D( _gl.TEXTURE_2D, level, 0, 0, x, y, width, height );
+
+			state.unbindTexture();
+
+		};
+
+
+		/**
+		 * Copies data of the given source texture into a destination texture.
+		 *
+		 * When using render target textures as `srcTexture` and `dstTexture`, you must make sure both render targets are initialized
+		 * {@link WebGLRenderer#initRenderTarget}.
+		 *
+		 * @param {Texture} srcTexture - The source texture.
+		 * @param {Texture} dstTexture - The destination texture.
+		 * @param {?(Box2|Box3)} [srcRegion=null] - A bounding box which describes the source region. Can be two or three-dimensional.
+		 * @param {?(Vector2|Vector3)} [dstPosition=null] - A vector that represents the origin of the destination region. Can be two or three-dimensional.
+		 * @param {number} [srcLevel=0] - The source mipmap level to copy.
+		 * @param {?number} [dstLevel=0] - The destination mipmap level.
+		 */
+		this.copyTextureToTexture = function ( srcTexture, dstTexture, srcRegion = null, dstPosition = null, srcLevel = 0, dstLevel = 0 ) {
+
+			// gather the necessary dimensions to copy
+			let width, height, depth, minX, minY, minZ;
+			let dstX, dstY, dstZ;
+			const image = srcTexture.isCompressedTexture ? srcTexture.mipmaps[ dstLevel ] : srcTexture.image;
+			if ( srcRegion !== null ) {
+
+				width = srcRegion.max.x - srcRegion.min.x;
+				height = srcRegion.max.y - srcRegion.min.y;
+				depth = srcRegion.isBox3 ? srcRegion.max.z - srcRegion.min.z : 1;
+				minX = srcRegion.min.x;
+				minY = srcRegion.min.y;
+				minZ = srcRegion.isBox3 ? srcRegion.min.z : 0;
+
+			} else {
+
+				const levelScale = Math.pow( 2, - srcLevel );
+				width = Math.floor( image.width * levelScale );
+				height = Math.floor( image.height * levelScale );
+				if ( srcTexture.isDataArrayTexture ) {
+
+					depth = image.depth;
+
+				} else if ( srcTexture.isData3DTexture ) {
+
+					depth = Math.floor( image.depth * levelScale );
+
+				} else {
+
+					depth = 1;
+
+				}
+
+				minX = 0;
+				minY = 0;
+				minZ = 0;
+
+			}
+
+			if ( dstPosition !== null ) {
+
+				dstX = dstPosition.x;
+				dstY = dstPosition.y;
+				dstZ = dstPosition.z;
+
+			} else {
+
+				dstX = 0;
+				dstY = 0;
+				dstZ = 0;
+
+			}
+
+			// Set up the destination target
+			const glFormat = utils.convert( dstTexture.format );
+			const glType = utils.convert( dstTexture.type );
+			let glTarget;
+
+			if ( dstTexture.isData3DTexture ) {
+
+				textures.setTexture3D( dstTexture, 0 );
+				glTarget = _gl.TEXTURE_3D;
+
+			} else if ( dstTexture.isDataArrayTexture || dstTexture.isCompressedArrayTexture ) {
+
+				textures.setTexture2DArray( dstTexture, 0 );
+				glTarget = _gl.TEXTURE_2D_ARRAY;
+
+			} else {
+
+				textures.setTexture2D( dstTexture, 0 );
+				glTarget = _gl.TEXTURE_2D;
+
+			}
+
+			state.activeTexture( _gl.TEXTURE0 ); // see #33153
+
+			state.pixelStorei( _gl.UNPACK_FLIP_Y_WEBGL, dstTexture.flipY );
+			state.pixelStorei( _gl.UNPACK_PREMULTIPLY_ALPHA_WEBGL, dstTexture.premultiplyAlpha );
+			state.pixelStorei( _gl.UNPACK_ALIGNMENT, dstTexture.unpackAlignment );
+
+			// used for copying data from cpu
+			const currentUnpackRowLen = state.getParameter( _gl.UNPACK_ROW_LENGTH );
+			const currentUnpackImageHeight = state.getParameter( _gl.UNPACK_IMAGE_HEIGHT );
+			const currentUnpackSkipPixels = state.getParameter( _gl.UNPACK_SKIP_PIXELS );
+			const currentUnpackSkipRows = state.getParameter( _gl.UNPACK_SKIP_ROWS );
+			const currentUnpackSkipImages = state.getParameter( _gl.UNPACK_SKIP_IMAGES );
+
+			state.pixelStorei( _gl.UNPACK_ROW_LENGTH, image.width );
+			state.pixelStorei( _gl.UNPACK_IMAGE_HEIGHT, image.height );
+			state.pixelStorei( _gl.UNPACK_SKIP_PIXELS, minX );
+			state.pixelStorei( _gl.UNPACK_SKIP_ROWS, minY );
+			state.pixelStorei( _gl.UNPACK_SKIP_IMAGES, minZ );
+
+			// set up the src texture
+			const isSrc3D = srcTexture.isDataArrayTexture || srcTexture.isData3DTexture;
+			const isDst3D = dstTexture.isDataArrayTexture || dstTexture.isData3DTexture;
+			if ( srcTexture.isDepthTexture ) {
+
+				const srcTextureProperties = properties.get( srcTexture );
+				const dstTextureProperties = properties.get( dstTexture );
+				const srcRenderTargetProperties = properties.get( srcTextureProperties.__renderTarget );
+				const dstRenderTargetProperties = properties.get( dstTextureProperties.__renderTarget );
+				state.bindFramebuffer( _gl.READ_FRAMEBUFFER, srcRenderTargetProperties.__webglFramebuffer );
+				state.bindFramebuffer( _gl.DRAW_FRAMEBUFFER, dstRenderTargetProperties.__webglFramebuffer );
+
+				for ( let i = 0; i < depth; i ++ ) {
+
+					// if the source or destination are a 3d target then a layer needs to be bound
+					if ( isSrc3D ) {
+
+						_gl.framebufferTextureLayer( _gl.READ_FRAMEBUFFER, _gl.COLOR_ATTACHMENT0, properties.get( srcTexture ).__webglTexture, srcLevel, minZ + i );
+						_gl.framebufferTextureLayer( _gl.DRAW_FRAMEBUFFER, _gl.COLOR_ATTACHMENT0, properties.get( dstTexture ).__webglTexture, dstLevel, dstZ + i );
+
+					}
+
+					_gl.blitFramebuffer( minX, minY, width, height, dstX, dstY, width, height, _gl.DEPTH_BUFFER_BIT, _gl.NEAREST );
+
+				}
+
+				state.bindFramebuffer( _gl.READ_FRAMEBUFFER, null );
+				state.bindFramebuffer( _gl.DRAW_FRAMEBUFFER, null );
+
+			} else if ( srcLevel !== 0 || srcTexture.isRenderTargetTexture || properties.has( srcTexture ) ) {
+
+				// get the appropriate frame buffers
+				const srcTextureProperties = properties.get( srcTexture );
+				const dstTextureProperties = properties.get( dstTexture );
+
+				// bind the frame buffer targets
+				state.bindFramebuffer( _gl.READ_FRAMEBUFFER, _srcFramebuffer );
+				state.bindFramebuffer( _gl.DRAW_FRAMEBUFFER, _dstFramebuffer );
+
+				for ( let i = 0; i < depth; i ++ ) {
+
+					// assign the correct layers and mip maps to the frame buffers
+					if ( isSrc3D ) {
+
+						_gl.framebufferTextureLayer( _gl.READ_FRAMEBUFFER, _gl.COLOR_ATTACHMENT0, srcTextureProperties.__webglTexture, srcLevel, minZ + i );
+
+					} else {
+
+						_gl.framebufferTexture2D( _gl.READ_FRAMEBUFFER, _gl.COLOR_ATTACHMENT0, _gl.TEXTURE_2D, srcTextureProperties.__webglTexture, srcLevel );
+
+					}
+
+					if ( isDst3D ) {
+
+						_gl.framebufferTextureLayer( _gl.DRAW_FRAMEBUFFER, _gl.COLOR_ATTACHMENT0, dstTextureProperties.__webglTexture, dstLevel, dstZ + i );
+
+					} else {
+
+						_gl.framebufferTexture2D( _gl.DRAW_FRAMEBUFFER, _gl.COLOR_ATTACHMENT0, _gl.TEXTURE_2D, dstTextureProperties.__webglTexture, dstLevel );
+
+					}
+
+					// copy the data using the fastest function that can achieve the copy
+					if ( srcLevel !== 0 ) {
+
+						_gl.blitFramebuffer( minX, minY, width, height, dstX, dstY, width, height, _gl.COLOR_BUFFER_BIT, _gl.NEAREST );
+
+					} else if ( isDst3D ) {
+
+						_gl.copyTexSubImage3D( glTarget, dstLevel, dstX, dstY, dstZ + i, minX, minY, width, height );
+
+					} else {
+
+						_gl.copyTexSubImage2D( glTarget, dstLevel, dstX, dstY, minX, minY, width, height );
+
+					}
+
+				}
+
+				// unbind read, draw buffers
+				state.bindFramebuffer( _gl.READ_FRAMEBUFFER, null );
+				state.bindFramebuffer( _gl.DRAW_FRAMEBUFFER, null );
+
+			} else {
+
+				if ( isDst3D ) {
+
+					// copy data into the 3d texture
+					if ( srcTexture.isDataTexture || srcTexture.isData3DTexture ) {
+
+						_gl.texSubImage3D( glTarget, dstLevel, dstX, dstY, dstZ, width, height, depth, glFormat, glType, image.data );
+
+					} else if ( dstTexture.isCompressedArrayTexture ) {
+
+						_gl.compressedTexSubImage3D( glTarget, dstLevel, dstX, dstY, dstZ, width, height, depth, glFormat, image.data );
+
+					} else {
+
+						_gl.texSubImage3D( glTarget, dstLevel, dstX, dstY, dstZ, width, height, depth, glFormat, glType, image );
+
+					}
+
+				} else {
+
+					// copy data into the 2d texture
+					if ( srcTexture.isDataTexture ) {
+
+						_gl.texSubImage2D( _gl.TEXTURE_2D, dstLevel, dstX, dstY, width, height, glFormat, glType, image.data );
+
+					} else if ( srcTexture.isCompressedTexture ) {
+
+						_gl.compressedTexSubImage2D( _gl.TEXTURE_2D, dstLevel, dstX, dstY, image.width, image.height, glFormat, image.data );
+
+					} else {
+
+						_gl.texSubImage2D( _gl.TEXTURE_2D, dstLevel, dstX, dstY, width, height, glFormat, glType, image );
+
+					}
+
+				}
+
+			}
+
+			// reset values
+			state.pixelStorei( _gl.UNPACK_ROW_LENGTH, currentUnpackRowLen );
+			state.pixelStorei( _gl.UNPACK_IMAGE_HEIGHT, currentUnpackImageHeight );
+			state.pixelStorei( _gl.UNPACK_SKIP_PIXELS, currentUnpackSkipPixels );
+			state.pixelStorei( _gl.UNPACK_SKIP_ROWS, currentUnpackSkipRows );
+			state.pixelStorei( _gl.UNPACK_SKIP_IMAGES, currentUnpackSkipImages );
+
+			// Generate mipmaps only when copying level 0
+			if ( dstLevel === 0 && dstTexture.generateMipmaps ) {
+
+				_gl.generateMipmap( glTarget );
+
+			}
+
+			state.unbindTexture();
+
+		};
+
+		/**
+		 * Initializes the given WebGLRenderTarget memory. Useful for initializing a render target so data
+		 * can be copied into it using {@link WebGLRenderer#copyTextureToTexture} before it has been
+		 * rendered to.
+		 *
+		 * @param {WebGLRenderTarget} target - The render target.
+		 */
+		this.initRenderTarget = function ( target ) {
+
+			if ( properties.get( target ).__webglFramebuffer === undefined ) {
+
+				textures.setupRenderTarget( target );
+
+			}
+
+		};
+
+		/**
+		 * Initializes the given texture. Useful for preloading a texture rather than waiting until first
+		 * render (which can cause noticeable lags due to decode and GPU upload overhead).
+		 *
+		 * @param {Texture} texture - The texture.
+		 */
+		this.initTexture = function ( texture ) {
+
+			if ( texture.isCubeTexture ) {
+
+				textures.setTextureCube( texture, 0 );
+
+			} else if ( texture.isData3DTexture ) {
+
+				textures.setTexture3D( texture, 0 );
+
+			} else if ( texture.isDataArrayTexture || texture.isCompressedArrayTexture ) {
+
+				textures.setTexture2DArray( texture, 0 );
+
+			} else {
+
+				textures.setTexture2D( texture, 0 );
+
+			}
+
+			state.unbindTexture();
+
+		};
+
+		/**
+		 * Can be used to reset the internal WebGL state. This method is mostly
+		 * relevant for applications which share a single WebGL context across
+		 * multiple WebGL libraries.
+		 */
+		this.resetState = function () {
+
+			_currentActiveCubeFace = 0;
+			_currentActiveMipmapLevel = 0;
+			_currentRenderTarget = null;
+
+			state.reset();
+			bindingStates.reset();
+
+		};
+
+		if ( typeof __THREE_DEVTOOLS__ !== 'undefined' ) {
+
+			__THREE_DEVTOOLS__.dispatchEvent( new CustomEvent( 'observe', { detail: this } ) );
+
+		}
+
+	}
+
+	/**
+	 * Defines the coordinate system of the renderer.
+	 *
+	 * In `WebGLRenderer`, the value is always `WebGLCoordinateSystem`.
+	 *
+	 * @type {WebGLCoordinateSystem|WebGPUCoordinateSystem}
+	 * @default WebGLCoordinateSystem
+	 * @readonly
+	 */
+	get coordinateSystem() {
+
+		return WebGLCoordinateSystem;
+
+	}
+
+	/**
+	 * Defines the output color space of the renderer.
+	 *
+	 * @type {SRGBColorSpace|LinearSRGBColorSpace}
+	 * @default SRGBColorSpace
+	 */
+	get outputColorSpace() {
+
+		return this._outputColorSpace;
+
+	}
+
+	set outputColorSpace( colorSpace ) {
+
+		this._outputColorSpace = colorSpace;
+
+		const gl = this.getContext();
+		gl.drawingBufferColorSpace = ColorManagement._getDrawingBufferColorSpace( colorSpace );
+		gl.unpackColorSpace = ColorManagement._getUnpackColorSpace();
+
+	}
+
+}
+
+export { ACESFilmicToneMapping, AddEquation, AddOperation, AdditiveBlending, AgXToneMapping, AlphaFormat, AlwaysCompare, AlwaysDepth, ArrayCamera, BackSide, BoxGeometry, BufferAttribute, BufferGeometry, ByteType, CineonToneMapping, ClampToEdgeWrapping, Color, ColorManagement, ConstantAlphaFactor, ConstantColorFactor, CubeCamera, CubeDepthTexture, CubeReflectionMapping, CubeRefractionMapping, CubeTexture, CubeUVReflectionMapping, CullFaceBack, CullFaceFront, CullFaceNone, CustomBlending, CustomToneMapping, Data3DTexture, DataArrayTexture, DataTexture, DepthFormat, DepthStencilFormat, DepthTexture, DoubleSide, DstAlphaFactor, DstColorFactor, EqualCompare, EqualDepth, EquirectangularReflectionMapping, EquirectangularRefractionMapping, EventDispatcher, ExternalTexture, Float32BufferAttribute, FloatType, FrontSide, Frustum, GLSL3, GreaterCompare, GreaterDepth, GreaterEqualCompare, GreaterEqualDepth, HalfFloatType, IntType, Layers, LessCompare, LessDepth, LessEqualCompare, LessEqualDepth, LinearFilter, LinearMipmapLinearFilter, LinearMipmapNearestFilter, LinearSRGBColorSpace, LinearToneMapping, LinearTransfer, Matrix3, Matrix4, MaxEquation, Mesh, MeshBasicMaterial, MeshDepthMaterial, MeshDistanceMaterial, MinEquation, MirroredRepeatWrapping, MixOperation, MultiplyBlending, MultiplyOperation, NearestFilter, NearestMipmapLinearFilter, NearestMipmapNearestFilter, NeutralToneMapping, NeverCompare, NeverDepth, NoBlending, NoColorSpace, NoToneMapping, NormalBlending, NotEqualCompare, NotEqualDepth, ObjectSpaceNormalMap, OneFactor, OneMinusConstantAlphaFactor, OneMinusConstantColorFactor, OneMinusDstAlphaFactor, OneMinusDstColorFactor, OneMinusSrcAlphaFactor, OneMinusSrcColorFactor, OrthographicCamera, PCFShadowMap, PCFSoftShadowMap, PMREMGenerator, PerspectiveCamera, Plane, PlaneGeometry, R11_EAC_Format, RED_GREEN_RGTC2_Format, RED_RGTC1_Format, REVISION, RG11_EAC_Format, RGBAFormat, RGBAIntegerFormat, RGBA_ASTC_10x10_Format, RGBA_ASTC_10x5_Format, RGBA_ASTC_10x6_Format, RGBA_ASTC_10x8_Format, RGBA_ASTC_12x10_Format, RGBA_ASTC_12x12_Format, RGBA_ASTC_4x4_Format, RGBA_ASTC_5x4_Format, RGBA_ASTC_5x5_Format, RGBA_ASTC_6x5_Format, RGBA_ASTC_6x6_Format, RGBA_ASTC_8x5_Format, RGBA_ASTC_8x6_Format, RGBA_ASTC_8x8_Format, RGBA_BPTC_Format, RGBA_ETC2_EAC_Format, RGBA_PVRTC_2BPPV1_Format, RGBA_PVRTC_4BPPV1_Format, RGBA_S3TC_DXT1_Format, RGBA_S3TC_DXT3_Format, RGBA_S3TC_DXT5_Format, RGBFormat, RGB_BPTC_SIGNED_Format, RGB_BPTC_UNSIGNED_Format, RGB_ETC1_Format, RGB_ETC2_Format, RGB_PVRTC_2BPPV1_Format, RGB_PVRTC_4BPPV1_Format, RGB_S3TC_DXT1_Format, RGFormat, RGIntegerFormat, RawShaderMaterial, RedFormat, RedIntegerFormat, ReinhardToneMapping, RepeatWrapping, ReverseSubtractEquation, SIGNED_R11_EAC_Format, SIGNED_RED_GREEN_RGTC2_Format, SIGNED_RED_RGTC1_Format, SIGNED_RG11_EAC_Format, SRGBColorSpace, SRGBTransfer, ShaderChunk, ShaderLib, ShaderMaterial, ShortType, SrcAlphaFactor, SrcAlphaSaturateFactor, SrcColorFactor, SubtractEquation, SubtractiveBlending, TangentSpaceNormalMap, Texture, Uint16BufferAttribute, Uint32BufferAttribute, UniformsLib, UniformsUtils, UnsignedByteType, UnsignedInt101111Type, UnsignedInt248Type, UnsignedInt5999Type, UnsignedIntType, UnsignedShort4444Type, UnsignedShort5551Type, UnsignedShortType, VSMShadowMap, Vector2, Vector3, Vector4, WebGLCoordinateSystem, WebGLCubeRenderTarget, WebGLRenderTarget, WebGLRenderer, WebGLUtils, WebXRController, ZeroFactor, createCanvasElement, error, log, warn, warnOnce };
diff --git a/assets/three/three.core.js b/assets/three/three.core.js
new file mode 100644
index 00000000000..0a1d6cb9ef3
--- /dev/null
+++ b/assets/three/three.core.js
@@ -0,0 +1,60586 @@
+/**
+ * @license
+ * Copyright 2010-2026 Three.js Authors
+ * SPDX-License-Identifier: MIT
+ */
+const REVISION = '186';
+
+/**
+ * Represents mouse buttons and interaction types in context of controls.
+ *
+ * @type {ConstantsMouse}
+ * @constant
+ */
+const MOUSE = { LEFT: 0, MIDDLE: 1, RIGHT: 2, ROTATE: 0, DOLLY: 1, PAN: 2 };
+
+/**
+ * Represents touch interaction types in context of controls.
+ *
+ * @type {ConstantsTouch}
+ * @constant
+ */
+const TOUCH = { ROTATE: 0, PAN: 1, DOLLY_PAN: 2, DOLLY_ROTATE: 3 };
+
+/**
+ * Disables face culling.
+ *
+ * @type {number}
+ * @constant
+ */
+const CullFaceNone = 0;
+
+/**
+ * Culls back faces.
+ *
+ * @type {number}
+ * @constant
+ */
+const CullFaceBack = 1;
+
+/**
+ * Culls front faces.
+ *
+ * @type {number}
+ * @constant
+ */
+const CullFaceFront = 2;
+
+/**
+ * Culls both front and back faces.
+ *
+ * @type {number}
+ * @constant
+ */
+const CullFaceFrontBack = 3;
+
+/**
+ * Gives unfiltered shadow maps - fastest, but lowest quality.
+ *
+ * @type {number}
+ * @constant
+ */
+const BasicShadowMap = 0;
+
+/**
+ * Filters shadow maps using the Percentage-Closer Filtering (PCF) algorithm.
+ *
+ * @type {number}
+ * @constant
+ */
+const PCFShadowMap = 1;
+
+/**
+ * Filters shadow maps using the Percentage-Closer Filtering (PCF) algorithm with
+ * better soft shadows especially when using low-resolution shadow maps.
+ *
+ * @type {number}
+ * @constant
+ * @deprecated since r186. Use `PCFShadowMap` instead.
+ */
+const PCFSoftShadowMap = 2;
+
+/**
+ * Filters shadow maps using the Variance Shadow Map (VSM) algorithm.
+ * When using VSMShadowMap all shadow receivers will also cast shadows.
+ *
+ * @type {number}
+ * @constant
+ */
+const VSMShadowMap = 3;
+
+/**
+ * Only front faces are rendered.
+ *
+ * @type {number}
+ * @constant
+ */
+const FrontSide = 0;
+
+/**
+ * Only back faces are rendered.
+ *
+ * @type {number}
+ * @constant
+ */
+const BackSide = 1;
+
+/**
+ * Both front and back faces are rendered.
+ *
+ * @type {number}
+ * @constant
+ */
+const DoubleSide = 2;
+
+/**
+ * No blending is performed which effectively disables
+ * alpha transparency.
+ *
+ * @type {number}
+ * @constant
+ */
+const NoBlending = 0;
+
+/**
+ * The default blending.
+ *
+ * @type {number}
+ * @constant
+ */
+const NormalBlending = 1;
+
+/**
+ * Represents additive blending.
+ *
+ * @type {number}
+ * @constant
+ */
+const AdditiveBlending = 2;
+
+/**
+ * Represents subtractive blending.
+ *
+ * @type {number}
+ * @constant
+ */
+const SubtractiveBlending = 3;
+
+/**
+ * Represents multiply blending.
+ *
+ * @type {number}
+ * @constant
+ */
+const MultiplyBlending = 4;
+
+/**
+ * Represents custom blending.
+ *
+ * @type {number}
+ * @constant
+ */
+const CustomBlending = 5;
+
+/**
+ * Represents material blending.
+ *
+ * @type {number}
+ * @constant
+ */
+const MaterialBlending = 6;
+
+/**
+ * A `source + destination` blending equation.
+ *
+ * @type {number}
+ * @constant
+ */
+const AddEquation = 100;
+
+/**
+ * A `source - destination` blending equation.
+ *
+ * @type {number}
+ * @constant
+ */
+const SubtractEquation = 101;
+
+/**
+ * A `destination - source` blending equation.
+ *
+ * @type {number}
+ * @constant
+ */
+const ReverseSubtractEquation = 102;
+
+/**
+ * A blend equation that uses the minimum of source and destination.
+ *
+ * @type {number}
+ * @constant
+ */
+const MinEquation = 103;
+
+/**
+ * A blend equation that uses the maximum of source and destination.
+ *
+ * @type {number}
+ * @constant
+ */
+const MaxEquation = 104;
+
+/**
+ * Multiplies all colors by `0`.
+ *
+ * @type {number}
+ * @constant
+ */
+const ZeroFactor = 200;
+
+/**
+ * Multiplies all colors by `1`.
+ *
+ * @type {number}
+ * @constant
+ */
+const OneFactor = 201;
+
+/**
+ * Multiplies all colors by the source colors.
+ *
+ * @type {number}
+ * @constant
+ */
+const SrcColorFactor = 202;
+
+/**
+ * Multiplies all colors by `1` minus each source color.
+ *
+ * @type {number}
+ * @constant
+ */
+const OneMinusSrcColorFactor = 203;
+
+/**
+ * Multiplies all colors by the source alpha value.
+ *
+ * @type {number}
+ * @constant
+ */
+const SrcAlphaFactor = 204;
+
+/**
+ * Multiplies all colors by 1 minus the source alpha value.
+ *
+ * @type {number}
+ * @constant
+ */
+const OneMinusSrcAlphaFactor = 205;
+
+/**
+ * Multiplies all colors by the destination alpha value.
+ *
+ * @type {number}
+ * @constant
+ */
+const DstAlphaFactor = 206;
+
+/**
+ * Multiplies all colors by `1` minus the destination alpha value.
+ *
+ * @type {number}
+ * @constant
+ */
+const OneMinusDstAlphaFactor = 207;
+
+/**
+ * Multiplies all colors by the destination color.
+ *
+ * @type {number}
+ * @constant
+ */
+const DstColorFactor = 208;
+
+/**
+ * Multiplies all colors by `1` minus each destination color.
+ *
+ * @type {number}
+ * @constant
+ */
+const OneMinusDstColorFactor = 209;
+
+/**
+ * Multiplies the RGB colors by the smaller of either the source alpha
+ * value or the value of `1` minus the destination alpha value. The alpha
+ * value is multiplied by `1`.
+ *
+ * @type {number}
+ * @constant
+ */
+const SrcAlphaSaturateFactor = 210;
+
+/**
+ * Multiplies all colors by a constant color.
+ *
+ * @type {number}
+ * @constant
+ */
+const ConstantColorFactor = 211;
+
+/**
+ * Multiplies all colors by `1` minus a constant color.
+ *
+ * @type {number}
+ * @constant
+ */
+const OneMinusConstantColorFactor = 212;
+
+/**
+ * Multiplies all colors by a constant alpha value.
+ *
+ * @type {number}
+ * @constant
+ */
+const ConstantAlphaFactor = 213;
+
+/**
+ * Multiplies all colors by 1 minus a constant alpha value.
+ *
+ * @type {number}
+ * @constant
+ */
+const OneMinusConstantAlphaFactor = 214;
+
+/**
+ * Never pass.
+ *
+ * @type {number}
+ * @constant
+ */
+const NeverDepth = 0;
+
+/**
+ * Always pass.
+ *
+ * @type {number}
+ * @constant
+ */
+const AlwaysDepth = 1;
+
+/**
+ * Pass if the incoming value is less than the depth buffer value.
+ *
+ * @type {number}
+ * @constant
+ */
+const LessDepth = 2;
+
+/**
+ * Pass if the incoming value is less than or equal to the depth buffer value.
+ *
+ * @type {number}
+ * @constant
+ */
+const LessEqualDepth = 3;
+
+/**
+ * Pass if the incoming value equals the depth buffer value.
+ *
+ * @type {number}
+ * @constant
+ */
+const EqualDepth = 4;
+
+/**
+ * Pass if the incoming value is greater than or equal to the depth buffer value.
+ *
+ * @type {number}
+ * @constant
+ */
+const GreaterEqualDepth = 5;
+
+/**
+ * Pass if the incoming value is greater than the depth buffer value.
+ *
+ * @type {number}
+ * @constant
+ */
+const GreaterDepth = 6;
+
+/**
+ * Pass if the incoming value is not equal to the depth buffer value.
+ *
+ * @type {number}
+ * @constant
+ */
+const NotEqualDepth = 7;
+
+/**
+ * Multiplies the environment map color with the surface color.
+ *
+ * @type {number}
+ * @constant
+ */
+const MultiplyOperation = 0;
+
+/**
+ * Uses reflectivity to blend between the two colors.
+ *
+ * @type {number}
+ * @constant
+ */
+const MixOperation = 1;
+
+/**
+ * Adds the two colors.
+ *
+ * @type {number}
+ * @constant
+ */
+const AddOperation = 2;
+
+/**
+ * No tone mapping is applied.
+ *
+ * @type {number}
+ * @constant
+ */
+const NoToneMapping = 0;
+
+/**
+ * Linear tone mapping.
+ *
+ * @type {number}
+ * @constant
+ */
+const LinearToneMapping = 1;
+
+/**
+ * Reinhard tone mapping.
+ *
+ * @type {number}
+ * @constant
+ */
+const ReinhardToneMapping = 2;
+
+/**
+ * Cineon tone mapping.
+ *
+ * @type {number}
+ * @constant
+ */
+const CineonToneMapping = 3;
+
+/**
+ * ACES Filmic tone mapping.
+ *
+ * @type {number}
+ * @constant
+ */
+const ACESFilmicToneMapping = 4;
+
+/**
+ * Custom tone mapping.
+ *
+ * Expects a custom implementation by modifying shader code of the material's fragment shader.
+ *
+ * @type {number}
+ * @constant
+ */
+const CustomToneMapping = 5;
+
+/**
+ * AgX tone mapping.
+ *
+ * @type {number}
+ * @constant
+ */
+const AgXToneMapping = 6;
+
+/**
+ * Neutral tone mapping.
+ *
+ * Implementation based on the Khronos 3D Commerce Group standard tone mapping.
+ *
+ * @type {number}
+ * @constant
+ */
+const NeutralToneMapping = 7;
+
+/**
+ * The skinned mesh shares the same world space as the skeleton.
+ *
+ * @type {string}
+ * @constant
+ */
+const AttachedBindMode = 'attached';
+
+/**
+ * The skinned mesh does not share the same world space as the skeleton.
+ * This is useful when a skeleton is shared across multiple skinned meshes.
+ *
+ * @type {string}
+ * @constant
+ */
+const DetachedBindMode = 'detached';
+
+/**
+ * Maps textures using the geometry's UV coordinates.
+ *
+ * @type {number}
+ * @constant
+ */
+const UVMapping = 300;
+
+/**
+ * Reflection mapping for cube textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const CubeReflectionMapping = 301;
+
+/**
+ * Refraction mapping for cube textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const CubeRefractionMapping = 302;
+
+/**
+ * Reflection mapping for equirectangular textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const EquirectangularReflectionMapping = 303;
+
+/**
+ * Refraction mapping for equirectangular textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const EquirectangularRefractionMapping = 304;
+
+/**
+ * Reflection mapping for PMREM textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const CubeUVReflectionMapping = 306;
+
+/**
+ * The texture will simply repeat to infinity.
+ *
+ * @type {number}
+ * @constant
+ */
+const RepeatWrapping = 1000;
+
+/**
+ * The last pixel of the texture stretches to the edge of the mesh.
+ *
+ * @type {number}
+ * @constant
+ */
+const ClampToEdgeWrapping = 1001;
+
+/**
+ * The texture will repeats to infinity, mirroring on each repeat.
+ *
+ * @type {number}
+ * @constant
+ */
+const MirroredRepeatWrapping = 1002;
+
+/**
+ * Returns the value of the texture element that is nearest (in Manhattan distance)
+ * to the specified texture coordinates.
+ *
+ * @type {number}
+ * @constant
+ */
+const NearestFilter = 1003;
+
+/**
+ * Chooses the mipmap that most closely matches the size of the pixel being textured
+ * and uses the `NearestFilter` criterion (the texel nearest to the center of the pixel)
+ * to produce a texture value.
+ *
+ * @type {number}
+ * @constant
+ */
+const NearestMipmapNearestFilter = 1004;
+const NearestMipMapNearestFilter = 1004; // legacy
+
+/**
+ * Chooses the two mipmaps that most closely match the size of the pixel being textured and
+ * uses the `NearestFilter` criterion to produce a texture value from each mipmap.
+ * The final texture value is a weighted average of those two values.
+ *
+ * @type {number}
+ * @constant
+ */
+const NearestMipmapLinearFilter = 1005;
+const NearestMipMapLinearFilter = 1005; // legacy
+
+/**
+ * Returns the weighted average of the four texture elements that are closest to the specified
+ * texture coordinates, and can include items wrapped or repeated from other parts of a texture,
+ * depending on the values of `wrapS` and `wrapT`, and on the exact mapping.
+ *
+ * @type {number}
+ * @constant
+ */
+const LinearFilter = 1006;
+
+/**
+ * Chooses the mipmap that most closely matches the size of the pixel being textured and uses
+ * the `LinearFilter` criterion (a weighted average of the four texels that are closest to the
+ * center of the pixel) to produce a texture value.
+ *
+ * @type {number}
+ * @constant
+ */
+const LinearMipmapNearestFilter = 1007;
+const LinearMipMapNearestFilter = 1007; // legacy
+
+/**
+ * Chooses the two mipmaps that most closely match the size of the pixel being textured and uses
+ * the `LinearFilter` criterion to produce a texture value from each mipmap. The final texture value
+ * is a weighted average of those two values.
+ *
+ * @type {number}
+ * @constant
+ */
+const LinearMipmapLinearFilter = 1008;
+const LinearMipMapLinearFilter = 1008; // legacy
+
+/**
+ * An unsigned byte data type for textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const UnsignedByteType = 1009;
+
+/**
+ * A byte data type for textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const ByteType = 1010;
+
+/**
+ * A short data type for textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const ShortType = 1011;
+
+/**
+ * An unsigned short data type for textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const UnsignedShortType = 1012;
+
+/**
+ * An int data type for textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const IntType = 1013;
+
+/**
+ * An unsigned int data type for textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const UnsignedIntType = 1014;
+
+/**
+ * A float data type for textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const FloatType = 1015;
+
+/**
+ * A half float data type for textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const HalfFloatType = 1016;
+
+/**
+ * An unsigned short 4_4_4_4 (packed) data type for textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const UnsignedShort4444Type = 1017;
+
+/**
+ * An unsigned short 5_5_5_1 (packed) data type for textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const UnsignedShort5551Type = 1018;
+
+/**
+ * An unsigned int 24_8 data type for textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const UnsignedInt248Type = 1020;
+
+/**
+ * An unsigned int 5_9_9_9 (packed) data type for textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const UnsignedInt5999Type = 35902;
+
+/**
+ * An unsigned int 10_11_11 (packed) data type for textures.
+ *
+ * @type {number}
+ * @constant
+ */
+const UnsignedInt101111Type = 35899;
+
+/**
+ * Discards the red, green and blue components and reads just the alpha component.
+ *
+ * @type {number}
+ * @constant
+ */
+const AlphaFormat = 1021;
+
+/**
+ * Discards the alpha component and reads the red, green and blue component.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBFormat = 1022;
+
+/**
+ * Reads the red, green, blue and alpha components.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBAFormat = 1023;
+
+/**
+ * Reads each element as a single depth value, converts it to floating point, and clamps to the range `[0,1]`.
+ *
+ * @type {number}
+ * @constant
+ */
+const DepthFormat = 1026;
+
+/**
+ * Reads each element is a pair of depth and stencil values. The depth component of the pair is interpreted as
+ * in `DepthFormat`. The stencil component is interpreted based on the depth + stencil internal format.
+ *
+ * @type {number}
+ * @constant
+ */
+const DepthStencilFormat = 1027;
+
+/**
+ * Discards the green, blue and alpha components and reads just the red component.
+ *
+ * @type {number}
+ * @constant
+ */
+const RedFormat = 1028;
+
+/**
+ * Discards the green, blue and alpha components and reads just the red component. The texels are read as integers instead of floating point.
+ *
+ * @type {number}
+ * @constant
+ */
+const RedIntegerFormat = 1029;
+
+/**
+ * Discards the alpha, and blue components and reads the red, and green components.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGFormat = 1030;
+
+/**
+ * Discards the alpha, and blue components and reads the red, and green components. The texels are read as integers instead of floating point.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGIntegerFormat = 1031;
+
+/**
+ * Discards the alpha component and reads the red, green and blue component. The texels are read as integers instead of floating point.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBIntegerFormat = 1032;
+
+/**
+ * Reads the red, green, blue and alpha components. The texels are read as integers instead of floating point.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBAIntegerFormat = 1033;
+
+/**
+ * A DXT1-compressed image in an RGB image format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGB_S3TC_DXT1_Format = 33776;
+
+/**
+ * A DXT1-compressed image in an RGB image format with a simple on/off alpha value.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_S3TC_DXT1_Format = 33777;
+
+/**
+ * A DXT3-compressed image in an RGBA image format. Compared to a 32-bit RGBA texture, it offers 4:1 compression.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_S3TC_DXT3_Format = 33778;
+
+/**
+ * A DXT5-compressed image in an RGBA image format. It also provides a 4:1 compression, but differs to the DXT3
+ * compression in how the alpha compression is done.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_S3TC_DXT5_Format = 33779;
+
+/**
+ * PVRTC RGB compression in 4-bit mode. One block for each 4×4 pixels.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGB_PVRTC_4BPPV1_Format = 35840;
+
+/**
+ * PVRTC RGB compression in 2-bit mode. One block for each 8×4 pixels.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGB_PVRTC_2BPPV1_Format = 35841;
+
+/**
+ * PVRTC RGBA compression in 4-bit mode. One block for each 4×4 pixels.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_PVRTC_4BPPV1_Format = 35842;
+
+/**
+ * PVRTC RGBA compression in 2-bit mode. One block for each 8×4 pixels.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_PVRTC_2BPPV1_Format = 35843;
+
+/**
+ * ETC1 RGB format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGB_ETC1_Format = 36196;
+
+/**
+ * ETC2 RGB format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGB_ETC2_Format = 37492;
+
+/**
+ * ETC2 RGBA format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ETC2_EAC_Format = 37496;
+
+/**
+ * EAC R11 UNORM format.
+ *
+ * @type {number}
+ * @constant
+ */
+const R11_EAC_Format = 37488; // 0x9270
+
+/**
+ * EAC R11 SNORM format.
+ *
+ * @type {number}
+ * @constant
+ */
+const SIGNED_R11_EAC_Format = 37489; // 0x9271
+
+/**
+ * EAC RG11 UNORM format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RG11_EAC_Format = 37490; // 0x9272
+
+/**
+ * EAC RG11 SNORM format.
+ *
+ * @type {number}
+ * @constant
+ */
+const SIGNED_RG11_EAC_Format = 37491; // 0x9273
+
+/**
+ * ASTC RGBA 4x4 format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ASTC_4x4_Format = 37808;
+
+/**
+ * ASTC RGBA 5x4 format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ASTC_5x4_Format = 37809;
+
+/**
+ * ASTC RGBA 5x5 format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ASTC_5x5_Format = 37810;
+
+/**
+ * ASTC RGBA 6x5 format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ASTC_6x5_Format = 37811;
+
+/**
+ * ASTC RGBA 6x6 format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ASTC_6x6_Format = 37812;
+
+/**
+ * ASTC RGBA 8x5 format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ASTC_8x5_Format = 37813;
+
+/**
+ * ASTC RGBA 8x6 format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ASTC_8x6_Format = 37814;
+
+/**
+ * ASTC RGBA 8x8 format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ASTC_8x8_Format = 37815;
+
+/**
+ * ASTC RGBA 10x5 format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ASTC_10x5_Format = 37816;
+
+/**
+ * ASTC RGBA 10x6 format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ASTC_10x6_Format = 37817;
+
+/**
+ * ASTC RGBA 10x8 format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ASTC_10x8_Format = 37818;
+
+/**
+ * ASTC RGBA 10x10 format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ASTC_10x10_Format = 37819;
+
+/**
+ * ASTC RGBA 12x10 format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ASTC_12x10_Format = 37820;
+
+/**
+ * ASTC RGBA 12x12 format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_ASTC_12x12_Format = 37821;
+
+/**
+ * BPTC RGBA format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBA_BPTC_Format = 36492;
+
+/**
+ * BPTC Signed RGB format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGB_BPTC_SIGNED_Format = 36494;
+
+/**
+ * BPTC Unsigned RGB format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGB_BPTC_UNSIGNED_Format = 36495;
+
+/**
+ * RGTC1 Red format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RED_RGTC1_Format = 36283;
+
+/**
+ * RGTC1 Signed Red format.
+ *
+ * @type {number}
+ * @constant
+ */
+const SIGNED_RED_RGTC1_Format = 36284;
+
+/**
+ * RGTC2 Red Green format.
+ *
+ * @type {number}
+ * @constant
+ */
+const RED_GREEN_RGTC2_Format = 36285;
+
+/**
+ * RGTC2 Signed Red Green format.
+ *
+ * @type {number}
+ * @constant
+ */
+const SIGNED_RED_GREEN_RGTC2_Format = 36286;
+
+/**
+ * Animations are played once.
+ *
+ * @type {number}
+ * @constant
+ */
+const LoopOnce = 2200;
+
+/**
+ * Animations are played with a chosen number of repetitions, each time jumping from
+ * the end of the clip directly to its beginning.
+ *
+ * @type {number}
+ * @constant
+ */
+const LoopRepeat = 2201;
+
+/**
+ * Animations are played with a chosen number of repetitions, alternately playing forward
+ * and backward.
+ *
+ * @type {number}
+ * @constant
+ */
+const LoopPingPong = 2202;
+
+/**
+ * Discrete interpolation mode for keyframe tracks.
+ *
+ * @type {number}
+ * @constant
+ */
+const InterpolateDiscrete = 2300;
+
+/**
+ * Linear interpolation mode for keyframe tracks.
+ *
+ * @type {number}
+ * @constant
+ */
+const InterpolateLinear = 2301;
+
+/**
+ * Smooth interpolation mode for keyframe tracks.
+ *
+ * @type {number}
+ * @constant
+ */
+const InterpolateSmooth = 2302;
+
+/**
+ * Bezier interpolation mode for keyframe tracks.
+ *
+ * Uses cubic Bezier curves with explicit 2D control points.
+ * Requires tangent data to be set on the track.
+ *
+ * @type {number}
+ * @constant
+ */
+const InterpolateBezier = 2303;
+
+/**
+ * Zero curvature ending for animations.
+ *
+ * @type {number}
+ * @constant
+ */
+const ZeroCurvatureEnding = 2400;
+
+/**
+ * Zero slope ending for animations.
+ *
+ * @type {number}
+ * @constant
+ */
+const ZeroSlopeEnding = 2401;
+
+/**
+ * Wrap around ending for animations.
+ *
+ * @type {number}
+ * @constant
+ */
+const WrapAroundEnding = 2402;
+
+/**
+ * Default animation blend mode.
+ *
+ * @type {number}
+ * @constant
+ */
+const NormalAnimationBlendMode = 2500;
+
+/**
+ * Additive animation blend mode. Can be used to layer motions on top of
+ * each other to build complex performances from smaller re-usable assets.
+ *
+ * @type {number}
+ * @constant
+ */
+const AdditiveAnimationBlendMode = 2501;
+
+/**
+ * For every three vertices draw a single triangle.
+ *
+ * @type {number}
+ * @constant
+ */
+const TrianglesDrawMode = 0;
+
+/**
+ * For each vertex draw a triangle from the last three vertices.
+ *
+ * @type {number}
+ * @constant
+ */
+const TriangleStripDrawMode = 1;
+
+/**
+ * For each vertex draw a triangle from the first vertex and the last two vertices.
+ *
+ * @type {number}
+ * @constant
+ */
+const TriangleFanDrawMode = 2;
+
+/**
+ * The depth value is inverted (1.0 - z) for visualization purposes.
+ *
+ * @type {number}
+ * @constant
+ */
+const BasicDepthPacking = 3200;
+
+/**
+ * The depth value is packed into 32 bit RGBA.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBADepthPacking = 3201;
+
+/**
+ * The depth value is packed into 24 bit RGB.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGBDepthPacking = 3202;
+
+/**
+ * The depth value is packed into 16 bit RG.
+ *
+ * @type {number}
+ * @constant
+ */
+const RGDepthPacking = 3203;
+
+/**
+ * Normal information is relative to the underlying surface.
+ *
+ * @type {number}
+ * @constant
+ */
+const TangentSpaceNormalMap = 0;
+
+/**
+ * Normal information is relative to the object orientation.
+ *
+ * @type {number}
+ * @constant
+ */
+const ObjectSpaceNormalMap = 1;
+
+// Color space string identifiers, matching CSS Color Module Level 4 and WebGPU names where available.
+
+/**
+ * No color space.
+ *
+ * @type {string}
+ * @constant
+ */
+const NoColorSpace = '';
+
+/**
+ * sRGB color space.
+ *
+ * @type {string}
+ * @constant
+ */
+const SRGBColorSpace = 'srgb';
+
+/**
+ * sRGB-linear color space.
+ *
+ * @type {string}
+ * @constant
+ */
+const LinearSRGBColorSpace = 'srgb-linear';
+
+/**
+ * Linear transfer function.
+ *
+ * @type {string}
+ * @constant
+ */
+const LinearTransfer = 'linear';
+
+/**
+ * sRGB transfer function.
+ *
+ * @type {string}
+ * @constant
+ */
+const SRGBTransfer = 'srgb';
+
+/**
+ * No normal map packing.
+ *
+ * @type {string}
+ * @constant
+ */
+const NoNormalPacking = '';
+
+/**
+ * Normal RG packing.
+ *
+ * @type {string}
+ * @constant
+ */
+const NormalRGPacking = 'rg';
+
+/**
+ * Normal GA packing.
+ *
+ * @type {string}
+ * @constant
+ */
+const NormalGAPacking = 'ga';
+
+/**
+ * Sets the stencil buffer value to `0`.
+ *
+ * @type {number}
+ * @constant
+ */
+const ZeroStencilOp = 0;
+
+/**
+ * Keeps the current value.
+ *
+ * @type {number}
+ * @constant
+ */
+const KeepStencilOp = 7680;
+
+/**
+ * Sets the stencil buffer value to the specified reference value.
+ *
+ * @type {number}
+ * @constant
+ */
+const ReplaceStencilOp = 7681;
+
+/**
+ * Increments the current stencil buffer value. Clamps to the maximum representable unsigned value.
+ *
+ * @type {number}
+ * @constant
+ */
+const IncrementStencilOp = 7682;
+
+/**
+ * Decrements the current stencil buffer value. Clamps to `0`.
+ *
+ * @type {number}
+ * @constant
+ */
+const DecrementStencilOp = 7683;
+
+/**
+ * Increments the current stencil buffer value. Wraps stencil buffer value to zero when incrementing
+ * the maximum representable unsigned value.
+ *
+ * @type {number}
+ * @constant
+ */
+const IncrementWrapStencilOp = 34055;
+
+/**
+ * Decrements the current stencil buffer value. Wraps stencil buffer value to the maximum representable
+ * unsigned value when decrementing a stencil buffer value of `0`.
+ *
+ * @type {number}
+ * @constant
+ */
+const DecrementWrapStencilOp = 34056;
+
+/**
+ * Inverts the current stencil buffer value bitwise.
+ *
+ * @type {number}
+ * @constant
+ */
+const InvertStencilOp = 5386;
+
+/**
+ * Will never return true.
+ *
+ * @type {number}
+ * @constant
+ */
+const NeverStencilFunc = 512;
+
+/**
+ * Will return true if the stencil reference value is less than the current stencil value.
+ *
+ * @type {number}
+ * @constant
+ */
+const LessStencilFunc = 513;
+
+/**
+ * Will return true if the stencil reference value is equal to the current stencil value.
+ *
+ * @type {number}
+ * @constant
+ */
+const EqualStencilFunc = 514;
+
+/**
+ * Will return true if the stencil reference value is less than or equal to the current stencil value.
+ *
+ * @type {number}
+ * @constant
+ */
+const LessEqualStencilFunc = 515;
+
+/**
+ * Will return true if the stencil reference value is greater than the current stencil value.
+ *
+ * @type {number}
+ * @constant
+ */
+const GreaterStencilFunc = 516;
+
+/**
+ * Will return true if the stencil reference value is not equal to the current stencil value.
+ *
+ * @type {number}
+ * @constant
+ */
+const NotEqualStencilFunc = 517;
+
+/**
+ * Will return true if the stencil reference value is greater than or equal to the current stencil value.
+ *
+ * @type {number}
+ * @constant
+ */
+const GreaterEqualStencilFunc = 518;
+
+/**
+ * Will always return true.
+ *
+ * @type {number}
+ * @constant
+ */
+const AlwaysStencilFunc = 519;
+
+/**
+ * Never pass.
+ *
+ * @type {number}
+ * @constant
+ */
+const NeverCompare = 512;
+
+/**
+ * Pass if the incoming value is less than the texture value.
+ *
+ * @type {number}
+ * @constant
+ */
+const LessCompare = 513;
+
+/**
+ * Pass if the incoming value equals the texture value.
+ *
+ * @type {number}
+ * @constant
+ */
+const EqualCompare = 514;
+
+/**
+ * Pass if the incoming value is less than or equal to the texture value.
+ *
+ * @type {number}
+ * @constant
+ */
+const LessEqualCompare = 515;
+
+/**
+ * Pass if the incoming value is greater than the texture value.
+ *
+ * @type {number}
+ * @constant
+ */
+const GreaterCompare = 516;
+
+/**
+ * Pass if the incoming value is not equal to the texture value.
+ *
+ * @type {number}
+ * @constant
+ */
+const NotEqualCompare = 517;
+
+/**
+ * Pass if the incoming value is greater than or equal to the texture value.
+ *
+ * @type {number}
+ * @constant
+ */
+const GreaterEqualCompare = 518;
+
+/**
+ * Always pass.
+ *
+ * @type {number}
+ * @constant
+ */
+const AlwaysCompare = 519;
+
+/**
+ * The contents are intended to be specified once by the application, and used many
+ * times as the source for drawing and image specification commands.
+ *
+ * @type {number}
+ * @constant
+ */
+const StaticDrawUsage = 35044;
+
+/**
+ * The contents are intended to be respecified repeatedly by the application, and
+ * used many times as the source for drawing and image specification commands.
+ *
+ * @type {number}
+ * @constant
+ */
+const DynamicDrawUsage = 35048;
+
+/**
+ * The contents are intended to be specified once by the application, and used at most
+ * a few times as the source for drawing and image specification commands.
+ *
+ * @type {number}
+ * @constant
+ */
+const StreamDrawUsage = 35040;
+
+/**
+ * The contents are intended to be specified once by reading data from the 3D API, and queried
+ * many times by the application.
+ *
+ * @type {number}
+ * @constant
+ */
+const StaticReadUsage = 35045;
+
+/**
+ * The contents are intended to be respecified repeatedly by reading data from the 3D API, and queried
+ * many times by the application.
+ *
+ * @type {number}
+ * @constant
+ */
+const DynamicReadUsage = 35049;
+
+/**
+ * The contents are intended to be specified once by reading data from the 3D API, and queried at most
+ * a few times by the application
+ *
+ * @type {number}
+ * @constant
+ */
+const StreamReadUsage = 35041;
+
+/**
+ * The contents are intended to be specified once by reading data from the 3D API, and used many times as
+ * the source for WebGL drawing and image specification commands.
+ *
+ * @type {number}
+ * @constant
+ */
+const StaticCopyUsage = 35046;
+
+/**
+ * The contents are intended to be respecified repeatedly by reading data from the 3D API, and used many times
+ * as the source for WebGL drawing and image specification commands.
+ *
+ * @type {number}
+ * @constant
+ */
+const DynamicCopyUsage = 35050;
+
+/**
+ * The contents are intended to be specified once by reading data from the 3D API, and used at most a few times
+ * as the source for WebGL drawing and image specification commands.
+ *
+ * @type {number}
+ * @constant
+ */
+const StreamCopyUsage = 35042;
+
+/**
+ * GLSL 1 shader code.
+ *
+ * @type {string}
+ * @constant
+ */
+const GLSL1 = '100';
+
+/**
+ * GLSL 3 shader code.
+ *
+ * @type {string}
+ * @constant
+ */
+const GLSL3 = '300 es';
+
+/**
+ * WebGL coordinate system.
+ *
+ * @type {number}
+ * @constant
+ */
+const WebGLCoordinateSystem = 2000;
+
+/**
+ * WebGPU coordinate system.
+ *
+ * @type {number}
+ * @constant
+ */
+const WebGPUCoordinateSystem = 2001;
+
+/**
+ * Represents the different timestamp query types.
+ *
+ * @type {ConstantsTimestampQuery}
+ * @constant
+ */
+const TimestampQuery = {
+	COMPUTE: 'compute',
+	RENDER: 'render'
+};
+
+/**
+ * Represents mouse buttons and interaction types in context of controls.
+ *
+ * @type {ConstantsInterpolationSamplingType}
+ * @constant
+ */
+const InterpolationSamplingType = {
+	PERSPECTIVE: 'perspective',
+	LINEAR: 'linear',
+	FLAT: 'flat'
+};
+
+/**
+ * Represents the different interpolation sampling modes.
+ *
+ * @type {ConstantsInterpolationSamplingMode}
+ * @constant
+ */
+const InterpolationSamplingMode = {
+	NORMAL: 'normal',
+	CENTROID: 'centroid',
+	SAMPLE: 'sample',
+	FIRST: 'first',
+	EITHER: 'either'
+};
+
+/**
+ * Compatibility flags for features that may not be supported across all platforms.
+ *
+ * @type {Object}
+ * @constant
+ */
+const Compatibility = {
+	TEXTURE_COMPARE: 'depthTextureCompare'
+};
+
+/**
+ * Represents the refresh types of render objects.
+ *
+ * @type {ConstantsRenderObjectRefreshType}
+ * @constant
+ */
+const RenderObjectRefreshType = {
+	NONE: 0,
+	SHARED: 1,
+	FULL: 2
+};
+
+/**
+ * This type represents mouse buttons and interaction types in context of controls.
+ *
+ * @typedef {Object} ConstantsMouse
+ * @property {number} MIDDLE - The left mouse button.
+ * @property {number} LEFT - The middle mouse button.
+ * @property {number} RIGHT - The right mouse button.
+ * @property {number} ROTATE - A rotate interaction.
+ * @property {number} DOLLY - A dolly interaction.
+ * @property {number} PAN - A pan interaction.
+ **/
+
+/**
+ * This type represents touch interaction types in context of controls.
+ *
+ * @typedef {Object} ConstantsTouch
+ * @property {number} ROTATE - A rotate interaction.
+ * @property {number} PAN - A pan interaction.
+ * @property {number} DOLLY_PAN - The dolly-pan interaction.
+ * @property {number} DOLLY_ROTATE - A dolly-rotate interaction.
+ **/
+
+/**
+ * This type represents the different timestamp query types.
+ *
+ * @typedef {Object} ConstantsTimestampQuery
+ * @property {string} COMPUTE - A `compute` timestamp query.
+ * @property {string} RENDER - A `render` timestamp query.
+ **/
+
+/**
+ * Represents the different interpolation sampling types.
+ *
+ * @typedef {Object} ConstantsInterpolationSamplingType
+ * @property {string} PERSPECTIVE - Perspective-correct interpolation.
+ * @property {string} LINEAR - Linear interpolation.
+ * @property {string} FLAT - Flat interpolation.
+ */
+
+/**
+ * Represents the different interpolation sampling modes.
+ *
+ * @typedef {Object} ConstantsInterpolationSamplingMode
+ * @property {string} NORMAL - Normal sampling mode.
+ * @property {string} CENTROID - Centroid sampling mode.
+ * @property {string} SAMPLE - Sample-specific sampling mode.
+ * @property {string} FIRST - Flat interpolation using the first vertex.
+ * @property {string} EITHER - Flat interpolation using either vertex.
+ */
+
+/**
+ * Represents the refresh types of render objects.
+ *
+ * @typedef {Object} ConstantsRenderObjectRefreshType
+ * @property {number} NONE - No refresh required.
+ * @property {number} SHARED - Only shared uniform buffers require an update.
+ * @property {number} FULL - The render object requires a full refresh.
+ */
+
+/**
+ * Checks if an array contains values that require Uint32 representation.
+ *
+ * This function determines whether the array contains any values >= 65535,
+ * which would require a Uint32Array rather than a Uint16Array for proper storage.
+ * The function iterates from the end of the array, assuming larger values are
+ * typically located at the end.
+ *
+ * @private
+ * @param {Array<number>} array - The array to check.
+ * @return {boolean} True if the array contains values >= 65535, false otherwise.
+ */
+function arrayNeedsUint32( array ) {
+
+	// assumes larger values usually on last
+
+	for ( let i = array.length - 1; i >= 0; -- i ) {
+
+		if ( array[ i ] >= 65535 ) return true; // account for PRIMITIVE_RESTART_FIXED_INDEX, #24565
+
+	}
+
+	return false;
+
+}
+
+/**
+ * Map of typed array constructor names to their constructors.
+ * This mapping enables dynamic creation of typed arrays based on string type names.
+ *
+ * @private
+ * @constant
+ * @type {Object<string, TypedArrayConstructor>}
+ */
+const TYPED_ARRAYS = {
+	Int8Array: Int8Array,
+	Uint8Array: Uint8Array,
+	Uint8ClampedArray: Uint8ClampedArray,
+	Int16Array: Int16Array,
+	Uint16Array: Uint16Array,
+	Int32Array: Int32Array,
+	Uint32Array: Uint32Array,
+	Float32Array: Float32Array,
+	Float64Array: Float64Array
+};
+
+/**
+ * Creates a typed array of the specified type from the given buffer.
+ *
+ * @private
+ * @param {string} type - The name of the typed array type (e.g., 'Float32Array', 'Uint16Array').
+ * @param {ArrayBuffer} buffer - The buffer to create the typed array from.
+ * @return {TypedArray} A new typed array of the specified type.
+ */
+function getTypedArray( type, buffer ) {
+
+	return new TYPED_ARRAYS[ type ]( buffer );
+
+}
+
+/**
+ * Returns `true` if the given object is a typed array.
+ *
+ * @param {any} array - The object to check.
+ * @return {boolean} Whether the given object is a typed array.
+ */
+function isTypedArray( array ) {
+
+	return ArrayBuffer.isView( array ) && ! ( array instanceof DataView );
+
+}
+
+/**
+ * Creates an XHTML element with the specified tag name.
+ *
+ * This function uses the XHTML namespace to create DOM elements,
+ * ensuring proper element creation in XML-based contexts.
+ *
+ * @private
+ * @param {string} name - The tag name of the element to create (e.g., 'canvas', 'div').
+ * @return {HTMLElement} The created XHTML element.
+ */
+function createElementNS( name ) {
+
+	return document.createElementNS( 'http://www.w3.org/1999/xhtml', name );
+
+}
+
+/**
+ * Creates a canvas element configured for block display.
+ *
+ * This is a convenience function that creates a canvas element with
+ * display style set to 'block', which is commonly used in three.js
+ * rendering contexts to avoid inline element spacing issues.
+ *
+ * @return {HTMLCanvasElement} A canvas element with display set to 'block'.
+ */
+function createCanvasElement() {
+
+	const canvas = createElementNS( 'canvas' );
+	canvas.style.display = 'block';
+	return canvas;
+
+}
+
+/**
+ * Internal cache for tracking warning messages to prevent duplicate warnings.
+ *
+ * @private
+ * @type {Object<string, boolean>}
+ */
+const _cache = {};
+
+/**
+ * Custom console function handler for intercepting log, warn, and error calls.
+ *
+ * @private
+ * @type {Function|null}
+ */
+let _setConsoleFunction = null;
+
+/**
+ * Sets a custom function to handle console output.
+ *
+ * This allows external code to intercept and handle console.log, console.warn,
+ * and console.error calls made by three.js, which is useful for custom logging,
+ * testing, or debugging workflows.
+ *
+ * @param {Function} fn - The function to handle console output. Should accept
+ *                        (type, message, ...params) where type is 'log', 'warn', or 'error'.
+ */
+function setConsoleFunction( fn ) {
+
+	_setConsoleFunction = fn;
+
+}
+
+/**
+ * Gets the currently set custom console function.
+ *
+ * @return {Function|null} The custom console function, or null if not set.
+ */
+function getConsoleFunction() {
+
+	return _setConsoleFunction;
+
+}
+
+/**
+ * Logs an informational message with the 'THREE.' prefix.
+ *
+ * If a custom console function is set via setConsoleFunction(), it will be used
+ * instead of the native console.log. The first parameter is treated as the
+ * method name and is automatically prefixed with 'THREE.'.
+ *
+ * @param {...any} params - The message components. The first param is used as
+ *                          the method name and prefixed with 'THREE.'.
+ */
+function log( ...params ) {
+
+	const message = 'THREE.' + params.shift();
+
+	if ( _setConsoleFunction ) {
+
+		_setConsoleFunction( 'log', message, ...params );
+
+	} else {
+
+		console.log( message, ...params );
+
+	}
+
+}
+
+/**
+ * Enhances log/warn/error messages related to TSL.
+ *
+ * @param {Array<any>} params - The original message parameters.
+ * @returns {Array<any>} The filtered and enhanced message parameters.
+ */
+function enhanceLogMessage( params ) {
+
+	const message = params[ 0 ];
+
+	if ( typeof message === 'string' && message.startsWith( 'TSL:' ) ) {
+
+		const stackTrace = params[ 1 ];
+
+		if ( stackTrace && stackTrace.isStackTrace ) {
+
+			params[ 0 ] += ' ' + stackTrace.getLocation();
+
+		} else {
+
+			params[ 1 ] = 'Stack trace not available. Enable "THREE.Node.captureStackTrace" to capture stack traces.';
+
+		}
+
+	}
+
+	return params;
+
+}
+
+/**
+ * Logs a warning message with the 'THREE.' prefix.
+ *
+ * If a custom console function is set via setConsoleFunction(), it will be used
+ * instead of the native console.warn. The first parameter is treated as the
+ * method name and is automatically prefixed with 'THREE.'.
+ *
+ * @param {...any} params - The message components. The first param is used as
+ *                          the method name and prefixed with 'THREE.'.
+ */
+function warn( ...params ) {
+
+	params = enhanceLogMessage( params );
+
+	const message = 'THREE.' + params.shift();
+
+	if ( _setConsoleFunction ) {
+
+		_setConsoleFunction( 'warn', message, ...params );
+
+	} else {
+
+		const stackTrace = params[ 0 ];
+
+		if ( stackTrace && stackTrace.isStackTrace ) {
+
+			console.warn( stackTrace.getError( message ) );
+
+		} else {
+
+			console.warn( message, ...params );
+
+		}
+
+	}
+
+}
+
+/**
+ * Logs an error message with the 'THREE.' prefix.
+ *
+ * If a custom console function is set via setConsoleFunction(), it will be used
+ * instead of the native console.error. The first parameter is treated as the
+ * method name and is automatically prefixed with 'THREE.'.
+ *
+ * @param {...any} params - The message components. The first param is used as
+ *                          the method name and prefixed with 'THREE.'.
+ */
+function error( ...params ) {
+
+	params = enhanceLogMessage( params );
+
+	const message = 'THREE.' + params.shift();
+
+	if ( _setConsoleFunction ) {
+
+		_setConsoleFunction( 'error', message, ...params );
+
+	} else {
+
+		const stackTrace = params[ 0 ];
+
+		if ( stackTrace && stackTrace.isStackTrace ) {
+
+			console.error( stackTrace.getError( message ) );
+
+		} else {
+
+			console.error( message, ...params );
+
+		}
+
+	}
+
+}
+
+/**
+ * Logs a warning message only once, preventing duplicate warnings.
+ *
+ * This function maintains an internal cache of warning messages and will only
+ * output each unique warning message once. Useful for warnings that may be
+ * triggered repeatedly but should only be shown to the user once.
+ *
+ * @param {...any} params - The warning message components.
+ */
+function warnOnce( ...params ) {
+
+	const message = params.join( ' ' );
+
+	if ( message in _cache ) return;
+
+	_cache[ message ] = true;
+
+	warn( ...params );
+
+}
+
+/**
+ * Yields execution to the main thread to allow rendering and other tasks.
+ * Uses scheduler.yield() when available (Chrome 115+), falls back to requestAnimationFrame.
+ *
+ * @return {Promise<void>}
+ */
+function yieldToMain() {
+
+	if ( typeof self !== 'undefined' && typeof self.scheduler !== 'undefined' && typeof self.scheduler.yield !== 'undefined' ) {
+
+		return self.scheduler.yield();
+
+	}
+
+	return new Promise( resolve => {
+
+		requestAnimationFrame( resolve );
+
+	} );
+
+}
+
+/**
+ * Asynchronously probes for WebGL sync object completion.
+ *
+ * This function creates a promise that resolves when the WebGL sync object
+ * signals completion or rejects if the sync operation fails. It uses polling
+ * at the specified interval to check the sync status without blocking the
+ * main thread. This is useful for GPU-CPU synchronization in WebGL contexts.
+ *
+ * @private
+ * @param {WebGL2RenderingContext} gl - The WebGL rendering context.
+ * @param {WebGLSync} sync - The WebGL sync object to wait for.
+ * @param {number} interval - The polling interval in milliseconds.
+ * @return {Promise<void>} A promise that resolves when the sync completes or rejects if it fails.
+ */
+function probeAsync( gl, sync, interval ) {
+
+	return new Promise( function ( resolve, reject ) {
+
+		function probe() {
+
+			switch ( gl.clientWaitSync( sync, gl.SYNC_FLUSH_COMMANDS_BIT, 0 ) ) {
+
+				case gl.WAIT_FAILED:
+					reject();
+					break;
+
+				case gl.TIMEOUT_EXPIRED:
+					setTimeout( probe, interval );
+					break;
+
+				default:
+					resolve();
+
+			}
+
+		}
+
+		setTimeout( probe, interval );
+
+	} );
+
+}
+
+/**
+ * Used to select the correct depth functions
+ * when reversed depth buffer is used.
+ *
+ * @private
+ * @type {Object}
+ */
+const ReversedDepthFuncs = {
+	[ NeverDepth ]: AlwaysDepth,
+	[ LessDepth ]: GreaterDepth,
+	[ EqualDepth ]: NotEqualDepth,
+	[ LessEqualDepth ]: GreaterEqualDepth,
+
+	[ AlwaysDepth ]: NeverDepth,
+	[ GreaterDepth ]: LessDepth,
+	[ NotEqualDepth ]: EqualDepth,
+	[ GreaterEqualDepth ]: LessEqualDepth,
+};
+
+/**
+ * This modules allows to dispatch event objects on custom JavaScript objects.
+ *
+ * Main repository: [eventdispatcher.js](https://github.com/mrdoob/eventdispatcher.js/)
+ *
+ * Code Example:
+ * ```js
+ * class Car extends EventDispatcher {
+ * 	start() {
+ *		this.dispatchEvent( { type: 'start', message: 'vroom vroom!' } );
+ *	}
+ *};
+ *
+ * // Using events with the custom object
+ * const car = new Car();
+ * car.addEventListener( 'start', function ( event ) {
+ * 	alert( event.message );
+ * } );
+ *
+ * car.start();
+ * ```
+ */
+class EventDispatcher {
+
+	/**
+	 * Adds the given event listener to the given event type.
+	 *
+	 * @param {string} type - The type of event to listen to.
+	 * @param {Function} listener - The function that gets called when the event is fired.
+	 */
+	addEventListener( type, listener ) {
+
+		if ( this._listeners === undefined ) this._listeners = {};
+
+		const listeners = this._listeners;
+
+		if ( listeners[ type ] === undefined ) {
+
+			listeners[ type ] = [];
+
+		}
+
+		if ( listeners[ type ].indexOf( listener ) === -1 ) {
+
+			listeners[ type ].push( listener );
+
+		}
+
+	}
+
+	/**
+	 * Returns `true` if the given event listener has been added to the given event type.
+	 *
+	 * @param {string} type - The type of event.
+	 * @param {Function} listener - The listener to check.
+	 * @return {boolean} Whether the given event listener has been added to the given event type.
+	 */
+	hasEventListener( type, listener ) {
+
+		const listeners = this._listeners;
+
+		if ( listeners === undefined ) return false;
+
+		return listeners[ type ] !== undefined && listeners[ type ].indexOf( listener ) !== -1;
+
+	}
+
+	/**
+	 * Removes the given event listener from the given event type.
+	 *
+	 * @param {string} type - The type of event.
+	 * @param {Function} listener - The listener to remove.
+	 */
+	removeEventListener( type, listener ) {
+
+		const listeners = this._listeners;
+
+		if ( listeners === undefined ) return;
+
+		const listenerArray = listeners[ type ];
+
+		if ( listenerArray !== undefined ) {
+
+			const index = listenerArray.indexOf( listener );
+
+			if ( index !== -1 ) {
+
+				listenerArray.splice( index, 1 );
+
+			}
+
+		}
+
+	}
+
+	/**
+	 * Dispatches an event object.
+	 *
+	 * @param {Object} event - The event that gets fired.
+	 */
+	dispatchEvent( event ) {
+
+		const listeners = this._listeners;
+
+		if ( listeners === undefined ) return;
+
+		const listenerArray = listeners[ event.type ];
+
+		if ( listenerArray !== undefined ) {
+
+			event.target = this;
+
+			// Make a copy, in case listeners are removed while iterating.
+			const array = listenerArray.slice( 0 );
+
+			for ( let i = 0, l = array.length; i < l; i ++ ) {
+
+				array[ i ].call( this, event );
+
+			}
+
+			event.target = null;
+
+		}
+
+	}
+
+}
+
+const _lut = [ '00', '01', '02', '03', '04', '05', '06', '07', '08', '09', '0a', '0b', '0c', '0d', '0e', '0f', '10', '11', '12', '13', '14', '15', '16', '17', '18', '19', '1a', '1b', '1c', '1d', '1e', '1f', '20', '21', '22', '23', '24', '25', '26', '27', '28', '29', '2a', '2b', '2c', '2d', '2e', '2f', '30', '31', '32', '33', '34', '35', '36', '37', '38', '39', '3a', '3b', '3c', '3d', '3e', '3f', '40', '41', '42', '43', '44', '45', '46', '47', '48', '49', '4a', '4b', '4c', '4d', '4e', '4f', '50', '51', '52', '53', '54', '55', '56', '57', '58', '59', '5a', '5b', '5c', '5d', '5e', '5f', '60', '61', '62', '63', '64', '65', '66', '67', '68', '69', '6a', '6b', '6c', '6d', '6e', '6f', '70', '71', '72', '73', '74', '75', '76', '77', '78', '79', '7a', '7b', '7c', '7d', '7e', '7f', '80', '81', '82', '83', '84', '85', '86', '87', '88', '89', '8a', '8b', '8c', '8d', '8e', '8f', '90', '91', '92', '93', '94', '95', '96', '97', '98', '99', '9a', '9b', '9c', '9d', '9e', '9f', 'a0', 'a1', 'a2', 'a3', 'a4', 'a5', 'a6', 'a7', 'a8', 'a9', 'aa', 'ab', 'ac', 'ad', 'ae', 'af', 'b0', 'b1', 'b2', 'b3', 'b4', 'b5', 'b6', 'b7', 'b8', 'b9', 'ba', 'bb', 'bc', 'bd', 'be', 'bf', 'c0', 'c1', 'c2', 'c3', 'c4', 'c5', 'c6', 'c7', 'c8', 'c9', 'ca', 'cb', 'cc', 'cd', 'ce', 'cf', 'd0', 'd1', 'd2', 'd3', 'd4', 'd5', 'd6', 'd7', 'd8', 'd9', 'da', 'db', 'dc', 'dd', 'de', 'df', 'e0', 'e1', 'e2', 'e3', 'e4', 'e5', 'e6', 'e7', 'e8', 'e9', 'ea', 'eb', 'ec', 'ed', 'ee', 'ef', 'f0', 'f1', 'f2', 'f3', 'f4', 'f5', 'f6', 'f7', 'f8', 'f9', 'fa', 'fb', 'fc', 'fd', 'fe', 'ff' ];
+
+let _seed = 1234567;
+
+
+const DEG2RAD = Math.PI / 180;
+const RAD2DEG = 180 / Math.PI;
+
+/**
+ * Generate a [UUID](https://en.wikipedia.org/wiki/Universally_unique_identifier)
+ * (universally unique identifier).
+ *
+ * @return {string} The UUID.
+ */
+function generateUUID() {
+
+	// http://stackoverflow.com/questions/105034/how-to-create-a-guid-uuid-in-javascript/21963136#21963136
+
+	const d0 = Math.random() * 0xffffffff | 0;
+	const d1 = Math.random() * 0xffffffff | 0;
+	const d2 = Math.random() * 0xffffffff | 0;
+	const d3 = Math.random() * 0xffffffff | 0;
+	const uuid = _lut[ d0 & 0xff ] + _lut[ d0 >> 8 & 0xff ] + _lut[ d0 >> 16 & 0xff ] + _lut[ d0 >> 24 & 0xff ] + '-' +
+			_lut[ d1 & 0xff ] + _lut[ d1 >> 8 & 0xff ] + '-' + _lut[ d1 >> 16 & 0x0f | 0x40 ] + _lut[ d1 >> 24 & 0xff ] + '-' +
+			_lut[ d2 & 0x3f | 0x80 ] + _lut[ d2 >> 8 & 0xff ] + '-' + _lut[ d2 >> 16 & 0xff ] + _lut[ d2 >> 24 & 0xff ] +
+			_lut[ d3 & 0xff ] + _lut[ d3 >> 8 & 0xff ] + _lut[ d3 >> 16 & 0xff ] + _lut[ d3 >> 24 & 0xff ];
+
+	// .toLowerCase() here flattens concatenated strings to save heap memory space.
+	return uuid.toLowerCase();
+
+}
+
+/**
+ * Clamps the given value between min and max.
+ *
+ * @param {number} value - The value to clamp.
+ * @param {number} min - The min value.
+ * @param {number} max - The max value.
+ * @return {number} The clamped value.
+ */
+function clamp( value, min, max ) {
+
+	return Math.max( min, Math.min( max, value ) );
+
+}
+
+/**
+ * Computes the Euclidean modulo of the given parameters that
+ * is `( ( n % m ) + m ) % m`.
+ *
+ * @param {number} n - The first parameter.
+ * @param {number} m - The second parameter.
+ * @return {number} The Euclidean modulo.
+ */
+function euclideanModulo( n, m ) {
+
+	// https://en.wikipedia.org/wiki/Modulo_operation
+
+	return ( ( n % m ) + m ) % m;
+
+}
+
+/**
+ * Performs a linear mapping from range `<a1, a2>` to range `<b1, b2>`
+ * for the given value. `a2` must be greater than `a1`.
+ *
+ * @param {number} x - The value to be mapped.
+ * @param {number} a1 - Minimum value for range A.
+ * @param {number} a2 - Maximum value for range A.
+ * @param {number} b1 - Minimum value for range B.
+ * @param {number} b2 - Maximum value for range B.
+ * @return {number} The mapped value.
+ */
+function mapLinear( x, a1, a2, b1, b2 ) {
+
+	return b1 + ( x - a1 ) * ( b2 - b1 ) / ( a2 - a1 );
+
+}
+
+/**
+ * Returns the percentage in the closed interval `[0, 1]` of the given value
+ * between the start and end point.
+ *
+ * @param {number} x - The start point
+ * @param {number} y - The end point.
+ * @param {number} value - A value between start and end.
+ * @return {number} The interpolation factor.
+ */
+function inverseLerp( x, y, value ) {
+
+	// https://www.gamedev.net/tutorials/programming/general-and-gameplay-programming/inverse-lerp-a-super-useful-yet-often-overlooked-function-r5230/
+
+	if ( x !== y ) {
+
+		return ( value - x ) / ( y - x );
+
+	} else {
+
+		return 0;
+
+	}
+
+}
+
+/**
+ * Returns a value linearly interpolated from two known points based on the given interval -
+ * `t = 0` will return `x` and `t = 1` will return `y`.
+ *
+ * @param {number} x - The start point
+ * @param {number} y - The end point.
+ * @param {number} t - The interpolation factor in the closed interval `[0, 1]`.
+ * @return {number} The interpolated value.
+ */
+function lerp( x, y, t ) {
+
+	return ( 1 - t ) * x + t * y;
+
+}
+
+/**
+ * Smoothly interpolate a number from `x` to `y` in  a spring-like manner using a delta
+ * time to maintain frame rate independent movement. For details, see
+ * [Frame rate independent damping using lerp](http://www.rorydriscoll.com/2016/03/07/frame-rate-independent-damping-using-lerp/).
+ *
+ * @param {number} x - The current point.
+ * @param {number} y - The target point.
+ * @param {number} lambda - A higher lambda value will make the movement more sudden,
+ * and a lower value will make the movement more gradual.
+ * @param {number} dt - Delta time in seconds.
+ * @return {number} The interpolated value.
+ */
+function damp( x, y, lambda, dt ) {
+
+	return lerp( x, y, 1 - Math.exp( - lambda * dt ) );
+
+}
+
+/**
+ * Returns a value that alternates between `0` and the given `length` parameter.
+ *
+ * @param {number} x - The value to pingpong.
+ * @param {number} [length=1] - The positive value the function will pingpong to.
+ * @return {number} The alternated value.
+ */
+function pingpong( x, length = 1 ) {
+
+	// https://www.desmos.com/calculator/vcsjnyz7x4
+
+	return length - Math.abs( euclideanModulo( x, length * 2 ) - length );
+
+}
+
+/**
+ * Returns a value in the range `[0,1]` that represents the percentage that `x` has
+ * moved between `min` and `max`, but smoothed or slowed down the closer `x` is to
+ * the `min` and `max`.
+ *
+ * See [Smoothstep](http://en.wikipedia.org/wiki/Smoothstep) for more details.
+ *
+ * @param {number} x - The value to evaluate based on its position between `min` and `max`.
+ * @param {number} min - The min value. Any `x` value below `min` will be `0`. `min` must be lower than `max`.
+ * @param {number} max - The max value. Any `x` value above `max` will be `1`. `max` must be greater than `min`.
+ * @return {number} The alternated value.
+ */
+function smoothstep( x, min, max ) {
+
+	if ( x <= min ) return 0;
+	if ( x >= max ) return 1;
+
+	x = ( x - min ) / ( max - min );
+
+	return x * x * ( 3 - 2 * x );
+
+}
+
+/**
+ * A [variation on smoothstep](https://en.wikipedia.org/wiki/Smoothstep#Variations)
+ * that has zero 1st and 2nd order derivatives at `x=0` and `x=1`.
+ *
+ * @param {number} x - The value to evaluate based on its position between `min` and `max`.
+ * @param {number} min - The min value. Any `x` value below `min` will be `0`. `min` must be lower than `max`.
+ * @param {number} max - The max value. Any `x` value above `max` will be `1`. `max` must be greater than `min`.
+ * @return {number} The alternated value.
+ */
+function smootherstep( x, min, max ) {
+
+	if ( x <= min ) return 0;
+	if ( x >= max ) return 1;
+
+	x = ( x - min ) / ( max - min );
+
+	return x * x * x * ( x * ( x * 6 - 15 ) + 10 );
+
+}
+
+/**
+ * Returns a random integer from `<low, high>` interval.
+ *
+ * @param {number} low - The lower value boundary.
+ * @param {number} high - The upper value boundary
+ * @return {number} A random integer.
+ */
+function randInt( low, high ) {
+
+	return low + Math.floor( Math.random() * ( high - low + 1 ) );
+
+}
+
+/**
+ * Returns a random float from `<low, high>` interval.
+ *
+ * @param {number} low - The lower value boundary.
+ * @param {number} high - The upper value boundary
+ * @return {number} A random float.
+ */
+function randFloat( low, high ) {
+
+	return low + Math.random() * ( high - low );
+
+}
+
+/**
+ * Returns a random integer from `<-range/2, range/2>` interval.
+ *
+ * @param {number} range - Defines the value range.
+ * @return {number} A random float.
+ */
+function randFloatSpread( range ) {
+
+	return range * ( 0.5 - Math.random() );
+
+}
+
+/**
+ * Returns a deterministic pseudo-random float in the interval `[0, 1]`.
+ *
+ * @param {number} [s] - The integer seed.
+ * @return {number} A random float.
+ */
+function seededRandom( s ) {
+
+	if ( s !== undefined ) _seed = s;
+
+	// Mulberry32 generator
+
+	let t = _seed += 0x6D2B79F5;
+
+	t = Math.imul( t ^ t >>> 15, t | 1 );
+
+	t ^= t + Math.imul( t ^ t >>> 7, t | 61 );
+
+	return ( ( t ^ t >>> 14 ) >>> 0 ) / 4294967296;
+
+}
+
+/**
+ * Converts degrees to radians.
+ *
+ * @param {number} degrees - A value in degrees.
+ * @return {number} The converted value in radians.
+ */
+function degToRad( degrees ) {
+
+	return degrees * DEG2RAD;
+
+}
+
+/**
+ * Converts radians to degrees.
+ *
+ * @param {number} radians - A value in radians.
+ * @return {number} The converted value in degrees.
+ */
+function radToDeg( radians ) {
+
+	return radians * RAD2DEG;
+
+}
+
+/**
+ * Returns `true` if the given integer is a power of two.
+ *
+ * @param {number} value - The value to check.
+ * @return {boolean} Whether the given integer is a power of two or not.
+ */
+function isPowerOfTwo( value ) {
+
+	return value > 0 && Number.isInteger( value ) && 2 ** Math.round( Math.log2( value ) ) === value;
+
+}
+
+/**
+ * Returns the smallest power of two that is greater than or equal to the given number.
+ *
+ * @param {number} value - The value to find a POT for. Must be greater than `0`.
+ * @return {number} The smallest power of two that is greater than or equal to the given number.
+ */
+function ceilPowerOfTwo( value ) {
+
+	return Math.pow( 2, Math.ceil( Math.log( value ) / Math.LN2 ) );
+
+}
+
+/**
+ * Returns the largest power of two that is less than or equal to the given number.
+ *
+ * @param {number} value - The value to find a POT for. Must be greater than `0`.
+ * @return {number} The largest power of two that is less than or equal to the given number.
+ */
+function floorPowerOfTwo( value ) {
+
+	return Math.pow( 2, Math.floor( Math.log( value ) / Math.LN2 ) );
+
+}
+
+/**
+ * Sets the given quaternion from the [Intrinsic Proper Euler Angles](https://en.wikipedia.org/wiki/Euler_angles)
+ * defined by the given angles and order.
+ *
+ * Rotations are applied to the axes in the order specified by order:
+ * rotation by angle `a` is applied first, then by angle `b`, then by angle `c`.
+ *
+ * @param {Quaternion} q - The quaternion to set.
+ * @param {number} a - The rotation applied to the first axis, in radians.
+ * @param {number} b - The rotation applied to the second axis, in radians.
+ * @param {number} c - The rotation applied to the third axis, in radians.
+ * @param {('XYX'|'XZX'|'YXY'|'YZY'|'ZXZ'|'ZYZ')} order - A string specifying the axes order.
+ */
+function setQuaternionFromProperEuler( q, a, b, c, order ) {
+
+	const cos = Math.cos;
+	const sin = Math.sin;
+
+	const c2 = cos( b / 2 );
+	const s2 = sin( b / 2 );
+
+	const c13 = cos( ( a + c ) / 2 );
+	const s13 = sin( ( a + c ) / 2 );
+
+	const c1_3 = cos( ( a - c ) / 2 );
+	const s1_3 = sin( ( a - c ) / 2 );
+
+	const c3_1 = cos( ( c - a ) / 2 );
+	const s3_1 = sin( ( c - a ) / 2 );
+
+	switch ( order ) {
+
+		case 'XYX':
+			q.set( c2 * s13, s2 * c1_3, s2 * s1_3, c2 * c13 );
+			break;
+
+		case 'YZY':
+			q.set( s2 * s1_3, c2 * s13, s2 * c1_3, c2 * c13 );
+			break;
+
+		case 'ZXZ':
+			q.set( s2 * c1_3, s2 * s1_3, c2 * s13, c2 * c13 );
+			break;
+
+		case 'XZX':
+			q.set( c2 * s13, s2 * s3_1, s2 * c3_1, c2 * c13 );
+			break;
+
+		case 'YXY':
+			q.set( s2 * c3_1, c2 * s13, s2 * s3_1, c2 * c13 );
+			break;
+
+		case 'ZYZ':
+			q.set( s2 * s3_1, s2 * c3_1, c2 * s13, c2 * c13 );
+			break;
+
+		default:
+			warn( 'MathUtils: .setQuaternionFromProperEuler() encountered an unknown order: ' + order );
+
+	}
+
+}
+
+/**
+ * Denormalizes the given value according to the given typed array.
+ *
+ * @param {number} value - The value to denormalize.
+ * @param {TypedArray} array - The typed array that defines the data type of the value.
+ * @return {number} The denormalize (float) value in the range `[0,1]`.
+ */
+function denormalize( value, array ) {
+
+	switch ( array.constructor ) {
+
+		case Float32Array:
+
+			return value;
+
+		case Uint32Array:
+
+			return value / 4294967295.0;
+
+		case Uint16Array:
+
+			return value / 65535.0;
+
+		case Uint8Array:
+		case Uint8ClampedArray:
+
+			return value / 255.0;
+
+		case Int32Array:
+
+			return Math.max( value / 2147483647.0, -1 );
+
+		case Int16Array:
+
+			return Math.max( value / 32767.0, -1 );
+
+		case Int8Array:
+
+			return Math.max( value / 127.0, -1 );
+
+		default:
+
+			throw new Error( 'THREE.MathUtils: Invalid component type.' );
+
+	}
+
+}
+
+/**
+ * Normalizes the given value according to the given typed array.
+ *
+ * @param {number} value - The float value in the range `[0,1]` to normalize.
+ * @param {TypedArray} array - The typed array that defines the data type of the value.
+ * @return {number} The normalize value.
+ */
+function normalize( value, array ) {
+
+	switch ( array.constructor ) {
+
+		case Float32Array:
+
+			return value;
+
+		case Uint32Array:
+
+			return Math.round( value * 4294967295.0 );
+
+		case Uint16Array:
+
+			return Math.round( value * 65535.0 );
+
+		case Uint8Array:
+		case Uint8ClampedArray:
+
+			return Math.round( value * 255.0 );
+
+		case Int32Array:
+
+			return Math.round( value * 2147483647.0 );
+
+		case Int16Array:
+
+			return Math.round( value * 32767.0 );
+
+		case Int8Array:
+
+			return Math.round( value * 127.0 );
+
+		default:
+
+			throw new Error( 'THREE.MathUtils: Invalid component type.' );
+
+	}
+
+}
+
+/**
+ * @class
+ * @classdesc A collection of math utility functions.
+ * @hideconstructor
+ */
+const MathUtils = {
+	DEG2RAD: DEG2RAD,
+	RAD2DEG: RAD2DEG,
+	/**
+	 * Generate a [UUID](https://en.wikipedia.org/wiki/Universally_unique_identifier)
+	 * (universally unique identifier).
+	 *
+	 * @static
+	 * @method
+	 * @return {string} The UUID.
+	 */
+	generateUUID: generateUUID,
+	/**
+	 * Clamps the given value between min and max.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} value - The value to clamp.
+	 * @param {number} min - The min value.
+	 * @param {number} max - The max value.
+	 * @return {number} The clamped value.
+	 */
+	clamp: clamp,
+	/**
+	 * Computes the Euclidean modulo of the given parameters that
+	 * is `( ( n % m ) + m ) % m`.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} n - The first parameter.
+	 * @param {number} m - The second parameter.
+	 * @return {number} The Euclidean modulo.
+	 */
+	euclideanModulo: euclideanModulo,
+	/**
+	 * Performs a linear mapping from range `<a1, a2>` to range `<b1, b2>`
+	 * for the given value.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} x - The value to be mapped.
+	 * @param {number} a1 - Minimum value for range A.
+	 * @param {number} a2 - Maximum value for range A.
+	 * @param {number} b1 - Minimum value for range B.
+	 * @param {number} b2 - Maximum value for range B.
+	 * @return {number} The mapped value.
+	 */
+	mapLinear: mapLinear,
+	/**
+	 * Returns the percentage in the closed interval `[0, 1]` of the given value
+	 * between the start and end point.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} x - The start point
+	 * @param {number} y - The end point.
+	 * @param {number} value - A value between start and end.
+	 * @return {number} The interpolation factor.
+	 */
+	inverseLerp: inverseLerp,
+	/**
+	 * Returns a value linearly interpolated from two known points based on the given interval -
+	 * `t = 0` will return `x` and `t = 1` will return `y`.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} x - The start point
+	 * @param {number} y - The end point.
+	 * @param {number} t - The interpolation factor in the closed interval `[0, 1]`.
+	 * @return {number} The interpolated value.
+	 */
+	lerp: lerp,
+	/**
+	 * Smoothly interpolate a number from `x` to `y` in  a spring-like manner using a delta
+	 * time to maintain frame rate independent movement. For details, see
+	 * [Frame rate independent damping using lerp](http://www.rorydriscoll.com/2016/03/07/frame-rate-independent-damping-using-lerp/).
+	 *
+	 * @static
+	 * @method
+	 * @param {number} x - The current point.
+	 * @param {number} y - The target point.
+	 * @param {number} lambda - A higher lambda value will make the movement more sudden,
+	 * and a lower value will make the movement more gradual.
+	 * @param {number} dt - Delta time in seconds.
+	 * @return {number} The interpolated value.
+	 */
+	damp: damp,
+	/**
+	 * Returns a value that alternates between `0` and the given `length` parameter.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} x - The value to pingpong.
+	 * @param {number} [length=1] - The positive value the function will pingpong to.
+	 * @return {number} The alternated value.
+	 */
+	pingpong: pingpong,
+	/**
+	 * Returns a value in the range `[0,1]` that represents the percentage that `x` has
+	 * moved between `min` and `max`, but smoothed or slowed down the closer `x` is to
+	 * the `min` and `max`.
+	 *
+	 * See [Smoothstep](http://en.wikipedia.org/wiki/Smoothstep) for more details.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} x - The value to evaluate based on its position between min and max.
+	 * @param {number} min - The min value. Any x value below min will be `0`.
+	 * @param {number} max - The max value. Any x value above max will be `1`.
+	 * @return {number} The alternated value.
+	 */
+	smoothstep: smoothstep,
+	/**
+	 * A [variation on smoothstep](https://en.wikipedia.org/wiki/Smoothstep#Variations)
+	 * that has zero 1st and 2nd order derivatives at x=0 and x=1.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} x - The value to evaluate based on its position between min and max.
+	 * @param {number} min - The min value. Any x value below min will be `0`.
+	 * @param {number} max - The max value. Any x value above max will be `1`.
+	 * @return {number} The alternated value.
+	 */
+	smootherstep: smootherstep,
+	/**
+	 * Returns a random integer from `<low, high>` interval.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} low - The lower value boundary.
+	 * @param {number} high - The upper value boundary
+	 * @return {number} A random integer.
+	 */
+	randInt: randInt,
+	/**
+	 * Returns a random float from `<low, high>` interval.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} low - The lower value boundary.
+	 * @param {number} high - The upper value boundary
+	 * @return {number} A random float.
+	 */
+	randFloat: randFloat,
+	/**
+	 * Returns a random integer from `<-range/2, range/2>` interval.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} range - Defines the value range.
+	 * @return {number} A random float.
+	 */
+	randFloatSpread: randFloatSpread,
+	/**
+	 * Returns a deterministic pseudo-random float in the interval `[0, 1]`.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} [s] - The integer seed.
+	 * @return {number} A random float.
+	 */
+	seededRandom: seededRandom,
+	/**
+	 * Converts degrees to radians.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} degrees - A value in degrees.
+	 * @return {number} The converted value in radians.
+	 */
+	degToRad: degToRad,
+	/**
+	 * Converts radians to degrees.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} radians - A value in radians.
+	 * @return {number} The converted value in degrees.
+	 */
+	radToDeg: radToDeg,
+	/**
+	 * Returns `true` if the given number is a power of two.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} value - The value to check.
+	 * @return {boolean} Whether the given number is a power of two or not.
+	 */
+	isPowerOfTwo: isPowerOfTwo,
+	/**
+	 * Returns the smallest power of two that is greater than or equal to the given number.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} value - The value to find a POT for.
+	 * @return {number} The smallest power of two that is greater than or equal to the given number.
+	 */
+	ceilPowerOfTwo: ceilPowerOfTwo,
+	/**
+	 * Returns the largest power of two that is less than or equal to the given number.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} value - The value to find a POT for.
+	 * @return {number} The largest power of two that is less than or equal to the given number.
+	 */
+	floorPowerOfTwo: floorPowerOfTwo,
+	/**
+	 * Sets the given quaternion from the [Intrinsic Proper Euler Angles](https://en.wikipedia.org/wiki/Euler_angles)
+	 * defined by the given angles and order.
+	 *
+	 * Rotations are applied to the axes in the order specified by order:
+	 * rotation by angle `a` is applied first, then by angle `b`, then by angle `c`.
+	 *
+	 * @static
+	 * @method
+	 * @param {Quaternion} q - The quaternion to set.
+	 * @param {number} a - The rotation applied to the first axis, in radians.
+	 * @param {number} b - The rotation applied to the second axis, in radians.
+	 * @param {number} c - The rotation applied to the third axis, in radians.
+	 * @param {('XYX'|'XZX'|'YXY'|'YZY'|'ZXZ'|'ZYZ')} order - A string specifying the axes order.
+	 */
+	setQuaternionFromProperEuler: setQuaternionFromProperEuler,
+	/**
+	 * Normalizes the given value according to the given typed array.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} value - The float value in the range `[0,1]` to normalize.
+	 * @param {TypedArray} array - The typed array that defines the data type of the value.
+	 * @return {number} The normalize value.
+	 */
+	normalize: normalize,
+	/**
+	 * Denormalizes the given value according to the given typed array.
+	 *
+	 * @static
+	 * @method
+	 * @param {number} value - The value to denormalize.
+	 * @param {TypedArray} array - The typed array that defines the data type of the value.
+	 * @return {number} The denormalize (float) value in the range `[0,1]`.
+	 */
+	denormalize: denormalize
+};
+
+/**
+ * Class representing a 2D vector. A 2D vector is an ordered pair of numbers
+ * (labeled x and y), which can be used to represent a number of things, such as:
+ *
+ * - A point in 2D space (i.e. a position on a plane).
+ * - A direction and length across a plane. In three.js the length will
+ * always be the Euclidean distance(straight-line distance) from `(0, 0)` to `(x, y)`
+ * and the direction is also measured from `(0, 0)` towards `(x, y)`.
+ * - Any arbitrary ordered pair of numbers.
+ *
+ * There are other things a 2D vector can be used to represent, such as
+ * momentum vectors, complex numbers and so on, however these are the most
+ * common uses in three.js.
+ *
+ * Iterating through a vector instance will yield its components `(x, y)` in
+ * the corresponding order.
+ * ```js
+ * const a = new THREE.Vector2( 0, 1 );
+ *
+ * //no arguments; will be initialised to (0, 0)
+ * const b = new THREE.Vector2( );
+ *
+ * const d = a.distanceTo( b );
+ * ```
+ */
+class Vector2 {
+
+	static {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		Vector2.prototype.isVector2 = true;
+
+	}
+
+	/**
+	 * Constructs a new 2D vector.
+	 *
+	 * @param {number} [x=0] - The x value of this vector.
+	 * @param {number} [y=0] - The y value of this vector.
+	 */
+	constructor( x = 0, y = 0 ) {
+
+		/**
+		 * The x value of this vector.
+		 *
+		 * @type {number}
+		 */
+		this.x = x;
+
+		/**
+		 * The y value of this vector.
+		 *
+		 * @type {number}
+		 */
+		this.y = y;
+
+	}
+
+	/**
+	 * Alias for {@link Vector2#x}.
+	 *
+	 * @type {number}
+	 */
+	get width() {
+
+		return this.x;
+
+	}
+
+	set width( value ) {
+
+		this.x = value;
+
+	}
+
+	/**
+	 * Alias for {@link Vector2#y}.
+	 *
+	 * @type {number}
+	 */
+	get height() {
+
+		return this.y;
+
+	}
+
+	set height( value ) {
+
+		this.y = value;
+
+	}
+
+	/**
+	 * Sets the vector components.
+	 *
+	 * @param {number} x - The value of the x component.
+	 * @param {number} y - The value of the y component.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	set( x, y ) {
+
+		this.x = x;
+		this.y = y;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector components to the same value.
+	 *
+	 * @param {number} scalar - The value to set for all vector components.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	setScalar( scalar ) {
+
+		this.x = scalar;
+		this.y = scalar;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector's x component to the given value
+	 *
+	 * @param {number} x - The value to set.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	setX( x ) {
+
+		this.x = x;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector's y component to the given value
+	 *
+	 * @param {number} y - The value to set.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	setY( y ) {
+
+		this.y = y;
+
+		return this;
+
+	}
+
+	/**
+	 * Allows to set a vector component with an index.
+	 *
+	 * @param {number} index - The component index. `0` equals to x, `1` equals to y.
+	 * @param {number} value - The value to set.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	setComponent( index, value ) {
+
+		switch ( index ) {
+
+			case 0: this.x = value; break;
+			case 1: this.y = value; break;
+			default: throw new Error( 'THREE.Vector2: index is out of range: ' + index );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the value of the vector component which matches the given index.
+	 *
+	 * @param {number} index - The component index. `0` equals to x, `1` equals to y.
+	 * @return {number} A vector component value.
+	 */
+	getComponent( index ) {
+
+		switch ( index ) {
+
+			case 0: return this.x;
+			case 1: return this.y;
+			default: throw new Error( 'THREE.Vector2: index is out of range: ' + index );
+
+		}
+
+	}
+
+	/**
+	 * Returns a new vector with copied values from this instance.
+	 *
+	 * @return {Vector2} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor( this.x, this.y );
+
+	}
+
+	/**
+	 * Copies the values of the given vector to this instance.
+	 *
+	 * @param {Vector2} v - The vector to copy.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	copy( v ) {
+
+		this.x = v.x;
+		this.y = v.y;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given vector to this instance.
+	 *
+	 * @param {Vector2} v - The vector to add.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	add( v ) {
+
+		this.x += v.x;
+		this.y += v.y;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given scalar value to all components of this instance.
+	 *
+	 * @param {number} s - The scalar to add.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	addScalar( s ) {
+
+		this.x += s;
+		this.y += s;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given vectors and stores the result in this instance.
+	 *
+	 * @param {Vector2} a - The first vector.
+	 * @param {Vector2} b - The second vector.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	addVectors( a, b ) {
+
+		this.x = a.x + b.x;
+		this.y = a.y + b.y;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given vector scaled by the given factor to this instance.
+	 *
+	 * @param {Vector2} v - The vector.
+	 * @param {number} s - The factor that scales `v`.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	addScaledVector( v, s ) {
+
+		this.x += v.x * s;
+		this.y += v.y * s;
+
+		return this;
+
+	}
+
+	/**
+	 * Subtracts the given vector from this instance.
+	 *
+	 * @param {Vector2} v - The vector to subtract.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	sub( v ) {
+
+		this.x -= v.x;
+		this.y -= v.y;
+
+		return this;
+
+	}
+
+	/**
+	 * Subtracts the given scalar value from all components of this instance.
+	 *
+	 * @param {number} s - The scalar to subtract.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	subScalar( s ) {
+
+		this.x -= s;
+		this.y -= s;
+
+		return this;
+
+	}
+
+	/**
+	 * Subtracts the given vectors and stores the result in this instance.
+	 *
+	 * @param {Vector2} a - The first vector.
+	 * @param {Vector2} b - The second vector.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	subVectors( a, b ) {
+
+		this.x = a.x - b.x;
+		this.y = a.y - b.y;
+
+		return this;
+
+	}
+
+	/**
+	 * Multiplies the given vector with this instance.
+	 *
+	 * @param {Vector2} v - The vector to multiply.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	multiply( v ) {
+
+		this.x *= v.x;
+		this.y *= v.y;
+
+		return this;
+
+	}
+
+	/**
+	 * Multiplies the given scalar value with all components of this instance.
+	 *
+	 * @param {number} scalar - The scalar to multiply.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	multiplyScalar( scalar ) {
+
+		this.x *= scalar;
+		this.y *= scalar;
+
+		return this;
+
+	}
+
+	/**
+	 * Divides this instance by the given vector.
+	 *
+	 * @param {Vector2} v - The vector to divide.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	divide( v ) {
+
+		this.x /= v.x;
+		this.y /= v.y;
+
+		return this;
+
+	}
+
+	/**
+	 * Divides this vector by the given scalar.
+	 *
+	 * @param {number} scalar - The scalar to divide.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	divideScalar( scalar ) {
+
+		return this.multiplyScalar( 1 / scalar );
+
+	}
+
+	/**
+	 * Multiplies this vector (with an implicit 1 as the 3rd component) by
+	 * the given 3x3 matrix.
+	 *
+	 * @param {Matrix3} m - The matrix to apply.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	applyMatrix3( m ) {
+
+		const x = this.x, y = this.y;
+		const e = m.elements;
+
+		this.x = e[ 0 ] * x + e[ 3 ] * y + e[ 6 ];
+		this.y = e[ 1 ] * x + e[ 4 ] * y + e[ 7 ];
+
+		return this;
+
+	}
+
+	/**
+	 * If this vector's x or y value is greater than the given vector's x or y
+	 * value, replace that value with the corresponding min value.
+	 *
+	 * @param {Vector2} v - The vector.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	min( v ) {
+
+		this.x = Math.min( this.x, v.x );
+		this.y = Math.min( this.y, v.y );
+
+		return this;
+
+	}
+
+	/**
+	 * If this vector's x or y value is less than the given vector's x or y
+	 * value, replace that value with the corresponding max value.
+	 *
+	 * @param {Vector2} v - The vector.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	max( v ) {
+
+		this.x = Math.max( this.x, v.x );
+		this.y = Math.max( this.y, v.y );
+
+		return this;
+
+	}
+
+	/**
+	 * If this vector's x or y value is greater than the max vector's x or y
+	 * value, it is replaced by the corresponding value.
+	 * If this vector's x or y value is less than the min vector's x or y value,
+	 * it is replaced by the corresponding value.
+	 *
+	 * @param {Vector2} min - The minimum x and y values.
+	 * @param {Vector2} max - The maximum x and y values in the desired range.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	clamp( min, max ) {
+
+		// assumes min < max, componentwise
+
+		this.x = clamp( this.x, min.x, max.x );
+		this.y = clamp( this.y, min.y, max.y );
+
+		return this;
+
+	}
+
+	/**
+	 * If this vector's x or y values are greater than the max value, they are
+	 * replaced by the max value.
+	 * If this vector's x or y values are less than the min value, they are
+	 * replaced by the min value.
+	 *
+	 * @param {number} minVal - The minimum value the components will be clamped to.
+	 * @param {number} maxVal - The maximum value the components will be clamped to.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	clampScalar( minVal, maxVal ) {
+
+		this.x = clamp( this.x, minVal, maxVal );
+		this.y = clamp( this.y, minVal, maxVal );
+
+		return this;
+
+	}
+
+	/**
+	 * If this vector's length is greater than the max value, it is replaced by
+	 * the max value.
+	 * If this vector's length is less than the min value, it is replaced by the
+	 * min value.
+	 *
+	 * @param {number} min - The minimum value the vector length will be clamped to.
+	 * @param {number} max - The maximum value the vector length will be clamped to.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	clampLength( min, max ) {
+
+		const length = this.length();
+
+		return this.divideScalar( length || 1 ).multiplyScalar( clamp( length, min, max ) );
+
+	}
+
+	/**
+	 * The components of this vector are rounded down to the nearest integer value.
+	 *
+	 * @return {Vector2} A reference to this vector.
+	 */
+	floor() {
+
+		this.x = Math.floor( this.x );
+		this.y = Math.floor( this.y );
+
+		return this;
+
+	}
+
+	/**
+	 * The components of this vector are rounded up to the nearest integer value.
+	 *
+	 * @return {Vector2} A reference to this vector.
+	 */
+	ceil() {
+
+		this.x = Math.ceil( this.x );
+		this.y = Math.ceil( this.y );
+
+		return this;
+
+	}
+
+	/**
+	 * The components of this vector are rounded to the nearest integer value
+	 *
+	 * @return {Vector2} A reference to this vector.
+	 */
+	round() {
+
+		this.x = Math.round( this.x );
+		this.y = Math.round( this.y );
+
+		return this;
+
+	}
+
+	/**
+	 * The components of this vector are rounded towards zero (up if negative,
+	 * down if positive) to an integer value.
+	 *
+	 * @return {Vector2} A reference to this vector.
+	 */
+	roundToZero() {
+
+		this.x = Math.trunc( this.x );
+		this.y = Math.trunc( this.y );
+
+		return this;
+
+	}
+
+	/**
+	 * Inverts this vector - i.e. sets x = -x and y = -y.
+	 *
+	 * @return {Vector2} A reference to this vector.
+	 */
+	negate() {
+
+		this.x = - this.x;
+		this.y = - this.y;
+
+		return this;
+
+	}
+
+	/**
+	 * Calculates the dot product of the given vector with this instance.
+	 *
+	 * @param {Vector2} v - The vector to compute the dot product with.
+	 * @return {number} The result of the dot product.
+	 */
+	dot( v ) {
+
+		return this.x * v.x + this.y * v.y;
+
+	}
+
+	/**
+	 * Calculates the cross product of the given vector with this instance.
+	 *
+	 * @param {Vector2} v - The vector to compute the cross product with.
+	 * @return {number} The result of the cross product.
+	 */
+	cross( v ) {
+
+		return this.x * v.y - this.y * v.x;
+
+	}
+
+	/**
+	 * Computes the square of the Euclidean length (straight-line length) from
+	 * (0, 0) to (x, y). If you are comparing the lengths of vectors, you should
+	 * compare the length squared instead as it is slightly more efficient to calculate.
+	 *
+	 * @return {number} The square length of this vector.
+	 */
+	lengthSq() {
+
+		return this.x * this.x + this.y * this.y;
+
+	}
+
+	/**
+	 * Computes the  Euclidean length (straight-line length) from (0, 0) to (x, y).
+	 *
+	 * @return {number} The length of this vector.
+	 */
+	length() {
+
+		return Math.sqrt( this.x * this.x + this.y * this.y );
+
+	}
+
+	/**
+	 * Computes the Manhattan length of this vector.
+	 *
+	 * @return {number} The length of this vector.
+	 */
+	manhattanLength() {
+
+		return Math.abs( this.x ) + Math.abs( this.y );
+
+	}
+
+	/**
+	 * Converts this vector to a unit vector - that is, sets it equal to a vector
+	 * with the same direction as this one, but with a vector length of `1`.
+	 *
+	 * @return {Vector2} A reference to this vector.
+	 */
+	normalize() {
+
+		return this.divideScalar( this.length() || 1 );
+
+	}
+
+	/**
+	 * Computes the angle in radians of this vector with respect to the positive x-axis.
+	 *
+	 * @return {number} The angle in radians.
+	 */
+	angle() {
+
+		const angle = Math.atan2( - this.y, - this.x ) + Math.PI;
+
+		return angle;
+
+	}
+
+	/**
+	 * Returns the angle between the given vector and this instance in radians.
+	 *
+	 * @param {Vector2} v - The vector to compute the angle with.
+	 * @return {number} The angle in radians.
+	 */
+	angleTo( v ) {
+
+		const denominator = Math.sqrt( this.lengthSq() * v.lengthSq() );
+
+		if ( denominator === 0 ) return Math.PI / 2;
+
+		const theta = this.dot( v ) / denominator;
+
+		// clamp, to handle numerical problems
+
+		return Math.acos( clamp( theta, -1, 1 ) );
+
+	}
+
+	/**
+	 * Computes the distance from the given vector to this instance.
+	 *
+	 * @param {Vector2} v - The vector to compute the distance to.
+	 * @return {number} The distance.
+	 */
+	distanceTo( v ) {
+
+		return Math.sqrt( this.distanceToSquared( v ) );
+
+	}
+
+	/**
+	 * Computes the squared distance from the given vector to this instance.
+	 * If you are just comparing the distance with another distance, you should compare
+	 * the distance squared instead as it is slightly more efficient to calculate.
+	 *
+	 * @param {Vector2} v - The vector to compute the squared distance to.
+	 * @return {number} The squared distance.
+	 */
+	distanceToSquared( v ) {
+
+		const dx = this.x - v.x, dy = this.y - v.y;
+		return dx * dx + dy * dy;
+
+	}
+
+	/**
+	 * Computes the Manhattan distance from the given vector to this instance.
+	 *
+	 * @param {Vector2} v - The vector to compute the Manhattan distance to.
+	 * @return {number} The Manhattan distance.
+	 */
+	manhattanDistanceTo( v ) {
+
+		return Math.abs( this.x - v.x ) + Math.abs( this.y - v.y );
+
+	}
+
+	/**
+	 * Sets this vector to a vector with the same direction as this one, but
+	 * with the specified length.
+	 *
+	 * @param {number} length - The new length of this vector.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	setLength( length ) {
+
+		return this.normalize().multiplyScalar( length );
+
+	}
+
+	/**
+	 * Linearly interpolates between the given vector and this instance, where
+	 * alpha is the percent distance along the line - alpha = 0 will be this
+	 * vector, and alpha = 1 will be the given one.
+	 *
+	 * @param {Vector2} v - The vector to interpolate towards.
+	 * @param {number} alpha - The interpolation factor, typically in the closed interval `[0, 1]`.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	lerp( v, alpha ) {
+
+		this.x += ( v.x - this.x ) * alpha;
+		this.y += ( v.y - this.y ) * alpha;
+
+		return this;
+
+	}
+
+	/**
+	 * Linearly interpolates between the given vectors, where alpha is the percent
+	 * distance along the line - alpha = 0 will be first vector, and alpha = 1 will
+	 * be the second one. The result is stored in this instance.
+	 *
+	 * @param {Vector2} v1 - The first vector.
+	 * @param {Vector2} v2 - The second vector.
+	 * @param {number} alpha - The interpolation factor, typically in the closed interval `[0, 1]`.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	lerpVectors( v1, v2, alpha ) {
+
+		this.x = v1.x + ( v2.x - v1.x ) * alpha;
+		this.y = v1.y + ( v2.y - v1.y ) * alpha;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this vector is equal with the given one.
+	 *
+	 * @param {Vector2} v - The vector to test for equality.
+	 * @return {boolean} Whether this vector is equal with the given one.
+	 */
+	equals( v ) {
+
+		return ( ( v.x === this.x ) && ( v.y === this.y ) );
+
+	}
+
+	/**
+	 * Sets this vector's x value to be `array[ offset ]` and y
+	 * value to be `array[ offset + 1 ]`.
+	 *
+	 * @param {Array<number>} array - An array holding the vector component values.
+	 * @param {number} [offset=0] - The offset into the array.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	fromArray( array, offset = 0 ) {
+
+		this.x = array[ offset ];
+		this.y = array[ offset + 1 ];
+
+		return this;
+
+	}
+
+	/**
+	 * Writes the components of this vector to the given array. If no array is provided,
+	 * the method returns a new instance.
+	 *
+	 * @param {Array<number>} [array=[]] - The target array holding the vector components.
+	 * @param {number} [offset=0] - Index of the first element in the array.
+	 * @return {Array<number>} The vector components.
+	 */
+	toArray( array = [], offset = 0 ) {
+
+		array[ offset ] = this.x;
+		array[ offset + 1 ] = this.y;
+
+		return array;
+
+	}
+
+	/**
+	 * Sets the components of this vector from the given buffer attribute.
+	 *
+	 * @param {BufferAttribute} attribute - The buffer attribute holding vector data.
+	 * @param {number} index - The index into the attribute.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	fromBufferAttribute( attribute, index ) {
+
+		this.x = attribute.getX( index );
+		this.y = attribute.getY( index );
+
+		return this;
+
+	}
+
+	/**
+	 * Rotates this vector around the given center by the given angle.
+	 *
+	 * @param {Vector2} center - The point around which to rotate.
+	 * @param {number} angle - The angle to rotate, in radians.
+	 * @return {Vector2} A reference to this vector.
+	 */
+	rotateAround( center, angle ) {
+
+		const c = Math.cos( angle ), s = Math.sin( angle );
+
+		const x = this.x - center.x;
+		const y = this.y - center.y;
+
+		this.x = x * c - y * s + center.x;
+		this.y = x * s + y * c + center.y;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets each component of this vector to a pseudo-random value between `0` and
+	 * `1`, excluding `1`.
+	 *
+	 * @return {Vector2} A reference to this vector.
+	 */
+	random() {
+
+		this.x = Math.random();
+		this.y = Math.random();
+
+		return this;
+
+	}
+
+	*[ Symbol.iterator ]() {
+
+		yield this.x;
+		yield this.y;
+
+	}
+
+}
+
+/**
+ * Class for representing a Quaternion. Quaternions are used in three.js to represent rotations.
+ *
+ * Iterating through a vector instance will yield its components `(x, y, z, w)` in
+ * the corresponding order.
+ *
+ * Note that three.js expects Quaternions to be normalized.
+ * ```js
+ * const quaternion = new THREE.Quaternion();
+ * quaternion.setFromAxisAngle( new THREE.Vector3( 0, 1, 0 ), Math.PI / 2 );
+ *
+ * const vector = new THREE.Vector3( 1, 0, 0 );
+ * vector.applyQuaternion( quaternion );
+ * ```
+ */
+class Quaternion {
+
+	/**
+	 * Constructs a new quaternion.
+	 *
+	 * @param {number} [x=0] - The x value of this quaternion.
+	 * @param {number} [y=0] - The y value of this quaternion.
+	 * @param {number} [z=0] - The z value of this quaternion.
+	 * @param {number} [w=1] - The w value of this quaternion.
+	 */
+	constructor( x = 0, y = 0, z = 0, w = 1 ) {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isQuaternion = true;
+
+		this._x = x;
+		this._y = y;
+		this._z = z;
+		this._w = w;
+
+	}
+
+	/**
+	 * Interpolates between two quaternions via SLERP. This implementation assumes the
+	 * quaternion data are managed in flat arrays.
+	 *
+	 * @param {Array<number>} dst - The destination array.
+	 * @param {number} dstOffset - An offset into the destination array.
+	 * @param {Array<number>} src0 - The source array of the first quaternion.
+	 * @param {number} srcOffset0 - An offset into the first source array.
+	 * @param {Array<number>} src1 -  The source array of the second quaternion.
+	 * @param {number} srcOffset1 - An offset into the second source array.
+	 * @param {number} t - The interpolation factor. A value in the range `[0,1]` will interpolate. A value outside the range `[0,1]` will extrapolate.
+	 * @see {@link Quaternion#slerp}
+	 */
+	static slerpFlat( dst, dstOffset, src0, srcOffset0, src1, srcOffset1, t ) {
+
+		let x0 = src0[ srcOffset0 + 0 ],
+			y0 = src0[ srcOffset0 + 1 ],
+			z0 = src0[ srcOffset0 + 2 ],
+			w0 = src0[ srcOffset0 + 3 ];
+
+		let x1 = src1[ srcOffset1 + 0 ],
+			y1 = src1[ srcOffset1 + 1 ],
+			z1 = src1[ srcOffset1 + 2 ],
+			w1 = src1[ srcOffset1 + 3 ];
+
+		if ( w0 !== w1 || x0 !== x1 || y0 !== y1 || z0 !== z1 ) {
+
+			let dot = x0 * x1 + y0 * y1 + z0 * z1 + w0 * w1;
+
+			if ( dot < 0 ) {
+
+				x1 = - x1;
+				y1 = - y1;
+				z1 = - z1;
+				w1 = - w1;
+
+				dot = - dot;
+
+			}
+
+			let s = 1 - t;
+
+			if ( dot < 0.9995 ) {
+
+				// slerp
+
+				const theta = Math.acos( dot );
+				const sin = Math.sin( theta );
+
+				s = Math.sin( s * theta ) / sin;
+				t = Math.sin( t * theta ) / sin;
+
+				x0 = x0 * s + x1 * t;
+				y0 = y0 * s + y1 * t;
+				z0 = z0 * s + z1 * t;
+				w0 = w0 * s + w1 * t;
+
+			} else {
+
+				// for small angles, lerp then normalize
+
+				x0 = x0 * s + x1 * t;
+				y0 = y0 * s + y1 * t;
+				z0 = z0 * s + z1 * t;
+				w0 = w0 * s + w1 * t;
+
+				const f = 1 / Math.sqrt( x0 * x0 + y0 * y0 + z0 * z0 + w0 * w0 );
+
+				x0 *= f;
+				y0 *= f;
+				z0 *= f;
+				w0 *= f;
+
+			}
+
+		}
+
+		dst[ dstOffset ] = x0;
+		dst[ dstOffset + 1 ] = y0;
+		dst[ dstOffset + 2 ] = z0;
+		dst[ dstOffset + 3 ] = w0;
+
+	}
+
+	/**
+	 * Multiplies two quaternions. This implementation assumes the quaternion data are managed
+	 * in flat arrays.
+	 *
+	 * @param {Array<number>} dst - The destination array.
+	 * @param {number} dstOffset - An offset into the destination array.
+	 * @param {Array<number>} src0 - The source array of the first quaternion.
+	 * @param {number} srcOffset0 - An offset into the first source array.
+	 * @param {Array<number>} src1 -  The source array of the second quaternion.
+	 * @param {number} srcOffset1 - An offset into the second source array.
+	 * @return {Array<number>} The destination array.
+	 * @see {@link Quaternion#multiplyQuaternions}.
+	 */
+	static multiplyQuaternionsFlat( dst, dstOffset, src0, srcOffset0, src1, srcOffset1 ) {
+
+		const x0 = src0[ srcOffset0 ];
+		const y0 = src0[ srcOffset0 + 1 ];
+		const z0 = src0[ srcOffset0 + 2 ];
+		const w0 = src0[ srcOffset0 + 3 ];
+
+		const x1 = src1[ srcOffset1 ];
+		const y1 = src1[ srcOffset1 + 1 ];
+		const z1 = src1[ srcOffset1 + 2 ];
+		const w1 = src1[ srcOffset1 + 3 ];
+
+		dst[ dstOffset ] = x0 * w1 + w0 * x1 + y0 * z1 - z0 * y1;
+		dst[ dstOffset + 1 ] = y0 * w1 + w0 * y1 + z0 * x1 - x0 * z1;
+		dst[ dstOffset + 2 ] = z0 * w1 + w0 * z1 + x0 * y1 - y0 * x1;
+		dst[ dstOffset + 3 ] = w0 * w1 - x0 * x1 - y0 * y1 - z0 * z1;
+
+		return dst;
+
+	}
+
+	/**
+	 * The x value of this quaternion.
+	 *
+	 * @type {number}
+	 * @default 0
+	 */
+	get x() {
+
+		return this._x;
+
+	}
+
+	set x( value ) {
+
+		this._x = value;
+		this._onChangeCallback();
+
+	}
+
+	/**
+	 * The y value of this quaternion.
+	 *
+	 * @type {number}
+	 * @default 0
+	 */
+	get y() {
+
+		return this._y;
+
+	}
+
+	set y( value ) {
+
+		this._y = value;
+		this._onChangeCallback();
+
+	}
+
+	/**
+	 * The z value of this quaternion.
+	 *
+	 * @type {number}
+	 * @default 0
+	 */
+	get z() {
+
+		return this._z;
+
+	}
+
+	set z( value ) {
+
+		this._z = value;
+		this._onChangeCallback();
+
+	}
+
+	/**
+	 * The w value of this quaternion.
+	 *
+	 * @type {number}
+	 * @default 1
+	 */
+	get w() {
+
+		return this._w;
+
+	}
+
+	set w( value ) {
+
+		this._w = value;
+		this._onChangeCallback();
+
+	}
+
+	/**
+	 * Sets the quaternion components.
+	 *
+	 * @param {number} x - The x value of this quaternion.
+	 * @param {number} y - The y value of this quaternion.
+	 * @param {number} z - The z value of this quaternion.
+	 * @param {number} w - The w value of this quaternion.
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	set( x, y, z, w ) {
+
+		this._x = x;
+		this._y = y;
+		this._z = z;
+		this._w = w;
+
+		this._onChangeCallback();
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new quaternion with copied values from this instance.
+	 *
+	 * @return {Quaternion} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor( this._x, this._y, this._z, this._w );
+
+	}
+
+	/**
+	 * Copies the values of the given quaternion to this instance.
+	 *
+	 * @param {Quaternion} quaternion - The quaternion to copy.
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	copy( quaternion ) {
+
+		this._x = quaternion.x;
+		this._y = quaternion.y;
+		this._z = quaternion.z;
+		this._w = quaternion.w;
+
+		this._onChangeCallback();
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this quaternion from the rotation specified by the given
+	 * Euler angles.
+	 *
+	 * @param {Euler} euler - The Euler angles.
+	 * @param {boolean} [update=true] - Whether the internal `onChange` callback should be executed or not.
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	setFromEuler( euler, update = true ) {
+
+		const x = euler._x, y = euler._y, z = euler._z, order = euler._order;
+
+		const cos = Math.cos;
+		const sin = Math.sin;
+
+		const c1 = cos( x / 2 );
+		const c2 = cos( y / 2 );
+		const c3 = cos( z / 2 );
+
+		const s1 = sin( x / 2 );
+		const s2 = sin( y / 2 );
+		const s3 = sin( z / 2 );
+
+		switch ( order ) {
+
+			case 'XYZ':
+				this._x = s1 * c2 * c3 + c1 * s2 * s3;
+				this._y = c1 * s2 * c3 - s1 * c2 * s3;
+				this._z = c1 * c2 * s3 + s1 * s2 * c3;
+				this._w = c1 * c2 * c3 - s1 * s2 * s3;
+				break;
+
+			case 'YXZ':
+				this._x = s1 * c2 * c3 + c1 * s2 * s3;
+				this._y = c1 * s2 * c3 - s1 * c2 * s3;
+				this._z = c1 * c2 * s3 - s1 * s2 * c3;
+				this._w = c1 * c2 * c3 + s1 * s2 * s3;
+				break;
+
+			case 'ZXY':
+				this._x = s1 * c2 * c3 - c1 * s2 * s3;
+				this._y = c1 * s2 * c3 + s1 * c2 * s3;
+				this._z = c1 * c2 * s3 + s1 * s2 * c3;
+				this._w = c1 * c2 * c3 - s1 * s2 * s3;
+				break;
+
+			case 'ZYX':
+				this._x = s1 * c2 * c3 - c1 * s2 * s3;
+				this._y = c1 * s2 * c3 + s1 * c2 * s3;
+				this._z = c1 * c2 * s3 - s1 * s2 * c3;
+				this._w = c1 * c2 * c3 + s1 * s2 * s3;
+				break;
+
+			case 'YZX':
+				this._x = s1 * c2 * c3 + c1 * s2 * s3;
+				this._y = c1 * s2 * c3 + s1 * c2 * s3;
+				this._z = c1 * c2 * s3 - s1 * s2 * c3;
+				this._w = c1 * c2 * c3 - s1 * s2 * s3;
+				break;
+
+			case 'XZY':
+				this._x = s1 * c2 * c3 - c1 * s2 * s3;
+				this._y = c1 * s2 * c3 - s1 * c2 * s3;
+				this._z = c1 * c2 * s3 + s1 * s2 * c3;
+				this._w = c1 * c2 * c3 + s1 * s2 * s3;
+				break;
+
+			default:
+				warn( 'Quaternion: .setFromEuler() encountered an unknown order: ' + order );
+
+		}
+
+		if ( update === true ) this._onChangeCallback();
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this quaternion from the given axis and angle.
+	 *
+	 * @param {Vector3} axis - The normalized axis.
+	 * @param {number} angle - The angle in radians.
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	setFromAxisAngle( axis, angle ) {
+
+		const halfAngle = angle / 2, s = Math.sin( halfAngle );
+
+		this._x = axis.x * s;
+		this._y = axis.y * s;
+		this._z = axis.z * s;
+		this._w = Math.cos( halfAngle );
+
+		this._onChangeCallback();
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this quaternion from the given rotation matrix.
+	 *
+	 * @param {Matrix4} m - A 4x4 matrix of which the upper 3x3 of matrix is a pure rotation matrix (i.e. unscaled).
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	setFromRotationMatrix( m ) {
+
+		// assumes the upper 3x3 of m is a pure rotation matrix (i.e, unscaled)
+
+		const te = m.elements,
+
+			m11 = te[ 0 ], m12 = te[ 4 ], m13 = te[ 8 ],
+			m21 = te[ 1 ], m22 = te[ 5 ], m23 = te[ 9 ],
+			m31 = te[ 2 ], m32 = te[ 6 ], m33 = te[ 10 ],
+
+			trace = m11 + m22 + m33;
+
+		if ( trace > 0 ) {
+
+			const s = 0.5 / Math.sqrt( trace + 1.0 );
+
+			this._w = 0.25 / s;
+			this._x = ( m32 - m23 ) * s;
+			this._y = ( m13 - m31 ) * s;
+			this._z = ( m21 - m12 ) * s;
+
+		} else if ( m11 > m22 && m11 > m33 ) {
+
+			const s = 2.0 * Math.sqrt( 1.0 + m11 - m22 - m33 );
+
+			this._w = ( m32 - m23 ) / s;
+			this._x = 0.25 * s;
+			this._y = ( m12 + m21 ) / s;
+			this._z = ( m13 + m31 ) / s;
+
+		} else if ( m22 > m33 ) {
+
+			const s = 2.0 * Math.sqrt( 1.0 + m22 - m11 - m33 );
+
+			this._w = ( m13 - m31 ) / s;
+			this._x = ( m12 + m21 ) / s;
+			this._y = 0.25 * s;
+			this._z = ( m23 + m32 ) / s;
+
+		} else {
+
+			const s = 2.0 * Math.sqrt( 1.0 + m33 - m11 - m22 );
+
+			this._w = ( m21 - m12 ) / s;
+			this._x = ( m13 + m31 ) / s;
+			this._y = ( m23 + m32 ) / s;
+			this._z = 0.25 * s;
+
+		}
+
+		this._onChangeCallback();
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this quaternion to the rotation required to rotate the direction vector
+	 * `vFrom` to the direction vector `vTo`.
+	 *
+	 * @param {Vector3} vFrom - The first (normalized) direction vector.
+	 * @param {Vector3} vTo - The second (normalized) direction vector.
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	setFromUnitVectors( vFrom, vTo ) {
+
+		// assumes direction vectors vFrom and vTo are normalized
+
+		let r = vFrom.dot( vTo ) + 1;
+
+		if ( r < 1e-8 ) { // the epsilon value has been discussed in #31286
+
+			// vFrom and vTo point in opposite directions
+
+			r = 0;
+
+			if ( Math.abs( vFrom.x ) > Math.abs( vFrom.z ) ) {
+
+				this._x = - vFrom.y;
+				this._y = vFrom.x;
+				this._z = 0;
+				this._w = r;
+
+			} else {
+
+				this._x = 0;
+				this._y = - vFrom.z;
+				this._z = vFrom.y;
+				this._w = r;
+
+			}
+
+		} else {
+
+			// crossVectors( vFrom, vTo ); // inlined to avoid cyclic dependency on Vector3
+
+			this._x = vFrom.y * vTo.z - vFrom.z * vTo.y;
+			this._y = vFrom.z * vTo.x - vFrom.x * vTo.z;
+			this._z = vFrom.x * vTo.y - vFrom.y * vTo.x;
+			this._w = r;
+
+		}
+
+		return this.normalize();
+
+	}
+
+	/**
+	 * Returns the angle between this quaternion and the given one in radians.
+	 *
+	 * @param {Quaternion} q - The quaternion to compute the angle with.
+	 * @return {number} The angle in radians.
+	 */
+	angleTo( q ) {
+
+		return 2 * Math.acos( Math.abs( clamp( this.dot( q ), -1, 1 ) ) );
+
+	}
+
+	/**
+	 * Rotates this quaternion by a given angular step to the given quaternion.
+	 * The method ensures that the final quaternion will not overshoot `q`.
+	 *
+	 * @param {Quaternion} q - The target quaternion.
+	 * @param {number} step - The angular step in radians.
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	rotateTowards( q, step ) {
+
+		const angle = this.angleTo( q );
+
+		if ( angle === 0 ) return this;
+
+		const t = Math.min( 1, step / angle );
+
+		this.slerp( q, t );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this quaternion to the identity quaternion; that is, to the
+	 * quaternion that represents "no rotation".
+	 *
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	identity() {
+
+		return this.set( 0, 0, 0, 1 );
+
+	}
+
+	/**
+	 * Inverts this quaternion via {@link Quaternion#conjugate}. The
+	 * quaternion is assumed to have unit length.
+	 *
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	invert() {
+
+		return this.conjugate();
+
+	}
+
+	/**
+	 * Returns the rotational conjugate of this quaternion. The conjugate of a
+	 * quaternion represents the same rotation in the opposite direction about
+	 * the rotational axis.
+	 *
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	conjugate() {
+
+		this._x *= -1;
+		this._y *= -1;
+		this._z *= -1;
+
+		this._onChangeCallback();
+
+		return this;
+
+	}
+
+	/**
+	 * Calculates the dot product of this quaternion and the given one.
+	 *
+	 * @param {Quaternion} v - The quaternion to compute the dot product with.
+	 * @return {number} The result of the dot product.
+	 */
+	dot( v ) {
+
+		return this._x * v._x + this._y * v._y + this._z * v._z + this._w * v._w;
+
+	}
+
+	/**
+	 * Computes the squared Euclidean length (straight-line length) of this quaternion,
+	 * considered as a 4 dimensional vector. This can be useful if you are comparing the
+	 * lengths of two quaternions, as this is a slightly more efficient calculation than
+	 * {@link Quaternion#length}.
+	 *
+	 * @return {number} The squared Euclidean length.
+	 */
+	lengthSq() {
+
+		return this._x * this._x + this._y * this._y + this._z * this._z + this._w * this._w;
+
+	}
+
+	/**
+	 * Computes the Euclidean length (straight-line length) of this quaternion,
+	 * considered as a 4 dimensional vector.
+	 *
+	 * @return {number} The Euclidean length.
+	 */
+	length() {
+
+		return Math.sqrt( this._x * this._x + this._y * this._y + this._z * this._z + this._w * this._w );
+
+	}
+
+	/**
+	 * Normalizes this quaternion - that is, calculated the quaternion that performs
+	 * the same rotation as this one, but has a length equal to `1`.
+	 *
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	normalize() {
+
+		let l = this.length();
+
+		if ( l === 0 ) {
+
+			this._x = 0;
+			this._y = 0;
+			this._z = 0;
+			this._w = 1;
+
+		} else {
+
+			l = 1 / l;
+
+			this._x = this._x * l;
+			this._y = this._y * l;
+			this._z = this._z * l;
+			this._w = this._w * l;
+
+		}
+
+		this._onChangeCallback();
+
+		return this;
+
+	}
+
+	/**
+	 * Multiplies this quaternion by the given one.
+	 *
+	 * @param {Quaternion} q - The quaternion.
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	multiply( q ) {
+
+		return this.multiplyQuaternions( this, q );
+
+	}
+
+	/**
+	 * Pre-multiplies this quaternion by the given one.
+	 *
+	 * @param {Quaternion} q - The quaternion.
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	premultiply( q ) {
+
+		return this.multiplyQuaternions( q, this );
+
+	}
+
+	/**
+	 * Multiplies the given quaternions and stores the result in this instance.
+	 *
+	 * @param {Quaternion} a - The first quaternion.
+	 * @param {Quaternion} b - The second quaternion.
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	multiplyQuaternions( a, b ) {
+
+		const qax = a._x, qay = a._y, qaz = a._z, qaw = a._w;
+		const qbx = b._x, qby = b._y, qbz = b._z, qbw = b._w;
+
+		this._x = qax * qbw + qaw * qbx + qay * qbz - qaz * qby;
+		this._y = qay * qbw + qaw * qby + qaz * qbx - qax * qbz;
+		this._z = qaz * qbw + qaw * qbz + qax * qby - qay * qbx;
+		this._w = qaw * qbw - qax * qbx - qay * qby - qaz * qbz;
+
+		this._onChangeCallback();
+
+		return this;
+
+	}
+
+	/**
+	 * Performs a spherical linear interpolation between this quaternion and the target quaternion.
+	 *
+	 * @param {Quaternion} qb - The target quaternion.
+	 * @param {number} t - The interpolation factor. A value in the range `[0,1]` will interpolate. A value outside the range `[0,1]` will extrapolate.
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	slerp( qb, t ) {
+
+		let x = qb._x, y = qb._y, z = qb._z, w = qb._w;
+
+		let dot = this.dot( qb );
+
+		if ( dot < 0 ) {
+
+			x = - x;
+			y = - y;
+			z = - z;
+			w = - w;
+
+			dot = - dot;
+
+		}
+
+		let s = 1 - t;
+
+		if ( dot < 0.9995 ) {
+
+			// slerp
+
+			const theta = Math.acos( dot );
+			const sin = Math.sin( theta );
+
+			s = Math.sin( s * theta ) / sin;
+			t = Math.sin( t * theta ) / sin;
+
+			this._x = this._x * s + x * t;
+			this._y = this._y * s + y * t;
+			this._z = this._z * s + z * t;
+			this._w = this._w * s + w * t;
+
+			this._onChangeCallback();
+
+		} else {
+
+			// for small angles, lerp then normalize
+
+			this._x = this._x * s + x * t;
+			this._y = this._y * s + y * t;
+			this._z = this._z * s + z * t;
+			this._w = this._w * s + w * t;
+
+			this.normalize(); // normalize calls _onChangeCallback()
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Performs a spherical linear interpolation between the given quaternions
+	 * and stores the result in this quaternion.
+	 *
+	 * @param {Quaternion} qa - The source quaternion.
+	 * @param {Quaternion} qb - The target quaternion.
+	 * @param {number} t - The interpolation factor in the closed interval `[0, 1]`.
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	slerpQuaternions( qa, qb, t ) {
+
+		return this.copy( qa ).slerp( qb, t );
+
+	}
+
+	/**
+	 * Sets this quaternion to a uniformly random, normalized quaternion.
+	 *
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	random() {
+
+		// Ken Shoemake
+		// Uniform random rotations
+		// D. Kirk, editor, Graphics Gems III, pages 124-132. Academic Press, New York, 1992.
+
+		const theta1 = 2 * Math.PI * Math.random();
+		const theta2 = 2 * Math.PI * Math.random();
+
+		const x0 = Math.random();
+		const r1 = Math.sqrt( 1 - x0 );
+		const r2 = Math.sqrt( x0 );
+
+		return this.set(
+			r1 * Math.sin( theta1 ),
+			r1 * Math.cos( theta1 ),
+			r2 * Math.sin( theta2 ),
+			r2 * Math.cos( theta2 ),
+		);
+
+	}
+
+	/**
+	 * Returns `true` if this quaternion is equal with the given one.
+	 *
+	 * @param {Quaternion} quaternion - The quaternion to test for equality.
+	 * @return {boolean} Whether this quaternion is equal with the given one.
+	 */
+	equals( quaternion ) {
+
+		return ( quaternion._x === this._x ) && ( quaternion._y === this._y ) && ( quaternion._z === this._z ) && ( quaternion._w === this._w );
+
+	}
+
+	/**
+	 * Sets this quaternion's components from the given array.
+	 *
+	 * @param {Array<number>} array - An array holding the quaternion component values.
+	 * @param {number} [offset=0] - The offset into the array.
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	fromArray( array, offset = 0 ) {
+
+		this._x = array[ offset ];
+		this._y = array[ offset + 1 ];
+		this._z = array[ offset + 2 ];
+		this._w = array[ offset + 3 ];
+
+		this._onChangeCallback();
+
+		return this;
+
+	}
+
+	/**
+	 * Writes the components of this quaternion to the given array. If no array is provided,
+	 * the method returns a new instance.
+	 *
+	 * @param {Array<number>} [array=[]] - The target array holding the quaternion components.
+	 * @param {number} [offset=0] - Index of the first element in the array.
+	 * @return {Array<number>} The quaternion components.
+	 */
+	toArray( array = [], offset = 0 ) {
+
+		array[ offset ] = this._x;
+		array[ offset + 1 ] = this._y;
+		array[ offset + 2 ] = this._z;
+		array[ offset + 3 ] = this._w;
+
+		return array;
+
+	}
+
+	/**
+	 * Sets the components of this quaternion from the given buffer attribute.
+	 *
+	 * @param {BufferAttribute} attribute - The buffer attribute holding quaternion data.
+	 * @param {number} index - The index into the attribute.
+	 * @return {Quaternion} A reference to this quaternion.
+	 */
+	fromBufferAttribute( attribute, index ) {
+
+		this._x = attribute.getX( index );
+		this._y = attribute.getY( index );
+		this._z = attribute.getZ( index );
+		this._w = attribute.getW( index );
+
+		this._onChangeCallback();
+
+		return this;
+
+	}
+
+	/**
+	 * This methods defines the serialization result of this class. Returns the
+	 * numerical elements of this quaternion in an array of format `[x, y, z, w]`.
+	 *
+	 * @return {Array<number>} The serialized quaternion.
+	 */
+	toJSON() {
+
+		return this.toArray();
+
+	}
+
+	_onChange( callback ) {
+
+		this._onChangeCallback = callback;
+
+		return this;
+
+	}
+
+	_onChangeCallback() {}
+
+	*[ Symbol.iterator ]() {
+
+		yield this._x;
+		yield this._y;
+		yield this._z;
+		yield this._w;
+
+	}
+
+}
+
+/**
+ * Class representing a 3D vector. A 3D vector is an ordered triplet of numbers
+ * (labeled x, y and z), which can be used to represent a number of things, such as:
+ *
+ * - A point in 3D space.
+ * - A direction and length in 3D space. In three.js the length will
+ * always be the Euclidean distance(straight-line distance) from `(0, 0, 0)` to `(x, y, z)`
+ * and the direction is also measured from `(0, 0, 0)` towards `(x, y, z)`.
+ * - Any arbitrary ordered triplet of numbers.
+ *
+ * There are other things a 3D vector can be used to represent, such as
+ * momentum vectors and so on, however these are the most
+ * common uses in three.js.
+ *
+ * Iterating through a vector instance will yield its components `(x, y, z)` in
+ * the corresponding order.
+ * ```js
+ * const a = new THREE.Vector3( 0, 1, 0 );
+ *
+ * //no arguments; will be initialised to (0, 0, 0)
+ * const b = new THREE.Vector3( );
+ *
+ * const d = a.distanceTo( b );
+ * ```
+ */
+class Vector3 {
+
+	static {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		Vector3.prototype.isVector3 = true;
+
+	}
+
+	/**
+	 * Constructs a new 3D vector.
+	 *
+	 * @param {number} [x=0] - The x value of this vector.
+	 * @param {number} [y=0] - The y value of this vector.
+	 * @param {number} [z=0] - The z value of this vector.
+	 */
+	constructor( x = 0, y = 0, z = 0 ) {
+
+		/**
+		 * The x value of this vector.
+		 *
+		 * @type {number}
+		 */
+		this.x = x;
+
+		/**
+		 * The y value of this vector.
+		 *
+		 * @type {number}
+		 */
+		this.y = y;
+
+		/**
+		 * The z value of this vector.
+		 *
+		 * @type {number}
+		 */
+		this.z = z;
+
+	}
+
+	/**
+	 * Sets the vector components.
+	 *
+	 * @param {number} x - The value of the x component.
+	 * @param {number} y - The value of the y component.
+	 * @param {number} z - The value of the z component.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	set( x, y, z ) {
+
+		if ( z === undefined ) z = this.z; // sprite.scale.set(x,y)
+
+		this.x = x;
+		this.y = y;
+		this.z = z;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector components to the same value.
+	 *
+	 * @param {number} scalar - The value to set for all vector components.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setScalar( scalar ) {
+
+		this.x = scalar;
+		this.y = scalar;
+		this.z = scalar;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector's x component to the given value.
+	 *
+	 * @param {number} x - The value to set.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setX( x ) {
+
+		this.x = x;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector's y component to the given value.
+	 *
+	 * @param {number} y - The value to set.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setY( y ) {
+
+		this.y = y;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector's z component to the given value.
+	 *
+	 * @param {number} z - The value to set.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setZ( z ) {
+
+		this.z = z;
+
+		return this;
+
+	}
+
+	/**
+	 * Allows to set a vector component with an index.
+	 *
+	 * @param {number} index - The component index. `0` equals to x, `1` equals to y, `2` equals to z.
+	 * @param {number} value - The value to set.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setComponent( index, value ) {
+
+		switch ( index ) {
+
+			case 0: this.x = value; break;
+			case 1: this.y = value; break;
+			case 2: this.z = value; break;
+			default: throw new Error( 'THREE.Vector3: index is out of range: ' + index );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the value of the vector component which matches the given index.
+	 *
+	 * @param {number} index - The component index. `0` equals to x, `1` equals to y, `2` equals to z.
+	 * @return {number} A vector component value.
+	 */
+	getComponent( index ) {
+
+		switch ( index ) {
+
+			case 0: return this.x;
+			case 1: return this.y;
+			case 2: return this.z;
+			default: throw new Error( 'THREE.Vector3: index is out of range: ' + index );
+
+		}
+
+	}
+
+	/**
+	 * Returns a new vector with copied values from this instance.
+	 *
+	 * @return {Vector3} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor( this.x, this.y, this.z );
+
+	}
+
+	/**
+	 * Copies the values of the given vector to this instance.
+	 *
+	 * @param {Vector3} v - The vector to copy.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	copy( v ) {
+
+		this.x = v.x;
+		this.y = v.y;
+		this.z = v.z;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given vector to this instance.
+	 *
+	 * @param {Vector3} v - The vector to add.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	add( v ) {
+
+		this.x += v.x;
+		this.y += v.y;
+		this.z += v.z;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given scalar value to all components of this instance.
+	 *
+	 * @param {number} s - The scalar to add.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	addScalar( s ) {
+
+		this.x += s;
+		this.y += s;
+		this.z += s;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given vectors and stores the result in this instance.
+	 *
+	 * @param {Vector3} a - The first vector.
+	 * @param {Vector3} b - The second vector.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	addVectors( a, b ) {
+
+		this.x = a.x + b.x;
+		this.y = a.y + b.y;
+		this.z = a.z + b.z;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given vector scaled by the given factor to this instance.
+	 *
+	 * @param {Vector3|Vector4} v - The vector.
+	 * @param {number} s - The factor that scales `v`.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	addScaledVector( v, s ) {
+
+		this.x += v.x * s;
+		this.y += v.y * s;
+		this.z += v.z * s;
+
+		return this;
+
+	}
+
+	/**
+	 * Subtracts the given vector from this instance.
+	 *
+	 * @param {Vector3} v - The vector to subtract.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	sub( v ) {
+
+		this.x -= v.x;
+		this.y -= v.y;
+		this.z -= v.z;
+
+		return this;
+
+	}
+
+	/**
+	 * Subtracts the given scalar value from all components of this instance.
+	 *
+	 * @param {number} s - The scalar to subtract.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	subScalar( s ) {
+
+		this.x -= s;
+		this.y -= s;
+		this.z -= s;
+
+		return this;
+
+	}
+
+	/**
+	 * Subtracts the given vectors and stores the result in this instance.
+	 *
+	 * @param {Vector3} a - The first vector.
+	 * @param {Vector3} b - The second vector.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	subVectors( a, b ) {
+
+		this.x = a.x - b.x;
+		this.y = a.y - b.y;
+		this.z = a.z - b.z;
+
+		return this;
+
+	}
+
+	/**
+	 * Multiplies the given vector with this instance.
+	 *
+	 * @param {Vector3} v - The vector to multiply.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	multiply( v ) {
+
+		this.x *= v.x;
+		this.y *= v.y;
+		this.z *= v.z;
+
+		return this;
+
+	}
+
+	/**
+	 * Multiplies the given scalar value with all components of this instance.
+	 *
+	 * @param {number} scalar - The scalar to multiply.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	multiplyScalar( scalar ) {
+
+		this.x *= scalar;
+		this.y *= scalar;
+		this.z *= scalar;
+
+		return this;
+
+	}
+
+	/**
+	 * Multiplies the given vectors and stores the result in this instance.
+	 *
+	 * @param {Vector3} a - The first vector.
+	 * @param {Vector3} b - The second vector.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	multiplyVectors( a, b ) {
+
+		this.x = a.x * b.x;
+		this.y = a.y * b.y;
+		this.z = a.z * b.z;
+
+		return this;
+
+	}
+
+	/**
+	 * Applies the given Euler rotation to this vector.
+	 *
+	 * @param {Euler} euler - The Euler angles.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	applyEuler( euler ) {
+
+		return this.applyQuaternion( _quaternion$5.setFromEuler( euler ) );
+
+	}
+
+	/**
+	 * Applies a rotation specified by an axis and an angle to this vector.
+	 *
+	 * @param {Vector3} axis - A normalized vector representing the rotation axis.
+	 * @param {number} angle - The angle in radians.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	applyAxisAngle( axis, angle ) {
+
+		return this.applyQuaternion( _quaternion$5.setFromAxisAngle( axis, angle ) );
+
+	}
+
+	/**
+	 * Multiplies this vector with the given 3x3 matrix.
+	 *
+	 * @param {Matrix3} m - The 3x3 matrix.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	applyMatrix3( m ) {
+
+		const x = this.x, y = this.y, z = this.z;
+		const e = m.elements;
+
+		this.x = e[ 0 ] * x + e[ 3 ] * y + e[ 6 ] * z;
+		this.y = e[ 1 ] * x + e[ 4 ] * y + e[ 7 ] * z;
+		this.z = e[ 2 ] * x + e[ 5 ] * y + e[ 8 ] * z;
+
+		return this;
+
+	}
+
+	/**
+	 * Multiplies this vector by the given normal matrix and normalizes
+	 * the result.
+	 *
+	 * @param {Matrix3} m - The normal matrix.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	applyNormalMatrix( m ) {
+
+		return this.applyMatrix3( m ).normalize();
+
+	}
+
+	/**
+	 * Multiplies this vector (with an implicit 1 in the 4th dimension) by m, and
+	 * divides by perspective.
+	 *
+	 * @param {Matrix4} m - The matrix to apply.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	applyMatrix4( m ) {
+
+		const x = this.x, y = this.y, z = this.z;
+		const e = m.elements;
+
+		const w = 1 / ( e[ 3 ] * x + e[ 7 ] * y + e[ 11 ] * z + e[ 15 ] );
+
+		this.x = ( e[ 0 ] * x + e[ 4 ] * y + e[ 8 ] * z + e[ 12 ] ) * w;
+		this.y = ( e[ 1 ] * x + e[ 5 ] * y + e[ 9 ] * z + e[ 13 ] ) * w;
+		this.z = ( e[ 2 ] * x + e[ 6 ] * y + e[ 10 ] * z + e[ 14 ] ) * w;
+
+		return this;
+
+	}
+
+	/**
+	 * Applies the given Quaternion to this vector.
+	 *
+	 * @param {Quaternion} q - The Quaternion.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	applyQuaternion( q ) {
+
+		// quaternion q is assumed to have unit length
+
+		const vx = this.x, vy = this.y, vz = this.z;
+		const qx = q.x, qy = q.y, qz = q.z, qw = q.w;
+
+		// t = 2 * cross( q.xyz, v );
+		const tx = 2 * ( qy * vz - qz * vy );
+		const ty = 2 * ( qz * vx - qx * vz );
+		const tz = 2 * ( qx * vy - qy * vx );
+
+		// v + q.w * t + cross( q.xyz, t );
+		this.x = vx + qw * tx + qy * tz - qz * ty;
+		this.y = vy + qw * ty + qz * tx - qx * tz;
+		this.z = vz + qw * tz + qx * ty - qy * tx;
+
+		return this;
+
+	}
+
+	/**
+	 * Projects this vector from world space into the camera's normalized
+	 * device coordinate (NDC) space.
+	 *
+	 * @param {Camera} camera - The camera.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	project( camera ) {
+
+		return this.applyMatrix4( camera.matrixWorldInverse ).applyMatrix4( camera.projectionMatrix );
+
+	}
+
+	/**
+	 * Unprojects this vector from the camera's normalized device coordinate (NDC)
+	 * space into world space.
+	 *
+	 * @param {Camera} camera - The camera.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	unproject( camera ) {
+
+		return this.applyMatrix4( camera.projectionMatrixInverse ).applyMatrix4( camera.matrixWorld );
+
+	}
+
+	/**
+	 * Transforms this vector by the upper left 3x3 sub-matrix of the given 4x4 matrix,
+	 * and normalizes the result.
+	 *
+	 * @param {Matrix4} m - The matrix.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	transformDirection( m ) {
+
+		// input: THREE.Matrix4 affine matrix
+		// vector interpreted as a direction
+
+		const x = this.x, y = this.y, z = this.z;
+		const e = m.elements;
+
+		this.x = e[ 0 ] * x + e[ 4 ] * y + e[ 8 ] * z;
+		this.y = e[ 1 ] * x + e[ 5 ] * y + e[ 9 ] * z;
+		this.z = e[ 2 ] * x + e[ 6 ] * y + e[ 10 ] * z;
+
+		return this.normalize();
+
+	}
+
+	/**
+	 * Divides this instance by the given vector.
+	 *
+	 * @param {Vector3} v - The vector to divide.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	divide( v ) {
+
+		this.x /= v.x;
+		this.y /= v.y;
+		this.z /= v.z;
+
+		return this;
+
+	}
+
+	/**
+	 * Divides this vector by the given scalar.
+	 *
+	 * @param {number} scalar - The scalar to divide.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	divideScalar( scalar ) {
+
+		return this.multiplyScalar( 1 / scalar );
+
+	}
+
+	/**
+	 * If this vector's x, y or z value is greater than the given vector's x, y or z
+	 * value, replace that value with the corresponding min value.
+	 *
+	 * @param {Vector3} v - The vector.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	min( v ) {
+
+		this.x = Math.min( this.x, v.x );
+		this.y = Math.min( this.y, v.y );
+		this.z = Math.min( this.z, v.z );
+
+		return this;
+
+	}
+
+	/**
+	 * If this vector's x, y or z value is less than the given vector's x, y or z
+	 * value, replace that value with the corresponding max value.
+	 *
+	 * @param {Vector3} v - The vector.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	max( v ) {
+
+		this.x = Math.max( this.x, v.x );
+		this.y = Math.max( this.y, v.y );
+		this.z = Math.max( this.z, v.z );
+
+		return this;
+
+	}
+
+	/**
+	 * If this vector's x, y or z value is greater than the max vector's x, y or z
+	 * value, it is replaced by the corresponding value.
+	 * If this vector's x, y or z value is less than the min vector's x, y or z value,
+	 * it is replaced by the corresponding value.
+	 *
+	 * @param {Vector3} min - The minimum x, y and z values.
+	 * @param {Vector3} max - The maximum x, y and z values in the desired range.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	clamp( min, max ) {
+
+		// assumes min < max, componentwise
+
+		this.x = clamp( this.x, min.x, max.x );
+		this.y = clamp( this.y, min.y, max.y );
+		this.z = clamp( this.z, min.z, max.z );
+
+		return this;
+
+	}
+
+	/**
+	 * If this vector's x, y or z values are greater than the max value, they are
+	 * replaced by the max value.
+	 * If this vector's x, y or z values are less than the min value, they are
+	 * replaced by the min value.
+	 *
+	 * @param {number} minVal - The minimum value the components will be clamped to.
+	 * @param {number} maxVal - The maximum value the components will be clamped to.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	clampScalar( minVal, maxVal ) {
+
+		this.x = clamp( this.x, minVal, maxVal );
+		this.y = clamp( this.y, minVal, maxVal );
+		this.z = clamp( this.z, minVal, maxVal );
+
+		return this;
+
+	}
+
+	/**
+	 * If this vector's length is greater than the max value, it is replaced by
+	 * the max value.
+	 * If this vector's length is less than the min value, it is replaced by the
+	 * min value.
+	 *
+	 * @param {number} min - The minimum value the vector length will be clamped to.
+	 * @param {number} max - The maximum value the vector length will be clamped to.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	clampLength( min, max ) {
+
+		const length = this.length();
+
+		return this.divideScalar( length || 1 ).multiplyScalar( clamp( length, min, max ) );
+
+	}
+
+	/**
+	 * The components of this vector are rounded down to the nearest integer value.
+	 *
+	 * @return {Vector3} A reference to this vector.
+	 */
+	floor() {
+
+		this.x = Math.floor( this.x );
+		this.y = Math.floor( this.y );
+		this.z = Math.floor( this.z );
+
+		return this;
+
+	}
+
+	/**
+	 * The components of this vector are rounded up to the nearest integer value.
+	 *
+	 * @return {Vector3} A reference to this vector.
+	 */
+	ceil() {
+
+		this.x = Math.ceil( this.x );
+		this.y = Math.ceil( this.y );
+		this.z = Math.ceil( this.z );
+
+		return this;
+
+	}
+
+	/**
+	 * The components of this vector are rounded to the nearest integer value
+	 *
+	 * @return {Vector3} A reference to this vector.
+	 */
+	round() {
+
+		this.x = Math.round( this.x );
+		this.y = Math.round( this.y );
+		this.z = Math.round( this.z );
+
+		return this;
+
+	}
+
+	/**
+	 * The components of this vector are rounded towards zero (up if negative,
+	 * down if positive) to an integer value.
+	 *
+	 * @return {Vector3} A reference to this vector.
+	 */
+	roundToZero() {
+
+		this.x = Math.trunc( this.x );
+		this.y = Math.trunc( this.y );
+		this.z = Math.trunc( this.z );
+
+		return this;
+
+	}
+
+	/**
+	 * Inverts this vector - i.e. sets x = -x, y = -y and z = -z.
+	 *
+	 * @return {Vector3} A reference to this vector.
+	 */
+	negate() {
+
+		this.x = - this.x;
+		this.y = - this.y;
+		this.z = - this.z;
+
+		return this;
+
+	}
+
+	/**
+	 * Calculates the dot product of the given vector with this instance.
+	 *
+	 * @param {Vector3} v - The vector to compute the dot product with.
+	 * @return {number} The result of the dot product.
+	 */
+	dot( v ) {
+
+		return this.x * v.x + this.y * v.y + this.z * v.z;
+
+	}
+
+	/**
+	 * Computes the square of the Euclidean length (straight-line length) from
+	 * (0, 0, 0) to (x, y, z). If you are comparing the lengths of vectors, you should
+	 * compare the length squared instead as it is slightly more efficient to calculate.
+	 *
+	 * @return {number} The square length of this vector.
+	 */
+	lengthSq() {
+
+		return this.x * this.x + this.y * this.y + this.z * this.z;
+
+	}
+
+	/**
+	 * Computes the  Euclidean length (straight-line length) from (0, 0, 0) to (x, y, z).
+	 *
+	 * @return {number} The length of this vector.
+	 */
+	length() {
+
+		return Math.sqrt( this.x * this.x + this.y * this.y + this.z * this.z );
+
+	}
+
+	/**
+	 * Computes the Manhattan length of this vector.
+	 *
+	 * @return {number} The length of this vector.
+	 */
+	manhattanLength() {
+
+		return Math.abs( this.x ) + Math.abs( this.y ) + Math.abs( this.z );
+
+	}
+
+	/**
+	 * Converts this vector to a unit vector - that is, sets it equal to a vector
+	 * with the same direction as this one, but with a vector length of `1`.
+	 *
+	 * @return {Vector3} A reference to this vector.
+	 */
+	normalize() {
+
+		return this.divideScalar( this.length() || 1 );
+
+	}
+
+	/**
+	 * Sets this vector to a vector with the same direction as this one, but
+	 * with the specified length.
+	 *
+	 * @param {number} length - The new length of this vector.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setLength( length ) {
+
+		return this.normalize().multiplyScalar( length );
+
+	}
+
+	/**
+	 * Linearly interpolates between the given vector and this instance, where
+	 * alpha is the percent distance along the line - alpha = 0 will be this
+	 * vector, and alpha = 1 will be the given one.
+	 *
+	 * @param {Vector3} v - The vector to interpolate towards.
+	 * @param {number} alpha - The interpolation factor, typically in the closed interval `[0, 1]`.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	lerp( v, alpha ) {
+
+		this.x += ( v.x - this.x ) * alpha;
+		this.y += ( v.y - this.y ) * alpha;
+		this.z += ( v.z - this.z ) * alpha;
+
+		return this;
+
+	}
+
+	/**
+	 * Linearly interpolates between the given vectors, where alpha is the percent
+	 * distance along the line - alpha = 0 will be first vector, and alpha = 1 will
+	 * be the second one. The result is stored in this instance.
+	 *
+	 * @param {Vector3} v1 - The first vector.
+	 * @param {Vector3} v2 - The second vector.
+	 * @param {number} alpha - The interpolation factor, typically in the closed interval `[0, 1]`.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	lerpVectors( v1, v2, alpha ) {
+
+		this.x = v1.x + ( v2.x - v1.x ) * alpha;
+		this.y = v1.y + ( v2.y - v1.y ) * alpha;
+		this.z = v1.z + ( v2.z - v1.z ) * alpha;
+
+		return this;
+
+	}
+
+	/**
+	 * Calculates the cross product of the given vector with this instance.
+	 *
+	 * @param {Vector3} v - The vector to compute the cross product with.
+	 * @return {Vector3} The result of the cross product.
+	 */
+	cross( v ) {
+
+		return this.crossVectors( this, v );
+
+	}
+
+	/**
+	 * Calculates the cross product of the given vectors and stores the result
+	 * in this instance.
+	 *
+	 * @param {Vector3} a - The first vector.
+	 * @param {Vector3} b - The second vector.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	crossVectors( a, b ) {
+
+		const ax = a.x, ay = a.y, az = a.z;
+		const bx = b.x, by = b.y, bz = b.z;
+
+		this.x = ay * bz - az * by;
+		this.y = az * bx - ax * bz;
+		this.z = ax * by - ay * bx;
+
+		return this;
+
+	}
+
+	/**
+	 * Projects this vector onto the given one.
+	 *
+	 * @param {Vector3} v - The vector to project to.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	projectOnVector( v ) {
+
+		const denominator = v.lengthSq();
+
+		if ( denominator === 0 ) return this.set( 0, 0, 0 );
+
+		const scalar = v.dot( this ) / denominator;
+
+		return this.copy( v ).multiplyScalar( scalar );
+
+	}
+
+	/**
+	 * Projects this vector onto a plane by subtracting this
+	 * vector projected onto the plane's normal from this vector.
+	 *
+	 * @param {Vector3} planeNormal - The plane normal.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	projectOnPlane( planeNormal ) {
+
+		_vector$c.copy( this ).projectOnVector( planeNormal );
+
+		return this.sub( _vector$c );
+
+	}
+
+	/**
+	 * Reflects this vector off a plane orthogonal to the given normal vector.
+	 *
+	 * @param {Vector3} normal - The (normalized) normal vector.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	reflect( normal ) {
+
+		return this.sub( _vector$c.copy( normal ).multiplyScalar( 2 * this.dot( normal ) ) );
+
+	}
+	/**
+	 * Returns the angle between the given vector and this instance in radians.
+	 *
+	 * @param {Vector3} v - The vector to compute the angle with.
+	 * @return {number} The angle in radians.
+	 */
+	angleTo( v ) {
+
+		const denominator = Math.sqrt( this.lengthSq() * v.lengthSq() );
+
+		if ( denominator === 0 ) return Math.PI / 2;
+
+		const theta = this.dot( v ) / denominator;
+
+		// clamp, to handle numerical problems
+
+		return Math.acos( clamp( theta, -1, 1 ) );
+
+	}
+
+	/**
+	 * Computes the distance from the given vector to this instance.
+	 *
+	 * @param {Vector3} v - The vector to compute the distance to.
+	 * @return {number} The distance.
+	 */
+	distanceTo( v ) {
+
+		return Math.sqrt( this.distanceToSquared( v ) );
+
+	}
+
+	/**
+	 * Computes the squared distance from the given vector to this instance.
+	 * If you are just comparing the distance with another distance, you should compare
+	 * the distance squared instead as it is slightly more efficient to calculate.
+	 *
+	 * @param {Vector3} v - The vector to compute the squared distance to.
+	 * @return {number} The squared distance.
+	 */
+	distanceToSquared( v ) {
+
+		const dx = this.x - v.x, dy = this.y - v.y, dz = this.z - v.z;
+
+		return dx * dx + dy * dy + dz * dz;
+
+	}
+
+	/**
+	 * Computes the Manhattan distance from the given vector to this instance.
+	 *
+	 * @param {Vector3} v - The vector to compute the Manhattan distance to.
+	 * @return {number} The Manhattan distance.
+	 */
+	manhattanDistanceTo( v ) {
+
+		return Math.abs( this.x - v.x ) + Math.abs( this.y - v.y ) + Math.abs( this.z - v.z );
+
+	}
+
+	/**
+	 * Sets the vector components from the given spherical coordinates.
+	 *
+	 * @param {Spherical} s - The spherical coordinates.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setFromSpherical( s ) {
+
+		return this.setFromSphericalCoords( s.radius, s.phi, s.theta );
+
+	}
+
+	/**
+	 * Sets the vector components from the given spherical coordinates.
+	 *
+	 * @param {number} radius - The radius.
+	 * @param {number} phi - The phi angle in radians.
+	 * @param {number} theta - The theta angle in radians.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setFromSphericalCoords( radius, phi, theta ) {
+
+		const sinPhiRadius = Math.sin( phi ) * radius;
+
+		this.x = sinPhiRadius * Math.sin( theta );
+		this.y = Math.cos( phi ) * radius;
+		this.z = sinPhiRadius * Math.cos( theta );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector components from the given cylindrical coordinates.
+	 *
+	 * @param {Cylindrical} c - The cylindrical coordinates.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setFromCylindrical( c ) {
+
+		return this.setFromCylindricalCoords( c.radius, c.theta, c.y );
+
+	}
+
+	/**
+	 * Sets the vector components from the given cylindrical coordinates.
+	 *
+	 * @param {number} radius - The radius.
+	 * @param {number} theta - The theta angle in radians.
+	 * @param {number} y - The y value.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setFromCylindricalCoords( radius, theta, y ) {
+
+		this.x = radius * Math.sin( theta );
+		this.y = y;
+		this.z = radius * Math.cos( theta );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector components to the position elements of the
+	 * given transformation matrix.
+	 *
+	 * @param {Matrix4} m - The 4x4 matrix.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setFromMatrixPosition( m ) {
+
+		const e = m.elements;
+
+		this.x = e[ 12 ];
+		this.y = e[ 13 ];
+		this.z = e[ 14 ];
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector components to the scale elements of the
+	 * given transformation matrix.
+	 *
+	 * @param {Matrix4} m - The 4x4 matrix.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setFromMatrixScale( m ) {
+
+		const sx = this.setFromMatrixColumn( m, 0 ).length();
+		const sy = this.setFromMatrixColumn( m, 1 ).length();
+		const sz = this.setFromMatrixColumn( m, 2 ).length();
+
+		this.x = sx;
+		this.y = sy;
+		this.z = sz;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector components from the specified matrix column.
+	 *
+	 * @param {Matrix4} m - The 4x4 matrix.
+	 * @param {number} index - The column index.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setFromMatrixColumn( m, index ) {
+
+		return this.fromArray( m.elements, index * 4 );
+
+	}
+
+	/**
+	 * Sets the vector components from the specified matrix column.
+	 *
+	 * @param {Matrix3} m - The 3x3 matrix.
+	 * @param {number} index - The column index.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setFromMatrix3Column( m, index ) {
+
+		return this.fromArray( m.elements, index * 3 );
+
+	}
+
+	/**
+	 * Sets the vector components from the given Euler angles.
+	 *
+	 * @param {Euler} e - The Euler angles to set.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setFromEuler( e ) {
+
+		this.x = e._x;
+		this.y = e._y;
+		this.z = e._z;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector components from the RGB components of the
+	 * given color.
+	 *
+	 * @param {Color} c - The color to set.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	setFromColor( c ) {
+
+		this.x = c.r;
+		this.y = c.g;
+		this.z = c.b;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this vector is equal with the given one.
+	 *
+	 * @param {Vector3} v - The vector to test for equality.
+	 * @return {boolean} Whether this vector is equal with the given one.
+	 */
+	equals( v ) {
+
+		return ( ( v.x === this.x ) && ( v.y === this.y ) && ( v.z === this.z ) );
+
+	}
+
+	/**
+	 * Sets this vector's x value to be `array[ offset ]`, y value to be `array[ offset + 1 ]`
+	 * and z value to be `array[ offset + 2 ]`.
+	 *
+	 * @param {Array<number>} array - An array holding the vector component values.
+	 * @param {number} [offset=0] - The offset into the array.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	fromArray( array, offset = 0 ) {
+
+		this.x = array[ offset ];
+		this.y = array[ offset + 1 ];
+		this.z = array[ offset + 2 ];
+
+		return this;
+
+	}
+
+	/**
+	 * Writes the components of this vector to the given array. If no array is provided,
+	 * the method returns a new instance.
+	 *
+	 * @param {Array<number>} [array=[]] - The target array holding the vector components.
+	 * @param {number} [offset=0] - Index of the first element in the array.
+	 * @return {Array<number>} The vector components.
+	 */
+	toArray( array = [], offset = 0 ) {
+
+		array[ offset ] = this.x;
+		array[ offset + 1 ] = this.y;
+		array[ offset + 2 ] = this.z;
+
+		return array;
+
+	}
+
+	/**
+	 * Sets the components of this vector from the given buffer attribute.
+	 *
+	 * @param {BufferAttribute} attribute - The buffer attribute holding vector data.
+	 * @param {number} index - The index into the attribute.
+	 * @return {Vector3} A reference to this vector.
+	 */
+	fromBufferAttribute( attribute, index ) {
+
+		this.x = attribute.getX( index );
+		this.y = attribute.getY( index );
+		this.z = attribute.getZ( index );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets each component of this vector to a pseudo-random value between `0` and
+	 * `1`, excluding `1`.
+	 *
+	 * @return {Vector3} A reference to this vector.
+	 */
+	random() {
+
+		this.x = Math.random();
+		this.y = Math.random();
+		this.z = Math.random();
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this vector to a uniformly random point on a unit sphere.
+	 *
+	 * @return {Vector3} A reference to this vector.
+	 */
+	randomDirection() {
+
+		// https://mathworld.wolfram.com/SpherePointPicking.html
+
+		const theta = Math.random() * Math.PI * 2;
+		const u = Math.random() * 2 - 1;
+		const c = Math.sqrt( 1 - u * u );
+
+		this.x = c * Math.cos( theta );
+		this.y = u;
+		this.z = c * Math.sin( theta );
+
+		return this;
+
+	}
+
+	*[ Symbol.iterator ]() {
+
+		yield this.x;
+		yield this.y;
+		yield this.z;
+
+	}
+
+}
+
+const _vector$c = /*@__PURE__*/ new Vector3();
+const _quaternion$5 = /*@__PURE__*/ new Quaternion();
+
+/**
+ * Represents a 3x3 matrix.
+ *
+ * A Note on Row-Major and Column-Major Ordering:
+ *
+ * The constructor and {@link Matrix3#set} method take arguments in
+ * [row-major](https://en.wikipedia.org/wiki/Row-_and_column-major_order#Column-major_order)
+ * order, while internally they are stored in the {@link Matrix3#elements} array in column-major order.
+ * This means that calling:
+ * ```js
+ * const m = new THREE.Matrix();
+ * m.set( 11, 12, 13,
+ *        21, 22, 23,
+ *        31, 32, 33 );
+ * ```
+ * will result in the elements array containing:
+ * ```js
+ * m.elements = [ 11, 21, 31,
+ *                12, 22, 32,
+ *                13, 23, 33 ];
+ * ```
+ * and internally all calculations are performed using column-major ordering.
+ * However, as the actual ordering makes no difference mathematically and
+ * most people are used to thinking about matrices in row-major order, the
+ * three.js documentation shows matrices in row-major order. Just bear in
+ * mind that if you are reading the source code, you'll have to take the
+ * transpose of any matrices outlined here to make sense of the calculations.
+ */
+class Matrix3 {
+
+	static {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		Matrix3.prototype.isMatrix3 = true;
+
+	}
+
+	/**
+	 * Constructs a new 3x3 matrix. The arguments are supposed to be
+	 * in row-major order. If no arguments are provided, the constructor
+	 * initializes the matrix as an identity matrix.
+	 *
+	 * @param {number} [n11] - 1-1 matrix element.
+	 * @param {number} [n12] - 1-2 matrix element.
+	 * @param {number} [n13] - 1-3 matrix element.
+	 * @param {number} [n21] - 2-1 matrix element.
+	 * @param {number} [n22] - 2-2 matrix element.
+	 * @param {number} [n23] - 2-3 matrix element.
+	 * @param {number} [n31] - 3-1 matrix element.
+	 * @param {number} [n32] - 3-2 matrix element.
+	 * @param {number} [n33] - 3-3 matrix element.
+	 */
+	constructor( n11, n12, n13, n21, n22, n23, n31, n32, n33 ) {
+
+		/**
+		 * A column-major list of matrix values.
+		 *
+		 * @type {Array<number>}
+		 */
+		this.elements = [
+
+			1, 0, 0,
+			0, 1, 0,
+			0, 0, 1
+
+		];
+
+		if ( n11 !== undefined ) {
+
+			this.set( n11, n12, n13, n21, n22, n23, n31, n32, n33 );
+
+		}
+
+	}
+
+	/**
+	 * Sets the elements of the matrix.The arguments are supposed to be
+	 * in row-major order.
+	 *
+	 * @param {number} [n11] - 1-1 matrix element.
+	 * @param {number} [n12] - 1-2 matrix element.
+	 * @param {number} [n13] - 1-3 matrix element.
+	 * @param {number} [n21] - 2-1 matrix element.
+	 * @param {number} [n22] - 2-2 matrix element.
+	 * @param {number} [n23] - 2-3 matrix element.
+	 * @param {number} [n31] - 3-1 matrix element.
+	 * @param {number} [n32] - 3-2 matrix element.
+	 * @param {number} [n33] - 3-3 matrix element.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	set( n11, n12, n13, n21, n22, n23, n31, n32, n33 ) {
+
+		const te = this.elements;
+
+		te[ 0 ] = n11; te[ 1 ] = n21; te[ 2 ] = n31;
+		te[ 3 ] = n12; te[ 4 ] = n22; te[ 5 ] = n32;
+		te[ 6 ] = n13; te[ 7 ] = n23; te[ 8 ] = n33;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this matrix to the 3x3 identity matrix.
+	 *
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	identity() {
+
+		this.set(
+
+			1, 0, 0,
+			0, 1, 0,
+			0, 0, 1
+
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Copies the values of the given matrix to this instance.
+	 *
+	 * @param {Matrix3} m - The matrix to copy.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	copy( m ) {
+
+		const te = this.elements;
+		const me = m.elements;
+
+		te[ 0 ] = me[ 0 ]; te[ 1 ] = me[ 1 ]; te[ 2 ] = me[ 2 ];
+		te[ 3 ] = me[ 3 ]; te[ 4 ] = me[ 4 ]; te[ 5 ] = me[ 5 ];
+		te[ 6 ] = me[ 6 ]; te[ 7 ] = me[ 7 ]; te[ 8 ] = me[ 8 ];
+
+		return this;
+
+	}
+
+	/**
+	 * Extracts the basis of this matrix into the three axis vectors provided.
+	 *
+	 * @param {Vector3} xAxis - The basis's x axis.
+	 * @param {Vector3} yAxis - The basis's y axis.
+	 * @param {Vector3} zAxis - The basis's z axis.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	extractBasis( xAxis, yAxis, zAxis ) {
+
+		xAxis.setFromMatrix3Column( this, 0 );
+		yAxis.setFromMatrix3Column( this, 1 );
+		zAxis.setFromMatrix3Column( this, 2 );
+
+		return this;
+
+	}
+
+	/**
+	 * Set this matrix to the upper 3x3 matrix of the given 4x4 matrix.
+	 *
+	 * @param {Matrix4} m - The 4x4 matrix.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	setFromMatrix4( m ) {
+
+		const me = m.elements;
+
+		this.set(
+
+			me[ 0 ], me[ 4 ], me[ 8 ],
+			me[ 1 ], me[ 5 ], me[ 9 ],
+			me[ 2 ], me[ 6 ], me[ 10 ]
+
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Post-multiplies this matrix by the given 3x3 matrix.
+	 *
+	 * @param {Matrix3} m - The matrix to multiply with.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	multiply( m ) {
+
+		return this.multiplyMatrices( this, m );
+
+	}
+
+	/**
+	 * Pre-multiplies this matrix by the given 3x3 matrix.
+	 *
+	 * @param {Matrix3} m - The matrix to multiply with.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	premultiply( m ) {
+
+		return this.multiplyMatrices( m, this );
+
+	}
+
+	/**
+	 * Multiples the given 3x3 matrices and stores the result
+	 * in this matrix.
+	 *
+	 * @param {Matrix3} a - The first matrix.
+	 * @param {Matrix3} b - The second matrix.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	multiplyMatrices( a, b ) {
+
+		const ae = a.elements;
+		const be = b.elements;
+		const te = this.elements;
+
+		const a11 = ae[ 0 ], a12 = ae[ 3 ], a13 = ae[ 6 ];
+		const a21 = ae[ 1 ], a22 = ae[ 4 ], a23 = ae[ 7 ];
+		const a31 = ae[ 2 ], a32 = ae[ 5 ], a33 = ae[ 8 ];
+
+		const b11 = be[ 0 ], b12 = be[ 3 ], b13 = be[ 6 ];
+		const b21 = be[ 1 ], b22 = be[ 4 ], b23 = be[ 7 ];
+		const b31 = be[ 2 ], b32 = be[ 5 ], b33 = be[ 8 ];
+
+		te[ 0 ] = a11 * b11 + a12 * b21 + a13 * b31;
+		te[ 3 ] = a11 * b12 + a12 * b22 + a13 * b32;
+		te[ 6 ] = a11 * b13 + a12 * b23 + a13 * b33;
+
+		te[ 1 ] = a21 * b11 + a22 * b21 + a23 * b31;
+		te[ 4 ] = a21 * b12 + a22 * b22 + a23 * b32;
+		te[ 7 ] = a21 * b13 + a22 * b23 + a23 * b33;
+
+		te[ 2 ] = a31 * b11 + a32 * b21 + a33 * b31;
+		te[ 5 ] = a31 * b12 + a32 * b22 + a33 * b32;
+		te[ 8 ] = a31 * b13 + a32 * b23 + a33 * b33;
+
+		return this;
+
+	}
+
+	/**
+	 * Multiplies every component of the matrix by the given scalar.
+	 *
+	 * @param {number} s - The scalar.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	multiplyScalar( s ) {
+
+		const te = this.elements;
+
+		te[ 0 ] *= s; te[ 3 ] *= s; te[ 6 ] *= s;
+		te[ 1 ] *= s; te[ 4 ] *= s; te[ 7 ] *= s;
+		te[ 2 ] *= s; te[ 5 ] *= s; te[ 8 ] *= s;
+
+		return this;
+
+	}
+
+	/**
+	 * Computes and returns the determinant of this matrix.
+	 *
+	 * @return {number} The determinant.
+	 */
+	determinant() {
+
+		const te = this.elements;
+
+		const a = te[ 0 ], b = te[ 1 ], c = te[ 2 ],
+			d = te[ 3 ], e = te[ 4 ], f = te[ 5 ],
+			g = te[ 6 ], h = te[ 7 ], i = te[ 8 ];
+
+		return a * e * i - a * f * h - b * d * i + b * f * g + c * d * h - c * e * g;
+
+	}
+
+	/**
+	 * Inverts this matrix, using the [analytic method](https://en.wikipedia.org/wiki/Invertible_matrix#Analytic_solution).
+	 * You can not invert with a determinant of zero. If you attempt this, the method produces
+	 * a zero matrix instead.
+	 *
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	invert() {
+
+		const te = this.elements,
+
+			n11 = te[ 0 ], n21 = te[ 1 ], n31 = te[ 2 ],
+			n12 = te[ 3 ], n22 = te[ 4 ], n32 = te[ 5 ],
+			n13 = te[ 6 ], n23 = te[ 7 ], n33 = te[ 8 ],
+
+			t11 = n33 * n22 - n32 * n23,
+			t12 = n32 * n13 - n33 * n12,
+			t13 = n23 * n12 - n22 * n13,
+
+			det = n11 * t11 + n21 * t12 + n31 * t13;
+
+		if ( det === 0 ) return this.set( 0, 0, 0, 0, 0, 0, 0, 0, 0 );
+
+		const detInv = 1 / det;
+
+		te[ 0 ] = t11 * detInv;
+		te[ 1 ] = ( n31 * n23 - n33 * n21 ) * detInv;
+		te[ 2 ] = ( n32 * n21 - n31 * n22 ) * detInv;
+
+		te[ 3 ] = t12 * detInv;
+		te[ 4 ] = ( n33 * n11 - n31 * n13 ) * detInv;
+		te[ 5 ] = ( n31 * n12 - n32 * n11 ) * detInv;
+
+		te[ 6 ] = t13 * detInv;
+		te[ 7 ] = ( n21 * n13 - n23 * n11 ) * detInv;
+		te[ 8 ] = ( n22 * n11 - n21 * n12 ) * detInv;
+
+		return this;
+
+	}
+
+	/**
+	 * Transposes this matrix in place.
+	 *
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	transpose() {
+
+		let tmp;
+		const m = this.elements;
+
+		tmp = m[ 1 ]; m[ 1 ] = m[ 3 ]; m[ 3 ] = tmp;
+		tmp = m[ 2 ]; m[ 2 ] = m[ 6 ]; m[ 6 ] = tmp;
+		tmp = m[ 5 ]; m[ 5 ] = m[ 7 ]; m[ 7 ] = tmp;
+
+		return this;
+
+	}
+
+	/**
+	 * Computes the normal matrix which is the inverse transpose of the upper
+	 * left 3x3 portion of the given 4x4 matrix.
+	 *
+	 * @param {Matrix4} matrix4 - The 4x4 matrix.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	getNormalMatrix( matrix4 ) {
+
+		return this.setFromMatrix4( matrix4 ).invert().transpose();
+
+	}
+
+	/**
+	 * Transposes this matrix into the supplied array, and returns itself unchanged.
+	 *
+	 * @param {Array<number>} r - An array to store the transposed matrix elements.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	transposeIntoArray( r ) {
+
+		const m = this.elements;
+
+		r[ 0 ] = m[ 0 ];
+		r[ 1 ] = m[ 3 ];
+		r[ 2 ] = m[ 6 ];
+		r[ 3 ] = m[ 1 ];
+		r[ 4 ] = m[ 4 ];
+		r[ 5 ] = m[ 7 ];
+		r[ 6 ] = m[ 2 ];
+		r[ 7 ] = m[ 5 ];
+		r[ 8 ] = m[ 8 ];
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the UV transform matrix from offset, repeat, rotation, and center.
+	 *
+	 * @param {number} tx - Offset x.
+	 * @param {number} ty - Offset y.
+	 * @param {number} sx - Repeat x.
+	 * @param {number} sy - Repeat y.
+	 * @param {number} rotation - Rotation, in radians. Positive values rotate counterclockwise.
+	 * @param {number} cx - Center x of rotation.
+	 * @param {number} cy - Center y of rotation
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	setUvTransform( tx, ty, sx, sy, rotation, cx, cy ) {
+
+		const c = Math.cos( rotation );
+		const s = Math.sin( rotation );
+
+		this.set(
+			sx * c, sx * s, - sx * ( c * cx + s * cy ) + cx + tx,
+			- sy * s, sy * c, - sy * ( - s * cx + c * cy ) + cy + ty,
+			0, 0, 1
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Scales this matrix with the given scalar values.
+	 *
+	 * @deprecated
+	 * @param {number} sx - The amount to scale in the X axis.
+	 * @param {number} sy - The amount to scale in the Y axis.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	scale( sx, sy ) {
+
+		warnOnce( 'Matrix3: .scale() is deprecated. Use .makeScale() instead.' ); // @deprecated r185
+
+		this.premultiply( _m3.makeScale( sx, sy ) );
+
+		return this;
+
+	}
+
+	/**
+	 * Rotates this matrix by the given angle.
+	 *
+	 * @deprecated
+	 * @param {number} theta - The rotation in radians.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	rotate( theta ) {
+
+		warnOnce( 'Matrix3: .rotate() is deprecated. Use .makeRotation() instead.' ); // @deprecated r185
+
+		this.premultiply( _m3.makeRotation( - theta ) );
+
+		return this;
+
+	}
+
+	/**
+	 * Translates this matrix by the given scalar values.
+	 *
+	 * @deprecated
+	 * @param {number} tx - The amount to translate in the X axis.
+	 * @param {number} ty - The amount to translate in the Y axis.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	translate( tx, ty ) {
+
+		warnOnce( 'Matrix3: .translate() is deprecated. Use .makeTranslation() instead.' ); // @deprecated r185
+
+		this.premultiply( _m3.makeTranslation( tx, ty ) );
+
+		return this;
+
+	}
+
+	// for 2D Transforms
+
+	/**
+	 * Sets this matrix as a 2D translation transform.
+	 *
+	 * @param {number|Vector2} x - The amount to translate in the X axis or alternatively a translation vector.
+	 * @param {number} y - The amount to translate in the Y axis.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	makeTranslation( x, y ) {
+
+		if ( x.isVector2 ) {
+
+			this.set(
+
+				1, 0, x.x,
+				0, 1, x.y,
+				0, 0, 1
+
+			);
+
+		} else {
+
+			this.set(
+
+				1, 0, x,
+				0, 1, y,
+				0, 0, 1
+
+			);
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this matrix as a 2D rotational transformation.
+	 *
+	 * @param {number} theta - The rotation in radians.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	makeRotation( theta ) {
+
+		// counterclockwise
+
+		const c = Math.cos( theta );
+		const s = Math.sin( theta );
+
+		this.set(
+
+			c, - s, 0,
+			s, c, 0,
+			0, 0, 1
+
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this matrix as a 2D scale transform.
+	 *
+	 * @param {number} x - The amount to scale in the X axis.
+	 * @param {number} y - The amount to scale in the Y axis.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	makeScale( x, y ) {
+
+		this.set(
+
+			x, 0, 0,
+			0, y, 0,
+			0, 0, 1
+
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this matrix is equal with the given one.
+	 *
+	 * @param {Matrix3} matrix - The matrix to test for equality.
+	 * @return {boolean} Whether this matrix is equal with the given one.
+	 */
+	equals( matrix ) {
+
+		const te = this.elements;
+		const me = matrix.elements;
+
+		for ( let i = 0; i < 9; i ++ ) {
+
+			if ( te[ i ] !== me[ i ] ) return false;
+
+		}
+
+		return true;
+
+	}
+
+	/**
+	 * Sets the elements of the matrix from the given array.
+	 *
+	 * @param {Array<number>} array - The matrix elements in column-major order.
+	 * @param {number} [offset=0] - Index of the first element in the array.
+	 * @return {Matrix3} A reference to this matrix.
+	 */
+	fromArray( array, offset = 0 ) {
+
+		for ( let i = 0; i < 9; i ++ ) {
+
+			this.elements[ i ] = array[ i + offset ];
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Writes the elements of this matrix to the given array. If no array is provided,
+	 * the method returns a new instance.
+	 *
+	 * @param {Array<number>} [array=[]] - The target array holding the matrix elements in column-major order.
+	 * @param {number} [offset=0] - Index of the first element in the array.
+	 * @return {Array<number>} The matrix elements in column-major order.
+	 */
+	toArray( array = [], offset = 0 ) {
+
+		const te = this.elements;
+
+		array[ offset ] = te[ 0 ];
+		array[ offset + 1 ] = te[ 1 ];
+		array[ offset + 2 ] = te[ 2 ];
+
+		array[ offset + 3 ] = te[ 3 ];
+		array[ offset + 4 ] = te[ 4 ];
+		array[ offset + 5 ] = te[ 5 ];
+
+		array[ offset + 6 ] = te[ 6 ];
+		array[ offset + 7 ] = te[ 7 ];
+		array[ offset + 8 ] = te[ 8 ];
+
+		return array;
+
+	}
+
+	/**
+	 * Returns a matrix with copied values from this instance.
+	 *
+	 * @return {Matrix3} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().fromArray( this.elements );
+
+	}
+
+}
+
+const _m3 = /*@__PURE__*/ new Matrix3();
+
+const LINEAR_REC709_TO_XYZ = /*@__PURE__*/ new Matrix3().set(
+	0.4123908, 0.3575843, 0.1804808,
+	0.2126390, 0.7151687, 0.0721923,
+	0.0193308, 0.1191948, 0.9505322
+);
+
+const XYZ_TO_LINEAR_REC709 = /*@__PURE__*/ new Matrix3().set(
+	3.2409699, -1.5373832, -0.4986108,
+	-0.9692436, 1.8759675, 0.0415551,
+	0.0556301, -0.203977, 1.0569715
+);
+
+function createColorManagement() {
+
+	const ColorManagement = {
+
+		enabled: true,
+
+		workingColorSpace: LinearSRGBColorSpace,
+
+		/**
+		 * Implementations of supported color spaces.
+		 *
+		 * Required:
+		 *	- primaries: chromaticity coordinates [ rx ry gx gy bx by ]
+		 *	- whitePoint: reference white [ x y ]
+		 *	- transfer: transfer function (pre-defined)
+		 *	- toXYZ: Matrix3 RGB to XYZ transform
+		 *	- fromXYZ: Matrix3 XYZ to RGB transform
+		 *	- luminanceCoefficients: RGB luminance coefficients
+		 *
+		 * Optional:
+		 *  - outputColorSpaceConfig: { drawingBufferColorSpace: ColorSpace, toneMappingMode: 'extended' | 'standard' }
+		 *  - workingColorSpaceConfig: { unpackColorSpace: ColorSpace }
+		 *
+		 * Reference:
+		 * - https://www.russellcottrell.com/photo/matrixCalculator.htm
+		 */
+		spaces: {},
+
+		convert: function ( color, sourceColorSpace, targetColorSpace ) {
+
+			if ( this.enabled === false || sourceColorSpace === targetColorSpace || ! sourceColorSpace || ! targetColorSpace ) {
+
+				return color;
+
+			}
+
+			if ( this.spaces[ sourceColorSpace ].transfer === SRGBTransfer ) {
+
+				color.r = SRGBToLinear( color.r );
+				color.g = SRGBToLinear( color.g );
+				color.b = SRGBToLinear( color.b );
+
+			}
+
+			if ( this.spaces[ sourceColorSpace ].primaries !== this.spaces[ targetColorSpace ].primaries ) {
+
+				color.applyMatrix3( this.spaces[ sourceColorSpace ].toXYZ );
+				color.applyMatrix3( this.spaces[ targetColorSpace ].fromXYZ );
+
+			}
+
+			if ( this.spaces[ targetColorSpace ].transfer === SRGBTransfer ) {
+
+				color.r = LinearToSRGB( color.r );
+				color.g = LinearToSRGB( color.g );
+				color.b = LinearToSRGB( color.b );
+
+			}
+
+			return color;
+
+		},
+
+		workingToColorSpace: function ( color, targetColorSpace ) {
+
+			return this.convert( color, this.workingColorSpace, targetColorSpace );
+
+		},
+
+		colorSpaceToWorking: function ( color, sourceColorSpace ) {
+
+			return this.convert( color, sourceColorSpace, this.workingColorSpace );
+
+		},
+
+		getPrimaries: function ( colorSpace ) {
+
+			return this.spaces[ colorSpace ].primaries;
+
+		},
+
+		getTransfer: function ( colorSpace ) {
+
+			if ( colorSpace === NoColorSpace ) return LinearTransfer;
+
+			return this.spaces[ colorSpace ].transfer;
+
+		},
+
+		getToneMappingMode: function ( colorSpace ) {
+
+			return this.spaces[ colorSpace ].outputColorSpaceConfig.toneMappingMode || 'standard';
+
+		},
+
+		getLuminanceCoefficients: function ( target, colorSpace = this.workingColorSpace ) {
+
+			return target.fromArray( this.spaces[ colorSpace ].luminanceCoefficients );
+
+		},
+
+		define: function ( colorSpaces ) {
+
+			Object.assign( this.spaces, colorSpaces );
+
+		},
+
+		// Internal APIs
+
+		_getMatrix: function ( targetMatrix, sourceColorSpace, targetColorSpace ) {
+
+			return targetMatrix
+				.copy( this.spaces[ sourceColorSpace ].toXYZ )
+				.multiply( this.spaces[ targetColorSpace ].fromXYZ );
+
+		},
+
+		_getDrawingBufferColorSpace: function ( colorSpace ) {
+
+			return this.spaces[ colorSpace ].outputColorSpaceConfig.drawingBufferColorSpace;
+
+		},
+
+		_getUnpackColorSpace: function ( colorSpace = this.workingColorSpace ) {
+
+			return this.spaces[ colorSpace ].workingColorSpaceConfig.unpackColorSpace;
+
+		},
+
+		// Deprecated
+
+		fromWorkingColorSpace: function ( color, targetColorSpace ) {
+
+			warnOnce( 'ColorManagement: .fromWorkingColorSpace() has been renamed to .workingToColorSpace().' ); // @deprecated, r177
+
+			return ColorManagement.workingToColorSpace( color, targetColorSpace );
+
+		},
+
+		toWorkingColorSpace: function ( color, sourceColorSpace ) {
+
+			warnOnce( 'ColorManagement: .toWorkingColorSpace() has been renamed to .colorSpaceToWorking().' ); // @deprecated, r177
+
+			return ColorManagement.colorSpaceToWorking( color, sourceColorSpace );
+
+		},
+
+	};
+
+	/******************************************************************************
+	 * sRGB definitions
+	 */
+
+	const REC709_PRIMARIES = [ 0.640, 0.330, 0.300, 0.600, 0.150, 0.060 ];
+	const REC709_LUMINANCE_COEFFICIENTS = [ 0.2126, 0.7152, 0.0722 ];
+	const D65 = [ 0.3127, 0.3290 ];
+
+	ColorManagement.define( {
+
+		[ LinearSRGBColorSpace ]: {
+			primaries: REC709_PRIMARIES,
+			whitePoint: D65,
+			transfer: LinearTransfer,
+			toXYZ: LINEAR_REC709_TO_XYZ,
+			fromXYZ: XYZ_TO_LINEAR_REC709,
+			luminanceCoefficients: REC709_LUMINANCE_COEFFICIENTS,
+			workingColorSpaceConfig: { unpackColorSpace: SRGBColorSpace },
+			outputColorSpaceConfig: { drawingBufferColorSpace: SRGBColorSpace }
+		},
+
+		[ SRGBColorSpace ]: {
+			primaries: REC709_PRIMARIES,
+			whitePoint: D65,
+			transfer: SRGBTransfer,
+			toXYZ: LINEAR_REC709_TO_XYZ,
+			fromXYZ: XYZ_TO_LINEAR_REC709,
+			luminanceCoefficients: REC709_LUMINANCE_COEFFICIENTS,
+			outputColorSpaceConfig: { drawingBufferColorSpace: SRGBColorSpace }
+		},
+
+	} );
+
+	return ColorManagement;
+
+}
+
+const ColorManagement = /*@__PURE__*/ createColorManagement();
+
+function SRGBToLinear( c ) {
+
+	return ( c < 0.04045 ) ? c * 0.0773993808 : Math.pow( c * 0.9478672986 + 0.0521327014, 2.4 );
+
+}
+
+function LinearToSRGB( c ) {
+
+	return ( c < 0.0031308 ) ? c * 12.92 : 1.055 * ( Math.pow( c, 0.41666 ) ) - 0.055;
+
+}
+
+let _canvas;
+
+/**
+ * A class containing utility functions for images.
+ *
+ * @hideconstructor
+ */
+class ImageUtils {
+
+	/**
+	 * Returns a data URI containing a representation of the given image.
+	 *
+	 * @param {(HTMLImageElement|HTMLCanvasElement)} image - The image object.
+	 * @param {string} [type='image/png'] - Indicates the image format.
+	 * @return {string} The data URI.
+	 */
+	static getDataURL( image, type = 'image/png' ) {
+
+		if ( /^data:/i.test( image.src ) ) {
+
+			return image.src;
+
+		}
+
+		if ( typeof HTMLCanvasElement === 'undefined' ) {
+
+			return image.src;
+
+		}
+
+		let canvas;
+
+		if ( image instanceof HTMLCanvasElement ) {
+
+			canvas = image;
+
+		} else {
+
+			if ( _canvas === undefined ) _canvas = createElementNS( 'canvas' );
+
+			_canvas.width = image.width;
+			_canvas.height = image.height;
+
+			const context = _canvas.getContext( '2d' );
+
+			if ( image instanceof ImageData ) {
+
+				context.putImageData( image, 0, 0 );
+
+			} else {
+
+				context.drawImage( image, 0, 0, image.width, image.height );
+
+			}
+
+			canvas = _canvas;
+
+		}
+
+		return canvas.toDataURL( type );
+
+	}
+
+	/**
+	 * Converts the given sRGB image data to linear color space.
+	 *
+	 * @param {(HTMLImageElement|HTMLCanvasElement|ImageBitmap|Object)} image - The image object.
+	 * @return {HTMLCanvasElement|Object} The converted image.
+	 */
+	static sRGBToLinear( image ) {
+
+		if ( ( typeof HTMLImageElement !== 'undefined' && image instanceof HTMLImageElement ) ||
+			( typeof HTMLCanvasElement !== 'undefined' && image instanceof HTMLCanvasElement ) ||
+			( typeof ImageBitmap !== 'undefined' && image instanceof ImageBitmap ) ) {
+
+			const canvas = createElementNS( 'canvas' );
+
+			canvas.width = image.width;
+			canvas.height = image.height;
+
+			const context = canvas.getContext( '2d' );
+			context.drawImage( image, 0, 0, image.width, image.height );
+
+			const imageData = context.getImageData( 0, 0, image.width, image.height );
+			const data = imageData.data;
+
+			for ( let i = 0; i < data.length; i ++ ) {
+
+				data[ i ] = SRGBToLinear( data[ i ] / 255 ) * 255;
+
+			}
+
+			context.putImageData( imageData, 0, 0 );
+
+			return canvas;
+
+		} else if ( image.data ) {
+
+			const data = image.data.slice( 0 );
+
+			for ( let i = 0; i < data.length; i ++ ) {
+
+				if ( data instanceof Uint8Array || data instanceof Uint8ClampedArray ) {
+
+					data[ i ] = Math.floor( SRGBToLinear( data[ i ] / 255 ) * 255 );
+
+				} else {
+
+					// assuming float
+
+					data[ i ] = SRGBToLinear( data[ i ] );
+
+				}
+
+			}
+
+			return {
+				data: data,
+				width: image.width,
+				height: image.height
+			};
+
+		} else {
+
+			warn( 'ImageUtils.sRGBToLinear(): Unsupported image type. No color space conversion applied.' );
+			return image;
+
+		}
+
+	}
+
+}
+
+let _sourceId = 0;
+
+/**
+ * Represents the data source of a texture.
+ *
+ * The main purpose of this class is to decouple the data definition from the texture
+ * definition so the same data can be used with multiple texture instances.
+ */
+class TextureSource {
+
+	/**
+	 * Constructs a new texture source.
+	 *
+	 * @param {any} [data=null] - The data definition of a texture.
+	 */
+	constructor( data = null ) {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isTextureSource = true;
+
+		/**
+		 * The ID of the source.
+		 *
+		 * @name TextureSource#id
+		 * @type {number}
+		 * @readonly
+		 */
+		Object.defineProperty( this, 'id', { value: _sourceId ++ } );
+
+		/**
+		 * The UUID of the source.
+		 *
+		 * @type {string}
+		 * @readonly
+		 */
+		this.uuid = generateUUID();
+
+		/**
+		 * The data definition of a texture.
+		 *
+		 * @type {any}
+		 */
+		this.data = data;
+
+		/**
+		 * This property is only relevant when {@link TextureSource#needsUpdate} is set to `true` and
+		 * provides more control on how texture data should be processed. When `dataReady` is set
+		 * to `false`, the engine performs the memory allocation (if necessary) but does not transfer
+		 * the data into the GPU memory.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.dataReady = true;
+
+		/**
+		 * This starts at `0` and counts how many times {@link TextureSource#needsUpdate} is set to `true`.
+		 *
+		 * @type {number}
+		 * @readonly
+		 * @default 0
+		 */
+		this.version = 0;
+
+	}
+
+	/**
+	 * Returns the dimensions of the source into the given target vector.
+	 *
+	 * @param {(Vector2|Vector3)} target - The target object the result is written into.
+	 * @return {(Vector2|Vector3)} The dimensions of the source.
+	 */
+	getSize( target ) {
+
+		const data = this.data;
+
+		if ( ( typeof HTMLVideoElement !== 'undefined' ) && ( data instanceof HTMLVideoElement ) ) {
+
+			target.set( data.videoWidth, data.videoHeight, 0 );
+
+		} else if ( ( typeof VideoFrame !== 'undefined' ) && ( data instanceof VideoFrame ) ) {
+
+			target.set( data.displayWidth, data.displayHeight, 0 );
+
+		} else if ( data !== null ) {
+
+			target.set( data.width, data.height, data.depth || 0 );
+
+		} else {
+
+			target.set( 0, 0, 0 );
+
+		}
+
+		return target;
+
+	}
+
+	/**
+	 * When the property is set to `true`, the engine allocates the memory
+	 * for the texture (if necessary) and triggers the actual texture upload
+	 * to the GPU next time the source is used.
+	 *
+	 * @type {boolean}
+	 * @default false
+	 * @param {boolean} value
+	 */
+	set needsUpdate( value ) {
+
+		if ( value === true ) this.version ++;
+
+	}
+
+	/**
+	 * Serializes the source into JSON.
+	 *
+	 * @param {?(Object|string)} meta - An optional value holding meta information about the serialization.
+	 * @return {Object} A JSON object representing the serialized source.
+	 * @see {@link ObjectLoader#parse}
+	 */
+	toJSON( meta ) {
+
+		const isRootObject = ( meta === undefined || typeof meta === 'string' );
+
+		if ( ! isRootObject && meta.images[ this.uuid ] !== undefined ) {
+
+			return meta.images[ this.uuid ];
+
+		}
+
+		const output = {
+			uuid: this.uuid,
+			url: ''
+		};
+
+		const data = this.data;
+
+		if ( data !== null ) {
+
+			let url;
+
+			if ( Array.isArray( data ) ) {
+
+				// cube texture
+
+				url = [];
+
+				for ( let i = 0, l = data.length; i < l; i ++ ) {
+
+					if ( data[ i ].isDataTexture ) {
+
+						url.push( serializeImage( data[ i ].image ) );
+
+					} else {
+
+						url.push( serializeImage( data[ i ] ) );
+
+					}
+
+				}
+
+			} else {
+
+				// texture
+
+				url = serializeImage( data );
+
+			}
+
+			output.url = url;
+
+		}
+
+		if ( ! isRootObject ) {
+
+			meta.images[ this.uuid ] = output;
+
+		}
+
+		return output;
+
+	}
+
+}
+
+function serializeImage( image ) {
+
+	if ( ( typeof HTMLImageElement !== 'undefined' && image instanceof HTMLImageElement ) ||
+		( typeof HTMLCanvasElement !== 'undefined' && image instanceof HTMLCanvasElement ) ||
+		( typeof ImageBitmap !== 'undefined' && image instanceof ImageBitmap ) ) {
+
+		// default images
+
+		return ImageUtils.getDataURL( image );
+
+	} else {
+
+		if ( image.data ) {
+
+			// images of DataTexture
+
+			return {
+				data: Array.from( image.data ),
+				width: image.width,
+				height: image.height,
+				type: image.data.constructor.name
+			};
+
+		} else {
+
+			warn( 'Texture: Unable to serialize Texture.' );
+			return {};
+
+		}
+
+	}
+
+}
+
+/**
+ * @deprecated since r186. Use {@link TextureSource} instead. `Source` has been renamed to `TextureSource`.
+ */
+class Source extends TextureSource {
+
+	/**
+	 * Constructs a new texture source.
+	 *
+	 * @param {any} [data=null] - The data definition of a texture.
+	 * @deprecated since r186. Use {@link TextureSource} instead.
+	 */
+	constructor( data = null ) {
+
+		warnOnce( 'Source: "Source" has been renamed to "TextureSource". Please update your code to use "THREE.TextureSource" instead.' ); // @deprecated, r186
+
+		super( data );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @deprecated since r186. Use {@link TextureSource#isTextureSource} instead.
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isSource = true;
+
+	}
+
+}
+
+let _textureId = 0;
+
+const _tempVec3 = /*@__PURE__*/ new Vector3();
+
+/**
+ * Base class for all textures.
+ *
+ * Note: After the initial use of a texture, its dimensions, format, and type
+ * cannot be changed. Instead, call {@link Texture#dispose} on the texture and instantiate a new one.
+ *
+ * @augments EventDispatcher
+ */
+class Texture extends EventDispatcher {
+
+	/**
+	 * Constructs a new texture.
+	 *
+	 * @param {?Object} [image=Texture.DEFAULT_IMAGE] - The image holding the texture data.
+	 * @param {number} [mapping=Texture.DEFAULT_MAPPING] - The texture mapping.
+	 * @param {number} [wrapS=ClampToEdgeWrapping] - The wrapS value.
+	 * @param {number} [wrapT=ClampToEdgeWrapping] - The wrapT value.
+	 * @param {number} [magFilter=LinearFilter] - The mag filter value.
+	 * @param {number} [minFilter=LinearMipmapLinearFilter] - The min filter value.
+	 * @param {number} [format=RGBAFormat] - The texture format.
+	 * @param {number} [type=UnsignedByteType] - The texture type.
+	 * @param {number} [anisotropy=Texture.DEFAULT_ANISOTROPY] - The anisotropy value.
+	 * @param {string} [colorSpace=NoColorSpace] - The color space.
+	 */
+	constructor( image = Texture.DEFAULT_IMAGE, mapping = Texture.DEFAULT_MAPPING, wrapS = ClampToEdgeWrapping, wrapT = ClampToEdgeWrapping, magFilter = LinearFilter, minFilter = LinearMipmapLinearFilter, format = RGBAFormat, type = UnsignedByteType, anisotropy = Texture.DEFAULT_ANISOTROPY, colorSpace = NoColorSpace ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isTexture = true;
+
+		/**
+		 * The ID of the texture.
+		 *
+		 * @name Texture#id
+		 * @type {number}
+		 * @readonly
+		 */
+		Object.defineProperty( this, 'id', { value: _textureId ++ } );
+
+		/**
+		 * The UUID of the texture.
+		 *
+		 * @type {string}
+		 * @readonly
+		 */
+		this.uuid = generateUUID();
+
+		/**
+		 * The name of the texture.
+		 *
+		 * @type {string}
+		 */
+		this.name = '';
+
+		/**
+		 * The data definition of a texture. A reference to the data source can be
+		 * shared across textures. This is often useful in context of spritesheets
+		 * where multiple textures render the same data but with different texture
+		 * transformations.
+		 *
+		 * @type {TextureSource}
+		 */
+		this.source = new TextureSource( image );
+
+		/**
+		 * An array holding user-defined mipmaps.
+		 *
+		 * @type {Array<Object>}
+		 */
+		this.mipmaps = [];
+
+		/**
+		 * How the texture is applied to the object. The value `UVMapping`
+		 * is the default, where texture or uv coordinates are used to apply the map.
+		 *
+		 * @type {(UVMapping|CubeReflectionMapping|CubeRefractionMapping|EquirectangularReflectionMapping|EquirectangularRefractionMapping|CubeUVReflectionMapping)}
+		 * @default UVMapping
+		*/
+		this.mapping = mapping;
+
+		/**
+		 * Lets you select the uv attribute to map the texture to. `0` for `uv`,
+		 * `1` for `uv1`, `2` for `uv2` and `3` for `uv3`.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.channel = 0;
+
+		/**
+		 * This defines how the texture is wrapped horizontally and corresponds to
+		 * *U* in UV mapping.
+		 *
+		 * @type {(RepeatWrapping|ClampToEdgeWrapping|MirroredRepeatWrapping)}
+		 * @default ClampToEdgeWrapping
+		 */
+		this.wrapS = wrapS;
+
+		/**
+		 * This defines how the texture is wrapped horizontally and corresponds to
+		 * *V* in UV mapping.
+		 *
+		 * @type {(RepeatWrapping|ClampToEdgeWrapping|MirroredRepeatWrapping)}
+		 * @default ClampToEdgeWrapping
+		 */
+		this.wrapT = wrapT;
+
+		/**
+		 * How the texture is sampled when a texel covers more than one pixel.
+		 *
+		 * @type {(NearestFilter|NearestMipmapNearestFilter|NearestMipmapLinearFilter|LinearFilter|LinearMipmapNearestFilter|LinearMipmapLinearFilter)}
+		 * @default LinearFilter
+		 */
+		this.magFilter = magFilter;
+
+		/**
+		 * How the texture is sampled when a texel covers less than one pixel.
+		 *
+		 * @type {(NearestFilter|NearestMipmapNearestFilter|NearestMipmapLinearFilter|LinearFilter|LinearMipmapNearestFilter|LinearMipmapLinearFilter)}
+		 * @default LinearMipmapLinearFilter
+		 */
+		this.minFilter = minFilter;
+
+		/**
+		 * The number of samples taken along the axis through the pixel that has the
+		 * highest density of texels. By default, this value is `1`. A higher value
+		 * gives a less blurry result than a basic mipmap, at the cost of more
+		 * texture samples being used.
+		 *
+		 * @type {number}
+		 * @default Texture.DEFAULT_ANISOTROPY
+		 */
+		this.anisotropy = anisotropy;
+
+		/**
+		 * The format of the texture.
+		 *
+		 * @type {number}
+		 * @default RGBAFormat
+		 */
+		this.format = format;
+
+		/**
+		 * The default internal format is derived from {@link Texture#format} and {@link Texture#type} and
+		 * defines how the texture data is going to be stored on the GPU.
+		 *
+		 * This property allows to overwrite the default format.
+		 *
+		 * @type {?string}
+		 * @default null
+		 */
+		this.internalFormat = null;
+
+		/**
+		 * The data type of the texture.
+		 *
+		 * @type {number}
+		 * @default UnsignedByteType
+		 */
+		this.type = type;
+
+		/**
+		 * How much a single repetition of the texture is offset from the beginning,
+		 * in each direction U and V. Typical range is `0.0` to `1.0`.
+		 *
+		 * @type {Vector2}
+		 * @default (0,0)
+		 */
+		this.offset = new Vector2( 0, 0 );
+
+		/**
+		 * How many times the texture is repeated across the surface, in each
+		 * direction U and V. If repeat is set greater than `1` in either direction,
+		 * the corresponding wrap parameter should also be set to `RepeatWrapping`
+		 * or `MirroredRepeatWrapping` to achieve the desired tiling effect.
+		 *
+		 * @type {Vector2}
+		 * @default (1,1)
+		 */
+		this.repeat = new Vector2( 1, 1 );
+
+		/**
+		 * The point around which rotation occurs. A value of `(0.5, 0.5)` corresponds
+		 * to the center of the texture. Default is `(0, 0)`, the lower left.
+		 *
+		 * @type {Vector2}
+		 * @default (0,0)
+		 */
+		this.center = new Vector2( 0, 0 );
+
+		/**
+		 * How much the texture is rotated around the center point, in radians.
+		 * Positive values are counter-clockwise.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.rotation = 0;
+
+		/**
+		 * Whether to update the texture's uv-transformation {@link Texture#matrix}
+		 * from the properties {@link Texture#offset}, {@link Texture#repeat},
+		 * {@link Texture#rotation}, and {@link Texture#center}.
+		 *
+		 * Set this to `false` if you are specifying the uv-transform matrix directly.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.matrixAutoUpdate = true;
+
+		/**
+		 * The uv-transformation matrix of the texture.
+		 *
+		 * @type {Matrix3}
+		 */
+		this.matrix = new Matrix3();
+
+		/**
+		 * Whether to generate mipmaps (if possible) for a texture.
+		 *
+		 * Set this to `false` if you are creating mipmaps manually.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.generateMipmaps = true;
+
+		/**
+		 * If set to `true`, the alpha channel, if present, is multiplied into the
+		 * color channels when the texture is uploaded to the GPU.
+		 *
+		 * Note that this property has no effect when using `ImageBitmap`. You need to
+		 * configure premultiply alpha on bitmap creation instead.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.premultiplyAlpha = false;
+
+		/**
+		 * If set to `true`, the texture is flipped along the vertical axis when
+		 * uploaded to the GPU.
+		 *
+		 * Note that this property has no effect when using `ImageBitmap`. You need to
+		 * configure the flip on bitmap creation instead.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.flipY = true;
+
+		/**
+		 * Specifies the alignment requirements for the start of each pixel row in memory.
+		 * The allowable values are `1` (byte-alignment), `2` (rows aligned to even-numbered bytes),
+		 * `4` (word-alignment), and `8` (rows start on double-word boundaries).
+		 *
+		 * @type {number}
+		 * @default 4
+		 */
+		this.unpackAlignment = 4;	// valid values: 1, 2, 4, 8 (see http://www.khronos.org/opengles/sdk/docs/man/xhtml/glPixelStorei.xml)
+
+		/**
+		 * Textures containing color data should be annotated with `SRGBColorSpace` or `LinearSRGBColorSpace`.
+		 *
+		 * @type {string}
+		 * @default NoColorSpace
+		 */
+		this.colorSpace = colorSpace;
+
+		/**
+		 * An object that can be used to store custom data about the texture. It
+		 * should not hold references to functions as these will not be cloned.
+		 *
+		 * @type {Object}
+		 */
+		this.userData = {};
+
+		/**
+		 * This can be used to only update a subregion or specific rows of the texture (for example, just the
+		 * first 3 rows). Use the `addUpdateRange()` function to add ranges to this array.
+		 *
+		 * @type {Array<Object>}
+		 */
+		this.updateRanges = [];
+
+		/**
+		 * This starts at `0` and counts how many times {@link Texture#needsUpdate} is set to `true`.
+		 *
+		 * @type {number}
+		 * @readonly
+		 * @default 0
+		 */
+		this.version = 0;
+
+		/**
+		 * A callback function, called when the texture is updated (e.g., when
+		 * {@link Texture#needsUpdate} has been set to true and then the texture is used).
+		 *
+		 * @type {?Function}
+		 * @default null
+		 */
+		this.onUpdate = null;
+
+		/**
+		 * An optional back reference to the textures render target.
+		 *
+		 * @type {?(RenderTarget|WebGLRenderTarget)}
+		 * @default null
+		 */
+		this.renderTarget = null;
+
+		/**
+		 * Indicates whether a texture belongs to a render target or not.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default false
+		 */
+		this.isRenderTargetTexture = false;
+
+		/**
+		 * Indicates if a texture should be handled like a texture array.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default false
+		 */
+		this.isArrayTexture = image && image.depth && image.depth > 1 ? true : false;
+
+		/**
+		 * Indicates whether this texture should be processed by `PMREMGenerator` or not
+		 * (only relevant for render target textures).
+		 *
+		 * @type {number}
+		 * @readonly
+		 * @default 0
+		 */
+		this.pmremVersion = 0;
+
+		/**
+		 * Whether the texture should use one of the 16 bit integer formats which are normalized
+		 * to [0, 1] or [-1, 1] (depending on signed/unsigned) when sampled.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.normalized = false;
+
+	}
+
+	/**
+	 * The width of the texture in pixels.
+	 */
+	get width() {
+
+		return this.source.getSize( _tempVec3 ).x;
+
+	}
+
+	/**
+	 * The height of the texture in pixels.
+	 */
+	get height() {
+
+		return this.source.getSize( _tempVec3 ).y;
+
+	}
+
+	/**
+	 * The depth of the texture in pixels.
+	 */
+	get depth() {
+
+		return this.source.getSize( _tempVec3 ).z;
+
+	}
+
+	/**
+	 * The image object holding the texture data.
+	 *
+	 * @type {?Object}
+	 */
+	get image() {
+
+		return this.source.data;
+
+	}
+
+	set image( value ) {
+
+		this.source.data = value;
+
+	}
+
+	/**
+	 * Updates the texture transformation matrix from the properties {@link Texture#offset},
+	 * {@link Texture#repeat}, {@link Texture#rotation}, and {@link Texture#center}.
+	 */
+	updateMatrix() {
+
+		this.matrix.setUvTransform( this.offset.x, this.offset.y, this.repeat.x, this.repeat.y, this.rotation, this.center.x, this.center.y );
+
+	}
+
+	/**
+	 * Adds a range of data in the data texture to be updated on the GPU.
+	 *
+	 * @param {number} start - Position at which to start update.
+	 * @param {number} count - The number of components to update.
+	 */
+	addUpdateRange( start, count ) {
+
+		this.updateRanges.push( { start, count } );
+
+	}
+
+	/**
+	 * Clears the update ranges.
+	 */
+	clearUpdateRanges() {
+
+		this.updateRanges.length = 0;
+
+	}
+
+	/**
+	 * Returns a new texture with copied values from this instance.
+	 *
+	 * @return {Texture} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+	/**
+	 * Copies the values of the given texture to this instance.
+	 *
+	 * @param {Texture} source - The texture to copy.
+	 * @return {Texture} A reference to this instance.
+	 */
+	copy( source ) {
+
+		this.name = source.name;
+
+		this.source = source.source;
+		this.mipmaps = source.mipmaps.slice( 0 );
+
+		this.mapping = source.mapping;
+		this.channel = source.channel;
+
+		this.wrapS = source.wrapS;
+		this.wrapT = source.wrapT;
+
+		this.magFilter = source.magFilter;
+		this.minFilter = source.minFilter;
+
+		this.anisotropy = source.anisotropy;
+
+		this.format = source.format;
+		this.internalFormat = source.internalFormat;
+		this.type = source.type;
+		this.normalized = source.normalized;
+
+		this.offset.copy( source.offset );
+		this.repeat.copy( source.repeat );
+		this.center.copy( source.center );
+		this.rotation = source.rotation;
+
+		this.matrixAutoUpdate = source.matrixAutoUpdate;
+		this.matrix.copy( source.matrix );
+
+		this.generateMipmaps = source.generateMipmaps;
+		this.premultiplyAlpha = source.premultiplyAlpha;
+		this.flipY = source.flipY;
+		this.unpackAlignment = source.unpackAlignment;
+		this.colorSpace = source.colorSpace;
+
+		this.renderTarget = source.renderTarget;
+		this.isRenderTargetTexture = source.isRenderTargetTexture;
+		this.isArrayTexture = source.isArrayTexture;
+
+		this.userData = JSON.parse( JSON.stringify( source.userData ) );
+
+		this.needsUpdate = true;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this texture's properties based on `values`.
+	 * @param {Object} values - A container with texture parameters.
+	 */
+	setValues( values ) {
+
+		for ( const key in values ) {
+
+			const newValue = values[ key ];
+
+			if ( newValue === undefined ) {
+
+				warn( `Texture.setValues(): parameter '${ key }' has value of undefined.` );
+				continue;
+
+			}
+
+			const currentValue = this[ key ];
+
+			if ( currentValue === undefined ) {
+
+				warn( `Texture.setValues(): property '${ key }' does not exist.` );
+				continue;
+
+			}
+
+			if ( ( currentValue && newValue ) && ( currentValue.isVector2 && newValue.isVector2 ) ) {
+
+				currentValue.copy( newValue );
+
+			} else if ( ( currentValue && newValue ) && ( currentValue.isVector3 && newValue.isVector3 ) ) {
+
+				currentValue.copy( newValue );
+
+			} else if ( ( currentValue && newValue ) && ( currentValue.isMatrix3 && newValue.isMatrix3 ) ) {
+
+				currentValue.copy( newValue );
+
+			} else {
+
+				this[ key ] = newValue;
+
+			}
+
+		}
+
+	}
+
+	/**
+	 * Serializes the texture into JSON.
+	 *
+	 * @param {?(Object|string)} meta - An optional value holding meta information about the serialization.
+	 * @return {Object} A JSON object representing the serialized texture.
+	 * @see {@link ObjectLoader#parse}
+	 */
+	toJSON( meta ) {
+
+		const isRootObject = ( meta === undefined || typeof meta === 'string' );
+
+		if ( ! isRootObject && meta.textures[ this.uuid ] !== undefined ) {
+
+			return meta.textures[ this.uuid ];
+
+		}
+
+		const output = {
+
+			metadata: {
+				version: 4.7,
+				type: 'Texture',
+				generator: 'Texture.toJSON'
+			},
+
+			uuid: this.uuid,
+			name: this.name,
+
+			image: this.source.toJSON( meta ).uuid,
+
+			mapping: this.mapping,
+			channel: this.channel,
+
+			repeat: [ this.repeat.x, this.repeat.y ],
+			offset: [ this.offset.x, this.offset.y ],
+			center: [ this.center.x, this.center.y ],
+			rotation: this.rotation,
+
+			wrap: [ this.wrapS, this.wrapT ],
+
+			format: this.format,
+			internalFormat: this.internalFormat,
+			type: this.type,
+			normalized: this.normalized,
+			colorSpace: this.colorSpace,
+
+			minFilter: this.minFilter,
+			magFilter: this.magFilter,
+			anisotropy: this.anisotropy,
+
+			flipY: this.flipY,
+
+			generateMipmaps: this.generateMipmaps,
+			premultiplyAlpha: this.premultiplyAlpha,
+			unpackAlignment: this.unpackAlignment
+
+		};
+
+		if ( Object.keys( this.userData ).length > 0 ) output.userData = this.userData;
+
+		if ( ! isRootObject ) {
+
+			meta.textures[ this.uuid ] = output;
+
+		}
+
+		return output;
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 *
+	 * @fires Texture#dispose
+	 */
+	dispose() {
+
+		/**
+		 * Fires when the texture has been disposed of.
+		 *
+		 * @event Texture#dispose
+		 * @type {Object}
+		 */
+		this.dispatchEvent( { type: 'dispose' } );
+
+	}
+
+	/**
+	 * Transforms the given uv vector with the textures uv transformation matrix.
+	 *
+	 * @param {Vector2} uv - The uv vector.
+	 * @return {Vector2} The transformed uv vector.
+	 */
+	transformUv( uv ) {
+
+		if ( this.mapping !== UVMapping ) return uv;
+
+		uv.applyMatrix3( this.matrix );
+
+		if ( uv.x < 0 || uv.x > 1 ) {
+
+			switch ( this.wrapS ) {
+
+				case RepeatWrapping:
+
+					uv.x = uv.x - Math.floor( uv.x );
+					break;
+
+				case ClampToEdgeWrapping:
+
+					uv.x = uv.x < 0 ? 0 : 1;
+					break;
+
+				case MirroredRepeatWrapping:
+
+					if ( Math.abs( Math.floor( uv.x ) % 2 ) === 1 ) {
+
+						uv.x = Math.ceil( uv.x ) - uv.x;
+
+					} else {
+
+						uv.x = uv.x - Math.floor( uv.x );
+
+					}
+
+					break;
+
+			}
+
+		}
+
+		if ( uv.y < 0 || uv.y > 1 ) {
+
+			switch ( this.wrapT ) {
+
+				case RepeatWrapping:
+
+					uv.y = uv.y - Math.floor( uv.y );
+					break;
+
+				case ClampToEdgeWrapping:
+
+					uv.y = uv.y < 0 ? 0 : 1;
+					break;
+
+				case MirroredRepeatWrapping:
+
+					if ( Math.abs( Math.floor( uv.y ) % 2 ) === 1 ) {
+
+						uv.y = Math.ceil( uv.y ) - uv.y;
+
+					} else {
+
+						uv.y = uv.y - Math.floor( uv.y );
+
+					}
+
+					break;
+
+			}
+
+		}
+
+		if ( this.flipY ) {
+
+			uv.y = 1 - uv.y;
+
+		}
+
+		return uv;
+
+	}
+
+	/**
+	 * Setting this property to `true` indicates the engine the texture
+	 * must be updated in the next render. This triggers a texture upload
+	 * to the GPU and ensures correct texture parameter configuration.
+	 *
+	 * @type {boolean}
+	 * @default false
+	 * @param {boolean} value
+	 */
+	set needsUpdate( value ) {
+
+		if ( value === true ) {
+
+			this.version ++;
+			this.source.needsUpdate = true;
+
+		}
+
+	}
+
+	/**
+	 * Setting this property to `true` indicates the engine the PMREM
+	 * must be regenerated.
+	 *
+	 * @type {boolean}
+	 * @default false
+	 * @param {boolean} value
+	 */
+	set needsPMREMUpdate( value ) {
+
+		if ( value === true ) {
+
+			this.pmremVersion ++;
+
+		}
+
+	}
+
+}
+
+/**
+ * The default image for all textures.
+ *
+ * @static
+ * @type {?Image}
+ * @default null
+ */
+Texture.DEFAULT_IMAGE = null;
+
+/**
+ * The default mapping for all textures.
+ *
+ * @static
+ * @type {number}
+ * @default UVMapping
+ */
+Texture.DEFAULT_MAPPING = UVMapping;
+
+/**
+ * The default anisotropy value for all textures.
+ *
+ * @static
+ * @type {number}
+ * @default 1
+ */
+Texture.DEFAULT_ANISOTROPY = 1;
+
+/**
+ * Class representing a 4D vector. A 4D vector is an ordered quadruplet of numbers
+ * (labeled x, y, z and w), which can be used to represent a number of things, such as:
+ *
+ * - A point in 4D space.
+ * - A direction and length in 4D space. In three.js the length will
+ * always be the Euclidean distance(straight-line distance) from `(0, 0, 0, 0)` to `(x, y, z, w)`
+ * and the direction is also measured from `(0, 0, 0, 0)` towards `(x, y, z, w)`.
+ * - Any arbitrary ordered quadruplet of numbers.
+ *
+ * There are other things a 4D vector can be used to represent, however these
+ * are the most common uses in *three.js*.
+ *
+ * Iterating through a vector instance will yield its components `(x, y, z, w)` in
+ * the corresponding order.
+ * ```js
+ * const a = new THREE.Vector4( 0, 1, 0, 0 );
+ *
+ * //no arguments; will be initialised to (0, 0, 0, 1)
+ * const b = new THREE.Vector4( );
+ *
+ * const d = a.dot( b );
+ * ```
+ */
+class Vector4 {
+
+	static {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		Vector4.prototype.isVector4 = true;
+
+	}
+
+	/**
+	 * Constructs a new 4D vector.
+	 *
+	 * @param {number} [x=0] - The x value of this vector.
+	 * @param {number} [y=0] - The y value of this vector.
+	 * @param {number} [z=0] - The z value of this vector.
+	 * @param {number} [w=1] - The w value of this vector.
+	 */
+	constructor( x = 0, y = 0, z = 0, w = 1 ) {
+
+		/**
+		 * The x value of this vector.
+		 *
+		 * @type {number}
+		 */
+		this.x = x;
+
+		/**
+		 * The y value of this vector.
+		 *
+		 * @type {number}
+		 */
+		this.y = y;
+
+		/**
+		 * The z value of this vector.
+		 *
+		 * @type {number}
+		 */
+		this.z = z;
+
+		/**
+		 * The w value of this vector.
+		 *
+		 * @type {number}
+		 */
+		this.w = w;
+
+	}
+
+	/**
+	 * Alias for {@link Vector4#z}.
+	 *
+	 * @type {number}
+	 */
+	get width() {
+
+		return this.z;
+
+	}
+
+	set width( value ) {
+
+		this.z = value;
+
+	}
+
+	/**
+	 * Alias for {@link Vector4#w}.
+	 *
+	 * @type {number}
+	 */
+	get height() {
+
+		return this.w;
+
+	}
+
+	set height( value ) {
+
+		this.w = value;
+
+	}
+
+	/**
+	 * Sets the vector components.
+	 *
+	 * @param {number} x - The value of the x component.
+	 * @param {number} y - The value of the y component.
+	 * @param {number} z - The value of the z component.
+	 * @param {number} w - The value of the w component.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	set( x, y, z, w ) {
+
+		this.x = x;
+		this.y = y;
+		this.z = z;
+		this.w = w;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector components to the same value.
+	 *
+	 * @param {number} scalar - The value to set for all vector components.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	setScalar( scalar ) {
+
+		this.x = scalar;
+		this.y = scalar;
+		this.z = scalar;
+		this.w = scalar;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector's x component to the given value
+	 *
+	 * @param {number} x - The value to set.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	setX( x ) {
+
+		this.x = x;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector's y component to the given value
+	 *
+	 * @param {number} y - The value to set.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	setY( y ) {
+
+		this.y = y;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector's z component to the given value
+	 *
+	 * @param {number} z - The value to set.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	setZ( z ) {
+
+		this.z = z;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector's w component to the given value
+	 *
+	 * @param {number} w - The value to set.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	setW( w ) {
+
+		this.w = w;
+
+		return this;
+
+	}
+
+	/**
+	 * Allows to set a vector component with an index.
+	 *
+	 * @param {number} index - The component index. `0` equals to x, `1` equals to y,
+	 * `2` equals to z, `3` equals to w.
+	 * @param {number} value - The value to set.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	setComponent( index, value ) {
+
+		switch ( index ) {
+
+			case 0: this.x = value; break;
+			case 1: this.y = value; break;
+			case 2: this.z = value; break;
+			case 3: this.w = value; break;
+			default: throw new Error( 'THREE.Vector4: index is out of range: ' + index );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the value of the vector component which matches the given index.
+	 *
+	 * @param {number} index - The component index. `0` equals to x, `1` equals to y,
+	 * `2` equals to z, `3` equals to w.
+	 * @return {number} A vector component value.
+	 */
+	getComponent( index ) {
+
+		switch ( index ) {
+
+			case 0: return this.x;
+			case 1: return this.y;
+			case 2: return this.z;
+			case 3: return this.w;
+			default: throw new Error( 'THREE.Vector4: index is out of range: ' + index );
+
+		}
+
+	}
+
+	/**
+	 * Returns a new vector with copied values from this instance.
+	 *
+	 * @return {Vector4} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor( this.x, this.y, this.z, this.w );
+
+	}
+
+	/**
+	 * Copies the values of the given vector to this instance.
+	 *
+	 * @param {Vector3|Vector4} v - The vector to copy.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	copy( v ) {
+
+		this.x = v.x;
+		this.y = v.y;
+		this.z = v.z;
+		this.w = ( v.w !== undefined ) ? v.w : 1;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given vector to this instance.
+	 *
+	 * @param {Vector4} v - The vector to add.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	add( v ) {
+
+		this.x += v.x;
+		this.y += v.y;
+		this.z += v.z;
+		this.w += v.w;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given scalar value to all components of this instance.
+	 *
+	 * @param {number} s - The scalar to add.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	addScalar( s ) {
+
+		this.x += s;
+		this.y += s;
+		this.z += s;
+		this.w += s;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given vectors and stores the result in this instance.
+	 *
+	 * @param {Vector4} a - The first vector.
+	 * @param {Vector4} b - The second vector.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	addVectors( a, b ) {
+
+		this.x = a.x + b.x;
+		this.y = a.y + b.y;
+		this.z = a.z + b.z;
+		this.w = a.w + b.w;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given vector scaled by the given factor to this instance.
+	 *
+	 * @param {Vector4} v - The vector.
+	 * @param {number} s - The factor that scales `v`.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	addScaledVector( v, s ) {
+
+		this.x += v.x * s;
+		this.y += v.y * s;
+		this.z += v.z * s;
+		this.w += v.w * s;
+
+		return this;
+
+	}
+
+	/**
+	 * Subtracts the given vector from this instance.
+	 *
+	 * @param {Vector4} v - The vector to subtract.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	sub( v ) {
+
+		this.x -= v.x;
+		this.y -= v.y;
+		this.z -= v.z;
+		this.w -= v.w;
+
+		return this;
+
+	}
+
+	/**
+	 * Subtracts the given scalar value from all components of this instance.
+	 *
+	 * @param {number} s - The scalar to subtract.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	subScalar( s ) {
+
+		this.x -= s;
+		this.y -= s;
+		this.z -= s;
+		this.w -= s;
+
+		return this;
+
+	}
+
+	/**
+	 * Subtracts the given vectors and stores the result in this instance.
+	 *
+	 * @param {Vector4} a - The first vector.
+	 * @param {Vector4} b - The second vector.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	subVectors( a, b ) {
+
+		this.x = a.x - b.x;
+		this.y = a.y - b.y;
+		this.z = a.z - b.z;
+		this.w = a.w - b.w;
+
+		return this;
+
+	}
+
+	/**
+	 * Multiplies the given vector with this instance.
+	 *
+	 * @param {Vector4} v - The vector to multiply.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	multiply( v ) {
+
+		this.x *= v.x;
+		this.y *= v.y;
+		this.z *= v.z;
+		this.w *= v.w;
+
+		return this;
+
+	}
+
+	/**
+	 * Multiplies the given scalar value with all components of this instance.
+	 *
+	 * @param {number} scalar - The scalar to multiply.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	multiplyScalar( scalar ) {
+
+		this.x *= scalar;
+		this.y *= scalar;
+		this.z *= scalar;
+		this.w *= scalar;
+
+		return this;
+
+	}
+
+	/**
+	 * Multiplies this vector with the given 4x4 matrix.
+	 *
+	 * @param {Matrix4} m - The 4x4 matrix.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	applyMatrix4( m ) {
+
+		const x = this.x, y = this.y, z = this.z, w = this.w;
+		const e = m.elements;
+
+		this.x = e[ 0 ] * x + e[ 4 ] * y + e[ 8 ] * z + e[ 12 ] * w;
+		this.y = e[ 1 ] * x + e[ 5 ] * y + e[ 9 ] * z + e[ 13 ] * w;
+		this.z = e[ 2 ] * x + e[ 6 ] * y + e[ 10 ] * z + e[ 14 ] * w;
+		this.w = e[ 3 ] * x + e[ 7 ] * y + e[ 11 ] * z + e[ 15 ] * w;
+
+		return this;
+
+	}
+
+	/**
+	 * Divides this instance by the given vector.
+	 *
+	 * @param {Vector4} v - The vector to divide.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	divide( v ) {
+
+		this.x /= v.x;
+		this.y /= v.y;
+		this.z /= v.z;
+		this.w /= v.w;
+
+		return this;
+
+	}
+
+	/**
+	 * Divides this vector by the given scalar.
+	 *
+	 * @param {number} scalar - The scalar to divide.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	divideScalar( scalar ) {
+
+		return this.multiplyScalar( 1 / scalar );
+
+	}
+
+	/**
+	 * Sets the x, y and z components of this
+	 * vector to the quaternion's axis and w to the angle.
+	 *
+	 * @param {Quaternion} q - The Quaternion to set.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	setAxisAngleFromQuaternion( q ) {
+
+		// q is assumed to be normalized
+
+		this.w = 2 * Math.acos( q.w );
+
+		const s = Math.sqrt( 1 - q.w * q.w );
+
+		if ( s < 0.0001 ) {
+
+			this.x = 1;
+			this.y = 0;
+			this.z = 0;
+
+		} else {
+
+			this.x = q.x / s;
+			this.y = q.y / s;
+			this.z = q.z / s;
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the x, y and z components of this
+	 * vector to the axis of rotation and w to the angle.
+	 *
+	 * @param {Matrix4} m - A 4x4 matrix of which the upper left 3x3 matrix is a pure rotation matrix.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	setAxisAngleFromRotationMatrix( m ) {
+
+		// assumes the upper 3x3 of m is a pure rotation matrix (i.e, unscaled)
+
+		let angle, x, y, z; // variables for result
+		const epsilon = 0.01,		// margin to allow for rounding errors
+			epsilon2 = 0.1,		// margin to distinguish between 0 and 180 degrees
+
+			te = m.elements,
+
+			m11 = te[ 0 ], m12 = te[ 4 ], m13 = te[ 8 ],
+			m21 = te[ 1 ], m22 = te[ 5 ], m23 = te[ 9 ],
+			m31 = te[ 2 ], m32 = te[ 6 ], m33 = te[ 10 ];
+
+		if ( ( Math.abs( m12 - m21 ) < epsilon ) &&
+		     ( Math.abs( m13 - m31 ) < epsilon ) &&
+		     ( Math.abs( m23 - m32 ) < epsilon ) ) {
+
+			// singularity found
+			// first check for identity matrix which must have +1 for all terms
+			// in leading diagonal and zero in other terms
+
+			if ( ( Math.abs( m12 + m21 ) < epsilon2 ) &&
+			     ( Math.abs( m13 + m31 ) < epsilon2 ) &&
+			     ( Math.abs( m23 + m32 ) < epsilon2 ) &&
+			     ( Math.abs( m11 + m22 + m33 - 3 ) < epsilon2 ) ) {
+
+				// this singularity is identity matrix so angle = 0
+
+				this.set( 1, 0, 0, 0 );
+
+				return this; // zero angle, arbitrary axis
+
+			}
+
+			// otherwise this singularity is angle = 180
+
+			angle = Math.PI;
+
+			const xx = ( m11 + 1 ) / 2;
+			const yy = ( m22 + 1 ) / 2;
+			const zz = ( m33 + 1 ) / 2;
+			const xy = ( m12 + m21 ) / 4;
+			const xz = ( m13 + m31 ) / 4;
+			const yz = ( m23 + m32 ) / 4;
+
+			if ( ( xx > yy ) && ( xx > zz ) ) {
+
+				// m11 is the largest diagonal term
+
+				if ( xx < epsilon ) {
+
+					x = 0;
+					y = 0.707106781;
+					z = 0.707106781;
+
+				} else {
+
+					x = Math.sqrt( xx );
+					y = xy / x;
+					z = xz / x;
+
+				}
+
+			} else if ( yy > zz ) {
+
+				// m22 is the largest diagonal term
+
+				if ( yy < epsilon ) {
+
+					x = 0.707106781;
+					y = 0;
+					z = 0.707106781;
+
+				} else {
+
+					y = Math.sqrt( yy );
+					x = xy / y;
+					z = yz / y;
+
+				}
+
+			} else {
+
+				// m33 is the largest diagonal term so base result on this
+
+				if ( zz < epsilon ) {
+
+					x = 0.707106781;
+					y = 0.707106781;
+					z = 0;
+
+				} else {
+
+					z = Math.sqrt( zz );
+					x = xz / z;
+					y = yz / z;
+
+				}
+
+			}
+
+			this.set( x, y, z, angle );
+
+			return this; // return 180 deg rotation
+
+		}
+
+		// as we have reached here there are no singularities so we can handle normally
+
+		let s = Math.sqrt( ( m32 - m23 ) * ( m32 - m23 ) +
+			( m13 - m31 ) * ( m13 - m31 ) +
+			( m21 - m12 ) * ( m21 - m12 ) ); // used to normalize
+
+		if ( Math.abs( s ) < 0.001 ) s = 1;
+
+		// prevent divide by zero, should not happen if matrix is orthogonal and should be
+		// caught by singularity test above, but I've left it in just in case
+
+		this.x = ( m32 - m23 ) / s;
+		this.y = ( m13 - m31 ) / s;
+		this.z = ( m21 - m12 ) / s;
+		this.w = Math.acos( ( m11 + m22 + m33 - 1 ) / 2 );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the vector components to the position elements of the
+	 * given transformation matrix.
+	 *
+	 * @param {Matrix4} m - The 4x4 matrix.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	setFromMatrixPosition( m ) {
+
+		const e = m.elements;
+
+		this.x = e[ 12 ];
+		this.y = e[ 13 ];
+		this.z = e[ 14 ];
+		this.w = e[ 15 ];
+
+		return this;
+
+	}
+
+	/**
+	 * If this vector's x, y, z or w value is greater than the given vector's x, y, z or w
+	 * value, replace that value with the corresponding min value.
+	 *
+	 * @param {Vector4} v - The vector.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	min( v ) {
+
+		this.x = Math.min( this.x, v.x );
+		this.y = Math.min( this.y, v.y );
+		this.z = Math.min( this.z, v.z );
+		this.w = Math.min( this.w, v.w );
+
+		return this;
+
+	}
+
+	/**
+	 * If this vector's x, y, z or w value is less than the given vector's x, y, z or w
+	 * value, replace that value with the corresponding max value.
+	 *
+	 * @param {Vector4} v - The vector.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	max( v ) {
+
+		this.x = Math.max( this.x, v.x );
+		this.y = Math.max( this.y, v.y );
+		this.z = Math.max( this.z, v.z );
+		this.w = Math.max( this.w, v.w );
+
+		return this;
+
+	}
+
+	/**
+	 * If this vector's x, y, z or w value is greater than the max vector's x, y, z or w
+	 * value, it is replaced by the corresponding value.
+	 * If this vector's x, y, z or w value is less than the min vector's x, y, z or w value,
+	 * it is replaced by the corresponding value.
+	 *
+	 * @param {Vector4} min - The minimum x, y and z values.
+	 * @param {Vector4} max - The maximum x, y and z values in the desired range.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	clamp( min, max ) {
+
+		// assumes min < max, componentwise
+
+		this.x = clamp( this.x, min.x, max.x );
+		this.y = clamp( this.y, min.y, max.y );
+		this.z = clamp( this.z, min.z, max.z );
+		this.w = clamp( this.w, min.w, max.w );
+
+		return this;
+
+	}
+
+	/**
+	 * If this vector's x, y, z or w values are greater than the max value, they are
+	 * replaced by the max value.
+	 * If this vector's x, y, z or w values are less than the min value, they are
+	 * replaced by the min value.
+	 *
+	 * @param {number} minVal - The minimum value the components will be clamped to.
+	 * @param {number} maxVal - The maximum value the components will be clamped to.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	clampScalar( minVal, maxVal ) {
+
+		this.x = clamp( this.x, minVal, maxVal );
+		this.y = clamp( this.y, minVal, maxVal );
+		this.z = clamp( this.z, minVal, maxVal );
+		this.w = clamp( this.w, minVal, maxVal );
+
+		return this;
+
+	}
+
+	/**
+	 * If this vector's length is greater than the max value, it is replaced by
+	 * the max value.
+	 * If this vector's length is less than the min value, it is replaced by the
+	 * min value.
+	 *
+	 * @param {number} min - The minimum value the vector length will be clamped to.
+	 * @param {number} max - The maximum value the vector length will be clamped to.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	clampLength( min, max ) {
+
+		const length = this.length();
+
+		return this.divideScalar( length || 1 ).multiplyScalar( clamp( length, min, max ) );
+
+	}
+
+	/**
+	 * The components of this vector are rounded down to the nearest integer value.
+	 *
+	 * @return {Vector4} A reference to this vector.
+	 */
+	floor() {
+
+		this.x = Math.floor( this.x );
+		this.y = Math.floor( this.y );
+		this.z = Math.floor( this.z );
+		this.w = Math.floor( this.w );
+
+		return this;
+
+	}
+
+	/**
+	 * The components of this vector are rounded up to the nearest integer value.
+	 *
+	 * @return {Vector4} A reference to this vector.
+	 */
+	ceil() {
+
+		this.x = Math.ceil( this.x );
+		this.y = Math.ceil( this.y );
+		this.z = Math.ceil( this.z );
+		this.w = Math.ceil( this.w );
+
+		return this;
+
+	}
+
+	/**
+	 * The components of this vector are rounded to the nearest integer value
+	 *
+	 * @return {Vector4} A reference to this vector.
+	 */
+	round() {
+
+		this.x = Math.round( this.x );
+		this.y = Math.round( this.y );
+		this.z = Math.round( this.z );
+		this.w = Math.round( this.w );
+
+		return this;
+
+	}
+
+	/**
+	 * The components of this vector are rounded towards zero (up if negative,
+	 * down if positive) to an integer value.
+	 *
+	 * @return {Vector4} A reference to this vector.
+	 */
+	roundToZero() {
+
+		this.x = Math.trunc( this.x );
+		this.y = Math.trunc( this.y );
+		this.z = Math.trunc( this.z );
+		this.w = Math.trunc( this.w );
+
+		return this;
+
+	}
+
+	/**
+	 * Inverts this vector - i.e. sets x = -x, y = -y, z = -z, w = -w.
+	 *
+	 * @return {Vector4} A reference to this vector.
+	 */
+	negate() {
+
+		this.x = - this.x;
+		this.y = - this.y;
+		this.z = - this.z;
+		this.w = - this.w;
+
+		return this;
+
+	}
+
+	/**
+	 * Calculates the dot product of the given vector with this instance.
+	 *
+	 * @param {Vector4} v - The vector to compute the dot product with.
+	 * @return {number} The result of the dot product.
+	 */
+	dot( v ) {
+
+		return this.x * v.x + this.y * v.y + this.z * v.z + this.w * v.w;
+
+	}
+
+	/**
+	 * Computes the square of the Euclidean length (straight-line length) from
+	 * (0, 0, 0, 0) to (x, y, z, w). If you are comparing the lengths of vectors, you should
+	 * compare the length squared instead as it is slightly more efficient to calculate.
+	 *
+	 * @return {number} The square length of this vector.
+	 */
+	lengthSq() {
+
+		return this.x * this.x + this.y * this.y + this.z * this.z + this.w * this.w;
+
+	}
+
+	/**
+	 * Computes the  Euclidean length (straight-line length) from (0, 0, 0, 0) to (x, y, z, w).
+	 *
+	 * @return {number} The length of this vector.
+	 */
+	length() {
+
+		return Math.sqrt( this.x * this.x + this.y * this.y + this.z * this.z + this.w * this.w );
+
+	}
+
+	/**
+	 * Computes the Manhattan length of this vector.
+	 *
+	 * @return {number} The length of this vector.
+	 */
+	manhattanLength() {
+
+		return Math.abs( this.x ) + Math.abs( this.y ) + Math.abs( this.z ) + Math.abs( this.w );
+
+	}
+
+	/**
+	 * Converts this vector to a unit vector - that is, sets it equal to a vector
+	 * with the same direction as this one, but with a vector length of `1`.
+	 *
+	 * @return {Vector4} A reference to this vector.
+	 */
+	normalize() {
+
+		return this.divideScalar( this.length() || 1 );
+
+	}
+
+	/**
+	 * Sets this vector to a vector with the same direction as this one, but
+	 * with the specified length.
+	 *
+	 * @param {number} length - The new length of this vector.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	setLength( length ) {
+
+		return this.normalize().multiplyScalar( length );
+
+	}
+
+	/**
+	 * Linearly interpolates between the given vector and this instance, where
+	 * alpha is the percent distance along the line - alpha = 0 will be this
+	 * vector, and alpha = 1 will be the given one.
+	 *
+	 * @param {Vector4} v - The vector to interpolate towards.
+	 * @param {number} alpha - The interpolation factor, typically in the closed interval `[0, 1]`.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	lerp( v, alpha ) {
+
+		this.x += ( v.x - this.x ) * alpha;
+		this.y += ( v.y - this.y ) * alpha;
+		this.z += ( v.z - this.z ) * alpha;
+		this.w += ( v.w - this.w ) * alpha;
+
+		return this;
+
+	}
+
+	/**
+	 * Linearly interpolates between the given vectors, where alpha is the percent
+	 * distance along the line - alpha = 0 will be first vector, and alpha = 1 will
+	 * be the second one. The result is stored in this instance.
+	 *
+	 * @param {Vector4} v1 - The first vector.
+	 * @param {Vector4} v2 - The second vector.
+	 * @param {number} alpha - The interpolation factor, typically in the closed interval `[0, 1]`.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	lerpVectors( v1, v2, alpha ) {
+
+		this.x = v1.x + ( v2.x - v1.x ) * alpha;
+		this.y = v1.y + ( v2.y - v1.y ) * alpha;
+		this.z = v1.z + ( v2.z - v1.z ) * alpha;
+		this.w = v1.w + ( v2.w - v1.w ) * alpha;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this vector is equal with the given one.
+	 *
+	 * @param {Vector4} v - The vector to test for equality.
+	 * @return {boolean} Whether this vector is equal with the given one.
+	 */
+	equals( v ) {
+
+		return ( ( v.x === this.x ) && ( v.y === this.y ) && ( v.z === this.z ) && ( v.w === this.w ) );
+
+	}
+
+	/**
+	 * Sets this vector's x value to be `array[ offset ]`, y value to be `array[ offset + 1 ]`,
+	 * z value to be `array[ offset + 2 ]`, w value to be `array[ offset + 3 ]`.
+	 *
+	 * @param {Array<number>} array - An array holding the vector component values.
+	 * @param {number} [offset=0] - The offset into the array.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	fromArray( array, offset = 0 ) {
+
+		this.x = array[ offset ];
+		this.y = array[ offset + 1 ];
+		this.z = array[ offset + 2 ];
+		this.w = array[ offset + 3 ];
+
+		return this;
+
+	}
+
+	/**
+	 * Writes the components of this vector to the given array. If no array is provided,
+	 * the method returns a new instance.
+	 *
+	 * @param {Array<number>} [array=[]] - The target array holding the vector components.
+	 * @param {number} [offset=0] - Index of the first element in the array.
+	 * @return {Array<number>} The vector components.
+	 */
+	toArray( array = [], offset = 0 ) {
+
+		array[ offset ] = this.x;
+		array[ offset + 1 ] = this.y;
+		array[ offset + 2 ] = this.z;
+		array[ offset + 3 ] = this.w;
+
+		return array;
+
+	}
+
+	/**
+	 * Sets the components of this vector from the given buffer attribute.
+	 *
+	 * @param {BufferAttribute} attribute - The buffer attribute holding vector data.
+	 * @param {number} index - The index into the attribute.
+	 * @return {Vector4} A reference to this vector.
+	 */
+	fromBufferAttribute( attribute, index ) {
+
+		this.x = attribute.getX( index );
+		this.y = attribute.getY( index );
+		this.z = attribute.getZ( index );
+		this.w = attribute.getW( index );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets each component of this vector to a pseudo-random value between `0` and
+	 * `1`, excluding `1`.
+	 *
+	 * @return {Vector4} A reference to this vector.
+	 */
+	random() {
+
+		this.x = Math.random();
+		this.y = Math.random();
+		this.z = Math.random();
+		this.w = Math.random();
+
+		return this;
+
+	}
+
+	*[ Symbol.iterator ]() {
+
+		yield this.x;
+		yield this.y;
+		yield this.z;
+		yield this.w;
+
+	}
+
+}
+
+/**
+ * A render target is a buffer where the video card draws pixels for a scene
+ * that is being rendered in the background. It is used in different effects,
+ * such as applying postprocessing to a rendered image before displaying it
+ * on the screen.
+ *
+ * @augments EventDispatcher
+ */
+class RenderTarget extends EventDispatcher {
+
+	/**
+	 * Render target options.
+	 *
+	 * @typedef {Object} RenderTarget~Options
+	 * @property {boolean} [generateMipmaps=false] - Whether to generate mipmaps or not.
+	 * @property {number} [magFilter=LinearFilter] - The mag filter.
+	 * @property {number} [minFilter=LinearFilter] - The min filter.
+	 * @property {number} [format=RGBAFormat] - The texture format.
+	 * @property {number} [type=UnsignedByteType] - The texture type.
+	 * @property {?string} [internalFormat=null] - The texture's internal format.
+	 * @property {number} [wrapS=ClampToEdgeWrapping] - The texture's uv wrapping mode.
+	 * @property {number} [wrapT=ClampToEdgeWrapping] - The texture's uv wrapping mode.
+	 * @property {number} [anisotropy=1] - The texture's anisotropy value.
+	 * @property {string} [colorSpace=NoColorSpace] - The texture's color space.
+	 * @property {boolean} [depthBuffer=true] - Whether to allocate a depth buffer or not.
+	 * @property {boolean} [stencilBuffer=false] - Whether to allocate a stencil buffer or not.
+	 * @property {boolean} [resolveColorBuffer=true] - Whether to resolve the color buffer or not. Only relevant for multisampled render targets.
+	 * @property {boolean} [resolveDepthBuffer=true] - Whether to resolve the depth buffer or not. Only relevant for multisampled render targets.
+	 * @property {boolean} [resolveStencilBuffer=true] - Whether to resolve the stencil buffer or not. Only relevant for multisampled render targets.
+	 * @property {boolean} [storeMultisampledColorBuffer=true] - Whether to store the multisampled color buffer or not. Setting to `false` saves memory bandwidth when the multisampled data are not needed after a render pass.
+	 * @property {boolean} [storeMultisampledDepthBuffer=true] - Whether to store the multisampled depth buffer or not. Setting to `false` saves memory bandwidth when the multisampled data are not needed after a render pass.
+	 * @property {boolean} [storeMultisampledStencilBuffer=true] - Whether to store the multisampled stencil buffer or not. Setting to `false` saves memory bandwidth when the multisampled data are not needed after a render pass.
+	 * @property {?Texture} [depthTexture=null] - Reference to a depth texture.
+	 * @property {number} [samples=0] - The MSAA samples count.
+	 * @property {number} [count=1] - Defines the number of color attachments . Must be at least `1`.
+	 * @property {number} [depth=1] - The texture depth.
+	 * @property {boolean} [multiview=false] - Whether this target is used for multiview rendering (WebGL OVR_multiview2 extension).
+	 * @property {boolean} [useArrayDepthTexture=false] - Whether to create the depth texture as an array texture for per-layer depth testing. This is separate from multiview so layered render targets can use array depth without the multiview extension.
+	 */
+
+	/**
+	 * Constructs a new render target.
+	 *
+	 * @param {number} [width=1] - The width of the render target.
+	 * @param {number} [height=1] - The height of the render target.
+	 * @param {RenderTarget~Options} [options] - The configuration object.
+	 */
+	constructor( width = 1, height = 1, options = {} ) {
+
+		super();
+
+		options = Object.assign( {
+			generateMipmaps: false,
+			internalFormat: null,
+			minFilter: LinearFilter,
+			depthBuffer: true,
+			stencilBuffer: false,
+			resolveColorBuffer: true,
+			resolveDepthBuffer: true,
+			resolveStencilBuffer: true,
+			storeMultisampledColorBuffer: true,
+			storeMultisampledDepthBuffer: true,
+			storeMultisampledStencilBuffer: true,
+			depthTexture: null,
+			samples: 0,
+			count: 1,
+			depth: 1,
+			multiview: false,
+			useArrayDepthTexture: false
+		}, options );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isRenderTarget = true;
+
+		/**
+		 * The width of the render target.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.width = width;
+
+		/**
+		 * The height of the render target.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.height = height;
+
+		/**
+		 * The depth of the render target.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.depth = options.depth;
+
+		/**
+		 * A rectangular area inside the render target's viewport. Fragments that are
+		 * outside the area will be discarded.
+		 *
+		 * @type {Vector4}
+		 * @default (0,0,width,height)
+		 */
+		this.scissor = new Vector4( 0, 0, width, height );
+
+		/**
+		 * Indicates whether the scissor test should be enabled when rendering into
+		 * this render target or not.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.scissorTest = false;
+
+		/**
+		 * A rectangular area representing the render target's viewport.
+		 *
+		 * @type {Vector4}
+		 * @default (0,0,width,height)
+		 */
+		this.viewport = new Vector4( 0, 0, width, height );
+
+		/**
+		 * An array of textures. Each color attachment is represented as a separate texture.
+		 * Has at least a single entry for the default color attachment.
+		 *
+		 * @type {Array<Texture>}
+		 */
+		this.textures = [];
+
+		const image = { width: width, height: height, depth: options.depth };
+		const texture = new Texture( image );
+
+		const count = options.count;
+		for ( let i = 0; i < count; i ++ ) {
+
+			this.textures[ i ] = texture.clone();
+			this.textures[ i ].isRenderTargetTexture = true;
+			this.textures[ i ].renderTarget = this;
+
+		}
+
+		this._setTextureOptions( options );
+
+		/**
+		 * Whether to allocate a depth buffer or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.depthBuffer = options.depthBuffer;
+
+		/**
+		 * Whether to allocate a stencil buffer or not.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.stencilBuffer = options.stencilBuffer;
+
+		/**
+		 * Whether to resolve the color buffer or not. When set to `false`, the color
+		 * attachments do not receive the resolved (single-sampled) output of a render
+		 * pass and the render target's textures are left untouched. The rendered
+		 * content is then only accessible within the render pass itself.
+		 *
+		 * Only relevant for multisampled render targets.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.resolveColorBuffer = options.resolveColorBuffer;
+
+		/**
+		 * Whether to resolve the depth buffer or not. When set to `false`, the depth
+		 * texture does not receive the resolved depth output of a render pass which
+		 * saves memory bandwidth. Use this setting when the depth data of a render
+		 * pass are not required afterwards.
+		 *
+		 * Only relevant for multisampled render targets in WebGL. WebGPU does not
+		 * support depth resolves; sampling the depth texture of a multisampled render
+		 * target accesses the multisampled data directly, see
+		 * {@link RenderTarget#storeMultisampledDepthBuffer}.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.resolveDepthBuffer = options.resolveDepthBuffer;
+
+		/**
+		 * Whether to resolve the stencil buffer or not. Analogous to
+		 * {@link RenderTarget#resolveDepthBuffer} but for the stencil aspect.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.resolveStencilBuffer = options.resolveStencilBuffer;
+
+		/**
+		 * Whether to store the multisampled color buffer or not. When set to `false`,
+		 * the multisampled data are discarded at the end of a render pass, right after
+		 * they have been resolved. This saves memory bandwidth, especially on tile-based
+		 * GPUs, and is the recommended setting for render targets that are fully redrawn
+		 * each frame and whose output is only accessed via the resolved textures (e.g.
+		 * scene passes in post-processing chains).
+		 *
+		 * Must be kept `true` when the multisampled data are needed after the render
+		 * pass ends, e.g. when rendering into the target without clearing or when the
+		 * scene contains transmissive objects which require a mid-pass framebuffer copy.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.storeMultisampledColorBuffer = options.storeMultisampledColorBuffer;
+
+		/**
+		 * Whether to store the multisampled depth buffer or not. When set to `false`,
+		 * the multisampled depth data are discarded at the end of a render pass which
+		 * saves memory bandwidth.
+		 *
+		 * Must be kept `true` in WebGPU when the depth texture of a multisampled render
+		 * target is sampled (e.g. by depth-based post-processing effects) since depth
+		 * is read directly from the multisampled data.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.storeMultisampledDepthBuffer = options.storeMultisampledDepthBuffer;
+
+		/**
+		 * Whether to store the multisampled stencil buffer or not. Analogous to
+		 * {@link RenderTarget#storeMultisampledDepthBuffer} but for the stencil aspect.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.storeMultisampledStencilBuffer = options.storeMultisampledStencilBuffer;
+
+		this._depthTexture = null;
+		this.depthTexture = options.depthTexture;
+
+		/**
+		 * The number of MSAA samples.
+		 *
+		 * A value of `0` disables MSAA.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.samples = options.samples;
+
+		/**
+		 * Whether to this target is used in multiview rendering.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.multiview = options.multiview;
+
+		/**
+		 * Whether to create the depth texture as an array texture for per-layer depth testing.
+		 * This is separate from multiview so layered render targets can use array depth without
+		 * the multiview extension.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.useArrayDepthTexture = options.useArrayDepthTexture;
+
+	}
+
+	_setTextureOptions( options = {} ) {
+
+		const values = {
+			minFilter: LinearFilter,
+			generateMipmaps: false,
+			flipY: false,
+			internalFormat: null
+		};
+
+		if ( options.mapping !== undefined ) values.mapping = options.mapping;
+		if ( options.wrapS !== undefined ) values.wrapS = options.wrapS;
+		if ( options.wrapT !== undefined ) values.wrapT = options.wrapT;
+		if ( options.wrapR !== undefined ) values.wrapR = options.wrapR;
+		if ( options.magFilter !== undefined ) values.magFilter = options.magFilter;
+		if ( options.minFilter !== undefined ) values.minFilter = options.minFilter;
+		if ( options.format !== undefined ) values.format = options.format;
+		if ( options.type !== undefined ) values.type = options.type;
+		if ( options.anisotropy !== undefined ) values.anisotropy = options.anisotropy;
+		if ( options.colorSpace !== undefined ) values.colorSpace = options.colorSpace;
+		if ( options.flipY !== undefined ) values.flipY = options.flipY;
+		if ( options.generateMipmaps !== undefined ) values.generateMipmaps = options.generateMipmaps;
+		if ( options.internalFormat !== undefined ) values.internalFormat = options.internalFormat;
+
+		for ( let i = 0; i < this.textures.length; i ++ ) {
+
+			const texture = this.textures[ i ];
+			texture.setValues( values );
+
+		}
+
+	}
+
+	/**
+	 * The texture representing the default color attachment.
+	 *
+	 * @type {Texture}
+	 */
+	get texture() {
+
+		return this.textures[ 0 ];
+
+	}
+
+	set texture( value ) {
+
+		this.textures[ 0 ] = value;
+
+	}
+
+	set depthTexture( current ) {
+
+		if ( this._depthTexture !== null && this._depthTexture.renderTarget === this ) this._depthTexture.renderTarget = null;
+		if ( current !== null && current.renderTarget === null ) current.renderTarget = this;
+
+		this._depthTexture = current;
+
+	}
+
+	/**
+	 * Instead of saving the depth in a renderbuffer, a texture
+	 * can be used instead which is useful for further processing
+	 * e.g. in context of post-processing.
+	 *
+	 * @type {?DepthTexture}
+	 * @default null
+	 */
+	get depthTexture() {
+
+		return this._depthTexture;
+
+	}
+
+	/**
+	 * Sets the size of this render target.
+	 *
+	 * @param {number} width - The width.
+	 * @param {number} height - The height.
+	 * @param {number} [depth=1] - The depth.
+	 */
+	setSize( width, height, depth = 1 ) {
+
+		if ( this.width !== width || this.height !== height || this.depth !== depth ) {
+
+			this.width = width;
+			this.height = height;
+			this.depth = depth;
+
+			for ( let i = 0, il = this.textures.length; i < il; i ++ ) {
+
+				this.textures[ i ].image.width = width;
+				this.textures[ i ].image.height = height;
+				this.textures[ i ].image.depth = depth;
+
+				if ( this.textures[ i ].isData3DTexture !== true ) { // Fix for #31693
+
+					// TODO: Reconsider setting isArrayTexture flag here and in the ctor of Texture.
+					// Maybe a method `isArrayTexture()` or just a getter could replace a flag since
+					// both are evaluated on each call?
+
+					this.textures[ i ].isArrayTexture = this.textures[ i ].image.depth > 1;
+
+				}
+
+			}
+
+			this.dispose();
+
+		}
+
+		this.viewport.set( 0, 0, width, height );
+		this.scissor.set( 0, 0, width, height );
+
+	}
+
+	/**
+	 * Returns a new render target with copied values from this instance.
+	 *
+	 * @return {RenderTarget} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+	/**
+	 * Copies the settings of the given render target. This is a structural copy so
+	 * no resources are shared between render targets after the copy. That includes
+	 * all MRT textures and the depth texture.
+	 *
+	 * @param {RenderTarget} source - The render target to copy.
+	 * @return {RenderTarget} A reference to this instance.
+	 */
+	copy( source ) {
+
+		this.width = source.width;
+		this.height = source.height;
+		this.depth = source.depth;
+
+		this.scissor.copy( source.scissor );
+		this.scissorTest = source.scissorTest;
+
+		this.viewport.copy( source.viewport );
+
+		this.textures.length = 0;
+
+		for ( let i = 0, il = source.textures.length; i < il; i ++ ) {
+
+			this.textures[ i ] = source.textures[ i ].clone();
+			this.textures[ i ].isRenderTargetTexture = true;
+			this.textures[ i ].renderTarget = this;
+
+			// ensure image object is not shared, see #20328
+
+			const image = Object.assign( {}, source.textures[ i ].image );
+			this.textures[ i ].source = new TextureSource( image );
+
+		}
+
+		this.depthBuffer = source.depthBuffer;
+		this.stencilBuffer = source.stencilBuffer;
+
+		this.resolveColorBuffer = source.resolveColorBuffer;
+		this.resolveDepthBuffer = source.resolveDepthBuffer;
+		this.resolveStencilBuffer = source.resolveStencilBuffer;
+
+		this.storeMultisampledColorBuffer = source.storeMultisampledColorBuffer;
+		this.storeMultisampledDepthBuffer = source.storeMultisampledDepthBuffer;
+		this.storeMultisampledStencilBuffer = source.storeMultisampledStencilBuffer;
+
+		if ( source.depthTexture !== null ) {
+
+			if ( source.depthTexture.renderTarget === source ) {
+
+				const depthTexture = source.depthTexture.clone();
+				depthTexture.renderTarget = null;
+
+				this.depthTexture = depthTexture;
+
+			} else {
+
+				this.depthTexture = source.depthTexture;
+
+			}
+
+		}
+
+		this.samples = source.samples;
+		this.multiview = source.multiview;
+		this.useArrayDepthTexture = source.useArrayDepthTexture;
+
+		return this;
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 *
+	 * @fires RenderTarget#dispose
+	 */
+	dispose() {
+
+		this.dispatchEvent( { type: 'dispose' } );
+
+	}
+
+}
+
+/**
+ * A render target used in context of {@link WebGLRenderer}.
+ *
+ * @augments RenderTarget
+ */
+class WebGLRenderTarget extends RenderTarget {
+
+	/**
+	 * Constructs a new 3D render target.
+	 *
+	 * @param {number} [width=1] - The width of the render target.
+	 * @param {number} [height=1] - The height of the render target.
+	 * @param {RenderTarget~Options} [options] - The configuration object.
+	 */
+	constructor( width = 1, height = 1, options = {} ) {
+
+		super( width, height, options );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isWebGLRenderTarget = true;
+
+	}
+
+}
+
+/**
+ * Creates an array of textures directly from raw buffer data.
+ *
+ * @augments Texture
+ */
+class DataArrayTexture extends Texture {
+
+	/**
+	 * Constructs a new data array texture.
+	 *
+	 * @param {?TypedArray} [data=null] - The buffer data.
+	 * @param {number} [width=1] - The width of the texture.
+	 * @param {number} [height=1] - The height of the texture.
+	 * @param {number} [depth=1] - The depth of the texture.
+	 */
+	constructor( data = null, width = 1, height = 1, depth = 1 ) {
+
+		super( null );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isDataArrayTexture = true;
+
+		/**
+		 * The image definition of a data texture.
+		 *
+		 * @type {{data:TypedArray,width:number,height:number,depth:number}}
+		 */
+		this.image = { data, width, height, depth };
+
+		/**
+		 * How the texture is sampled when a texel covers more than one pixel.
+		 *
+		 * Overwritten and set to `NearestFilter` by default.
+		 *
+		 * @type {(NearestFilter|NearestMipmapNearestFilter|NearestMipmapLinearFilter|LinearFilter|LinearMipmapNearestFilter|LinearMipmapLinearFilter)}
+		 * @default NearestFilter
+		 */
+		this.magFilter = NearestFilter;
+
+		/**
+		 * How the texture is sampled when a texel covers less than one pixel.
+		 *
+		 * Overwritten and set to `NearestFilter` by default.
+		 *
+		 * @type {(NearestFilter|NearestMipmapNearestFilter|NearestMipmapLinearFilter|LinearFilter|LinearMipmapNearestFilter|LinearMipmapLinearFilter)}
+		 * @default NearestFilter
+		 */
+		this.minFilter = NearestFilter;
+
+		/**
+		 * This defines how the texture is wrapped in the depth and corresponds to
+		 * *W* in UVW mapping.
+		 *
+		 * @type {(RepeatWrapping|ClampToEdgeWrapping|MirroredRepeatWrapping)}
+		 * @default ClampToEdgeWrapping
+		 */
+		this.wrapR = ClampToEdgeWrapping;
+
+		/**
+		 * Whether to generate mipmaps (if possible) for a texture.
+		 *
+		 * Overwritten and set to `false` by default.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.generateMipmaps = false;
+
+		/**
+		 * If set to `true`, the texture is flipped along the vertical axis when
+		 * uploaded to the GPU.
+		 *
+		 * Overwritten and set to `false` by default.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.flipY = false;
+
+		/**
+		 * Specifies the alignment requirements for the start of each pixel row in memory.
+		 *
+		 * Overwritten and set to `1` by default.
+		 *
+		 * @type {boolean}
+		 * @default 1
+		 */
+		this.unpackAlignment = 1;
+
+		/**
+		 * A set of all layers which need to be updated in the texture.
+		 *
+		 * @type {Set<number>}
+		 */
+		this.layerUpdates = new Set();
+
+	}
+
+	/**
+	 * Copies the values of the given texture to this instance.
+	 *
+	 * @param {DataArrayTexture} source - The texture to copy.
+	 * @return {DataArrayTexture} A reference to this instance.
+	 */
+	copy( source ) {
+
+		super.copy( source );
+
+		this.wrapR = source.wrapR;
+
+		return this;
+
+	}
+
+	/**
+	 * Describes that a specific layer of the texture needs to be updated.
+	 * Normally when {@link Texture#needsUpdate} is set to `true`, the
+	 * entire data texture array is sent to the GPU. Marking specific
+	 * layers will only transmit subsets of all mipmaps associated with a
+	 * specific depth in the array which is often much more performant.
+	 *
+	 * @param {number} layerIndex - The layer index that should be updated.
+	 */
+	addLayerUpdate( layerIndex ) {
+
+		this.layerUpdates.add( layerIndex );
+
+	}
+
+	/**
+	 * Resets the layer updates registry.
+	 */
+	clearLayerUpdates() {
+
+		this.layerUpdates.clear();
+
+	}
+
+}
+
+/**
+ * An array render target used in context of {@link WebGLRenderer}.
+ *
+ * @augments WebGLRenderTarget
+ */
+class WebGLArrayRenderTarget extends WebGLRenderTarget {
+
+	/**
+	 * Constructs a new array render target.
+	 *
+	 * @param {number} [width=1] - The width of the render target.
+	 * @param {number} [height=1] - The height of the render target.
+	 * @param {number} [depth=1] - The height of the render target.
+	 * @param {RenderTarget~Options} [options] - The configuration object.
+	 */
+	constructor( width = 1, height = 1, depth = 1, options = {} ) {
+
+		super( width, height, options );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isWebGLArrayRenderTarget = true;
+
+		this.depth = depth;
+
+		/**
+		 * Overwritten with a different texture type.
+		 *
+		 * @type {DataArrayTexture}
+		 */
+		this.texture = new DataArrayTexture( null, width, height, depth );
+		this._setTextureOptions( options );
+
+		this.texture.isRenderTargetTexture = true;
+
+	}
+
+}
+
+/**
+ * Creates a three-dimensional texture from raw data, with parameters to
+ * divide it into width, height, and depth.
+ *
+ * @augments Texture
+ */
+class Data3DTexture extends Texture {
+
+	/**
+	 * Constructs a new data array texture.
+	 *
+	 * @param {?TypedArray} [data=null] - The buffer data.
+	 * @param {number} [width=1] - The width of the texture.
+	 * @param {number} [height=1] - The height of the texture.
+	 * @param {number} [depth=1] - The depth of the texture.
+	 */
+	constructor( data = null, width = 1, height = 1, depth = 1 ) {
+
+		// We're going to add .setXXX() methods for setting properties later.
+		// Users can still set in Data3DTexture directly.
+		//
+		//	const texture = new THREE.Data3DTexture( data, width, height, depth );
+		// 	texture.anisotropy = 16;
+		//
+		// See #14839
+
+		super( null );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isData3DTexture = true;
+
+		/**
+		 * The image definition of a data texture.
+		 *
+		 * @type {{data:TypedArray,width:number,height:number,depth:number}}
+		 */
+		this.image = { data, width, height, depth };
+
+		/**
+		 * How the texture is sampled when a texel covers more than one pixel.
+		 *
+		 * Overwritten and set to `NearestFilter` by default.
+		 *
+		 * @type {(NearestFilter|NearestMipmapNearestFilter|NearestMipmapLinearFilter|LinearFilter|LinearMipmapNearestFilter|LinearMipmapLinearFilter)}
+		 * @default NearestFilter
+		 */
+		this.magFilter = NearestFilter;
+
+		/**
+		 * How the texture is sampled when a texel covers less than one pixel.
+		 *
+		 * Overwritten and set to `NearestFilter` by default.
+		 *
+		 * @type {(NearestFilter|NearestMipmapNearestFilter|NearestMipmapLinearFilter|LinearFilter|LinearMipmapNearestFilter|LinearMipmapLinearFilter)}
+		 * @default NearestFilter
+		 */
+		this.minFilter = NearestFilter;
+
+		/**
+		 * This defines how the texture is wrapped in the depth and corresponds to
+		 * *W* in UVW mapping.
+		 *
+		 * @type {(RepeatWrapping|ClampToEdgeWrapping|MirroredRepeatWrapping)}
+		 * @default ClampToEdgeWrapping
+		 */
+		this.wrapR = ClampToEdgeWrapping;
+
+		/**
+		 * Whether to generate mipmaps (if possible) for a texture.
+		 *
+		 * Overwritten and set to `false` by default.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.generateMipmaps = false;
+
+		/**
+		 * If set to `true`, the texture is flipped along the vertical axis when
+		 * uploaded to the GPU.
+		 *
+		 * Overwritten and set to `false` by default.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.flipY = false;
+
+		/**
+		 * Specifies the alignment requirements for the start of each pixel row in memory.
+		 *
+		 * Overwritten and set to `1` by default.
+		 *
+		 * @type {boolean}
+		 * @default 1
+		 */
+		this.unpackAlignment = 1;
+
+	}
+
+	/**
+	 * Copies the values of the given texture to this instance.
+	 *
+	 * @param {Data3DTexture} source - The texture to copy.
+	 * @return {Data3DTexture} A reference to this instance.
+	 */
+	copy( source ) {
+
+		super.copy( source );
+
+		this.wrapR = source.wrapR;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A 3D render target used in context of {@link WebGLRenderer}.
+ *
+ * @augments WebGLRenderTarget
+ */
+class WebGL3DRenderTarget extends WebGLRenderTarget {
+
+	/**
+	 * Constructs a new 3D render target.
+	 *
+	 * @param {number} [width=1] - The width of the render target.
+	 * @param {number} [height=1] - The height of the render target.
+	 * @param {number} [depth=1] - The height of the render target.
+	 * @param {RenderTarget~Options} [options] - The configuration object.
+	 */
+	constructor( width = 1, height = 1, depth = 1, options = {} ) {
+
+		super( width, height, options );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isWebGL3DRenderTarget = true;
+
+		this.depth = depth;
+
+		/**
+		 * Overwritten with a different texture type.
+		 *
+		 * @type {Data3DTexture}
+		 */
+		this.texture = new Data3DTexture( null, width, height, depth );
+		this._setTextureOptions( options );
+
+		this.texture.isRenderTargetTexture = true;
+
+	}
+
+}
+
+/**
+ * Represents a 4x4 matrix.
+ *
+ * The most common use of a 4x4 matrix in 3D computer graphics is as a transformation matrix.
+ * For an introduction to transformation matrices as used in WebGL, check out [this tutorial](https://www.opengl-tutorial.org/beginners-tutorials/tutorial-3-matrices)
+ *
+ * This allows a 3D vector representing a point in 3D space to undergo
+ * transformations such as translation, rotation, shear, scale, reflection,
+ * orthogonal or perspective projection and so on, by being multiplied by the
+ * matrix. This is known as `applying` the matrix to the vector.
+ *
+ * A Note on Row-Major and Column-Major Ordering:
+ *
+ * The constructor and {@link Matrix3#set} method take arguments in
+ * [row-major](https://en.wikipedia.org/wiki/Row-_and_column-major_order#Column-major_order)
+ * order, while internally they are stored in the {@link Matrix3#elements} array in column-major order.
+ * This means that calling:
+ * ```js
+ * const m = new THREE.Matrix4();
+ * m.set( 11, 12, 13, 14,
+ *        21, 22, 23, 24,
+ *        31, 32, 33, 34,
+ *        41, 42, 43, 44 );
+ * ```
+ * will result in the elements array containing:
+ * ```js
+ * m.elements = [ 11, 21, 31, 41,
+ *                12, 22, 32, 42,
+ *                13, 23, 33, 43,
+ *                14, 24, 34, 44 ];
+ * ```
+ * and internally all calculations are performed using column-major ordering.
+ * However, as the actual ordering makes no difference mathematically and
+ * most people are used to thinking about matrices in row-major order, the
+ * three.js documentation shows matrices in row-major order. Just bear in
+ * mind that if you are reading the source code, you'll have to take the
+ * transpose of any matrices outlined here to make sense of the calculations.
+ */
+class Matrix4 {
+
+	static {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		Matrix4.prototype.isMatrix4 = true;
+
+	}
+
+	/**
+	 * Constructs a new 4x4 matrix. The arguments are supposed to be
+	 * in row-major order. If no arguments are provided, the constructor
+	 * initializes the matrix as an identity matrix.
+	 *
+	 * @param {number} [n11] - 1-1 matrix element.
+	 * @param {number} [n12] - 1-2 matrix element.
+	 * @param {number} [n13] - 1-3 matrix element.
+	 * @param {number} [n14] - 1-4 matrix element.
+	 * @param {number} [n21] - 2-1 matrix element.
+	 * @param {number} [n22] - 2-2 matrix element.
+	 * @param {number} [n23] - 2-3 matrix element.
+	 * @param {number} [n24] - 2-4 matrix element.
+	 * @param {number} [n31] - 3-1 matrix element.
+	 * @param {number} [n32] - 3-2 matrix element.
+	 * @param {number} [n33] - 3-3 matrix element.
+	 * @param {number} [n34] - 3-4 matrix element.
+	 * @param {number} [n41] - 4-1 matrix element.
+	 * @param {number} [n42] - 4-2 matrix element.
+	 * @param {number} [n43] - 4-3 matrix element.
+	 * @param {number} [n44] - 4-4 matrix element.
+	 */
+	constructor( n11, n12, n13, n14, n21, n22, n23, n24, n31, n32, n33, n34, n41, n42, n43, n44 ) {
+
+		/**
+		 * A column-major list of matrix values.
+		 *
+		 * @type {Array<number>}
+		 */
+		this.elements = [
+
+			1, 0, 0, 0,
+			0, 1, 0, 0,
+			0, 0, 1, 0,
+			0, 0, 0, 1
+
+		];
+
+		if ( n11 !== undefined ) {
+
+			this.set( n11, n12, n13, n14, n21, n22, n23, n24, n31, n32, n33, n34, n41, n42, n43, n44 );
+
+		}
+
+	}
+
+	/**
+	 * Sets the elements of the matrix.The arguments are supposed to be
+	 * in row-major order.
+	 *
+	 * @param {number} [n11] - 1-1 matrix element.
+	 * @param {number} [n12] - 1-2 matrix element.
+	 * @param {number} [n13] - 1-3 matrix element.
+	 * @param {number} [n14] - 1-4 matrix element.
+	 * @param {number} [n21] - 2-1 matrix element.
+	 * @param {number} [n22] - 2-2 matrix element.
+	 * @param {number} [n23] - 2-3 matrix element.
+	 * @param {number} [n24] - 2-4 matrix element.
+	 * @param {number} [n31] - 3-1 matrix element.
+	 * @param {number} [n32] - 3-2 matrix element.
+	 * @param {number} [n33] - 3-3 matrix element.
+	 * @param {number} [n34] - 3-4 matrix element.
+	 * @param {number} [n41] - 4-1 matrix element.
+	 * @param {number} [n42] - 4-2 matrix element.
+	 * @param {number} [n43] - 4-3 matrix element.
+	 * @param {number} [n44] - 4-4 matrix element.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	set( n11, n12, n13, n14, n21, n22, n23, n24, n31, n32, n33, n34, n41, n42, n43, n44 ) {
+
+		const te = this.elements;
+
+		te[ 0 ] = n11; te[ 4 ] = n12; te[ 8 ] = n13; te[ 12 ] = n14;
+		te[ 1 ] = n21; te[ 5 ] = n22; te[ 9 ] = n23; te[ 13 ] = n24;
+		te[ 2 ] = n31; te[ 6 ] = n32; te[ 10 ] = n33; te[ 14 ] = n34;
+		te[ 3 ] = n41; te[ 7 ] = n42; te[ 11 ] = n43; te[ 15 ] = n44;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this matrix to the 4x4 identity matrix.
+	 *
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	identity() {
+
+		this.set(
+
+			1, 0, 0, 0,
+			0, 1, 0, 0,
+			0, 0, 1, 0,
+			0, 0, 0, 1
+
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a matrix with copied values from this instance.
+	 *
+	 * @return {Matrix4} A clone of this instance.
+	 */
+	clone() {
+
+		return new Matrix4().fromArray( this.elements );
+
+	}
+
+	/**
+	 * Copies the values of the given matrix to this instance.
+	 *
+	 * @param {Matrix4} m - The matrix to copy.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	copy( m ) {
+
+		const te = this.elements;
+		const me = m.elements;
+
+		te[ 0 ] = me[ 0 ]; te[ 1 ] = me[ 1 ]; te[ 2 ] = me[ 2 ]; te[ 3 ] = me[ 3 ];
+		te[ 4 ] = me[ 4 ]; te[ 5 ] = me[ 5 ]; te[ 6 ] = me[ 6 ]; te[ 7 ] = me[ 7 ];
+		te[ 8 ] = me[ 8 ]; te[ 9 ] = me[ 9 ]; te[ 10 ] = me[ 10 ]; te[ 11 ] = me[ 11 ];
+		te[ 12 ] = me[ 12 ]; te[ 13 ] = me[ 13 ]; te[ 14 ] = me[ 14 ]; te[ 15 ] = me[ 15 ];
+
+		return this;
+
+	}
+
+	/**
+	 * Copies the translation component of the given matrix
+	 * into this matrix's translation component.
+	 *
+	 * @param {Matrix4} m - The matrix to copy the translation component.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	copyPosition( m ) {
+
+		const te = this.elements, me = m.elements;
+
+		te[ 12 ] = me[ 12 ];
+		te[ 13 ] = me[ 13 ];
+		te[ 14 ] = me[ 14 ];
+
+		return this;
+
+	}
+
+	/**
+	 * Set the upper 3x3 elements of this matrix to the values of given 3x3 matrix.
+	 *
+	 * @param {Matrix3} m - The 3x3 matrix.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	setFromMatrix3( m ) {
+
+		const me = m.elements;
+
+		this.set(
+
+			me[ 0 ], me[ 3 ], me[ 6 ], 0,
+			me[ 1 ], me[ 4 ], me[ 7 ], 0,
+			me[ 2 ], me[ 5 ], me[ 8 ], 0,
+			0, 0, 0, 1
+
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Extracts the basis vectors of this matrix into the three vectors provided.
+	 *
+	 * @param {Vector3} xAxis - The basis's x axis.
+	 * @param {Vector3} yAxis - The basis's y axis.
+	 * @param {Vector3} zAxis - The basis's z axis.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	extractBasis( xAxis, yAxis, zAxis ) {
+
+		if ( this.determinantAffine() === 0 ) {
+
+			xAxis.set( 1, 0, 0 );
+			yAxis.set( 0, 1, 0 );
+			zAxis.set( 0, 0, 1 );
+
+			return this;
+
+		}
+
+		xAxis.setFromMatrixColumn( this, 0 );
+		yAxis.setFromMatrixColumn( this, 1 );
+		zAxis.setFromMatrixColumn( this, 2 );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the given basis vectors to this matrix.
+	 *
+	 * @param {Vector3} xAxis - The basis's x axis.
+	 * @param {Vector3} yAxis - The basis's y axis.
+	 * @param {Vector3} zAxis - The basis's z axis.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	makeBasis( xAxis, yAxis, zAxis ) {
+
+		this.set(
+			xAxis.x, yAxis.x, zAxis.x, 0,
+			xAxis.y, yAxis.y, zAxis.y, 0,
+			xAxis.z, yAxis.z, zAxis.z, 0,
+			0, 0, 0, 1
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Extracts the rotation component of the given matrix
+	 * into this matrix's rotation component.
+	 *
+	 * Note: This method does not support reflection matrices.
+	 *
+	 * @param {Matrix4} m - The matrix.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	extractRotation( m ) {
+
+		if ( m.determinantAffine() === 0 ) {
+
+			return this.identity();
+
+		}
+
+		const te = this.elements;
+		const me = m.elements;
+
+		const scaleX = 1 / _v1$7.setFromMatrixColumn( m, 0 ).length();
+		const scaleY = 1 / _v1$7.setFromMatrixColumn( m, 1 ).length();
+		const scaleZ = 1 / _v1$7.setFromMatrixColumn( m, 2 ).length();
+
+		te[ 0 ] = me[ 0 ] * scaleX;
+		te[ 1 ] = me[ 1 ] * scaleX;
+		te[ 2 ] = me[ 2 ] * scaleX;
+		te[ 3 ] = 0;
+
+		te[ 4 ] = me[ 4 ] * scaleY;
+		te[ 5 ] = me[ 5 ] * scaleY;
+		te[ 6 ] = me[ 6 ] * scaleY;
+		te[ 7 ] = 0;
+
+		te[ 8 ] = me[ 8 ] * scaleZ;
+		te[ 9 ] = me[ 9 ] * scaleZ;
+		te[ 10 ] = me[ 10 ] * scaleZ;
+		te[ 11 ] = 0;
+
+		te[ 12 ] = 0;
+		te[ 13 ] = 0;
+		te[ 14 ] = 0;
+		te[ 15 ] = 1;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the rotation component (the upper left 3x3 matrix) of this matrix to
+	 * the rotation specified by the given Euler angles. The rest of
+	 * the matrix is set to the identity. Depending on the {@link Euler#order},
+	 * there are six possible outcomes. See [this page](https://en.wikipedia.org/wiki/Euler_angles#Rotation_matrix)
+	 * for a complete list.
+	 *
+	 * @param {Euler} euler - The Euler angles.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	makeRotationFromEuler( euler ) {
+
+		const te = this.elements;
+
+		const x = euler.x, y = euler.y, z = euler.z;
+		const a = Math.cos( x ), b = Math.sin( x );
+		const c = Math.cos( y ), d = Math.sin( y );
+		const e = Math.cos( z ), f = Math.sin( z );
+
+		if ( euler.order === 'XYZ' ) {
+
+			const ae = a * e, af = a * f, be = b * e, bf = b * f;
+
+			te[ 0 ] = c * e;
+			te[ 4 ] = - c * f;
+			te[ 8 ] = d;
+
+			te[ 1 ] = af + be * d;
+			te[ 5 ] = ae - bf * d;
+			te[ 9 ] = - b * c;
+
+			te[ 2 ] = bf - ae * d;
+			te[ 6 ] = be + af * d;
+			te[ 10 ] = a * c;
+
+		} else if ( euler.order === 'YXZ' ) {
+
+			const ce = c * e, cf = c * f, de = d * e, df = d * f;
+
+			te[ 0 ] = ce + df * b;
+			te[ 4 ] = de * b - cf;
+			te[ 8 ] = a * d;
+
+			te[ 1 ] = a * f;
+			te[ 5 ] = a * e;
+			te[ 9 ] = - b;
+
+			te[ 2 ] = cf * b - de;
+			te[ 6 ] = df + ce * b;
+			te[ 10 ] = a * c;
+
+		} else if ( euler.order === 'ZXY' ) {
+
+			const ce = c * e, cf = c * f, de = d * e, df = d * f;
+
+			te[ 0 ] = ce - df * b;
+			te[ 4 ] = - a * f;
+			te[ 8 ] = de + cf * b;
+
+			te[ 1 ] = cf + de * b;
+			te[ 5 ] = a * e;
+			te[ 9 ] = df - ce * b;
+
+			te[ 2 ] = - a * d;
+			te[ 6 ] = b;
+			te[ 10 ] = a * c;
+
+		} else if ( euler.order === 'ZYX' ) {
+
+			const ae = a * e, af = a * f, be = b * e, bf = b * f;
+
+			te[ 0 ] = c * e;
+			te[ 4 ] = be * d - af;
+			te[ 8 ] = ae * d + bf;
+
+			te[ 1 ] = c * f;
+			te[ 5 ] = bf * d + ae;
+			te[ 9 ] = af * d - be;
+
+			te[ 2 ] = - d;
+			te[ 6 ] = b * c;
+			te[ 10 ] = a * c;
+
+		} else if ( euler.order === 'YZX' ) {
+
+			const ac = a * c, ad = a * d, bc = b * c, bd = b * d;
+
+			te[ 0 ] = c * e;
+			te[ 4 ] = bd - ac * f;
+			te[ 8 ] = bc * f + ad;
+
+			te[ 1 ] = f;
+			te[ 5 ] = a * e;
+			te[ 9 ] = - b * e;
+
+			te[ 2 ] = - d * e;
+			te[ 6 ] = ad * f + bc;
+			te[ 10 ] = ac - bd * f;
+
+		} else if ( euler.order === 'XZY' ) {
+
+			const ac = a * c, ad = a * d, bc = b * c, bd = b * d;
+
+			te[ 0 ] = c * e;
+			te[ 4 ] = - f;
+			te[ 8 ] = d * e;
+
+			te[ 1 ] = ac * f + bd;
+			te[ 5 ] = a * e;
+			te[ 9 ] = ad * f - bc;
+
+			te[ 2 ] = bc * f - ad;
+			te[ 6 ] = b * e;
+			te[ 10 ] = bd * f + ac;
+
+		}
+
+		// bottom row
+		te[ 3 ] = 0;
+		te[ 7 ] = 0;
+		te[ 11 ] = 0;
+
+		// last column
+		te[ 12 ] = 0;
+		te[ 13 ] = 0;
+		te[ 14 ] = 0;
+		te[ 15 ] = 1;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the rotation component of this matrix to the rotation specified by
+	 * the given Quaternion as outlined [here](https://en.wikipedia.org/wiki/Rotation_matrix#Quaternion)
+	 * The rest of the matrix is set to the identity.
+	 *
+	 * @param {Quaternion} q - The Quaternion.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	makeRotationFromQuaternion( q ) {
+
+		return this.compose( _zero, q, _one );
+
+	}
+
+	/**
+	 * Sets the rotation component of the transformation matrix, looking from `eye` towards
+	 * `target`, and oriented by the up-direction.
+	 *
+	 * @param {Vector3} eye - The eye vector.
+	 * @param {Vector3} target - The target vector.
+	 * @param {Vector3} up - The up vector.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	lookAt( eye, target, up ) {
+
+		const te = this.elements;
+
+		_z.subVectors( eye, target );
+
+		if ( _z.lengthSq() === 0 ) {
+
+			// eye and target are in the same position
+
+			_z.z = 1;
+
+		}
+
+		_z.normalize();
+		_x.crossVectors( up, _z );
+
+		if ( _x.lengthSq() === 0 ) {
+
+			// up and z are parallel
+
+			if ( Math.abs( up.z ) === 1 ) {
+
+				_z.x += 0.0001;
+
+			} else {
+
+				_z.z += 0.0001;
+
+			}
+
+			_z.normalize();
+			_x.crossVectors( up, _z );
+
+		}
+
+		_x.normalize();
+		_y.crossVectors( _z, _x );
+
+		te[ 0 ] = _x.x; te[ 4 ] = _y.x; te[ 8 ] = _z.x;
+		te[ 1 ] = _x.y; te[ 5 ] = _y.y; te[ 9 ] = _z.y;
+		te[ 2 ] = _x.z; te[ 6 ] = _y.z; te[ 10 ] = _z.z;
+
+		return this;
+
+	}
+
+	/**
+	 * Post-multiplies this matrix by the given 4x4 matrix.
+	 *
+	 * @param {Matrix4} m - The matrix to multiply with.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	multiply( m ) {
+
+		return this.multiplyMatrices( this, m );
+
+	}
+
+	/**
+	 * Pre-multiplies this matrix by the given 4x4 matrix.
+	 *
+	 * @param {Matrix4} m - The matrix to multiply with.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	premultiply( m ) {
+
+		return this.multiplyMatrices( m, this );
+
+	}
+
+	/**
+	 * Multiples the given 4x4 matrices and stores the result
+	 * in this matrix.
+	 *
+	 * @param {Matrix4} a - The first matrix.
+	 * @param {Matrix4} b - The second matrix.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	multiplyMatrices( a, b ) {
+
+		const ae = a.elements;
+		const be = b.elements;
+		const te = this.elements;
+
+		const a11 = ae[ 0 ], a12 = ae[ 4 ], a13 = ae[ 8 ], a14 = ae[ 12 ];
+		const a21 = ae[ 1 ], a22 = ae[ 5 ], a23 = ae[ 9 ], a24 = ae[ 13 ];
+		const a31 = ae[ 2 ], a32 = ae[ 6 ], a33 = ae[ 10 ], a34 = ae[ 14 ];
+		const a41 = ae[ 3 ], a42 = ae[ 7 ], a43 = ae[ 11 ], a44 = ae[ 15 ];
+
+		const b11 = be[ 0 ], b12 = be[ 4 ], b13 = be[ 8 ], b14 = be[ 12 ];
+		const b21 = be[ 1 ], b22 = be[ 5 ], b23 = be[ 9 ], b24 = be[ 13 ];
+		const b31 = be[ 2 ], b32 = be[ 6 ], b33 = be[ 10 ], b34 = be[ 14 ];
+		const b41 = be[ 3 ], b42 = be[ 7 ], b43 = be[ 11 ], b44 = be[ 15 ];
+
+		te[ 0 ] = a11 * b11 + a12 * b21 + a13 * b31 + a14 * b41;
+		te[ 4 ] = a11 * b12 + a12 * b22 + a13 * b32 + a14 * b42;
+		te[ 8 ] = a11 * b13 + a12 * b23 + a13 * b33 + a14 * b43;
+		te[ 12 ] = a11 * b14 + a12 * b24 + a13 * b34 + a14 * b44;
+
+		te[ 1 ] = a21 * b11 + a22 * b21 + a23 * b31 + a24 * b41;
+		te[ 5 ] = a21 * b12 + a22 * b22 + a23 * b32 + a24 * b42;
+		te[ 9 ] = a21 * b13 + a22 * b23 + a23 * b33 + a24 * b43;
+		te[ 13 ] = a21 * b14 + a22 * b24 + a23 * b34 + a24 * b44;
+
+		te[ 2 ] = a31 * b11 + a32 * b21 + a33 * b31 + a34 * b41;
+		te[ 6 ] = a31 * b12 + a32 * b22 + a33 * b32 + a34 * b42;
+		te[ 10 ] = a31 * b13 + a32 * b23 + a33 * b33 + a34 * b43;
+		te[ 14 ] = a31 * b14 + a32 * b24 + a33 * b34 + a34 * b44;
+
+		te[ 3 ] = a41 * b11 + a42 * b21 + a43 * b31 + a44 * b41;
+		te[ 7 ] = a41 * b12 + a42 * b22 + a43 * b32 + a44 * b42;
+		te[ 11 ] = a41 * b13 + a42 * b23 + a43 * b33 + a44 * b43;
+		te[ 15 ] = a41 * b14 + a42 * b24 + a43 * b34 + a44 * b44;
+
+		return this;
+
+	}
+
+	/**
+	 * Multiplies every component of the matrix by the given scalar.
+	 *
+	 * @param {number} s - The scalar.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	multiplyScalar( s ) {
+
+		const te = this.elements;
+
+		te[ 0 ] *= s; te[ 4 ] *= s; te[ 8 ] *= s; te[ 12 ] *= s;
+		te[ 1 ] *= s; te[ 5 ] *= s; te[ 9 ] *= s; te[ 13 ] *= s;
+		te[ 2 ] *= s; te[ 6 ] *= s; te[ 10 ] *= s; te[ 14 ] *= s;
+		te[ 3 ] *= s; te[ 7 ] *= s; te[ 11 ] *= s; te[ 15 ] *= s;
+
+		return this;
+
+	}
+
+	/**
+	 * Computes and returns the determinant of this matrix.
+	 *
+	 * @return {number} The determinant.
+	 */
+	determinant() {
+
+		const te = this.elements;
+
+		const n11 = te[ 0 ], n12 = te[ 4 ], n13 = te[ 8 ], n14 = te[ 12 ];
+		const n21 = te[ 1 ], n22 = te[ 5 ], n23 = te[ 9 ], n24 = te[ 13 ];
+		const n31 = te[ 2 ], n32 = te[ 6 ], n33 = te[ 10 ], n34 = te[ 14 ];
+		const n41 = te[ 3 ], n42 = te[ 7 ], n43 = te[ 11 ], n44 = te[ 15 ];
+
+		const t11 = n23 * n34 - n24 * n33;
+		const t12 = n22 * n34 - n24 * n32;
+		const t13 = n22 * n33 - n23 * n32;
+
+		const t21 = n21 * n34 - n24 * n31;
+		const t22 = n21 * n33 - n23 * n31;
+		const t23 = n21 * n32 - n22 * n31;
+
+		return n11 * ( n42 * t11 - n43 * t12 + n44 * t13 ) -
+			n12 * ( n41 * t11 - n43 * t21 + n44 * t22 ) +
+			n13 * ( n41 * t12 - n42 * t21 + n44 * t23 ) -
+			n14 * ( n41 * t13 - n42 * t22 + n43 * t23 );
+
+	}
+
+	/**
+	 * Computes and returns the determinant of the 4x4 matrix, but assumes the
+	 * matrix is affine, saving some computations.
+	 *
+	 * For affine matrices (like an object's world matrix), this value equals the
+	 * full 4x4 {@link Matrix4#determinant} but is cheaper to compute.
+	 *
+	 * Assumes the bottom row is [0, 0, 0, 1].
+	 *
+	 * @return {number} The determinant of the matrix.
+	 */
+	determinantAffine() {
+
+		const te = this.elements;
+
+		const n11 = te[ 0 ], n12 = te[ 4 ], n13 = te[ 8 ];
+		const n21 = te[ 1 ], n22 = te[ 5 ], n23 = te[ 9 ];
+		const n31 = te[ 2 ], n32 = te[ 6 ], n33 = te[ 10 ];
+
+		return n11 * ( n22 * n33 - n23 * n32 ) -
+			n12 * ( n21 * n33 - n23 * n31 ) +
+			n13 * ( n21 * n32 - n22 * n31 );
+
+	}
+
+	/**
+	 * Transposes this matrix in place.
+	 *
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	transpose() {
+
+		const te = this.elements;
+		let tmp;
+
+		tmp = te[ 1 ]; te[ 1 ] = te[ 4 ]; te[ 4 ] = tmp;
+		tmp = te[ 2 ]; te[ 2 ] = te[ 8 ]; te[ 8 ] = tmp;
+		tmp = te[ 6 ]; te[ 6 ] = te[ 9 ]; te[ 9 ] = tmp;
+
+		tmp = te[ 3 ]; te[ 3 ] = te[ 12 ]; te[ 12 ] = tmp;
+		tmp = te[ 7 ]; te[ 7 ] = te[ 13 ]; te[ 13 ] = tmp;
+		tmp = te[ 11 ]; te[ 11 ] = te[ 14 ]; te[ 14 ] = tmp;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the position component for this matrix from the given vector,
+	 * without affecting the rest of the matrix.
+	 *
+	 * @param {number|Vector3} x - The x component of the vector or alternatively the vector object.
+	 * @param {number} y - The y component of the vector.
+	 * @param {number} z - The z component of the vector.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	setPosition( x, y, z ) {
+
+		const te = this.elements;
+
+		if ( x.isVector3 ) {
+
+			te[ 12 ] = x.x;
+			te[ 13 ] = x.y;
+			te[ 14 ] = x.z;
+
+		} else {
+
+			te[ 12 ] = x;
+			te[ 13 ] = y;
+			te[ 14 ] = z;
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Inverts this matrix, using the [analytic method](https://en.wikipedia.org/wiki/Invertible_matrix#Analytic_solution).
+	 * You can not invert with a determinant of zero. If you attempt this, the method produces
+	 * a zero matrix instead.
+	 *
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	invert() {
+
+		// based on https://github.com/toji/gl-matrix
+		const te = this.elements,
+
+			n11 = te[ 0 ], n21 = te[ 1 ], n31 = te[ 2 ], n41 = te[ 3 ],
+			n12 = te[ 4 ], n22 = te[ 5 ], n32 = te[ 6 ], n42 = te[ 7 ],
+			n13 = te[ 8 ], n23 = te[ 9 ], n33 = te[ 10 ], n43 = te[ 11 ],
+			n14 = te[ 12 ], n24 = te[ 13 ], n34 = te[ 14 ], n44 = te[ 15 ],
+
+			t1 = n11 * n22 - n21 * n12,
+			t2 = n11 * n32 - n31 * n12,
+			t3 = n11 * n42 - n41 * n12,
+			t4 = n21 * n32 - n31 * n22,
+			t5 = n21 * n42 - n41 * n22,
+			t6 = n31 * n42 - n41 * n32,
+			t7 = n13 * n24 - n23 * n14,
+			t8 = n13 * n34 - n33 * n14,
+			t9 = n13 * n44 - n43 * n14,
+			t10 = n23 * n34 - n33 * n24,
+			t11 = n23 * n44 - n43 * n24,
+			t12 = n33 * n44 - n43 * n34;
+
+		const det = t1 * t12 - t2 * t11 + t3 * t10 + t4 * t9 - t5 * t8 + t6 * t7;
+
+		if ( det === 0 ) return this.set( 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 );
+
+		const detInv = 1 / det;
+
+		te[ 0 ] = ( n22 * t12 - n32 * t11 + n42 * t10 ) * detInv;
+		te[ 1 ] = ( n31 * t11 - n21 * t12 - n41 * t10 ) * detInv;
+		te[ 2 ] = ( n24 * t6 - n34 * t5 + n44 * t4 ) * detInv;
+		te[ 3 ] = ( n33 * t5 - n23 * t6 - n43 * t4 ) * detInv;
+
+		te[ 4 ] = ( n32 * t9 - n12 * t12 - n42 * t8 ) * detInv;
+		te[ 5 ] = ( n11 * t12 - n31 * t9 + n41 * t8 ) * detInv;
+		te[ 6 ] = ( n34 * t3 - n14 * t6 - n44 * t2 ) * detInv;
+		te[ 7 ] = ( n13 * t6 - n33 * t3 + n43 * t2 ) * detInv;
+
+		te[ 8 ] = ( n12 * t11 - n22 * t9 + n42 * t7 ) * detInv;
+		te[ 9 ] = ( n21 * t9 - n11 * t11 - n41 * t7 ) * detInv;
+		te[ 10 ] = ( n14 * t5 - n24 * t3 + n44 * t1 ) * detInv;
+		te[ 11 ] = ( n23 * t3 - n13 * t5 - n43 * t1 ) * detInv;
+
+		te[ 12 ] = ( n22 * t8 - n12 * t10 - n32 * t7 ) * detInv;
+		te[ 13 ] = ( n11 * t10 - n21 * t8 + n31 * t7 ) * detInv;
+		te[ 14 ] = ( n24 * t2 - n14 * t4 - n34 * t1 ) * detInv;
+		te[ 15 ] = ( n13 * t4 - n23 * t2 + n33 * t1 ) * detInv;
+
+		return this;
+
+	}
+
+	/**
+	 * Scales each of the first three columns of this matrix by the corresponding component of the given vector.
+	 *
+	 * @param {Vector3} v - The scale vector.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	scale( v ) {
+
+		const te = this.elements;
+		const x = v.x, y = v.y, z = v.z;
+
+		te[ 0 ] *= x; te[ 4 ] *= y; te[ 8 ] *= z;
+		te[ 1 ] *= x; te[ 5 ] *= y; te[ 9 ] *= z;
+		te[ 2 ] *= x; te[ 6 ] *= y; te[ 10 ] *= z;
+		te[ 3 ] *= x; te[ 7 ] *= y; te[ 11 ] *= z;
+
+		return this;
+
+	}
+
+	/**
+	 * Gets the maximum scale value of the three axes.
+	 *
+	 * @return {number} The maximum scale.
+	 */
+	getMaxScaleOnAxis() {
+
+		const te = this.elements;
+
+		const scaleXSq = te[ 0 ] * te[ 0 ] + te[ 1 ] * te[ 1 ] + te[ 2 ] * te[ 2 ];
+		const scaleYSq = te[ 4 ] * te[ 4 ] + te[ 5 ] * te[ 5 ] + te[ 6 ] * te[ 6 ];
+		const scaleZSq = te[ 8 ] * te[ 8 ] + te[ 9 ] * te[ 9 ] + te[ 10 ] * te[ 10 ];
+
+		return Math.sqrt( Math.max( scaleXSq, scaleYSq, scaleZSq ) );
+
+	}
+
+	/**
+	 * Sets this matrix as a translation transform from the given vector.
+	 *
+	 * @param {number|Vector3} x - The amount to translate in the X axis or alternatively a translation vector.
+	 * @param {number} y - The amount to translate in the Y axis.
+	 * @param {number} z - The amount to translate in the z axis.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	makeTranslation( x, y, z ) {
+
+		if ( x.isVector3 ) {
+
+			this.set(
+
+				1, 0, 0, x.x,
+				0, 1, 0, x.y,
+				0, 0, 1, x.z,
+				0, 0, 0, 1
+
+			);
+
+		} else {
+
+			this.set(
+
+				1, 0, 0, x,
+				0, 1, 0, y,
+				0, 0, 1, z,
+				0, 0, 0, 1
+
+			);
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this matrix as a rotational transformation around the X axis by
+	 * the given angle.
+	 *
+	 * @param {number} theta - The rotation in radians.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	makeRotationX( theta ) {
+
+		const c = Math.cos( theta ), s = Math.sin( theta );
+
+		this.set(
+
+			1, 0, 0, 0,
+			0, c, - s, 0,
+			0, s, c, 0,
+			0, 0, 0, 1
+
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this matrix as a rotational transformation around the Y axis by
+	 * the given angle.
+	 *
+	 * @param {number} theta - The rotation in radians.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	makeRotationY( theta ) {
+
+		const c = Math.cos( theta ), s = Math.sin( theta );
+
+		this.set(
+
+			 c, 0, s, 0,
+			 0, 1, 0, 0,
+			- s, 0, c, 0,
+			 0, 0, 0, 1
+
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this matrix as a rotational transformation around the Z axis by
+	 * the given angle.
+	 *
+	 * @param {number} theta - The rotation in radians.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	makeRotationZ( theta ) {
+
+		const c = Math.cos( theta ), s = Math.sin( theta );
+
+		this.set(
+
+			c, - s, 0, 0,
+			s, c, 0, 0,
+			0, 0, 1, 0,
+			0, 0, 0, 1
+
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this matrix as a rotational transformation around the given axis by
+	 * the given angle.
+	 *
+	 * @param {Vector3} axis - The normalized rotation axis.
+	 * @param {number} angle - The rotation in radians.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	makeRotationAxis( axis, angle ) {
+
+		const c = Math.cos( angle );
+		const s = Math.sin( angle );
+		const t = 1 - c;
+		const x = axis.x, y = axis.y, z = axis.z;
+		const tx = t * x, ty = t * y;
+
+		this.set(
+
+			tx * x + c, tx * y - s * z, tx * z + s * y, 0,
+			tx * y + s * z, ty * y + c, ty * z - s * x, 0,
+			tx * z - s * y, ty * z + s * x, t * z * z + c, 0,
+			0, 0, 0, 1
+
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this matrix as a scale transformation.
+	 *
+	 * @param {number} x - The amount to scale in the X axis.
+	 * @param {number} y - The amount to scale in the Y axis.
+	 * @param {number} z - The amount to scale in the Z axis.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	makeScale( x, y, z ) {
+
+		this.set(
+
+			x, 0, 0, 0,
+			0, y, 0, 0,
+			0, 0, z, 0,
+			0, 0, 0, 1
+
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this matrix as a shear transformation.
+	 *
+	 * @param {number} xy - The amount to shear X by Y.
+	 * @param {number} xz - The amount to shear X by Z.
+	 * @param {number} yx - The amount to shear Y by X.
+	 * @param {number} yz - The amount to shear Y by Z.
+	 * @param {number} zx - The amount to shear Z by X.
+	 * @param {number} zy - The amount to shear Z by Y.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	makeShear( xy, xz, yx, yz, zx, zy ) {
+
+		this.set(
+
+			1, yx, zx, 0,
+			xy, 1, zy, 0,
+			xz, yz, 1, 0,
+			0, 0, 0, 1
+
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this matrix to the transformation composed of the given position,
+	 * rotation (Quaternion) and scale.
+	 *
+	 * @param {Vector3} position - The position vector.
+	 * @param {Quaternion} quaternion - The rotation as a Quaternion.
+	 * @param {Vector3} scale - The scale vector.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	compose( position, quaternion, scale ) {
+
+		const te = this.elements;
+
+		const x = quaternion._x, y = quaternion._y, z = quaternion._z, w = quaternion._w;
+		const x2 = x + x,	y2 = y + y, z2 = z + z;
+		const xx = x * x2, xy = x * y2, xz = x * z2;
+		const yy = y * y2, yz = y * z2, zz = z * z2;
+		const wx = w * x2, wy = w * y2, wz = w * z2;
+
+		const sx = scale.x, sy = scale.y, sz = scale.z;
+
+		te[ 0 ] = ( 1 - ( yy + zz ) ) * sx;
+		te[ 1 ] = ( xy + wz ) * sx;
+		te[ 2 ] = ( xz - wy ) * sx;
+		te[ 3 ] = 0;
+
+		te[ 4 ] = ( xy - wz ) * sy;
+		te[ 5 ] = ( 1 - ( xx + zz ) ) * sy;
+		te[ 6 ] = ( yz + wx ) * sy;
+		te[ 7 ] = 0;
+
+		te[ 8 ] = ( xz + wy ) * sz;
+		te[ 9 ] = ( yz - wx ) * sz;
+		te[ 10 ] = ( 1 - ( xx + yy ) ) * sz;
+		te[ 11 ] = 0;
+
+		te[ 12 ] = position.x;
+		te[ 13 ] = position.y;
+		te[ 14 ] = position.z;
+		te[ 15 ] = 1;
+
+		return this;
+
+	}
+
+	/**
+	 * Decomposes this matrix into its position, rotation and scale components
+	 * and provides the result in the given objects.
+	 *
+	 * Note: Not all matrices are decomposable in this way. For example, if an
+	 * object has a non-uniformly scaled parent, then the object's world matrix
+	 * may not be decomposable, and this method may not be appropriate.
+	 *
+	 * @param {Vector3} position - The position vector.
+	 * @param {Quaternion} quaternion - The rotation as a Quaternion.
+	 * @param {Vector3} scale - The scale vector.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	decompose( position, quaternion, scale ) {
+
+		const te = this.elements;
+
+		position.x = te[ 12 ];
+		position.y = te[ 13 ];
+		position.z = te[ 14 ];
+
+		const det = this.determinantAffine();
+
+		if ( det === 0 ) {
+
+			scale.set( 1, 1, 1 );
+			quaternion.identity();
+
+			return this;
+
+		}
+
+		let sx = _v1$7.set( te[ 0 ], te[ 1 ], te[ 2 ] ).length();
+		const sy = _v1$7.set( te[ 4 ], te[ 5 ], te[ 6 ] ).length();
+		const sz = _v1$7.set( te[ 8 ], te[ 9 ], te[ 10 ] ).length();
+
+		// if determinant is negative, we need to invert one scale
+		if ( det < 0 ) sx = - sx;
+
+		// scale the rotation part
+		_m1$2.copy( this );
+
+		const invSX = 1 / sx;
+		const invSY = 1 / sy;
+		const invSZ = 1 / sz;
+
+		_m1$2.elements[ 0 ] *= invSX;
+		_m1$2.elements[ 1 ] *= invSX;
+		_m1$2.elements[ 2 ] *= invSX;
+
+		_m1$2.elements[ 4 ] *= invSY;
+		_m1$2.elements[ 5 ] *= invSY;
+		_m1$2.elements[ 6 ] *= invSY;
+
+		_m1$2.elements[ 8 ] *= invSZ;
+		_m1$2.elements[ 9 ] *= invSZ;
+		_m1$2.elements[ 10 ] *= invSZ;
+
+		quaternion.setFromRotationMatrix( _m1$2 );
+
+		scale.x = sx;
+		scale.y = sy;
+		scale.z = sz;
+
+		return this;
+
+	}
+
+	/**
+	 * Creates a perspective projection matrix. This is used internally by
+	 * {@link PerspectiveCamera#updateProjectionMatrix}.
+
+	 * @param {number} left - Left boundary of the viewing frustum at the near plane.
+	 * @param {number} right - Right boundary of the viewing frustum at the near plane.
+	 * @param {number} top - Top boundary of the viewing frustum at the near plane.
+	 * @param {number} bottom - Bottom boundary of the viewing frustum at the near plane.
+	 * @param {number} near - The distance from the camera to the near plane.
+	 * @param {number} far - The distance from the camera to the far plane.
+	 * @param {(WebGLCoordinateSystem|WebGPUCoordinateSystem)} [coordinateSystem=WebGLCoordinateSystem] - The coordinate system.
+	 * @param {boolean} [reversedDepth=false] - Whether to use a reversed depth.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	makePerspective( left, right, top, bottom, near, far, coordinateSystem = WebGLCoordinateSystem, reversedDepth = false ) {
+
+		const te = this.elements;
+
+		const x = 2 * near / ( right - left );
+		const y = 2 * near / ( top - bottom );
+
+		const a = ( right + left ) / ( right - left );
+		const b = ( top + bottom ) / ( top - bottom );
+
+		let c, d;
+
+		if ( reversedDepth ) {
+
+			c = near / ( far - near );
+			d = ( far * near ) / ( far - near );
+
+		} else {
+
+			if ( coordinateSystem === WebGLCoordinateSystem ) {
+
+				c = - ( far + near ) / ( far - near );
+				d = ( -2 * far * near ) / ( far - near );
+
+			} else if ( coordinateSystem === WebGPUCoordinateSystem ) {
+
+				c = - far / ( far - near );
+				d = ( - far * near ) / ( far - near );
+
+			} else {
+
+				throw new Error( 'THREE.Matrix4.makePerspective(): Invalid coordinate system: ' + coordinateSystem );
+
+			}
+
+		}
+
+		te[ 0 ] = x;	te[ 4 ] = 0;	te[ 8 ] = a; 	te[ 12 ] = 0;
+		te[ 1 ] = 0;	te[ 5 ] = y;	te[ 9 ] = b; 	te[ 13 ] = 0;
+		te[ 2 ] = 0;	te[ 6 ] = 0;	te[ 10 ] = c; 	te[ 14 ] = d;
+		te[ 3 ] = 0;	te[ 7 ] = 0;	te[ 11 ] = -1;	te[ 15 ] = 0;
+
+		return this;
+
+	}
+
+	/**
+	 * Creates a orthographic projection matrix. This is used internally by
+	 * {@link OrthographicCamera#updateProjectionMatrix}.
+
+	 * @param {number} left - Left boundary of the viewing frustum at the near plane.
+	 * @param {number} right - Right boundary of the viewing frustum at the near plane.
+	 * @param {number} top - Top boundary of the viewing frustum at the near plane.
+	 * @param {number} bottom - Bottom boundary of the viewing frustum at the near plane.
+	 * @param {number} near - The distance from the camera to the near plane.
+	 * @param {number} far - The distance from the camera to the far plane.
+	 * @param {(WebGLCoordinateSystem|WebGPUCoordinateSystem)} [coordinateSystem=WebGLCoordinateSystem] - The coordinate system.
+	 * @param {boolean} [reversedDepth=false] - Whether to use a reversed depth.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	makeOrthographic( left, right, top, bottom, near, far, coordinateSystem = WebGLCoordinateSystem, reversedDepth = false ) {
+
+		const te = this.elements;
+
+		const x = 2 / ( right - left );
+		const y = 2 / ( top - bottom );
+
+		const a = - ( right + left ) / ( right - left );
+		const b = - ( top + bottom ) / ( top - bottom );
+
+		let c, d;
+
+		if ( reversedDepth ) {
+
+			c = 1 / ( far - near );
+			d = far / ( far - near );
+
+		} else {
+
+			if ( coordinateSystem === WebGLCoordinateSystem ) {
+
+				c = -2 / ( far - near );
+				d = - ( far + near ) / ( far - near );
+
+			} else if ( coordinateSystem === WebGPUCoordinateSystem ) {
+
+				c = -1 / ( far - near );
+				d = - near / ( far - near );
+
+			} else {
+
+				throw new Error( 'THREE.Matrix4.makeOrthographic(): Invalid coordinate system: ' + coordinateSystem );
+
+			}
+
+		}
+
+		te[ 0 ] = x;		te[ 4 ] = 0;		te[ 8 ] = 0; 		te[ 12 ] = a;
+		te[ 1 ] = 0; 		te[ 5 ] = y;		te[ 9 ] = 0; 		te[ 13 ] = b;
+		te[ 2 ] = 0; 		te[ 6 ] = 0;		te[ 10 ] = c;		te[ 14 ] = d;
+		te[ 3 ] = 0; 		te[ 7 ] = 0;		te[ 11 ] = 0;		te[ 15 ] = 1;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this matrix is equal with the given one.
+	 *
+	 * @param {Matrix4} matrix - The matrix to test for equality.
+	 * @return {boolean} Whether this matrix is equal with the given one.
+	 */
+	equals( matrix ) {
+
+		const te = this.elements;
+		const me = matrix.elements;
+
+		for ( let i = 0; i < 16; i ++ ) {
+
+			if ( te[ i ] !== me[ i ] ) return false;
+
+		}
+
+		return true;
+
+	}
+
+	/**
+	 * Sets the elements of the matrix from the given array.
+	 *
+	 * @param {Array<number>} array - The matrix elements in column-major order.
+	 * @param {number} [offset=0] - Index of the first element in the array.
+	 * @return {Matrix4} A reference to this matrix.
+	 */
+	fromArray( array, offset = 0 ) {
+
+		for ( let i = 0; i < 16; i ++ ) {
+
+			this.elements[ i ] = array[ i + offset ];
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Writes the elements of this matrix to the given array. If no array is provided,
+	 * the method returns a new instance.
+	 *
+	 * @param {Array<number>} [array=[]] - The target array holding the matrix elements in column-major order.
+	 * @param {number} [offset=0] - Index of the first element in the array.
+	 * @return {Array<number>} The matrix elements in column-major order.
+	 */
+	toArray( array = [], offset = 0 ) {
+
+		const te = this.elements;
+
+		array[ offset ] = te[ 0 ];
+		array[ offset + 1 ] = te[ 1 ];
+		array[ offset + 2 ] = te[ 2 ];
+		array[ offset + 3 ] = te[ 3 ];
+
+		array[ offset + 4 ] = te[ 4 ];
+		array[ offset + 5 ] = te[ 5 ];
+		array[ offset + 6 ] = te[ 6 ];
+		array[ offset + 7 ] = te[ 7 ];
+
+		array[ offset + 8 ] = te[ 8 ];
+		array[ offset + 9 ] = te[ 9 ];
+		array[ offset + 10 ] = te[ 10 ];
+		array[ offset + 11 ] = te[ 11 ];
+
+		array[ offset + 12 ] = te[ 12 ];
+		array[ offset + 13 ] = te[ 13 ];
+		array[ offset + 14 ] = te[ 14 ];
+		array[ offset + 15 ] = te[ 15 ];
+
+		return array;
+
+	}
+
+}
+
+const _v1$7 = /*@__PURE__*/ new Vector3();
+const _m1$2 = /*@__PURE__*/ new Matrix4();
+const _zero = /*@__PURE__*/ new Vector3( 0, 0, 0 );
+const _one = /*@__PURE__*/ new Vector3( 1, 1, 1 );
+const _x = /*@__PURE__*/ new Vector3();
+const _y = /*@__PURE__*/ new Vector3();
+const _z = /*@__PURE__*/ new Vector3();
+
+const _matrix$2 = /*@__PURE__*/ new Matrix4();
+const _quaternion$4 = /*@__PURE__*/ new Quaternion();
+
+/**
+ * A class representing Euler angles.
+ *
+ * Euler angles describe a rotational transformation by rotating an object on
+ * its various axes in specified amounts per axis, and a specified axis
+ * order.
+ *
+ * Iterating through an instance will yield its components (x, y, z,
+ * order) in the corresponding order.
+ *
+ * ```js
+ * const a = new THREE.Euler( 0, 1, 1.57, 'XYZ' );
+ * const b = new THREE.Vector3( 1, 0, 1 );
+ * b.applyEuler(a);
+ * ```
+ */
+class Euler {
+
+	/**
+	 * Constructs a new euler instance.
+	 *
+	 * @param {number} [x=0] - The angle of the x axis in radians.
+	 * @param {number} [y=0] - The angle of the y axis in radians.
+	 * @param {number} [z=0] - The angle of the z axis in radians.
+	 * @param {string} [order=Euler.DEFAULT_ORDER] - A string representing the order that the rotations are applied.
+	 */
+	constructor( x = 0, y = 0, z = 0, order = Euler.DEFAULT_ORDER ) {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isEuler = true;
+
+		this._x = x;
+		this._y = y;
+		this._z = z;
+		this._order = order;
+
+	}
+
+	/**
+	 * The angle of the x axis in radians.
+	 *
+	 * @type {number}
+	 * @default 0
+	 */
+	get x() {
+
+		return this._x;
+
+	}
+
+	set x( value ) {
+
+		this._x = value;
+		this._onChangeCallback();
+
+	}
+
+	/**
+	 * The angle of the y axis in radians.
+	 *
+	 * @type {number}
+	 * @default 0
+	 */
+	get y() {
+
+		return this._y;
+
+	}
+
+	set y( value ) {
+
+		this._y = value;
+		this._onChangeCallback();
+
+	}
+
+	/**
+	 * The angle of the z axis in radians.
+	 *
+	 * @type {number}
+	 * @default 0
+	 */
+	get z() {
+
+		return this._z;
+
+	}
+
+	set z( value ) {
+
+		this._z = value;
+		this._onChangeCallback();
+
+	}
+
+	/**
+	 * A string representing the order that the rotations are applied.
+	 *
+	 * @type {string}
+	 * @default 'XYZ'
+	 */
+	get order() {
+
+		return this._order;
+
+	}
+
+	set order( value ) {
+
+		this._order = value;
+		this._onChangeCallback();
+
+	}
+
+	/**
+	 * Sets the Euler components.
+	 *
+	 * @param {number} x - The angle of the x axis in radians.
+	 * @param {number} y - The angle of the y axis in radians.
+	 * @param {number} z - The angle of the z axis in radians.
+	 * @param {string} [order] - A string representing the order that the rotations are applied.
+	 * @return {Euler} A reference to this Euler instance.
+	 */
+	set( x, y, z, order = this._order ) {
+
+		this._x = x;
+		this._y = y;
+		this._z = z;
+		this._order = order;
+
+		this._onChangeCallback();
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new Euler instance with copied values from this instance.
+	 *
+	 * @return {Euler} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor( this._x, this._y, this._z, this._order );
+
+	}
+
+	/**
+	 * Copies the values of the given Euler instance to this instance.
+	 *
+	 * @param {Euler} euler - The Euler instance to copy.
+	 * @return {Euler} A reference to this Euler instance.
+	 */
+	copy( euler ) {
+
+		this._x = euler._x;
+		this._y = euler._y;
+		this._z = euler._z;
+		this._order = euler._order;
+
+		this._onChangeCallback();
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the angles of this Euler instance from a pure rotation matrix.
+	 *
+	 * @param {Matrix4} m - A 4x4 matrix of which the upper 3x3 of matrix is a pure rotation matrix (i.e. unscaled).
+	 * @param {string} [order] - A string representing the order that the rotations are applied.
+	 * @param {boolean} [update=true] - Whether the internal `onChange` callback should be executed or not.
+	 * @return {Euler} A reference to this Euler instance.
+	 */
+	setFromRotationMatrix( m, order = this._order, update = true ) {
+
+		const te = m.elements;
+		const m11 = te[ 0 ], m12 = te[ 4 ], m13 = te[ 8 ];
+		const m21 = te[ 1 ], m22 = te[ 5 ], m23 = te[ 9 ];
+		const m31 = te[ 2 ], m32 = te[ 6 ], m33 = te[ 10 ];
+
+		switch ( order ) {
+
+			case 'XYZ':
+
+				this._y = Math.asin( clamp( m13, -1, 1 ) );
+
+				if ( Math.abs( m13 ) < 0.9999999 ) {
+
+					this._x = Math.atan2( - m23, m33 );
+					this._z = Math.atan2( - m12, m11 );
+
+				} else {
+
+					this._x = Math.atan2( m32, m22 );
+					this._z = 0;
+
+				}
+
+				break;
+
+			case 'YXZ':
+
+				this._x = Math.asin( - clamp( m23, -1, 1 ) );
+
+				if ( Math.abs( m23 ) < 0.9999999 ) {
+
+					this._y = Math.atan2( m13, m33 );
+					this._z = Math.atan2( m21, m22 );
+
+				} else {
+
+					this._y = Math.atan2( - m31, m11 );
+					this._z = 0;
+
+				}
+
+				break;
+
+			case 'ZXY':
+
+				this._x = Math.asin( clamp( m32, -1, 1 ) );
+
+				if ( Math.abs( m32 ) < 0.9999999 ) {
+
+					this._y = Math.atan2( - m31, m33 );
+					this._z = Math.atan2( - m12, m22 );
+
+				} else {
+
+					this._y = 0;
+					this._z = Math.atan2( m21, m11 );
+
+				}
+
+				break;
+
+			case 'ZYX':
+
+				this._y = Math.asin( - clamp( m31, -1, 1 ) );
+
+				if ( Math.abs( m31 ) < 0.9999999 ) {
+
+					this._x = Math.atan2( m32, m33 );
+					this._z = Math.atan2( m21, m11 );
+
+				} else {
+
+					this._x = 0;
+					this._z = Math.atan2( - m12, m22 );
+
+				}
+
+				break;
+
+			case 'YZX':
+
+				this._z = Math.asin( clamp( m21, -1, 1 ) );
+
+				if ( Math.abs( m21 ) < 0.9999999 ) {
+
+					this._x = Math.atan2( - m23, m22 );
+					this._y = Math.atan2( - m31, m11 );
+
+				} else {
+
+					this._x = 0;
+					this._y = Math.atan2( m13, m33 );
+
+				}
+
+				break;
+
+			case 'XZY':
+
+				this._z = Math.asin( - clamp( m12, -1, 1 ) );
+
+				if ( Math.abs( m12 ) < 0.9999999 ) {
+
+					this._x = Math.atan2( m32, m22 );
+					this._y = Math.atan2( m13, m11 );
+
+				} else {
+
+					this._x = Math.atan2( - m23, m33 );
+					this._y = 0;
+
+				}
+
+				break;
+
+			default:
+
+				warn( 'Euler: .setFromRotationMatrix() encountered an unknown order: ' + order );
+
+		}
+
+		this._order = order;
+
+		if ( update === true ) this._onChangeCallback();
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the angles of this Euler instance from a normalized quaternion.
+	 *
+	 * @param {Quaternion} q - A normalized Quaternion.
+	 * @param {string} [order] - A string representing the order that the rotations are applied.
+	 * @param {boolean} [update=true] - Whether the internal `onChange` callback should be executed or not.
+	 * @return {Euler} A reference to this Euler instance.
+	 */
+	setFromQuaternion( q, order, update ) {
+
+		_matrix$2.makeRotationFromQuaternion( q );
+
+		return this.setFromRotationMatrix( _matrix$2, order, update );
+
+	}
+
+	/**
+	 * Sets the angles of this Euler instance from the given vector.
+	 *
+	 * @param {Vector3} v - The vector.
+	 * @param {string} [order] - A string representing the order that the rotations are applied.
+	 * @return {Euler} A reference to this Euler instance.
+	 */
+	setFromVector3( v, order = this._order ) {
+
+		return this.set( v.x, v.y, v.z, order );
+
+	}
+
+	/**
+	 * Resets the euler angle with a new order by creating a quaternion from this
+	 * euler angle and then setting this euler angle with the quaternion and the
+	 * new order.
+	 *
+	 * Warning: This discards revolution information.
+	 *
+	 * @param {string} [newOrder] - A string representing the new order that the rotations are applied.
+	 * @return {Euler} A reference to this Euler instance.
+	 */
+	reorder( newOrder ) {
+
+		_quaternion$4.setFromEuler( this );
+
+		return this.setFromQuaternion( _quaternion$4, newOrder );
+
+	}
+
+	/**
+	 * Returns `true` if this Euler instance is equal with the given one.
+	 *
+	 * @param {Euler} euler - The Euler instance to test for equality.
+	 * @return {boolean} Whether this Euler instance is equal with the given one.
+	 */
+	equals( euler ) {
+
+		return ( euler._x === this._x ) && ( euler._y === this._y ) && ( euler._z === this._z ) && ( euler._order === this._order );
+
+	}
+
+	/**
+	 * Sets this Euler instance's components to values from the given array. The first three
+	 * entries of the array are assign to the x,y and z components. An optional fourth entry
+	 * defines the Euler order.
+	 *
+	 * @param {Array<number,number,number,?string>} array - An array holding the Euler component values.
+	 * @return {Euler} A reference to this Euler instance.
+	 */
+	fromArray( array ) {
+
+		this._x = array[ 0 ];
+		this._y = array[ 1 ];
+		this._z = array[ 2 ];
+		if ( array[ 3 ] !== undefined ) this._order = array[ 3 ];
+
+		this._onChangeCallback();
+
+		return this;
+
+	}
+
+	/**
+	 * Writes the components of this Euler instance to the given array. If no array is provided,
+	 * the method returns a new instance.
+	 *
+	 * @param {Array<number,number,number,string>} [array=[]] - The target array holding the Euler components.
+	 * @param {number} [offset=0] - Index of the first element in the array.
+	 * @return {Array<number,number,number,string>} The Euler components.
+	 */
+	toArray( array = [], offset = 0 ) {
+
+		array[ offset ] = this._x;
+		array[ offset + 1 ] = this._y;
+		array[ offset + 2 ] = this._z;
+		array[ offset + 3 ] = this._order;
+
+		return array;
+
+	}
+
+	_onChange( callback ) {
+
+		this._onChangeCallback = callback;
+
+		return this;
+
+	}
+
+	_onChangeCallback() {}
+
+	*[ Symbol.iterator ]() {
+
+		yield this._x;
+		yield this._y;
+		yield this._z;
+		yield this._order;
+
+	}
+
+}
+
+/**
+ * The default Euler angle order.
+ *
+ * @static
+ * @type {string}
+ * @default 'XYZ'
+ */
+Euler.DEFAULT_ORDER = 'XYZ';
+
+/**
+ * A layers object assigns an 3D object to 1 or more of 32
+ * layers numbered `0` to `31` - internally the layers are stored as a
+ * bit mask], and by default all 3D objects are a member of layer `0`.
+ *
+ * This can be used to control visibility - an object must share a layer with
+ * a camera to be visible when that camera's view is
+ * rendered.
+ *
+ * All classes that inherit from {@link Object3D} have an `layers` property which
+ * is an instance of this class.
+ */
+class Layers {
+
+	/**
+	 * Constructs a new layers instance, with membership
+	 * initially set to layer `0`.
+	 */
+	constructor() {
+
+		/**
+		 * A bit mask storing which of the 32 layers this layers object is currently
+		 * a member of.
+		 *
+		 * @type {number}
+		 */
+		this.mask = 1 | 0;
+
+	}
+
+	/**
+	 * Sets membership to the given layer, and remove membership all other layers.
+	 *
+	 * @param {number} layer - The layer to set.
+	 */
+	set( layer ) {
+
+		this.mask = ( 1 << layer | 0 ) >>> 0;
+
+	}
+
+	/**
+	 * Adds membership of the given layer.
+	 *
+	 * @param {number} layer - The layer to enable.
+	 */
+	enable( layer ) {
+
+		this.mask |= 1 << layer | 0;
+
+	}
+
+	/**
+	 * Adds membership to all layers.
+	 */
+	enableAll() {
+
+		this.mask = 0xffffffff | 0;
+
+	}
+
+	/**
+	 * Toggles the membership of the given layer.
+	 *
+	 * @param {number} layer - The layer to toggle.
+	 */
+	toggle( layer ) {
+
+		this.mask ^= 1 << layer | 0;
+
+	}
+
+	/**
+	 * Removes membership of the given layer.
+	 *
+	 * @param {number} layer - The layer to enable.
+	 */
+	disable( layer ) {
+
+		this.mask &= ~ ( 1 << layer | 0 );
+
+	}
+
+	/**
+	 * Removes the membership from all layers.
+	 */
+	disableAll() {
+
+		this.mask = 0;
+
+	}
+
+	/**
+	 * Returns `true` if this and the given layers object have at least one
+	 * layer in common.
+	 *
+	 * @param {Layers} layers - The layers to test.
+	 * @return {boolean } Whether this and the given layers object have at least one layer in common or not.
+	 */
+	test( layers ) {
+
+		return ( this.mask & layers.mask ) !== 0;
+
+	}
+
+	/**
+	 * Returns `true` if the given layer is enabled.
+	 *
+	 * @param {number} layer - The layer to test.
+	 * @return {boolean } Whether the given layer is enabled or not.
+	 */
+	isEnabled( layer ) {
+
+		return ( this.mask & ( 1 << layer | 0 ) ) !== 0;
+
+	}
+
+}
+
+let _object3DId = 0;
+
+const _v1$6 = /*@__PURE__*/ new Vector3();
+const _q1 = /*@__PURE__*/ new Quaternion();
+const _m1$1 = /*@__PURE__*/ new Matrix4();
+const _target = /*@__PURE__*/ new Vector3();
+
+const _position$4 = /*@__PURE__*/ new Vector3();
+const _scale$3 = /*@__PURE__*/ new Vector3();
+const _quaternion$3 = /*@__PURE__*/ new Quaternion();
+
+const _xAxis = /*@__PURE__*/ new Vector3( 1, 0, 0 );
+const _yAxis = /*@__PURE__*/ new Vector3( 0, 1, 0 );
+const _zAxis = /*@__PURE__*/ new Vector3( 0, 0, 1 );
+
+/**
+ * Fires when the object has been added to its parent object.
+ *
+ * @event Object3D#added
+ * @type {Object}
+ */
+const _addedEvent = { type: 'added' };
+
+/**
+ * Fires when the object has been removed from its parent object.
+ *
+ * @event Object3D#removed
+ * @type {Object}
+ */
+const _removedEvent = { type: 'removed' };
+
+/**
+ * Fires when a new child object has been added.
+ *
+ * @event Object3D#childadded
+ * @type {Object}
+ */
+const _childaddedEvent = { type: 'childadded', child: null };
+
+/**
+ * Fires when a child object has been removed.
+ *
+ * @event Object3D#childremoved
+ * @type {Object}
+ */
+const _childremovedEvent = { type: 'childremoved', child: null };
+
+/**
+ * This is the base class for most objects in three.js and provides a set of
+ * properties and methods for manipulating objects in 3D space.
+ *
+ * @augments EventDispatcher
+ */
+class Object3D extends EventDispatcher {
+
+	/**
+	 * Constructs a new 3D object.
+	 */
+	constructor() {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isObject3D = true;
+
+		/**
+		 * The ID of the 3D object.
+		 *
+		 * @name Object3D#id
+		 * @type {number}
+		 * @readonly
+		 */
+		Object.defineProperty( this, 'id', { value: _object3DId ++ } );
+
+		/**
+		 * The UUID of the 3D object.
+		 *
+		 * @type {string}
+		 * @readonly
+		 */
+		this.uuid = generateUUID();
+
+		/**
+		 * The name of the 3D object.
+		 *
+		 * @type {string}
+		 */
+		this.name = '';
+
+		/**
+		 * The type property is used for detecting the object type
+		 * in context of serialization/deserialization.
+		 *
+		 * @type {string}
+		 * @readonly
+		 */
+		this.type = 'Object3D';
+
+		/**
+		 * A reference to the parent object.
+		 *
+		 * @type {?Object3D}
+		 * @default null
+		 */
+		this.parent = null;
+
+		/**
+		 * An array holding the child 3D objects of this instance.
+		 *
+		 * @type {Array<Object3D>}
+		 */
+		this.children = [];
+
+		/**
+		 * Defines the `up` direction of the 3D object which influences
+		 * the orientation via methods like {@link Object3D#lookAt}.
+		 *
+		 * The default values for all 3D objects is defined by `Object3D.DEFAULT_UP`.
+		 *
+		 * @type {Vector3}
+		 */
+		this.up = Object3D.DEFAULT_UP.clone();
+
+		const position = new Vector3();
+		const rotation = new Euler();
+		const quaternion = new Quaternion();
+		const scale = new Vector3( 1, 1, 1 );
+
+		function onRotationChange() {
+
+			quaternion.setFromEuler( rotation, false );
+
+		}
+
+		function onQuaternionChange() {
+
+			rotation.setFromQuaternion( quaternion, undefined, false );
+
+		}
+
+		rotation._onChange( onRotationChange );
+		quaternion._onChange( onQuaternionChange );
+
+		Object.defineProperties( this, {
+			/**
+			 * Represents the object's local position.
+			 *
+			 * @name Object3D#position
+			 * @type {Vector3}
+			 * @default (0,0,0)
+			 */
+			position: {
+				configurable: true,
+				enumerable: true,
+				value: position
+			},
+			/**
+			 * Represents the object's local rotation as Euler angles, in radians.
+			 *
+			 * @name Object3D#rotation
+			 * @type {Euler}
+			 * @default (0,0,0)
+			 */
+			rotation: {
+				configurable: true,
+				enumerable: true,
+				value: rotation
+			},
+			/**
+			 * Represents the object's local rotation as Quaternions.
+			 *
+			 * @name Object3D#quaternion
+			 * @type {Quaternion}
+			 */
+			quaternion: {
+				configurable: true,
+				enumerable: true,
+				value: quaternion
+			},
+			/**
+			 * Represents the object's local scale.
+			 *
+			 * @name Object3D#scale
+			 * @type {Vector3}
+			 * @default (1,1,1)
+			 */
+			scale: {
+				configurable: true,
+				enumerable: true,
+				value: scale
+			},
+			/**
+			 * Represents the object's model-view matrix.
+			 *
+			 * @name Object3D#modelViewMatrix
+			 * @type {Matrix4}
+			 */
+			modelViewMatrix: {
+				value: new Matrix4()
+			},
+			/**
+			 * Represents the object's normal matrix.
+			 *
+			 * @name Object3D#normalMatrix
+			 * @type {Matrix3}
+			 */
+			normalMatrix: {
+				value: new Matrix3()
+			}
+		} );
+
+		/**
+		 * Represents the object's transformation matrix in local space.
+		 *
+		 * @type {Matrix4}
+		 */
+		this.matrix = new Matrix4();
+
+		/**
+		 * Represents the object's transformation matrix in world space.
+		 * If the 3D object has no parent, then it's identical to the local transformation matrix
+		 *
+		 * @type {Matrix4}
+		 */
+		this.matrixWorld = new Matrix4();
+
+		/**
+		 * When set to `true`, the engine automatically computes the local matrix from position,
+		 * rotation and scale every frame. If set to `false`, the app is responsible for recomputing
+		 * the local matrix by calling `updateMatrix()`.
+		 *
+		 * The default values for all 3D objects is defined by `Object3D.DEFAULT_MATRIX_AUTO_UPDATE`.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.matrixAutoUpdate = Object3D.DEFAULT_MATRIX_AUTO_UPDATE;
+
+		/**
+		 * When set to `true`, the engine automatically computes the world matrix from the current local
+		 * matrix and the object's transformation hierarchy. If set to `false`, the app is responsible for
+		 * recomputing the world matrix by directly updating the `matrixWorld` property.
+		 *
+		 * The default values for all 3D objects is defined by `Object3D.DEFAULT_MATRIX_WORLD_AUTO_UPDATE`.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.matrixWorldAutoUpdate = Object3D.DEFAULT_MATRIX_WORLD_AUTO_UPDATE; // checked by the renderer
+
+		/**
+		 * When set to `true`, it calculates the world matrix in that frame and resets this property
+		 * to `false`.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.matrixWorldNeedsUpdate = false;
+
+		/**
+		 * The layer membership of the 3D object. The 3D object is only visible if it has
+		 * at least one layer in common with the camera in use. This property can also be
+		 * used to filter out unwanted objects in ray-intersection tests when using {@link Raycaster}.
+		 *
+		 * @type {Layers}
+		 */
+		this.layers = new Layers();
+
+		/**
+		 * When set to `true`, the 3D object gets rendered.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.visible = true;
+
+		/**
+		 * When set to `true`, the 3D object gets rendered into shadow maps.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.castShadow = false;
+
+		/**
+		 * When set to `true`, the 3D object is affected by shadows in the scene.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.receiveShadow = false;
+
+		/**
+		 * When set to `true`, the 3D object is honored by view frustum culling.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.frustumCulled = true;
+
+		/**
+		 * This value allows the default rendering order of scene graph objects to be
+		 * overridden although opaque and transparent objects remain sorted independently.
+		 * When this property is set for an instance of {@link Group},all descendants
+		 * objects will be sorted and rendered together. Sorting is from lowest to highest
+		 * render order.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.renderOrder = 0;
+
+		/**
+		 * An array holding the animation clips of the 3D object.
+		 *
+		 * @type {Array<AnimationClip>}
+		 */
+		this.animations = [];
+
+		/**
+		 * Custom depth material to be used when rendering to the depth map. Can only be used
+		 * in context of meshes. When shadow-casting with a {@link DirectionalLight} or {@link SpotLight},
+		 * if you are modifying vertex positions in the vertex shader you must specify a custom depth
+		 * material for proper shadows.
+		 *
+		 * Only relevant in context of {@link WebGLRenderer}.
+		 *
+		 * @type {(Material|undefined)}
+		 * @default undefined
+		 */
+		this.customDepthMaterial = undefined;
+
+		/**
+		 * Same as {@link Object3D#customDepthMaterial}, but used with {@link PointLight}.
+		 *
+		 * Only relevant in context of {@link WebGLRenderer}.
+		 *
+		 * @type {(Material|undefined)}
+		 * @default undefined
+		 */
+		this.customDistanceMaterial = undefined;
+
+		/**
+		 * Whether the 3D object is supposed to be static or not. If set to `true`, it means
+		 * the 3D object is not going to be changed after the initial renderer. This includes
+		 * geometry and material settings. A static 3D object can be processed by the renderer
+		 * slightly faster since certain state checks can be bypassed.
+		 *
+		 * Only relevant in context of {@link WebGPURenderer}.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.static = false;
+
+		/**
+		 * An object that can be used to store custom data about the 3D object. It
+		 * should not hold references to functions as these will not be cloned.
+		 *
+		 * @type {Object}
+		 */
+		this.userData = {};
+
+		/**
+		 * The pivot point for rotation and scale transformations.
+		 * When set, rotation and scale are applied around this point
+		 * instead of the object's origin.
+		 *
+		 * @type {?Vector3}
+		 * @default null
+		 */
+		this.pivot = null;
+
+	}
+
+	/**
+	 * A callback that is executed immediately before a 3D object is rendered to a shadow map.
+	 *
+	 * @param {Renderer|WebGLRenderer} renderer - The renderer.
+	 * @param {Object3D} object - The 3D object.
+	 * @param {Camera} camera - The camera that is used to render the scene.
+	 * @param {Camera} shadowCamera - The shadow camera.
+	 * @param {BufferGeometry} geometry - The 3D object's geometry.
+	 * @param {Material} depthMaterial - The depth material.
+	 * @param {Object} group - The geometry group data.
+	 */
+	onBeforeShadow( /* renderer, object, camera, shadowCamera, geometry, depthMaterial, group */ ) {}
+
+	/**
+	 * A callback that is executed immediately after a 3D object is rendered to a shadow map.
+	 *
+	 * @param {Renderer|WebGLRenderer} renderer - The renderer.
+	 * @param {Object3D} object - The 3D object.
+	 * @param {Camera} camera - The camera that is used to render the scene.
+	 * @param {Camera} shadowCamera - The shadow camera.
+	 * @param {BufferGeometry} geometry - The 3D object's geometry.
+	 * @param {Material} depthMaterial - The depth material.
+	 * @param {Object} group - The geometry group data.
+	 */
+	onAfterShadow( /* renderer, object, camera, shadowCamera, geometry, depthMaterial, group */ ) {}
+
+	/**
+	 * A callback that is executed immediately before a 3D object is rendered.
+	 *
+	 * @param {Renderer|WebGLRenderer} renderer - The renderer.
+	 * @param {Object3D} object - The 3D object.
+	 * @param {Camera} camera - The camera that is used to render the scene.
+	 * @param {BufferGeometry} geometry - The 3D object's geometry.
+	 * @param {Material} material - The 3D object's material.
+	 * @param {Object} group - The geometry group data.
+	 */
+	onBeforeRender( /* renderer, scene, camera, geometry, material, group */ ) {}
+
+	/**
+	 * A callback that is executed immediately after a 3D object is rendered.
+	 *
+	 * @param {Renderer|WebGLRenderer} renderer - The renderer.
+	 * @param {Object3D} object - The 3D object.
+	 * @param {Camera} camera - The camera that is used to render the scene.
+	 * @param {BufferGeometry} geometry - The 3D object's geometry.
+	 * @param {Material} material - The 3D object's material.
+	 * @param {Object} group - The geometry group data.
+	 */
+	onAfterRender( /* renderer, scene, camera, geometry, material, group */ ) {}
+
+	/**
+	 * Applies the given transformation matrix to the object and updates the object's position,
+	 * rotation and scale.
+	 *
+	 * @param {Matrix4} matrix - The transformation matrix.
+	 */
+	applyMatrix4( matrix ) {
+
+		if ( this.matrixAutoUpdate ) this.updateMatrix();
+
+		this.matrix.premultiply( matrix );
+
+		this.matrix.decompose( this.position, this.quaternion, this.scale );
+
+	}
+
+	/**
+	 * Applies a rotation represented by given the quaternion to the 3D object.
+	 *
+	 * @param {Quaternion} q - The quaternion.
+	 * @return {Object3D} A reference to this instance.
+	 */
+	applyQuaternion( q ) {
+
+		this.quaternion.premultiply( q );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the given rotation represented as an axis/angle couple to the 3D object.
+	 *
+	 * @param {Vector3} axis - The (normalized) axis vector.
+	 * @param {number} angle - The angle in radians.
+	 */
+	setRotationFromAxisAngle( axis, angle ) {
+
+		// assumes axis is normalized
+
+		this.quaternion.setFromAxisAngle( axis, angle );
+
+	}
+
+	/**
+	 * Sets the given rotation represented as Euler angles to the 3D object.
+	 *
+	 * @param {Euler} euler - The Euler angles.
+	 */
+	setRotationFromEuler( euler ) {
+
+		this.quaternion.setFromEuler( euler, true );
+
+	}
+
+	/**
+	 * Sets the given rotation represented as rotation matrix to the 3D object.
+	 *
+	 * @param {Matrix4} m - Although a 4x4 matrix is expected, the upper 3x3 portion must be
+	 * a pure rotation matrix (i.e, unscaled).
+	 */
+	setRotationFromMatrix( m ) {
+
+		// assumes the upper 3x3 of m is a pure rotation matrix (i.e, unscaled)
+
+		this.quaternion.setFromRotationMatrix( m );
+
+	}
+
+	/**
+	 * Sets the given rotation represented as a Quaternion to the 3D object.
+	 *
+	 * @param {Quaternion} q - The Quaternion
+	 */
+	setRotationFromQuaternion( q ) {
+
+		// assumes q is normalized
+
+		this.quaternion.copy( q );
+
+	}
+
+	/**
+	 * Rotates the 3D object along an axis in local space.
+	 *
+	 * @param {Vector3} axis - The (normalized) axis vector.
+	 * @param {number} angle - The angle in radians.
+	 * @return {Object3D} A reference to this instance.
+	 */
+	rotateOnAxis( axis, angle ) {
+
+		// rotate object on axis in object space
+		// axis is assumed to be normalized
+
+		_q1.setFromAxisAngle( axis, angle );
+
+		this.quaternion.multiply( _q1 );
+
+		return this;
+
+	}
+
+	/**
+	 * Rotates the 3D object along an axis in world space.
+	 *
+	 * @param {Vector3} axis - The (normalized) axis vector.
+	 * @param {number} angle - The angle in radians.
+	 * @return {Object3D} A reference to this instance.
+	 */
+	rotateOnWorldAxis( axis, angle ) {
+
+		// rotate object on axis in world space
+		// axis is assumed to be normalized
+		// method assumes no rotated parent
+
+		_q1.setFromAxisAngle( axis, angle );
+
+		this.quaternion.premultiply( _q1 );
+
+		return this;
+
+	}
+
+	/**
+	 * Rotates the 3D object around its X axis in local space.
+	 *
+	 * @param {number} angle - The angle in radians.
+	 * @return {Object3D} A reference to this instance.
+	 */
+	rotateX( angle ) {
+
+		return this.rotateOnAxis( _xAxis, angle );
+
+	}
+
+	/**
+	 * Rotates the 3D object around its Y axis in local space.
+	 *
+	 * @param {number} angle - The angle in radians.
+	 * @return {Object3D} A reference to this instance.
+	 */
+	rotateY( angle ) {
+
+		return this.rotateOnAxis( _yAxis, angle );
+
+	}
+
+	/**
+	 * Rotates the 3D object around its Z axis in local space.
+	 *
+	 * @param {number} angle - The angle in radians.
+	 * @return {Object3D} A reference to this instance.
+	 */
+	rotateZ( angle ) {
+
+		return this.rotateOnAxis( _zAxis, angle );
+
+	}
+
+	/**
+	 * Translate the 3D object by a distance along the given axis in local space.
+	 *
+	 * @param {Vector3} axis - The (normalized) axis vector.
+	 * @param {number} distance - The distance in world units.
+	 * @return {Object3D} A reference to this instance.
+	 */
+	translateOnAxis( axis, distance ) {
+
+		// translate object by distance along axis in object space
+		// axis is assumed to be normalized
+
+		_v1$6.copy( axis ).applyQuaternion( this.quaternion );
+
+		this.position.add( _v1$6.multiplyScalar( distance ) );
+
+		return this;
+
+	}
+
+	/**
+	 * Translate the 3D object by a distance along its X-axis in local space.
+	 *
+	 * @param {number} distance - The distance in world units.
+	 * @return {Object3D} A reference to this instance.
+	 */
+	translateX( distance ) {
+
+		return this.translateOnAxis( _xAxis, distance );
+
+	}
+
+	/**
+	 * Translate the 3D object by a distance along its Y-axis in local space.
+	 *
+	 * @param {number} distance - The distance in world units.
+	 * @return {Object3D} A reference to this instance.
+	 */
+	translateY( distance ) {
+
+		return this.translateOnAxis( _yAxis, distance );
+
+	}
+
+	/**
+	 * Translate the 3D object by a distance along its Z-axis in local space.
+	 *
+	 * @param {number} distance - The distance in world units.
+	 * @return {Object3D} A reference to this instance.
+	 */
+	translateZ( distance ) {
+
+		return this.translateOnAxis( _zAxis, distance );
+
+	}
+
+	/**
+	 * Converts the given vector from this 3D object's local space to world space.
+	 *
+	 * @param {Vector3} vector - The vector to convert.
+	 * @return {Vector3} The converted vector.
+	 */
+	localToWorld( vector ) {
+
+		this.updateWorldMatrix( true, false );
+
+		return vector.applyMatrix4( this.matrixWorld );
+
+	}
+
+	/**
+	 * Converts the given vector from this 3D object's world space to local space.
+	 *
+	 * @param {Vector3} vector - The vector to convert.
+	 * @return {Vector3} The converted vector.
+	 */
+	worldToLocal( vector ) {
+
+		this.updateWorldMatrix( true, false );
+
+		return vector.applyMatrix4( _m1$1.copy( this.matrixWorld ).invert() );
+
+	}
+
+	/**
+	 * Rotates the object to face a point in world space.
+	 *
+	 * This method does not support objects having non-uniformly-scaled parent(s).
+	 *
+	 * @param {number|Vector3} x - The x coordinate in world space. Alternatively, a vector representing a position in world space
+	 * @param {number} [y] - The y coordinate in world space.
+	 * @param {number} [z] - The z coordinate in world space.
+	 */
+	lookAt( x, y, z ) {
+
+		// This method does not support objects having non-uniformly-scaled parent(s)
+
+		if ( x.isVector3 ) {
+
+			_target.copy( x );
+
+		} else {
+
+			_target.set( x, y, z );
+
+		}
+
+		const parent = this.parent;
+
+		this.updateWorldMatrix( true, false );
+
+		_position$4.setFromMatrixPosition( this.matrixWorld );
+
+		if ( this.isCamera || this.isLight ) {
+
+			_m1$1.lookAt( _position$4, _target, this.up );
+
+		} else {
+
+			_m1$1.lookAt( _target, _position$4, this.up );
+
+		}
+
+		this.quaternion.setFromRotationMatrix( _m1$1 );
+
+		if ( parent ) {
+
+			_m1$1.extractRotation( parent.matrixWorld );
+			_q1.setFromRotationMatrix( _m1$1 );
+			this.quaternion.premultiply( _q1.invert() );
+
+		}
+
+	}
+
+	/**
+	 * Adds the given 3D object as a child to this 3D object. An arbitrary number of
+	 * objects may be added. Any current parent on an object passed in here will be
+	 * removed, since an object can have at most one parent.
+	 *
+	 * @fires Object3D#added
+	 * @fires Object3D#childadded
+	 * @param {Object3D} object - The 3D object to add.
+	 * @return {Object3D} A reference to this instance.
+	 */
+	add( object ) {
+
+		if ( arguments.length > 1 ) {
+
+			for ( let i = 0; i < arguments.length; i ++ ) {
+
+				this.add( arguments[ i ] );
+
+			}
+
+			return this;
+
+		}
+
+		if ( object === this ) {
+
+			error( 'Object3D.add: object can\'t be added as a child of itself.', object );
+			return this;
+
+		}
+
+		if ( object && object.isObject3D ) {
+
+			object.removeFromParent();
+			object.parent = this;
+			this.children.push( object );
+
+			object.dispatchEvent( _addedEvent );
+
+			_childaddedEvent.child = object;
+			this.dispatchEvent( _childaddedEvent );
+			_childaddedEvent.child = null;
+
+		} else {
+
+			error( 'Object3D.add: object not an instance of THREE.Object3D.', object );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Removes the given 3D object as child from this 3D object.
+	 * An arbitrary number of objects may be removed.
+	 *
+	 * @fires Object3D#removed
+	 * @fires Object3D#childremoved
+	 * @param {Object3D} object - The 3D object to remove.
+	 * @return {Object3D} A reference to this instance.
+	 */
+	remove( object ) {
+
+		if ( arguments.length > 1 ) {
+
+			for ( let i = 0; i < arguments.length; i ++ ) {
+
+				this.remove( arguments[ i ] );
+
+			}
+
+			return this;
+
+		}
+
+		const index = this.children.indexOf( object );
+
+		if ( index !== -1 ) {
+
+			object.parent = null;
+			this.children.splice( index, 1 );
+
+			object.dispatchEvent( _removedEvent );
+
+			_childremovedEvent.child = object;
+			this.dispatchEvent( _childremovedEvent );
+			_childremovedEvent.child = null;
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Removes this 3D object from its current parent.
+	 *
+	 * @fires Object3D#removed
+	 * @fires Object3D#childremoved
+	 * @return {Object3D} A reference to this instance.
+	 */
+	removeFromParent() {
+
+		const parent = this.parent;
+
+		if ( parent !== null ) {
+
+			parent.remove( this );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Removes all child objects.
+	 *
+	 * @fires Object3D#removed
+	 * @fires Object3D#childremoved
+	 * @return {Object3D} A reference to this instance.
+	 */
+	clear() {
+
+		return this.remove( ... this.children );
+
+	}
+
+	/**
+	 * Adds the given 3D object as a child of this 3D object, while maintaining the object's world
+	 * transform. This method does not support scene graphs having non-uniformly-scaled nodes(s).
+	 *
+	 * @fires Object3D#added
+	 * @fires Object3D#childadded
+	 * @param {Object3D} object - The 3D object to attach.
+	 * @return {Object3D} A reference to this instance.
+	 */
+	attach( object ) {
+
+		// adds object as a child of this, while maintaining the object's world transform
+
+		// Note: This method does not support scene graphs having non-uniformly-scaled nodes(s)
+
+		this.updateWorldMatrix( true, false );
+
+		_m1$1.copy( this.matrixWorld ).invert();
+
+		if ( object.parent !== null ) {
+
+			object.parent.updateWorldMatrix( true, false );
+
+			_m1$1.multiply( object.parent.matrixWorld );
+
+		}
+
+		object.applyMatrix4( _m1$1 );
+
+		object.removeFromParent();
+		object.parent = this;
+		this.children.push( object );
+
+		object.updateWorldMatrix( false, true );
+
+		object.dispatchEvent( _addedEvent );
+
+		_childaddedEvent.child = object;
+		this.dispatchEvent( _childaddedEvent );
+		_childaddedEvent.child = null;
+
+		return this;
+
+	}
+
+	/**
+	 * Searches through the 3D object and its children, starting with the 3D object
+	 * itself, and returns the first with a matching ID.
+	 *
+	 * @param {number} id - The id.
+	 * @return {Object3D|undefined} The found 3D object. Returns `undefined` if no 3D object has been found.
+	 */
+	getObjectById( id ) {
+
+		return this.getObjectByProperty( 'id', id );
+
+	}
+
+	/**
+	 * Searches through the 3D object and its children, starting with the 3D object
+	 * itself, and returns the first with a matching name.
+	 *
+	 * @param {string} name - The name.
+	 * @return {Object3D|undefined} The found 3D object. Returns `undefined` if no 3D object has been found.
+	 */
+	getObjectByName( name ) {
+
+		return this.getObjectByProperty( 'name', name );
+
+	}
+
+	/**
+	 * Searches through the 3D object and its children, starting with the 3D object
+	 * itself, and returns the first with a matching property value.
+	 *
+	 * @param {string} name - The name of the property.
+	 * @param {any} value - The value.
+	 * @return {Object3D|undefined} The found 3D object. Returns `undefined` if no 3D object has been found.
+	 */
+	getObjectByProperty( name, value ) {
+
+		if ( this[ name ] === value ) return this;
+
+		for ( let i = 0, l = this.children.length; i < l; i ++ ) {
+
+			const child = this.children[ i ];
+			const object = child.getObjectByProperty( name, value );
+
+			if ( object !== undefined ) {
+
+				return object;
+
+			}
+
+		}
+
+		return undefined;
+
+	}
+
+	/**
+	 * Searches through the 3D object and its children, starting with the 3D object
+	 * itself, and returns all 3D objects with a matching property value.
+	 *
+	 * @param {string} name - The name of the property.
+	 * @param {any} value - The value.
+	 * @param {Array<Object3D>} result - The method stores the result in this array.
+	 * @return {Array<Object3D>} The found 3D objects.
+	 */
+	getObjectsByProperty( name, value, result = [] ) {
+
+		if ( this[ name ] === value ) result.push( this );
+
+		const children = this.children;
+
+		for ( let i = 0, l = children.length; i < l; i ++ ) {
+
+			children[ i ].getObjectsByProperty( name, value, result );
+
+		}
+
+		return result;
+
+	}
+
+	/**
+	 * Returns a vector representing the position of the 3D object in world space.
+	 *
+	 * @param {Vector3} target - The target vector the result is stored to.
+	 * @return {Vector3} The 3D object's position in world space.
+	 */
+	getWorldPosition( target ) {
+
+		this.updateWorldMatrix( true, false );
+
+		return target.setFromMatrixPosition( this.matrixWorld );
+
+	}
+
+	/**
+	 * Returns a Quaternion representing the position of the 3D object in world space.
+	 *
+	 * @param {Quaternion} target - The target Quaternion the result is stored to.
+	 * @return {Quaternion} The 3D object's rotation in world space.
+	 */
+	getWorldQuaternion( target ) {
+
+		this.updateWorldMatrix( true, false );
+
+		this.matrixWorld.decompose( _position$4, target, _scale$3 );
+
+		return target;
+
+	}
+
+	/**
+	 * Returns a vector representing the scale of the 3D object in world space.
+	 *
+	 * @param {Vector3} target - The target vector the result is stored to.
+	 * @return {Vector3} The 3D object's scale in world space.
+	 */
+	getWorldScale( target ) {
+
+		this.updateWorldMatrix( true, false );
+
+		this.matrixWorld.decompose( _position$4, _quaternion$3, target );
+
+		return target;
+
+	}
+
+	/**
+	 * Returns a vector representing the ("look") direction of the 3D object in world space.
+	 *
+	 * @param {Vector3} target - The target vector the result is stored to.
+	 * @return {Vector3} The 3D object's direction in world space.
+	 */
+	getWorldDirection( target ) {
+
+		this.updateWorldMatrix( true, false );
+
+		const e = this.matrixWorld.elements;
+
+		return target.set( e[ 8 ], e[ 9 ], e[ 10 ] ).normalize();
+
+	}
+
+	/**
+	 * Abstract method to get intersections between a casted ray and this
+	 * 3D object. Renderable 3D objects such as {@link Mesh}, {@link Line} or {@link Points}
+	 * implement this method in order to use raycasting.
+	 *
+	 * @abstract
+	 * @param {Raycaster} raycaster - The raycaster.
+	 * @param {Array<Object>} intersects - An array holding the result of the method.
+	 */
+	raycast( /* raycaster, intersects */ ) {}
+
+	/**
+	 * Abstract method to test whether this 3D object intersects the given frustum.
+	 * Renderable 3D objects such as {@link Mesh}, {@link Line} or {@link Points}
+	 * implement this method in order to use frustum culling.
+	 *
+	 * @abstract
+	 * @param {Frustum|FrustumArray} frustum - The frustum to test.
+	 * @return {boolean|undefined} Whether this 3D object intersects the given frustum or not.
+	 */
+	intersectsFrustum( /* frustum */ ) {}
+
+	/**
+	 * Executes the callback on this 3D object and all descendants.
+	 *
+	 * Note: Modifying the scene graph inside the callback is discouraged.
+	 *
+	 * @param {Function} callback - A callback function that allows to process the current 3D object.
+	 */
+	traverse( callback ) {
+
+		callback( this );
+
+		const children = this.children;
+
+		for ( let i = 0, l = children.length; i < l; i ++ ) {
+
+			children[ i ].traverse( callback );
+
+		}
+
+	}
+
+	/**
+	 * Like {@link Object3D#traverse}, but the callback will only be executed for visible 3D objects.
+	 * Descendants of invisible 3D objects are not traversed.
+	 *
+	 * Note: Modifying the scene graph inside the callback is discouraged.
+	 *
+	 * @param {Function} callback - A callback function that allows to process the current 3D object.
+	 */
+	traverseVisible( callback ) {
+
+		if ( this.visible === false ) return;
+
+		callback( this );
+
+		const children = this.children;
+
+		for ( let i = 0, l = children.length; i < l; i ++ ) {
+
+			children[ i ].traverseVisible( callback );
+
+		}
+
+	}
+
+	/**
+	 * Like {@link Object3D#traverse}, but the callback will only be executed for all ancestors.
+	 *
+	 * Note: Modifying the scene graph inside the callback is discouraged.
+	 *
+	 * @param {Function} callback - A callback function that allows to process the current 3D object.
+	 */
+	traverseAncestors( callback ) {
+
+		const parent = this.parent;
+
+		if ( parent !== null ) {
+
+			callback( parent );
+
+			parent.traverseAncestors( callback );
+
+		}
+
+	}
+
+	/**
+	 * Updates the transformation matrix in local space by computing it from the current
+	 * position, rotation and scale values.
+	 */
+	updateMatrix() {
+
+		this.matrix.compose( this.position, this.quaternion, this.scale );
+
+		const pivot = this.pivot;
+
+		if ( pivot !== null ) {
+
+			const px = pivot.x, py = pivot.y, pz = pivot.z;
+			const te = this.matrix.elements;
+
+			te[ 12 ] += px - te[ 0 ] * px - te[ 4 ] * py - te[ 8 ] * pz;
+			te[ 13 ] += py - te[ 1 ] * px - te[ 5 ] * py - te[ 9 ] * pz;
+			te[ 14 ] += pz - te[ 2 ] * px - te[ 6 ] * py - te[ 10 ] * pz;
+
+		}
+
+		this.matrixWorldNeedsUpdate = true;
+
+	}
+
+	/**
+	 * Updates the transformation matrix in world space of this 3D objects and its descendants.
+	 *
+	 * To ensure correct results, this method also recomputes the 3D object's transformation matrix in
+	 * local space. The computation of the local and world matrix can be controlled with the
+	 * {@link Object3D#matrixAutoUpdate} and {@link Object3D#matrixWorldAutoUpdate} flags which are both
+	 * `true` by default.  Set these flags to `false` if you need more control over the update matrix process.
+	 *
+	 * @param {boolean} [force=false] - When set to `true`, a recomputation of world matrices is forced even
+	 * when {@link Object3D#matrixWorldNeedsUpdate} is `false`.
+	 */
+	updateMatrixWorld( force ) {
+
+		if ( this.matrixAutoUpdate ) this.updateMatrix();
+
+		if ( this.matrixWorldNeedsUpdate || force ) {
+
+			if ( this.matrixWorldAutoUpdate === true ) {
+
+				if ( this.parent === null ) {
+
+					this.matrixWorld.copy( this.matrix );
+
+				} else {
+
+					this.matrixWorld.multiplyMatrices( this.parent.matrixWorld, this.matrix );
+
+				}
+
+			}
+
+			this.matrixWorldNeedsUpdate = false;
+
+			force = true;
+
+		}
+
+		// make sure descendants are updated if required
+
+		const children = this.children;
+
+		for ( let i = 0, l = children.length; i < l; i ++ ) {
+
+			const child = children[ i ];
+
+			child.updateMatrixWorld( force );
+
+		}
+
+	}
+
+	/**
+	 * An alternative version of {@link Object3D#updateMatrixWorld} with more control over the
+	 * update of ancestor and descendant nodes.
+	 *
+	 * @param {boolean} [updateParents=false] Whether ancestor nodes should be updated or not.
+	 * @param {boolean} [updateChildren=false] Whether descendant nodes should be updated or not.
+	 * @param {boolean} [force=false] - When set to `true`, a recomputation of world matrices is forced even
+	 * when {@link Object3D#matrixWorldNeedsUpdate} is `false`.
+	 */
+	updateWorldMatrix( updateParents, updateChildren, force = false ) {
+
+		const parent = this.parent;
+
+		if ( updateParents === true && parent !== null ) {
+
+			parent.updateWorldMatrix( true, false );
+
+		}
+
+		if ( this.matrixAutoUpdate ) this.updateMatrix();
+
+		if ( this.matrixWorldNeedsUpdate || force ) {
+
+			if ( this.matrixWorldAutoUpdate === true ) {
+
+				if ( this.parent === null ) {
+
+					this.matrixWorld.copy( this.matrix );
+
+				} else {
+
+					this.matrixWorld.multiplyMatrices( this.parent.matrixWorld, this.matrix );
+
+				}
+
+			}
+
+			this.matrixWorldNeedsUpdate = false;
+
+			force = true;
+
+		}
+
+		// make sure descendants are updated
+
+		if ( updateChildren === true ) {
+
+			const children = this.children;
+
+			for ( let i = 0, l = children.length; i < l; i ++ ) {
+
+				const child = children[ i ];
+
+				child.updateWorldMatrix( false, true, force );
+
+			}
+
+		}
+
+	}
+
+	/**
+	 * Serializes the 3D object into JSON.
+	 *
+	 * @param {?(Object|string)} meta - An optional value holding meta information about the serialization.
+	 * @return {Object} A JSON object representing the serialized 3D object.
+	 * @see {@link ObjectLoader#parse}
+	 */
+	toJSON( meta ) {
+
+		// meta is a string when called from JSON.stringify
+		const isRootObject = ( meta === undefined || typeof meta === 'string' );
+
+		const output = {};
+
+		// meta is a hash used to collect geometries, materials.
+		// not providing it implies that this is the root object
+		// being serialized.
+		if ( isRootObject ) {
+
+			// initialize meta obj
+			meta = {
+				geometries: {},
+				materials: {},
+				textures: {},
+				images: {},
+				shapes: {},
+				skeletons: {},
+				animations: {},
+				nodes: {}
+			};
+
+			output.metadata = {
+				version: 4.7,
+				type: 'Object',
+				generator: 'Object3D.toJSON'
+			};
+
+		}
+
+		// standard Object3D serialization
+
+		const object = {};
+
+		object.uuid = this.uuid;
+		object.type = this.type;
+
+		object.name = this.name;
+		object.castShadow = this.castShadow;
+		object.receiveShadow = this.receiveShadow;
+		object.visible = this.visible;
+		object.frustumCulled = this.frustumCulled;
+		object.renderOrder = this.renderOrder;
+		object.static = this.static;
+		object.matrixAutoUpdate = this.matrixAutoUpdate;
+
+		if ( Object.keys( this.userData ).length > 0 ) object.userData = this.userData;
+
+		object.layers = this.layers.mask;
+		object.matrix = this.matrix.toArray();
+		object.up = this.up.toArray();
+
+		if ( this.pivot !== null ) object.pivot = this.pivot.toArray();
+
+		if ( this.morphTargetDictionary !== undefined ) object.morphTargetDictionary = Object.assign( {}, this.morphTargetDictionary );
+		if ( this.morphTargetInfluences !== undefined ) object.morphTargetInfluences = this.morphTargetInfluences.slice();
+
+		// object specific properties
+
+		if ( this.isInstancedMesh ) {
+
+			object.type = 'InstancedMesh';
+			object.count = this.count;
+			object.instanceMatrix = this.instanceMatrix.toJSON();
+			if ( this.instanceColor !== null ) object.instanceColor = this.instanceColor.toJSON();
+
+		}
+
+		if ( this.isBatchedMesh ) {
+
+			object.type = 'BatchedMesh';
+			object.perObjectFrustumCulled = this.perObjectFrustumCulled;
+			object.sortObjects = this.sortObjects;
+
+			object.drawRanges = this._drawRanges;
+			object.reservedRanges = this._reservedRanges;
+
+			object.geometryInfo = this._geometryInfo.map( info => ( {
+				...info,
+				boundingBox: info.boundingBox ? info.boundingBox.toJSON() : undefined,
+				boundingSphere: info.boundingSphere ? info.boundingSphere.toJSON() : undefined
+			} ) );
+			object.instanceInfo = this._instanceInfo.map( info => ( { ...info } ) );
+
+			object.availableInstanceIds = this._availableInstanceIds.slice();
+			object.availableGeometryIds = this._availableGeometryIds.slice();
+
+			object.nextIndexStart = this._nextIndexStart;
+			object.nextVertexStart = this._nextVertexStart;
+			object.geometryCount = this._geometryCount;
+
+			object.maxInstanceCount = this._maxInstanceCount;
+			object.maxVertexCount = this._maxVertexCount;
+			object.maxIndexCount = this._maxIndexCount;
+
+			object.geometryInitialized = this._geometryInitialized;
+
+			object.matricesTexture = this._matricesTexture.toJSON( meta );
+
+			object.indirectTexture = this._indirectTexture.toJSON( meta );
+
+			if ( this._colorsTexture !== null ) {
+
+				object.colorsTexture = this._colorsTexture.toJSON( meta );
+
+			}
+
+			if ( this.boundingSphere !== null ) {
+
+				object.boundingSphere = this.boundingSphere.toJSON();
+
+			}
+
+			if ( this.boundingBox !== null ) {
+
+				object.boundingBox = this.boundingBox.toJSON();
+
+			}
+
+		}
+
+		//
+
+		function serialize( library, element ) {
+
+			if ( library[ element.uuid ] === undefined ) {
+
+				library[ element.uuid ] = element.toJSON( meta );
+
+			}
+
+			return element.uuid;
+
+		}
+
+		if ( this.isScene ) {
+
+			if ( this.background ) {
+
+				if ( this.background.isColor ) {
+
+					object.background = this.background.toJSON();
+
+				} else if ( this.background.isTexture ) {
+
+					object.background = this.background.toJSON( meta ).uuid;
+
+				}
+
+			}
+
+			if ( this.environment && this.environment.isTexture && this.environment.isRenderTargetTexture !== true ) {
+
+				object.environment = this.environment.toJSON( meta ).uuid;
+
+			}
+
+		} else if ( this.isMesh || this.isLine || this.isPoints ) {
+
+			object.geometry = serialize( meta.geometries, this.geometry );
+
+			const parameters = this.geometry.parameters;
+
+			if ( parameters !== undefined && parameters.shapes !== undefined ) {
+
+				const shapes = parameters.shapes;
+
+				if ( Array.isArray( shapes ) ) {
+
+					for ( let i = 0, l = shapes.length; i < l; i ++ ) {
+
+						const shape = shapes[ i ];
+
+						serialize( meta.shapes, shape );
+
+					}
+
+				} else {
+
+					serialize( meta.shapes, shapes );
+
+				}
+
+			}
+
+		}
+
+		if ( this.isSkinnedMesh ) {
+
+			object.bindMode = this.bindMode;
+			object.bindMatrix = this.bindMatrix.toArray();
+
+			if ( this.skeleton !== undefined ) {
+
+				serialize( meta.skeletons, this.skeleton );
+
+				object.skeleton = this.skeleton.uuid;
+
+			}
+
+		}
+
+		if ( this.material !== undefined ) {
+
+			if ( Array.isArray( this.material ) ) {
+
+				const uuids = [];
+
+				for ( let i = 0, l = this.material.length; i < l; i ++ ) {
+
+					uuids.push( serialize( meta.materials, this.material[ i ] ) );
+
+				}
+
+				object.material = uuids;
+
+			} else {
+
+				object.material = serialize( meta.materials, this.material );
+
+			}
+
+		}
+
+		//
+
+		if ( this.children.length > 0 ) {
+
+			object.children = [];
+
+			for ( let i = 0; i < this.children.length; i ++ ) {
+
+				object.children.push( this.children[ i ].toJSON( meta ).object );
+
+			}
+
+		}
+
+		//
+
+		if ( this.animations.length > 0 ) {
+
+			object.animations = [];
+
+			for ( let i = 0; i < this.animations.length; i ++ ) {
+
+				const animation = this.animations[ i ];
+
+				object.animations.push( serialize( meta.animations, animation ) );
+
+			}
+
+		}
+
+		if ( isRootObject ) {
+
+			const geometries = extractFromCache( meta.geometries );
+			const materials = extractFromCache( meta.materials );
+			const textures = extractFromCache( meta.textures );
+			const images = extractFromCache( meta.images );
+			const shapes = extractFromCache( meta.shapes );
+			const skeletons = extractFromCache( meta.skeletons );
+			const animations = extractFromCache( meta.animations );
+			const nodes = extractFromCache( meta.nodes );
+
+			if ( geometries.length > 0 ) output.geometries = geometries;
+			if ( materials.length > 0 ) output.materials = materials;
+			if ( textures.length > 0 ) output.textures = textures;
+			if ( images.length > 0 ) output.images = images;
+			if ( shapes.length > 0 ) output.shapes = shapes;
+			if ( skeletons.length > 0 ) output.skeletons = skeletons;
+			if ( animations.length > 0 ) output.animations = animations;
+			if ( nodes.length > 0 ) output.nodes = nodes;
+
+		}
+
+		output.object = object;
+
+		return output;
+
+		// extract data from the cache hash
+		// remove metadata on each item
+		// and return as array
+		function extractFromCache( cache ) {
+
+			const values = [];
+			for ( const key in cache ) {
+
+				const data = cache[ key ];
+				delete data.metadata;
+				values.push( data );
+
+			}
+
+			return values;
+
+		}
+
+	}
+
+	/**
+	 * Returns a new 3D object with copied values from this instance.
+	 *
+	 * @param {boolean} [recursive=true] - When set to `true`, descendants of the 3D object are also cloned.
+	 * @return {Object3D} A clone of this instance.
+	 */
+	clone( recursive ) {
+
+		return new this.constructor().copy( this, recursive );
+
+	}
+
+	/**
+	 * Copies the values of the given 3D object to this instance.
+	 *
+	 * @param {Object3D} source - The 3D object to copy.
+	 * @param {boolean} [recursive=true] - When set to `true`, descendants of the 3D object are cloned.
+	 * @return {Object3D} A reference to this instance.
+	 */
+	copy( source, recursive = true ) {
+
+		this.name = source.name;
+
+		this.up.copy( source.up );
+
+		this.position.copy( source.position );
+		this.rotation.order = source.rotation.order;
+		this.quaternion.copy( source.quaternion );
+		this.scale.copy( source.scale );
+
+		this.pivot = ( source.pivot !== null ) ? source.pivot.clone() : null;
+
+		this.matrix.copy( source.matrix );
+		this.matrixWorld.copy( source.matrixWorld );
+
+		this.matrixAutoUpdate = source.matrixAutoUpdate;
+
+		this.matrixWorldAutoUpdate = source.matrixWorldAutoUpdate;
+		this.matrixWorldNeedsUpdate = source.matrixWorldNeedsUpdate;
+
+		this.layers.mask = source.layers.mask;
+		this.visible = source.visible;
+
+		this.castShadow = source.castShadow;
+		this.receiveShadow = source.receiveShadow;
+
+		this.frustumCulled = source.frustumCulled;
+		this.renderOrder = source.renderOrder;
+
+		this.static = source.static;
+
+		this.animations = source.animations.slice();
+
+		this.userData = JSON.parse( JSON.stringify( source.userData ) );
+
+		if ( recursive === true ) {
+
+			for ( let i = 0; i < source.children.length; i ++ ) {
+
+				const child = source.children[ i ];
+				this.add( child.clone() );
+
+			}
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 *
+	 * Geometries, materials and textures are potentially shared with other
+	 * 3D objects and must be disposed of separately.
+	 *
+	 * @fires Object3D#dispose
+	 */
+	dispose() {
+
+		/**
+		 * Fires when the 3D object has been disposed of.
+		 *
+		 * @event Object3D#dispose
+		 * @type {Object}
+		 */
+		this.dispatchEvent( { type: 'dispose' } );
+
+	}
+
+}
+
+/**
+ * The default up direction for objects, also used as the default
+ * position for {@link DirectionalLight} and {@link HemisphereLight}.
+ *
+ * @static
+ * @type {Vector3}
+ * @default (0,1,0)
+ */
+Object3D.DEFAULT_UP = /*@__PURE__*/ new Vector3( 0, 1, 0 );
+
+/**
+ * The default setting for {@link Object3D#matrixAutoUpdate} for
+ * newly created 3D objects.
+ *
+ * @static
+ * @type {boolean}
+ * @default true
+ */
+Object3D.DEFAULT_MATRIX_AUTO_UPDATE = true;
+
+/**
+ * The default setting for {@link Object3D#matrixWorldAutoUpdate} for
+ * newly created 3D objects.
+ *
+ * @static
+ * @type {boolean}
+ * @default true
+ */
+Object3D.DEFAULT_MATRIX_WORLD_AUTO_UPDATE = true;
+
+/**
+ * This is almost identical to an {@link Object3D}. Its purpose is to
+ * make working with groups of objects syntactically clearer.
+ *
+ * ```js
+ * // Create a group and add the two cubes.
+ * // These cubes can now be rotated / scaled etc as a group.
+ * const group = new THREE.Group();
+ *
+ * group.add( meshA );
+ * group.add( meshB );
+ *
+ * scene.add( group );
+ * ```
+ *
+ * @augments Object3D
+ */
+class Group extends Object3D {
+
+	constructor() {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isGroup = true;
+
+		this.type = 'Group';
+
+	}
+
+}
+
+const _moveEvent = { type: 'move' };
+
+/**
+ * Class for representing a XR controller with its
+ * different coordinate systems.
+ *
+ * @private
+ */
+class WebXRController {
+
+	/**
+	 * Constructs a new XR controller.
+	 */
+	constructor() {
+
+		/**
+		 * A group representing the target ray space
+		 * of the XR controller.
+		 *
+		 * @private
+		 * @type {?Group}
+		 * @default null
+		 */
+		this._targetRay = null;
+
+		/**
+		 * A group representing the grip space
+		 * of the XR controller.
+		 *
+		 * @private
+		 * @type {?Group}
+		 * @default null
+		 */
+		this._grip = null;
+
+		/**
+		 * A group representing the hand space
+		 * of the XR controller.
+		 *
+		 * @private
+		 * @type {?Group}
+		 * @default null
+		 */
+		this._hand = null;
+
+	}
+
+	/**
+	 * Returns a group representing the hand space of the XR controller.
+	 *
+	 * @return {Group} A group representing the hand space of the XR controller.
+	 */
+	getHandSpace() {
+
+		if ( this._hand === null ) {
+
+			this._hand = new Group();
+			this._hand.matrixAutoUpdate = false;
+			this._hand.visible = false;
+
+			this._hand.joints = {};
+			this._hand.inputState = { pinching: false };
+
+		}
+
+		return this._hand;
+
+	}
+
+	/**
+	 * Returns a group representing the target ray space of the XR controller.
+	 *
+	 * @return {Group} A group representing the target ray space of the XR controller.
+	 */
+	getTargetRaySpace() {
+
+		if ( this._targetRay === null ) {
+
+			this._targetRay = new Group();
+			this._targetRay.matrixAutoUpdate = false;
+			this._targetRay.visible = false;
+			this._targetRay.hasLinearVelocity = false;
+			this._targetRay.linearVelocity = new Vector3();
+			this._targetRay.hasAngularVelocity = false;
+			this._targetRay.angularVelocity = new Vector3();
+
+		}
+
+		return this._targetRay;
+
+	}
+
+	/**
+	 * Returns a group representing the grip space of the XR controller.
+	 *
+	 * @return {Group} A group representing the grip space of the XR controller.
+	 */
+	getGripSpace() {
+
+		if ( this._grip === null ) {
+
+			this._grip = new Group();
+			this._grip.matrixAutoUpdate = false;
+			this._grip.visible = false;
+			this._grip.hasLinearVelocity = false;
+			this._grip.linearVelocity = new Vector3();
+			this._grip.hasAngularVelocity = false;
+			this._grip.angularVelocity = new Vector3();
+			this._grip.eventsEnabled = false;
+
+		}
+
+		return this._grip;
+
+	}
+
+	/**
+	 * Dispatches the given event to the groups representing
+	 * the different coordinate spaces of the XR controller.
+	 *
+	 * @param {Object} event - The event to dispatch.
+	 * @return {WebXRController} A reference to this instance.
+	 */
+	dispatchEvent( event ) {
+
+		if ( this._targetRay !== null ) {
+
+			this._targetRay.dispatchEvent( event );
+
+		}
+
+		if ( this._grip !== null ) {
+
+			this._grip.dispatchEvent( event );
+
+		}
+
+		if ( this._hand !== null ) {
+
+			this._hand.dispatchEvent( event );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Connects the controller with the given XR input source.
+	 *
+	 * @param {XRInputSource} inputSource - The input source.
+	 * @return {WebXRController} A reference to this instance.
+	 */
+	connect( inputSource ) {
+
+		if ( inputSource && inputSource.hand ) {
+
+			const hand = this._hand;
+
+			if ( hand ) {
+
+				for ( const inputjoint of inputSource.hand.values() ) {
+
+					// Initialize hand with joints when connected
+					this._getHandJoint( hand, inputjoint );
+
+				}
+
+			}
+
+		}
+
+		this.dispatchEvent( { type: 'connected', data: inputSource } );
+
+		return this;
+
+	}
+
+	/**
+	 * Disconnects the controller from the given XR input source.
+	 *
+	 * @param {XRInputSource} inputSource - The input source.
+	 * @return {WebXRController} A reference to this instance.
+	 */
+	disconnect( inputSource ) {
+
+		this.dispatchEvent( { type: 'disconnected', data: inputSource } );
+
+		if ( this._targetRay !== null ) {
+
+			this._targetRay.visible = false;
+
+		}
+
+		if ( this._grip !== null ) {
+
+			this._grip.visible = false;
+
+		}
+
+		if ( this._hand !== null ) {
+
+			this._hand.visible = false;
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Updates the controller with the given input source, XR frame and reference space.
+	 * This updates the transformations of the groups that represent the different
+	 * coordinate systems of the controller.
+	 *
+	 * @param {XRInputSource} inputSource - The input source.
+	 * @param {XRFrame} frame - The XR frame.
+	 * @param {XRReferenceSpace} referenceSpace - The reference space.
+	 * @return {WebXRController} A reference to this instance.
+	 */
+	update( inputSource, frame, referenceSpace ) {
+
+		let inputPose = null;
+		let gripPose = null;
+		let handPose = null;
+
+		const targetRay = this._targetRay;
+		const grip = this._grip;
+		const hand = this._hand;
+
+		if ( inputSource && frame.session.visibilityState !== 'visible-blurred' ) {
+
+			if ( hand && inputSource.hand ) {
+
+				handPose = true;
+
+				for ( const inputjoint of inputSource.hand.values() ) {
+
+					// Update the joints groups with the XRJoint poses
+					const jointPose = frame.getJointPose( inputjoint, referenceSpace );
+
+					// The transform of this joint will be updated with the joint pose on each frame
+					const joint = this._getHandJoint( hand, inputjoint );
+
+					if ( jointPose !== null ) {
+
+						joint.matrix.fromArray( jointPose.transform.matrix );
+						joint.matrix.decompose( joint.position, joint.rotation, joint.scale );
+						joint.matrixWorldNeedsUpdate = true;
+						joint.jointRadius = jointPose.radius;
+
+					}
+
+					joint.visible = jointPose !== null;
+
+				}
+
+				// Custom events
+
+				// Check pinchz
+				const indexTip = hand.joints[ 'index-finger-tip' ];
+				const thumbTip = hand.joints[ 'thumb-tip' ];
+				const distance = indexTip.position.distanceTo( thumbTip.position );
+
+				const distanceToPinch = 0.02;
+				const threshold = 0.005;
+
+				if ( hand.inputState.pinching && distance > distanceToPinch + threshold ) {
+
+					hand.inputState.pinching = false;
+					this.dispatchEvent( {
+						type: 'pinchend',
+						handedness: inputSource.handedness,
+						target: this
+					} );
+
+				} else if ( ! hand.inputState.pinching && distance <= distanceToPinch - threshold ) {
+
+					hand.inputState.pinching = true;
+					this.dispatchEvent( {
+						type: 'pinchstart',
+						handedness: inputSource.handedness,
+						target: this
+					} );
+
+				}
+
+			} else {
+
+				if ( grip !== null && inputSource.gripSpace ) {
+
+					gripPose = frame.getPose( inputSource.gripSpace, referenceSpace );
+
+					if ( gripPose !== null ) {
+
+						grip.matrix.fromArray( gripPose.transform.matrix );
+						grip.matrix.decompose( grip.position, grip.rotation, grip.scale );
+						grip.matrixWorldNeedsUpdate = true;
+
+						if ( gripPose.linearVelocity ) {
+
+							grip.hasLinearVelocity = true;
+							grip.linearVelocity.copy( gripPose.linearVelocity );
+
+						} else {
+
+							grip.hasLinearVelocity = false;
+
+						}
+
+						if ( gripPose.angularVelocity ) {
+
+							grip.hasAngularVelocity = true;
+							grip.angularVelocity.copy( gripPose.angularVelocity );
+
+						} else {
+
+							grip.hasAngularVelocity = false;
+
+						}
+
+						// grip update event if enabled
+						if ( grip.eventsEnabled ) {
+
+							grip.dispatchEvent( {
+								type: 'gripUpdated',
+								data: inputSource,
+								target: this
+							} );
+
+						}
+
+					}
+
+				}
+
+			}
+
+			if ( targetRay !== null ) {
+
+				inputPose = frame.getPose( inputSource.targetRaySpace, referenceSpace );
+
+				// Some runtimes (namely Vive Cosmos with Vive OpenXR Runtime) have only grip space and ray space is equal to it
+				if ( inputPose === null && gripPose !== null ) {
+
+					inputPose = gripPose;
+
+				}
+
+				if ( inputPose !== null ) {
+
+					targetRay.matrix.fromArray( inputPose.transform.matrix );
+					targetRay.matrix.decompose( targetRay.position, targetRay.rotation, targetRay.scale );
+					targetRay.matrixWorldNeedsUpdate = true;
+
+					if ( inputPose.linearVelocity ) {
+
+						targetRay.hasLinearVelocity = true;
+						targetRay.linearVelocity.copy( inputPose.linearVelocity );
+
+					} else {
+
+						targetRay.hasLinearVelocity = false;
+
+					}
+
+					if ( inputPose.angularVelocity ) {
+
+						targetRay.hasAngularVelocity = true;
+						targetRay.angularVelocity.copy( inputPose.angularVelocity );
+
+					} else {
+
+						targetRay.hasAngularVelocity = false;
+
+					}
+
+					this.dispatchEvent( _moveEvent );
+
+				}
+
+			}
+
+
+		}
+
+		if ( targetRay !== null ) {
+
+			targetRay.visible = ( inputPose !== null );
+
+		}
+
+		if ( grip !== null ) {
+
+			grip.visible = ( gripPose !== null );
+
+		}
+
+		if ( hand !== null ) {
+
+			hand.visible = ( handPose !== null );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a group representing the hand joint for the given input joint.
+	 *
+	 * @private
+	 * @param {Group} hand - The group representing the hand space.
+	 * @param {XRJointSpace} inputjoint - The hand joint data.
+	 * @return {Group} A group representing the hand joint for the given input joint.
+	 */
+	_getHandJoint( hand, inputjoint ) {
+
+		if ( hand.joints[ inputjoint.jointName ] === undefined ) {
+
+			const joint = new Group();
+			joint.matrixAutoUpdate = false;
+			joint.visible = false;
+			hand.joints[ inputjoint.jointName ] = joint;
+
+			hand.add( joint );
+
+		}
+
+		return hand.joints[ inputjoint.jointName ];
+
+	}
+
+}
+
+const _colorKeywords = { 'aliceblue': 0xF0F8FF, 'antiquewhite': 0xFAEBD7, 'aqua': 0x00FFFF, 'aquamarine': 0x7FFFD4, 'azure': 0xF0FFFF,
+	'beige': 0xF5F5DC, 'bisque': 0xFFE4C4, 'black': 0x000000, 'blanchedalmond': 0xFFEBCD, 'blue': 0x0000FF, 'blueviolet': 0x8A2BE2,
+	'brown': 0xA52A2A, 'burlywood': 0xDEB887, 'cadetblue': 0x5F9EA0, 'chartreuse': 0x7FFF00, 'chocolate': 0xD2691E, 'coral': 0xFF7F50,
+	'cornflowerblue': 0x6495ED, 'cornsilk': 0xFFF8DC, 'crimson': 0xDC143C, 'cyan': 0x00FFFF, 'darkblue': 0x00008B, 'darkcyan': 0x008B8B,
+	'darkgoldenrod': 0xB8860B, 'darkgray': 0xA9A9A9, 'darkgreen': 0x006400, 'darkgrey': 0xA9A9A9, 'darkkhaki': 0xBDB76B, 'darkmagenta': 0x8B008B,
+	'darkolivegreen': 0x556B2F, 'darkorange': 0xFF8C00, 'darkorchid': 0x9932CC, 'darkred': 0x8B0000, 'darksalmon': 0xE9967A, 'darkseagreen': 0x8FBC8F,
+	'darkslateblue': 0x483D8B, 'darkslategray': 0x2F4F4F, 'darkslategrey': 0x2F4F4F, 'darkturquoise': 0x00CED1, 'darkviolet': 0x9400D3,
+	'deeppink': 0xFF1493, 'deepskyblue': 0x00BFFF, 'dimgray': 0x696969, 'dimgrey': 0x696969, 'dodgerblue': 0x1E90FF, 'firebrick': 0xB22222,
+	'floralwhite': 0xFFFAF0, 'forestgreen': 0x228B22, 'fuchsia': 0xFF00FF, 'gainsboro': 0xDCDCDC, 'ghostwhite': 0xF8F8FF, 'gold': 0xFFD700,
+	'goldenrod': 0xDAA520, 'gray': 0x808080, 'green': 0x008000, 'greenyellow': 0xADFF2F, 'grey': 0x808080, 'honeydew': 0xF0FFF0, 'hotpink': 0xFF69B4,
+	'indianred': 0xCD5C5C, 'indigo': 0x4B0082, 'ivory': 0xFFFFF0, 'khaki': 0xF0E68C, 'lavender': 0xE6E6FA, 'lavenderblush': 0xFFF0F5, 'lawngreen': 0x7CFC00,
+	'lemonchiffon': 0xFFFACD, 'lightblue': 0xADD8E6, 'lightcoral': 0xF08080, 'lightcyan': 0xE0FFFF, 'lightgoldenrodyellow': 0xFAFAD2, 'lightgray': 0xD3D3D3,
+	'lightgreen': 0x90EE90, 'lightgrey': 0xD3D3D3, 'lightpink': 0xFFB6C1, 'lightsalmon': 0xFFA07A, 'lightseagreen': 0x20B2AA, 'lightskyblue': 0x87CEFA,
+	'lightslategray': 0x778899, 'lightslategrey': 0x778899, 'lightsteelblue': 0xB0C4DE, 'lightyellow': 0xFFFFE0, 'lime': 0x00FF00, 'limegreen': 0x32CD32,
+	'linen': 0xFAF0E6, 'magenta': 0xFF00FF, 'maroon': 0x800000, 'mediumaquamarine': 0x66CDAA, 'mediumblue': 0x0000CD, 'mediumorchid': 0xBA55D3,
+	'mediumpurple': 0x9370DB, 'mediumseagreen': 0x3CB371, 'mediumslateblue': 0x7B68EE, 'mediumspringgreen': 0x00FA9A, 'mediumturquoise': 0x48D1CC,
+	'mediumvioletred': 0xC71585, 'midnightblue': 0x191970, 'mintcream': 0xF5FFFA, 'mistyrose': 0xFFE4E1, 'moccasin': 0xFFE4B5, 'navajowhite': 0xFFDEAD,
+	'navy': 0x000080, 'oldlace': 0xFDF5E6, 'olive': 0x808000, 'olivedrab': 0x6B8E23, 'orange': 0xFFA500, 'orangered': 0xFF4500, 'orchid': 0xDA70D6,
+	'palegoldenrod': 0xEEE8AA, 'palegreen': 0x98FB98, 'paleturquoise': 0xAFEEEE, 'palevioletred': 0xDB7093, 'papayawhip': 0xFFEFD5, 'peachpuff': 0xFFDAB9,
+	'peru': 0xCD853F, 'pink': 0xFFC0CB, 'plum': 0xDDA0DD, 'powderblue': 0xB0E0E6, 'purple': 0x800080, 'rebeccapurple': 0x663399, 'red': 0xFF0000, 'rosybrown': 0xBC8F8F,
+	'royalblue': 0x4169E1, 'saddlebrown': 0x8B4513, 'salmon': 0xFA8072, 'sandybrown': 0xF4A460, 'seagreen': 0x2E8B57, 'seashell': 0xFFF5EE,
+	'sienna': 0xA0522D, 'silver': 0xC0C0C0, 'skyblue': 0x87CEEB, 'slateblue': 0x6A5ACD, 'slategray': 0x708090, 'slategrey': 0x708090, 'snow': 0xFFFAFA,
+	'springgreen': 0x00FF7F, 'steelblue': 0x4682B4, 'tan': 0xD2B48C, 'teal': 0x008080, 'thistle': 0xD8BFD8, 'tomato': 0xFF6347, 'turquoise': 0x40E0D0,
+	'violet': 0xEE82EE, 'wheat': 0xF5DEB3, 'white': 0xFFFFFF, 'whitesmoke': 0xF5F5F5, 'yellow': 0xFFFF00, 'yellowgreen': 0x9ACD32 };
+
+const _hslA = { h: 0, s: 0, l: 0 };
+const _hslB = { h: 0, s: 0, l: 0 };
+
+function hue2rgb( p, q, t ) {
+
+	if ( t < 0 ) t += 1;
+	if ( t > 1 ) t -= 1;
+	if ( t < 1 / 6 ) return p + ( q - p ) * 6 * t;
+	if ( t < 1 / 2 ) return q;
+	if ( t < 2 / 3 ) return p + ( q - p ) * 6 * ( 2 / 3 - t );
+	return p;
+
+}
+
+/**
+ * A Color instance is represented by RGB components in the linear <i>working
+ * color space</i>, which defaults to `LinearSRGBColorSpace`. Inputs
+ * conventionally using `SRGBColorSpace` (such as hexadecimals and CSS
+ * strings) are converted to the working color space automatically.
+ *
+ * ```js
+ * // converted automatically from SRGBColorSpace to LinearSRGBColorSpace
+ * const color = new THREE.Color().setHex( 0x112233 );
+ * ```
+ * Source color spaces may be specified explicitly, to ensure correct conversions.
+ * ```js
+ * // assumed already LinearSRGBColorSpace; no conversion
+ * const color = new THREE.Color().setRGB( 0.5, 0.5, 0.5 );
+ *
+ * // converted explicitly from SRGBColorSpace to LinearSRGBColorSpace
+ * const color = new THREE.Color().setRGB( 0.5, 0.5, 0.5, SRGBColorSpace );
+ * ```
+ * If THREE.ColorManagement is disabled, no conversions occur. For details,
+ * see <i>Color management</i>. Iterating through a Color instance will yield
+ * its components (r, g, b) in the corresponding order. A Color can be initialised
+ * in any of the following ways:
+ * ```js
+ * //empty constructor - will default white
+ * const color1 = new THREE.Color();
+ *
+ * //Hexadecimal color (recommended)
+ * const color2 = new THREE.Color( 0xff0000 );
+ *
+ * //RGB string
+ * const color3 = new THREE.Color("rgb(255, 0, 0)");
+ * const color4 = new THREE.Color("rgb(100%, 0%, 0%)");
+ *
+ * //X11 color name - all 140 color names are supported.
+ * //Note the lack of CamelCase in the name
+ * const color5 = new THREE.Color( 'skyblue' );
+ * //HSL string
+ * const color6 = new THREE.Color("hsl(0, 100%, 50%)");
+ *
+ * //Separate RGB values between 0 and 1
+ * const color7 = new THREE.Color( 1, 0, 0 );
+ * ```
+ */
+class Color {
+
+	/**
+	 * Constructs a new color.
+	 *
+	 * Note that standard method of specifying color in three.js is with a hexadecimal triplet,
+	 * and that method is used throughout the rest of the documentation.
+	 *
+	 * @param {(number|string|Color)} [r] - The red component of the color. If `g` and `b` are
+	 * not provided, it can be hexadecimal triplet, a CSS-style string or another `Color` instance.
+	 * @param {number} [g] - The green component.
+	 * @param {number} [b] - The blue component.
+	 */
+	constructor( r, g, b ) {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isColor = true;
+
+		/**
+		 * The red component.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.r = 1;
+
+		/**
+		 * The green component.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.g = 1;
+
+		/**
+		 * The blue component.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.b = 1;
+
+		return this.set( r, g, b );
+
+	}
+
+	/**
+	 * Sets the colors's components from the given values.
+	 *
+	 * @param {(number|string|Color)} [r] - The red component of the color. If `g` and `b` are
+	 * not provided, it can be hexadecimal triplet, a CSS-style string or another `Color` instance.
+	 * @param {number} [g] - The green component.
+	 * @param {number} [b] - The blue component.
+	 * @return {Color} A reference to this color.
+	 */
+	set( r, g, b ) {
+
+		if ( g === undefined && b === undefined ) {
+
+			// r is THREE.Color, hex or string
+
+			const value = r;
+
+			if ( value && value.isColor ) {
+
+				this.copy( value );
+
+			} else if ( typeof value === 'number' ) {
+
+				this.setHex( value );
+
+			} else if ( typeof value === 'string' ) {
+
+				this.setStyle( value );
+
+			}
+
+		} else {
+
+			this.setRGB( r, g, b );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the colors's components to the given scalar value.
+	 *
+	 * @param {number} scalar - The scalar value.
+	 * @return {Color} A reference to this color.
+	 */
+	setScalar( scalar ) {
+
+		this.r = scalar;
+		this.g = scalar;
+		this.b = scalar;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this color from a hexadecimal value.
+	 *
+	 * @param {number} hex - The hexadecimal value.
+	 * @param {string} [colorSpace=SRGBColorSpace] - The color space.
+	 * @return {Color} A reference to this color.
+	 */
+	setHex( hex, colorSpace = SRGBColorSpace ) {
+
+		hex = Math.floor( hex );
+
+		this.r = ( hex >> 16 & 255 ) / 255;
+		this.g = ( hex >> 8 & 255 ) / 255;
+		this.b = ( hex & 255 ) / 255;
+
+		ColorManagement.colorSpaceToWorking( this, colorSpace );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this color from RGB values.
+	 *
+	 * @param {number} r - Red channel value between `0.0` and `1.0`.
+	 * @param {number} g - Green channel value between `0.0` and `1.0`.
+	 * @param {number} b - Blue channel value between `0.0` and `1.0`.
+	 * @param {string} [colorSpace=ColorManagement.workingColorSpace] - The color space.
+	 * @return {Color} A reference to this color.
+	 */
+	setRGB( r, g, b, colorSpace = ColorManagement.workingColorSpace ) {
+
+		this.r = r;
+		this.g = g;
+		this.b = b;
+
+		ColorManagement.colorSpaceToWorking( this, colorSpace );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this color from RGB values.
+	 *
+	 * @param {number} h - Hue value between `0.0` and `1.0`.
+	 * @param {number} s - Saturation value between `0.0` and `1.0`.
+	 * @param {number} l - Lightness value between `0.0` and `1.0`.
+	 * @param {string} [colorSpace=ColorManagement.workingColorSpace] - The color space.
+	 * @return {Color} A reference to this color.
+	 */
+	setHSL( h, s, l, colorSpace = ColorManagement.workingColorSpace ) {
+
+		// h,s,l ranges are in 0.0 - 1.0
+		h = euclideanModulo( h, 1 );
+		s = clamp( s, 0, 1 );
+		l = clamp( l, 0, 1 );
+
+		if ( s === 0 ) {
+
+			this.r = this.g = this.b = l;
+
+		} else {
+
+			const p = l <= 0.5 ? l * ( 1 + s ) : l + s - ( l * s );
+			const q = ( 2 * l ) - p;
+
+			this.r = hue2rgb( q, p, h + 1 / 3 );
+			this.g = hue2rgb( q, p, h );
+			this.b = hue2rgb( q, p, h - 1 / 3 );
+
+		}
+
+		ColorManagement.colorSpaceToWorking( this, colorSpace );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this color from a CSS-style string. For example, `rgb(250, 0,0)`,
+	 * `rgb(100%, 0%, 0%)`, `hsl(0, 100%, 50%)`, `#ff0000`, `#f00`, or `red` ( or
+	 * any [X11 color name](https://en.wikipedia.org/wiki/X11_color_names#Color_name_chart) -
+	 * all 140 color names are supported).
+	 *
+	 * @param {string} style - Color as a CSS-style string.
+	 * @param {string} [colorSpace=SRGBColorSpace] - The color space.
+	 * @return {Color} A reference to this color.
+	 */
+	setStyle( style, colorSpace = SRGBColorSpace ) {
+
+		function handleAlpha( string ) {
+
+			if ( string === undefined ) return;
+
+			if ( parseFloat( string ) < 1 ) {
+
+				warn( 'Color: Alpha component of ' + style + ' will be ignored.' );
+
+			}
+
+		}
+
+
+		let m;
+
+		if ( m = /^(\w+)\(([^\)]*)\)/.exec( style ) ) {
+
+			// rgb / hsl
+
+			let color;
+			const name = m[ 1 ];
+			const components = m[ 2 ];
+
+			switch ( name ) {
+
+				case 'rgb':
+				case 'rgba':
+
+					if ( color = /^\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+)\s*(?:,\s*(\d*\.?\d+)\s*)?$/.exec( components ) ) {
+
+						// rgb(255,0,0) rgba(255,0,0,0.5)
+
+						handleAlpha( color[ 4 ] );
+
+						return this.setRGB(
+							Math.min( 255, parseInt( color[ 1 ], 10 ) ) / 255,
+							Math.min( 255, parseInt( color[ 2 ], 10 ) ) / 255,
+							Math.min( 255, parseInt( color[ 3 ], 10 ) ) / 255,
+							colorSpace
+						);
+
+					}
+
+					if ( color = /^\s*(\d+)\%\s*,\s*(\d+)\%\s*,\s*(\d+)\%\s*(?:,\s*(\d*\.?\d+)\s*)?$/.exec( components ) ) {
+
+						// rgb(100%,0%,0%) rgba(100%,0%,0%,0.5)
+
+						handleAlpha( color[ 4 ] );
+
+						return this.setRGB(
+							Math.min( 100, parseInt( color[ 1 ], 10 ) ) / 100,
+							Math.min( 100, parseInt( color[ 2 ], 10 ) ) / 100,
+							Math.min( 100, parseInt( color[ 3 ], 10 ) ) / 100,
+							colorSpace
+						);
+
+					}
+
+					break;
+
+				case 'hsl':
+				case 'hsla':
+
+					if ( color = /^\s*(\d*\.?\d+)\s*,\s*(\d*\.?\d+)\%\s*,\s*(\d*\.?\d+)\%\s*(?:,\s*(\d*\.?\d+)\s*)?$/.exec( components ) ) {
+
+						// hsl(120,50%,50%) hsla(120,50%,50%,0.5)
+
+						handleAlpha( color[ 4 ] );
+
+						return this.setHSL(
+							parseFloat( color[ 1 ] ) / 360,
+							parseFloat( color[ 2 ] ) / 100,
+							parseFloat( color[ 3 ] ) / 100,
+							colorSpace
+						);
+
+					}
+
+					break;
+
+				default:
+
+					warn( 'Color: Unknown color model ' + style );
+
+			}
+
+		} else if ( m = /^\#([A-Fa-f\d]+)$/.exec( style ) ) {
+
+			// hex color
+
+			const hex = m[ 1 ];
+			const size = hex.length;
+
+			if ( size === 3 ) {
+
+				// #ff0
+				return this.setRGB(
+					parseInt( hex.charAt( 0 ), 16 ) / 15,
+					parseInt( hex.charAt( 1 ), 16 ) / 15,
+					parseInt( hex.charAt( 2 ), 16 ) / 15,
+					colorSpace
+				);
+
+			} else if ( size === 6 ) {
+
+				// #ff0000
+				return this.setHex( parseInt( hex, 16 ), colorSpace );
+
+			} else {
+
+				warn( 'Color: Invalid hex color ' + style );
+
+			}
+
+		} else if ( style && style.length > 0 ) {
+
+			return this.setColorName( style, colorSpace );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets this color from a color name. Faster than {@link Color#setStyle} if
+	 * you don't need the other CSS-style formats.
+	 *
+	 * For convenience, the list of names is exposed in `Color.NAMES` as a hash.
+	 * ```js
+	 * Color.NAMES.aliceblue // returns 0xF0F8FF
+	 * ```
+	 *
+	 * @param {string} style - The color name.
+	 * @param {string} [colorSpace=SRGBColorSpace] - The color space.
+	 * @return {Color} A reference to this color.
+	 */
+	setColorName( style, colorSpace = SRGBColorSpace ) {
+
+		// color keywords
+		const hex = _colorKeywords[ style.toLowerCase() ];
+
+		if ( hex !== undefined ) {
+
+			// red
+			this.setHex( hex, colorSpace );
+
+		} else {
+
+			// unknown color
+			warn( 'Color: Unknown color ' + style );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new color with copied values from this instance.
+	 *
+	 * @return {Color} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor( this.r, this.g, this.b );
+
+	}
+
+	/**
+	 * Copies the values of the given color to this instance.
+	 *
+	 * @param {Color} color - The color to copy.
+	 * @return {Color} A reference to this color.
+	 */
+	copy( color ) {
+
+		this.r = color.r;
+		this.g = color.g;
+		this.b = color.b;
+
+		return this;
+
+	}
+
+	/**
+	 * Copies the given color into this color, and then converts this color from
+	 * `SRGBColorSpace` to `LinearSRGBColorSpace`.
+	 *
+	 * @param {Color} color - The color to copy/convert.
+	 * @return {Color} A reference to this color.
+	 */
+	copySRGBToLinear( color ) {
+
+		this.r = SRGBToLinear( color.r );
+		this.g = SRGBToLinear( color.g );
+		this.b = SRGBToLinear( color.b );
+
+		return this;
+
+	}
+
+	/**
+	 * Copies the given color into this color, and then converts this color from
+	 * `LinearSRGBColorSpace` to `SRGBColorSpace`.
+	 *
+	 * @param {Color} color - The color to copy/convert.
+	 * @return {Color} A reference to this color.
+	 */
+	copyLinearToSRGB( color ) {
+
+		this.r = LinearToSRGB( color.r );
+		this.g = LinearToSRGB( color.g );
+		this.b = LinearToSRGB( color.b );
+
+		return this;
+
+	}
+
+	/**
+	 * Converts this color from `SRGBColorSpace` to `LinearSRGBColorSpace`.
+	 *
+	 * @return {Color} A reference to this color.
+	 */
+	convertSRGBToLinear() {
+
+		this.copySRGBToLinear( this );
+
+		return this;
+
+	}
+
+	/**
+	 * Converts this color from `LinearSRGBColorSpace` to `SRGBColorSpace`.
+	 *
+	 * @return {Color} A reference to this color.
+	 */
+	convertLinearToSRGB() {
+
+		this.copyLinearToSRGB( this );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the hexadecimal value of this color.
+	 *
+	 * @param {string} [colorSpace=SRGBColorSpace] - The color space.
+	 * @return {number} The hexadecimal value.
+	 */
+	getHex( colorSpace = SRGBColorSpace ) {
+
+		ColorManagement.workingToColorSpace( _color.copy( this ), colorSpace );
+
+		return Math.round( clamp( _color.r * 255, 0, 255 ) ) * 65536 + Math.round( clamp( _color.g * 255, 0, 255 ) ) * 256 + Math.round( clamp( _color.b * 255, 0, 255 ) );
+
+	}
+
+	/**
+	 * Returns the hexadecimal value of this color as a string (for example, 'FFFFFF').
+	 *
+	 * @param {string} [colorSpace=SRGBColorSpace] - The color space.
+	 * @return {string} The hexadecimal value as a string.
+	 */
+	getHexString( colorSpace = SRGBColorSpace ) {
+
+		return ( '000000' + this.getHex( colorSpace ).toString( 16 ) ).slice( -6 );
+
+	}
+
+	/**
+	 * Converts the colors RGB values into the HSL format and stores them into the
+	 * given target object.
+	 *
+	 * @param {{h:number,s:number,l:number}} target - The target object that is used to store the method's result.
+	 * @param {string} [colorSpace=ColorManagement.workingColorSpace] - The color space.
+	 * @return {{h:number,s:number,l:number}} The HSL representation of this color.
+	 */
+	getHSL( target, colorSpace = ColorManagement.workingColorSpace ) {
+
+		// h,s,l ranges are in 0.0 - 1.0
+
+		ColorManagement.workingToColorSpace( _color.copy( this ), colorSpace );
+
+		const r = _color.r, g = _color.g, b = _color.b;
+
+		const max = Math.max( r, g, b );
+		const min = Math.min( r, g, b );
+
+		let hue, saturation;
+		const lightness = ( min + max ) / 2.0;
+
+		if ( min === max ) {
+
+			hue = 0;
+			saturation = 0;
+
+		} else {
+
+			const delta = max - min;
+
+			saturation = lightness <= 0.5 ? delta / ( max + min ) : delta / ( 2 - max - min );
+
+			switch ( max ) {
+
+				case r: hue = ( g - b ) / delta + ( g < b ? 6 : 0 ); break;
+				case g: hue = ( b - r ) / delta + 2; break;
+				case b: hue = ( r - g ) / delta + 4; break;
+
+			}
+
+			hue /= 6;
+
+		}
+
+		target.h = hue;
+		target.s = saturation;
+		target.l = lightness;
+
+		return target;
+
+	}
+
+	/**
+	 * Returns the RGB values of this color and stores them into the given target object.
+	 *
+	 * @param {Color} target - The target color that is used to store the method's result.
+	 * @param {string} [colorSpace=ColorManagement.workingColorSpace] - The color space.
+	 * @return {Color} The RGB representation of this color.
+	 */
+	getRGB( target, colorSpace = ColorManagement.workingColorSpace ) {
+
+		ColorManagement.workingToColorSpace( _color.copy( this ), colorSpace );
+
+		target.r = _color.r;
+		target.g = _color.g;
+		target.b = _color.b;
+
+		return target;
+
+	}
+
+	/**
+	 * Returns the value of this color as a CSS style string. Example: `rgb(255,0,0)`.
+	 *
+	 * @param {string} [colorSpace=SRGBColorSpace] - The color space.
+	 * @return {string} The CSS representation of this color.
+	 */
+	getStyle( colorSpace = SRGBColorSpace ) {
+
+		ColorManagement.workingToColorSpace( _color.copy( this ), colorSpace );
+
+		const r = _color.r, g = _color.g, b = _color.b;
+
+		if ( colorSpace !== SRGBColorSpace ) {
+
+			// Requires CSS Color Module Level 4 (https://www.w3.org/TR/css-color-4/).
+			return `color(${ colorSpace } ${ r.toFixed( 3 ) } ${ g.toFixed( 3 ) } ${ b.toFixed( 3 ) })`;
+
+		}
+
+		return `rgb(${ Math.round( r * 255 ) },${ Math.round( g * 255 ) },${ Math.round( b * 255 ) })`;
+
+	}
+
+	/**
+	 * Adds the given HSL values to this color's values.
+	 * Internally, this converts the color's RGB values to HSL, adds HSL
+	 * and then converts the color back to RGB.
+	 *
+	 * @param {number} h - Hue value between `0.0` and `1.0`.
+	 * @param {number} s - Saturation value between `0.0` and `1.0`.
+	 * @param {number} l - Lightness value between `0.0` and `1.0`.
+	 * @return {Color} A reference to this color.
+	 */
+	offsetHSL( h, s, l ) {
+
+		this.getHSL( _hslA );
+
+		return this.setHSL( _hslA.h + h, _hslA.s + s, _hslA.l + l );
+
+	}
+
+	/**
+	 * Adds the RGB values of the given color to the RGB values of this color.
+	 *
+	 * @param {Color} color - The color to add.
+	 * @return {Color} A reference to this color.
+	 */
+	add( color ) {
+
+		this.r += color.r;
+		this.g += color.g;
+		this.b += color.b;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the RGB values of the given colors and stores the result in this instance.
+	 *
+	 * @param {Color} color1 - The first color.
+	 * @param {Color} color2 - The second color.
+	 * @return {Color} A reference to this color.
+	 */
+	addColors( color1, color2 ) {
+
+		this.r = color1.r + color2.r;
+		this.g = color1.g + color2.g;
+		this.b = color1.b + color2.b;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given scalar value to the RGB values of this color.
+	 *
+	 * @param {number} s - The scalar to add.
+	 * @return {Color} A reference to this color.
+	 */
+	addScalar( s ) {
+
+		this.r += s;
+		this.g += s;
+		this.b += s;
+
+		return this;
+
+	}
+
+	/**
+	 * Subtracts the RGB values of the given color from the RGB values of this color.
+	 *
+	 * @param {Color} color - The color to subtract.
+	 * @return {Color} A reference to this color.
+	 */
+	sub( color ) {
+
+		this.r = Math.max( 0, this.r - color.r );
+		this.g = Math.max( 0, this.g - color.g );
+		this.b = Math.max( 0, this.b - color.b );
+
+		return this;
+
+	}
+
+	/**
+	 * Multiplies the RGB values of the given color with the RGB values of this color.
+	 *
+	 * @param {Color} color - The color to multiply.
+	 * @return {Color} A reference to this color.
+	 */
+	multiply( color ) {
+
+		this.r *= color.r;
+		this.g *= color.g;
+		this.b *= color.b;
+
+		return this;
+
+	}
+
+	/**
+	 * Multiplies the given scalar value with the RGB values of this color.
+	 *
+	 * @param {number} s - The scalar to multiply.
+	 * @return {Color} A reference to this color.
+	 */
+	multiplyScalar( s ) {
+
+		this.r *= s;
+		this.g *= s;
+		this.b *= s;
+
+		return this;
+
+	}
+
+	/**
+	 * Linearly interpolates this color's RGB values toward the RGB values of the
+	 * given color. The alpha argument can be thought of as the ratio between
+	 * the two colors, where `0.0` is this color and `1.0` is the first argument.
+	 *
+	 * @param {Color} color - The color to converge on.
+	 * @param {number} alpha - The interpolation factor in the closed interval `[0,1]`.
+	 * @return {Color} A reference to this color.
+	 */
+	lerp( color, alpha ) {
+
+		this.r += ( color.r - this.r ) * alpha;
+		this.g += ( color.g - this.g ) * alpha;
+		this.b += ( color.b - this.b ) * alpha;
+
+		return this;
+
+	}
+
+	/**
+	 * Linearly interpolates between the given colors and stores the result in this instance.
+	 * The alpha argument can be thought of as the ratio between the two colors, where `0.0`
+	 * is the first and `1.0` is the second color.
+	 *
+	 * @param {Color} color1 - The first color.
+	 * @param {Color} color2 - The second color.
+	 * @param {number} alpha - The interpolation factor in the closed interval `[0,1]`.
+	 * @return {Color} A reference to this color.
+	 */
+	lerpColors( color1, color2, alpha ) {
+
+		this.r = color1.r + ( color2.r - color1.r ) * alpha;
+		this.g = color1.g + ( color2.g - color1.g ) * alpha;
+		this.b = color1.b + ( color2.b - color1.b ) * alpha;
+
+		return this;
+
+	}
+
+	/**
+	 * Linearly interpolates this color's HSL values toward the HSL values of the
+	 * given color. It differs from {@link Color#lerp} by not interpolating straight
+	 * from one color to the other, but instead going through all the hues in between
+	 * those two colors. The alpha argument can be thought of as the ratio between
+	 * the two colors, where 0.0 is this color and 1.0 is the first argument.
+	 *
+	 * @param {Color} color - The color to converge on.
+	 * @param {number} alpha - The interpolation factor in the closed interval `[0,1]`.
+	 * @return {Color} A reference to this color.
+	 */
+	lerpHSL( color, alpha ) {
+
+		this.getHSL( _hslA );
+		color.getHSL( _hslB );
+
+		const h = lerp( _hslA.h, _hslB.h, alpha );
+		const s = lerp( _hslA.s, _hslB.s, alpha );
+		const l = lerp( _hslA.l, _hslB.l, alpha );
+
+		this.setHSL( h, s, l );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the color's RGB components from the given 3D vector.
+	 *
+	 * @param {Vector3} v - The vector to set.
+	 * @return {Color} A reference to this color.
+	 */
+	setFromVector3( v ) {
+
+		this.r = v.x;
+		this.g = v.y;
+		this.b = v.z;
+
+		return this;
+
+	}
+
+	/**
+	 * Transforms this color with the given 3x3 matrix.
+	 *
+	 * @param {Matrix3} m - The matrix.
+	 * @return {Color} A reference to this color.
+	 */
+	applyMatrix3( m ) {
+
+		const r = this.r, g = this.g, b = this.b;
+		const e = m.elements;
+
+		this.r = e[ 0 ] * r + e[ 3 ] * g + e[ 6 ] * b;
+		this.g = e[ 1 ] * r + e[ 4 ] * g + e[ 7 ] * b;
+		this.b = e[ 2 ] * r + e[ 5 ] * g + e[ 8 ] * b;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this color is equal with the given one.
+	 *
+	 * @param {Color} c - The color to test for equality.
+	 * @return {boolean} Whether this bounding color is equal with the given one.
+	 */
+	equals( c ) {
+
+		return ( c.r === this.r ) && ( c.g === this.g ) && ( c.b === this.b );
+
+	}
+
+	/**
+	 * Sets this color's RGB components from the given array.
+	 *
+	 * @param {Array<number>} array - An array holding the RGB values.
+	 * @param {number} [offset=0] - The offset into the array.
+	 * @return {Color} A reference to this color.
+	 */
+	fromArray( array, offset = 0 ) {
+
+		this.r = array[ offset ];
+		this.g = array[ offset + 1 ];
+		this.b = array[ offset + 2 ];
+
+		return this;
+
+	}
+
+	/**
+	 * Writes the RGB components of this color to the given array. If no array is provided,
+	 * the method returns a new instance.
+	 *
+	 * @param {Array<number>} [array=[]] - The target array holding the color components.
+	 * @param {number} [offset=0] - Index of the first element in the array.
+	 * @return {Array<number>} The color components.
+	 */
+	toArray( array = [], offset = 0 ) {
+
+		array[ offset ] = this.r;
+		array[ offset + 1 ] = this.g;
+		array[ offset + 2 ] = this.b;
+
+		return array;
+
+	}
+
+	/**
+	 * Sets the components of this color from the given buffer attribute.
+	 *
+	 * @param {BufferAttribute} attribute - The buffer attribute holding color data.
+	 * @param {number} index - The index into the attribute.
+	 * @return {Color} A reference to this color.
+	 */
+	fromBufferAttribute( attribute, index ) {
+
+		this.r = attribute.getX( index );
+		this.g = attribute.getY( index );
+		this.b = attribute.getZ( index );
+
+		return this;
+
+	}
+
+	/**
+	 * This methods defines the serialization result of this class. Returns the color
+	 * as a hexadecimal value.
+	 *
+	 * @return {number} The hexadecimal value.
+	 */
+	toJSON() {
+
+		return this.getHex();
+
+	}
+
+	*[ Symbol.iterator ]() {
+
+		yield this.r;
+		yield this.g;
+		yield this.b;
+
+	}
+
+}
+
+const _color = /*@__PURE__*/ new Color();
+
+/**
+ * A dictionary with X11 color names.
+ *
+ * Note that multiple words such as Dark Orange become the string 'darkorange'.
+ *
+ * @static
+ * @type {Object}
+ */
+Color.NAMES = _colorKeywords;
+
+/**
+ * This class can be used to define an exponential squared fog,
+ * which gives a clear view near the camera and a faster than exponentially
+ * densening fog farther from the camera.
+ *
+ * ```js
+ * const scene = new THREE.Scene();
+ * scene.fog = new THREE.FogExp2( 0xcccccc, 0.002 );
+ * ```
+ */
+class FogExp2 {
+
+	/**
+	 * Constructs a new fog.
+	 *
+	 * @param {number|Color} color - The fog's color.
+	 * @param {number} [density=0.00025] - Defines how fast the fog will grow dense.
+	 */
+	constructor( color, density = 0.00025 ) {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isFogExp2 = true;
+
+		/**
+		 * The name of the fog.
+		 *
+		 * @type {string}
+		 */
+		this.name = '';
+
+		/**
+		 * The fog's color.
+		 *
+		 * @type {Color}
+		 */
+		this.color = new Color( color );
+
+		/**
+		 *  Defines how fast the fog will grow dense.
+		 *
+		 * @type {number}
+		 * @default 0.00025
+		 */
+		this.density = density;
+
+	}
+
+	/**
+	 * Returns a new fog with copied values from this instance.
+	 *
+	 * @return {FogExp2} A clone of this instance.
+	 */
+	clone() {
+
+		return new FogExp2( this.color, this.density );
+
+	}
+
+	/**
+	 * Serializes the fog into JSON.
+	 *
+	 * @param {?(Object|string)} meta - An optional value holding meta information about the serialization.
+	 * @return {Object} A JSON object representing the serialized fog
+	 */
+	toJSON( /* meta */ ) {
+
+		return {
+			type: 'FogExp2',
+			name: this.name,
+			color: this.color.getHex(),
+			density: this.density
+		};
+
+	}
+
+}
+
+/**
+ * This class can be used to define a linear fog that grows linearly denser
+ * with the distance.
+ *
+ * ```js
+ * const scene = new THREE.Scene();
+ * scene.fog = new THREE.Fog( 0xcccccc, 10, 15 );
+ * ```
+ */
+class Fog {
+
+	/**
+	 * Constructs a new fog.
+	 *
+	 * @param {number|Color} color - The fog's color.
+	 * @param {number} [near=1] - The minimum distance to start applying fog.
+	 * @param {number} [far=1000] - The maximum distance at which fog stops being calculated and applied.
+	 */
+	constructor( color, near = 1, far = 1000 ) {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isFog = true;
+
+		/**
+		 * The name of the fog.
+		 *
+		 * @type {string}
+		 */
+		this.name = '';
+
+		/**
+		 * The fog's color.
+		 *
+		 * @type {Color}
+		 */
+		this.color = new Color( color );
+
+		/**
+		 * The minimum distance to start applying fog. Objects that are less than
+		 * `near` units from the active camera won't be affected by fog.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.near = near;
+
+		/**
+		 * The maximum distance at which fog stops being calculated and applied.
+		 * Objects that are more than `far` units away from the active camera won't
+		 * be affected by fog.
+		 *
+		 * @type {number}
+		 * @default 1000
+		 */
+		this.far = far;
+
+	}
+
+	/**
+	 * Returns a new fog with copied values from this instance.
+	 *
+	 * @return {Fog} A clone of this instance.
+	 */
+	clone() {
+
+		return new Fog( this.color, this.near, this.far );
+
+	}
+
+	/**
+	 * Serializes the fog into JSON.
+	 *
+	 * @param {?(Object|string)} meta - An optional value holding meta information about the serialization.
+	 * @return {Object} A JSON object representing the serialized fog
+	 */
+	toJSON( /* meta */ ) {
+
+		return {
+			type: 'Fog',
+			name: this.name,
+			color: this.color.getHex(),
+			near: this.near,
+			far: this.far
+		};
+
+	}
+
+}
+
+/**
+ * Scenes allow you to set up what is to be rendered and where by three.js.
+ * This is where you place 3D objects like meshes, lines or lights.
+ *
+ * @augments Object3D
+ */
+class Scene extends Object3D {
+
+	/**
+	 * Constructs a new scene.
+	 */
+	constructor() {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isScene = true;
+
+		this.type = 'Scene';
+
+		/**
+		 * Defines the background of the scene. Valid inputs are:
+		 *
+		 * - A color for defining a uniform colored background.
+		 * - A texture for defining a (flat) textured background.
+		 * - Cube textures or equirectangular textures for defining a skybox.
+		 *
+		 * @type {?(Color|Texture)}
+		 * @default null
+		 */
+		this.background = null;
+
+		/**
+		 * Sets the environment map for all physical materials in the scene. However,
+		 * it's not possible to overwrite an existing texture assigned to the `envMap`
+		 * material property.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.environment = null;
+
+		/**
+		 * A fog instance defining the type of fog that affects everything
+		 * rendered in the scene.
+		 *
+		 * @type {?(Fog|FogExp2)}
+		 * @default null
+		 */
+		this.fog = null;
+
+		/**
+		 * Sets the blurriness of the background. Only influences environment maps
+		 * assigned to {@link Scene#background}. Valid input is a float between `0`
+		 * and `1`.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.backgroundBlurriness = 0;
+
+		/**
+		 * Attenuates the color of the background. Only applies to background textures.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.backgroundIntensity = 1;
+
+		/**
+		 * The rotation of the background in radians. Only influences environment maps
+		 * assigned to {@link Scene#background}.
+		 *
+		 * @type {Euler}
+		 * @default (0,0,0)
+		 */
+		this.backgroundRotation = new Euler();
+
+		/**
+		 * Attenuates the color of the environment. Only influences environment maps
+		 * assigned to {@link Scene#environment}.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.environmentIntensity = 1;
+
+		/**
+		 * The rotation of the environment map in radians. Only influences physical materials
+		 * in the scene when {@link Scene#environment} is used.
+		 *
+		 * @type {Euler}
+		 * @default (0,0,0)
+		 */
+		this.environmentRotation = new Euler();
+
+		/**
+		 * Forces everything in the scene to be rendered with the defined material. It is possible
+		 * to exclude materials from override by setting {@link Material#allowOverride} to `false`.
+		 *
+		 * @type {?Material}
+		 * @default null
+		 */
+		this.overrideMaterial = null;
+
+		if ( typeof __THREE_DEVTOOLS__ !== 'undefined' ) {
+
+			__THREE_DEVTOOLS__.dispatchEvent( new CustomEvent( 'observe', { detail: this } ) );
+
+		}
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		if ( source.background !== null ) this.background = source.background.clone();
+		if ( source.environment !== null ) this.environment = source.environment.clone();
+		if ( source.fog !== null ) this.fog = source.fog.clone();
+
+		this.backgroundBlurriness = source.backgroundBlurriness;
+		this.backgroundIntensity = source.backgroundIntensity;
+		this.backgroundRotation.copy( source.backgroundRotation );
+
+		this.environmentIntensity = source.environmentIntensity;
+		this.environmentRotation.copy( source.environmentRotation );
+
+		if ( source.overrideMaterial !== null ) this.overrideMaterial = source.overrideMaterial.clone();
+
+		this.matrixAutoUpdate = source.matrixAutoUpdate;
+
+		return this;
+
+	}
+
+	toJSON( meta ) {
+
+		const data = super.toJSON( meta );
+
+		if ( this.fog !== null ) data.object.fog = this.fog.toJSON();
+
+		data.object.backgroundBlurriness = this.backgroundBlurriness;
+		data.object.backgroundIntensity = this.backgroundIntensity;
+		data.object.backgroundRotation = this.backgroundRotation.toArray();
+
+		data.object.environmentIntensity = this.environmentIntensity;
+		data.object.environmentRotation = this.environmentRotation.toArray();
+
+		return data;
+
+	}
+
+}
+
+const _v0$2 = /*@__PURE__*/ new Vector3();
+const _v1$5 = /*@__PURE__*/ new Vector3();
+const _v2$4 = /*@__PURE__*/ new Vector3();
+const _v3$2 = /*@__PURE__*/ new Vector3();
+
+const _vab = /*@__PURE__*/ new Vector3();
+const _vac = /*@__PURE__*/ new Vector3();
+const _vbc = /*@__PURE__*/ new Vector3();
+const _vap = /*@__PURE__*/ new Vector3();
+const _vbp = /*@__PURE__*/ new Vector3();
+const _vcp = /*@__PURE__*/ new Vector3();
+
+const _v40 = /*@__PURE__*/ new Vector4();
+const _v41 = /*@__PURE__*/ new Vector4();
+const _v42 = /*@__PURE__*/ new Vector4();
+
+/**
+ * A geometric triangle as defined by three vectors representing its three corners.
+ */
+class Triangle {
+
+	/**
+	 * Constructs a new triangle.
+	 *
+	 * @param {Vector3} [a=(0,0,0)] - The first corner of the triangle.
+	 * @param {Vector3} [b=(0,0,0)] - The second corner of the triangle.
+	 * @param {Vector3} [c=(0,0,0)] - The third corner of the triangle.
+	 */
+	constructor( a = new Vector3(), b = new Vector3(), c = new Vector3() ) {
+
+		/**
+		 * The first corner of the triangle.
+		 *
+		 * @type {Vector3}
+		 */
+		this.a = a;
+
+		/**
+		 * The second corner of the triangle.
+		 *
+		 * @type {Vector3}
+		 */
+		this.b = b;
+
+		/**
+		 * The third corner of the triangle.
+		 *
+		 * @type {Vector3}
+		 */
+		this.c = c;
+
+	}
+
+	/**
+	 * Computes the normal vector of a triangle.
+	 *
+	 * @param {Vector3} a - The first corner of the triangle.
+	 * @param {Vector3} b - The second corner of the triangle.
+	 * @param {Vector3} c - The third corner of the triangle.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The triangle's normal.
+	 */
+	static getNormal( a, b, c, target ) {
+
+		target.subVectors( c, b );
+		_v0$2.subVectors( a, b );
+		target.cross( _v0$2 );
+
+		const targetLengthSq = target.lengthSq();
+		if ( targetLengthSq > 0 ) {
+
+			return target.multiplyScalar( 1 / Math.sqrt( targetLengthSq ) );
+
+		}
+
+		return target.set( 0, 0, 0 );
+
+	}
+
+	/**
+	 * Computes a barycentric coordinates from the given vector.
+	 * Returns `null` if the triangle is degenerate.
+	 *
+	 * @param {Vector3} point - A point in 3D space.
+	 * @param {Vector3} a - The first corner of the triangle.
+	 * @param {Vector3} b - The second corner of the triangle.
+	 * @param {Vector3} c - The third corner of the triangle.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {?Vector3} The barycentric coordinates for the given point
+	 */
+	static getBarycoord( point, a, b, c, target ) {
+
+		_v0$2.subVectors( c, a );
+		_v1$5.subVectors( b, a );
+		_v2$4.subVectors( point, a );
+
+		const dot00 = _v0$2.dot( _v0$2 );
+		const dot01 = _v0$2.dot( _v1$5 );
+		const dot02 = _v0$2.dot( _v2$4 );
+		const dot11 = _v1$5.dot( _v1$5 );
+		const dot12 = _v1$5.dot( _v2$4 );
+
+		const denom = ( dot00 * dot11 - dot01 * dot01 );
+
+		// collinear or singular triangle
+		if ( denom === 0 ) {
+
+			target.set( 0, 0, 0 );
+			return null;
+
+		}
+
+		const invDenom = 1 / denom;
+		const u = ( dot11 * dot02 - dot01 * dot12 ) * invDenom;
+		const v = ( dot00 * dot12 - dot01 * dot02 ) * invDenom;
+
+		// barycentric coordinates must always sum to 1
+		return target.set( 1 - u - v, v, u );
+
+	}
+
+	/**
+	 * Returns `true` if the given point, when projected onto the plane of the
+	 * triangle, lies within the triangle.
+	 *
+	 * @param {Vector3} point - The point in 3D space to test.
+	 * @param {Vector3} a - The first corner of the triangle.
+	 * @param {Vector3} b - The second corner of the triangle.
+	 * @param {Vector3} c - The third corner of the triangle.
+	 * @return {boolean} Whether the given point, when projected onto the plane of the
+	 * triangle, lies within the triangle or not.
+	 */
+	static containsPoint( point, a, b, c ) {
+
+		// if the triangle is degenerate then we can't contain a point
+		if ( this.getBarycoord( point, a, b, c, _v3$2 ) === null ) {
+
+			return false;
+
+		}
+
+		return ( _v3$2.x >= 0 ) && ( _v3$2.y >= 0 ) && ( ( _v3$2.x + _v3$2.y ) <= 1 );
+
+	}
+
+	/**
+	 * Computes the value barycentrically interpolated for the given point on the
+	 * triangle. Returns `null` if the triangle is degenerate.
+	 *
+	 * @param {Vector3} point - Position of interpolated point.
+	 * @param {Vector3} p1 - The first corner of the triangle.
+	 * @param {Vector3} p2 - The second corner of the triangle.
+	 * @param {Vector3} p3 - The third corner of the triangle.
+	 * @param {Vector3} v1 - Value to interpolate of first vertex.
+	 * @param {Vector3} v2 - Value to interpolate of second vertex.
+	 * @param {Vector3} v3 - Value to interpolate of third vertex.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {?Vector3} The interpolated value.
+	 */
+	static getInterpolation( point, p1, p2, p3, v1, v2, v3, target ) {
+
+		if ( this.getBarycoord( point, p1, p2, p3, _v3$2 ) === null ) {
+
+			target.x = 0;
+			target.y = 0;
+			if ( 'z' in target ) target.z = 0;
+			if ( 'w' in target ) target.w = 0;
+			return null;
+
+		}
+
+		target.setScalar( 0 );
+		target.addScaledVector( v1, _v3$2.x );
+		target.addScaledVector( v2, _v3$2.y );
+		target.addScaledVector( v3, _v3$2.z );
+
+		return target;
+
+	}
+
+	/**
+	 * Computes the value barycentrically interpolated for the given attribute and indices.
+	 *
+	 * @param {BufferAttribute} attr - The attribute to interpolate.
+	 * @param {number} i1 - Index of first vertex.
+	 * @param {number} i2 - Index of second vertex.
+	 * @param {number} i3 - Index of third vertex.
+	 * @param {Vector3} barycoord - The barycoordinate value to use to interpolate.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The interpolated attribute value.
+	 */
+	static getInterpolatedAttribute( attr, i1, i2, i3, barycoord, target ) {
+
+		_v40.setScalar( 0 );
+		_v41.setScalar( 0 );
+		_v42.setScalar( 0 );
+
+		_v40.fromBufferAttribute( attr, i1 );
+		_v41.fromBufferAttribute( attr, i2 );
+		_v42.fromBufferAttribute( attr, i3 );
+
+		target.setScalar( 0 );
+		target.addScaledVector( _v40, barycoord.x );
+		target.addScaledVector( _v41, barycoord.y );
+		target.addScaledVector( _v42, barycoord.z );
+
+		return target;
+
+	}
+
+	/**
+	 * Returns `true` if the triangle is oriented towards the given direction.
+	 *
+	 * @param {Vector3} a - The first corner of the triangle.
+	 * @param {Vector3} b - The second corner of the triangle.
+	 * @param {Vector3} c - The third corner of the triangle.
+	 * @param {Vector3} direction - The (normalized) direction vector.
+	 * @return {boolean} Whether the triangle is oriented towards the given direction or not.
+	 */
+	static isFrontFacing( a, b, c, direction ) {
+
+		_v0$2.subVectors( c, b );
+		_v1$5.subVectors( a, b );
+
+		// strictly front facing
+		return _v0$2.cross( _v1$5 ).dot( direction ) < 0;
+
+	}
+
+	/**
+	 * Sets the triangle's vertices by copying the given values.
+	 *
+	 * @param {Vector3} a - The first corner of the triangle.
+	 * @param {Vector3} b - The second corner of the triangle.
+	 * @param {Vector3} c - The third corner of the triangle.
+	 * @return {Triangle} A reference to this triangle.
+	 */
+	set( a, b, c ) {
+
+		this.a.copy( a );
+		this.b.copy( b );
+		this.c.copy( c );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the triangle's vertices by copying the given array values.
+	 *
+	 * @param {Array<Vector3>} points - An array with 3D points.
+	 * @param {number} i0 - The array index representing the first corner of the triangle.
+	 * @param {number} i1 - The array index representing the second corner of the triangle.
+	 * @param {number} i2 - The array index representing the third corner of the triangle.
+	 * @return {Triangle} A reference to this triangle.
+	 */
+	setFromPointsAndIndices( points, i0, i1, i2 ) {
+
+		this.a.copy( points[ i0 ] );
+		this.b.copy( points[ i1 ] );
+		this.c.copy( points[ i2 ] );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the triangle's vertices by copying the given attribute values.
+	 *
+	 * @param {BufferAttribute} attribute - A buffer attribute with 3D points data.
+	 * @param {number} i0 - The attribute index representing the first corner of the triangle.
+	 * @param {number} i1 - The attribute index representing the second corner of the triangle.
+	 * @param {number} i2 - The attribute index representing the third corner of the triangle.
+	 * @return {Triangle} A reference to this triangle.
+	 */
+	setFromAttributeAndIndices( attribute, i0, i1, i2 ) {
+
+		this.a.fromBufferAttribute( attribute, i0 );
+		this.b.fromBufferAttribute( attribute, i1 );
+		this.c.fromBufferAttribute( attribute, i2 );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new triangle with copied values from this instance.
+	 *
+	 * @return {Triangle} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+	/**
+	 * Copies the values of the given triangle to this instance.
+	 *
+	 * @param {Triangle} triangle - The triangle to copy.
+	 * @return {Triangle} A reference to this triangle.
+	 */
+	copy( triangle ) {
+
+		this.a.copy( triangle.a );
+		this.b.copy( triangle.b );
+		this.c.copy( triangle.c );
+
+		return this;
+
+	}
+
+	/**
+	 * Computes the area of the triangle.
+	 *
+	 * @return {number} The triangle's area.
+	 */
+	getArea() {
+
+		_v0$2.subVectors( this.c, this.b );
+		_v1$5.subVectors( this.a, this.b );
+
+		return _v0$2.cross( _v1$5 ).length() * 0.5;
+
+	}
+
+	/**
+	 * Computes the midpoint of the triangle.
+	 *
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The triangle's midpoint.
+	 */
+	getMidpoint( target ) {
+
+		return target.addVectors( this.a, this.b ).add( this.c ).multiplyScalar( 1 / 3 );
+
+	}
+
+	/**
+	 * Computes the normal of the triangle.
+	 *
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The triangle's normal.
+	 */
+	getNormal( target ) {
+
+		return Triangle.getNormal( this.a, this.b, this.c, target );
+
+	}
+
+	/**
+	 * Computes a plane the triangle lies within.
+	 *
+	 * @param {Plane} target - The target vector that is used to store the method's result.
+	 * @return {Plane} The plane the triangle lies within.
+	 */
+	getPlane( target ) {
+
+		return target.setFromCoplanarPoints( this.a, this.b, this.c );
+
+	}
+
+	/**
+	 * Computes a barycentric coordinates from the given vector.
+	 * Returns `null` if the triangle is degenerate.
+	 *
+	 * @param {Vector3} point - A point in 3D space.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {?Vector3} The barycentric coordinates for the given point
+	 */
+	getBarycoord( point, target ) {
+
+		return Triangle.getBarycoord( point, this.a, this.b, this.c, target );
+
+	}
+
+	/**
+	 * Computes the value barycentrically interpolated for the given point on the
+	 * triangle. Returns `null` if the triangle is degenerate.
+	 *
+	 * @param {Vector3} point - Position of interpolated point.
+	 * @param {Vector3} v1 - Value to interpolate of first vertex.
+	 * @param {Vector3} v2 - Value to interpolate of second vertex.
+	 * @param {Vector3} v3 - Value to interpolate of third vertex.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {?Vector3} The interpolated value.
+	 */
+	getInterpolation( point, v1, v2, v3, target ) {
+
+		return Triangle.getInterpolation( point, this.a, this.b, this.c, v1, v2, v3, target );
+
+	}
+
+	/**
+	 * Returns `true` if the given point, when projected onto the plane of the
+	 * triangle, lies within the triangle.
+	 *
+	 * @param {Vector3} point - The point in 3D space to test.
+	 * @return {boolean} Whether the given point, when projected onto the plane of the
+	 * triangle, lies within the triangle or not.
+	 */
+	containsPoint( point ) {
+
+		return Triangle.containsPoint( point, this.a, this.b, this.c );
+
+	}
+
+	/**
+	 * Returns `true` if the triangle is oriented towards the given direction.
+	 *
+	 * @param {Vector3} direction - The (normalized) direction vector.
+	 * @return {boolean} Whether the triangle is oriented towards the given direction or not.
+	 */
+	isFrontFacing( direction ) {
+
+		return Triangle.isFrontFacing( this.a, this.b, this.c, direction );
+
+	}
+
+	/**
+	 * Returns `true` if this triangle intersects with the given box.
+	 *
+	 * @param {Box3} box - The box to intersect.
+	 * @return {boolean} Whether this triangle intersects with the given box or not.
+	 */
+	intersectsBox( box ) {
+
+		return box.intersectsTriangle( this );
+
+	}
+
+	/**
+	 * Returns the closest point on the triangle to the given point.
+	 *
+	 * @param {Vector3} p - The point to compute the closest point for.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The closest point on the triangle.
+	 */
+	closestPointToPoint( p, target ) {
+
+		const a = this.a, b = this.b, c = this.c;
+		let v, w;
+
+		// algorithm thanks to Real-Time Collision Detection by Christer Ericson,
+		// published by Morgan Kaufmann Publishers, (c) 2005 Elsevier Inc.,
+		// under the accompanying license; see chapter 5.1.5 for detailed explanation.
+		// basically, we're distinguishing which of the voronoi regions of the triangle
+		// the point lies in with the minimum amount of redundant computation.
+
+		_vab.subVectors( b, a );
+		_vac.subVectors( c, a );
+		_vap.subVectors( p, a );
+		const d1 = _vab.dot( _vap );
+		const d2 = _vac.dot( _vap );
+		if ( d1 <= 0 && d2 <= 0 ) {
+
+			// vertex region of A; barycentric coords (1, 0, 0)
+			return target.copy( a );
+
+		}
+
+		_vbp.subVectors( p, b );
+		const d3 = _vab.dot( _vbp );
+		const d4 = _vac.dot( _vbp );
+		if ( d3 >= 0 && d4 <= d3 ) {
+
+			// vertex region of B; barycentric coords (0, 1, 0)
+			return target.copy( b );
+
+		}
+
+		const vc = d1 * d4 - d3 * d2;
+		if ( vc <= 0 && d1 >= 0 && d3 <= 0 ) {
+
+			v = d1 / ( d1 - d3 );
+			// edge region of AB; barycentric coords (1-v, v, 0)
+			return target.copy( a ).addScaledVector( _vab, v );
+
+		}
+
+		_vcp.subVectors( p, c );
+		const d5 = _vab.dot( _vcp );
+		const d6 = _vac.dot( _vcp );
+		if ( d6 >= 0 && d5 <= d6 ) {
+
+			// vertex region of C; barycentric coords (0, 0, 1)
+			return target.copy( c );
+
+		}
+
+		const vb = d5 * d2 - d1 * d6;
+		if ( vb <= 0 && d2 >= 0 && d6 <= 0 ) {
+
+			w = d2 / ( d2 - d6 );
+			// edge region of AC; barycentric coords (1-w, 0, w)
+			return target.copy( a ).addScaledVector( _vac, w );
+
+		}
+
+		const va = d3 * d6 - d5 * d4;
+		if ( va <= 0 && ( d4 - d3 ) >= 0 && ( d5 - d6 ) >= 0 ) {
+
+			_vbc.subVectors( c, b );
+			w = ( d4 - d3 ) / ( ( d4 - d3 ) + ( d5 - d6 ) );
+			// edge region of BC; barycentric coords (0, 1-w, w)
+			return target.copy( b ).addScaledVector( _vbc, w ); // edge region of BC
+
+		}
+
+		// face region
+		const denom = 1 / ( va + vb + vc );
+		// u = va * denom
+		v = vb * denom;
+		w = vc * denom;
+
+		return target.copy( a ).addScaledVector( _vab, v ).addScaledVector( _vac, w );
+
+	}
+
+	/**
+	 * Returns `true` if this triangle is equal with the given one.
+	 *
+	 * @param {Triangle} triangle - The triangle to test for equality.
+	 * @return {boolean} Whether this triangle is equal with the given one.
+	 */
+	equals( triangle ) {
+
+		return triangle.a.equals( this.a ) && triangle.b.equals( this.b ) && triangle.c.equals( this.c );
+
+	}
+
+}
+
+/**
+ * Represents an axis-aligned bounding box (AABB) in 3D space.
+ */
+class Box3 {
+
+	/**
+	 * Constructs a new bounding box.
+	 *
+	 * @param {Vector3} [min=(Infinity,Infinity,Infinity)] - A vector representing the lower boundary of the box.
+	 * @param {Vector3} [max=(-Infinity,-Infinity,-Infinity)] - A vector representing the upper boundary of the box.
+	 */
+	constructor( min = new Vector3( + Infinity, + Infinity, + Infinity ), max = new Vector3( - Infinity, - Infinity, - Infinity ) ) {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isBox3 = true;
+
+		/**
+		 * The lower boundary of the box.
+		 *
+		 * @type {Vector3}
+		 */
+		this.min = min;
+
+		/**
+		 * The upper boundary of the box.
+		 *
+		 * @type {Vector3}
+		 */
+		this.max = max;
+
+	}
+
+	/**
+	 * Sets the lower and upper boundaries of this box.
+	 * Please note that this method only copies the values from the given objects.
+	 *
+	 * @param {Vector3} min - The lower boundary of the box.
+	 * @param {Vector3} max - The upper boundary of the box.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	set( min, max ) {
+
+		this.min.copy( min );
+		this.max.copy( max );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the upper and lower bounds of this box so it encloses the position data
+	 * in the given array.
+	 *
+	 * @param {Array<number>} array - An array holding 3D position data.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	setFromArray( array ) {
+
+		this.makeEmpty();
+
+		for ( let i = 0, il = array.length; i < il; i += 3 ) {
+
+			this.expandByPoint( _vector$b.fromArray( array, i ) );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the upper and lower bounds of this box so it encloses the position data
+	 * in the given buffer attribute.
+	 *
+	 * @param {BufferAttribute} attribute - A buffer attribute holding 3D position data.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	setFromBufferAttribute( attribute ) {
+
+		this.makeEmpty();
+
+		for ( let i = 0, il = attribute.count; i < il; i ++ ) {
+
+			this.expandByPoint( _vector$b.fromBufferAttribute( attribute, i ) );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the upper and lower bounds of this box so it encloses the position data
+	 * in the given array.
+	 *
+	 * @param {Array<Vector3>} points - An array holding 3D position data as instances of {@link Vector3}.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	setFromPoints( points ) {
+
+		this.makeEmpty();
+
+		for ( let i = 0, il = points.length; i < il; i ++ ) {
+
+			this.expandByPoint( points[ i ] );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Centers this box on the given center vector and sets this box's width, height and
+	 * depth to the given size values.
+	 *
+	 * @param {Vector3} center - The center of the box.
+	 * @param {Vector3} size - The x, y and z dimensions of the box.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	setFromCenterAndSize( center, size ) {
+
+		const halfSize = _vector$b.copy( size ).multiplyScalar( 0.5 );
+
+		this.min.copy( center ).sub( halfSize );
+		this.max.copy( center ).add( halfSize );
+
+		return this;
+
+	}
+
+	/**
+	 * Computes the world-axis-aligned bounding box for the given 3D object
+	 * (including its children), accounting for the object's, and children's,
+	 * world transforms. The function may result in a larger box than strictly necessary.
+	 *
+	 * Note: To compute the correct bounding box, make sure the given 3D object
+	 * has an up-to-date world matrix that reflects the current transformation of its
+	 * ancestor nodes. Call `object.updateWorldMatrix( true, false )` beforehand if
+	 * you're unsure.
+	 *
+	 * @param {Object3D} object - The 3D object to compute the bounding box for.
+	 * @param {boolean} [precise=false] - If set to `true`, the method computes the smallest
+	 * world-axis-aligned bounding box at the expense of more computation.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	setFromObject( object, precise = false ) {
+
+		this.makeEmpty();
+
+		return this.expandByObject( object, precise );
+
+	}
+
+	/**
+	 * Returns a new box with copied values from this instance.
+	 *
+	 * @return {Box3} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+	/**
+	 * Copies the values of the given box to this instance.
+	 *
+	 * @param {Box3} box - The box to copy.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	copy( box ) {
+
+		this.min.copy( box.min );
+		this.max.copy( box.max );
+
+		return this;
+
+	}
+
+	/**
+	 * Makes this box empty which means in encloses a zero space in 3D.
+	 *
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	makeEmpty() {
+
+		this.min.x = this.min.y = this.min.z = + Infinity;
+		this.max.x = this.max.y = this.max.z = - Infinity;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns true if this box includes zero points within its bounds.
+	 * Note that a box with equal lower and upper bounds still includes one
+	 * point, the one both bounds share.
+	 *
+	 * @return {boolean} Whether this box is empty or not.
+	 */
+	isEmpty() {
+
+		// this is a more robust check for empty than ( volume <= 0 ) because volume can get positive with two negative axes
+
+		return ( this.max.x < this.min.x ) || ( this.max.y < this.min.y ) || ( this.max.z < this.min.z );
+
+	}
+
+	/**
+	 * Returns the center point of this box.
+	 *
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The center point.
+	 */
+	getCenter( target ) {
+
+		return this.isEmpty() ? target.set( 0, 0, 0 ) : target.addVectors( this.min, this.max ).multiplyScalar( 0.5 );
+
+	}
+
+	/**
+	 * Returns the dimensions of this box.
+	 *
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The size.
+	 */
+	getSize( target ) {
+
+		return this.isEmpty() ? target.set( 0, 0, 0 ) : target.subVectors( this.max, this.min );
+
+	}
+
+	/**
+	 * Expands the boundaries of this box to include the given point.
+	 *
+	 * @param {Vector3} point - The point that should be included by the bounding box.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	expandByPoint( point ) {
+
+		this.min.min( point );
+		this.max.max( point );
+
+		return this;
+
+	}
+
+	/**
+	 * Expands this box equilaterally by the given vector. The width of this
+	 * box will be expanded by the x component of the vector in both
+	 * directions. The height of this box will be expanded by the y component of
+	 * the vector in both directions. The depth of this box will be
+	 * expanded by the z component of the vector in both directions.
+	 *
+	 * @param {Vector3} vector - The vector that should expand the bounding box.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	expandByVector( vector ) {
+
+		this.min.sub( vector );
+		this.max.add( vector );
+
+		return this;
+
+	}
+
+	/**
+	 * Expands each dimension of the box by the given scalar. If negative, the
+	 * dimensions of the box will be contracted.
+	 *
+	 * @param {number} scalar - The scalar value that should expand the bounding box.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	expandByScalar( scalar ) {
+
+		this.min.addScalar( - scalar );
+		this.max.addScalar( scalar );
+
+		return this;
+
+	}
+
+	/**
+	 * Expands the boundaries of this box to include the given 3D object and
+	 * its children, accounting for the object's, and children's, world
+	 * transforms. The function may result in a larger box than strictly
+	 * necessary (unless the precise parameter is set to true).
+	 *
+	 * @param {Object3D} object - The 3D object that should expand the bounding box.
+	 * @param {boolean} precise - If set to `true`, the method expands the bounding box
+	 * as little as necessary at the expense of more computation.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	expandByObject( object, precise = false ) {
+
+		// Computes the world-axis-aligned bounding box of an object (including its children),
+		// accounting for both the object's, and children's, world transforms
+
+		object.updateWorldMatrix( false, false );
+
+		const geometry = object.geometry;
+
+		if ( geometry !== undefined ) {
+
+			const positionAttribute = geometry.getAttribute( 'position' );
+
+			// precise AABB computation based on vertex data requires at least a position attribute.
+			// instancing isn't supported so far and uses the normal (conservative) code path.
+
+			if ( precise === true && positionAttribute !== undefined && object.isInstancedMesh !== true ) {
+
+				for ( let i = 0, l = positionAttribute.count; i < l; i ++ ) {
+
+					if ( object.isMesh === true ) {
+
+						object.getVertexPosition( i, _vector$b );
+
+					} else {
+
+						_vector$b.fromBufferAttribute( positionAttribute, i );
+
+					}
+
+					_vector$b.applyMatrix4( object.matrixWorld );
+					this.expandByPoint( _vector$b );
+
+				}
+
+			} else {
+
+				if ( object.boundingBox !== undefined ) {
+
+					// object-level bounding box
+
+					if ( object.boundingBox === null ) {
+
+						object.computeBoundingBox();
+
+					}
+
+					_box$4.copy( object.boundingBox );
+
+
+				} else {
+
+					// geometry-level bounding box
+
+					if ( geometry.boundingBox === null ) {
+
+						geometry.computeBoundingBox();
+
+					}
+
+					_box$4.copy( geometry.boundingBox );
+
+				}
+
+				_box$4.applyMatrix4( object.matrixWorld );
+
+				this.union( _box$4 );
+
+			}
+
+		}
+
+		const children = object.children;
+
+		for ( let i = 0, l = children.length; i < l; i ++ ) {
+
+			this.expandByObject( children[ i ], precise );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if the given point lies within or on the boundaries of this box.
+	 *
+	 * @param {Vector3} point - The point to test.
+	 * @return {boolean} Whether the bounding box contains the given point or not.
+	 */
+	containsPoint( point ) {
+
+		return point.x >= this.min.x && point.x <= this.max.x &&
+			point.y >= this.min.y && point.y <= this.max.y &&
+			point.z >= this.min.z && point.z <= this.max.z;
+
+	}
+
+	/**
+	 * Returns `true` if this bounding box includes the entirety of the given bounding box.
+	 * If this box and the given one are identical, this function also returns `true`.
+	 *
+	 * @param {Box3} box - The bounding box to test.
+	 * @return {boolean} Whether the bounding box contains the given bounding box or not.
+	 */
+	containsBox( box ) {
+
+		return this.min.x <= box.min.x && box.max.x <= this.max.x &&
+			this.min.y <= box.min.y && box.max.y <= this.max.y &&
+			this.min.z <= box.min.z && box.max.z <= this.max.z;
+
+	}
+
+	/**
+	 * Returns a point as a proportion of this box's width, height and depth.
+	 *
+	 * @param {Vector3} point - A point in 3D space.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} A point as a proportion of this box's width, height and depth.
+	 */
+	getParameter( point, target ) {
+
+		// This can potentially have a divide by zero if the box
+		// has a size dimension of 0.
+
+		return target.set(
+			( point.x - this.min.x ) / ( this.max.x - this.min.x ),
+			( point.y - this.min.y ) / ( this.max.y - this.min.y ),
+			( point.z - this.min.z ) / ( this.max.z - this.min.z )
+		);
+
+	}
+
+	/**
+	 * Returns `true` if the given bounding box intersects with this bounding box.
+	 *
+	 * @param {Box3} box - The bounding box to test.
+	 * @return {boolean} Whether the given bounding box intersects with this bounding box.
+	 */
+	intersectsBox( box ) {
+
+		// using 6 splitting planes to rule out intersections.
+		return box.max.x >= this.min.x && box.min.x <= this.max.x &&
+			box.max.y >= this.min.y && box.min.y <= this.max.y &&
+			box.max.z >= this.min.z && box.min.z <= this.max.z;
+
+	}
+
+	/**
+	 * Returns `true` if the given bounding sphere intersects with this bounding box.
+	 *
+	 * @param {Sphere} sphere - The bounding sphere to test.
+	 * @return {boolean} Whether the given bounding sphere intersects with this bounding box.
+	 */
+	intersectsSphere( sphere ) {
+
+		// Find the point on the AABB closest to the sphere center.
+		this.clampPoint( sphere.center, _vector$b );
+
+		// If that point is inside the sphere, the AABB and sphere intersect.
+		return _vector$b.distanceToSquared( sphere.center ) <= ( sphere.radius * sphere.radius );
+
+	}
+
+	/**
+	 * Returns `true` if the given plane intersects with this bounding box.
+	 *
+	 * @param {Plane} plane - The plane to test.
+	 * @return {boolean} Whether the given plane intersects with this bounding box.
+	 */
+	intersectsPlane( plane ) {
+
+		// We compute the minimum and maximum dot product values. If those values
+		// are on the same side (back or front) of the plane, then there is no intersection.
+
+		let min, max;
+
+		if ( plane.normal.x > 0 ) {
+
+			min = plane.normal.x * this.min.x;
+			max = plane.normal.x * this.max.x;
+
+		} else {
+
+			min = plane.normal.x * this.max.x;
+			max = plane.normal.x * this.min.x;
+
+		}
+
+		if ( plane.normal.y > 0 ) {
+
+			min += plane.normal.y * this.min.y;
+			max += plane.normal.y * this.max.y;
+
+		} else {
+
+			min += plane.normal.y * this.max.y;
+			max += plane.normal.y * this.min.y;
+
+		}
+
+		if ( plane.normal.z > 0 ) {
+
+			min += plane.normal.z * this.min.z;
+			max += plane.normal.z * this.max.z;
+
+		} else {
+
+			min += plane.normal.z * this.max.z;
+			max += plane.normal.z * this.min.z;
+
+		}
+
+		return ( min <= - plane.constant && max >= - plane.constant );
+
+	}
+
+	/**
+	 * Returns `true` if the given triangle intersects with this bounding box.
+	 *
+	 * @param {Triangle} triangle - The triangle to test.
+	 * @return {boolean} Whether the given triangle intersects with this bounding box.
+	 */
+	intersectsTriangle( triangle ) {
+
+		if ( this.isEmpty() ) {
+
+			return false;
+
+		}
+
+		// compute box center and extents
+		this.getCenter( _center );
+		_extents.subVectors( this.max, _center );
+
+		// translate triangle to aabb origin
+		_v0$1.subVectors( triangle.a, _center );
+		_v1$4.subVectors( triangle.b, _center );
+		_v2$3.subVectors( triangle.c, _center );
+
+		// compute edge vectors for triangle
+		_f0.subVectors( _v1$4, _v0$1 );
+		_f1.subVectors( _v2$3, _v1$4 );
+		_f2.subVectors( _v0$1, _v2$3 );
+
+		// test against axes that are given by cross product combinations of the edges of the triangle and the edges of the aabb
+		// make an axis testing of each of the 3 sides of the aabb against each of the 3 sides of the triangle = 9 axis of separation
+		// axis_ij = u_i x f_j (u0, u1, u2 = face normals of aabb = x,y,z axes vectors since aabb is axis aligned)
+		let axes = [
+			0, - _f0.z, _f0.y, 0, - _f1.z, _f1.y, 0, - _f2.z, _f2.y,
+			_f0.z, 0, - _f0.x, _f1.z, 0, - _f1.x, _f2.z, 0, - _f2.x,
+			- _f0.y, _f0.x, 0, - _f1.y, _f1.x, 0, - _f2.y, _f2.x, 0
+		];
+		if ( ! satForAxes( axes, _v0$1, _v1$4, _v2$3, _extents ) ) {
+
+			return false;
+
+		}
+
+		// test 3 face normals from the aabb
+		axes = [ 1, 0, 0, 0, 1, 0, 0, 0, 1 ];
+		if ( ! satForAxes( axes, _v0$1, _v1$4, _v2$3, _extents ) ) {
+
+			return false;
+
+		}
+
+		// finally testing the face normal of the triangle
+		// use already existing triangle edge vectors here
+		_triangleNormal.crossVectors( _f0, _f1 );
+		axes = [ _triangleNormal.x, _triangleNormal.y, _triangleNormal.z ];
+
+		return satForAxes( axes, _v0$1, _v1$4, _v2$3, _extents );
+
+	}
+
+	/**
+	 * Clamps the given point within the bounds of this box.
+	 *
+	 * @param {Vector3} point - The point to clamp.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The clamped point.
+	 */
+	clampPoint( point, target ) {
+
+		return target.copy( point ).clamp( this.min, this.max );
+
+	}
+
+	/**
+	 * Returns the euclidean distance from any edge of this box to the specified point. If
+	 * the given point lies inside of this box, the distance will be `0`.
+	 *
+	 * @param {Vector3} point - The point to compute the distance to.
+	 * @return {number} The euclidean distance.
+	 */
+	distanceToPoint( point ) {
+
+		return this.clampPoint( point, _vector$b ).distanceTo( point );
+
+	}
+
+	/**
+	 * Returns a bounding sphere that encloses this bounding box.
+	 *
+	 * @param {Sphere} target - The target sphere that is used to store the method's result.
+	 * @return {Sphere} The bounding sphere that encloses this bounding box.
+	 */
+	getBoundingSphere( target ) {
+
+		if ( this.isEmpty() ) {
+
+			target.makeEmpty();
+
+		} else {
+
+			this.getCenter( target.center );
+
+			target.radius = this.getSize( _vector$b ).length() * 0.5;
+
+		}
+
+		return target;
+
+	}
+
+	/**
+	 * Computes the intersection of this bounding box and the given one, setting the upper
+	 * bound of this box to the lesser of the two boxes' upper bounds and the
+	 * lower bound of this box to the greater of the two boxes' lower bounds. If
+	 * there's no overlap, makes this box empty.
+	 *
+	 * @param {Box3} box - The bounding box to intersect with.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	intersect( box ) {
+
+		this.min.max( box.min );
+		this.max.min( box.max );
+
+		// ensure that if there is no overlap, the result is fully empty, not slightly empty with non-inf/+inf values that will cause subsequence intersects to erroneously return valid values.
+		if ( this.isEmpty() ) this.makeEmpty();
+
+		return this;
+
+	}
+
+	/**
+	 * Computes the union of this box and another and the given one, setting the upper
+	 * bound of this box to the greater of the two boxes' upper bounds and the
+	 * lower bound of this box to the lesser of the two boxes' lower bounds.
+	 *
+	 * @param {Box3} box - The bounding box that will be unioned with this instance.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	union( box ) {
+
+		this.min.min( box.min );
+		this.max.max( box.max );
+
+		return this;
+
+	}
+
+	/**
+	 * Transforms this bounding box by the given 4x4 transformation matrix.
+	 *
+	 * @param {Matrix4} matrix - The transformation matrix.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	applyMatrix4( matrix ) {
+
+		// transform of empty box is an empty box.
+		if ( this.isEmpty() ) return this;
+
+		// NOTE: I am using a binary pattern to specify all 2^3 combinations below
+		_points[ 0 ].set( this.min.x, this.min.y, this.min.z ).applyMatrix4( matrix ); // 000
+		_points[ 1 ].set( this.min.x, this.min.y, this.max.z ).applyMatrix4( matrix ); // 001
+		_points[ 2 ].set( this.min.x, this.max.y, this.min.z ).applyMatrix4( matrix ); // 010
+		_points[ 3 ].set( this.min.x, this.max.y, this.max.z ).applyMatrix4( matrix ); // 011
+		_points[ 4 ].set( this.max.x, this.min.y, this.min.z ).applyMatrix4( matrix ); // 100
+		_points[ 5 ].set( this.max.x, this.min.y, this.max.z ).applyMatrix4( matrix ); // 101
+		_points[ 6 ].set( this.max.x, this.max.y, this.min.z ).applyMatrix4( matrix ); // 110
+		_points[ 7 ].set( this.max.x, this.max.y, this.max.z ).applyMatrix4( matrix ); // 111
+
+		this.setFromPoints( _points );
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given offset to both the upper and lower bounds of this bounding box,
+	 * effectively moving it in 3D space.
+	 *
+	 * @param {Vector3} offset - The offset that should be used to translate the bounding box.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	translate( offset ) {
+
+		this.min.add( offset );
+		this.max.add( offset );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this bounding box is equal with the given one.
+	 *
+	 * @param {Box3} box - The box to test for equality.
+	 * @return {boolean} Whether this bounding box is equal with the given one.
+	 */
+	equals( box ) {
+
+		return box.min.equals( this.min ) && box.max.equals( this.max );
+
+	}
+
+	/**
+	 * Returns a serialized structure of the bounding box.
+	 *
+	 * @return {Object} Serialized structure with fields representing the object state.
+	 */
+	toJSON() {
+
+		return {
+			min: this.min.toArray(),
+			max: this.max.toArray()
+		};
+
+	}
+
+	/**
+	 * Returns a serialized structure of the bounding box.
+	 *
+	 * @param {Object} json - The serialized json to set the box from.
+	 * @return {Box3} A reference to this bounding box.
+	 */
+	fromJSON( json ) {
+
+		this.min.fromArray( json.min );
+		this.max.fromArray( json.max );
+		return this;
+
+	}
+
+}
+
+const _points = [
+	/*@__PURE__*/ new Vector3(),
+	/*@__PURE__*/ new Vector3(),
+	/*@__PURE__*/ new Vector3(),
+	/*@__PURE__*/ new Vector3(),
+	/*@__PURE__*/ new Vector3(),
+	/*@__PURE__*/ new Vector3(),
+	/*@__PURE__*/ new Vector3(),
+	/*@__PURE__*/ new Vector3()
+];
+
+const _vector$b = /*@__PURE__*/ new Vector3();
+
+const _box$4 = /*@__PURE__*/ new Box3();
+
+// triangle centered vertices
+
+const _v0$1 = /*@__PURE__*/ new Vector3();
+const _v1$4 = /*@__PURE__*/ new Vector3();
+const _v2$3 = /*@__PURE__*/ new Vector3();
+
+// triangle edge vectors
+
+const _f0 = /*@__PURE__*/ new Vector3();
+const _f1 = /*@__PURE__*/ new Vector3();
+const _f2 = /*@__PURE__*/ new Vector3();
+
+const _center = /*@__PURE__*/ new Vector3();
+const _extents = /*@__PURE__*/ new Vector3();
+const _triangleNormal = /*@__PURE__*/ new Vector3();
+const _testAxis = /*@__PURE__*/ new Vector3();
+
+function satForAxes( axes, v0, v1, v2, extents ) {
+
+	for ( let i = 0, j = axes.length - 3; i <= j; i += 3 ) {
+
+		_testAxis.fromArray( axes, i );
+		// project the aabb onto the separating axis
+		const r = extents.x * Math.abs( _testAxis.x ) + extents.y * Math.abs( _testAxis.y ) + extents.z * Math.abs( _testAxis.z );
+		// project all 3 vertices of the triangle onto the separating axis
+		const p0 = v0.dot( _testAxis );
+		const p1 = v1.dot( _testAxis );
+		const p2 = v2.dot( _testAxis );
+		// actual test, basically see if either of the most extreme of the triangle points intersects r
+		if ( Math.max( - Math.max( p0, p1, p2 ), Math.min( p0, p1, p2 ) ) > r ) {
+
+			// points of the projected triangle are outside the projected half-length of the aabb
+			// the axis is separating and we can exit
+			return false;
+
+		}
+
+	}
+
+	return true;
+
+}
+
+// Fast Half Float Conversions, http://www.fox-toolkit.org/ftp/fasthalffloatconversion.pdf
+
+const _tables = /*@__PURE__*/ _generateTables();
+
+function _generateTables() {
+
+	// float32 to float16 helpers
+
+	const buffer = new ArrayBuffer( 4 );
+	const floatView = new Float32Array( buffer );
+	const uint32View = new Uint32Array( buffer );
+
+	const baseTable = new Uint32Array( 512 );
+	const shiftTable = new Uint32Array( 512 );
+
+	for ( let i = 0; i < 256; ++ i ) {
+
+		const e = i - 127;
+
+		// very small number (0, -0)
+
+		if ( e < -27 ) {
+
+			baseTable[ i ] = 0x0000;
+			baseTable[ i | 0x100 ] = 0x8000;
+			shiftTable[ i ] = 24;
+			shiftTable[ i | 0x100 ] = 24;
+
+			// small number (denorm)
+
+		} else if ( e < -14 ) {
+
+			baseTable[ i ] = 0x0400 >> ( - e - 14 );
+			baseTable[ i | 0x100 ] = ( 0x0400 >> ( - e - 14 ) ) | 0x8000;
+			shiftTable[ i ] = - e - 1;
+			shiftTable[ i | 0x100 ] = - e - 1;
+
+			// normal number
+
+		} else if ( e <= 15 ) {
+
+			baseTable[ i ] = ( e + 15 ) << 10;
+			baseTable[ i | 0x100 ] = ( ( e + 15 ) << 10 ) | 0x8000;
+			shiftTable[ i ] = 13;
+			shiftTable[ i | 0x100 ] = 13;
+
+			// large number (Infinity, -Infinity)
+
+		} else if ( e < 128 ) {
+
+			baseTable[ i ] = 0x7c00;
+			baseTable[ i | 0x100 ] = 0xfc00;
+			shiftTable[ i ] = 24;
+			shiftTable[ i | 0x100 ] = 24;
+
+			// stay (NaN, Infinity, -Infinity)
+
+		} else {
+
+			baseTable[ i ] = 0x7c00;
+			baseTable[ i | 0x100 ] = 0xfc00;
+			shiftTable[ i ] = 13;
+			shiftTable[ i | 0x100 ] = 13;
+
+		}
+
+	}
+
+	// float16 to float32 helpers
+
+	const mantissaTable = new Uint32Array( 2048 );
+	const exponentTable = new Uint32Array( 64 );
+	const offsetTable = new Uint32Array( 64 );
+
+	for ( let i = 1; i < 1024; ++ i ) {
+
+		let m = i << 13; // zero pad mantissa bits
+		let e = 0; // zero exponent
+
+		// normalized
+		while ( ( m & 0x00800000 ) === 0 ) {
+
+			m <<= 1;
+			e -= 0x00800000; // decrement exponent
+
+		}
+
+		m &= -8388609; // clear leading 1 bit
+		e += 0x38800000; // adjust bias
+
+		mantissaTable[ i ] = m | e;
+
+	}
+
+	for ( let i = 1024; i < 2048; ++ i ) {
+
+		mantissaTable[ i ] = 0x38000000 + ( ( i - 1024 ) << 13 );
+
+	}
+
+	for ( let i = 1; i < 31; ++ i ) {
+
+		exponentTable[ i ] = i << 23;
+
+	}
+
+	exponentTable[ 31 ] = 0x47800000;
+	exponentTable[ 32 ] = 0x80000000;
+
+	for ( let i = 33; i < 63; ++ i ) {
+
+		exponentTable[ i ] = 0x80000000 + ( ( i - 32 ) << 23 );
+
+	}
+
+	exponentTable[ 63 ] = 0xc7800000;
+
+	for ( let i = 1; i < 64; ++ i ) {
+
+		if ( i !== 32 ) {
+
+			offsetTable[ i ] = 1024;
+
+		}
+
+	}
+
+	return {
+		floatView: floatView,
+		uint32View: uint32View,
+		baseTable: baseTable,
+		shiftTable: shiftTable,
+		mantissaTable: mantissaTable,
+		exponentTable: exponentTable,
+		offsetTable: offsetTable
+	};
+
+}
+
+/**
+ * Returns a half precision floating point value (FP16) from the given single
+ * precision floating point value (FP32).
+ *
+ * @param {number} val - A single precision floating point value.
+ * @return {number} The FP16 value.
+ */
+function toHalfFloat( val ) {
+
+	if ( Math.abs( val ) > 65504 ) warn( 'DataUtils.toHalfFloat(): Value out of range.' );
+
+	val = clamp( val, -65504, 65504 );
+
+	_tables.floatView[ 0 ] = val;
+	const f = _tables.uint32View[ 0 ];
+	const e = ( f >> 23 ) & 0x1ff;
+	return _tables.baseTable[ e ] + ( ( f & 0x007fffff ) >> _tables.shiftTable[ e ] );
+
+}
+
+/**
+ * Returns a single precision floating point value (FP32) from the given half
+ * precision floating point value (FP16).
+ *
+ * @param {number} val - A half precision floating point value.
+ * @return {number} The FP32 value.
+ */
+function fromHalfFloat( val ) {
+
+	const m = val >> 10;
+	_tables.uint32View[ 0 ] = _tables.mantissaTable[ _tables.offsetTable[ m ] + ( val & 0x3ff ) ] + _tables.exponentTable[ m ];
+	return _tables.floatView[ 0 ];
+
+}
+
+/**
+ * A class containing utility functions for data.
+ *
+ * @hideconstructor
+ */
+class DataUtils {
+
+	/**
+	 * Returns a half precision floating point value (FP16) from the given single
+	 * precision floating point value (FP32).
+	 *
+	 * @param {number} val - A single precision floating point value.
+	 * @return {number} The FP16 value.
+	 */
+	static toHalfFloat( val ) {
+
+		return toHalfFloat( val );
+
+	}
+
+	/**
+	 * Returns a single precision floating point value (FP32) from the given half
+	 * precision floating point value (FP16).
+	 *
+	 * @param {number} val - A half precision floating point value.
+	 * @return {number} The FP32 value.
+	 */
+	static fromHalfFloat( val ) {
+
+		return fromHalfFloat( val );
+
+	}
+
+}
+
+const _vector$a = /*@__PURE__*/ new Vector3();
+const _vector2$1 = /*@__PURE__*/ new Vector2();
+
+let _id$2 = 0;
+
+/**
+ * This class stores data for an attribute (such as vertex positions, face
+ * indices, normals, colors, UVs, and any custom attributes ) associated with
+ * a geometry, which allows for more efficient passing of data to the GPU.
+ *
+ * When working with vector-like data, the `fromBufferAttribute( attribute, index )`
+ * helper methods on vector and color class might be helpful. E.g. {@link Vector3#fromBufferAttribute}.
+ */
+class BufferAttribute extends EventDispatcher {
+
+	/**
+	 * Constructs a new buffer attribute.
+	 *
+	 * @param {TypedArray} array - The array holding the attribute data.
+	 * @param {number} itemSize - The item size.
+	 * @param {boolean} [normalized=false] - Whether the data are normalized or not.
+	 */
+	constructor( array, itemSize, normalized = false ) {
+
+		super();
+
+		if ( Array.isArray( array ) ) {
+
+			throw new TypeError( 'THREE.BufferAttribute: array should be a Typed Array.' );
+
+		}
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isBufferAttribute = true;
+
+		/**
+		 * The ID of the buffer attribute.
+		 *
+		 * @name BufferAttribute#id
+		 * @type {number}
+		 * @readonly
+		 */
+		Object.defineProperty( this, 'id', { value: _id$2 ++ } );
+
+		/**
+		 * The name of the buffer attribute.
+		 *
+		 * @type {string}
+		 */
+		this.name = '';
+
+		/**
+		 * The array holding the attribute data. It should have `itemSize * numVertices`
+		 * elements, where `numVertices` is the number of vertices in the associated geometry.
+		 *
+		 * @type {TypedArray}
+		 */
+		this.array = array;
+
+		/**
+		 * The number of values of the array that should be associated with a particular vertex.
+		 * For instance, if this attribute is storing a 3-component vector (such as a position,
+		 * normal, or color), then the value should be `3`.
+		 *
+		 * @type {number}
+		 */
+		this.itemSize = itemSize;
+
+		/**
+		 * Represents the number of items this buffer attribute stores. It is internally computed
+		 * by dividing the `array` length by the `itemSize`.
+		 *
+		 * @type {number}
+		 * @readonly
+		 */
+		this.count = array !== undefined ? array.length / itemSize : 0;
+
+		/**
+		 * Applies to integer data only. Indicates how the underlying data in the buffer maps to
+		 * the values in the GLSL code. For instance, if `array` is an instance of `UInt16Array`,
+		 * and `normalized` is `true`, the values `0 - +65535` in the array data will be mapped to
+		 * `0.0f - +1.0f` in the GLSL attribute. If `normalized` is `false`, the values will be converted
+		 * to floats unmodified, i.e. `65535` becomes `65535.0f`.
+		 *
+		 * @type {boolean}
+		 */
+		this.normalized = normalized;
+
+		/**
+		 * Defines the intended usage pattern of the data store for optimization purposes.
+		 *
+		 * Note: After the initial use of a buffer, its usage cannot be changed. Instead,
+		 * instantiate a new one and set the desired usage before the next render.
+		 *
+		 * @type {(StaticDrawUsage|DynamicDrawUsage|StreamDrawUsage|StaticReadUsage|DynamicReadUsage|StreamReadUsage|StaticCopyUsage|DynamicCopyUsage|StreamCopyUsage)}
+		 * @default StaticDrawUsage
+		 */
+		this.usage = StaticDrawUsage;
+
+		/**
+		 * This can be used to only update some components of stored vectors (for example, just the
+		 * component related to color). Use the `addUpdateRange()` function to add ranges to this array.
+		 *
+		 * @type {Array<Object>}
+		 */
+		this.updateRanges = [];
+
+		/**
+		 * Configures the bound GPU type for use in shaders.
+		 *
+		 * Note: this only has an effect for integer arrays and is not configurable for float arrays.
+		 * For lower precision float types, use `Float16BufferAttribute`.
+		 *
+		 * @type {(FloatType|IntType)}
+		 * @default FloatType
+		 */
+		this.gpuType = FloatType;
+
+		/**
+		 * A version number, incremented every time the `needsUpdate` is set to `true`.
+		 *
+		 * @type {number}
+		 */
+		this.version = 0;
+
+	}
+
+	/**
+	 * A callback function that is executed after the renderer has transferred the attribute
+	 * array data to the GPU.
+	 */
+	onUploadCallback() {}
+
+	/**
+	 * Flag to indicate that this attribute has changed and should be re-sent to
+	 * the GPU. Set this to `true` when you modify the value of the array.
+	 *
+	 * @type {number}
+	 * @default false
+	 * @param {boolean} value
+	 */
+	set needsUpdate( value ) {
+
+		if ( value === true ) this.version ++;
+
+	}
+
+	/**
+	 * Sets the usage of this buffer attribute.
+	 *
+	 * @param {(StaticDrawUsage|DynamicDrawUsage|StreamDrawUsage|StaticReadUsage|DynamicReadUsage|StreamReadUsage|StaticCopyUsage|DynamicCopyUsage|StreamCopyUsage)} value - The usage to set.
+	 * @return {BufferAttribute} A reference to this buffer attribute.
+	 */
+	setUsage( value ) {
+
+		this.usage = value;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds a range of data in the data array to be updated on the GPU.
+	 *
+	 * @param {number} start - Position at which to start update.
+	 * @param {number} count - The number of components to update.
+	 */
+	addUpdateRange( start, count ) {
+
+		this.updateRanges.push( { start, count } );
+
+	}
+
+	/**
+	 * Clears the update ranges.
+	 */
+	clearUpdateRanges() {
+
+		this.updateRanges.length = 0;
+
+	}
+
+	/**
+	 * Copies the values of the given buffer attribute to this instance.
+	 *
+	 * @param {BufferAttribute} source - The buffer attribute to copy.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	copy( source ) {
+
+		this.name = source.name;
+		this.array = new source.array.constructor( source.array );
+		this.itemSize = source.itemSize;
+		this.count = source.count;
+		this.normalized = source.normalized;
+
+		this.usage = source.usage;
+		this.gpuType = source.gpuType;
+
+		return this;
+
+	}
+
+	/**
+	 * Copies a vector from the given buffer attribute to this one. The start
+	 * and destination position in the attribute buffers are represented by the
+	 * given indices.
+	 *
+	 * @param {number} index1 - The destination index into this buffer attribute.
+	 * @param {BufferAttribute} attribute - The buffer attribute to copy from.
+	 * @param {number} index2 - The source index into the given buffer attribute.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	copyAt( index1, attribute, index2 ) {
+
+		index1 *= this.itemSize;
+		index2 *= attribute.itemSize;
+
+		for ( let i = 0, l = this.itemSize; i < l; i ++ ) {
+
+			this.array[ index1 + i ] = attribute.array[ index2 + i ];
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Copies the given array data into this buffer attribute.
+	 *
+	 * @param {(TypedArray|Array)} array - The array to copy.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	copyArray( array ) {
+
+		this.array.set( array );
+
+		return this;
+
+	}
+
+	/**
+	 * Applies the given 3x3 matrix to the given attribute. Works with
+	 * item size `2` and `3`.
+	 *
+	 * @param {Matrix3} m - The matrix to apply.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	applyMatrix3( m ) {
+
+		if ( this.itemSize === 2 ) {
+
+			for ( let i = 0, l = this.count; i < l; i ++ ) {
+
+				_vector2$1.fromBufferAttribute( this, i );
+				_vector2$1.applyMatrix3( m );
+
+				this.setXY( i, _vector2$1.x, _vector2$1.y );
+
+			}
+
+		} else if ( this.itemSize === 3 ) {
+
+			for ( let i = 0, l = this.count; i < l; i ++ ) {
+
+				_vector$a.fromBufferAttribute( this, i );
+				_vector$a.applyMatrix3( m );
+
+				this.setXYZ( i, _vector$a.x, _vector$a.y, _vector$a.z );
+
+			}
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Applies the given 4x4 matrix to the given attribute. Only works with
+	 * item size `3`.
+	 *
+	 * @param {Matrix4} m - The matrix to apply.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	applyMatrix4( m ) {
+
+		for ( let i = 0, l = this.count; i < l; i ++ ) {
+
+			_vector$a.fromBufferAttribute( this, i );
+
+			_vector$a.applyMatrix4( m );
+
+			this.setXYZ( i, _vector$a.x, _vector$a.y, _vector$a.z );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Applies the given 3x3 normal matrix to the given attribute. Only works with
+	 * item size `3`.
+	 *
+	 * @param {Matrix3} m - The normal matrix to apply.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	applyNormalMatrix( m ) {
+
+		for ( let i = 0, l = this.count; i < l; i ++ ) {
+
+			_vector$a.fromBufferAttribute( this, i );
+
+			_vector$a.applyNormalMatrix( m );
+
+			this.setXYZ( i, _vector$a.x, _vector$a.y, _vector$a.z );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Applies the given 4x4 matrix to the given attribute. Only works with
+	 * item size `3` and with direction vectors.
+	 *
+	 * @param {Matrix4} m - The matrix to apply.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	transformDirection( m ) {
+
+		for ( let i = 0, l = this.count; i < l; i ++ ) {
+
+			_vector$a.fromBufferAttribute( this, i );
+
+			_vector$a.transformDirection( m );
+
+			this.setXYZ( i, _vector$a.x, _vector$a.y, _vector$a.z );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the given array data in the buffer attribute.
+	 *
+	 * @param {(TypedArray|Array)} value - The array data to set.
+	 * @param {number} [offset=0] - The offset in this buffer attribute's array.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	set( value, offset = 0 ) {
+
+		// Matching BufferAttribute constructor, do not normalize the array.
+		this.array.set( value, offset );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the given component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} component - The component index.
+	 * @return {number} The returned value.
+	 */
+	getComponent( index, component ) {
+
+		let value = this.array[ index * this.itemSize + component ];
+
+		if ( this.normalized ) value = denormalize( value, this.array );
+
+		return value;
+
+	}
+
+	/**
+	 * Sets the given value to the given component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} component - The component index.
+	 * @param {number} value - The value to set.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	setComponent( index, component, value ) {
+
+		if ( this.normalized ) value = normalize( value, this.array );
+
+		this.array[ index * this.itemSize + component ] = value;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the x component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @return {number} The x component.
+	 */
+	getX( index ) {
+
+		let x = this.array[ index * this.itemSize ];
+
+		if ( this.normalized ) x = denormalize( x, this.array );
+
+		return x;
+
+	}
+
+	/**
+	 * Sets the x component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} x - The value to set.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	setX( index, x ) {
+
+		if ( this.normalized ) x = normalize( x, this.array );
+
+		this.array[ index * this.itemSize ] = x;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the y component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @return {number} The y component.
+	 */
+	getY( index ) {
+
+		let y = this.array[ index * this.itemSize + 1 ];
+
+		if ( this.normalized ) y = denormalize( y, this.array );
+
+		return y;
+
+	}
+
+	/**
+	 * Sets the y component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} y - The value to set.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	setY( index, y ) {
+
+		if ( this.normalized ) y = normalize( y, this.array );
+
+		this.array[ index * this.itemSize + 1 ] = y;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the z component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @return {number} The z component.
+	 */
+	getZ( index ) {
+
+		let z = this.array[ index * this.itemSize + 2 ];
+
+		if ( this.normalized ) z = denormalize( z, this.array );
+
+		return z;
+
+	}
+
+	/**
+	 * Sets the z component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} z - The value to set.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	setZ( index, z ) {
+
+		if ( this.normalized ) z = normalize( z, this.array );
+
+		this.array[ index * this.itemSize + 2 ] = z;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the w component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @return {number} The w component.
+	 */
+	getW( index ) {
+
+		let w = this.array[ index * this.itemSize + 3 ];
+
+		if ( this.normalized ) w = denormalize( w, this.array );
+
+		return w;
+
+	}
+
+	/**
+	 * Sets the w component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} w - The value to set.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	setW( index, w ) {
+
+		if ( this.normalized ) w = normalize( w, this.array );
+
+		this.array[ index * this.itemSize + 3 ] = w;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the x and y component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} x - The value for the x component to set.
+	 * @param {number} y - The value for the y component to set.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	setXY( index, x, y ) {
+
+		index *= this.itemSize;
+
+		if ( this.normalized ) {
+
+			x = normalize( x, this.array );
+			y = normalize( y, this.array );
+
+		}
+
+		this.array[ index + 0 ] = x;
+		this.array[ index + 1 ] = y;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the x, y and z component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} x - The value for the x component to set.
+	 * @param {number} y - The value for the y component to set.
+	 * @param {number} z - The value for the z component to set.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	setXYZ( index, x, y, z ) {
+
+		index *= this.itemSize;
+
+		if ( this.normalized ) {
+
+			x = normalize( x, this.array );
+			y = normalize( y, this.array );
+			z = normalize( z, this.array );
+
+		}
+
+		this.array[ index + 0 ] = x;
+		this.array[ index + 1 ] = y;
+		this.array[ index + 2 ] = z;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the x, y, z and w component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} x - The value for the x component to set.
+	 * @param {number} y - The value for the y component to set.
+	 * @param {number} z - The value for the z component to set.
+	 * @param {number} w - The value for the w component to set.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	setXYZW( index, x, y, z, w ) {
+
+		index *= this.itemSize;
+
+		if ( this.normalized ) {
+
+			x = normalize( x, this.array );
+			y = normalize( y, this.array );
+			z = normalize( z, this.array );
+			w = normalize( w, this.array );
+
+		}
+
+		this.array[ index + 0 ] = x;
+		this.array[ index + 1 ] = y;
+		this.array[ index + 2 ] = z;
+		this.array[ index + 3 ] = w;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the given callback function that is executed after the Renderer has transferred
+	 * the attribute array data to the GPU. Can be used to perform clean-up operations after
+	 * the upload when attribute data are not needed anymore on the CPU side.
+	 *
+	 * @param {Function} callback - The `onUpload()` callback.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	onUpload( callback ) {
+
+		this.onUploadCallback = callback;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new buffer attribute with copied values from this instance.
+	 *
+	 * @return {BufferAttribute} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor( this.array, this.itemSize ).copy( this );
+
+	}
+
+	/**
+	 * Serializes the buffer attribute into JSON.
+	 *
+	 * @return {Object} A JSON object representing the serialized buffer attribute.
+	 */
+	toJSON() {
+
+		const data = {
+			itemSize: this.itemSize,
+			type: this.array.constructor.name,
+			array: Array.from( this.array ),
+			normalized: this.normalized
+		};
+
+		data.name = this.name;
+		data.usage = this.usage;
+		data.gpuType = this.gpuType;
+
+		return data;
+
+	}
+
+	/**
+	 * Disposes of the buffer attribute. Available only in {@link WebGPURenderer}.
+	 */
+	dispose() {
+
+		this.dispatchEvent( { type: 'dispose' } );
+
+	}
+
+}
+
+/**
+ * Convenient class that can be used when creating a `Int8` buffer attribute with
+ * a plain `Array` instance.
+ *
+ * @augments BufferAttribute
+ */
+class Int8BufferAttribute extends BufferAttribute {
+
+	/**
+	 * Constructs a new buffer attribute.
+	 *
+	 * @param {(Array<number>|Int8Array)} array - The array holding the attribute data.
+	 * @param {number} itemSize - The item size.
+	 * @param {boolean} [normalized=false] - Whether the data are normalized or not.
+	 */
+	constructor( array, itemSize, normalized ) {
+
+		super( new Int8Array( array ), itemSize, normalized );
+
+	}
+
+}
+
+/**
+ * Convenient class that can be used when creating a `UInt8` buffer attribute with
+ * a plain `Array` instance.
+ *
+ * @augments BufferAttribute
+ */
+class Uint8BufferAttribute extends BufferAttribute {
+
+	/**
+	 * Constructs a new buffer attribute.
+	 *
+	 * @param {(Array<number>|Uint8Array)} array - The array holding the attribute data.
+	 * @param {number} itemSize - The item size.
+	 * @param {boolean} [normalized=false] - Whether the data are normalized or not.
+	 */
+	constructor( array, itemSize, normalized ) {
+
+		super( new Uint8Array( array ), itemSize, normalized );
+
+	}
+
+}
+
+/**
+ * Convenient class that can be used when creating a `UInt8Clamped` buffer attribute with
+ * a plain `Array` instance.
+ *
+ * @augments BufferAttribute
+ */
+class Uint8ClampedBufferAttribute extends BufferAttribute {
+
+	/**
+	 * Constructs a new buffer attribute.
+	 *
+	 * @param {(Array<number>|Uint8ClampedArray)} array - The array holding the attribute data.
+	 * @param {number} itemSize - The item size.
+	 * @param {boolean} [normalized=false] - Whether the data are normalized or not.
+	 */
+	constructor( array, itemSize, normalized ) {
+
+		super( new Uint8ClampedArray( array ), itemSize, normalized );
+
+	}
+
+}
+
+/**
+ * Convenient class that can be used when creating a `Int16` buffer attribute with
+ * a plain `Array` instance.
+ *
+ * @augments BufferAttribute
+ */
+class Int16BufferAttribute extends BufferAttribute {
+
+	/**
+	 * Constructs a new buffer attribute.
+	 *
+	 * @param {(Array<number>|Int16Array)} array - The array holding the attribute data.
+	 * @param {number} itemSize - The item size.
+	 * @param {boolean} [normalized=false] - Whether the data are normalized or not.
+	 */
+	constructor( array, itemSize, normalized ) {
+
+		super( new Int16Array( array ), itemSize, normalized );
+
+	}
+
+}
+
+/**
+ * Convenient class that can be used when creating a `UInt16` buffer attribute with
+ * a plain `Array` instance.
+ *
+ * @augments BufferAttribute
+ */
+class Uint16BufferAttribute extends BufferAttribute {
+
+	/**
+	 * Constructs a new buffer attribute.
+	 *
+	 * @param {(Array<number>|Uint16Array)} array - The array holding the attribute data.
+	 * @param {number} itemSize - The item size.
+	 * @param {boolean} [normalized=false] - Whether the data are normalized or not.
+	 */
+	constructor( array, itemSize, normalized ) {
+
+		super( new Uint16Array( array ), itemSize, normalized );
+
+	}
+
+}
+
+/**
+ * Convenient class that can be used when creating a `Int32` buffer attribute with
+ * a plain `Array` instance.
+ *
+ * @augments BufferAttribute
+ */
+class Int32BufferAttribute extends BufferAttribute {
+
+	/**
+	 * Constructs a new buffer attribute.
+	 *
+	 * @param {(Array<number>|Int32Array)} array - The array holding the attribute data.
+	 * @param {number} itemSize - The item size.
+	 * @param {boolean} [normalized=false] - Whether the data are normalized or not.
+	 */
+	constructor( array, itemSize, normalized ) {
+
+		super( new Int32Array( array ), itemSize, normalized );
+
+	}
+
+}
+
+/**
+ * Convenient class that can be used when creating a `UInt32` buffer attribute with
+ * a plain `Array` instance.
+ *
+ * @augments BufferAttribute
+ */
+class Uint32BufferAttribute extends BufferAttribute {
+
+	/**
+	 * Constructs a new buffer attribute.
+	 *
+	 * @param {(Array<number>|Uint32Array)} array - The array holding the attribute data.
+	 * @param {number} itemSize - The item size.
+	 * @param {boolean} [normalized=false] - Whether the data are normalized or not.
+	 */
+	constructor( array, itemSize, normalized ) {
+
+		super( new Uint32Array( array ), itemSize, normalized );
+
+	}
+
+}
+
+/**
+ * Convenient class that can be used when creating a `Float16` buffer attribute with
+ * a plain `Array` instance.
+ *
+ * This class automatically converts to and from FP16 via `Uint16Array` since `Float16Array`
+ * browser support is still problematic.
+ *
+ * @augments BufferAttribute
+ */
+class Float16BufferAttribute extends BufferAttribute {
+
+	/**
+	 * Constructs a new buffer attribute.
+	 *
+	 * @param {(Array<number>|Uint16Array)} array - The array holding the attribute data.
+	 * @param {number} itemSize - The item size.
+	 * @param {boolean} [normalized=false] - Whether the data are normalized or not.
+	 */
+	constructor( array, itemSize, normalized ) {
+
+		super( new Uint16Array( array ), itemSize, normalized );
+
+		this.isFloat16BufferAttribute = true;
+
+	}
+
+	getX( index ) {
+
+		let x = fromHalfFloat( this.array[ index * this.itemSize ] );
+
+		if ( this.normalized ) x = denormalize( x, this.array );
+
+		return x;
+
+	}
+
+	setX( index, x ) {
+
+		if ( this.normalized ) x = normalize( x, this.array );
+
+		this.array[ index * this.itemSize ] = toHalfFloat( x );
+
+		return this;
+
+	}
+
+	getY( index ) {
+
+		let y = fromHalfFloat( this.array[ index * this.itemSize + 1 ] );
+
+		if ( this.normalized ) y = denormalize( y, this.array );
+
+		return y;
+
+	}
+
+	setY( index, y ) {
+
+		if ( this.normalized ) y = normalize( y, this.array );
+
+		this.array[ index * this.itemSize + 1 ] = toHalfFloat( y );
+
+		return this;
+
+	}
+
+	getZ( index ) {
+
+		let z = fromHalfFloat( this.array[ index * this.itemSize + 2 ] );
+
+		if ( this.normalized ) z = denormalize( z, this.array );
+
+		return z;
+
+	}
+
+	setZ( index, z ) {
+
+		if ( this.normalized ) z = normalize( z, this.array );
+
+		this.array[ index * this.itemSize + 2 ] = toHalfFloat( z );
+
+		return this;
+
+	}
+
+	getW( index ) {
+
+		let w = fromHalfFloat( this.array[ index * this.itemSize + 3 ] );
+
+		if ( this.normalized ) w = denormalize( w, this.array );
+
+		return w;
+
+	}
+
+	setW( index, w ) {
+
+		if ( this.normalized ) w = normalize( w, this.array );
+
+		this.array[ index * this.itemSize + 3 ] = toHalfFloat( w );
+
+		return this;
+
+	}
+
+	setXY( index, x, y ) {
+
+		index *= this.itemSize;
+
+		if ( this.normalized ) {
+
+			x = normalize( x, this.array );
+			y = normalize( y, this.array );
+
+		}
+
+		this.array[ index + 0 ] = toHalfFloat( x );
+		this.array[ index + 1 ] = toHalfFloat( y );
+
+		return this;
+
+	}
+
+	setXYZ( index, x, y, z ) {
+
+		index *= this.itemSize;
+
+		if ( this.normalized ) {
+
+			x = normalize( x, this.array );
+			y = normalize( y, this.array );
+			z = normalize( z, this.array );
+
+		}
+
+		this.array[ index + 0 ] = toHalfFloat( x );
+		this.array[ index + 1 ] = toHalfFloat( y );
+		this.array[ index + 2 ] = toHalfFloat( z );
+
+		return this;
+
+	}
+
+	setXYZW( index, x, y, z, w ) {
+
+		index *= this.itemSize;
+
+		if ( this.normalized ) {
+
+			x = normalize( x, this.array );
+			y = normalize( y, this.array );
+			z = normalize( z, this.array );
+			w = normalize( w, this.array );
+
+		}
+
+		this.array[ index + 0 ] = toHalfFloat( x );
+		this.array[ index + 1 ] = toHalfFloat( y );
+		this.array[ index + 2 ] = toHalfFloat( z );
+		this.array[ index + 3 ] = toHalfFloat( w );
+
+		return this;
+
+	}
+
+}
+
+/**
+ * Convenient class that can be used when creating a `Float32` buffer attribute with
+ * a plain `Array` instance.
+ *
+ * @augments BufferAttribute
+ */
+class Float32BufferAttribute extends BufferAttribute {
+
+	/**
+	 * Constructs a new buffer attribute.
+	 *
+	 * @param {(Array<number>|Float32Array)} array - The array holding the attribute data.
+	 * @param {number} itemSize - The item size.
+	 * @param {boolean} [normalized=false] - Whether the data are normalized or not.
+	 */
+	constructor( array, itemSize, normalized ) {
+
+		super( new Float32Array( array ), itemSize, normalized );
+
+	}
+
+}
+
+const _box$3 = /*@__PURE__*/ new Box3();
+const _v1$3 = /*@__PURE__*/ new Vector3();
+const _v2$2 = /*@__PURE__*/ new Vector3();
+
+/**
+ * An analytical 3D sphere defined by a center and radius. This class is mainly
+ * used as a Bounding Sphere for 3D objects.
+ */
+class Sphere {
+
+	/**
+	 * Constructs a new sphere.
+	 *
+	 * @param {Vector3} [center=(0,0,0)] - The center of the sphere
+	 * @param {number} [radius=-1] - The radius of the sphere.
+	 */
+	constructor( center = new Vector3(), radius = -1 ) {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isSphere = true;
+
+		/**
+		 * The center of the sphere
+		 *
+		 * @type {Vector3}
+		 */
+		this.center = center;
+
+		/**
+		 * The radius of the sphere.
+		 *
+		 * @type {number}
+		 */
+		this.radius = radius;
+
+	}
+
+	/**
+	 * Sets the sphere's components by copying the given values.
+	 *
+	 * @param {Vector3} center - The center.
+	 * @param {number} radius - The radius.
+	 * @return {Sphere} A reference to this sphere.
+	 */
+	set( center, radius ) {
+
+		this.center.copy( center );
+		this.radius = radius;
+
+		return this;
+
+	}
+
+	/**
+	 * Computes the minimum bounding sphere for list of points.
+	 * If the optional center point is given, it is used as the sphere's
+	 * center. Otherwise, the center of the axis-aligned bounding box
+	 * encompassing the points is calculated.
+	 *
+	 * @param {Array<Vector3>} points - A list of points in 3D space.
+	 * @param {Vector3} [optionalCenter] - The center of the sphere.
+	 * @return {Sphere} A reference to this sphere.
+	 */
+	setFromPoints( points, optionalCenter ) {
+
+		const center = this.center;
+
+		if ( optionalCenter !== undefined ) {
+
+			center.copy( optionalCenter );
+
+		} else {
+
+			_box$3.setFromPoints( points ).getCenter( center );
+
+		}
+
+		let maxRadiusSq = 0;
+
+		for ( let i = 0, il = points.length; i < il; i ++ ) {
+
+			maxRadiusSq = Math.max( maxRadiusSq, center.distanceToSquared( points[ i ] ) );
+
+		}
+
+		this.radius = Math.sqrt( maxRadiusSq );
+
+		return this;
+
+	}
+
+	/**
+	 * Copies the values of the given sphere to this instance.
+	 *
+	 * @param {Sphere} sphere - The sphere to copy.
+	 * @return {Sphere} A reference to this sphere.
+	 */
+	copy( sphere ) {
+
+		this.center.copy( sphere.center );
+		this.radius = sphere.radius;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if the sphere is empty (the radius set to a negative number).
+	 *
+	 * Spheres with a radius of `0` contain only their center point and are not
+	 * considered to be empty.
+	 *
+	 * @return {boolean} Whether this sphere is empty or not.
+	 */
+	isEmpty() {
+
+		return ( this.radius < 0 );
+
+	}
+
+	/**
+	 * Makes this sphere empty which means in encloses a zero space in 3D.
+	 *
+	 * @return {Sphere} A reference to this sphere.
+	 */
+	makeEmpty() {
+
+		this.center.set( 0, 0, 0 );
+		this.radius = -1;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this sphere contains the given point inclusive of
+	 * the surface of the sphere.
+	 *
+	 * @param {Vector3} point - The point to check.
+	 * @return {boolean} Whether this sphere contains the given point or not.
+	 */
+	containsPoint( point ) {
+
+		return ( point.distanceToSquared( this.center ) <= ( this.radius * this.radius ) );
+
+	}
+
+	/**
+	 * Returns the closest distance from the boundary of the sphere to the
+	 * given point. If the sphere contains the point, the distance will
+	 * be negative.
+	 *
+	 * @param {Vector3} point - The point to compute the distance to.
+	 * @return {number} The distance to the point.
+	 */
+	distanceToPoint( point ) {
+
+		return ( point.distanceTo( this.center ) - this.radius );
+
+	}
+
+	/**
+	 * Returns `true` if this sphere intersects with the given one.
+	 *
+	 * @param {Sphere} sphere - The sphere to test.
+	 * @return {boolean} Whether this sphere intersects with the given one or not.
+	 */
+	intersectsSphere( sphere ) {
+
+		const radiusSum = this.radius + sphere.radius;
+
+		return sphere.center.distanceToSquared( this.center ) <= ( radiusSum * radiusSum );
+
+	}
+
+	/**
+	 * Returns `true` if this sphere intersects with the given box.
+	 *
+	 * @param {Box3} box - The box to test.
+	 * @return {boolean} Whether this sphere intersects with the given box or not.
+	 */
+	intersectsBox( box ) {
+
+		return box.intersectsSphere( this );
+
+	}
+
+	/**
+	 * Returns `true` if this sphere intersects with the given plane.
+	 *
+	 * @param {Plane} plane - The plane to test.
+	 * @return {boolean} Whether this sphere intersects with the given plane or not.
+	 */
+	intersectsPlane( plane ) {
+
+		return Math.abs( plane.distanceToPoint( this.center ) ) <= this.radius;
+
+	}
+
+	/**
+	 * Clamps a point within the sphere. If the point is outside the sphere, it
+	 * will clamp it to the closest point on the edge of the sphere. Points
+	 * already inside the sphere will not be affected.
+	 *
+	 * @param {Vector3} point - The plane to clamp.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The clamped point.
+	 */
+	clampPoint( point, target ) {
+
+		const deltaLengthSq = this.center.distanceToSquared( point );
+
+		target.copy( point );
+
+		if ( deltaLengthSq > ( this.radius * this.radius ) ) {
+
+			target.sub( this.center ).normalize();
+			target.multiplyScalar( this.radius ).add( this.center );
+
+		}
+
+		return target;
+
+	}
+
+	/**
+	 * Returns a bounding box that encloses this sphere.
+	 *
+	 * @param {Box3} target - The target box that is used to store the method's result.
+	 * @return {Box3} The bounding box that encloses this sphere.
+	 */
+	getBoundingBox( target ) {
+
+		if ( this.isEmpty() ) {
+
+			// Empty sphere produces empty bounding box
+			target.makeEmpty();
+			return target;
+
+		}
+
+		target.set( this.center, this.center );
+		target.expandByScalar( this.radius );
+
+		return target;
+
+	}
+
+	/**
+	 * Transforms this sphere with the given 4x4 transformation matrix.
+	 *
+	 * @param {Matrix4} matrix - The transformation matrix.
+	 * @return {Sphere} A reference to this sphere.
+	 */
+	applyMatrix4( matrix ) {
+
+		this.center.applyMatrix4( matrix );
+		this.radius = this.radius * matrix.getMaxScaleOnAxis();
+
+		return this;
+
+	}
+
+	/**
+	 * Translates the sphere's center by the given offset.
+	 *
+	 * @param {Vector3} offset - The offset.
+	 * @return {Sphere} A reference to this sphere.
+	 */
+	translate( offset ) {
+
+		this.center.add( offset );
+
+		return this;
+
+	}
+
+	/**
+	 * Expands the boundaries of this sphere to include the given point.
+	 *
+	 * @param {Vector3} point - The point to include.
+	 * @return {Sphere} A reference to this sphere.
+	 */
+	expandByPoint( point ) {
+
+		if ( this.isEmpty() ) {
+
+			this.center.copy( point );
+
+			this.radius = 0;
+
+			return this;
+
+		}
+
+		_v1$3.subVectors( point, this.center );
+
+		const lengthSq = _v1$3.lengthSq();
+
+		if ( lengthSq > ( this.radius * this.radius ) ) {
+
+			// calculate the minimal sphere
+
+			const length = Math.sqrt( lengthSq );
+
+			const delta = ( length - this.radius ) * 0.5;
+
+			this.center.addScaledVector( _v1$3, delta / length );
+
+			this.radius += delta;
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Expands this sphere to enclose both the original sphere and the given sphere.
+	 *
+	 * @param {Sphere} sphere - The sphere to include.
+	 * @return {Sphere} A reference to this sphere.
+	 */
+	union( sphere ) {
+
+		if ( sphere.isEmpty() ) {
+
+			return this;
+
+		}
+
+		if ( this.isEmpty() ) {
+
+			this.copy( sphere );
+
+			return this;
+
+		}
+
+		if ( this.center.equals( sphere.center ) === true ) {
+
+			 this.radius = Math.max( this.radius, sphere.radius );
+
+		} else {
+
+			_v2$2.subVectors( sphere.center, this.center ).setLength( sphere.radius );
+
+			this.expandByPoint( _v1$3.copy( sphere.center ).add( _v2$2 ) );
+
+			this.expandByPoint( _v1$3.copy( sphere.center ).sub( _v2$2 ) );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this sphere is equal with the given one.
+	 *
+	 * @param {Sphere} sphere - The sphere to test for equality.
+	 * @return {boolean} Whether this bounding sphere is equal with the given one.
+	 */
+	equals( sphere ) {
+
+		return sphere.center.equals( this.center ) && ( sphere.radius === this.radius );
+
+	}
+
+	/**
+	 * Returns a new sphere with copied values from this instance.
+	 *
+	 * @return {Sphere} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+	/**
+	 * Returns a serialized structure of the bounding sphere.
+	 *
+	 * @return {Object} Serialized structure with fields representing the object state.
+	 */
+	toJSON() {
+
+		return {
+			radius: this.radius,
+			center: this.center.toArray()
+		};
+
+	}
+
+	/**
+	 * Returns a serialized structure of the bounding sphere.
+	 *
+	 * @param {Object} json - The serialized json to set the sphere from.
+	 * @return {Sphere} A reference to this bounding sphere.
+	 */
+	fromJSON( json ) {
+
+		this.radius = json.radius;
+		this.center.fromArray( json.center );
+		return this;
+
+	}
+
+}
+
+let _id$1 = 0;
+
+const _m1 = /*@__PURE__*/ new Matrix4();
+const _obj = /*@__PURE__*/ new Object3D();
+const _offset = /*@__PURE__*/ new Vector3();
+const _box$2 = /*@__PURE__*/ new Box3();
+const _boxMorphTargets = /*@__PURE__*/ new Box3();
+const _vector$9 = /*@__PURE__*/ new Vector3();
+
+/**
+ * A representation of mesh, line, or point geometry. Includes vertex
+ * positions, face indices, normals, colors, UVs, and custom attributes
+ * within buffers, reducing the cost of passing all this data to the GPU.
+ *
+ * ```js
+ * const geometry = new THREE.BufferGeometry();
+ * // create a simple square shape. We duplicate the top left and bottom right
+ * // vertices because each vertex needs to appear once per triangle.
+ * const vertices = new Float32Array( [
+ * 	-1.0, -1.0,  1.0, // v0
+ * 	 1.0, -1.0,  1.0, // v1
+ * 	 1.0,  1.0,  1.0, // v2
+ *
+ * 	 1.0,  1.0,  1.0, // v3
+ * 	-1.0,  1.0,  1.0, // v4
+ * 	-1.0, -1.0,  1.0  // v5
+ * ] );
+ * // itemSize = 3 because there are 3 values (components) per vertex
+ * geometry.setAttribute( 'position', new THREE.BufferAttribute( vertices, 3 ) );
+ * const material = new THREE.MeshBasicMaterial( { color: 0xff0000 } );
+ * const mesh = new THREE.Mesh( geometry, material );
+ * ```
+ *
+ * @augments EventDispatcher
+ */
+class BufferGeometry extends EventDispatcher {
+
+	/**
+	 * Constructs a new geometry.
+	 */
+	constructor() {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isBufferGeometry = true;
+
+		/**
+		 * The ID of the geometry.
+		 *
+		 * @name BufferGeometry#id
+		 * @type {number}
+		 * @readonly
+		 */
+		Object.defineProperty( this, 'id', { value: _id$1 ++ } );
+
+		/**
+		 * The UUID of the geometry.
+		 *
+		 * @type {string}
+		 * @readonly
+		 */
+		this.uuid = generateUUID();
+
+		/**
+		 * The name of the geometry.
+		 *
+		 * @type {string}
+		 */
+		this.name = '';
+		this.type = 'BufferGeometry';
+
+		/**
+		 * Allows for vertices to be re-used across multiple triangles; this is
+		 * called using "indexed triangles". Each triangle is associated with the
+		 * indices of three vertices. This attribute therefore stores the index of
+		 * each vertex for each triangular face. If this attribute is not set, the
+		 * renderer assumes that each three contiguous positions represent a single triangle.
+		 *
+		 * @type {?BufferAttribute}
+		 * @default null
+		 */
+		this.index = null;
+
+		/**
+		 * A (storage) buffer attribute which was generated with a compute shader and
+		 * now defines indirect draw calls.
+		 *
+		 * Can only be used with {@link WebGPURenderer} and a WebGPU backend.
+		 *
+		 * @type {?BufferAttribute}
+		 * @default null
+		 */
+		this.indirect = null;
+
+		/**
+		 * The offset, in bytes, into the indirect drawing buffer where the value data begins. If an array is provided, multiple indirect draw calls will be made for each offset.
+		 *
+		 * Can only be used with {@link WebGPURenderer} and a WebGPU backend.
+		 *
+		 * @type {number|Array<number>}
+		 * @default 0
+		 */
+		this.indirectOffset = 0;
+
+		/**
+		 * This dictionary has as id the name of the attribute to be set and as value
+		 * the buffer attribute to set it to. Rather than accessing this property directly,
+		 * use `setAttribute()` and `getAttribute()` to access attributes of this geometry.
+		 *
+		 * @type {Object<string,(BufferAttribute|InterleavedBufferAttribute)>}
+		 */
+		this.attributes = {};
+
+		/**
+		 * This dictionary holds the morph targets of the geometry.
+		 *
+		 * Note: Once the geometry has been rendered, the morph attribute data cannot
+		 * be changed. You will have to call `dispose()`, and create a new geometry instance.
+		 *
+		 * @type {Object}
+		 */
+		this.morphAttributes = {};
+
+		/**
+		 * Used to control the morph target behavior; when set to `true`, the morph
+		 * target data is treated as relative offsets, rather than as absolute
+		 * positions/normals.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.morphTargetsRelative = false;
+
+		/**
+		 * Split the geometry into groups, each of which will be rendered in a
+		 * separate draw call. This allows an array of materials to be used with the geometry.
+		 *
+		 * Use `addGroup()` and `clearGroups()` to edit groups, rather than modifying this array directly.
+		 *
+		 * Every vertex and index must belong to exactly one group — groups must not share vertices or
+		 * indices, and must not leave vertices or indices unused.
+		 *
+		 * @type {Array<Object>}
+		 */
+		this.groups = [];
+
+		/**
+		 * Bounding box for the geometry which can be calculated with `computeBoundingBox()`.
+		 *
+		 * @type {?Box3}
+		 * @default null
+		 */
+		this.boundingBox = null;
+
+		/**
+		 * Bounding sphere for the geometry which can be calculated with `computeBoundingSphere()`.
+		 *
+		 * @type {?Sphere}
+		 * @default null
+		 */
+		this.boundingSphere = null;
+
+		/**
+		 * Determines the part of the geometry to render. This should not be set directly,
+		 * instead use `setDrawRange()`.
+		 *
+		 * @type {{start:number,count:number}}
+		 */
+		this.drawRange = { start: 0, count: Infinity };
+
+		/**
+		 * An object that can be used to store custom data about the geometry.
+		 * It should not hold references to functions as these will not be cloned.
+		 *
+		 * @type {Object}
+		 */
+		this.userData = {};
+
+		/**
+		 * `true` when the geometry has been transformed since construction
+		 * (e.g. via {@link BufferGeometry#applyMatrix4}). Only relevant for
+		 * geometry generators (subclasses that populate `parameters`): when set,
+		 * {@link BufferGeometry#toJSON} omits `parameters` since they no longer
+		 * describe the geometry.
+		 *
+		 * @private
+		 * @type {boolean}
+		 * @default false
+		 */
+		this._transformed = false;
+
+	}
+
+	/**
+	 * Returns the index of this geometry.
+	 *
+	 * @return {?BufferAttribute} The index. Returns `null` if no index is defined.
+	 */
+	getIndex() {
+
+		return this.index;
+
+	}
+
+	/**
+	 * Sets the given index to this geometry.
+	 *
+	 * @param {Array<number>|BufferAttribute} index - The index to set.
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	setIndex( index ) {
+
+		if ( Array.isArray( index ) ) {
+
+			this.index = new ( arrayNeedsUint32( index ) ? Uint32BufferAttribute : Uint16BufferAttribute )( index, 1 );
+
+		} else {
+
+			this.index = index;
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the given indirect attribute to this geometry.
+	 *
+	 * @param {BufferAttribute} indirect - The attribute holding indirect draw calls.
+	 * @param {number|Array<number>} [indirectOffset=0] - The offset, in bytes, into the indirect drawing buffer where the value data begins. If an array is provided, multiple indirect draw calls will be made for each offset.
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	setIndirect( indirect, indirectOffset = 0 ) {
+
+		this.indirect = indirect;
+		this.indirectOffset = indirectOffset;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the indirect attribute of this geometry.
+	 *
+	 * @return {?BufferAttribute} The indirect attribute. Returns `null` if no indirect attribute is defined.
+	 */
+	getIndirect() {
+
+		return this.indirect;
+
+	}
+
+	/**
+	 * Returns the buffer attribute for the given name.
+	 *
+	 * @param {string} name - The attribute name.
+	 * @return {BufferAttribute|InterleavedBufferAttribute|undefined} The buffer attribute.
+	 * Returns `undefined` if not attribute has been found.
+	 */
+	getAttribute( name ) {
+
+		return this.attributes[ name ];
+
+	}
+
+	/**
+	 * Sets the given attribute for the given name.
+	 *
+	 * @param {string} name - The attribute name.
+	 * @param {BufferAttribute|InterleavedBufferAttribute} attribute - The attribute to set.
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	setAttribute( name, attribute ) {
+
+		this.attributes[ name ] = attribute;
+
+		return this;
+
+	}
+
+	/**
+	 * Deletes the attribute for the given name.
+	 *
+	 * @param {string} name - The attribute name to delete.
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	deleteAttribute( name ) {
+
+		delete this.attributes[ name ];
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this geometry has an attribute for the given name.
+	 *
+	 * @param {string} name - The attribute name.
+	 * @return {boolean} Whether this geometry has an attribute for the given name or not.
+	 */
+	hasAttribute( name ) {
+
+		return this.attributes[ name ] !== undefined;
+
+	}
+
+	/**
+	 * Adds a group to this geometry.
+	 *
+	 * @param {number} start - The first element in this draw call. That is the first
+	 * vertex for non-indexed geometry, otherwise the first triangle index.
+	 * @param {number} count - Specifies how many vertices (or indices) are part of this group.
+	 * @param {number} [materialIndex=0] - The material array index to use.
+	 */
+	addGroup( start, count, materialIndex = 0 ) {
+
+		this.groups.push( {
+
+			start: start,
+			count: count,
+			materialIndex: materialIndex
+
+		} );
+
+	}
+
+	/**
+	 * Clears all groups.
+	 */
+	clearGroups() {
+
+		this.groups = [];
+
+	}
+
+	/**
+	 * Sets the draw range for this geometry.
+	 *
+	 * @param {number} start - The first vertex for non-indexed geometry, otherwise the first triangle index.
+	 * @param {number} count - For non-indexed BufferGeometry, `count` is the number of vertices to render.
+	 * For indexed BufferGeometry, `count` is the number of indices to render.
+	 */
+	setDrawRange( start, count ) {
+
+		this.drawRange.start = start;
+		this.drawRange.count = count;
+
+	}
+
+	/**
+	 * Applies the given 4x4 transformation matrix to the geometry.
+	 *
+	 * @param {Matrix4} matrix - The matrix to apply.
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	applyMatrix4( matrix ) {
+
+		const position = this.attributes.position;
+
+		if ( position !== undefined ) {
+
+			position.applyMatrix4( matrix );
+
+			position.needsUpdate = true;
+
+		}
+
+		const normal = this.attributes.normal;
+
+		if ( normal !== undefined ) {
+
+			const normalMatrix = new Matrix3().getNormalMatrix( matrix );
+
+			normal.applyNormalMatrix( normalMatrix );
+
+			normal.needsUpdate = true;
+
+		}
+
+		const tangent = this.attributes.tangent;
+
+		if ( tangent !== undefined ) {
+
+			tangent.transformDirection( matrix );
+
+			tangent.needsUpdate = true;
+
+		}
+
+		if ( this.boundingBox !== null ) {
+
+			this.computeBoundingBox();
+
+		}
+
+		if ( this.boundingSphere !== null ) {
+
+			this.computeBoundingSphere();
+
+		}
+
+		this._transformed = true;
+
+		return this;
+
+	}
+
+	/**
+	 * Applies the rotation represented by the Quaternion to the geometry.
+	 *
+	 * @param {Quaternion} q - The Quaternion to apply.
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	applyQuaternion( q ) {
+
+		_m1.makeRotationFromQuaternion( q );
+
+		this.applyMatrix4( _m1 );
+
+		return this;
+
+	}
+
+	/**
+	 * Rotates the geometry about the X axis. This is typically done as a one time
+	 * operation, and not during a loop. Use {@link Object3D#rotation} for typical
+	 * real-time mesh rotation.
+	 *
+	 * @param {number} angle - The angle in radians.
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	rotateX( angle ) {
+
+		// rotate geometry around world x-axis
+
+		_m1.makeRotationX( angle );
+
+		this.applyMatrix4( _m1 );
+
+		return this;
+
+	}
+
+	/**
+	 * Rotates the geometry about the Y axis. This is typically done as a one time
+	 * operation, and not during a loop. Use {@link Object3D#rotation} for typical
+	 * real-time mesh rotation.
+	 *
+	 * @param {number} angle - The angle in radians.
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	rotateY( angle ) {
+
+		// rotate geometry around world y-axis
+
+		_m1.makeRotationY( angle );
+
+		this.applyMatrix4( _m1 );
+
+		return this;
+
+	}
+
+	/**
+	 * Rotates the geometry about the Z axis. This is typically done as a one time
+	 * operation, and not during a loop. Use {@link Object3D#rotation} for typical
+	 * real-time mesh rotation.
+	 *
+	 * @param {number} angle - The angle in radians.
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	rotateZ( angle ) {
+
+		// rotate geometry around world z-axis
+
+		_m1.makeRotationZ( angle );
+
+		this.applyMatrix4( _m1 );
+
+		return this;
+
+	}
+
+	/**
+	 * Translates the geometry. This is typically done as a one time
+	 * operation, and not during a loop. Use {@link Object3D#position} for typical
+	 * real-time mesh rotation.
+	 *
+	 * @param {number} x - The x offset.
+	 * @param {number} y - The y offset.
+	 * @param {number} z - The z offset.
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	translate( x, y, z ) {
+
+		// translate geometry
+
+		_m1.makeTranslation( x, y, z );
+
+		this.applyMatrix4( _m1 );
+
+		return this;
+
+	}
+
+	/**
+	 * Scales the geometry. This is typically done as a one time
+	 * operation, and not during a loop. Use {@link Object3D#scale} for typical
+	 * real-time mesh rotation.
+	 *
+	 * @param {number} x - The x scale.
+	 * @param {number} y - The y scale.
+	 * @param {number} z - The z scale.
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	scale( x, y, z ) {
+
+		// scale geometry
+
+		_m1.makeScale( x, y, z );
+
+		this.applyMatrix4( _m1 );
+
+		return this;
+
+	}
+
+	/**
+	 * Rotates the geometry to face a point in 3D space. This is typically done as a one time
+	 * operation, and not during a loop. Use {@link Object3D#lookAt} for typical
+	 * real-time mesh rotation.
+	 *
+	 * @param {Vector3} vector - The target point.
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	lookAt( vector ) {
+
+		_obj.lookAt( vector );
+
+		_obj.updateMatrix();
+
+		this.applyMatrix4( _obj.matrix );
+
+		return this;
+
+	}
+
+	/**
+	 * Center the geometry based on its bounding box.
+	 *
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	center() {
+
+		this.computeBoundingBox();
+
+		this.boundingBox.getCenter( _offset ).negate();
+
+		this.translate( _offset.x, _offset.y, _offset.z );
+
+		return this;
+
+	}
+
+	/**
+	 * Defines a geometry by creating a `position` attribute based on the given array of points. The array
+	 * can hold 2D or 3D vectors. When using two-dimensional data, the `z` coordinate for all vertices is
+	 * set to `0`.
+	 *
+	 * If the method is used with an existing `position` attribute, the vertex data are overwritten with the
+	 * data from the array. The length of the array must match the vertex count.
+	 *
+	 * @param {Array<Vector2>|Array<Vector3>} points - The points.
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	setFromPoints( points ) {
+
+		const positionAttribute = this.getAttribute( 'position' );
+
+		if ( positionAttribute === undefined ) {
+
+			const position = [];
+
+			for ( let i = 0, l = points.length; i < l; i ++ ) {
+
+				const point = points[ i ];
+				position.push( point.x, point.y, point.z || 0 );
+
+			}
+
+			this.setAttribute( 'position', new Float32BufferAttribute( position, 3 ) );
+
+		} else {
+
+			const l = Math.min( points.length, positionAttribute.count ); // make sure data do not exceed buffer size
+
+			for ( let i = 0; i < l; i ++ ) {
+
+				const point = points[ i ];
+				positionAttribute.setXYZ( i, point.x, point.y, point.z || 0 );
+
+			}
+
+			if ( points.length > positionAttribute.count ) {
+
+				warn( 'BufferGeometry: Buffer size too small for points data. Use .dispose() and create a new geometry.' );
+
+			}
+
+			positionAttribute.needsUpdate = true;
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Computes the bounding box of the geometry, and updates the `boundingBox` member.
+	 * The bounding box is not computed by the engine; it must be computed by your app.
+	 * You may need to recompute the bounding box if the geometry vertices are modified.
+	 */
+	computeBoundingBox() {
+
+		if ( this.boundingBox === null ) {
+
+			this.boundingBox = new Box3();
+
+		}
+
+		const position = this.attributes.position;
+		const morphAttributesPosition = this.morphAttributes.position;
+
+		if ( position && position.isGLBufferAttribute ) {
+
+			error( 'BufferGeometry.computeBoundingBox(): GLBufferAttribute requires a manual bounding box.', this );
+
+			this.boundingBox.set(
+				new Vector3( - Infinity, - Infinity, - Infinity ),
+				new Vector3( + Infinity, + Infinity, + Infinity )
+			);
+
+			return;
+
+		}
+
+		if ( position !== undefined ) {
+
+			this.boundingBox.setFromBufferAttribute( position );
+
+			// process morph attributes if present
+
+			if ( morphAttributesPosition ) {
+
+				for ( let i = 0, il = morphAttributesPosition.length; i < il; i ++ ) {
+
+					const morphAttribute = morphAttributesPosition[ i ];
+					_box$2.setFromBufferAttribute( morphAttribute );
+
+					if ( this.morphTargetsRelative ) {
+
+						_vector$9.addVectors( this.boundingBox.min, _box$2.min );
+						this.boundingBox.expandByPoint( _vector$9 );
+
+						_vector$9.addVectors( this.boundingBox.max, _box$2.max );
+						this.boundingBox.expandByPoint( _vector$9 );
+
+					} else {
+
+						this.boundingBox.expandByPoint( _box$2.min );
+						this.boundingBox.expandByPoint( _box$2.max );
+
+					}
+
+				}
+
+			}
+
+		} else {
+
+			this.boundingBox.makeEmpty();
+
+		}
+
+		if ( isNaN( this.boundingBox.min.x ) || isNaN( this.boundingBox.min.y ) || isNaN( this.boundingBox.min.z ) ) {
+
+			error( 'BufferGeometry.computeBoundingBox(): Computed min/max have NaN values. The "position" attribute is likely to have NaN values.', this );
+
+		}
+
+	}
+
+	/**
+	 * Computes the bounding sphere of the geometry, and updates the `boundingSphere` member.
+	 * The engine automatically computes the bounding sphere when it is needed, e.g., for ray casting or view frustum culling.
+	 * You may need to recompute the bounding sphere if the geometry vertices are modified.
+	 */
+	computeBoundingSphere() {
+
+		if ( this.boundingSphere === null ) {
+
+			this.boundingSphere = new Sphere();
+
+		}
+
+		const position = this.attributes.position;
+		const morphAttributesPosition = this.morphAttributes.position;
+
+		if ( position && position.isGLBufferAttribute ) {
+
+			error( 'BufferGeometry.computeBoundingSphere(): GLBufferAttribute requires a manual bounding sphere.', this );
+
+			this.boundingSphere.set( new Vector3(), Infinity );
+
+			return;
+
+		}
+
+		if ( position ) {
+
+			// first, find the center of the bounding sphere
+
+			const center = this.boundingSphere.center;
+
+			_box$2.setFromBufferAttribute( position );
+
+			// process morph attributes if present
+
+			if ( morphAttributesPosition ) {
+
+				for ( let i = 0, il = morphAttributesPosition.length; i < il; i ++ ) {
+
+					const morphAttribute = morphAttributesPosition[ i ];
+					_boxMorphTargets.setFromBufferAttribute( morphAttribute );
+
+					if ( this.morphTargetsRelative ) {
+
+						_vector$9.addVectors( _box$2.min, _boxMorphTargets.min );
+						_box$2.expandByPoint( _vector$9 );
+
+						_vector$9.addVectors( _box$2.max, _boxMorphTargets.max );
+						_box$2.expandByPoint( _vector$9 );
+
+					} else {
+
+						_box$2.expandByPoint( _boxMorphTargets.min );
+						_box$2.expandByPoint( _boxMorphTargets.max );
+
+					}
+
+				}
+
+			}
+
+			_box$2.getCenter( center );
+
+			// second, try to find a boundingSphere with a radius smaller than the
+			// boundingSphere of the boundingBox: sqrt(3) smaller in the best case
+
+			let maxRadiusSq = 0;
+
+			for ( let i = 0, il = position.count; i < il; i ++ ) {
+
+				_vector$9.fromBufferAttribute( position, i );
+
+				maxRadiusSq = Math.max( maxRadiusSq, center.distanceToSquared( _vector$9 ) );
+
+			}
+
+			// process morph attributes if present
+
+			if ( morphAttributesPosition ) {
+
+				for ( let i = 0, il = morphAttributesPosition.length; i < il; i ++ ) {
+
+					const morphAttribute = morphAttributesPosition[ i ];
+					const morphTargetsRelative = this.morphTargetsRelative;
+
+					for ( let j = 0, jl = morphAttribute.count; j < jl; j ++ ) {
+
+						_vector$9.fromBufferAttribute( morphAttribute, j );
+
+						if ( morphTargetsRelative ) {
+
+							_offset.fromBufferAttribute( position, j );
+							_vector$9.add( _offset );
+
+						}
+
+						maxRadiusSq = Math.max( maxRadiusSq, center.distanceToSquared( _vector$9 ) );
+
+					}
+
+				}
+
+			}
+
+			this.boundingSphere.radius = Math.sqrt( maxRadiusSq );
+
+			if ( isNaN( this.boundingSphere.radius ) ) {
+
+				error( 'BufferGeometry.computeBoundingSphere(): Computed radius is NaN. The "position" attribute is likely to have NaN values.', this );
+
+			}
+
+		}
+
+	}
+
+	/**
+	 * Calculates and adds a tangent attribute to this geometry.
+	 *
+	 * The computation is only supported for indexed geometries and if position, normal, and uv attributes
+	 * are defined. When using a tangent space normal map, prefer the MikkTSpace algorithm provided by
+	 * {@link BufferGeometryUtils#computeMikkTSpaceTangents} instead.
+	 */
+	computeTangents() {
+
+		const index = this.index;
+		const attributes = this.attributes;
+
+		// based on http://www.terathon.com/code/tangent.html
+		// (per vertex tangents)
+
+		if ( index === null ||
+			 attributes.position === undefined ||
+			 attributes.normal === undefined ||
+			 attributes.uv === undefined ) {
+
+			error( 'BufferGeometry: .computeTangents() failed. Missing required attributes (index, position, normal or uv)' );
+			return;
+
+		}
+
+		const positionAttribute = attributes.position;
+		const normalAttribute = attributes.normal;
+		const uvAttribute = attributes.uv;
+
+		let tangentAttribute = this.getAttribute( 'tangent' );
+
+		if ( tangentAttribute === undefined || tangentAttribute.count !== positionAttribute.count ) {
+
+			tangentAttribute = new BufferAttribute( new Float32Array( 4 * positionAttribute.count ), 4 );
+			this.setAttribute( 'tangent', tangentAttribute );
+
+		}
+
+		const tan1 = [], tan2 = [];
+
+		for ( let i = 0; i < positionAttribute.count; i ++ ) {
+
+			tan1[ i ] = new Vector3();
+			tan2[ i ] = new Vector3();
+
+		}
+
+		const vA = new Vector3(),
+			vB = new Vector3(),
+			vC = new Vector3(),
+
+			uvA = new Vector2(),
+			uvB = new Vector2(),
+			uvC = new Vector2(),
+
+			sdir = new Vector3(),
+			tdir = new Vector3();
+
+		function handleTriangle( a, b, c ) {
+
+			vA.fromBufferAttribute( positionAttribute, a );
+			vB.fromBufferAttribute( positionAttribute, b );
+			vC.fromBufferAttribute( positionAttribute, c );
+
+			uvA.fromBufferAttribute( uvAttribute, a );
+			uvB.fromBufferAttribute( uvAttribute, b );
+			uvC.fromBufferAttribute( uvAttribute, c );
+
+			vB.sub( vA );
+			vC.sub( vA );
+
+			uvB.sub( uvA );
+			uvC.sub( uvA );
+
+			const r = 1.0 / ( uvB.x * uvC.y - uvC.x * uvB.y );
+
+			// silently ignore degenerate uv triangles having coincident or colinear vertices
+
+			if ( ! isFinite( r ) ) return;
+
+			sdir.copy( vB ).multiplyScalar( uvC.y ).addScaledVector( vC, - uvB.y ).multiplyScalar( r );
+			tdir.copy( vC ).multiplyScalar( uvB.x ).addScaledVector( vB, - uvC.x ).multiplyScalar( r );
+
+			tan1[ a ].add( sdir );
+			tan1[ b ].add( sdir );
+			tan1[ c ].add( sdir );
+
+			tan2[ a ].add( tdir );
+			tan2[ b ].add( tdir );
+			tan2[ c ].add( tdir );
+
+		}
+
+		let groups = this.groups;
+
+		if ( groups.length === 0 ) {
+
+			groups = [ {
+				start: 0,
+				count: index.count
+			} ];
+
+		}
+
+		for ( let i = 0, il = groups.length; i < il; ++ i ) {
+
+			const group = groups[ i ];
+
+			const start = group.start;
+			const count = group.count;
+
+			for ( let j = start, jl = start + count; j < jl; j += 3 ) {
+
+				handleTriangle(
+					index.getX( j + 0 ),
+					index.getX( j + 1 ),
+					index.getX( j + 2 )
+				);
+
+			}
+
+		}
+
+		const tmp = new Vector3(), tmp2 = new Vector3();
+		const n = new Vector3(), n2 = new Vector3();
+
+		function handleVertex( v ) {
+
+			n.fromBufferAttribute( normalAttribute, v );
+			n2.copy( n );
+
+			const t = tan1[ v ];
+
+			// Gram-Schmidt orthogonalize
+
+			tmp.copy( t );
+			tmp.sub( n.multiplyScalar( n.dot( t ) ) ).normalize();
+
+			// Calculate handedness
+
+			tmp2.crossVectors( n2, t );
+			const test = tmp2.dot( tan2[ v ] );
+			const w = ( test < 0.0 ) ? -1 : 1.0;
+
+			tangentAttribute.setXYZW( v, tmp.x, tmp.y, tmp.z, w );
+
+		}
+
+		for ( let i = 0, il = groups.length; i < il; ++ i ) {
+
+			const group = groups[ i ];
+
+			const start = group.start;
+			const count = group.count;
+
+			for ( let j = start, jl = start + count; j < jl; j += 3 ) {
+
+				handleVertex( index.getX( j + 0 ) );
+				handleVertex( index.getX( j + 1 ) );
+				handleVertex( index.getX( j + 2 ) );
+
+			}
+
+		}
+
+		this._transformed = true;
+
+	}
+
+	/**
+	 * Computes vertex normals for the given vertex data. For indexed geometries, the method sets
+	 * each vertex normal to be the average of the face normals of the faces that share that vertex.
+	 * For non-indexed geometries, vertices are not shared, and the method sets each vertex normal
+	 * to be the same as the face normal.
+	 */
+	computeVertexNormals() {
+
+		const index = this.index;
+		const positionAttribute = this.getAttribute( 'position' );
+
+		if ( positionAttribute !== undefined ) {
+
+			let normalAttribute = this.getAttribute( 'normal' );
+
+			if ( normalAttribute === undefined || normalAttribute.count !== positionAttribute.count ) {
+
+				normalAttribute = new BufferAttribute( new Float32Array( positionAttribute.count * 3 ), 3 );
+				this.setAttribute( 'normal', normalAttribute );
+
+			} else {
+
+				// reset existing normals to zero
+
+				for ( let i = 0, il = normalAttribute.count; i < il; i ++ ) {
+
+					normalAttribute.setXYZ( i, 0, 0, 0 );
+
+				}
+
+			}
+
+			const pA = new Vector3(), pB = new Vector3(), pC = new Vector3();
+			const nA = new Vector3(), nB = new Vector3(), nC = new Vector3();
+			const cb = new Vector3(), ab = new Vector3();
+
+			// indexed elements
+
+			if ( index ) {
+
+				for ( let i = 0, il = index.count; i < il; i += 3 ) {
+
+					const vA = index.getX( i + 0 );
+					const vB = index.getX( i + 1 );
+					const vC = index.getX( i + 2 );
+
+					pA.fromBufferAttribute( positionAttribute, vA );
+					pB.fromBufferAttribute( positionAttribute, vB );
+					pC.fromBufferAttribute( positionAttribute, vC );
+
+					cb.subVectors( pC, pB );
+					ab.subVectors( pA, pB );
+					cb.cross( ab );
+
+					nA.fromBufferAttribute( normalAttribute, vA );
+					nB.fromBufferAttribute( normalAttribute, vB );
+					nC.fromBufferAttribute( normalAttribute, vC );
+
+					nA.add( cb );
+					nB.add( cb );
+					nC.add( cb );
+
+					normalAttribute.setXYZ( vA, nA.x, nA.y, nA.z );
+					normalAttribute.setXYZ( vB, nB.x, nB.y, nB.z );
+					normalAttribute.setXYZ( vC, nC.x, nC.y, nC.z );
+
+				}
+
+			} else {
+
+				// non-indexed elements (unconnected triangle soup)
+
+				for ( let i = 0, il = positionAttribute.count; i < il; i += 3 ) {
+
+					pA.fromBufferAttribute( positionAttribute, i + 0 );
+					pB.fromBufferAttribute( positionAttribute, i + 1 );
+					pC.fromBufferAttribute( positionAttribute, i + 2 );
+
+					cb.subVectors( pC, pB );
+					ab.subVectors( pA, pB );
+					cb.cross( ab );
+
+					normalAttribute.setXYZ( i + 0, cb.x, cb.y, cb.z );
+					normalAttribute.setXYZ( i + 1, cb.x, cb.y, cb.z );
+					normalAttribute.setXYZ( i + 2, cb.x, cb.y, cb.z );
+
+				}
+
+			}
+
+			this.normalizeNormals();
+
+			normalAttribute.needsUpdate = true;
+
+		}
+
+	}
+
+	/**
+	 * Ensures every normal vector in a geometry will have a magnitude of `1`. This will
+	 * correct lighting on the geometry surfaces.
+	 */
+	normalizeNormals() {
+
+		const normals = this.attributes.normal;
+
+		for ( let i = 0, il = normals.count; i < il; i ++ ) {
+
+			_vector$9.fromBufferAttribute( normals, i );
+
+			_vector$9.normalize();
+
+			normals.setXYZ( i, _vector$9.x, _vector$9.y, _vector$9.z );
+
+		}
+
+	}
+
+	/**
+	 * Return a new non-index version of this indexed geometry. If the geometry
+	 * is already non-indexed, the method is a NOOP.
+	 *
+	 * @return {BufferGeometry} The non-indexed version of this indexed geometry.
+	 */
+	toNonIndexed() {
+
+		function convertBufferAttribute( attribute, indices ) {
+
+			const array = attribute.array;
+			const itemSize = attribute.itemSize;
+			const normalized = attribute.normalized;
+
+			const array2 = new array.constructor( indices.length * itemSize );
+
+			let index = 0, index2 = 0;
+
+			for ( let i = 0, l = indices.length; i < l; i ++ ) {
+
+				if ( attribute.isInterleavedBufferAttribute ) {
+
+					index = indices[ i ] * attribute.data.stride + attribute.offset;
+
+				} else {
+
+					index = indices[ i ] * itemSize;
+
+				}
+
+				for ( let j = 0; j < itemSize; j ++ ) {
+
+					array2[ index2 ++ ] = array[ index ++ ];
+
+				}
+
+			}
+
+			return new BufferAttribute( array2, itemSize, normalized );
+
+		}
+
+		//
+
+		if ( this.index === null ) {
+
+			warn( 'BufferGeometry.toNonIndexed(): BufferGeometry is already non-indexed.' );
+			return this;
+
+		}
+
+		const geometry2 = new BufferGeometry();
+
+		const indices = this.index.array;
+		const attributes = this.attributes;
+
+		// attributes
+
+		for ( const name in attributes ) {
+
+			const attribute = attributes[ name ];
+
+			const newAttribute = convertBufferAttribute( attribute, indices );
+
+			geometry2.setAttribute( name, newAttribute );
+
+		}
+
+		// morph attributes
+
+		const morphAttributes = this.morphAttributes;
+
+		for ( const name in morphAttributes ) {
+
+			const morphArray = [];
+			const morphAttribute = morphAttributes[ name ]; // morphAttribute: array of Float32BufferAttributes
+
+			for ( let i = 0, il = morphAttribute.length; i < il; i ++ ) {
+
+				const attribute = morphAttribute[ i ];
+
+				const newAttribute = convertBufferAttribute( attribute, indices );
+
+				morphArray.push( newAttribute );
+
+			}
+
+			geometry2.morphAttributes[ name ] = morphArray;
+
+		}
+
+		geometry2.morphTargetsRelative = this.morphTargetsRelative;
+
+		// groups
+
+		const groups = this.groups;
+
+		for ( let i = 0, l = groups.length; i < l; i ++ ) {
+
+			const group = groups[ i ];
+			geometry2.addGroup( group.start, group.count, group.materialIndex );
+
+		}
+
+		return geometry2;
+
+	}
+
+	/**
+	 * Serializes the geometry into JSON.
+	 *
+	 * @return {Object} A JSON object representing the serialized geometry.
+	 */
+	toJSON() {
+
+		const data = {
+			metadata: {
+				version: 4.7,
+				type: 'BufferGeometry',
+				generator: 'BufferGeometry.toJSON'
+			}
+		};
+
+		// standard BufferGeometry serialization
+
+		data.uuid = this.uuid;
+		data.type = ( this.parameters !== undefined && this._transformed === true ) ? 'BufferGeometry' : this.type;
+		data.name = this.name;
+		if ( Object.keys( this.userData ).length > 0 ) data.userData = this.userData;
+
+		if ( this.parameters !== undefined && this._transformed !== true ) {
+
+			const parameters = this.parameters;
+
+			for ( const key in parameters ) {
+
+				if ( parameters[ key ] !== undefined ) data[ key ] = parameters[ key ];
+
+			}
+
+			return data;
+
+		}
+
+		// for simplicity the code assumes attributes are not shared across geometries, see #15811
+
+		data.data = { attributes: {} };
+
+		const index = this.index;
+
+		if ( index !== null ) {
+
+			data.data.index = {
+				type: index.array.constructor.name,
+				array: Array.prototype.slice.call( index.array )
+			};
+
+		}
+
+		const attributes = this.attributes;
+
+		for ( const key in attributes ) {
+
+			const attribute = attributes[ key ];
+
+			data.data.attributes[ key ] = attribute.toJSON( data.data );
+
+		}
+
+		const morphAttributes = {};
+		let hasMorphAttributes = false;
+
+		for ( const key in this.morphAttributes ) {
+
+			const attributeArray = this.morphAttributes[ key ];
+
+			const array = [];
+
+			for ( let i = 0, il = attributeArray.length; i < il; i ++ ) {
+
+				const attribute = attributeArray[ i ];
+
+				array.push( attribute.toJSON( data.data ) );
+
+			}
+
+			if ( array.length > 0 ) {
+
+				morphAttributes[ key ] = array;
+
+				hasMorphAttributes = true;
+
+			}
+
+		}
+
+		if ( hasMorphAttributes ) {
+
+			data.data.morphAttributes = morphAttributes;
+			data.data.morphTargetsRelative = this.morphTargetsRelative;
+
+		}
+
+		const groups = this.groups;
+
+		if ( groups.length > 0 ) {
+
+			data.data.groups = JSON.parse( JSON.stringify( groups ) );
+
+		}
+
+		const boundingSphere = this.boundingSphere;
+
+		if ( boundingSphere !== null ) {
+
+			data.data.boundingSphere = boundingSphere.toJSON();
+
+		}
+
+		return data;
+
+	}
+
+	/**
+	 * Returns a new geometry with copied values from this instance.
+	 *
+	 * @return {BufferGeometry} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+	/**
+	 * Copies the values of the given geometry to this instance.
+	 *
+	 * @param {BufferGeometry} source - The geometry to copy.
+	 * @return {BufferGeometry} A reference to this instance.
+	 */
+	copy( source ) {
+
+		// reset
+
+		this.index = null;
+		this.attributes = {};
+		this.morphAttributes = {};
+		this.groups = [];
+		this.boundingBox = null;
+		this.boundingSphere = null;
+
+		// used for storing cloned, shared data
+
+		const data = {};
+
+		// name
+
+		this.name = source.name;
+
+		// index
+
+		const index = source.index;
+
+		if ( index !== null ) {
+
+			this.setIndex( index.clone() );
+
+		}
+
+		// attributes
+
+		const attributes = source.attributes;
+
+		for ( const name in attributes ) {
+
+			const attribute = attributes[ name ];
+			this.setAttribute( name, attribute.clone( data ) );
+
+		}
+
+		// morph attributes
+
+		const morphAttributes = source.morphAttributes;
+
+		for ( const name in morphAttributes ) {
+
+			const array = [];
+			const morphAttribute = morphAttributes[ name ]; // morphAttribute: array of Float32BufferAttributes
+
+			for ( let i = 0, l = morphAttribute.length; i < l; i ++ ) {
+
+				array.push( morphAttribute[ i ].clone( data ) );
+
+			}
+
+			this.morphAttributes[ name ] = array;
+
+		}
+
+		this.morphTargetsRelative = source.morphTargetsRelative;
+
+		// groups
+
+		const groups = source.groups;
+
+		for ( let i = 0, l = groups.length; i < l; i ++ ) {
+
+			const group = groups[ i ];
+			this.addGroup( group.start, group.count, group.materialIndex );
+
+		}
+
+		// bounding box
+
+		const boundingBox = source.boundingBox;
+
+		if ( boundingBox !== null ) {
+
+			this.boundingBox = boundingBox.clone();
+
+		}
+
+		// bounding sphere
+
+		const boundingSphere = source.boundingSphere;
+
+		if ( boundingSphere !== null ) {
+
+			this.boundingSphere = boundingSphere.clone();
+
+		}
+
+		// draw range
+
+		this.drawRange.start = source.drawRange.start;
+		this.drawRange.count = source.drawRange.count;
+
+		// user data
+
+		this.userData = source.userData;
+
+		// transformed flag
+
+		this._transformed = source._transformed;
+
+		return this;
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 *
+	 * @fires BufferGeometry#dispose
+	 */
+	dispose() {
+
+		this.dispatchEvent( { type: 'dispose' } );
+
+	}
+
+}
+
+/**
+ * "Interleaved" means that multiple attributes, possibly of different types,
+ * (e.g., position, normal, uv, color) are packed into a single array buffer.
+ *
+ * An introduction into interleaved arrays can be found here: [Interleaved array basics](https://blog.tojicode.com/2011/05/interleaved-array-basics.html)
+ */
+class InterleavedBuffer {
+
+	/**
+	 * Constructs a new interleaved buffer.
+	 *
+	 * @param {TypedArray} array - A typed array with a shared buffer storing attribute data.
+	 * @param {number} stride - The number of typed-array elements per vertex.
+	 */
+	constructor( array, stride ) {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isInterleavedBuffer = true;
+
+		/**
+		 * A typed array with a shared buffer storing attribute data.
+		 *
+		 * @type {TypedArray}
+		 */
+		this.array = array;
+
+		/**
+		 * The number of typed-array elements per vertex.
+		 *
+		 * @type {number}
+		 */
+		this.stride = stride;
+
+		/**
+		 * The total number of elements in the array
+		 *
+		 * @type {number}
+		 * @readonly
+		 */
+		this.count = array !== undefined ? array.length / stride : 0;
+
+		/**
+		 * Defines the intended usage pattern of the data store for optimization purposes.
+		 *
+		 * Note: After the initial use of a buffer, its usage cannot be changed. Instead,
+		 * instantiate a new one and set the desired usage before the next render.
+		 *
+		 * @type {(StaticDrawUsage|DynamicDrawUsage|StreamDrawUsage|StaticReadUsage|DynamicReadUsage|StreamReadUsage|StaticCopyUsage|DynamicCopyUsage|StreamCopyUsage)}
+		 * @default StaticDrawUsage
+		 */
+		this.usage = StaticDrawUsage;
+
+		/**
+		 * This can be used to only update some components of stored vectors (for example, just the
+		 * component related to color). Use the `addUpdateRange()` function to add ranges to this array.
+		 *
+		 * @type {Array<Object>}
+		 */
+		this.updateRanges = [];
+
+		/**
+		 * A version number, incremented every time the `needsUpdate` is set to `true`.
+		 *
+		 * @type {number}
+		 */
+		this.version = 0;
+
+		/**
+		 * The UUID of the interleaved buffer.
+		 *
+		 * @type {string}
+		 * @readonly
+		 */
+		this.uuid = generateUUID();
+
+	}
+
+	/**
+	 * A callback function that is executed after the renderer has transferred the attribute array
+	 * data to the GPU.
+	 */
+	onUploadCallback() {}
+
+	/**
+	 * Flag to indicate that this attribute has changed and should be re-sent to
+	 * the GPU. Set this to `true` when you modify the value of the array.
+	 *
+	 * @type {number}
+	 * @default false
+	 * @param {boolean} value
+	 */
+	set needsUpdate( value ) {
+
+		if ( value === true ) this.version ++;
+
+	}
+
+	/**
+	 * Sets the usage of this interleaved buffer.
+	 *
+	 * @param {(StaticDrawUsage|DynamicDrawUsage|StreamDrawUsage|StaticReadUsage|DynamicReadUsage|StreamReadUsage|StaticCopyUsage|DynamicCopyUsage|StreamCopyUsage)} value - The usage to set.
+	 * @return {InterleavedBuffer} A reference to this interleaved buffer.
+	 */
+	setUsage( value ) {
+
+		this.usage = value;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds a range of data in the data array to be updated on the GPU.
+	 *
+	 * @param {number} start - Position at which to start update.
+	 * @param {number} count - The number of components to update.
+	 */
+	addUpdateRange( start, count ) {
+
+		this.updateRanges.push( { start, count } );
+
+	}
+
+	/**
+	 * Clears the update ranges.
+	 */
+	clearUpdateRanges() {
+
+		this.updateRanges.length = 0;
+
+	}
+
+	/**
+	 * Copies the values of the given interleaved buffer to this instance.
+	 *
+	 * @param {InterleavedBuffer} source - The interleaved buffer to copy.
+	 * @return {InterleavedBuffer} A reference to this instance.
+	 */
+	copy( source ) {
+
+		this.array = new source.array.constructor( source.array );
+		this.count = source.count;
+		this.stride = source.stride;
+		this.usage = source.usage;
+
+		return this;
+
+	}
+
+	/**
+	 * Copies a vector from the given interleaved buffer to this one. The start
+	 * and destination position in the attribute buffers are represented by the
+	 * given indices.
+	 *
+	 * @param {number} index1 - The destination index into this interleaved buffer.
+	 * @param {InterleavedBuffer} interleavedBuffer - The interleaved buffer to copy from.
+	 * @param {number} index2 - The source index into the given interleaved buffer.
+	 * @return {InterleavedBuffer} A reference to this instance.
+	 */
+	copyAt( index1, interleavedBuffer, index2 ) {
+
+		index1 *= this.stride;
+		index2 *= interleavedBuffer.stride;
+
+		for ( let i = 0, l = this.stride; i < l; i ++ ) {
+
+			this.array[ index1 + i ] = interleavedBuffer.array[ index2 + i ];
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the given array data in the interleaved buffer.
+	 *
+	 * @param {(TypedArray|Array)} value - The array data to set.
+	 * @param {number} [offset=0] - The offset in this interleaved buffer's array.
+	 * @return {InterleavedBuffer} A reference to this instance.
+	 */
+	set( value, offset = 0 ) {
+
+		this.array.set( value, offset );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new interleaved buffer with copied values from this instance.
+	 *
+	 * @param {Object} [data] - An object with shared array buffers that allows to retain shared structures.
+	 * @return {InterleavedBuffer} A clone of this instance.
+	 */
+	clone( data ) {
+
+		if ( data.arrayBuffers === undefined ) {
+
+			data.arrayBuffers = {};
+
+		}
+
+		if ( this.array.buffer._uuid === undefined ) {
+
+			this.array.buffer._uuid = generateUUID();
+
+		}
+
+		if ( data.arrayBuffers[ this.array.buffer._uuid ] === undefined ) {
+
+			data.arrayBuffers[ this.array.buffer._uuid ] = this.array.slice( 0 ).buffer;
+
+		}
+
+		const array = new this.array.constructor( data.arrayBuffers[ this.array.buffer._uuid ] );
+
+		const ib = new this.constructor( array, this.stride );
+		ib.setUsage( this.usage );
+
+		return ib;
+
+	}
+
+	/**
+	 * Sets the given callback function that is executed after the Renderer has transferred
+	 * the array data to the GPU. Can be used to perform clean-up operations after
+	 * the upload when data are not needed anymore on the CPU side.
+	 *
+	 * @param {Function} callback - The `onUpload()` callback.
+	 * @return {InterleavedBuffer} A reference to this instance.
+	 */
+	onUpload( callback ) {
+
+		this.onUploadCallback = callback;
+
+		return this;
+
+	}
+
+	/**
+	 * Serializes the interleaved buffer into JSON.
+	 *
+	 * @param {Object} [data] - An optional value holding meta information about the serialization.
+	 * @return {Object} A JSON object representing the serialized interleaved buffer.
+	 */
+	toJSON( data ) {
+
+		if ( data.arrayBuffers === undefined ) {
+
+			data.arrayBuffers = {};
+
+		}
+
+		// generate UUID for array buffer if necessary
+
+		if ( this.array.buffer._uuid === undefined ) {
+
+			this.array.buffer._uuid = generateUUID();
+
+		}
+
+		if ( data.arrayBuffers[ this.array.buffer._uuid ] === undefined ) {
+
+			data.arrayBuffers[ this.array.buffer._uuid ] = Array.from( new Uint32Array( this.array.buffer ) );
+
+		}
+
+		//
+
+		const json = {
+			uuid: this.uuid,
+			buffer: this.array.buffer._uuid,
+			type: this.array.constructor.name,
+			stride: this.stride
+		};
+
+		json.usage = this.usage;
+
+		return json;
+
+	}
+
+}
+
+const _vector$8 = /*@__PURE__*/ new Vector3();
+
+/**
+ * An alternative version of a buffer attribute with interleaved data. Interleaved
+ * attributes share a common interleaved data storage ({@link InterleavedBuffer}) and refer with
+ * different offsets into the buffer.
+ */
+class InterleavedBufferAttribute {
+
+	/**
+	 * Constructs a new interleaved buffer attribute.
+	 *
+	 * @param {InterleavedBuffer} interleavedBuffer - The buffer holding the interleaved data.
+	 * @param {number} itemSize - The item size.
+	 * @param {number} offset - The attribute offset into the buffer.
+	 * @param {boolean} [normalized=false] - Whether the data are normalized or not.
+	 */
+	constructor( interleavedBuffer, itemSize, offset, normalized = false ) {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isInterleavedBufferAttribute = true;
+
+		/**
+		 * The name of the buffer attribute.
+		 *
+		 * @type {string}
+		 */
+		this.name = '';
+
+		/**
+		 * The buffer holding the interleaved data.
+		 *
+		 * @type {InterleavedBuffer}
+		 */
+		this.data = interleavedBuffer;
+
+		/**
+		 * The item size, see {@link BufferAttribute#itemSize}.
+		 *
+		 * @type {number}
+		 */
+		this.itemSize = itemSize;
+
+		/**
+		 * The attribute offset into the buffer.
+		 *
+		 * @type {number}
+		 */
+		this.offset = offset;
+
+		/**
+		 * Whether the data are normalized or not, see {@link BufferAttribute#normalized}
+		 *
+		 * @type {InterleavedBuffer}
+		 */
+		this.normalized = normalized;
+
+	}
+
+	/**
+	 * The item count of this buffer attribute.
+	 *
+	 * @type {number}
+	 * @readonly
+	 */
+	get count() {
+
+		return this.data.count;
+
+	}
+
+	/**
+	 * The array holding the interleaved buffer attribute data.
+	 *
+	 * @type {TypedArray}
+	 */
+	get array() {
+
+		return this.data.array;
+
+	}
+
+	/**
+	 * Flag to indicate that this attribute has changed and should be re-sent to
+	 * the GPU. Set this to `true` when you modify the value of the array.
+	 *
+	 * @type {number}
+	 * @default false
+	 * @param {boolean} value
+	 */
+	set needsUpdate( value ) {
+
+		this.data.needsUpdate = value;
+
+	}
+
+	/**
+	 * Applies the given 4x4 matrix to the given attribute. Only works with
+	 * item size `3`.
+	 *
+	 * @param {Matrix4} m - The matrix to apply.
+	 * @return {InterleavedBufferAttribute} A reference to this instance.
+	 */
+	applyMatrix4( m ) {
+
+		for ( let i = 0, l = this.data.count; i < l; i ++ ) {
+
+			_vector$8.fromBufferAttribute( this, i );
+
+			_vector$8.applyMatrix4( m );
+
+			this.setXYZ( i, _vector$8.x, _vector$8.y, _vector$8.z );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Applies the given 3x3 normal matrix to the given attribute. Only works with
+	 * item size `3`.
+	 *
+	 * @param {Matrix3} m - The normal matrix to apply.
+	 * @return {InterleavedBufferAttribute} A reference to this instance.
+	 */
+	applyNormalMatrix( m ) {
+
+		for ( let i = 0, l = this.count; i < l; i ++ ) {
+
+			_vector$8.fromBufferAttribute( this, i );
+
+			_vector$8.applyNormalMatrix( m );
+
+			this.setXYZ( i, _vector$8.x, _vector$8.y, _vector$8.z );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Applies the given 4x4 matrix to the given attribute. Only works with
+	 * item size `3` and with direction vectors.
+	 *
+	 * @param {Matrix4} m - The matrix to apply.
+	 * @return {InterleavedBufferAttribute} A reference to this instance.
+	 */
+	transformDirection( m ) {
+
+		for ( let i = 0, l = this.count; i < l; i ++ ) {
+
+			_vector$8.fromBufferAttribute( this, i );
+
+			_vector$8.transformDirection( m );
+
+			this.setXYZ( i, _vector$8.x, _vector$8.y, _vector$8.z );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the given component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} component - The component index.
+	 * @return {number} The returned value.
+	 */
+	getComponent( index, component ) {
+
+		let value = this.array[ index * this.data.stride + this.offset + component ];
+
+		if ( this.normalized ) value = denormalize( value, this.array );
+
+		return value;
+
+	}
+
+	/**
+	 * Sets the given value to the given component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} component - The component index.
+	 * @param {number} value - The value to set.
+	 * @return {InterleavedBufferAttribute} A reference to this instance.
+	 */
+	setComponent( index, component, value ) {
+
+		if ( this.normalized ) value = normalize( value, this.array );
+
+		this.data.array[ index * this.data.stride + this.offset + component ] = value;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the x component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} x - The value to set.
+	 * @return {InterleavedBufferAttribute} A reference to this instance.
+	 */
+	setX( index, x ) {
+
+		if ( this.normalized ) x = normalize( x, this.array );
+
+		this.data.array[ index * this.data.stride + this.offset ] = x;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the y component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} y - The value to set.
+	 * @return {InterleavedBufferAttribute} A reference to this instance.
+	 */
+	setY( index, y ) {
+
+		if ( this.normalized ) y = normalize( y, this.array );
+
+		this.data.array[ index * this.data.stride + this.offset + 1 ] = y;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the z component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} z - The value to set.
+	 * @return {InterleavedBufferAttribute} A reference to this instance.
+	 */
+	setZ( index, z ) {
+
+		if ( this.normalized ) z = normalize( z, this.array );
+
+		this.data.array[ index * this.data.stride + this.offset + 2 ] = z;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the w component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} w - The value to set.
+	 * @return {InterleavedBufferAttribute} A reference to this instance.
+	 */
+	setW( index, w ) {
+
+		if ( this.normalized ) w = normalize( w, this.array );
+
+		this.data.array[ index * this.data.stride + this.offset + 3 ] = w;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the x component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @return {number} The x component.
+	 */
+	getX( index ) {
+
+		let x = this.data.array[ index * this.data.stride + this.offset ];
+
+		if ( this.normalized ) x = denormalize( x, this.array );
+
+		return x;
+
+	}
+
+	/**
+	 * Returns the y component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @return {number} The y component.
+	 */
+	getY( index ) {
+
+		let y = this.data.array[ index * this.data.stride + this.offset + 1 ];
+
+		if ( this.normalized ) y = denormalize( y, this.array );
+
+		return y;
+
+	}
+
+	/**
+	 * Returns the z component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @return {number} The z component.
+	 */
+	getZ( index ) {
+
+		let z = this.data.array[ index * this.data.stride + this.offset + 2 ];
+
+		if ( this.normalized ) z = denormalize( z, this.array );
+
+		return z;
+
+	}
+
+	/**
+	 * Returns the w component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @return {number} The w component.
+	 */
+	getW( index ) {
+
+		let w = this.data.array[ index * this.data.stride + this.offset + 3 ];
+
+		if ( this.normalized ) w = denormalize( w, this.array );
+
+		return w;
+
+	}
+
+	/**
+	 * Sets the x and y component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} x - The value for the x component to set.
+	 * @param {number} y - The value for the y component to set.
+	 * @return {InterleavedBufferAttribute} A reference to this instance.
+	 */
+	setXY( index, x, y ) {
+
+		index = index * this.data.stride + this.offset;
+
+		if ( this.normalized ) {
+
+			x = normalize( x, this.array );
+			y = normalize( y, this.array );
+
+		}
+
+		this.data.array[ index + 0 ] = x;
+		this.data.array[ index + 1 ] = y;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the x, y and z component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} x - The value for the x component to set.
+	 * @param {number} y - The value for the y component to set.
+	 * @param {number} z - The value for the z component to set.
+	 * @return {InterleavedBufferAttribute} A reference to this instance.
+	 */
+	setXYZ( index, x, y, z ) {
+
+		index = index * this.data.stride + this.offset;
+
+		if ( this.normalized ) {
+
+			x = normalize( x, this.array );
+			y = normalize( y, this.array );
+			z = normalize( z, this.array );
+
+		}
+
+		this.data.array[ index + 0 ] = x;
+		this.data.array[ index + 1 ] = y;
+		this.data.array[ index + 2 ] = z;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the x, y, z and w component of the vector at the given index.
+	 *
+	 * @param {number} index - The index into the buffer attribute.
+	 * @param {number} x - The value for the x component to set.
+	 * @param {number} y - The value for the y component to set.
+	 * @param {number} z - The value for the z component to set.
+	 * @param {number} w - The value for the w component to set.
+	 * @return {InterleavedBufferAttribute} A reference to this instance.
+	 */
+	setXYZW( index, x, y, z, w ) {
+
+		index = index * this.data.stride + this.offset;
+
+		if ( this.normalized ) {
+
+			x = normalize( x, this.array );
+			y = normalize( y, this.array );
+			z = normalize( z, this.array );
+			w = normalize( w, this.array );
+
+		}
+
+		this.data.array[ index + 0 ] = x;
+		this.data.array[ index + 1 ] = y;
+		this.data.array[ index + 2 ] = z;
+		this.data.array[ index + 3 ] = w;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new buffer attribute with copied values from this instance.
+	 *
+	 * If no parameter is provided, cloning an interleaved buffer attribute will de-interleave buffer data.
+	 *
+	 * @param {Object} [data] - An object with interleaved buffers that allows to retain the interleaved property.
+	 * @return {BufferAttribute|InterleavedBufferAttribute} A clone of this instance.
+	 */
+	clone( data ) {
+
+		if ( data === undefined ) {
+
+			log( 'InterleavedBufferAttribute.clone(): Cloning an interleaved buffer attribute will de-interleave buffer data.' );
+
+			const array = [];
+
+			for ( let i = 0; i < this.count; i ++ ) {
+
+				const index = i * this.data.stride + this.offset;
+
+				for ( let j = 0; j < this.itemSize; j ++ ) {
+
+					array.push( this.data.array[ index + j ] );
+
+				}
+
+			}
+
+			return new BufferAttribute( new this.array.constructor( array ), this.itemSize, this.normalized );
+
+		} else {
+
+			if ( data.interleavedBuffers === undefined ) {
+
+				data.interleavedBuffers = {};
+
+			}
+
+			if ( data.interleavedBuffers[ this.data.uuid ] === undefined ) {
+
+				data.interleavedBuffers[ this.data.uuid ] = this.data.clone( data );
+
+			}
+
+			return new InterleavedBufferAttribute( data.interleavedBuffers[ this.data.uuid ], this.itemSize, this.offset, this.normalized );
+
+		}
+
+	}
+
+	/**
+	 * Serializes the buffer attribute into JSON.
+	 *
+	 * If no parameter is provided, cloning an interleaved buffer attribute will de-interleave buffer data.
+	 *
+	 * @param {Object} [data] - An optional value holding meta information about the serialization.
+	 * @return {Object} A JSON object representing the serialized buffer attribute.
+	 */
+	toJSON( data ) {
+
+		if ( data === undefined ) {
+
+			log( 'InterleavedBufferAttribute.toJSON(): Serializing an interleaved buffer attribute will de-interleave buffer data.' );
+
+			const array = [];
+
+			for ( let i = 0; i < this.count; i ++ ) {
+
+				const index = i * this.data.stride + this.offset;
+
+				for ( let j = 0; j < this.itemSize; j ++ ) {
+
+					array.push( this.data.array[ index + j ] );
+
+				}
+
+			}
+
+			// de-interleave data and save it as an ordinary buffer attribute for now
+
+			return {
+				itemSize: this.itemSize,
+				type: this.array.constructor.name,
+				array: array,
+				normalized: this.normalized
+			};
+
+		} else {
+
+			// save as true interleaved attribute
+
+			if ( data.interleavedBuffers === undefined ) {
+
+				data.interleavedBuffers = {};
+
+			}
+
+			if ( data.interleavedBuffers[ this.data.uuid ] === undefined ) {
+
+				data.interleavedBuffers[ this.data.uuid ] = this.data.toJSON( data );
+
+			}
+
+			return {
+				isInterleavedBufferAttribute: true,
+				itemSize: this.itemSize,
+				data: this.data.uuid,
+				offset: this.offset,
+				normalized: this.normalized
+			};
+
+		}
+
+	}
+
+}
+
+const _vector1 = /*@__PURE__*/ new Vector3();
+const _vector2 = /*@__PURE__*/ new Vector3();
+const _normalMatrix = /*@__PURE__*/ new Matrix3();
+
+/**
+ * A two dimensional surface that extends infinitely in 3D space, represented
+ * in [Hessian normal form](https://mathworld.wolfram.com/HessianNormalForm.html)
+ * by a unit length normal vector and a constant.
+ */
+class Plane {
+
+	/**
+	 * Constructs a new plane.
+	 *
+	 * @param {Vector3} [normal=(1,0,0)] - A unit length vector defining the normal of the plane.
+	 * @param {number} [constant=0] - The signed distance from the origin to the plane.
+	 */
+	constructor( normal = new Vector3( 1, 0, 0 ), constant = 0 ) {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isPlane = true;
+
+		/**
+		 * A unit length vector defining the normal of the plane.
+		 *
+		 * @type {Vector3}
+		 */
+		this.normal = normal;
+
+		/**
+		 * The signed distance from the origin to the plane.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.constant = constant;
+
+	}
+
+	/**
+	 * Sets the plane components by copying the given values.
+	 *
+	 * @param {Vector3} normal - The normal.
+	 * @param {number} constant - The constant.
+	 * @return {Plane} A reference to this plane.
+	 */
+	set( normal, constant ) {
+
+		this.normal.copy( normal );
+		this.constant = constant;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the plane components by defining `x`, `y`, `z` as the
+	 * plane normal and `w` as the constant.
+	 *
+	 * @param {number} x - The value for the normal's x component.
+	 * @param {number} y - The value for the normal's y component.
+	 * @param {number} z - The value for the normal's z component.
+	 * @param {number} w - The constant value.
+	 * @return {Plane} A reference to this plane.
+	 */
+	setComponents( x, y, z, w ) {
+
+		this.normal.set( x, y, z );
+		this.constant = w;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the plane from the given normal and coplanar point (that is a point
+	 * that lies onto the plane).
+	 *
+	 * @param {Vector3} normal - The normal.
+	 * @param {Vector3} point - A coplanar point.
+	 * @return {Plane} A reference to this plane.
+	 */
+	setFromNormalAndCoplanarPoint( normal, point ) {
+
+		this.normal.copy( normal );
+		this.constant = - point.dot( this.normal );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the plane from three coplanar points. The winding order is
+	 * assumed to be counter-clockwise, and determines the direction of
+	 * the plane normal.
+	 *
+	 * @param {Vector3} a - The first coplanar point.
+	 * @param {Vector3} b - The second coplanar point.
+	 * @param {Vector3} c - The third coplanar point.
+	 * @return {Plane} A reference to this plane.
+	 */
+	setFromCoplanarPoints( a, b, c ) {
+
+		const normal = _vector1.subVectors( c, b ).cross( _vector2.subVectors( a, b ) ).normalize();
+
+		// Q: should an error be thrown if normal is zero (e.g. degenerate plane)?
+
+		this.setFromNormalAndCoplanarPoint( normal, a );
+
+		return this;
+
+	}
+
+	/**
+	 * Copies the values of the given plane to this instance.
+	 *
+	 * @param {Plane} plane - The plane to copy.
+	 * @return {Plane} A reference to this plane.
+	 */
+	copy( plane ) {
+
+		this.normal.copy( plane.normal );
+		this.constant = plane.constant;
+
+		return this;
+
+	}
+
+	/**
+	 * Normalizes the plane normal and adjusts the constant accordingly.
+	 *
+	 * @return {Plane} A reference to this plane.
+	 */
+	normalize() {
+
+		// Note: will lead to a divide by zero if the plane is invalid.
+
+		const inverseNormalLength = 1.0 / this.normal.length();
+		this.normal.multiplyScalar( inverseNormalLength );
+		this.constant *= inverseNormalLength;
+
+		return this;
+
+	}
+
+	/**
+	 * Negates both the plane normal and the constant.
+	 *
+	 * @return {Plane} A reference to this plane.
+	 */
+	negate() {
+
+		this.constant *= -1;
+		this.normal.negate();
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the signed distance from the given point to this plane.
+	 *
+	 * @param {Vector3} point - The point to compute the distance for.
+	 * @return {number} The signed distance.
+	 */
+	distanceToPoint( point ) {
+
+		return this.normal.dot( point ) + this.constant;
+
+	}
+
+	/**
+	 * Returns the signed distance from the given sphere to this plane.
+	 *
+	 * @param {Sphere} sphere - The sphere to compute the distance for.
+	 * @return {number} The signed distance.
+	 */
+	distanceToSphere( sphere ) {
+
+		return this.distanceToPoint( sphere.center ) - sphere.radius;
+
+	}
+
+	/**
+	 * Projects a the given point onto the plane.
+	 *
+	 * @param {Vector3} point - The point to project.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The projected point on the plane.
+	 */
+	projectPoint( point, target ) {
+
+		return target.copy( point ).addScaledVector( this.normal, - this.distanceToPoint( point ) );
+
+	}
+
+	/**
+	 * Returns the intersection point of the passed line and the plane. Returns
+	 * `null` if the line does not intersect. Returns the line's starting point if
+	 * the line is coplanar with the plane.
+	 *
+	 * @param {Line3} line - The line to compute the intersection for.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @param {boolean} [clampToLine=true] - Whether to clamp the intersection to the line segment.
+	 * @return {?Vector3} The intersection point. Returns `null` if no intersection is detected.
+	 */
+	intersectLine( line, target, clampToLine = true ) {
+
+		const direction = line.delta( _vector1 );
+
+		const denominator = this.normal.dot( direction );
+
+		if ( denominator === 0 ) {
+
+			// line is coplanar, return origin
+			if ( this.distanceToPoint( line.start ) === 0 ) {
+
+				return target.copy( line.start );
+
+			}
+
+			// Unsure if this is the correct method to handle this case.
+			return null;
+
+		}
+
+		const t = - ( line.start.dot( this.normal ) + this.constant ) / denominator;
+
+		if ( ( clampToLine === true ) && ( t < 0 || t > 1 ) ) {
+
+			return null;
+
+		}
+
+		return target.copy( line.start ).addScaledVector( direction, t );
+
+	}
+
+	/**
+	 * Returns `true` if the given line segment intersects with (passes through) the plane.
+	 *
+	 * @param {Line3} line - The line to test.
+	 * @return {boolean} Whether the given line segment intersects with the plane or not.
+	 */
+	intersectsLine( line ) {
+
+		// Note: this tests if a line intersects the plane, not whether it (or its end-points) are coplanar with it.
+
+		const startSign = this.distanceToPoint( line.start );
+		const endSign = this.distanceToPoint( line.end );
+
+		return ( startSign < 0 && endSign > 0 ) || ( endSign < 0 && startSign > 0 );
+
+	}
+
+	/**
+	 * Returns `true` if the given bounding box intersects with the plane.
+	 *
+	 * @param {Box3} box - The bounding box to test.
+	 * @return {boolean} Whether the given bounding box intersects with the plane or not.
+	 */
+	intersectsBox( box ) {
+
+		return box.intersectsPlane( this );
+
+	}
+
+	/**
+	 * Returns `true` if the given bounding sphere intersects with the plane.
+	 *
+	 * @param {Sphere} sphere - The bounding sphere to test.
+	 * @return {boolean} Whether the given bounding sphere intersects with the plane or not.
+	 */
+	intersectsSphere( sphere ) {
+
+		return sphere.intersectsPlane( this );
+
+	}
+
+	/**
+	 * Returns a coplanar vector to the plane, by calculating the
+	 * projection of the normal at the origin onto the plane.
+	 *
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The coplanar point.
+	 */
+	coplanarPoint( target ) {
+
+		return target.copy( this.normal ).multiplyScalar( - this.constant );
+
+	}
+
+	/**
+	 * Apply a 4x4 matrix to the plane. The matrix must be an affine, homogeneous transform.
+	 *
+	 * The optional normal matrix can be pre-computed like so:
+	 * ```js
+	 * const optionalNormalMatrix = new THREE.Matrix3().getNormalMatrix( matrix );
+	 * ```
+	 *
+	 * @param {Matrix4} matrix - The transformation matrix.
+	 * @param {Matrix4} [optionalNormalMatrix] - A pre-computed normal matrix.
+	 * @return {Plane} A reference to this plane.
+	 */
+	applyMatrix4( matrix, optionalNormalMatrix ) {
+
+		const normalMatrix = optionalNormalMatrix || _normalMatrix.getNormalMatrix( matrix );
+
+		const referencePoint = this.coplanarPoint( _vector1 ).applyMatrix4( matrix );
+
+		const normal = this.normal.applyMatrix3( normalMatrix ).normalize();
+
+		this.constant = - referencePoint.dot( normal );
+
+		return this;
+
+	}
+
+	/**
+	 * Translates the plane by the distance defined by the given offset vector.
+	 * Note that this only affects the plane constant and will not affect the normal vector.
+	 *
+	 * @param {Vector3} offset - The offset vector.
+	 * @return {Plane} A reference to this plane.
+	 */
+	translate( offset ) {
+
+		this.constant -= offset.dot( this.normal );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this plane is equal with the given one.
+	 *
+	 * @param {Plane} plane - The plane to test for equality.
+	 * @return {boolean} Whether this plane is equal with the given one.
+	 */
+	equals( plane ) {
+
+		return plane.normal.equals( this.normal ) && ( plane.constant === this.constant );
+
+	}
+
+	/**
+	 * Returns a new plane with copied values from this instance.
+	 *
+	 * @return {Plane} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+	/**
+	 * Returns a serialized structure of the plane.
+	 *
+	 * @return {Object} Serialized structure with fields representing the object state.
+	 */
+	toJSON() {
+
+		return {
+			normal: this.normal.toArray(),
+			constant: this.constant
+		};
+
+	}
+
+	/**
+	 * Sets the plane properties from the given JSON.
+	 *
+	 * @param {Object} json - The serialized json to set the plane from.
+	 * @return {Plane} A reference to this plane.
+	 */
+	fromJSON( json ) {
+
+		this.normal.fromArray( json.normal );
+		this.constant = json.constant;
+
+		return this;
+
+	}
+
+}
+
+let _materialId = 0;
+
+/**
+ * Abstract base class for materials.
+ *
+ * Materials define the appearance of renderable 3D objects.
+ *
+ * @abstract
+ * @augments EventDispatcher
+ */
+class Material extends EventDispatcher {
+
+	/**
+	 * Constructs a new material.
+	 */
+	constructor() {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isMaterial = true;
+
+		/**
+		 * The ID of the material.
+		 *
+		 * @name Material#id
+		 * @type {number}
+		 * @readonly
+		 */
+		Object.defineProperty( this, 'id', { value: _materialId ++ } );
+
+		/**
+		 * The UUID of the material.
+		 *
+		 * @type {string}
+		 * @readonly
+		 */
+		this.uuid = generateUUID();
+
+		/**
+		 * The name of the material.
+		 *
+		 * @type {string}
+		 */
+		this.name = '';
+
+		/**
+		 * The type property is used for detecting the object type
+		 * in context of serialization/deserialization.
+		 *
+		 * @type {string}
+		 * @readonly
+		 */
+		this.type = 'Material';
+
+		/**
+		 * Defines the blending type of the material.
+		 *
+		 * It must be set to `CustomBlending` if custom blending properties like
+		 * {@link Material#blendSrc}, {@link Material#blendDst} or {@link Material#blendEquation}
+		 * should have any effect.
+		 *
+		 * @type {(NoBlending|NormalBlending|AdditiveBlending|SubtractiveBlending|MultiplyBlending|CustomBlending)}
+		 * @default NormalBlending
+		 */
+		this.blending = NormalBlending;
+
+		/**
+		 * Defines which side of faces will be rendered - front, back or both.
+		 *
+		 * @type {(FrontSide|BackSide|DoubleSide)}
+		 * @default FrontSide
+		 */
+		this.side = FrontSide;
+
+		/**
+		 * If set to `true`, vertex colors should be used.
+		 *
+		 * The engine supports RGB and RGBA vertex colors depending on whether a three (RGB) or
+		 * four (RGBA) component color buffer attribute is used.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.vertexColors = false;
+
+		/**
+		 * Defines how transparent the material is.
+		 * A value of `0.0` indicates fully transparent, `1.0` is fully opaque.
+		 *
+		 * If the {@link Material#transparent} is not set to `true`,
+		 * the material will remain fully opaque and this value will only affect its color.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.opacity = 1;
+
+		/**
+		 * Defines whether this material is transparent. This has an effect on
+		 * rendering as transparent objects need special treatment and are rendered
+		 * after non-transparent objects.
+		 *
+		 * When set to true, the extent to which the material is transparent is
+		 * controlled by {@link Material#opacity}.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.transparent = false;
+
+		/**
+		 * Enables alpha hashed transparency, an alternative to {@link Material#transparent} or
+		 * {@link Material#alphaTest}. The material will not be rendered if opacity is lower than
+		 * a random threshold. Randomization introduces some grain or noise, but approximates alpha
+		 * blending without the associated problems of sorting. Using TAA can reduce the resulting noise.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.alphaHash = false;
+
+		/**
+		 * Defines the blending source factor.
+		 *
+		 * @type {(ZeroFactor|OneFactor|SrcColorFactor|OneMinusSrcColorFactor|SrcAlphaFactor|OneMinusSrcAlphaFactor|DstAlphaFactor|OneMinusDstAlphaFactor|DstColorFactor|OneMinusDstColorFactor|SrcAlphaSaturateFactor|ConstantColorFactor|OneMinusConstantColorFactor|ConstantAlphaFactor|OneMinusConstantAlphaFactor)}
+		 * @default SrcAlphaFactor
+		 */
+		this.blendSrc = SrcAlphaFactor;
+
+		/**
+		 * Defines the blending destination factor.
+		 *
+		 * @type {(ZeroFactor|OneFactor|SrcColorFactor|OneMinusSrcColorFactor|SrcAlphaFactor|OneMinusSrcAlphaFactor|DstAlphaFactor|OneMinusDstAlphaFactor|DstColorFactor|OneMinusDstColorFactor|SrcAlphaSaturateFactor|ConstantColorFactor|OneMinusConstantColorFactor|ConstantAlphaFactor|OneMinusConstantAlphaFactor)}
+		 * @default OneMinusSrcAlphaFactor
+		 */
+		this.blendDst = OneMinusSrcAlphaFactor;
+
+		/**
+		 * Defines the blending equation.
+		 *
+		 * @type {(AddEquation|SubtractEquation|ReverseSubtractEquation|MinEquation|MaxEquation)}
+		 * @default AddEquation
+		 */
+		this.blendEquation = AddEquation;
+
+		/**
+		 * Defines the blending source alpha factor.
+		 *
+		 * @type {?(ZeroFactor|OneFactor|SrcColorFactor|OneMinusSrcColorFactor|SrcAlphaFactor|OneMinusSrcAlphaFactor|DstAlphaFactor|OneMinusDstAlphaFactor|DstColorFactor|OneMinusDstColorFactor|SrcAlphaSaturateFactor|ConstantColorFactor|OneMinusConstantColorFactor|ConstantAlphaFactor|OneMinusConstantAlphaFactor)}
+		 * @default null
+		 */
+		this.blendSrcAlpha = null;
+
+		/**
+		 * Defines the blending destination alpha factor.
+		 *
+		 * @type {?(ZeroFactor|OneFactor|SrcColorFactor|OneMinusSrcColorFactor|SrcAlphaFactor|OneMinusSrcAlphaFactor|DstAlphaFactor|OneMinusDstAlphaFactor|DstColorFactor|OneMinusDstColorFactor|SrcAlphaSaturateFactor|ConstantColorFactor|OneMinusConstantColorFactor|ConstantAlphaFactor|OneMinusConstantAlphaFactor)}
+		 * @default null
+		 */
+		this.blendDstAlpha = null;
+
+		/**
+		 * Defines the blending equation of the alpha channel.
+		 *
+		 * @type {?(AddEquation|SubtractEquation|ReverseSubtractEquation|MinEquation|MaxEquation)}
+		 * @default null
+		 */
+		this.blendEquationAlpha = null;
+
+		/**
+		 * Represents the RGB values of the constant blend color.
+		 *
+		 * This property has only an effect when using custom blending with `ConstantColor` or `OneMinusConstantColor`.
+		 *
+		 * @type {Color}
+		 * @default (0,0,0)
+		 */
+		this.blendColor = new Color( 0, 0, 0 );
+
+		/**
+		 * Represents the alpha value of the constant blend color.
+		 *
+		 * This property has only an effect when using custom blending with `ConstantAlpha` or `OneMinusConstantAlpha`.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.blendAlpha = 0;
+
+		/**
+		 * Defines the depth function.
+		 *
+		 * @type {(NeverDepth|AlwaysDepth|LessDepth|LessEqualDepth|EqualDepth|GreaterEqualDepth|GreaterDepth|NotEqualDepth)}
+		 * @default LessEqualDepth
+		 */
+		this.depthFunc = LessEqualDepth;
+
+		/**
+		 * Whether to have depth test enabled when rendering this material.
+		 * When the depth test is disabled, the depth write will also be implicitly disabled.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.depthTest = true;
+
+		/**
+		 * Whether rendering this material has any effect on the depth buffer.
+		 *
+		 * When drawing 2D overlays it can be useful to disable the depth writing in
+		 * order to layer several things together without creating z-index artifacts.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.depthWrite = true;
+
+		/**
+		 * The bit mask to use when writing to the stencil buffer.
+		 *
+		 * @type {number}
+		 * @default 0xff
+		 */
+		this.stencilWriteMask = 0xff;
+
+		/**
+		 * The stencil comparison function to use.
+		 *
+		 * @type {NeverStencilFunc|LessStencilFunc|EqualStencilFunc|LessEqualStencilFunc|GreaterStencilFunc|NotEqualStencilFunc|GreaterEqualStencilFunc|AlwaysStencilFunc}
+		 * @default AlwaysStencilFunc
+		 */
+		this.stencilFunc = AlwaysStencilFunc;
+
+		/**
+		 * The value to use when performing stencil comparisons or stencil operations.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.stencilRef = 0;
+
+		/**
+		 * The bit mask to use when comparing against the stencil buffer.
+		 *
+		 * @type {number}
+		 * @default 0xff
+		 */
+		this.stencilFuncMask = 0xff;
+
+		/**
+		 * Which stencil operation to perform when the comparison function returns `false`.
+		 *
+		 * @type {ZeroStencilOp|KeepStencilOp|ReplaceStencilOp|IncrementStencilOp|DecrementStencilOp|IncrementWrapStencilOp|DecrementWrapStencilOp|InvertStencilOp}
+		 * @default KeepStencilOp
+		 */
+		this.stencilFail = KeepStencilOp;
+
+		/**
+		 * Which stencil operation to perform when the comparison function returns
+		 * `true` but the depth test fails.
+		 *
+		 * @type {ZeroStencilOp|KeepStencilOp|ReplaceStencilOp|IncrementStencilOp|DecrementStencilOp|IncrementWrapStencilOp|DecrementWrapStencilOp|InvertStencilOp}
+		 * @default KeepStencilOp
+		 */
+		this.stencilZFail = KeepStencilOp;
+
+		/**
+		 * Which stencil operation to perform when the comparison function returns
+		 * `true` and the depth test passes.
+		 *
+		 * @type {ZeroStencilOp|KeepStencilOp|ReplaceStencilOp|IncrementStencilOp|DecrementStencilOp|IncrementWrapStencilOp|DecrementWrapStencilOp|InvertStencilOp}
+		 * @default KeepStencilOp
+		 */
+		this.stencilZPass = KeepStencilOp;
+
+		/**
+		 * Whether stencil operations are performed against the stencil buffer. In
+		 * order to perform writes or comparisons against the stencil buffer this
+		 * value must be `true`.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.stencilWrite = false;
+
+		/**
+		 * User-defined clipping planes specified as THREE.Plane objects in world
+		 * space. These planes apply to the objects this material is attached to.
+		 * Points in space whose signed distance to the plane is negative are clipped
+		 * (not rendered). This requires {@link WebGLRenderer#localClippingEnabled} to
+		 * be `true`.
+		 *
+		 * @type {?Array<Plane>}
+		 * @default null
+		 */
+		this.clippingPlanes = null;
+
+		/**
+		 * Changes the behavior of clipping planes so that only their intersection is
+		 * clipped, rather than their union.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.clipIntersection = false;
+
+		/**
+		 * Defines whether to clip shadows according to the clipping planes specified
+		 * on this material.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.clipShadows = false;
+
+		/**
+		 * Defines which side of faces cast shadows. If `null`, the side casting shadows
+		 * is determined as follows:
+		 *
+		 * - When {@link Material#side} is set to `FrontSide`, the back side cast shadows.
+		 * - When {@link Material#side} is set to `BackSide`, the front side cast shadows.
+		 * - When {@link Material#side} is set to `DoubleSide`, both sides cast shadows.
+		 *
+		 * @type {?(FrontSide|BackSide|DoubleSide)}
+		 * @default null
+		 */
+		this.shadowSide = null;
+
+		/**
+		 * Whether to render the material's color.
+		 *
+		 * This can be used in conjunction with {@link Object3D#renderOder} to create invisible
+		 * objects that occlude other objects.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.colorWrite = true;
+
+		/**
+		 * Override the renderer's default precision for this material.
+		 *
+		 * @type {?('highp'|'mediump'|'lowp')}
+		 * @default null
+		 */
+		this.precision = null;
+
+		/**
+		 * Whether to use polygon offset or not. When enabled, each fragment's depth value will
+		 * be offset after it is interpolated from the depth values of the appropriate vertices.
+		 * The offset is added before the depth test is performed and before the value is written
+		 * into the depth buffer.
+		 *
+		 * Can be useful for rendering hidden-line images, for applying decals to surfaces, and for
+		 * rendering solids with highlighted edges.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.polygonOffset = false;
+
+		/**
+		 * Specifies a scale factor that is used to create a variable depth offset for each polygon.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.polygonOffsetFactor = 0;
+
+		/**
+		 * Is multiplied by an implementation-specific value to create a constant depth offset.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.polygonOffsetUnits = 0;
+
+		/**
+		 * Whether to apply dithering to the color to remove the appearance of banding.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.dithering = false;
+
+		/**
+		 * Whether alpha to coverage should be enabled or not. Can only be used with MSAA-enabled contexts
+		 * (meaning when the renderer was created with *antialias* parameter set to `true`). Enabling this
+		 * will smooth aliasing on clip plane edges and alphaTest-clipped edges.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.alphaToCoverage = false;
+
+		/**
+		 * Whether to premultiply the alpha (transparency) value.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.premultipliedAlpha = false;
+
+		/**
+		 * Whether double-sided, transparent objects should be rendered with a single pass or not.
+		 *
+		 * The engine renders double-sided, transparent objects with two draw calls (back faces first,
+		 * then front faces) to mitigate transparency artifacts. There are scenarios however where this
+		 * approach produces no quality gains but still doubles draw calls e.g. when rendering flat
+		 * vegetation like grass sprites. In these cases, set the `forceSinglePass` flag to `true` to
+		 * disable the two pass rendering to avoid performance issues.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.forceSinglePass = false;
+
+		/**
+		 * Whether it's possible to override the material with {@link Scene#overrideMaterial} or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.allowOverride = true;
+
+		/**
+		 * Defines whether 3D objects using this material are visible.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.visible = true;
+
+		/**
+		 * Defines whether this material is tone mapped according to the renderer's tone mapping setting.
+		 *
+		 * It is ignored when rendering to a render target or using post processing or when using
+		 * `WebGPURenderer`. In all these cases, all materials are honored by tone mapping.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.toneMapped = true;
+
+		/**
+		 * An object that can be used to store custom data about the Material. It
+		 * should not hold references to functions as these will not be cloned.
+		 *
+		 * @type {Object}
+		 */
+		this.userData = {};
+
+		/**
+		 * This starts at `0` and counts how many times {@link Material#needsUpdate} is set to `true`.
+		 *
+		 * @type {number}
+		 * @readonly
+		 * @default 0
+		 */
+		this.version = 0;
+
+		this._alphaTest = 0;
+
+	}
+
+	/**
+	 * Sets the alpha value to be used when running an alpha test. The material
+	 * will not be rendered if the opacity is lower than this value.
+	 *
+	 * @type {number}
+	 * @readonly
+	 * @default 0
+	 */
+	get alphaTest() {
+
+		return this._alphaTest;
+
+	}
+
+	set alphaTest( value ) {
+
+		if ( this._alphaTest > 0 !== value > 0 ) {
+
+			this.version ++;
+
+		}
+
+		this._alphaTest = value;
+
+	}
+
+	/**
+	 * An optional callback that is executed immediately before the material is used to render a 3D object.
+	 *
+	 * This method can only be used when rendering with {@link WebGLRenderer}.
+	 *
+	 * @param {WebGLRenderer} renderer - The renderer.
+	 * @param {Scene} scene - The scene.
+	 * @param {Camera} camera - The camera that is used to render the scene.
+	 * @param {BufferGeometry} geometry - The 3D object's geometry.
+	 * @param {Object3D} object - The 3D object.
+	 * @param {Object} group - The geometry group data.
+	 */
+	onBeforeRender( /* renderer, scene, camera, geometry, object, group */ ) {}
+
+	/**
+	 * An optional callback that is executed immediately before the shader
+	 * program is compiled. This function is called with the shader source code
+	 * as a parameter. Useful for the modification of built-in materials.
+	 *
+	 * This method can only be used when rendering with {@link WebGLRenderer}. The
+	 * recommended approach when customizing materials is to use `WebGPURenderer` with the new
+	 * Node Material system and [TSL](https://github.com/mrdoob/three.js/wiki/Three.js-Shading-Language).
+	 *
+	 * @param {{vertexShader:string,fragmentShader:string,uniforms:Object}} shaderobject - The object holds the uniforms and the vertex and fragment shader source.
+	 * @param {WebGLRenderer} renderer - A reference to the renderer.
+	 */
+	onBeforeCompile( /* shaderobject, renderer */ ) {}
+
+	/**
+	 * In case {@link Material#onBeforeCompile} is used, this callback can be used to identify
+	 * values of settings used in `onBeforeCompile()`, so three.js can reuse a cached
+	 * shader or recompile the shader for this material as needed.
+	 *
+	 * This method can only be used when rendering with {@link WebGLRenderer}.
+	 *
+	 * @return {string} The custom program cache key.
+	 */
+	customProgramCacheKey() {
+
+		return this.onBeforeCompile.toString();
+
+	}
+
+	/**
+	 * This method can be used to set default values from parameter objects.
+	 * It is a generic implementation so it can be used with different types
+	 * of materials.
+	 *
+	 * @param {Object} [values] - The material values to set.
+	 */
+	setValues( values ) {
+
+		if ( values === undefined ) return;
+
+		for ( const key in values ) {
+
+			const newValue = values[ key ];
+
+			if ( newValue === undefined ) {
+
+				warn( `Material: parameter '${ key }' has value of undefined.` );
+				continue;
+
+			}
+
+			const currentValue = this[ key ];
+
+			if ( currentValue === undefined ) {
+
+				warn( `Material: '${ key }' is not a property of THREE.${ this.type }.` );
+				continue;
+
+			}
+
+			if ( currentValue && currentValue.isColor ) {
+
+				currentValue.set( newValue );
+
+			} else if (
+				( ( currentValue && currentValue.isVector2 ) && ( newValue && newValue.isVector2 ) ) ||
+				( ( currentValue && currentValue.isEuler ) && ( newValue && newValue.isEuler ) ) ||
+				( ( currentValue && currentValue.isVector3 ) && ( newValue && newValue.isVector3 ) )
+			) {
+
+				currentValue.copy( newValue );
+
+			} else {
+
+				this[ key ] = newValue;
+
+			}
+
+		}
+
+	}
+
+	/**
+	 * Serializes the material into JSON.
+	 *
+	 * @param {?(Object|string)} meta - An optional value holding meta information about the serialization.
+	 * @return {Object} A JSON object representing the serialized material.
+	 * @see {@link ObjectLoader#parse}
+	 */
+	toJSON( meta ) {
+
+		const isRootObject = ( meta === undefined || typeof meta === 'string' );
+
+		if ( isRootObject ) {
+
+			meta = {
+				textures: {},
+				images: {}
+			};
+
+		}
+
+		const data = {
+			metadata: {
+				version: 4.7,
+				type: 'Material',
+				generator: 'Material.toJSON'
+			}
+		};
+
+		// standard Material serialization
+
+		data.uuid = this.uuid;
+		data.type = this.type;
+
+		data.blending = this.blending;
+		data.side = this.side;
+		data.shadowSide = this.shadowSide;
+		data.vertexColors = this.vertexColors;
+
+		data.opacity = this.opacity;
+		data.transparent = this.transparent;
+
+		data.blendSrc = this.blendSrc;
+		data.blendDst = this.blendDst;
+		data.blendEquation = this.blendEquation;
+		data.blendSrcAlpha = this.blendSrcAlpha;
+		data.blendDstAlpha = this.blendDstAlpha;
+		data.blendEquationAlpha = this.blendEquationAlpha;
+		data.blendColor = this.blendColor.getHex();
+		data.blendAlpha = this.blendAlpha;
+
+		data.depthFunc = this.depthFunc;
+		data.depthTest = this.depthTest;
+		data.depthWrite = this.depthWrite;
+		data.colorWrite = this.colorWrite;
+
+		data.clipIntersection = this.clipIntersection;
+		data.clipShadows = this.clipShadows;
+
+		data.stencilWriteMask = this.stencilWriteMask;
+		data.stencilFunc = this.stencilFunc;
+		data.stencilRef = this.stencilRef;
+		data.stencilFuncMask = this.stencilFuncMask;
+		data.stencilFail = this.stencilFail;
+		data.stencilZFail = this.stencilZFail;
+		data.stencilZPass = this.stencilZPass;
+		data.stencilWrite = this.stencilWrite;
+
+		data.polygonOffset = this.polygonOffset;
+		data.polygonOffsetFactor = this.polygonOffsetFactor;
+		data.polygonOffsetUnits = this.polygonOffsetUnits;
+
+		data.dithering = this.dithering;
+
+		data.alphaTest = this.alphaTest;
+		data.alphaHash = this.alphaHash;
+		data.alphaToCoverage = this.alphaToCoverage;
+		data.premultipliedAlpha = this.premultipliedAlpha;
+		data.forceSinglePass = this.forceSinglePass;
+		data.allowOverride = this.allowOverride;
+
+		data.visible = this.visible;
+		data.toneMapped = this.toneMapped;
+
+		data.name = this.name;
+
+		if ( this.color && this.color.isColor ) data.color = this.color.getHex();
+
+		if ( this.roughness !== undefined ) data.roughness = this.roughness;
+		if ( this.metalness !== undefined ) data.metalness = this.metalness;
+
+		if ( this.sheen !== undefined ) data.sheen = this.sheen;
+		if ( this.sheenColor && this.sheenColor.isColor ) data.sheenColor = this.sheenColor.getHex();
+		if ( this.sheenRoughness !== undefined ) data.sheenRoughness = this.sheenRoughness;
+		if ( this.emissive && this.emissive.isColor ) data.emissive = this.emissive.getHex();
+		if ( this.emissiveIntensity !== undefined ) data.emissiveIntensity = this.emissiveIntensity;
+
+		if ( this.specular && this.specular.isColor ) data.specular = this.specular.getHex();
+		if ( this.specularIntensity !== undefined ) data.specularIntensity = this.specularIntensity;
+		if ( this.specularColor && this.specularColor.isColor ) data.specularColor = this.specularColor.getHex();
+		if ( this.shininess !== undefined ) data.shininess = this.shininess;
+		if ( this.clearcoat !== undefined ) data.clearcoat = this.clearcoat;
+		if ( this.clearcoatRoughness !== undefined ) data.clearcoatRoughness = this.clearcoatRoughness;
+
+		if ( this.clearcoatMap && this.clearcoatMap.isTexture ) {
+
+			data.clearcoatMap = this.clearcoatMap.toJSON( meta ).uuid;
+
+		}
+
+		if ( this.clearcoatRoughnessMap && this.clearcoatRoughnessMap.isTexture ) {
+
+			data.clearcoatRoughnessMap = this.clearcoatRoughnessMap.toJSON( meta ).uuid;
+
+		}
+
+		if ( this.clearcoatNormalMap && this.clearcoatNormalMap.isTexture ) {
+
+			data.clearcoatNormalMap = this.clearcoatNormalMap.toJSON( meta ).uuid;
+			data.clearcoatNormalScale = this.clearcoatNormalScale.toArray();
+
+		}
+
+		if ( this.sheenColorMap && this.sheenColorMap.isTexture ) {
+
+			data.sheenColorMap = this.sheenColorMap.toJSON( meta ).uuid;
+
+		}
+
+		if ( this.sheenRoughnessMap && this.sheenRoughnessMap.isTexture ) {
+
+			data.sheenRoughnessMap = this.sheenRoughnessMap.toJSON( meta ).uuid;
+
+		}
+
+		if ( this.dispersion !== undefined ) data.dispersion = this.dispersion;
+		if ( this.retroreflectivity !== undefined ) data.retroreflectivity = this.retroreflectivity;
+
+		if ( this.iridescence !== undefined ) data.iridescence = this.iridescence;
+		if ( this.iridescenceIOR !== undefined ) data.iridescenceIOR = this.iridescenceIOR;
+		if ( this.iridescenceThicknessRange !== undefined ) data.iridescenceThicknessRange = this.iridescenceThicknessRange;
+
+		if ( this.iridescenceMap && this.iridescenceMap.isTexture ) {
+
+			data.iridescenceMap = this.iridescenceMap.toJSON( meta ).uuid;
+
+		}
+
+		if ( this.iridescenceThicknessMap && this.iridescenceThicknessMap.isTexture ) {
+
+			data.iridescenceThicknessMap = this.iridescenceThicknessMap.toJSON( meta ).uuid;
+
+		}
+
+		if ( this.anisotropy !== undefined ) data.anisotropy = this.anisotropy;
+		if ( this.anisotropyRotation !== undefined ) data.anisotropyRotation = this.anisotropyRotation;
+
+		if ( this.anisotropyMap && this.anisotropyMap.isTexture ) {
+
+			data.anisotropyMap = this.anisotropyMap.toJSON( meta ).uuid;
+
+		}
+
+		if ( this.map && this.map.isTexture ) data.map = this.map.toJSON( meta ).uuid;
+		if ( this.matcap && this.matcap.isTexture ) data.matcap = this.matcap.toJSON( meta ).uuid;
+		if ( this.alphaMap && this.alphaMap.isTexture ) data.alphaMap = this.alphaMap.toJSON( meta ).uuid;
+
+		if ( this.lightMap && this.lightMap.isTexture ) {
+
+			data.lightMap = this.lightMap.toJSON( meta ).uuid;
+			data.lightMapIntensity = this.lightMapIntensity;
+
+		}
+
+		if ( this.aoMap && this.aoMap.isTexture ) {
+
+			data.aoMap = this.aoMap.toJSON( meta ).uuid;
+			data.aoMapIntensity = this.aoMapIntensity;
+
+		}
+
+		if ( this.bumpMap && this.bumpMap.isTexture ) {
+
+			data.bumpMap = this.bumpMap.toJSON( meta ).uuid;
+			data.bumpScale = this.bumpScale;
+
+		}
+
+		if ( this.normalMap && this.normalMap.isTexture ) {
+
+			data.normalMap = this.normalMap.toJSON( meta ).uuid;
+			data.normalMapType = this.normalMapType;
+			data.normalScale = this.normalScale.toArray();
+
+		}
+
+		if ( this.displacementMap && this.displacementMap.isTexture ) {
+
+			data.displacementMap = this.displacementMap.toJSON( meta ).uuid;
+			data.displacementScale = this.displacementScale;
+			data.displacementBias = this.displacementBias;
+
+		}
+
+		if ( this.roughnessMap && this.roughnessMap.isTexture ) data.roughnessMap = this.roughnessMap.toJSON( meta ).uuid;
+		if ( this.metalnessMap && this.metalnessMap.isTexture ) data.metalnessMap = this.metalnessMap.toJSON( meta ).uuid;
+
+		if ( this.emissiveMap && this.emissiveMap.isTexture ) data.emissiveMap = this.emissiveMap.toJSON( meta ).uuid;
+		if ( this.specularMap && this.specularMap.isTexture ) data.specularMap = this.specularMap.toJSON( meta ).uuid;
+		if ( this.specularIntensityMap && this.specularIntensityMap.isTexture ) data.specularIntensityMap = this.specularIntensityMap.toJSON( meta ).uuid;
+		if ( this.specularColorMap && this.specularColorMap.isTexture ) data.specularColorMap = this.specularColorMap.toJSON( meta ).uuid;
+
+		if ( this.envMap && this.envMap.isTexture ) {
+
+			data.envMap = this.envMap.toJSON( meta ).uuid;
+
+			if ( this.combine !== undefined ) data.combine = this.combine;
+
+		}
+
+		if ( this.envMapRotation !== undefined ) data.envMapRotation = this.envMapRotation.toArray();
+		if ( this.envMapIntensity !== undefined ) data.envMapIntensity = this.envMapIntensity;
+		if ( this.reflectivity !== undefined ) data.reflectivity = this.reflectivity;
+		if ( this.refractionRatio !== undefined ) data.refractionRatio = this.refractionRatio;
+
+		if ( this.gradientMap && this.gradientMap.isTexture ) {
+
+			data.gradientMap = this.gradientMap.toJSON( meta ).uuid;
+
+		}
+
+		if ( this.transmission !== undefined ) data.transmission = this.transmission;
+		if ( this.transmissionMap && this.transmissionMap.isTexture ) data.transmissionMap = this.transmissionMap.toJSON( meta ).uuid;
+		if ( this.thickness !== undefined ) data.thickness = this.thickness;
+		if ( this.thicknessMap && this.thicknessMap.isTexture ) data.thicknessMap = this.thicknessMap.toJSON( meta ).uuid;
+		if ( this.attenuationDistance !== undefined ) data.attenuationDistance = this.attenuationDistance;
+		if ( this.attenuationColor !== undefined ) data.attenuationColor = this.attenuationColor.getHex();
+
+		if ( this.size !== undefined ) data.size = this.size;
+		if ( this.sizeAttenuation !== undefined ) data.sizeAttenuation = this.sizeAttenuation;
+
+		if ( Array.isArray( this.clippingPlanes ) && this.clippingPlanes.length > 0 ) {
+
+			data.clippingPlanes = this.clippingPlanes.map( plane => plane.toJSON() );
+
+		}
+
+		// rotation (SpriteMaterial)
+		if ( this.rotation !== undefined ) data.rotation = this.rotation;
+
+		// depthPacking (MeshDepthMaterial)
+		if ( this.depthPacking !== undefined ) data.depthPacking = this.depthPacking;
+
+		if ( this.linewidth !== undefined ) data.linewidth = this.linewidth;
+		if ( this.linecap !== undefined ) data.linecap = this.linecap;
+		if ( this.linejoin !== undefined ) data.linejoin = this.linejoin;
+		if ( this.dashSize !== undefined ) data.dashSize = this.dashSize;
+		if ( this.gapSize !== undefined ) data.gapSize = this.gapSize;
+		if ( this.scale !== undefined ) data.scale = this.scale;
+
+		if ( this.wireframe !== undefined ) data.wireframe = this.wireframe;
+		if ( this.wireframeLinewidth !== undefined ) data.wireframeLinewidth = this.wireframeLinewidth;
+		if ( this.wireframeLinecap !== undefined ) data.wireframeLinecap = this.wireframeLinecap;
+		if ( this.wireframeLinejoin !== undefined ) data.wireframeLinejoin = this.wireframeLinejoin;
+
+		if ( this.flatShading !== undefined ) data.flatShading = this.flatShading;
+
+		if ( this.fog !== undefined ) data.fog = this.fog;
+
+		if ( Object.keys( this.userData ).length > 0 ) data.userData = this.userData;
+
+		// TODO: Copied from Object3D.toJSON
+
+		function extractFromCache( cache ) {
+
+			const values = [];
+
+			for ( const key in cache ) {
+
+				const data = cache[ key ];
+				delete data.metadata;
+				values.push( data );
+
+			}
+
+			return values;
+
+		}
+
+		if ( isRootObject ) {
+
+			const textures = extractFromCache( meta.textures );
+			const images = extractFromCache( meta.images );
+
+			if ( textures.length > 0 ) data.textures = textures;
+			if ( images.length > 0 ) data.images = images;
+
+		}
+
+		return data;
+
+	}
+
+	/**
+	 * Deserializes the material from the given JSON.
+	 *
+	 * @param {Object} json - The JSON holding the serialized material.
+	 * @param {Object<string,Texture>} textures - A dictionary holding textures referenced by the material.
+	 * @return {Material} A reference to this material.
+	 */
+	fromJSON( json, textures ) {
+
+		if ( json.uuid !== undefined ) this.uuid = json.uuid;
+		if ( json.name !== undefined ) this.name = json.name;
+		if ( json.color !== undefined && this.color !== undefined ) this.color.setHex( json.color );
+		if ( json.roughness !== undefined ) this.roughness = json.roughness;
+		if ( json.metalness !== undefined ) this.metalness = json.metalness;
+		if ( json.sheen !== undefined ) this.sheen = json.sheen;
+		if ( json.sheenColor !== undefined ) this.sheenColor = new Color().setHex( json.sheenColor );
+		if ( json.sheenRoughness !== undefined ) this.sheenRoughness = json.sheenRoughness;
+		if ( json.emissive !== undefined && this.emissive !== undefined ) this.emissive.setHex( json.emissive );
+		if ( json.specular !== undefined && this.specular !== undefined ) this.specular.setHex( json.specular );
+		if ( json.specularIntensity !== undefined ) this.specularIntensity = json.specularIntensity;
+		if ( json.specularColor !== undefined && this.specularColor !== undefined ) this.specularColor.setHex( json.specularColor );
+		if ( json.shininess !== undefined ) this.shininess = json.shininess;
+		if ( json.clearcoat !== undefined ) this.clearcoat = json.clearcoat;
+		if ( json.clearcoatRoughness !== undefined ) this.clearcoatRoughness = json.clearcoatRoughness;
+		if ( json.dispersion !== undefined ) this.dispersion = json.dispersion;
+		if ( json.retroreflectivity !== undefined ) this.retroreflectivity = json.retroreflectivity;
+		if ( json.iridescence !== undefined ) this.iridescence = json.iridescence;
+		if ( json.iridescenceIOR !== undefined ) this.iridescenceIOR = json.iridescenceIOR;
+		if ( json.iridescenceThicknessRange !== undefined ) this.iridescenceThicknessRange = json.iridescenceThicknessRange;
+		if ( json.transmission !== undefined ) this.transmission = json.transmission;
+		if ( json.thickness !== undefined ) this.thickness = json.thickness;
+		if ( json.attenuationDistance !== undefined ) this.attenuationDistance = json.attenuationDistance;
+		if ( json.attenuationColor !== undefined && this.attenuationColor !== undefined ) this.attenuationColor.setHex( json.attenuationColor );
+		if ( json.anisotropy !== undefined ) this.anisotropy = json.anisotropy;
+		if ( json.anisotropyRotation !== undefined ) this.anisotropyRotation = json.anisotropyRotation;
+		if ( json.fog !== undefined ) this.fog = json.fog;
+		if ( json.flatShading !== undefined ) this.flatShading = json.flatShading;
+		if ( json.blending !== undefined ) this.blending = json.blending;
+		if ( json.combine !== undefined ) this.combine = json.combine;
+		if ( json.side !== undefined ) this.side = json.side;
+		if ( json.shadowSide !== undefined ) this.shadowSide = json.shadowSide;
+		if ( json.opacity !== undefined ) this.opacity = json.opacity;
+		if ( json.transparent !== undefined ) this.transparent = json.transparent;
+		if ( json.alphaTest !== undefined ) this.alphaTest = json.alphaTest;
+		if ( json.alphaHash !== undefined ) this.alphaHash = json.alphaHash;
+		if ( json.depthFunc !== undefined ) this.depthFunc = json.depthFunc;
+		if ( json.depthTest !== undefined ) this.depthTest = json.depthTest;
+		if ( json.depthWrite !== undefined ) this.depthWrite = json.depthWrite;
+		if ( json.colorWrite !== undefined ) this.colorWrite = json.colorWrite;
+		if ( json.clippingPlanes !== undefined ) this.clippingPlanes = json.clippingPlanes.map( plane => new Plane().fromJSON( plane ) );
+		if ( json.clipIntersection !== undefined ) this.clipIntersection = json.clipIntersection;
+		if ( json.clipShadows !== undefined ) this.clipShadows = json.clipShadows;
+		if ( json.depthPacking !== undefined ) this.depthPacking = json.depthPacking;
+		if ( json.blendSrc !== undefined ) this.blendSrc = json.blendSrc;
+		if ( json.blendDst !== undefined ) this.blendDst = json.blendDst;
+		if ( json.blendEquation !== undefined ) this.blendEquation = json.blendEquation;
+		if ( json.blendSrcAlpha !== undefined ) this.blendSrcAlpha = json.blendSrcAlpha;
+		if ( json.blendDstAlpha !== undefined ) this.blendDstAlpha = json.blendDstAlpha;
+		if ( json.blendEquationAlpha !== undefined ) this.blendEquationAlpha = json.blendEquationAlpha;
+		if ( json.blendColor !== undefined && this.blendColor !== undefined ) this.blendColor.setHex( json.blendColor );
+		if ( json.blendAlpha !== undefined ) this.blendAlpha = json.blendAlpha;
+		if ( json.stencilWriteMask !== undefined ) this.stencilWriteMask = json.stencilWriteMask;
+		if ( json.stencilFunc !== undefined ) this.stencilFunc = json.stencilFunc;
+		if ( json.stencilRef !== undefined ) this.stencilRef = json.stencilRef;
+		if ( json.stencilFuncMask !== undefined ) this.stencilFuncMask = json.stencilFuncMask;
+		if ( json.stencilFail !== undefined ) this.stencilFail = json.stencilFail;
+		if ( json.stencilZFail !== undefined ) this.stencilZFail = json.stencilZFail;
+		if ( json.stencilZPass !== undefined ) this.stencilZPass = json.stencilZPass;
+		if ( json.stencilWrite !== undefined ) this.stencilWrite = json.stencilWrite;
+
+		if ( json.wireframe !== undefined ) this.wireframe = json.wireframe;
+		if ( json.wireframeLinewidth !== undefined ) this.wireframeLinewidth = json.wireframeLinewidth;
+		if ( json.wireframeLinecap !== undefined ) this.wireframeLinecap = json.wireframeLinecap;
+		if ( json.wireframeLinejoin !== undefined ) this.wireframeLinejoin = json.wireframeLinejoin;
+
+		if ( json.rotation !== undefined ) this.rotation = json.rotation;
+
+		if ( json.linewidth !== undefined ) this.linewidth = json.linewidth;
+		if ( json.linecap !== undefined ) this.linecap = json.linecap;
+		if ( json.linejoin !== undefined ) this.linejoin = json.linejoin;
+		if ( json.dashSize !== undefined ) this.dashSize = json.dashSize;
+		if ( json.gapSize !== undefined ) this.gapSize = json.gapSize;
+		if ( json.scale !== undefined ) this.scale = json.scale;
+
+		if ( json.polygonOffset !== undefined ) this.polygonOffset = json.polygonOffset;
+		if ( json.polygonOffsetFactor !== undefined ) this.polygonOffsetFactor = json.polygonOffsetFactor;
+		if ( json.polygonOffsetUnits !== undefined ) this.polygonOffsetUnits = json.polygonOffsetUnits;
+
+		if ( json.dithering !== undefined ) this.dithering = json.dithering;
+
+		if ( json.alphaToCoverage !== undefined ) this.alphaToCoverage = json.alphaToCoverage;
+		if ( json.premultipliedAlpha !== undefined ) this.premultipliedAlpha = json.premultipliedAlpha;
+		if ( json.forceSinglePass !== undefined ) this.forceSinglePass = json.forceSinglePass;
+		if ( json.allowOverride !== undefined ) this.allowOverride = json.allowOverride;
+
+		if ( json.visible !== undefined ) this.visible = json.visible;
+
+		if ( json.toneMapped !== undefined ) this.toneMapped = json.toneMapped;
+
+		if ( json.userData !== undefined ) this.userData = json.userData;
+
+		if ( json.vertexColors !== undefined ) {
+
+			if ( typeof json.vertexColors === 'number' ) {
+
+				this.vertexColors = json.vertexColors > 0;
+
+			} else {
+
+				this.vertexColors = json.vertexColors;
+
+			}
+
+		}
+
+		// for PointsMaterial
+
+		if ( json.size !== undefined ) this.size = json.size;
+		if ( json.sizeAttenuation !== undefined ) this.sizeAttenuation = json.sizeAttenuation;
+
+		// maps
+
+		if ( json.map !== undefined ) this.map = textures[ json.map ] || null;
+		if ( json.matcap !== undefined ) this.matcap = textures[ json.matcap ] || null;
+
+		if ( json.alphaMap !== undefined ) this.alphaMap = textures[ json.alphaMap ] || null;
+
+		if ( json.bumpMap !== undefined ) this.bumpMap = textures[ json.bumpMap ] || null;
+		if ( json.bumpScale !== undefined ) this.bumpScale = json.bumpScale;
+
+		if ( json.normalMap !== undefined ) this.normalMap = textures[ json.normalMap ] || null;
+		if ( json.normalMapType !== undefined ) this.normalMapType = json.normalMapType;
+		if ( json.normalScale !== undefined ) {
+
+			let normalScale = json.normalScale;
+
+			if ( Array.isArray( normalScale ) === false ) {
+
+				// Blender exporter used to export a scalar. See #7459
+
+				normalScale = [ normalScale, normalScale ];
+
+			}
+
+			this.normalScale = new Vector2().fromArray( normalScale );
+
+		}
+
+		if ( json.displacementMap !== undefined ) this.displacementMap = textures[ json.displacementMap ] || null;
+		if ( json.displacementScale !== undefined ) this.displacementScale = json.displacementScale;
+		if ( json.displacementBias !== undefined ) this.displacementBias = json.displacementBias;
+
+		if ( json.roughnessMap !== undefined ) this.roughnessMap = textures[ json.roughnessMap ] || null;
+		if ( json.metalnessMap !== undefined ) this.metalnessMap = textures[ json.metalnessMap ] || null;
+
+		if ( json.emissiveMap !== undefined ) this.emissiveMap = textures[ json.emissiveMap ] || null;
+		if ( json.emissiveIntensity !== undefined ) this.emissiveIntensity = json.emissiveIntensity;
+
+		if ( json.specularMap !== undefined ) this.specularMap = textures[ json.specularMap ] || null;
+		if ( json.specularIntensityMap !== undefined ) this.specularIntensityMap = textures[ json.specularIntensityMap ] || null;
+		if ( json.specularColorMap !== undefined ) this.specularColorMap = textures[ json.specularColorMap ] || null;
+
+		if ( json.envMap !== undefined ) this.envMap = textures[ json.envMap ] || null;
+		if ( json.envMapRotation !== undefined ) this.envMapRotation.fromArray( json.envMapRotation );
+		if ( json.envMapIntensity !== undefined ) this.envMapIntensity = json.envMapIntensity;
+
+		if ( json.reflectivity !== undefined ) this.reflectivity = json.reflectivity;
+		if ( json.refractionRatio !== undefined ) this.refractionRatio = json.refractionRatio;
+
+		if ( json.lightMap !== undefined ) this.lightMap = textures[ json.lightMap ] || null;
+		if ( json.lightMapIntensity !== undefined ) this.lightMapIntensity = json.lightMapIntensity;
+
+		if ( json.aoMap !== undefined ) this.aoMap = textures[ json.aoMap ] || null;
+		if ( json.aoMapIntensity !== undefined ) this.aoMapIntensity = json.aoMapIntensity;
+
+		if ( json.gradientMap !== undefined ) this.gradientMap = textures[ json.gradientMap ] || null;
+
+		if ( json.clearcoatMap !== undefined ) this.clearcoatMap = textures[ json.clearcoatMap ] || null;
+		if ( json.clearcoatRoughnessMap !== undefined ) this.clearcoatRoughnessMap = textures[ json.clearcoatRoughnessMap ] || null;
+		if ( json.clearcoatNormalMap !== undefined ) this.clearcoatNormalMap = textures[ json.clearcoatNormalMap ] || null;
+		if ( json.clearcoatNormalScale !== undefined ) this.clearcoatNormalScale = new Vector2().fromArray( json.clearcoatNormalScale );
+
+		if ( json.iridescenceMap !== undefined ) this.iridescenceMap = textures[ json.iridescenceMap ] || null;
+		if ( json.iridescenceThicknessMap !== undefined ) this.iridescenceThicknessMap = textures[ json.iridescenceThicknessMap ] || null;
+
+		if ( json.transmissionMap !== undefined ) this.transmissionMap = textures[ json.transmissionMap ] || null;
+		if ( json.thicknessMap !== undefined ) this.thicknessMap = textures[ json.thicknessMap ] || null;
+
+		if ( json.anisotropyMap !== undefined ) this.anisotropyMap = textures[ json.anisotropyMap ] || null;
+
+		if ( json.sheenColorMap !== undefined ) this.sheenColorMap = textures[ json.sheenColorMap ] || null;
+		if ( json.sheenRoughnessMap !== undefined ) this.sheenRoughnessMap = textures[ json.sheenRoughnessMap ] || null;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new material with copied values from this instance.
+	 *
+	 * @return {Material} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+	/**
+	 * Copies the values of the given material to this instance.
+	 *
+	 * @param {Material} source - The material to copy.
+	 * @return {Material} A reference to this instance.
+	 */
+	copy( source ) {
+
+		this.name = source.name;
+
+		this.blending = source.blending;
+		this.side = source.side;
+		this.vertexColors = source.vertexColors;
+
+		this.opacity = source.opacity;
+		this.transparent = source.transparent;
+
+		this.blendSrc = source.blendSrc;
+		this.blendDst = source.blendDst;
+		this.blendEquation = source.blendEquation;
+		this.blendSrcAlpha = source.blendSrcAlpha;
+		this.blendDstAlpha = source.blendDstAlpha;
+		this.blendEquationAlpha = source.blendEquationAlpha;
+		this.blendColor.copy( source.blendColor );
+		this.blendAlpha = source.blendAlpha;
+
+		this.depthFunc = source.depthFunc;
+		this.depthTest = source.depthTest;
+		this.depthWrite = source.depthWrite;
+
+		this.stencilWriteMask = source.stencilWriteMask;
+		this.stencilFunc = source.stencilFunc;
+		this.stencilRef = source.stencilRef;
+		this.stencilFuncMask = source.stencilFuncMask;
+		this.stencilFail = source.stencilFail;
+		this.stencilZFail = source.stencilZFail;
+		this.stencilZPass = source.stencilZPass;
+		this.stencilWrite = source.stencilWrite;
+
+		const srcPlanes = source.clippingPlanes;
+		let dstPlanes = null;
+
+		if ( srcPlanes !== null ) {
+
+			const n = srcPlanes.length;
+			dstPlanes = new Array( n );
+
+			for ( let i = 0; i !== n; ++ i ) {
+
+				dstPlanes[ i ] = srcPlanes[ i ].clone();
+
+			}
+
+		}
+
+		this.clippingPlanes = dstPlanes;
+		this.clipIntersection = source.clipIntersection;
+		this.clipShadows = source.clipShadows;
+
+		this.shadowSide = source.shadowSide;
+
+		this.colorWrite = source.colorWrite;
+
+		this.precision = source.precision;
+
+		this.polygonOffset = source.polygonOffset;
+		this.polygonOffsetFactor = source.polygonOffsetFactor;
+		this.polygonOffsetUnits = source.polygonOffsetUnits;
+
+		this.dithering = source.dithering;
+
+		this.alphaTest = source.alphaTest;
+		this.alphaHash = source.alphaHash;
+		this.alphaToCoverage = source.alphaToCoverage;
+		this.premultipliedAlpha = source.premultipliedAlpha;
+		this.forceSinglePass = source.forceSinglePass;
+		this.allowOverride = source.allowOverride;
+
+		this.visible = source.visible;
+
+		this.toneMapped = source.toneMapped;
+
+		this.userData = JSON.parse( JSON.stringify( source.userData ) );
+
+		return this;
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 *
+	 * @fires Material#dispose
+	 */
+	dispose() {
+
+		/**
+		 * Fires when the material has been disposed of.
+		 *
+		 * @event Material#dispose
+		 * @type {Object}
+		 */
+		this.dispatchEvent( { type: 'dispose' } );
+
+	}
+
+	/**
+	 * Setting this property to `true` indicates the engine the material
+	 * needs to be recompiled.
+	 *
+	 * @type {boolean}
+	 * @default false
+	 * @param {boolean} value
+	 */
+	set needsUpdate( value ) {
+
+		if ( value === true ) this.version ++;
+
+	}
+
+}
+
+/**
+ * A material for rendering instances of {@link Sprite}.
+ *
+ * ```js
+ * const map = new THREE.TextureLoader().load( 'textures/sprite.png' );
+ * const material = new THREE.SpriteMaterial( { map: map, color: 0xffffff } );
+ *
+ * const sprite = new THREE.Sprite( material );
+ * sprite.scale.set(200, 200, 1)
+ * scene.add( sprite );
+ * ```
+ *
+ * @augments Material
+ */
+class SpriteMaterial extends Material {
+
+	/**
+	 * Constructs a new sprite material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isSpriteMaterial = true;
+
+		this.type = 'SpriteMaterial';
+
+		/**
+		 * Color of the material.
+		 *
+		 * @type {Color}
+		 * @default (1,1,1)
+		 */
+		this.color = new Color( 0xffffff );
+
+		/**
+		 * The color map. May optionally include an alpha channel, typically combined
+		 * with {@link Material#transparent} or {@link Material#alphaTest}. The texture map
+		 * color is modulated by the diffuse `color`.
+		 *
+		 * `map` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `map` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.map = null;
+
+		/**
+		 * The alpha map is a grayscale texture that controls the opacity across the
+		 * surface (black: fully transparent; white: fully opaque).
+		 *
+		 * Only the color of the texture is used, ignoring the alpha channel if one
+		 * exists. For RGB and RGBA textures, the renderer will use the green channel
+		 * when sampling this texture due to the extra bit of precision provided for
+		 * green in DXT-compressed and uncompressed RGB 565 formats. Luminance-only and
+		 * luminance/alpha textures will also still work as expected.
+		 *
+		 * `alphaMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.alphaMap = null;
+
+		/**
+		 * The rotation of the sprite in radians.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.rotation = 0;
+
+		/**
+		 * Specifies whether size of the sprite is attenuated by the camera depth (perspective camera only).
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.sizeAttenuation = true;
+
+		/**
+		 * Overwritten since sprite materials are transparent
+		 * by default.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.transparent = true;
+
+		/**
+		 * Whether the material is affected by fog or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.fog = true;
+
+		this.setValues( parameters );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.color.copy( source.color );
+
+		this.map = source.map;
+
+		this.alphaMap = source.alphaMap;
+
+		this.rotation = source.rotation;
+
+		this.sizeAttenuation = source.sizeAttenuation;
+
+		this.fog = source.fog;
+
+		return this;
+
+	}
+
+}
+
+let _geometry;
+
+const _intersectPoint = /*@__PURE__*/ new Vector3();
+const _worldScale = /*@__PURE__*/ new Vector3();
+const _mvPosition = /*@__PURE__*/ new Vector3();
+
+const _alignedPosition = /*@__PURE__*/ new Vector2();
+const _rotatedPosition = /*@__PURE__*/ new Vector2();
+const _viewWorldMatrix = /*@__PURE__*/ new Matrix4();
+
+const _vA$1 = /*@__PURE__*/ new Vector3();
+const _vB$1 = /*@__PURE__*/ new Vector3();
+const _vC$1 = /*@__PURE__*/ new Vector3();
+
+const _uvA = /*@__PURE__*/ new Vector2();
+const _uvB = /*@__PURE__*/ new Vector2();
+const _uvC = /*@__PURE__*/ new Vector2();
+
+/**
+ * A sprite is a plane that always faces towards the camera, generally with a
+ * partially transparent texture applied.
+ *
+ * Sprites do not cast shadows, setting {@link Object3D#castShadow} to `true` will
+ * have no effect.
+ *
+ * ```js
+ * const map = new THREE.TextureLoader().load( 'sprite.png' );
+ * const material = new THREE.SpriteMaterial( { map: map } );
+ *
+ * const sprite = new THREE.Sprite( material );
+ * scene.add( sprite );
+ * ```
+ *
+ * @augments Object3D
+ */
+class Sprite extends Object3D {
+
+	/**
+	 * Constructs a new sprite.
+	 *
+	 * @param {(SpriteMaterial|SpriteNodeMaterial)} [material] - The sprite material.
+	 */
+	constructor( material = new SpriteMaterial() ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isSprite = true;
+
+		this.type = 'Sprite';
+
+		if ( _geometry === undefined ) {
+
+			_geometry = new BufferGeometry();
+
+			const float32Array = new Float32Array( [
+				-0.5, -0.5, 0, 0, 0,
+				0.5, -0.5, 0, 1, 0,
+				0.5, 0.5, 0, 1, 1,
+				-0.5, 0.5, 0, 0, 1
+			] );
+
+			const interleavedBuffer = new InterleavedBuffer( float32Array, 5 );
+
+			_geometry.setIndex( [ 0, 1, 2,	0, 2, 3 ] );
+			_geometry.setAttribute( 'position', new InterleavedBufferAttribute( interleavedBuffer, 3, 0, false ) );
+			_geometry.setAttribute( 'uv', new InterleavedBufferAttribute( interleavedBuffer, 2, 3, false ) );
+
+		}
+
+		/**
+		 * The sprite geometry.
+		 *
+		 * @type {BufferGeometry}
+		 */
+		this.geometry = _geometry;
+
+		/**
+		 * The sprite material.
+		 *
+		 * @type {(SpriteMaterial|SpriteNodeMaterial)}
+		 */
+		this.material = material;
+
+		/**
+		 * The sprite's anchor point, and the point around which the sprite rotates.
+		 * A value of `(0.5, 0.5)` corresponds to the midpoint of the sprite. A value
+		 * of `(0, 0)` corresponds to the lower left corner of the sprite.
+		 *
+		 * @type {Vector2}
+		 * @default (0.5,0.5)
+		 */
+		this.center = new Vector2( 0.5, 0.5 );
+
+		/**
+		 * The number of instances of this sprite.
+		 * Can only be used with {@link WebGPURenderer}.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.count = 1;
+
+	}
+
+	/**
+	 * Returns `true` if this sprite intersects the given frustum.
+	 *
+	 * @param {Frustum|FrustumArray} frustum - The frustum to test.
+	 * @return {boolean} Whether this sprite intersects the given frustum or not.
+	 */
+	intersectsFrustum( frustum ) {
+
+		return frustum.intersectsSprite( this );
+
+	}
+
+	/**
+	 * Computes intersection points between a casted ray and this sprite.
+	 *
+	 * @param {Raycaster} raycaster - The raycaster.
+	 * @param {Array<Object>} intersects - The target array that holds the intersection points.
+	 */
+	raycast( raycaster, intersects ) {
+
+		if ( raycaster.camera === null ) {
+
+			error( 'Sprite: "Raycaster.camera" needs to be set in order to raycast against sprites.' );
+
+		}
+
+		_worldScale.setFromMatrixScale( this.matrixWorld );
+
+		_viewWorldMatrix.copy( raycaster.camera.matrixWorld );
+		this.modelViewMatrix.multiplyMatrices( raycaster.camera.matrixWorldInverse, this.matrixWorld );
+
+		_mvPosition.setFromMatrixPosition( this.modelViewMatrix );
+
+		if ( raycaster.camera.isPerspectiveCamera && this.material.sizeAttenuation === false ) {
+
+			_worldScale.multiplyScalar( - _mvPosition.z );
+
+		}
+
+		const rotation = this.material.rotation;
+		let sin, cos;
+
+		if ( rotation !== 0 ) {
+
+			cos = Math.cos( rotation );
+			sin = Math.sin( rotation );
+
+		}
+
+		const center = this.center;
+
+		transformVertex( _vA$1.set( -0.5, -0.5, 0 ), _mvPosition, center, _worldScale, sin, cos );
+		transformVertex( _vB$1.set( 0.5, -0.5, 0 ), _mvPosition, center, _worldScale, sin, cos );
+		transformVertex( _vC$1.set( 0.5, 0.5, 0 ), _mvPosition, center, _worldScale, sin, cos );
+
+		_uvA.set( 0, 0 );
+		_uvB.set( 1, 0 );
+		_uvC.set( 1, 1 );
+
+		// check first triangle
+		let intersect = raycaster.ray.intersectTriangle( _vA$1, _vB$1, _vC$1, false, _intersectPoint );
+
+		if ( intersect === null ) {
+
+			// check second triangle
+			transformVertex( _vB$1.set( -0.5, 0.5, 0 ), _mvPosition, center, _worldScale, sin, cos );
+			_uvB.set( 0, 1 );
+
+			intersect = raycaster.ray.intersectTriangle( _vA$1, _vC$1, _vB$1, false, _intersectPoint );
+			if ( intersect === null ) {
+
+				return;
+
+			}
+
+		}
+
+		const distance = raycaster.ray.origin.distanceTo( _intersectPoint );
+
+		if ( distance < raycaster.near || distance > raycaster.far ) return;
+
+		intersects.push( {
+
+			distance: distance,
+			point: _intersectPoint.clone(),
+			uv: Triangle.getInterpolation( _intersectPoint, _vA$1, _vB$1, _vC$1, _uvA, _uvB, _uvC, new Vector2() ),
+			face: null,
+			object: this
+
+		} );
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		if ( source.center !== undefined ) this.center.copy( source.center );
+
+		this.material = source.material;
+
+		return this;
+
+	}
+
+}
+
+function transformVertex( vertexPosition, mvPosition, center, scale, sin, cos ) {
+
+	// compute position in camera space
+	_alignedPosition.subVectors( vertexPosition, center ).addScalar( 0.5 ).multiply( scale );
+
+	// to check if rotation is not zero
+	if ( sin !== undefined ) {
+
+		_rotatedPosition.x = ( cos * _alignedPosition.x ) - ( sin * _alignedPosition.y );
+		_rotatedPosition.y = ( sin * _alignedPosition.x ) + ( cos * _alignedPosition.y );
+
+	} else {
+
+		_rotatedPosition.copy( _alignedPosition );
+
+	}
+
+
+	vertexPosition.copy( mvPosition );
+	vertexPosition.x += _rotatedPosition.x;
+	vertexPosition.y += _rotatedPosition.y;
+
+	// transform to world space
+	vertexPosition.applyMatrix4( _viewWorldMatrix );
+
+}
+
+const _v1$2 = /*@__PURE__*/ new Vector3();
+const _v2$1 = /*@__PURE__*/ new Vector3();
+
+/**
+ * A component for providing a basic Level of Detail (LOD) mechanism.
+ *
+ * Every LOD level is associated with an object, and rendering can be switched
+ * between them at the distances specified. Typically you would create, say,
+ * three meshes, one for far away (low detail), one for mid range (medium
+ * detail) and one for close up (high detail).
+ *
+ * ```js
+ * const lod = new THREE.LOD();
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00 } );
+ *
+ * //Create spheres with 3 levels of detail and create new LOD levels for them
+ * for( let i = 0; i < 3; i++ ) {
+ *
+ * 	const geometry = new THREE.IcosahedronGeometry( 10, 3 - i );
+ * 	const mesh = new THREE.Mesh( geometry, material );
+ * 	lod.addLevel( mesh, i * 75 );
+ *
+ * }
+ *
+ * scene.add( lod );
+ * ```
+ *
+ * @augments Object3D
+ */
+class LOD extends Object3D {
+
+	/**
+	 * Constructs a new LOD.
+	 */
+	constructor() {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isLOD = true;
+
+		/**
+		 * The current LOD index.
+		 *
+		 * @private
+		 * @type {number}
+		 * @default 0
+		 */
+		this._currentLevel = 0;
+
+		this.type = 'LOD';
+
+		Object.defineProperties( this, {
+			/**
+			 * This array holds the LOD levels.
+			 *
+			 * @name LOD#levels
+			 * @type {Array<{object:Object3D,distance:number,hysteresis:number}>}
+			 */
+			levels: {
+				enumerable: true,
+				value: []
+			}
+		} );
+
+		/**
+		 * Whether the LOD object is updated automatically by the renderer per frame
+		 * or not. If set to `false`, you have to call {@link LOD#update} in the
+		 * render loop by yourself.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.autoUpdate = true;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source, false );
+
+		const levels = source.levels;
+
+		for ( let i = 0, l = levels.length; i < l; i ++ ) {
+
+			const level = levels[ i ];
+
+			this.addLevel( level.object.clone(), level.distance, level.hysteresis );
+
+		}
+
+		this.autoUpdate = source.autoUpdate;
+
+		return this;
+
+	}
+
+	/**
+	 * Adds a mesh that will display at a certain distance and greater. Typically
+	 * the further away the distance, the lower the detail on the mesh.
+	 *
+	 * @param {Object3D} object - The 3D object to display at this level.
+	 * @param {number} [distance=0] - The distance at which to display this level of detail.
+	 * @param {number} [hysteresis=0] - Threshold used to avoid flickering at LOD boundaries, as a fraction of distance.
+	 * @return {LOD} A reference to this instance.
+	 */
+	addLevel( object, distance = 0, hysteresis = 0 ) {
+
+		distance = Math.abs( distance );
+
+		const levels = this.levels;
+
+		let l;
+
+		for ( l = 0; l < levels.length; l ++ ) {
+
+			if ( distance < levels[ l ].distance ) {
+
+				break;
+
+			}
+
+		}
+
+		levels.splice( l, 0, { distance: distance, hysteresis: hysteresis, object: object } );
+
+		this.add( object );
+
+		return this;
+
+	}
+
+	/**
+	 * Removes an existing level, based on the distance from the camera.
+	 * Returns `true` when the level has been removed. Otherwise `false`.
+	 *
+	 * @param {number} distance - Distance of the level to remove.
+	 * @return {boolean} Whether the level has been removed or not.
+	 */
+	removeLevel( distance ) {
+
+		const levels = this.levels;
+
+		for ( let i = 0; i < levels.length; i ++ ) {
+
+			if ( levels[ i ].distance === distance ) {
+
+				const removedElements = levels.splice( i, 1 );
+				this.remove( removedElements[ 0 ].object );
+
+				return true;
+
+			}
+
+		}
+
+		return false;
+
+	}
+
+	/**
+	 * Returns the currently active LOD level index.
+	 *
+	 * @return {number} The current active LOD level index.
+	 */
+	getCurrentLevel() {
+
+		return this._currentLevel;
+
+	}
+
+	/**
+	 * Returns a reference to the first 3D object that is greater than
+	 * the given distance.
+	 *
+	 * @param {number} distance - The LOD distance.
+	 * @return {?Object3D} The found 3D object. `null` if no 3D object has been found.
+	 */
+	getObjectForDistance( distance ) {
+
+		const levels = this.levels;
+
+		if ( levels.length > 0 ) {
+
+			let i, l;
+
+			for ( i = 1, l = levels.length; i < l; i ++ ) {
+
+				let levelDistance = levels[ i ].distance;
+
+				if ( levels[ i ].object.visible ) {
+
+					levelDistance -= levelDistance * levels[ i ].hysteresis;
+
+				}
+
+				if ( distance < levelDistance ) {
+
+					break;
+
+				}
+
+			}
+
+			return levels[ i - 1 ].object;
+
+		}
+
+		return null;
+
+	}
+
+	/**
+	 * Computes intersection points between a casted ray and this LOD.
+	 *
+	 * @param {Raycaster} raycaster - The raycaster.
+	 * @param {Array<Object>} intersects - The target array that holds the intersection points.
+	 */
+	raycast( raycaster, intersects ) {
+
+		const levels = this.levels;
+
+		if ( levels.length > 0 ) {
+
+			_v1$2.setFromMatrixPosition( this.matrixWorld );
+
+			const distance = raycaster.ray.origin.distanceTo( _v1$2 );
+
+			this.getObjectForDistance( distance ).raycast( raycaster, intersects );
+
+		}
+
+	}
+
+	/**
+	 * Updates the LOD by computing which LOD level should be visible according
+	 * to the current distance of the given camera.
+	 *
+	 * @param {Camera} camera - The camera the scene is rendered with.
+	 */
+	update( camera ) {
+
+		const levels = this.levels;
+
+		if ( levels.length > 1 ) {
+
+			_v1$2.setFromMatrixPosition( camera.matrixWorld );
+			_v2$1.setFromMatrixPosition( this.matrixWorld );
+
+			const distance = _v1$2.distanceTo( _v2$1 ) / camera.zoom;
+
+			levels[ 0 ].object.visible = true;
+
+			let i, l;
+
+			for ( i = 1, l = levels.length; i < l; i ++ ) {
+
+				let levelDistance = levels[ i ].distance;
+
+				if ( levels[ i ].object.visible ) {
+
+					levelDistance -= levelDistance * levels[ i ].hysteresis;
+
+				}
+
+				if ( distance >= levelDistance ) {
+
+					levels[ i - 1 ].object.visible = false;
+					levels[ i ].object.visible = true;
+
+				} else {
+
+					break;
+
+				}
+
+			}
+
+			this._currentLevel = i - 1;
+
+			for ( ; i < l; i ++ ) {
+
+				levels[ i ].object.visible = false;
+
+			}
+
+		}
+
+	}
+
+	toJSON( meta ) {
+
+		const data = super.toJSON( meta );
+
+		data.object.autoUpdate = this.autoUpdate;
+
+		data.object.levels = [];
+
+		const levels = this.levels;
+
+		for ( let i = 0, l = levels.length; i < l; i ++ ) {
+
+			const level = levels[ i ];
+
+			data.object.levels.push( {
+				object: level.object.uuid,
+				distance: level.distance,
+				hysteresis: level.hysteresis
+			} );
+
+		}
+
+		return data;
+
+	}
+
+}
+
+const _vector$7 = /*@__PURE__*/ new Vector3();
+const _segCenter = /*@__PURE__*/ new Vector3();
+const _segDir = /*@__PURE__*/ new Vector3();
+const _diff = /*@__PURE__*/ new Vector3();
+
+/**
+ * A ray that emits from an origin in a certain direction. The class is used by
+ * {@link Raycaster} to assist with raycasting. Raycasting is used for
+ * mouse picking (working out what objects in the 3D space the mouse is over)
+ * amongst other things.
+ */
+class Ray {
+
+	/**
+	 * Constructs a new ray.
+	 *
+	 * @param {Vector3} [origin=(0,0,0)] - The origin of the ray.
+	 * @param {Vector3} [direction=(0,0,-1)] - The (normalized) direction of the ray.
+	 */
+	constructor( origin = new Vector3(), direction = new Vector3( 0, 0, -1 ) ) {
+
+		/**
+		 * The origin of the ray.
+		 *
+		 * @type {Vector3}
+		 */
+		this.origin = origin;
+
+		/**
+		 * The (normalized) direction of the ray.
+		 *
+		 * @type {Vector3}
+		 */
+		this.direction = direction;
+
+	}
+
+	/**
+	 * Sets the ray's components by copying the given values.
+	 *
+	 * @param {Vector3} origin - The origin.
+	 * @param {Vector3} direction - The direction.
+	 * @return {Ray} A reference to this ray.
+	 */
+	set( origin, direction ) {
+
+		this.origin.copy( origin );
+		this.direction.copy( direction );
+
+		return this;
+
+	}
+
+	/**
+	 * Copies the values of the given ray to this instance.
+	 *
+	 * @param {Ray} ray - The ray to copy.
+	 * @return {Ray} A reference to this ray.
+	 */
+	copy( ray ) {
+
+		this.origin.copy( ray.origin );
+		this.direction.copy( ray.direction );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a vector that is located at a given distance along this ray.
+	 *
+	 * @param {number} t - The distance along the ray to retrieve a position for.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} A position on the ray.
+	 */
+	at( t, target ) {
+
+		return target.copy( this.origin ).addScaledVector( this.direction, t );
+
+	}
+
+	/**
+	 * Adjusts the direction of the ray to point at the given vector in world space.
+	 *
+	 * @param {Vector3} v - The target position.
+	 * @return {Ray} A reference to this ray.
+	 */
+	lookAt( v ) {
+
+		this.direction.copy( v ).sub( this.origin ).normalize();
+
+		return this;
+
+	}
+
+	/**
+	 * Shift the origin of this ray along its direction by the given distance.
+	 *
+	 * @param {number} t - The distance along the ray to interpolate.
+	 * @return {Ray} A reference to this ray.
+	 */
+	recast( t ) {
+
+		this.origin.copy( this.at( t, _vector$7 ) );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the point along this ray that is closest to the given point.
+	 *
+	 * @param {Vector3} point - A point in 3D space to get the closet location on the ray for.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The closest point on this ray.
+	 */
+	closestPointToPoint( point, target ) {
+
+		target.subVectors( point, this.origin );
+
+		const directionDistance = target.dot( this.direction );
+
+		if ( directionDistance < 0 ) {
+
+			return target.copy( this.origin );
+
+		}
+
+		return target.copy( this.origin ).addScaledVector( this.direction, directionDistance );
+
+	}
+
+	/**
+	 * Returns the distance of the closest approach between this ray and the given point.
+	 *
+	 * @param {Vector3} point - A point in 3D space to compute the distance to.
+	 * @return {number} The distance.
+	 */
+	distanceToPoint( point ) {
+
+		return Math.sqrt( this.distanceSqToPoint( point ) );
+
+	}
+
+	/**
+	 * Returns the squared distance of the closest approach between this ray and the given point.
+	 *
+	 * @param {Vector3} point - A point in 3D space to compute the distance to.
+	 * @return {number} The squared distance.
+	 */
+	distanceSqToPoint( point ) {
+
+		const directionDistance = _vector$7.subVectors( point, this.origin ).dot( this.direction );
+
+		// point behind the ray
+
+		if ( directionDistance < 0 ) {
+
+			return this.origin.distanceToSquared( point );
+
+		}
+
+		_vector$7.copy( this.origin ).addScaledVector( this.direction, directionDistance );
+
+		return _vector$7.distanceToSquared( point );
+
+	}
+
+	/**
+	 * Returns the squared distance between this ray and the given line segment.
+	 *
+	 * @param {Vector3} v0 - The start point of the line segment.
+	 * @param {Vector3} v1 - The end point of the line segment.
+	 * @param {Vector3} [optionalPointOnRay] - When provided, it receives the point on this ray that is closest to the segment.
+	 * @param {Vector3} [optionalPointOnSegment] - When provided, it receives the point on the line segment that is closest to this ray.
+	 * @return {number} The squared distance.
+	 */
+	distanceSqToSegment( v0, v1, optionalPointOnRay, optionalPointOnSegment ) {
+
+		// from https://github.com/pmjoniak/GeometricTools/blob/master/GTEngine/Include/Mathematics/GteDistRaySegment.h
+		// It returns the min distance between the ray and the segment
+		// defined by v0 and v1
+		// It can also set two optional targets :
+		// - The closest point on the ray
+		// - The closest point on the segment
+
+		_segCenter.copy( v0 ).add( v1 ).multiplyScalar( 0.5 );
+		_segDir.copy( v1 ).sub( v0 ).normalize();
+		_diff.copy( this.origin ).sub( _segCenter );
+
+		const segExtent = v0.distanceTo( v1 ) * 0.5;
+		const a01 = - this.direction.dot( _segDir );
+		const b0 = _diff.dot( this.direction );
+		const b1 = - _diff.dot( _segDir );
+		const c = _diff.lengthSq();
+		const det = Math.abs( 1 - a01 * a01 );
+		let s0, s1, sqrDist, extDet;
+
+		if ( det > 0 ) {
+
+			// The ray and segment are not parallel.
+
+			s0 = a01 * b1 - b0;
+			s1 = a01 * b0 - b1;
+			extDet = segExtent * det;
+
+			if ( s0 >= 0 ) {
+
+				if ( s1 >= - extDet ) {
+
+					if ( s1 <= extDet ) {
+
+						// region 0
+						// Minimum at interior points of ray and segment.
+
+						const invDet = 1 / det;
+						s0 *= invDet;
+						s1 *= invDet;
+						sqrDist = s0 * ( s0 + a01 * s1 + 2 * b0 ) + s1 * ( a01 * s0 + s1 + 2 * b1 ) + c;
+
+					} else {
+
+						// region 1
+
+						s1 = segExtent;
+						s0 = Math.max( 0, - ( a01 * s1 + b0 ) );
+						sqrDist = - s0 * s0 + s1 * ( s1 + 2 * b1 ) + c;
+
+					}
+
+				} else {
+
+					// region 5
+
+					s1 = - segExtent;
+					s0 = Math.max( 0, - ( a01 * s1 + b0 ) );
+					sqrDist = - s0 * s0 + s1 * ( s1 + 2 * b1 ) + c;
+
+				}
+
+			} else {
+
+				if ( s1 <= - extDet ) {
+
+					// region 4
+
+					s0 = Math.max( 0, - ( - a01 * segExtent + b0 ) );
+					s1 = ( s0 > 0 ) ? - segExtent : Math.min( Math.max( - segExtent, - b1 ), segExtent );
+					sqrDist = - s0 * s0 + s1 * ( s1 + 2 * b1 ) + c;
+
+				} else if ( s1 <= extDet ) {
+
+					// region 3
+
+					s0 = 0;
+					s1 = Math.min( Math.max( - segExtent, - b1 ), segExtent );
+					sqrDist = s1 * ( s1 + 2 * b1 ) + c;
+
+				} else {
+
+					// region 2
+
+					s0 = Math.max( 0, - ( a01 * segExtent + b0 ) );
+					s1 = ( s0 > 0 ) ? segExtent : Math.min( Math.max( - segExtent, - b1 ), segExtent );
+					sqrDist = - s0 * s0 + s1 * ( s1 + 2 * b1 ) + c;
+
+				}
+
+			}
+
+		} else {
+
+			// Ray and segment are parallel.
+
+			s1 = ( a01 > 0 ) ? - segExtent : segExtent;
+			s0 = Math.max( 0, - ( a01 * s1 + b0 ) );
+			sqrDist = - s0 * s0 + s1 * ( s1 + 2 * b1 ) + c;
+
+		}
+
+		if ( optionalPointOnRay ) {
+
+			optionalPointOnRay.copy( this.origin ).addScaledVector( this.direction, s0 );
+
+		}
+
+		if ( optionalPointOnSegment ) {
+
+			optionalPointOnSegment.copy( _segCenter ).addScaledVector( _segDir, s1 );
+
+		}
+
+		return sqrDist;
+
+	}
+
+	/**
+	 * Intersects this ray with the given sphere, returning the intersection
+	 * point or `null` if there is no intersection.
+	 *
+	 * @param {Sphere} sphere - The sphere to intersect.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {?Vector3} The intersection point.
+	 */
+	intersectSphere( sphere, target ) {
+
+		if ( sphere.radius < 0 ) return null; // handle empty spheres, see #31187
+
+		_vector$7.subVectors( sphere.center, this.origin );
+		const tca = _vector$7.dot( this.direction );
+		const d2 = _vector$7.dot( _vector$7 ) - tca * tca;
+		const radius2 = sphere.radius * sphere.radius;
+
+		if ( d2 > radius2 ) return null;
+
+		const thc = Math.sqrt( radius2 - d2 );
+
+		// t0 = first intersect point - entrance on front of sphere
+		const t0 = tca - thc;
+
+		// t1 = second intersect point - exit point on back of sphere
+		const t1 = tca + thc;
+
+		// test to see if t1 is behind the ray - if so, return null
+		if ( t1 < 0 ) return null;
+
+		// test to see if t0 is behind the ray:
+		// if it is, the ray is inside the sphere, so return the second exit point scaled by t1,
+		// in order to always return an intersect point that is in front of the ray.
+		if ( t0 < 0 ) return this.at( t1, target );
+
+		// else t0 is in front of the ray, so return the first collision point scaled by t0
+		return this.at( t0, target );
+
+	}
+
+	/**
+	 * Returns `true` if this ray intersects with the given sphere.
+	 *
+	 * @param {Sphere} sphere - The sphere to intersect.
+	 * @return {boolean} Whether this ray intersects with the given sphere or not.
+	 */
+	intersectsSphere( sphere ) {
+
+		if ( sphere.radius < 0 ) return false; // handle empty spheres, see #31187
+
+		return this.distanceSqToPoint( sphere.center ) <= ( sphere.radius * sphere.radius );
+
+	}
+
+	/**
+	 * Computes the distance from the ray's origin to the given plane. Returns `null` if the ray
+	 * does not intersect with the plane.
+	 *
+	 * @param {Plane} plane - The plane to compute the distance to.
+	 * @return {?number} Whether this ray intersects with the given sphere or not.
+	 */
+	distanceToPlane( plane ) {
+
+		const denominator = plane.normal.dot( this.direction );
+
+		if ( denominator === 0 ) {
+
+			// line is coplanar, return origin
+			if ( plane.distanceToPoint( this.origin ) === 0 ) {
+
+				return 0;
+
+			}
+
+			// Null is preferable to undefined since undefined means.... it is undefined
+
+			return null;
+
+		}
+
+		const t = - ( this.origin.dot( plane.normal ) + plane.constant ) / denominator;
+
+		// Return if the ray never intersects the plane
+
+		return t >= 0 ? t : null;
+
+	}
+
+	/**
+	 * Intersects this ray with the given plane, returning the intersection
+	 * point or `null` if there is no intersection.
+	 *
+	 * @param {Plane} plane - The plane to intersect.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {?Vector3} The intersection point.
+	 */
+	intersectPlane( plane, target ) {
+
+		const t = this.distanceToPlane( plane );
+
+		if ( t === null ) {
+
+			return null;
+
+		}
+
+		return this.at( t, target );
+
+	}
+
+	/**
+	 * Returns `true` if this ray intersects with the given plane.
+	 *
+	 * @param {Plane} plane - The plane to intersect.
+	 * @return {boolean} Whether this ray intersects with the given plane or not.
+	 */
+	intersectsPlane( plane ) {
+
+		// check if the ray lies on the plane first
+
+		const distToPoint = plane.distanceToPoint( this.origin );
+
+		if ( distToPoint === 0 ) {
+
+			return true;
+
+		}
+
+		const denominator = plane.normal.dot( this.direction );
+
+		if ( denominator * distToPoint < 0 ) {
+
+			return true;
+
+		}
+
+		// ray origin is behind the plane (and is pointing behind it)
+
+		return false;
+
+	}
+
+	/**
+	 * Intersects this ray with the given bounding box, returning the intersection
+	 * point or `null` if there is no intersection.
+	 *
+	 * @param {Box3} box - The box to intersect.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {?Vector3} The intersection point.
+	 */
+	intersectBox( box, target ) {
+
+		let tmin, tmax, tymin, tymax, tzmin, tzmax;
+
+		const invdirx = 1 / this.direction.x,
+			invdiry = 1 / this.direction.y,
+			invdirz = 1 / this.direction.z;
+
+		const origin = this.origin;
+
+		if ( invdirx >= 0 ) {
+
+			tmin = ( box.min.x - origin.x ) * invdirx;
+			tmax = ( box.max.x - origin.x ) * invdirx;
+
+		} else {
+
+			tmin = ( box.max.x - origin.x ) * invdirx;
+			tmax = ( box.min.x - origin.x ) * invdirx;
+
+		}
+
+		if ( invdiry >= 0 ) {
+
+			tymin = ( box.min.y - origin.y ) * invdiry;
+			tymax = ( box.max.y - origin.y ) * invdiry;
+
+		} else {
+
+			tymin = ( box.max.y - origin.y ) * invdiry;
+			tymax = ( box.min.y - origin.y ) * invdiry;
+
+		}
+
+		if ( ( tmin > tymax ) || ( tymin > tmax ) ) return null;
+
+		if ( tymin > tmin || isNaN( tmin ) ) tmin = tymin;
+
+		if ( tymax < tmax || isNaN( tmax ) ) tmax = tymax;
+
+		if ( invdirz >= 0 ) {
+
+			tzmin = ( box.min.z - origin.z ) * invdirz;
+			tzmax = ( box.max.z - origin.z ) * invdirz;
+
+		} else {
+
+			tzmin = ( box.max.z - origin.z ) * invdirz;
+			tzmax = ( box.min.z - origin.z ) * invdirz;
+
+		}
+
+		if ( ( tmin > tzmax ) || ( tzmin > tmax ) ) return null;
+
+		if ( tzmin > tmin || tmin !== tmin ) tmin = tzmin;
+
+		if ( tzmax < tmax || tmax !== tmax ) tmax = tzmax;
+
+		//return point closest to the ray (positive side)
+
+		if ( tmax < 0 ) return null;
+
+		return this.at( tmin >= 0 ? tmin : tmax, target );
+
+	}
+
+	/**
+	 * Returns `true` if this ray intersects with the given box.
+	 *
+	 * @param {Box3} box - The box to intersect.
+	 * @return {boolean} Whether this ray intersects with the given box or not.
+	 */
+	intersectsBox( box ) {
+
+		return this.intersectBox( box, _vector$7 ) !== null;
+
+	}
+
+	/**
+	 * Intersects this ray with the given triangle, returning the intersection
+	 * point or `null` if there is no intersection.
+	 *
+	 * @param {Vector3} a - The first vertex of the triangle.
+	 * @param {Vector3} b - The second vertex of the triangle.
+	 * @param {Vector3} c - The third vertex of the triangle.
+	 * @param {boolean} backfaceCulling - Whether to use backface culling or not.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {?Vector3} The intersection point.
+	 */
+	intersectTriangle( a, b, c, backfaceCulling, target ) {
+
+		// Watertight ray/triangle intersection. Reference: Woop, Benthin, Wald,
+		// "Watertight Ray/Triangle Intersection", JCGT vol. 2 no. 1 (2013), Appendix A.
+		// https://jcgt.org/published/0002/01/05/
+
+		const origin = this.origin;
+		const direction = this.direction;
+
+		const dx = direction.x;
+		const dy = direction.y;
+		const dz = direction.z;
+
+		// triangle vertices relative to the ray origin
+
+		const aox = a.x - origin.x, aoy = a.y - origin.y, aoz = a.z - origin.z;
+		const box = b.x - origin.x, boy = b.y - origin.y, boz = b.z - origin.z;
+		const cox = c.x - origin.x, coy = c.y - origin.y, coz = c.z - origin.z;
+
+		// Use the dimension where the ray direction is maximal as the projection
+		// axis (kz) and read every component already permuted into (kx, ky, kz).
+		// kx and ky are swapped when the direction's kz component is negative, to
+		// preserve the winding order of triangles.
+
+		const adx = Math.abs( dx ), ady = Math.abs( dy ), adz = Math.abs( dz );
+
+		let dkx, dky, dkz;
+		let akx, aky, akz, bkx, bky, bkz, ckx, cky, ckz;
+
+		if ( adx >= ady && adx >= adz ) {
+
+			dkz = dx; akz = aox; bkz = box; ckz = cox;
+
+			if ( dx >= 0 ) {
+
+				dkx = dy; dky = dz;
+				akx = aoy; aky = aoz; bkx = boy; bky = boz; ckx = coy; cky = coz;
+
+			} else {
+
+				dkx = dz; dky = dy;
+				akx = aoz; aky = aoy; bkx = boz; bky = boy; ckx = coz; cky = coy;
+
+			}
+
+		} else if ( ady >= adz ) {
+
+			dkz = dy; akz = aoy; bkz = boy; ckz = coy;
+
+			if ( dy >= 0 ) {
+
+				dkx = dz; dky = dx;
+				akx = aoz; aky = aox; bkx = boz; bky = box; ckx = coz; cky = cox;
+
+			} else {
+
+				dkx = dx; dky = dz;
+				akx = aox; aky = aoz; bkx = box; bky = boz; ckx = cox; cky = coz;
+
+			}
+
+		} else {
+
+			dkz = dz; akz = aoz; bkz = boz; ckz = coz;
+
+			if ( dz >= 0 ) {
+
+				dkx = dx; dky = dy;
+				akx = aox; aky = aoy; bkx = box; bky = boy; ckx = cox; cky = coy;
+
+			} else {
+
+				dkx = dy; dky = dx;
+				akx = aoy; aky = aox; bkx = boy; bky = box; ckx = coy; cky = cox;
+
+			}
+
+		}
+
+		// a zero direction has no maximal axis and cannot intersect
+
+		if ( dkz === 0 ) return null;
+
+		// shear constants that align the ray with the +kz axis
+
+		const sx = dkx / dkz, sy = dky / dkz, sz = 1 / dkz;
+
+		// sheared and scaled vertices
+
+		const ax = akx - sx * akz, ay = aky - sy * akz;
+		const bx = bkx - sx * bkz, by = bky - sy * bkz;
+		const cx = ckx - sx * ckz, cy = cky - sy * ckz;
+
+		// scaled barycentric coordinates (signed edge functions); the shear makes a
+		// shared edge evaluate identically for both adjacent triangles, so the ray
+		// can never fall between them
+
+		const u = cx * by - cy * bx;
+		const v = ax * cy - ay * cx;
+		const w = bx * ay - by * ax;
+
+		if ( backfaceCulling ) {
+
+			if ( u < 0 || v < 0 || w < 0 ) return null;
+
+		} else {
+
+			if ( ( u < 0 || v < 0 || w < 0 ) && ( u > 0 || v > 0 || w > 0 ) ) return null;
+
+		}
+
+		const det = u + v + w;
+
+		// ray is co-planar with the triangle
+
+		if ( det === 0 ) return null;
+
+		// scaled hit distance; t = tScaled / det must lie in front of the origin
+
+		const tScaled = sz * ( u * akz + v * bkz + w * ckz );
+
+		if ( det > 0 ? tScaled < 0 : tScaled > 0 ) return null;
+
+		return this.at( tScaled / det, target );
+
+	}
+
+	/**
+	 * Transforms this ray with the given 4x4 transformation matrix.
+	 *
+	 * @param {Matrix4} matrix4 - The transformation matrix.
+	 * @return {Ray} A reference to this ray.
+	 */
+	applyMatrix4( matrix4 ) {
+
+		this.origin.applyMatrix4( matrix4 );
+		this.direction.transformDirection( matrix4 );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this ray is equal with the given one.
+	 *
+	 * @param {Ray} ray - The ray to test for equality.
+	 * @return {boolean} Whether this ray is equal with the given one.
+	 */
+	equals( ray ) {
+
+		return ray.origin.equals( this.origin ) && ray.direction.equals( this.direction );
+
+	}
+
+	/**
+	 * Returns a new ray with copied values from this instance.
+	 *
+	 * @return {Ray} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+}
+
+/**
+ * A material for drawing geometries in a simple shaded (flat or wireframe) way.
+ *
+ * This material is not affected by lights.
+ *
+ * @augments Material
+ * @demo scenes/material-browser.html#MeshBasicMaterial
+ */
+class MeshBasicMaterial extends Material {
+
+	/**
+	 * Constructs a new mesh basic material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isMeshBasicMaterial = true;
+
+		this.type = 'MeshBasicMaterial';
+
+		/**
+		 * Color of the material.
+		 *
+		 * @type {Color}
+		 * @default (1,1,1)
+		 */
+		this.color = new Color( 0xffffff ); // diffuse
+
+		/**
+		 * The color map. May optionally include an alpha channel, typically combined
+		 * with {@link Material#transparent} or {@link Material#alphaTest}. The texture map
+		 * color is modulated by the diffuse `color`.
+		 *
+		 * `map` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `map` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.map = null;
+
+		/**
+		 * The light map. Requires a second set of UVs.
+		 *
+		 * `lightMap` represents pre-baked illuminance data, and the texture must be assigned
+		 * a {@link Texture#colorSpace}. Most `lightMap` textures set
+		 * `texture.colorSpace = LinearSRGBColorSpace` and use float-type formats
+		 * such as `.exr` or `.hdr`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.lightMap = null;
+
+		/**
+		 * Intensity of the baked light.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.lightMapIntensity = 1.0;
+
+		/**
+		 * The red channel of this texture is used as the ambient occlusion map.
+		 * Requires a second set of UVs.
+		 *
+		 * `aoMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.aoMap = null;
+
+		/**
+		 * Intensity of the ambient occlusion effect. Range is `[0,1]`, where `0`
+		 * disables ambient occlusion. Where intensity is `1` and the AO map's
+		 * red channel is also `1`, ambient light is fully occluded on a surface.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.aoMapIntensity = 1.0;
+
+		/**
+		 * Specular map used by the material.
+		 *
+		 * `specularMap` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `specularMap` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.specularMap = null;
+
+		/**
+		 * The alpha map is a grayscale texture that controls the opacity across the
+		 * surface (black: fully transparent; white: fully opaque).
+		 *
+		 * Only the color of the texture is used, ignoring the alpha channel if one
+		 * exists. For RGB and RGBA textures, the renderer will use the green channel
+		 * when sampling this texture due to the extra bit of precision provided for
+		 * green in DXT-compressed and uncompressed RGB 565 formats. Luminance-only and
+		 * luminance/alpha textures will also still work as expected.
+		 *
+		 * `alphaMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.alphaMap = null;
+
+		/**
+		 * The environment map.
+		 *
+		 * `envMap` represents luminance data, and the texture must be assigned
+		 * a {@link Texture#colorSpace}. Most `envMap` textures set
+		 * `texture.colorSpace = LinearSRGBColorSpace` and use float-type formats
+		 * such as `.exr` or `.hdr`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.envMap = null;
+
+		/**
+		 * The rotation of the environment map in radians.
+		 *
+		 * @type {Euler}
+		 * @default (0,0,0)
+		 */
+		this.envMapRotation = new Euler();
+
+		/**
+		 * How to combine the result of the surface's color with the environment map, if any.
+		 *
+		 * When set to `MixOperation`, the {@link MeshBasicMaterial#reflectivity} is used to
+		 * blend between the two colors.
+		 *
+		 * @type {(MultiplyOperation|MixOperation|AddOperation)}
+		 * @default MultiplyOperation
+		 */
+		this.combine = MultiplyOperation;
+
+		/**
+		 * How much the environment map affects the surface.
+		 * The valid range is between `0` (no reflections) and `1` (full reflections).
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.reflectivity = 1;
+
+		/**
+		 * The index of refraction (IOR) of air (approximately 1) divided by the
+		 * index of refraction of the material. It is used with environment mapping
+		 * modes {@link CubeRefractionMapping} and {@link EquirectangularRefractionMapping}.
+		 * The refraction ratio should not exceed `1`.
+		 *
+		 * @type {number}
+		 * @default 0.98
+		 */
+		this.refractionRatio = 0.98;
+
+		/**
+		 * Renders the geometry as a wireframe.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.wireframe = false;
+
+		/**
+		 * Controls the thickness of the wireframe.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.wireframeLinewidth = 1;
+
+		/**
+		 * Defines appearance of wireframe ends.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {('round'|'bevel'|'miter')}
+		 * @default 'round'
+		 */
+		this.wireframeLinecap = 'round';
+
+		/**
+		 * Defines appearance of wireframe joints.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {('round'|'bevel'|'miter')}
+		 * @default 'round'
+		 */
+		this.wireframeLinejoin = 'round';
+
+		/**
+		 * Whether the material is affected by fog or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.fog = true;
+
+		this.setValues( parameters );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.color.copy( source.color );
+
+		this.map = source.map;
+
+		this.lightMap = source.lightMap;
+		this.lightMapIntensity = source.lightMapIntensity;
+
+		this.aoMap = source.aoMap;
+		this.aoMapIntensity = source.aoMapIntensity;
+
+		this.specularMap = source.specularMap;
+
+		this.alphaMap = source.alphaMap;
+
+		this.envMap = source.envMap;
+		this.envMapRotation.copy( source.envMapRotation );
+		this.combine = source.combine;
+		this.reflectivity = source.reflectivity;
+		this.refractionRatio = source.refractionRatio;
+
+		this.wireframe = source.wireframe;
+		this.wireframeLinewidth = source.wireframeLinewidth;
+		this.wireframeLinecap = source.wireframeLinecap;
+		this.wireframeLinejoin = source.wireframeLinejoin;
+
+		this.fog = source.fog;
+
+		return this;
+
+	}
+
+}
+
+const _inverseMatrix$3 = /*@__PURE__*/ new Matrix4();
+const _ray$3 = /*@__PURE__*/ new Ray();
+const _sphere$6 = /*@__PURE__*/ new Sphere();
+const _sphereHitAt = /*@__PURE__*/ new Vector3();
+
+const _vA = /*@__PURE__*/ new Vector3();
+const _vB = /*@__PURE__*/ new Vector3();
+const _vC = /*@__PURE__*/ new Vector3();
+
+const _tempA = /*@__PURE__*/ new Vector3();
+const _morphA = /*@__PURE__*/ new Vector3();
+
+const _intersectionPoint = /*@__PURE__*/ new Vector3();
+const _intersectionPointWorld = /*@__PURE__*/ new Vector3();
+
+/**
+ * Class representing triangular polygon mesh based objects.
+ *
+ * ```js
+ * const geometry = new THREE.BoxGeometry( 1, 1, 1 );
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00 } );
+ * const mesh = new THREE.Mesh( geometry, material );
+ * scene.add( mesh );
+ * ```
+ *
+ * @augments Object3D
+ */
+class Mesh extends Object3D {
+
+	/**
+	 * Constructs a new mesh.
+	 *
+	 * @param {BufferGeometry} [geometry] - The mesh geometry.
+	 * @param {Material|Array<Material>} [material] - The mesh material.
+	 */
+	constructor( geometry = new BufferGeometry(), material = new MeshBasicMaterial() ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isMesh = true;
+
+		this.type = 'Mesh';
+
+		/**
+		 * The mesh geometry.
+		 *
+		 * @type {BufferGeometry}
+		 */
+		this.geometry = geometry;
+
+		/**
+		 * The mesh material.
+		 *
+		 * @type {Material|Array<Material>}
+		 * @default MeshBasicMaterial
+		 */
+		this.material = material;
+
+		/**
+		 * A dictionary representing the morph targets in the geometry. The key is the
+		 * morph targets name, the value its attribute index. This member is `undefined`
+		 * by default and only set when morph targets are detected in the geometry.
+		 *
+		 * @type {Object<string,number>|undefined}
+		 * @default undefined
+		 */
+		this.morphTargetDictionary = undefined;
+
+		/**
+		 * An array of weights typically in the range `[0,1]` that specify how much of the morph
+		 * is applied. This member is `undefined` by default and only set when morph targets are
+		 * detected in the geometry.
+		 *
+		 * @type {Array<number>|undefined}
+		 * @default undefined
+		 */
+		this.morphTargetInfluences = undefined;
+
+		/**
+		 * The number of instances of this mesh.
+		 * Can only be used with {@link WebGPURenderer}.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.count = 1;
+
+		this.updateMorphTargets();
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		if ( source.morphTargetInfluences !== undefined ) {
+
+			this.morphTargetInfluences = source.morphTargetInfluences.slice();
+
+		}
+
+		if ( source.morphTargetDictionary !== undefined ) {
+
+			this.morphTargetDictionary = Object.assign( {}, source.morphTargetDictionary );
+
+		}
+
+		this.material = Array.isArray( source.material ) ? source.material.slice() : source.material;
+		this.geometry = source.geometry;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the values of {@link Mesh#morphTargetDictionary} and {@link Mesh#morphTargetInfluences}
+	 * to make sure existing morph targets can influence this 3D object.
+	 */
+	updateMorphTargets() {
+
+		const geometry = this.geometry;
+
+		const morphAttributes = geometry.morphAttributes;
+		const keys = Object.keys( morphAttributes );
+
+		if ( keys.length > 0 ) {
+
+			const morphAttribute = morphAttributes[ keys[ 0 ] ];
+
+			if ( morphAttribute !== undefined ) {
+
+				this.morphTargetInfluences = [];
+				this.morphTargetDictionary = {};
+
+				for ( let m = 0, ml = morphAttribute.length; m < ml; m ++ ) {
+
+					const name = morphAttribute[ m ].name || String( m );
+
+					this.morphTargetInfluences.push( 0 );
+					this.morphTargetDictionary[ name ] = m;
+
+				}
+
+			}
+
+		}
+
+	}
+
+	/**
+	 * Returns the local-space position of the vertex at the given index, taking into
+	 * account the current animation state of both morph targets and skinning.
+	 *
+	 * @param {number} index - The vertex index.
+	 * @param {Vector3} target - The target object that is used to store the method's result.
+	 * @return {Vector3} The vertex position in local space.
+	 */
+	getVertexPosition( index, target ) {
+
+		const geometry = this.geometry;
+		const position = geometry.attributes.position;
+		const morphPosition = geometry.morphAttributes.position;
+		const morphTargetsRelative = geometry.morphTargetsRelative;
+
+		target.fromBufferAttribute( position, index );
+
+		const morphInfluences = this.morphTargetInfluences;
+
+		if ( morphPosition && morphInfluences ) {
+
+			_morphA.set( 0, 0, 0 );
+
+			for ( let i = 0, il = morphPosition.length; i < il; i ++ ) {
+
+				const influence = morphInfluences[ i ];
+				const morphAttribute = morphPosition[ i ];
+
+				if ( influence === 0 ) continue;
+
+				_tempA.fromBufferAttribute( morphAttribute, index );
+
+				if ( morphTargetsRelative ) {
+
+					_morphA.addScaledVector( _tempA, influence );
+
+				} else {
+
+					_morphA.addScaledVector( _tempA.sub( target ), influence );
+
+				}
+
+			}
+
+			target.add( _morphA );
+
+		}
+
+		return target;
+
+	}
+
+	/**
+	 * Returns `true` if this mesh intersects the given frustum.
+	 *
+	 * @param {Frustum|FrustumArray} frustum - The frustum to test.
+	 * @return {boolean} Whether this mesh intersects the given frustum or not.
+	 */
+	intersectsFrustum( frustum ) {
+
+		return frustum.intersectsObject( this );
+
+	}
+
+	/**
+	 * Computes intersection points between a casted ray and this line.
+	 *
+	 * @param {Raycaster} raycaster - The raycaster.
+	 * @param {Array<Object>} intersects - The target array that holds the intersection points.
+	 */
+	raycast( raycaster, intersects ) {
+
+		const geometry = this.geometry;
+		const material = this.material;
+		const matrixWorld = this.matrixWorld;
+
+		if ( material === undefined ) return;
+
+		// test with bounding sphere in world space
+
+		if ( geometry.boundingSphere === null ) geometry.computeBoundingSphere();
+
+		_sphere$6.copy( geometry.boundingSphere );
+		_sphere$6.applyMatrix4( matrixWorld );
+
+		// check distance from ray origin to bounding sphere
+
+		_ray$3.copy( raycaster.ray ).recast( raycaster.near );
+
+		if ( _sphere$6.containsPoint( _ray$3.origin ) === false ) {
+
+			if ( _ray$3.intersectSphere( _sphere$6, _sphereHitAt ) === null ) return;
+
+			if ( _ray$3.origin.distanceToSquared( _sphereHitAt ) > ( raycaster.far - raycaster.near ) ** 2 ) return;
+
+		}
+
+		// convert ray to local space of mesh
+
+		_inverseMatrix$3.copy( matrixWorld ).invert();
+		_ray$3.copy( raycaster.ray ).applyMatrix4( _inverseMatrix$3 );
+
+		// test with bounding box in local space
+
+		if ( geometry.boundingBox !== null ) {
+
+			if ( _ray$3.intersectsBox( geometry.boundingBox ) === false ) return;
+
+		}
+
+		// test for intersections with geometry
+
+		this._computeIntersections( raycaster, intersects, _ray$3 );
+
+	}
+
+	_computeIntersections( raycaster, intersects, rayLocalSpace ) {
+
+		let intersection;
+
+		const geometry = this.geometry;
+		const material = this.material;
+
+		const index = geometry.index;
+		const position = geometry.attributes.position;
+		const uv = geometry.attributes.uv;
+		const uv1 = geometry.attributes.uv1;
+		const normal = geometry.attributes.normal;
+		const groups = geometry.groups;
+		const drawRange = geometry.drawRange;
+
+		if ( index !== null ) {
+
+			// indexed buffer geometry
+
+			if ( Array.isArray( material ) ) {
+
+				for ( let i = 0, il = groups.length; i < il; i ++ ) {
+
+					const group = groups[ i ];
+					const groupMaterial = material[ group.materialIndex ];
+
+					const start = Math.max( group.start, drawRange.start );
+					const end = Math.min( index.count, Math.min( ( group.start + group.count ), ( drawRange.start + drawRange.count ) ) );
+
+					for ( let j = start, jl = end; j < jl; j += 3 ) {
+
+						const a = index.getX( j );
+						const b = index.getX( j + 1 );
+						const c = index.getX( j + 2 );
+
+						intersection = checkGeometryIntersection( this, groupMaterial, raycaster, rayLocalSpace, uv, uv1, normal, a, b, c );
+
+						if ( intersection ) {
+
+							intersection.faceIndex = Math.floor( j / 3 ); // triangle number in indexed buffer semantics
+							intersection.face.materialIndex = group.materialIndex;
+							intersects.push( intersection );
+
+						}
+
+					}
+
+				}
+
+			} else {
+
+				const start = Math.max( 0, drawRange.start );
+				const end = Math.min( index.count, ( drawRange.start + drawRange.count ) );
+
+				for ( let i = start, il = end; i < il; i += 3 ) {
+
+					const a = index.getX( i );
+					const b = index.getX( i + 1 );
+					const c = index.getX( i + 2 );
+
+					intersection = checkGeometryIntersection( this, material, raycaster, rayLocalSpace, uv, uv1, normal, a, b, c );
+
+					if ( intersection ) {
+
+						intersection.faceIndex = Math.floor( i / 3 ); // triangle number in indexed buffer semantics
+						intersects.push( intersection );
+
+					}
+
+				}
+
+			}
+
+		} else if ( position !== undefined ) {
+
+			// non-indexed buffer geometry
+
+			if ( Array.isArray( material ) ) {
+
+				for ( let i = 0, il = groups.length; i < il; i ++ ) {
+
+					const group = groups[ i ];
+					const groupMaterial = material[ group.materialIndex ];
+
+					const start = Math.max( group.start, drawRange.start );
+					const end = Math.min( position.count, Math.min( ( group.start + group.count ), ( drawRange.start + drawRange.count ) ) );
+
+					for ( let j = start, jl = end; j < jl; j += 3 ) {
+
+						const a = j;
+						const b = j + 1;
+						const c = j + 2;
+
+						intersection = checkGeometryIntersection( this, groupMaterial, raycaster, rayLocalSpace, uv, uv1, normal, a, b, c );
+
+						if ( intersection ) {
+
+							intersection.faceIndex = Math.floor( j / 3 ); // triangle number in non-indexed buffer semantics
+							intersection.face.materialIndex = group.materialIndex;
+							intersects.push( intersection );
+
+						}
+
+					}
+
+				}
+
+			} else {
+
+				const start = Math.max( 0, drawRange.start );
+				const end = Math.min( position.count, ( drawRange.start + drawRange.count ) );
+
+				for ( let i = start, il = end; i < il; i += 3 ) {
+
+					const a = i;
+					const b = i + 1;
+					const c = i + 2;
+
+					intersection = checkGeometryIntersection( this, material, raycaster, rayLocalSpace, uv, uv1, normal, a, b, c );
+
+					if ( intersection ) {
+
+						intersection.faceIndex = Math.floor( i / 3 ); // triangle number in non-indexed buffer semantics
+						intersects.push( intersection );
+
+					}
+
+				}
+
+			}
+
+		}
+
+	}
+
+}
+
+function checkIntersection$1( object, material, raycaster, ray, pA, pB, pC, point ) {
+
+	let intersect;
+
+	if ( material.side === BackSide ) {
+
+		intersect = ray.intersectTriangle( pC, pB, pA, true, point );
+
+	} else {
+
+		intersect = ray.intersectTriangle( pA, pB, pC, ( material.side === FrontSide ), point );
+
+	}
+
+	if ( intersect === null ) return null;
+
+	_intersectionPointWorld.copy( point );
+	_intersectionPointWorld.applyMatrix4( object.matrixWorld );
+
+	const distance = raycaster.ray.origin.distanceTo( _intersectionPointWorld );
+
+	if ( distance < raycaster.near || distance > raycaster.far ) return null;
+
+	return {
+		distance: distance,
+		point: _intersectionPointWorld.clone(),
+		object: object
+	};
+
+}
+
+function checkGeometryIntersection( object, material, raycaster, ray, uv, uv1, normal, a, b, c ) {
+
+	object.getVertexPosition( a, _vA );
+	object.getVertexPosition( b, _vB );
+	object.getVertexPosition( c, _vC );
+
+	const intersection = checkIntersection$1( object, material, raycaster, ray, _vA, _vB, _vC, _intersectionPoint );
+
+	if ( intersection ) {
+
+		const barycoord = new Vector3();
+		Triangle.getBarycoord( _intersectionPoint, _vA, _vB, _vC, barycoord );
+
+		if ( uv ) {
+
+			intersection.uv = Triangle.getInterpolatedAttribute( uv, a, b, c, barycoord, new Vector2() );
+
+		}
+
+		if ( uv1 ) {
+
+			intersection.uv1 = Triangle.getInterpolatedAttribute( uv1, a, b, c, barycoord, new Vector2() );
+
+		}
+
+		if ( normal ) {
+
+			intersection.normal = Triangle.getInterpolatedAttribute( normal, a, b, c, barycoord, new Vector3() );
+
+			if ( intersection.normal.dot( ray.direction ) > 0 ) {
+
+				intersection.normal.multiplyScalar( -1 );
+
+			}
+
+		}
+
+		const face = {
+			a: a,
+			b: b,
+			c: c,
+			normal: new Vector3(),
+			materialIndex: 0
+		};
+
+		Triangle.getNormal( _vA, _vB, _vC, face.normal );
+
+		intersection.face = face;
+		intersection.barycoord = barycoord;
+
+	}
+
+	return intersection;
+
+}
+
+const _baseVector = /*@__PURE__*/ new Vector4();
+
+const _skinIndex = /*@__PURE__*/ new Vector4();
+const _skinWeight = /*@__PURE__*/ new Vector4();
+
+const _vector4 = /*@__PURE__*/ new Vector4();
+const _matrix4 = /*@__PURE__*/ new Matrix4();
+const _vertex = /*@__PURE__*/ new Vector3();
+
+const _sphere$5 = /*@__PURE__*/ new Sphere();
+const _inverseMatrix$2 = /*@__PURE__*/ new Matrix4();
+const _ray$2 = /*@__PURE__*/ new Ray();
+
+/**
+ * A mesh that has a {@link Skeleton} that can then be used to animate the
+ * vertices of the geometry with skinning/skeleton animation.
+ *
+ * Next to a valid skeleton, the skinned mesh requires skin indices and weights
+ * as buffer attributes in its geometry. These attribute define which bones affect a single
+ * vertex to a certain extend.
+ *
+ * Typically skinned meshes are not created manually but loaders like {@link GLTFLoader}
+ * or {@link FBXLoader } import respective models.
+ *
+ * @augments Mesh
+ * @demo scenes/bones-browser.html
+ */
+class SkinnedMesh extends Mesh {
+
+	/**
+	 * Constructs a new skinned mesh.
+	 *
+	 * @param {BufferGeometry} [geometry] - The mesh geometry.
+	 * @param {Material|Array<Material>} [material] - The mesh material.
+	 */
+	constructor( geometry, material ) {
+
+		super( geometry, material );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isSkinnedMesh = true;
+
+		this.type = 'SkinnedMesh';
+
+		/**
+		 * `AttachedBindMode` means the skinned mesh shares the same world space as the skeleton.
+		 * This is not true when using `DetachedBindMode` which is useful when sharing a skeleton
+		 * across multiple skinned meshes.
+		 *
+		 * @type {(AttachedBindMode|DetachedBindMode)}
+		 * @default AttachedBindMode
+		 */
+		this.bindMode = AttachedBindMode;
+
+		/**
+		 * The base matrix that is used for the bound bone transforms.
+		 *
+		 * @type {Matrix4}
+		 */
+		this.bindMatrix = new Matrix4();
+
+		/**
+		 * The base matrix that is used for resetting the bound bone transforms.
+		 *
+		 * @type {Matrix4}
+		 */
+		this.bindMatrixInverse = new Matrix4();
+
+		/**
+		 * The bounding box of the skinned mesh. Can be computed via {@link SkinnedMesh#computeBoundingBox}.
+		 *
+		 * @type {?Box3}
+		 * @default null
+		 */
+		this.boundingBox = null;
+
+		/**
+		 * The bounding sphere of the skinned mesh. Can be computed via {@link SkinnedMesh#computeBoundingSphere}.
+		 *
+		 * @type {?Sphere}
+		 * @default null
+		 */
+		this.boundingSphere = null;
+
+	}
+
+	/**
+	 * Computes the bounding box of the skinned mesh, and updates {@link SkinnedMesh#boundingBox}.
+	 * The bounding box is not automatically computed by the engine; this method must be called by your app.
+	 * If the skinned mesh is animated, the bounding box should be recomputed per frame in order to reflect
+	 * the current animation state.
+	 */
+	computeBoundingBox() {
+
+		const geometry = this.geometry;
+
+		if ( this.boundingBox === null ) {
+
+			this.boundingBox = new Box3();
+
+		}
+
+		this.boundingBox.makeEmpty();
+
+		const positionAttribute = geometry.getAttribute( 'position' );
+
+		for ( let i = 0; i < positionAttribute.count; i ++ ) {
+
+			this.getVertexPosition( i, _vertex );
+			this.boundingBox.expandByPoint( _vertex );
+
+		}
+
+	}
+
+	/**
+	 * Computes the bounding sphere of the skinned mesh, and updates {@link SkinnedMesh#boundingSphere}.
+	 * The bounding sphere is automatically computed by the engine once when it is needed, e.g., for ray casting
+	 * and view frustum culling. If the skinned mesh is animated, the bounding sphere should be recomputed
+	 * per frame in order to reflect the current animation state.
+	 */
+	computeBoundingSphere() {
+
+		const geometry = this.geometry;
+
+		if ( this.boundingSphere === null ) {
+
+			this.boundingSphere = new Sphere();
+
+		}
+
+		this.boundingSphere.makeEmpty();
+
+		const positionAttribute = geometry.getAttribute( 'position' );
+
+		for ( let i = 0; i < positionAttribute.count; i ++ ) {
+
+			this.getVertexPosition( i, _vertex );
+			this.boundingSphere.expandByPoint( _vertex );
+
+		}
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		this.bindMode = source.bindMode;
+		this.bindMatrix.copy( source.bindMatrix );
+		this.bindMatrixInverse.copy( source.bindMatrixInverse );
+
+		this.skeleton = source.skeleton;
+
+		if ( source.boundingBox !== null ) this.boundingBox = source.boundingBox.clone();
+		if ( source.boundingSphere !== null ) this.boundingSphere = source.boundingSphere.clone();
+
+		return this;
+
+	}
+
+	raycast( raycaster, intersects ) {
+
+		const material = this.material;
+		const matrixWorld = this.matrixWorld;
+
+		if ( material === undefined ) return;
+
+		// test with bounding sphere in world space
+
+		if ( this.boundingSphere === null ) this.computeBoundingSphere();
+
+		_sphere$5.copy( this.boundingSphere );
+		_sphere$5.applyMatrix4( matrixWorld );
+
+		if ( raycaster.ray.intersectsSphere( _sphere$5 ) === false ) return;
+
+		// convert ray to local space of skinned mesh
+
+		_inverseMatrix$2.copy( matrixWorld ).invert();
+		_ray$2.copy( raycaster.ray ).applyMatrix4( _inverseMatrix$2 );
+
+		// test with bounding box in local space
+
+		if ( this.boundingBox !== null ) {
+
+			if ( _ray$2.intersectsBox( this.boundingBox ) === false ) return;
+
+		}
+
+		// test for intersections with geometry
+
+		this._computeIntersections( raycaster, intersects, _ray$2 );
+
+	}
+
+	getVertexPosition( index, target ) {
+
+		super.getVertexPosition( index, target );
+
+		this.applyBoneTransform( index, target );
+
+		return target;
+
+	}
+
+	/**
+	 * Binds the given skeleton to the skinned mesh.
+	 *
+	 * @param {Skeleton} skeleton - The skeleton to bind.
+	 * @param {Matrix4} [bindMatrix] - The bind matrix. If no bind matrix is provided,
+	 * the skinned mesh's world matrix will be used instead.
+	 */
+	bind( skeleton, bindMatrix ) {
+
+		this.skeleton = skeleton;
+
+		if ( bindMatrix === undefined ) {
+
+			this.updateMatrixWorld( true );
+
+			this.skeleton.calculateInverses();
+
+			bindMatrix = this.matrixWorld;
+
+		}
+
+		this.bindMatrix.copy( bindMatrix );
+		this.bindMatrixInverse.copy( bindMatrix ).invert();
+
+	}
+
+	/**
+	 * This method sets the skinned mesh in the rest pose).
+	 */
+	pose() {
+
+		this.skeleton.pose();
+
+	}
+
+	/**
+	 * Normalizes the skin weights which are defined as a buffer attribute
+	 * in the skinned mesh's geometry.
+	 */
+	normalizeSkinWeights() {
+
+		const vector = new Vector4();
+
+		const skinWeight = this.geometry.attributes.skinWeight;
+
+		for ( let i = 0, l = skinWeight.count; i < l; i ++ ) {
+
+			vector.fromBufferAttribute( skinWeight, i );
+
+			const scale = 1.0 / vector.manhattanLength();
+
+			if ( scale !== Infinity ) {
+
+				vector.multiplyScalar( scale );
+
+			} else {
+
+				vector.set( 1, 0, 0, 0 ); // do something reasonable
+
+			}
+
+			skinWeight.setXYZW( i, vector.x, vector.y, vector.z, vector.w );
+
+		}
+
+	}
+
+	updateMatrixWorld( force ) {
+
+		super.updateMatrixWorld( force );
+
+		if ( this.bindMode === AttachedBindMode ) {
+
+			this.bindMatrixInverse.copy( this.matrixWorld ).invert();
+
+		} else if ( this.bindMode === DetachedBindMode ) {
+
+			this.bindMatrixInverse.copy( this.bindMatrix ).invert();
+
+		} else {
+
+			warn( 'SkinnedMesh: Unrecognized bindMode: ' + this.bindMode );
+
+		}
+
+	}
+
+	/**
+	 * Applies the bone transform associated with the given index to the given
+	 * vector. Can be used to transform positions or direction vectors by providing
+	 * a Vector4 with 1 or 0 in the w component respectively. Returns the updated vector.
+	 *
+	 * @param {number} index - The vertex index.
+	 * @param {Vector3|Vector4} target - The target object that is used to store the method's result.
+	 * @return {Vector3|Vector4} The updated vertex attribute data.
+	 */
+	applyBoneTransform( index, target ) {
+
+		const skeleton = this.skeleton;
+		const geometry = this.geometry;
+
+		_skinIndex.fromBufferAttribute( geometry.attributes.skinIndex, index );
+		_skinWeight.fromBufferAttribute( geometry.attributes.skinWeight, index );
+
+		if ( target.isVector4 ) {
+
+			_baseVector.copy( target );
+			target.set( 0, 0, 0, 0 );
+
+		} else {
+
+			_baseVector.set( ...target, 1 );
+			target.set( 0, 0, 0 );
+
+		}
+
+		_baseVector.applyMatrix4( this.bindMatrix );
+
+		for ( let i = 0; i < 4; i ++ ) {
+
+			const weight = _skinWeight.getComponent( i );
+
+			if ( weight !== 0 ) {
+
+				const boneIndex = _skinIndex.getComponent( i );
+
+				_matrix4.multiplyMatrices( skeleton.bones[ boneIndex ].matrixWorld, skeleton.boneInverses[ boneIndex ] );
+
+				target.addScaledVector( _vector4.copy( _baseVector ).applyMatrix4( _matrix4 ), weight );
+
+			}
+
+		}
+
+		if ( target.isVector4 ) {
+
+			// ensure the homogenous coordinate remains unchanged after vector operations
+			target.w = _baseVector.w;
+
+		}
+
+		return target.applyMatrix4( this.bindMatrixInverse );
+
+	}
+
+}
+
+/**
+ * A bone which is part of a {@link Skeleton}. The skeleton in turn is used by
+ * the {@link SkinnedMesh}.
+ *
+ * ```js
+ * const root = new THREE.Bone();
+ * const child = new THREE.Bone();
+ *
+ * root.add( child );
+ * child.position.y = 5;
+ * ```
+ *
+ * @augments Object3D
+ */
+class Bone extends Object3D {
+
+	/**
+	 * Constructs a new bone.
+	 */
+	constructor() {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isBone = true;
+
+		this.type = 'Bone';
+
+	}
+
+}
+
+/**
+ * Creates a texture directly from raw buffer data.
+ *
+ * The interpretation of the data depends on type and format: If the type is
+ * `UnsignedByteType`, a `Uint8Array` will be useful for addressing the
+ * texel data. If the format is `RGBAFormat`, data needs four values for
+ * one texel; Red, Green, Blue and Alpha (typically the opacity).
+ *
+ * @augments Texture
+ */
+class DataTexture extends Texture {
+
+	/**
+	 * Constructs a new data texture.
+	 *
+	 * @param {?TypedArray} [data=null] - The buffer data.
+	 * @param {number} [width=1] - The width of the texture.
+	 * @param {number} [height=1] - The height of the texture.
+	 * @param {number} [format=RGBAFormat] - The texture format.
+	 * @param {number} [type=UnsignedByteType] - The texture type.
+	 * @param {number} [mapping=Texture.DEFAULT_MAPPING] - The texture mapping.
+	 * @param {number} [wrapS=ClampToEdgeWrapping] - The wrapS value.
+	 * @param {number} [wrapT=ClampToEdgeWrapping] - The wrapT value.
+	 * @param {number} [magFilter=NearestFilter] - The mag filter value.
+	 * @param {number} [minFilter=NearestFilter] - The min filter value.
+	 * @param {number} [anisotropy=Texture.DEFAULT_ANISOTROPY] - The anisotropy value.
+	 * @param {string} [colorSpace=NoColorSpace] - The color space.
+	 */
+	constructor( data = null, width = 1, height = 1, format, type, mapping, wrapS, wrapT, magFilter = NearestFilter, minFilter = NearestFilter, anisotropy, colorSpace ) {
+
+		super( null, mapping, wrapS, wrapT, magFilter, minFilter, format, type, anisotropy, colorSpace );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isDataTexture = true;
+
+		/**
+		 * The image definition of a data texture.
+		 *
+		 * @type {{data:TypedArray,width:number,height:number}}
+		 */
+		this.image = { data: data, width: width, height: height };
+
+		/**
+		 * Whether to generate mipmaps (if possible) for a texture.
+		 *
+		 * Overwritten and set to `false` by default.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.generateMipmaps = false;
+
+		/**
+		 * If set to `true`, the texture is flipped along the vertical axis when
+		 * uploaded to the GPU.
+		 *
+		 * Overwritten and set to `false` by default.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.flipY = false;
+
+		/**
+		 * Specifies the alignment requirements for the start of each pixel row in memory.
+		 *
+		 * Overwritten and set to `1` by default.
+		 *
+		 * @type {boolean}
+		 * @default 1
+		 */
+		this.unpackAlignment = 1;
+
+	}
+
+}
+
+const _offsetMatrix = /*@__PURE__*/ new Matrix4();
+const _identityMatrix = /*@__PURE__*/ new Matrix4();
+
+/**
+ * Class for representing the armatures in `three.js`. The skeleton
+ * is defined by a hierarchy of bones.
+ *
+ * ```js
+ * const bones = [];
+ *
+ * const shoulder = new THREE.Bone();
+ * const elbow = new THREE.Bone();
+ * const hand = new THREE.Bone();
+ *
+ * shoulder.add( elbow );
+ * elbow.add( hand );
+ *
+ * bones.push( shoulder , elbow, hand);
+ *
+ * shoulder.position.y = -5;
+ * elbow.position.y = 0;
+ * hand.position.y = 5;
+ *
+ * const armSkeleton = new THREE.Skeleton( bones );
+ * ```
+ */
+class Skeleton {
+
+	/**
+	 * Constructs a new skeleton.
+	 *
+	 * @param {Array<Bone>} [bones] - An array of bones.
+	 * @param {Array<Matrix4>} [boneInverses] - An array of bone inverse matrices.
+	 * If not provided, these matrices will be computed automatically via {@link Skeleton#calculateInverses}.
+	 */
+	constructor( bones = [], boneInverses = [] ) {
+
+		this.uuid = generateUUID();
+
+		/**
+		 * An array of bones defining the skeleton.
+		 *
+		 * @type {Array<Bone>}
+		 */
+		this.bones = bones.slice( 0 );
+
+		/**
+		 * An array of bone inverse matrices.
+		 *
+		 * @type {Array<Matrix4>}
+		 */
+		this.boneInverses = boneInverses;
+
+		/**
+		 * An array buffer holding the bone data.
+		 * Input data for {@link Skeleton#boneTexture}.
+		 *
+		 * @type {?Float32Array}
+		 * @default null
+		 */
+		this.boneMatrices = null;
+
+		/**
+		 * A texture holding the bone data for use
+		 * in the vertex shader.
+		 *
+		 * @type {?DataTexture}
+		 * @default null
+		 */
+		this.boneTexture = null;
+
+		this.init();
+
+	}
+
+	/**
+	 * Initializes the skeleton. This method gets automatically called by the constructor
+	 * but depending on how the skeleton is created it might be necessary to call this method
+	 * manually.
+	 */
+	init() {
+
+		const bones = this.bones;
+		const boneInverses = this.boneInverses;
+
+		this.boneMatrices = new Float32Array( bones.length * 16 );
+
+		// calculate inverse bone matrices if necessary
+
+		if ( boneInverses.length === 0 ) {
+
+			this.calculateInverses();
+
+		} else {
+
+			// handle special case
+
+			if ( bones.length !== boneInverses.length ) {
+
+				warn( 'Skeleton: Number of inverse bone matrices does not match amount of bones.' );
+
+				this.boneInverses = [];
+
+				for ( let i = 0, il = this.bones.length; i < il; i ++ ) {
+
+					this.boneInverses.push( new Matrix4() );
+
+				}
+
+			}
+
+		}
+
+	}
+
+	/**
+	 * Computes the bone inverse matrices. This method resets {@link Skeleton#boneInverses}
+	 * and fills it with new matrices.
+	 */
+	calculateInverses() {
+
+		this.boneInverses.length = 0;
+
+		for ( let i = 0, il = this.bones.length; i < il; i ++ ) {
+
+			const inverse = new Matrix4();
+
+			if ( this.bones[ i ] ) {
+
+				inverse.copy( this.bones[ i ].matrixWorld ).invert();
+
+			}
+
+			this.boneInverses.push( inverse );
+
+		}
+
+	}
+
+	/**
+	 * Resets the skeleton to the base pose.
+	 */
+	pose() {
+
+		// recover the bind-time world matrices
+
+		for ( let i = 0, il = this.bones.length; i < il; i ++ ) {
+
+			const bone = this.bones[ i ];
+
+			if ( bone ) {
+
+				bone.matrixWorld.copy( this.boneInverses[ i ] ).invert();
+
+			}
+
+		}
+
+		// compute the local matrices, positions, rotations and scales
+
+		for ( let i = 0, il = this.bones.length; i < il; i ++ ) {
+
+			const bone = this.bones[ i ];
+
+			if ( bone ) {
+
+				if ( bone.parent && bone.parent.isBone ) {
+
+					bone.matrix.copy( bone.parent.matrixWorld ).invert();
+					bone.matrix.multiply( bone.matrixWorld );
+
+				} else {
+
+					bone.matrix.copy( bone.matrixWorld );
+
+				}
+
+				bone.matrix.decompose( bone.position, bone.quaternion, bone.scale );
+
+			}
+
+		}
+
+	}
+
+	/**
+	 * Resets the skeleton to the base pose.
+	 */
+	update() {
+
+		const bones = this.bones;
+		const boneInverses = this.boneInverses;
+		const boneMatrices = this.boneMatrices;
+		const boneTexture = this.boneTexture;
+
+		// flatten bone matrices to array
+
+		for ( let i = 0, il = bones.length; i < il; i ++ ) {
+
+			// compute the offset between the current and the original transform
+
+			const matrix = bones[ i ] ? bones[ i ].matrixWorld : _identityMatrix;
+
+			_offsetMatrix.multiplyMatrices( matrix, boneInverses[ i ] );
+			_offsetMatrix.toArray( boneMatrices, i * 16 );
+
+		}
+
+		if ( boneTexture !== null ) {
+
+			boneTexture.needsUpdate = true;
+
+		}
+
+	}
+
+	/**
+	 * Returns a new skeleton with copied values from this instance.
+	 *
+	 * @return {Skeleton} A clone of this instance.
+	 */
+	clone() {
+
+		return new Skeleton( this.bones, this.boneInverses );
+
+	}
+
+	/**
+	 * Computes a data texture for passing bone data to the vertex shader.
+	 *
+	 * @return {Skeleton} A reference of this instance.
+	 */
+	computeBoneTexture() {
+
+		// layout (1 matrix = 4 pixels)
+		//      RGBA RGBA RGBA RGBA (=> column1, column2, column3, column4)
+		//  with  8x8  pixel texture max   16 bones * 4 pixels =  (8 * 8)
+		//       16x16 pixel texture max   64 bones * 4 pixels = (16 * 16)
+		//       32x32 pixel texture max  256 bones * 4 pixels = (32 * 32)
+		//       64x64 pixel texture max 1024 bones * 4 pixels = (64 * 64)
+
+		let size = Math.sqrt( this.bones.length * 4 ); // 4 pixels needed for 1 matrix
+		size = Math.ceil( size / 4 ) * 4;
+		size = Math.max( size, 4 );
+
+		const boneMatrices = new Float32Array( size * size * 4 ); // 4 floats per RGBA pixel
+		boneMatrices.set( this.boneMatrices ); // copy current values
+
+		const boneTexture = new DataTexture( boneMatrices, size, size, RGBAFormat, FloatType );
+		boneTexture.needsUpdate = true;
+
+		this.boneMatrices = boneMatrices;
+		this.boneTexture = boneTexture;
+
+		return this;
+
+	}
+
+	/**
+	 * Searches through the skeleton's bone array and returns the first with a
+	 * matching name.
+	 *
+	 * @param {string} name - The name of the bone.
+	 * @return {Bone|undefined} The found bone. `undefined` if no bone has been found.
+	 */
+	getBoneByName( name ) {
+
+		for ( let i = 0, il = this.bones.length; i < il; i ++ ) {
+
+			const bone = this.bones[ i ];
+
+			if ( bone.name === name ) {
+
+				return bone;
+
+			}
+
+		}
+
+		return undefined;
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose( ) {
+
+		if ( this.boneTexture !== null ) {
+
+			this.boneTexture.dispose();
+
+			this.boneTexture = null;
+
+		}
+
+	}
+
+	/**
+	 * Setups the skeleton by the given JSON and bones.
+	 *
+	 * @param {Object} json - The skeleton as serialized JSON.
+	 * @param {Object<string, Bone>} bones - An array of bones.
+	 * @return {Skeleton} A reference of this instance.
+	 */
+	fromJSON( json, bones ) {
+
+		this.uuid = json.uuid;
+
+		for ( let i = 0, l = json.bones.length; i < l; i ++ ) {
+
+			const uuid = json.bones[ i ];
+			let bone = bones[ uuid ];
+
+			if ( bone === undefined ) {
+
+				warn( 'Skeleton: No bone found with UUID:', uuid );
+				bone = new Bone();
+
+			}
+
+			this.bones.push( bone );
+			this.boneInverses.push( new Matrix4().fromArray( json.boneInverses[ i ] ) );
+
+		}
+
+		this.init();
+
+		return this;
+
+	}
+
+	/**
+	 * Serializes the skeleton into JSON.
+	 *
+	 * @return {Object} A JSON object representing the serialized skeleton.
+	 * @see {@link ObjectLoader#parse}
+	 */
+	toJSON() {
+
+		const data = {
+			metadata: {
+				version: 4.7,
+				type: 'Skeleton',
+				generator: 'Skeleton.toJSON'
+			},
+			bones: [],
+			boneInverses: []
+		};
+
+		data.uuid = this.uuid;
+
+		const bones = this.bones;
+		const boneInverses = this.boneInverses;
+
+		for ( let i = 0, l = bones.length; i < l; i ++ ) {
+
+			const bone = bones[ i ];
+			data.bones.push( bone.uuid );
+
+			const boneInverse = boneInverses[ i ];
+			data.boneInverses.push( boneInverse.toArray() );
+
+		}
+
+		return data;
+
+	}
+
+}
+
+/**
+ * An instanced version of a buffer attribute.
+ *
+ * @augments BufferAttribute
+ */
+class InstancedBufferAttribute extends BufferAttribute {
+
+	/**
+	 * Constructs a new instanced buffer attribute.
+	 *
+	 * @param {TypedArray} array - The array holding the attribute data.
+	 * @param {number} itemSize - The item size.
+	 * @param {boolean} [normalized=false] - Whether the data are normalized or not.
+	 * @param {number} [meshPerAttribute=1] - How often a value of this buffer attribute should be repeated.
+	 */
+	constructor( array, itemSize, normalized, meshPerAttribute = 1 ) {
+
+		super( array, itemSize, normalized );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isInstancedBufferAttribute = true;
+
+		/**
+		 * Defines how often a value of this buffer attribute should be repeated. A
+		 * value of one means that each value of the instanced attribute is used for
+		 * a single instance. A value of two means that each value is used for two
+		 * consecutive instances (and so on).
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.meshPerAttribute = meshPerAttribute;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.meshPerAttribute = source.meshPerAttribute;
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.meshPerAttribute = this.meshPerAttribute;
+
+		data.isInstancedBufferAttribute = true;
+
+		return data;
+
+	}
+
+}
+
+const _instanceLocalMatrix = /*@__PURE__*/ new Matrix4();
+const _instanceWorldMatrix = /*@__PURE__*/ new Matrix4();
+
+const _instanceIntersects = [];
+
+const _box3 = /*@__PURE__*/ new Box3();
+const _identity = /*@__PURE__*/ new Matrix4();
+const _mesh$1 = /*@__PURE__*/ new Mesh();
+const _sphere$4 = /*@__PURE__*/ new Sphere();
+
+/**
+ * A special version of a mesh with instanced rendering support. Use
+ * this class if you have to render a large number of objects with the same
+ * geometry and material(s) but with different world transformations. The usage
+ * of 'InstancedMesh' will help you to reduce the number of draw calls and thus
+ * improve the overall rendering performance in your application.
+ *
+ * @augments Mesh
+ */
+class InstancedMesh extends Mesh {
+
+	/**
+	 * Constructs a new instanced mesh.
+	 *
+	 * @param {BufferGeometry} [geometry] - The mesh geometry.
+	 * @param {Material|Array<Material>} [material] - The mesh material.
+	 * @param {number} count - The number of instances.
+	 */
+	constructor( geometry, material, count ) {
+
+		super( geometry, material );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isInstancedMesh = true;
+
+		/**
+		 * Represents the local transformation of all instances. You have to set its
+		 * {@link BufferAttribute#needsUpdate} flag to true if you modify instanced data
+		 * via {@link InstancedMesh#setMatrixAt}.
+		 *
+		 * @type {InstancedBufferAttribute}
+		 */
+		this.instanceMatrix = new InstancedBufferAttribute( new Float32Array( count * 16 ), 16 );
+
+		/**
+		 * Represents the color of all instances. You have to set its
+		 * {@link BufferAttribute#needsUpdate} flag to true if you modify instanced data
+		 * via {@link InstancedMesh#setColorAt}.
+		 *
+		 * @type {?InstancedBufferAttribute}
+		 * @default null
+		 */
+		this.instanceColor = null;
+
+		/**
+		 * Represents the morph target weights of all instances. You have to set its
+		 * {@link Texture#needsUpdate} flag to true if you modify instanced data
+		 * via {@link InstancedMesh#setMorphAt}.
+		 *
+		 * @type {?DataTexture}
+		 * @default null
+		 */
+		this.morphTexture = null;
+
+		/**
+		 * The number of instances.
+		 *
+		 * @type {number}
+		 */
+		this.count = count;
+
+		/**
+		 * The bounding box of the instanced mesh. Can be computed via {@link InstancedMesh#computeBoundingBox}.
+		 *
+		 * @type {?Box3}
+		 * @default null
+		 */
+		this.boundingBox = null;
+
+		/**
+		 * The bounding sphere of the instanced mesh. Can be computed via {@link InstancedMesh#computeBoundingSphere}.
+		 *
+		 * @type {?Sphere}
+		 * @default null
+		 */
+		this.boundingSphere = null;
+
+		for ( let i = 0; i < count; i ++ ) {
+
+			this.setMatrixAt( i, _identity );
+
+		}
+
+	}
+
+	/**
+	 * Computes the bounding box of the instanced mesh, and updates {@link InstancedMesh#boundingBox}.
+	 * The bounding box is not automatically computed by the engine; this method must be called by your app.
+	 * You may need to recompute the bounding box if an instance is transformed via {@link InstancedMesh#setMatrixAt}.
+	 */
+	computeBoundingBox() {
+
+		const geometry = this.geometry;
+		const count = this.count;
+
+		if ( this.boundingBox === null ) {
+
+			this.boundingBox = new Box3();
+
+		}
+
+		if ( geometry.boundingBox === null ) {
+
+			geometry.computeBoundingBox();
+
+		}
+
+		this.boundingBox.makeEmpty();
+
+		for ( let i = 0; i < count; i ++ ) {
+
+			this.getMatrixAt( i, _instanceLocalMatrix );
+
+			_box3.copy( geometry.boundingBox ).applyMatrix4( _instanceLocalMatrix );
+
+			this.boundingBox.union( _box3 );
+
+		}
+
+	}
+
+	/**
+	 * Computes the bounding sphere of the instanced mesh, and updates {@link InstancedMesh#boundingSphere}
+	 * The engine automatically computes the bounding sphere when it is needed, e.g., for ray casting or view frustum culling.
+	 * You may need to recompute the bounding sphere if an instance is transformed via {@link InstancedMesh#setMatrixAt}.
+	 */
+	computeBoundingSphere() {
+
+		const geometry = this.geometry;
+		const count = this.count;
+
+		if ( this.boundingSphere === null ) {
+
+			this.boundingSphere = new Sphere();
+
+		}
+
+		if ( geometry.boundingSphere === null ) {
+
+			geometry.computeBoundingSphere();
+
+		}
+
+		this.boundingSphere.makeEmpty();
+
+		for ( let i = 0; i < count; i ++ ) {
+
+			this.getMatrixAt( i, _instanceLocalMatrix );
+
+			_sphere$4.copy( geometry.boundingSphere ).applyMatrix4( _instanceLocalMatrix );
+
+			this.boundingSphere.union( _sphere$4 );
+
+		}
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		this.instanceMatrix.copy( source.instanceMatrix );
+
+		if ( source.morphTexture !== null ) this.morphTexture = source.morphTexture.clone();
+		if ( source.instanceColor !== null ) this.instanceColor = source.instanceColor.clone();
+
+		this.count = source.count;
+
+		if ( source.boundingBox !== null ) this.boundingBox = source.boundingBox.clone();
+		if ( source.boundingSphere !== null ) this.boundingSphere = source.boundingSphere.clone();
+
+		return this;
+
+	}
+
+	/**
+	 * Gets the color of the defined instance.
+	 *
+	 * @param {number} index - The instance index.
+	 * @param {Color} color - The target object that is used to store the method's result.
+	 * @return {Color} A reference to the target color.
+	 */
+	getColorAt( index, color ) {
+
+		if ( this.instanceColor === null ) {
+
+			return color.setRGB( 1, 1, 1 );
+
+		} else {
+
+			return color.fromArray( this.instanceColor.array, index * 3 );
+
+		}
+
+	}
+
+	/**
+	 * Gets the local transformation matrix of the defined instance.
+	 *
+	 * @param {number} index - The instance index.
+	 * @param {Matrix4} matrix - The target object that is used to store the method's result.
+	 * @return {Matrix4} A reference to the target matrix.
+	 */
+	getMatrixAt( index, matrix ) {
+
+		return matrix.fromArray( this.instanceMatrix.array, index * 16 );
+
+	}
+
+	/**
+	 * Gets the morph target weights of the defined instance.
+	 *
+	 * @param {number} index - The instance index.
+	 * @param {Mesh} object - The target object that is used to store the method's result.
+	 */
+	getMorphAt( index, object ) {
+
+		const objectInfluences = object.morphTargetInfluences;
+
+		const array = this.morphTexture.source.data.data;
+
+		const len = objectInfluences.length + 1; // All influences + the baseInfluenceSum
+
+		const dataIndex = index * len + 1; // Skip the baseInfluenceSum at the beginning
+
+		for ( let i = 0; i < objectInfluences.length; i ++ ) {
+
+			objectInfluences[ i ] = array[ dataIndex + i ];
+
+		}
+
+	}
+
+	raycast( raycaster, intersects ) {
+
+		const matrixWorld = this.matrixWorld;
+		const raycastTimes = this.count;
+
+		_mesh$1.geometry = this.geometry;
+		_mesh$1.material = this.material;
+
+		if ( _mesh$1.material === undefined ) return;
+
+		// test with bounding sphere first
+
+		if ( this.boundingSphere === null ) this.computeBoundingSphere();
+
+		_sphere$4.copy( this.boundingSphere );
+		_sphere$4.applyMatrix4( matrixWorld );
+
+		if ( raycaster.ray.intersectsSphere( _sphere$4 ) === false ) return;
+
+		// now test each instance
+
+		for ( let instanceId = 0; instanceId < raycastTimes; instanceId ++ ) {
+
+			// calculate the world matrix for each instance
+
+			this.getMatrixAt( instanceId, _instanceLocalMatrix );
+
+			_instanceWorldMatrix.multiplyMatrices( matrixWorld, _instanceLocalMatrix );
+
+			// the mesh represents this single instance
+
+			_mesh$1.matrixWorld = _instanceWorldMatrix;
+
+			_mesh$1.raycast( raycaster, _instanceIntersects );
+
+			// process the result of raycast
+
+			for ( let i = 0, l = _instanceIntersects.length; i < l; i ++ ) {
+
+				const intersect = _instanceIntersects[ i ];
+				intersect.instanceId = instanceId;
+				intersect.object = this;
+				intersects.push( intersect );
+
+			}
+
+			_instanceIntersects.length = 0;
+
+		}
+
+	}
+
+	/**
+	 * Sets the given color to the defined instance. Make sure you set the `needsUpdate` flag of
+	 * {@link InstancedMesh#instanceColor} to `true` after updating all the colors.
+	 *
+	 * @param {number} index - The instance index.
+	 * @param {Color} color - The instance color.
+	 * @return {InstancedMesh} A reference to this instanced mesh.
+	 */
+	setColorAt( index, color ) {
+
+		if ( this.instanceColor === null ) {
+
+			this.instanceColor = new InstancedBufferAttribute( new Float32Array( this.instanceMatrix.count * 3 ).fill( 1 ), 3 );
+
+		}
+
+		color.toArray( this.instanceColor.array, index * 3 );
+		return this;
+
+	}
+
+	/**
+	 * Sets the given local transformation matrix to the defined instance. Make sure you set the `needsUpdate` flag of
+	 * {@link InstancedMesh#instanceMatrix} to `true` after updating all the matrices.
+	 *
+	 * @param {number} index - The instance index.
+	 * @param {Matrix4} matrix - The local transformation.
+	 * @return {InstancedMesh} A reference to this instanced mesh.
+	 */
+	setMatrixAt( index, matrix ) {
+
+		matrix.toArray( this.instanceMatrix.array, index * 16 );
+		return this;
+
+	}
+
+	/**
+	 * Sets the morph target weights to the defined instance. Make sure you set the `needsUpdate` flag of
+	 * {@link InstancedMesh#morphTexture} to `true` after updating all the influences.
+	 *
+	 * @param {number} index - The instance index.
+	 * @param {Mesh} object -  A mesh which `morphTargetInfluences` property containing the morph target weights
+	 * of a single instance.
+	 * @return {InstancedMesh} A reference to this instanced mesh.
+	 */
+	setMorphAt( index, object ) {
+
+		const objectInfluences = object.morphTargetInfluences;
+
+		const len = objectInfluences.length + 1; // morphBaseInfluence + all influences
+
+		if ( this.morphTexture === null ) {
+
+			this.morphTexture = new DataTexture( new Float32Array( len * this.count ), len, this.count, RedFormat, FloatType );
+
+		}
+
+		const array = this.morphTexture.source.data.data;
+
+		let morphInfluencesSum = 0;
+
+		for ( let i = 0; i < objectInfluences.length; i ++ ) {
+
+			morphInfluencesSum += objectInfluences[ i ];
+
+		}
+
+		const morphBaseInfluence = this.geometry.morphTargetsRelative ? 1 : 1 - morphInfluencesSum;
+
+		const dataIndex = len * index;
+
+		array[ dataIndex ] = morphBaseInfluence;
+
+		array.set( objectInfluences, dataIndex + 1 );
+		return this;
+
+	}
+
+	updateMorphTargets() {
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		if ( this.morphTexture !== null ) {
+
+			this.morphTexture.dispose();
+			this.morphTexture = null;
+
+		}
+
+	}
+
+}
+
+const _sphere$3 = /*@__PURE__*/ new Sphere();
+const _defaultSpriteCenter = /*@__PURE__*/ new Vector2( 0.5, 0.5 );
+const _vector$6 = /*@__PURE__*/ new Vector3();
+
+/**
+ * Frustums are used to determine what is inside the camera's field of view.
+ * They help speed up the rendering process - objects which lie outside a camera's
+ * frustum can safely be excluded from rendering.
+ *
+ * This class is mainly intended for use internally by a renderer.
+ */
+class Frustum {
+
+	/**
+	 * Constructs a new frustum.
+	 *
+	 * @param {Plane} [p0] - The first plane that encloses the frustum.
+	 * @param {Plane} [p1] - The second plane that encloses the frustum.
+	 * @param {Plane} [p2] - The third plane that encloses the frustum.
+	 * @param {Plane} [p3] - The fourth plane that encloses the frustum.
+	 * @param {Plane} [p4] - The fifth plane that encloses the frustum.
+	 * @param {Plane} [p5] - The sixth plane that encloses the frustum.
+	 */
+	constructor( p0 = new Plane(), p1 = new Plane(), p2 = new Plane(), p3 = new Plane(), p4 = new Plane(), p5 = new Plane() ) {
+
+		/**
+		 * This array holds the planes that enclose the frustum.
+		 *
+		 * @type {Array<Plane>}
+		 */
+		this.planes = [ p0, p1, p2, p3, p4, p5 ];
+
+	}
+
+	/**
+	 * Sets the frustum planes by copying the given planes.
+	 *
+	 * @param {Plane} [p0] - The first plane that encloses the frustum.
+	 * @param {Plane} [p1] - The second plane that encloses the frustum.
+	 * @param {Plane} [p2] - The third plane that encloses the frustum.
+	 * @param {Plane} [p3] - The fourth plane that encloses the frustum.
+	 * @param {Plane} [p4] - The fifth plane that encloses the frustum.
+	 * @param {Plane} [p5] - The sixth plane that encloses the frustum.
+	 * @return {Frustum} A reference to this frustum.
+	 */
+	set( p0, p1, p2, p3, p4, p5 ) {
+
+		const planes = this.planes;
+
+		planes[ 0 ].copy( p0 );
+		planes[ 1 ].copy( p1 );
+		planes[ 2 ].copy( p2 );
+		planes[ 3 ].copy( p3 );
+		planes[ 4 ].copy( p4 );
+		planes[ 5 ].copy( p5 );
+
+		return this;
+
+	}
+
+	/**
+	 * Copies the values of the given frustum to this instance.
+	 *
+	 * @param {Frustum} frustum - The frustum to copy.
+	 * @return {Frustum} A reference to this frustum.
+	 */
+	copy( frustum ) {
+
+		const planes = this.planes;
+
+		for ( let i = 0; i < 6; i ++ ) {
+
+			planes[ i ].copy( frustum.planes[ i ] );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the frustum planes from the given projection matrix.
+	 *
+	 * @param {Matrix4} m - The projection matrix.
+	 * @param {(WebGLCoordinateSystem|WebGPUCoordinateSystem)} coordinateSystem - The coordinate system.
+	 * @param {boolean} [reversedDepth=false] - Whether to use a reversed depth.
+	 * @return {Frustum} A reference to this frustum.
+	 */
+	setFromProjectionMatrix( m, coordinateSystem = WebGLCoordinateSystem, reversedDepth = false ) {
+
+		const planes = this.planes;
+		const me = m.elements;
+		const me0 = me[ 0 ], me1 = me[ 1 ], me2 = me[ 2 ], me3 = me[ 3 ];
+		const me4 = me[ 4 ], me5 = me[ 5 ], me6 = me[ 6 ], me7 = me[ 7 ];
+		const me8 = me[ 8 ], me9 = me[ 9 ], me10 = me[ 10 ], me11 = me[ 11 ];
+		const me12 = me[ 12 ], me13 = me[ 13 ], me14 = me[ 14 ], me15 = me[ 15 ];
+
+		planes[ 0 ].setComponents( me3 - me0, me7 - me4, me11 - me8, me15 - me12 ).normalize();
+		planes[ 1 ].setComponents( me3 + me0, me7 + me4, me11 + me8, me15 + me12 ).normalize();
+		planes[ 2 ].setComponents( me3 + me1, me7 + me5, me11 + me9, me15 + me13 ).normalize();
+		planes[ 3 ].setComponents( me3 - me1, me7 - me5, me11 - me9, me15 - me13 ).normalize();
+
+		if ( reversedDepth ) {
+
+			planes[ 4 ].setComponents( me2, me6, me10, me14 ).normalize(); // far
+			planes[ 5 ].setComponents( me3 - me2, me7 - me6, me11 - me10, me15 - me14 ).normalize(); // near
+
+		} else {
+
+			planes[ 4 ].setComponents( me3 - me2, me7 - me6, me11 - me10, me15 - me14 ).normalize(); // far
+
+			if ( coordinateSystem === WebGLCoordinateSystem ) {
+
+				planes[ 5 ].setComponents( me3 + me2, me7 + me6, me11 + me10, me15 + me14 ).normalize(); // near
+
+			} else if ( coordinateSystem === WebGPUCoordinateSystem ) {
+
+				planes[ 5 ].setComponents( me2, me6, me10, me14 ).normalize(); // near
+
+			} else {
+
+				throw new Error( 'THREE.Frustum.setFromProjectionMatrix(): Invalid coordinate system: ' + coordinateSystem );
+
+			}
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if the 3D object's bounding sphere is intersecting this frustum.
+	 *
+	 * Note that the 3D object must have a geometry so that the bounding sphere can be calculated.
+	 *
+	 * @param {Object3D} object - The 3D object to test.
+	 * @return {boolean} Whether the 3D object's bounding sphere is intersecting this frustum or not.
+	 */
+	intersectsObject( object ) {
+
+		if ( object.boundingSphere !== undefined ) {
+
+			if ( object.boundingSphere === null ) object.computeBoundingSphere();
+
+			_sphere$3.copy( object.boundingSphere ).applyMatrix4( object.matrixWorld );
+
+		} else {
+
+			const geometry = object.geometry;
+
+			if ( geometry.boundingSphere === null ) geometry.computeBoundingSphere();
+
+			_sphere$3.copy( geometry.boundingSphere ).applyMatrix4( object.matrixWorld );
+
+		}
+
+		return this.intersectsSphere( _sphere$3 );
+
+	}
+
+	/**
+	 * Returns `true` if the given sprite is intersecting this frustum.
+	 *
+	 * @param {Sprite} sprite - The sprite to test.
+	 * @return {boolean} Whether the sprite is intersecting this frustum or not.
+	 */
+	intersectsSprite( sprite ) {
+
+		_sphere$3.center.set( 0, 0, 0 );
+
+		const offset = _defaultSpriteCenter.distanceTo( sprite.center );
+
+		_sphere$3.radius = 0.7071067811865476 + offset;
+		_sphere$3.applyMatrix4( sprite.matrixWorld );
+
+		return this.intersectsSphere( _sphere$3 );
+
+	}
+
+	/**
+	 * Returns `true` if the given bounding sphere is intersecting this frustum.
+	 *
+	 * This is a fast, conservative test that favors performance over precision. It can
+	 * report false positives for spheres that lie outside the frustum but are not separated
+	 * by a single frustum plane. It never reports false negatives, so it is safe for culling.
+	 *
+	 * @param {Sphere} sphere - The bounding sphere to test.
+	 * @return {boolean} Whether the bounding sphere is intersecting this frustum or not.
+	 */
+	intersectsSphere( sphere ) {
+
+		const planes = this.planes;
+		const center = sphere.center;
+		const negRadius = - sphere.radius;
+
+		for ( let i = 0; i < 6; i ++ ) {
+
+			const distance = planes[ i ].distanceToPoint( center );
+
+			if ( distance < negRadius ) {
+
+				return false;
+
+			}
+
+		}
+
+		return true;
+
+	}
+
+	/**
+	 * Returns `true` if the given bounding box is intersecting this frustum.
+	 *
+	 * This is a fast, conservative test that favors performance over precision. It can
+	 * report false positives for large boxes that lie outside the frustum but are not
+	 * separated by a single frustum plane. It never reports false negatives, so it is
+	 * safe for culling.
+	 *
+	 * @param {Box3} box - The bounding box to test.
+	 * @return {boolean} Whether the bounding box is intersecting this frustum or not.
+	 */
+	intersectsBox( box ) {
+
+		const planes = this.planes;
+
+		for ( let i = 0; i < 6; i ++ ) {
+
+			const plane = planes[ i ];
+
+			// corner at max distance
+
+			_vector$6.x = plane.normal.x > 0 ? box.max.x : box.min.x;
+			_vector$6.y = plane.normal.y > 0 ? box.max.y : box.min.y;
+			_vector$6.z = plane.normal.z > 0 ? box.max.z : box.min.z;
+
+			if ( plane.distanceToPoint( _vector$6 ) < 0 ) {
+
+				return false;
+
+			}
+
+		}
+
+		return true;
+
+	}
+
+	/**
+	 * Returns `true` if the given point lies within the frustum.
+	 *
+	 * @param {Vector3} point - The point to test.
+	 * @return {boolean} Whether the point lies within this frustum or not.
+	 */
+	containsPoint( point ) {
+
+		const planes = this.planes;
+
+		for ( let i = 0; i < 6; i ++ ) {
+
+			if ( planes[ i ].distanceToPoint( point ) < 0 ) {
+
+				return false;
+
+			}
+
+		}
+
+		return true;
+
+	}
+
+	/**
+	 * Returns a new frustum with copied values from this instance.
+	 *
+	 * @return {Frustum} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+}
+
+const _projScreenMatrix$1 = /*@__PURE__*/ new Matrix4();
+
+/**
+ * FrustumArray is used to determine if an object is visible in at least one camera
+ * from an array of cameras. This is particularly useful for multi-view renderers.
+*/
+class FrustumArray {
+
+	/**
+	 * Constructs a new frustum array.
+	 *
+	 */
+	constructor() {
+
+		/**
+		 * The coordinate system to use.
+		 *
+		 * @type {WebGLCoordinateSystem|WebGPUCoordinateSystem}
+		 * @default WebGLCoordinateSystem
+		 */
+		this.coordinateSystem = WebGLCoordinateSystem;
+
+		/**
+		 * A pool of frustum instances. It may hold more entries than are
+		 * currently in use; surplus instances are kept for reuse to avoid
+		 * reallocating when array cameras of different lengths are rendered.
+		 *
+		 * @private
+		 * @type {Array<Frustum>}
+		 */
+		this._frustums = [];
+
+		/**
+		 * The number of frustums in {@link FrustumArray#_frustums} that are currently
+		 * in use.
+		 *
+		 * @private
+		 * @type {number}
+		 * @default 0
+		 */
+		this._count = 0;
+
+	}
+
+	/**
+	 * Computes and caches a frustum for each camera of the given array camera.
+	 *
+	 * @param {ArrayCamera} cameraArray - The array camera whose sub-cameras define the frustums.
+	 * @return {FrustumArray} A reference to this frustum array.
+	 */
+	setFromArrayCamera( cameraArray ) {
+
+		const cameras = cameraArray.cameras;
+		const frustums = this._frustums;
+
+		for ( let i = 0; i < cameras.length; i ++ ) {
+
+			const camera = cameras[ i ];
+
+			_projScreenMatrix$1.multiplyMatrices( camera.projectionMatrix, camera.matrixWorldInverse );
+
+			if ( frustums[ i ] === undefined ) frustums[ i ] = new Frustum();
+
+			frustums[ i ].setFromProjectionMatrix( _projScreenMatrix$1, camera.coordinateSystem, camera.reversedDepth );
+
+		}
+
+		this._count = cameras.length;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if the 3D object's bounding sphere is intersecting any cached frustum.
+	 *
+	 * {@link FrustumArray#setFromArrayCamera} must be called once per render before this method.
+	 *
+	 * @param {Object3D} object - The 3D object to test.
+	 * @return {boolean} Whether the 3D object is visible in any camera.
+	 */
+	intersectsObject( object ) {
+
+		const frustums = this._frustums;
+
+		for ( let i = 0; i < this._count; i ++ ) {
+
+			if ( frustums[ i ].intersectsObject( object ) ) return true;
+
+		}
+
+		return false;
+
+	}
+
+	/**
+	 * Returns `true` if the given sprite is intersecting any cached frustum.
+	 *
+	 * {@link FrustumArray#setFromArrayCamera} must be called once per render before this method.
+	 *
+	 * @param {Sprite} sprite - The sprite to test.
+	 * @return {boolean} Whether the sprite is visible in any camera.
+	 */
+	intersectsSprite( sprite ) {
+
+		const frustums = this._frustums;
+
+		for ( let i = 0; i < this._count; i ++ ) {
+
+			if ( frustums[ i ].intersectsSprite( sprite ) ) return true;
+
+		}
+
+		return false;
+
+	}
+
+	/**
+	 * Returns `true` if the given bounding sphere is intersecting any cached frustum.
+	 *
+	 * {@link FrustumArray#setFromArrayCamera} must be called once per render before this method.
+	 *
+	 * @param {Sphere} sphere - The bounding sphere to test.
+	 * @return {boolean} Whether the sphere is visible in any camera.
+	 */
+	intersectsSphere( sphere ) {
+
+		const frustums = this._frustums;
+
+		for ( let i = 0; i < this._count; i ++ ) {
+
+			if ( frustums[ i ].intersectsSphere( sphere ) ) return true;
+
+		}
+
+		return false;
+
+	}
+
+	/**
+	 * Returns `true` if the given bounding box is intersecting any cached frustum.
+	 *
+	 * {@link FrustumArray#setFromArrayCamera} must be called once per render before this method.
+	 *
+	 * @param {Box3} box - The bounding box to test.
+	 * @return {boolean} Whether the box is visible in any camera.
+	 */
+	intersectsBox( box ) {
+
+		const frustums = this._frustums;
+
+		for ( let i = 0; i < this._count; i ++ ) {
+
+			if ( frustums[ i ].intersectsBox( box ) ) return true;
+
+		}
+
+		return false;
+
+	}
+
+	/**
+	 * Returns `true` if the given point lies within any cached frustum.
+	 *
+	 * {@link FrustumArray#setFromArrayCamera} must be called once per render before this method.
+	 *
+	 * @param {Vector3} point - The point to test.
+	 * @return {boolean} Whether the point is visible in any camera.
+	 */
+	containsPoint( point ) {
+
+		const frustums = this._frustums;
+
+		for ( let i = 0; i < this._count; i ++ ) {
+
+			if ( frustums[ i ].containsPoint( point ) ) return true;
+
+		}
+
+		return false;
+
+	}
+
+	/**
+	 * Copies the values of the given frustum array to this instance.
+	 *
+	 * @param {FrustumArray} source - The frustum array to copy.
+	 * @return {FrustumArray} A reference to this frustum array.
+	 */
+	copy( source ) {
+
+		this.coordinateSystem = source.coordinateSystem;
+
+		const frustums = this._frustums;
+		const sourceFrustums = source._frustums;
+
+		for ( let i = 0; i < source._count; i ++ ) {
+
+			if ( frustums[ i ] === undefined ) frustums[ i ] = new Frustum();
+
+			frustums[ i ].copy( sourceFrustums[ i ] );
+
+		}
+
+		this._count = source._count;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new frustum array with copied values from this instance.
+	 *
+	 * @return {FrustumArray} A clone of this instance.
+	 */
+	clone() {
+
+		return new FrustumArray().copy( this );
+
+	}
+
+}
+
+function ascIdSort( a, b ) {
+
+	return a - b;
+
+}
+
+function sortOpaque( a, b ) {
+
+	return a.z - b.z;
+
+}
+
+function sortTransparent( a, b ) {
+
+	return b.z - a.z;
+
+}
+
+class MultiDrawRenderList {
+
+	constructor() {
+
+		this.index = 0;
+		this.pool = [];
+		this.list = [];
+
+	}
+
+	push( start, count, z, index ) {
+
+		const pool = this.pool;
+		const list = this.list;
+		if ( this.index >= pool.length ) {
+
+			pool.push( {
+
+				start: -1,
+				count: -1,
+				z: -1,
+				index: -1,
+
+			} );
+
+		}
+
+		const item = pool[ this.index ];
+		list.push( item );
+		this.index ++;
+
+		item.start = start;
+		item.count = count;
+		item.z = z;
+		item.index = index;
+
+	}
+
+	reset() {
+
+		this.list.length = 0;
+		this.index = 0;
+
+	}
+
+}
+
+const _matrix$1 = /*@__PURE__*/ new Matrix4();
+const _whiteColor = /*@__PURE__*/ new Color( 1, 1, 1 );
+const _frustum = /*@__PURE__*/ new Frustum();
+const _frustumArray = /*@__PURE__*/ new FrustumArray();
+const _box$1 = /*@__PURE__*/ new Box3();
+const _sphere$2 = /*@__PURE__*/ new Sphere();
+const _vector$5 = /*@__PURE__*/ new Vector3();
+const _forward$1 = /*@__PURE__*/ new Vector3();
+const _temp = /*@__PURE__*/ new Vector3();
+const _renderList = /*@__PURE__*/ new MultiDrawRenderList();
+const _mesh = /*@__PURE__*/ new Mesh();
+const _batchIntersects = [];
+
+// copies data from attribute "src" into "target" starting at "targetOffset"
+function copyAttributeData( src, target, targetOffset = 0 ) {
+
+	const itemSize = target.itemSize;
+	if ( src.isInterleavedBufferAttribute || src.array.constructor !== target.array.constructor ) {
+
+		// use the component getters and setters if the array data cannot
+		// be copied directly
+		const vertexCount = src.count;
+		for ( let i = 0; i < vertexCount; i ++ ) {
+
+			for ( let c = 0; c < itemSize; c ++ ) {
+
+				target.setComponent( i + targetOffset, c, src.getComponent( i, c ) );
+
+			}
+
+		}
+
+	} else {
+
+		// faster copy approach using typed array set function
+		target.array.set( src.array, targetOffset * itemSize );
+
+	}
+
+	target.needsUpdate = true;
+
+}
+
+// safely copies array contents to a potentially smaller array
+function copyArrayContents( src, target ) {
+
+	if ( src.constructor !== target.constructor ) {
+
+		// if arrays are of a different type (eg due to index size increasing) then data must be per-element copied
+		const len = Math.min( src.length, target.length );
+		for ( let i = 0; i < len; i ++ ) {
+
+			target[ i ] = src[ i ];
+
+		}
+
+	} else {
+
+		// if the arrays use the same data layout we can use a fast block copy
+		const len = Math.min( src.length, target.length );
+		target.set( new src.constructor( src.buffer, 0, len ) );
+
+	}
+
+}
+
+/**
+ * A special version of a mesh with multi draw batch rendering support. Use
+ * this class if you have to render a large number of objects with the same
+ * material but with different geometries or world transformations. The usage of
+ * `BatchedMesh` will help you to reduce the number of draw calls and thus improve the overall
+ * rendering performance in your application.
+ *
+ * ```js
+ * const box = new THREE.BoxGeometry( 1, 1, 1 );
+ * const sphere = new THREE.SphereGeometry( 1, 12, 12 );
+ * const material = new THREE.MeshBasicMaterial( { color: 0x00ff00 } );
+ *
+ * // initialize and add geometries into the batched mesh
+ * const batchedMesh = new BatchedMesh( 10, 5000, 10000, material );
+ * const boxGeometryId = batchedMesh.addGeometry( box );
+ * const sphereGeometryId = batchedMesh.addGeometry( sphere );
+ *
+ * // create instances of those geometries
+ * const boxInstancedId1 = batchedMesh.addInstance( boxGeometryId );
+ * const boxInstancedId2 = batchedMesh.addInstance( boxGeometryId );
+ *
+ * const sphereInstancedId1 = batchedMesh.addInstance( sphereGeometryId );
+ * const sphereInstancedId2 = batchedMesh.addInstance( sphereGeometryId );
+ *
+ * // position the geometries
+ * batchedMesh.setMatrixAt( boxInstancedId1, boxMatrix1 );
+ * batchedMesh.setMatrixAt( boxInstancedId2, boxMatrix2 );
+ *
+ * batchedMesh.setMatrixAt( sphereInstancedId1, sphereMatrix1 );
+ * batchedMesh.setMatrixAt( sphereInstancedId2, sphereMatrix2 );
+ *
+ * scene.add( batchedMesh );
+ * ```
+ *
+ * @augments Mesh
+ */
+class BatchedMesh extends Mesh {
+
+	/**
+	 * Constructs a new batched mesh.
+	 *
+	 * @param {number} maxInstanceCount - The maximum number of individual instances planned to be added and rendered.
+	 * @param {number} maxVertexCount - The maximum number of vertices to be used by all unique geometries.
+	 * @param {number} [maxIndexCount=maxVertexCount*2] - The maximum number of indices to be used by all unique geometries
+	 * @param {Material|Array<Material>} [material] - The mesh material.
+	 */
+	constructor( maxInstanceCount, maxVertexCount, maxIndexCount = maxVertexCount * 2, material ) {
+
+		super( new BufferGeometry(), material );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isBatchedMesh = true;
+
+		/**
+		 * When set ot `true`, the individual objects of a batch are frustum culled.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.perObjectFrustumCulled = true;
+
+		/**
+		 * When set to `true`, the individual objects of a batch are sorted to improve overdraw-related artifacts.
+		 * If the material is marked as "transparent" objects are rendered back to front and if not then they are
+		 * rendered front to back.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.sortObjects = true;
+
+		/**
+		 * The bounding box of the batched mesh. Can be computed via {@link BatchedMesh#computeBoundingBox}.
+		 *
+		 * @type {?Box3}
+		 * @default null
+		 */
+		this.boundingBox = null;
+
+		/**
+		 * The bounding sphere of the batched mesh. Can be computed via {@link BatchedMesh#computeBoundingSphere}.
+		 *
+		 * @type {?Sphere}
+		 * @default null
+		 */
+		this.boundingSphere = null;
+
+		/**
+		 * Takes a sort a function that is run before render. The function takes a list of instances to
+		 * sort and a camera. The objects in the list include a "z" field to perform a depth-ordered
+		 * sort with.
+		 *
+		 * @type {?Function}
+		 * @default null
+		 */
+		this.customSort = null;
+
+		// stores visible, active, and geometry id per instance and reserved buffer ranges for geometries
+		this._instanceInfo = [];
+		this._geometryInfo = [];
+
+		// instance, geometry ids that have been set as inactive, and are available to be overwritten
+		this._availableInstanceIds = [];
+		this._availableGeometryIds = [];
+
+		// used to track where the next point is that geometry should be inserted
+		this._nextIndexStart = 0;
+		this._nextVertexStart = 0;
+		this._geometryCount = 0;
+
+		// flags
+		this._visibilityChanged = true;
+		this._geometryInitialized = false;
+
+		// cached user options
+		this._maxInstanceCount = maxInstanceCount;
+		this._maxVertexCount = maxVertexCount;
+		this._maxIndexCount = maxIndexCount;
+
+		// buffers for multi draw
+		this._multiDrawCounts = new Int32Array( maxInstanceCount );
+		this._multiDrawStarts = new Int32Array( maxInstanceCount );
+		this._multiDrawCount = 0;
+		this._multiDrawBytesPerElement = 1;
+
+		// Local matrix per geometry by using data texture
+		this._matricesTexture = null;
+		this._indirectTexture = null;
+		this._colorsTexture = null;
+
+		this._initMatricesTexture();
+		this._initIndirectTexture();
+
+	}
+
+	/**
+	 * The maximum number of individual instances that can be stored in the batch.
+	 *
+	 * @type {number}
+	 * @readonly
+	 */
+	get maxInstanceCount() {
+
+		return this._maxInstanceCount;
+
+	}
+
+	/**
+	 * The instance count.
+	 *
+	 * @type {number}
+	 * @readonly
+	 */
+	get instanceCount() {
+
+		return this._instanceInfo.length - this._availableInstanceIds.length;
+
+	}
+
+	/**
+	 * The number of unused vertices.
+	 *
+	 * @type {number}
+	 * @readonly
+	 */
+	get unusedVertexCount() {
+
+		return this._maxVertexCount - this._nextVertexStart;
+
+	}
+
+	/**
+	 * The number of unused indices.
+	 *
+	 * @type {number}
+	 * @readonly
+	 */
+	get unusedIndexCount() {
+
+		return this._maxIndexCount - this._nextIndexStart;
+
+	}
+
+	_initMatricesTexture() {
+
+		// layout (1 matrix = 4 pixels)
+		//      RGBA RGBA RGBA RGBA (=> column1, column2, column3, column4)
+		//  with  8x8  pixel texture max   16 matrices * 4 pixels =  (8 * 8)
+		//       16x16 pixel texture max   64 matrices * 4 pixels = (16 * 16)
+		//       32x32 pixel texture max  256 matrices * 4 pixels = (32 * 32)
+		//       64x64 pixel texture max 1024 matrices * 4 pixels = (64 * 64)
+
+		let size = Math.sqrt( this._maxInstanceCount * 4 ); // 4 pixels needed for 1 matrix
+		size = Math.ceil( size / 4 ) * 4;
+		size = Math.max( size, 4 );
+
+		const matricesArray = new Float32Array( size * size * 4 ); // 4 floats per RGBA pixel
+		const matricesTexture = new DataTexture( matricesArray, size, size, RGBAFormat, FloatType );
+
+		this._matricesTexture = matricesTexture;
+
+	}
+
+	_initIndirectTexture() {
+
+		let size = Math.sqrt( this._maxInstanceCount );
+		size = Math.ceil( size );
+
+		const indirectArray = new Uint32Array( size * size );
+		const indirectTexture = new DataTexture( indirectArray, size, size, RedIntegerFormat, UnsignedIntType );
+
+		this._indirectTexture = indirectTexture;
+
+	}
+
+	_initColorsTexture() {
+
+		let size = Math.sqrt( this._maxInstanceCount );
+		size = Math.ceil( size );
+
+		// 4 floats per RGBA pixel initialized to white
+		const colorsArray = new Float32Array( size * size * 4 ).fill( 1 );
+		const colorsTexture = new DataTexture( colorsArray, size, size, RGBAFormat, FloatType );
+		colorsTexture.colorSpace = ColorManagement.workingColorSpace;
+
+		this._colorsTexture = colorsTexture;
+
+	}
+
+	_initializeGeometry( reference ) {
+
+		const geometry = this.geometry;
+		const maxVertexCount = this._maxVertexCount;
+		const maxIndexCount = this._maxIndexCount;
+		if ( this._geometryInitialized === false ) {
+
+			for ( const attributeName in reference.attributes ) {
+
+				const srcAttribute = reference.getAttribute( attributeName );
+				const { array, itemSize, normalized } = srcAttribute;
+
+				const dstArray = new array.constructor( maxVertexCount * itemSize );
+				const dstAttribute = new BufferAttribute( dstArray, itemSize, normalized );
+
+				geometry.setAttribute( attributeName, dstAttribute );
+
+			}
+
+			if ( reference.getIndex() !== null ) {
+
+				// Reserve last u16 index for primitive restart.
+				const indexArray = maxVertexCount > 65535
+					? new Uint32Array( maxIndexCount )
+					: new Uint16Array( maxIndexCount );
+
+				geometry.setIndex( new BufferAttribute( indexArray, 1 ) );
+
+			}
+
+			this._geometryInitialized = true;
+
+		}
+
+	}
+
+	// Make sure the geometry is compatible with the existing combined geometry attributes
+	_validateGeometry( geometry ) {
+
+		// check to ensure the geometries are using consistent attributes and indices
+		const batchGeometry = this.geometry;
+		if ( Boolean( geometry.getIndex() ) !== Boolean( batchGeometry.getIndex() ) ) {
+
+			throw new Error( 'THREE.BatchedMesh: All geometries must consistently have "index".' );
+
+		}
+
+		for ( const attributeName in batchGeometry.attributes ) {
+
+			if ( ! geometry.hasAttribute( attributeName ) ) {
+
+				throw new Error( `THREE.BatchedMesh: Added geometry missing "${ attributeName }". All geometries must have consistent attributes.` );
+
+			}
+
+			const srcAttribute = geometry.getAttribute( attributeName );
+			const dstAttribute = batchGeometry.getAttribute( attributeName );
+			if ( srcAttribute.itemSize !== dstAttribute.itemSize || srcAttribute.normalized !== dstAttribute.normalized ) {
+
+				throw new Error( 'THREE.BatchedMesh: All attributes must have a consistent itemSize and normalized value.' );
+
+			}
+
+		}
+
+	}
+
+	/**
+	 * Validates the instance defined by the given ID.
+	 *
+	 * @param {number} instanceId - The instance to validate.
+	 */
+	validateInstanceId( instanceId ) {
+
+		const instanceInfo = this._instanceInfo;
+		if ( instanceId < 0 || instanceId >= instanceInfo.length || instanceInfo[ instanceId ].active === false ) {
+
+			throw new Error( `THREE.BatchedMesh: Invalid instanceId ${instanceId}. Instance is either out of range or has been deleted.` );
+
+		}
+
+	}
+
+	/**
+	 * Validates the geometry defined by the given ID.
+	 *
+	 * @param {number} geometryId - The geometry to validate.
+	 */
+	validateGeometryId( geometryId ) {
+
+		const geometryInfoList = this._geometryInfo;
+		if ( geometryId < 0 || geometryId >= geometryInfoList.length || geometryInfoList[ geometryId ].active === false ) {
+
+			throw new Error( `THREE.BatchedMesh: Invalid geometryId ${geometryId}. Geometry is either out of range or has been deleted.` );
+
+		}
+
+	}
+
+	/**
+	 * Takes a sort a function that is run before render. The function takes a list of instances to
+	 * sort and a camera. The objects in the list include a "z" field to perform a depth-ordered sort with.
+	 *
+	 * @param {Function} func - The custom sort function.
+	 * @return {BatchedMesh} A reference to this batched mesh.
+	 */
+	setCustomSort( func ) {
+
+		this.customSort = func;
+		return this;
+
+	}
+
+	/**
+	 * Computes the bounding box, updating {@link BatchedMesh#boundingBox}.
+	 * Bounding boxes aren't computed by default. They need to be explicitly computed,
+	 * otherwise they are `null`.
+	 */
+	computeBoundingBox() {
+
+		if ( this.boundingBox === null ) {
+
+			this.boundingBox = new Box3();
+
+		}
+
+		const boundingBox = this.boundingBox;
+		const instanceInfo = this._instanceInfo;
+
+		boundingBox.makeEmpty();
+		for ( let i = 0, l = instanceInfo.length; i < l; i ++ ) {
+
+			if ( instanceInfo[ i ].active === false ) continue;
+
+			const geometryId = instanceInfo[ i ].geometryIndex;
+			this.getMatrixAt( i, _matrix$1 );
+			this.getBoundingBoxAt( geometryId, _box$1 ).applyMatrix4( _matrix$1 );
+			boundingBox.union( _box$1 );
+
+		}
+
+	}
+
+	/**
+	 * Computes the bounding sphere, updating {@link BatchedMesh#boundingSphere}.
+	 * Bounding spheres aren't computed by default. They need to be explicitly computed,
+	 * otherwise they are `null`.
+	 */
+	computeBoundingSphere() {
+
+		if ( this.boundingSphere === null ) {
+
+			this.boundingSphere = new Sphere();
+
+		}
+
+		const boundingSphere = this.boundingSphere;
+		const instanceInfo = this._instanceInfo;
+
+		boundingSphere.makeEmpty();
+		for ( let i = 0, l = instanceInfo.length; i < l; i ++ ) {
+
+			if ( instanceInfo[ i ].active === false ) continue;
+
+			const geometryId = instanceInfo[ i ].geometryIndex;
+			this.getMatrixAt( i, _matrix$1 );
+			this.getBoundingSphereAt( geometryId, _sphere$2 ).applyMatrix4( _matrix$1 );
+			boundingSphere.union( _sphere$2 );
+
+		}
+
+	}
+
+	/**
+	 * Adds a new instance to the batch using the geometry of the given ID and returns
+	 * a new id referring to the new instance to be used by other functions.
+	 *
+	 * @param {number} geometryId - The ID of a previously added geometry via {@link BatchedMesh#addGeometry}.
+	 * @return {number} The instance ID.
+	 */
+	addInstance( geometryId ) {
+
+		const atCapacity = this._instanceInfo.length >= this.maxInstanceCount;
+
+		// ensure we're not over geometry
+		if ( atCapacity && this._availableInstanceIds.length === 0 ) {
+
+			throw new Error( 'THREE.BatchedMesh: Maximum item count reached.' );
+
+		}
+
+		const instanceInfo = {
+			visible: true,
+			active: true,
+			geometryIndex: geometryId,
+		};
+
+		let drawId = null;
+
+		// Prioritize using previously freed instance ids
+		if ( this._availableInstanceIds.length > 0 ) {
+
+			this._availableInstanceIds.sort( ascIdSort );
+
+			drawId = this._availableInstanceIds.shift();
+			this._instanceInfo[ drawId ] = instanceInfo;
+
+		} else {
+
+			drawId = this._instanceInfo.length;
+			this._instanceInfo.push( instanceInfo );
+
+		}
+
+		const matricesTexture = this._matricesTexture;
+		_matrix$1.identity().toArray( matricesTexture.image.data, drawId * 16 );
+		matricesTexture.needsUpdate = true;
+
+		const colorsTexture = this._colorsTexture;
+		if ( colorsTexture ) {
+
+			_whiteColor.toArray( colorsTexture.image.data, drawId * 4 );
+			colorsTexture.needsUpdate = true;
+
+		}
+
+		this._visibilityChanged = true;
+		return drawId;
+
+	}
+
+	/**
+	 * Adds the given geometry to the batch and returns the associated
+	 * geometry id referring to it to be used in other functions.
+	 *
+	 * @param {BufferGeometry} geometry - The geometry to add.
+	 * @param {number} [reservedVertexCount=-1] - Optional parameter specifying the amount of
+	 * vertex buffer space to reserve for the added geometry. This is necessary if it is planned
+	 * to set a new geometry at this index at a later time that is larger than the original geometry.
+	 * Defaults to the length of the given geometry vertex buffer.
+	 * @param {number} [reservedIndexCount=-1] - Optional parameter specifying the amount of index
+	 * buffer space to reserve for the added geometry. This is necessary if it is planned to set a
+	 * new geometry at this index at a later time that is larger than the original geometry. Defaults to
+	 * the length of the given geometry index buffer.
+	 * @return {number} The geometry ID.
+	 */
+	addGeometry( geometry, reservedVertexCount = -1, reservedIndexCount = -1 ) {
+
+		this._initializeGeometry( geometry );
+
+		this._validateGeometry( geometry );
+
+		const geometryInfo = {
+			// geometry information
+			vertexStart: -1,
+			vertexCount: -1,
+			reservedVertexCount: -1,
+
+			indexStart: -1,
+			indexCount: -1,
+			reservedIndexCount: -1,
+
+			// draw range information
+			start: -1,
+			count: -1,
+
+			// state
+			boundingBox: null,
+			boundingSphere: null,
+			active: true,
+		};
+
+		const geometryInfoList = this._geometryInfo;
+		geometryInfo.vertexStart = this._nextVertexStart;
+		geometryInfo.reservedVertexCount = reservedVertexCount === -1 ? geometry.getAttribute( 'position' ).count : reservedVertexCount;
+
+		const index = geometry.getIndex();
+		const hasIndex = index !== null;
+		if ( hasIndex ) {
+
+			geometryInfo.indexStart = this._nextIndexStart;
+			geometryInfo.reservedIndexCount = reservedIndexCount === -1 ? index.count : reservedIndexCount;
+
+		}
+
+		if (
+			geometryInfo.indexStart !== -1 &&
+			geometryInfo.indexStart + geometryInfo.reservedIndexCount > this._maxIndexCount ||
+			geometryInfo.vertexStart + geometryInfo.reservedVertexCount > this._maxVertexCount
+		) {
+
+			throw new Error( 'THREE.BatchedMesh: Reserved space request exceeds the maximum buffer size.' );
+
+		}
+
+		// update id
+		let geometryId;
+		if ( this._availableGeometryIds.length > 0 ) {
+
+			this._availableGeometryIds.sort( ascIdSort );
+
+			geometryId = this._availableGeometryIds.shift();
+			geometryInfoList[ geometryId ] = geometryInfo;
+
+
+		} else {
+
+			geometryId = this._geometryCount;
+			this._geometryCount ++;
+			geometryInfoList.push( geometryInfo );
+
+		}
+
+		// update the geometry
+		this.setGeometryAt( geometryId, geometry );
+
+		// increment the next geometry position
+		this._nextIndexStart = geometryInfo.indexStart + geometryInfo.reservedIndexCount;
+		this._nextVertexStart = geometryInfo.vertexStart + geometryInfo.reservedVertexCount;
+
+		return geometryId;
+
+	}
+
+	/**
+	 * Replaces the geometry at the given ID with the provided geometry. Throws an error if there
+	 * is not enough space reserved for geometry. Calling this will change all instances that are
+	 * rendering that geometry.
+	 *
+	 * @param {number} geometryId - The ID of the geometry that should be replaced with the given geometry.
+	 * @param {BufferGeometry} geometry - The new geometry.
+	 * @return {number} The geometry ID.
+	 */
+	setGeometryAt( geometryId, geometry ) {
+
+		if ( geometryId >= this._geometryCount ) {
+
+			throw new Error( 'THREE.BatchedMesh: Maximum geometry count reached.' );
+
+		}
+
+		this._validateGeometry( geometry );
+
+		const batchGeometry = this.geometry;
+		const hasIndex = batchGeometry.getIndex() !== null;
+		const dstIndex = batchGeometry.getIndex();
+		const srcIndex = geometry.getIndex();
+		const geometryInfo = this._geometryInfo[ geometryId ];
+		if (
+			hasIndex &&
+			srcIndex.count > geometryInfo.reservedIndexCount ||
+			geometry.attributes.position.count > geometryInfo.reservedVertexCount
+		) {
+
+			throw new Error( 'THREE.BatchedMesh: Reserved space not large enough for provided geometry.' );
+
+		}
+
+		// copy geometry buffer data over
+		const vertexStart = geometryInfo.vertexStart;
+		const reservedVertexCount = geometryInfo.reservedVertexCount;
+		geometryInfo.vertexCount = geometry.getAttribute( 'position' ).count;
+
+		for ( const attributeName in batchGeometry.attributes ) {
+
+			// copy attribute data
+			const srcAttribute = geometry.getAttribute( attributeName );
+			const dstAttribute = batchGeometry.getAttribute( attributeName );
+			copyAttributeData( srcAttribute, dstAttribute, vertexStart );
+
+			// fill the rest in with zeroes
+			const itemSize = srcAttribute.itemSize;
+			for ( let i = srcAttribute.count, l = reservedVertexCount; i < l; i ++ ) {
+
+				const index = vertexStart + i;
+				for ( let c = 0; c < itemSize; c ++ ) {
+
+					dstAttribute.setComponent( index, c, 0 );
+
+				}
+
+			}
+
+			dstAttribute.needsUpdate = true;
+			dstAttribute.addUpdateRange( vertexStart * itemSize, reservedVertexCount * itemSize );
+
+		}
+
+		// copy index
+		if ( hasIndex ) {
+
+			const indexStart = geometryInfo.indexStart;
+			const reservedIndexCount = geometryInfo.reservedIndexCount;
+			geometryInfo.indexCount = geometry.getIndex().count;
+
+			// copy index data over
+			for ( let i = 0; i < srcIndex.count; i ++ ) {
+
+				dstIndex.setX( indexStart + i, vertexStart + srcIndex.getX( i ) );
+
+			}
+
+			// fill the rest in with zeroes
+			for ( let i = srcIndex.count, l = reservedIndexCount; i < l; i ++ ) {
+
+				dstIndex.setX( indexStart + i, vertexStart );
+
+			}
+
+			dstIndex.needsUpdate = true;
+			dstIndex.addUpdateRange( indexStart, geometryInfo.reservedIndexCount );
+
+		}
+
+		// update the draw range
+		geometryInfo.start = hasIndex ? geometryInfo.indexStart : geometryInfo.vertexStart;
+		geometryInfo.count = hasIndex ? geometryInfo.indexCount : geometryInfo.vertexCount;
+
+		// store the bounding boxes
+		geometryInfo.boundingBox = null;
+		if ( geometry.boundingBox !== null ) {
+
+			geometryInfo.boundingBox = geometry.boundingBox.clone();
+
+		}
+
+		geometryInfo.boundingSphere = null;
+		if ( geometry.boundingSphere !== null ) {
+
+			geometryInfo.boundingSphere = geometry.boundingSphere.clone();
+
+		}
+
+		this._visibilityChanged = true;
+		return geometryId;
+
+	}
+
+	/**
+	 * Deletes the geometry defined by the given ID from this batch. Any instances referencing
+	 * this geometry will also be removed as a side effect.
+	 *
+	 * @param {number} geometryId - The ID of the geometry to remove from the batch.
+	 * @return {BatchedMesh} A reference to this batched mesh.
+	 */
+	deleteGeometry( geometryId ) {
+
+		const geometryInfoList = this._geometryInfo;
+		if ( geometryId >= geometryInfoList.length || geometryInfoList[ geometryId ].active === false ) {
+
+			return this;
+
+		}
+
+		// delete any instances associated with this geometry
+		const instanceInfo = this._instanceInfo;
+		for ( let i = 0, l = instanceInfo.length; i < l; i ++ ) {
+
+			if ( instanceInfo[ i ].active && instanceInfo[ i ].geometryIndex === geometryId ) {
+
+				this.deleteInstance( i );
+
+			}
+
+		}
+
+		geometryInfoList[ geometryId ].active = false;
+		this._availableGeometryIds.push( geometryId );
+		this._visibilityChanged = true;
+
+		return this;
+
+	}
+
+	/**
+	 * Deletes an existing instance from the batch using the given ID.
+	 *
+	 * @param {number} instanceId - The ID of the instance to remove from the batch.
+	 * @return {BatchedMesh} A reference to this batched mesh.
+	 */
+	deleteInstance( instanceId ) {
+
+		this.validateInstanceId( instanceId );
+
+		this._instanceInfo[ instanceId ].active = false;
+		this._availableInstanceIds.push( instanceId );
+		this._visibilityChanged = true;
+
+		return this;
+
+	}
+
+	/**
+	 * Repacks the sub geometries in BatchedMesh to remove any unused space remaining from
+	 * previously deleted geometry, freeing up space to add new geometry.
+	 *
+	 * @return {BatchedMesh} A reference to this batched mesh.
+	 */
+	optimize() {
+
+		// track the next indices to copy data to
+		let nextVertexStart = 0;
+		let nextIndexStart = 0;
+
+		// Iterate over all geometry ranges in order sorted from earliest in the geometry buffer to latest
+		// in the geometry buffer. Because draw range objects can be reused there is no guarantee of their order.
+		const geometryInfoList = this._geometryInfo;
+		const indices = geometryInfoList
+			.map( ( e, i ) => i )
+			.sort( ( a, b ) => {
+
+				return geometryInfoList[ a ].vertexStart - geometryInfoList[ b ].vertexStart;
+
+			} );
+
+		const geometry = this.geometry;
+		for ( let i = 0, l = geometryInfoList.length; i < l; i ++ ) {
+
+			// if a geometry range is inactive then don't copy anything
+			const index = indices[ i ];
+			const geometryInfo = geometryInfoList[ index ];
+			if ( geometryInfo.active === false ) {
+
+				continue;
+
+			}
+
+			// if a geometry contains an index buffer then shift it, as well
+			if ( geometry.index !== null ) {
+
+				if ( geometryInfo.indexStart !== nextIndexStart ) {
+
+					const { indexStart, vertexStart, reservedIndexCount } = geometryInfo;
+					const index = geometry.index;
+					const array = index.array;
+
+					// shift the index pointers based on how the vertex data will shift
+					// adjusting the index must happen first so the original vertex start value is available
+					const elementDelta = nextVertexStart - vertexStart;
+					for ( let j = indexStart; j < indexStart + reservedIndexCount; j ++ ) {
+
+						array[ j ] = array[ j ] + elementDelta;
+
+					}
+
+					index.array.copyWithin( nextIndexStart, indexStart, indexStart + reservedIndexCount );
+					index.addUpdateRange( nextIndexStart, reservedIndexCount );
+					index.needsUpdate = true;
+
+					geometryInfo.indexStart = nextIndexStart;
+
+				}
+
+				nextIndexStart += geometryInfo.reservedIndexCount;
+
+			}
+
+			// if a geometry needs to be moved then copy attribute data to overwrite unused space
+			if ( geometryInfo.vertexStart !== nextVertexStart ) {
+
+				const { vertexStart, reservedVertexCount } = geometryInfo;
+				const attributes = geometry.attributes;
+				for ( const key in attributes ) {
+
+					const attribute = attributes[ key ];
+					const { array, itemSize } = attribute;
+					array.copyWithin( nextVertexStart * itemSize, vertexStart * itemSize, ( vertexStart + reservedVertexCount ) * itemSize );
+					attribute.addUpdateRange( nextVertexStart * itemSize, reservedVertexCount * itemSize );
+					attribute.needsUpdate = true;
+
+				}
+
+				geometryInfo.vertexStart = nextVertexStart;
+
+			}
+
+			nextVertexStart += geometryInfo.reservedVertexCount;
+			geometryInfo.start = geometry.index ? geometryInfo.indexStart : geometryInfo.vertexStart;
+
+		}
+
+		this._nextIndexStart = nextIndexStart;
+		this._nextVertexStart = nextVertexStart;
+		this._visibilityChanged = true;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the bounding box for the given geometry.
+	 *
+	 * @param {number} geometryId - The ID of the geometry to return the bounding box for.
+	 * @param {Box3} target - The target object that is used to store the method's result.
+	 * @return {?Box3} The geometry's bounding box. Returns `null` if no geometry has been found for the given ID.
+	 */
+	getBoundingBoxAt( geometryId, target ) {
+
+		if ( geometryId >= this._geometryCount ) {
+
+			return null;
+
+		}
+
+		// compute bounding box
+		const geometry = this.geometry;
+		const geometryInfo = this._geometryInfo[ geometryId ];
+		if ( geometryInfo.boundingBox === null ) {
+
+			const box = new Box3();
+			const index = geometry.index;
+			const position = geometry.attributes.position;
+			for ( let i = geometryInfo.start, l = geometryInfo.start + geometryInfo.count; i < l; i ++ ) {
+
+				let iv = i;
+				if ( index ) {
+
+					iv = index.getX( iv );
+
+				}
+
+				box.expandByPoint( _vector$5.fromBufferAttribute( position, iv ) );
+
+			}
+
+			geometryInfo.boundingBox = box;
+
+		}
+
+		target.copy( geometryInfo.boundingBox );
+		return target;
+
+	}
+
+	/**
+	 * Returns the bounding sphere for the given geometry.
+	 *
+	 * @param {number} geometryId - The ID of the geometry to return the bounding sphere for.
+	 * @param {Sphere} target - The target object that is used to store the method's result.
+	 * @return {?Sphere} The geometry's bounding sphere. Returns `null` if no geometry has been found for the given ID.
+	 */
+	getBoundingSphereAt( geometryId, target ) {
+
+		if ( geometryId >= this._geometryCount ) {
+
+			return null;
+
+		}
+
+		// compute bounding sphere
+		const geometry = this.geometry;
+		const geometryInfo = this._geometryInfo[ geometryId ];
+		if ( geometryInfo.boundingSphere === null ) {
+
+			const sphere = new Sphere();
+			this.getBoundingBoxAt( geometryId, _box$1 );
+			_box$1.getCenter( sphere.center );
+
+			const index = geometry.index;
+			const position = geometry.attributes.position;
+
+			let maxRadiusSq = 0;
+			for ( let i = geometryInfo.start, l = geometryInfo.start + geometryInfo.count; i < l; i ++ ) {
+
+				let iv = i;
+				if ( index ) {
+
+					iv = index.getX( iv );
+
+				}
+
+				_vector$5.fromBufferAttribute( position, iv );
+				maxRadiusSq = Math.max( maxRadiusSq, sphere.center.distanceToSquared( _vector$5 ) );
+
+			}
+
+			sphere.radius = Math.sqrt( maxRadiusSq );
+			geometryInfo.boundingSphere = sphere;
+
+		}
+
+		target.copy( geometryInfo.boundingSphere );
+		return target;
+
+	}
+
+	/**
+	 * Sets the given local transformation matrix to the defined instance.
+	 * Negatively scaled matrices are not supported.
+	 *
+	 * @param {number} instanceId - The ID of an instance to set the matrix of.
+	 * @param {Matrix4} matrix - A 4x4 matrix representing the local transformation of a single instance.
+	 * @return {BatchedMesh} A reference to this batched mesh.
+	 */
+	setMatrixAt( instanceId, matrix ) {
+
+		this.validateInstanceId( instanceId );
+
+		const matricesTexture = this._matricesTexture;
+		const matricesArray = this._matricesTexture.image.data;
+		matrix.toArray( matricesArray, instanceId * 16 );
+		matricesTexture.needsUpdate = true;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the local transformation matrix of the defined instance.
+	 *
+	 * @param {number} instanceId - The ID of an instance to get the matrix of.
+	 * @param {Matrix4} matrix - The target object that is used to store the method's result.
+	 * @return {Matrix4} The instance's local transformation matrix.
+	 */
+	getMatrixAt( instanceId, matrix ) {
+
+		this.validateInstanceId( instanceId );
+		return matrix.fromArray( this._matricesTexture.image.data, instanceId * 16 );
+
+	}
+
+	/**
+	 * Sets the given color to the defined instance.
+	 *
+	 * @param {number} instanceId - The ID of an instance to set the color of.
+	 * @param {Color|Vector4} color - The color to set the instance to. Use a `Vector4` to also define alpha.
+	 * @return {BatchedMesh} A reference to this batched mesh.
+	 */
+	setColorAt( instanceId, color ) {
+
+		this.validateInstanceId( instanceId );
+
+		if ( this._colorsTexture === null ) {
+
+			this._initColorsTexture();
+
+		}
+
+		color.toArray( this._colorsTexture.image.data, instanceId * 4 );
+		this._colorsTexture.needsUpdate = true;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the color of the defined instance.
+	 *
+	 * @param {number} instanceId - The ID of an instance to get the color of.
+	 * @param {Color|Vector4} color - The target object that is used to store the method's result.
+	 * @return {Color|Vector4} The instance's color.  Use a `Vector4` to also retrieve alpha.
+	 */
+	getColorAt( instanceId, color ) {
+
+		this.validateInstanceId( instanceId );
+		if ( this._colorsTexture === null ) {
+
+			if ( color.isVector4 ) {
+
+				return color.set( 1, 1, 1, 1 );
+
+			} else {
+
+				return color.setRGB( 1, 1, 1 );
+
+			}
+
+		} else {
+
+			return color.fromArray( this._colorsTexture.image.data, instanceId * 4 );
+
+		}
+
+	}
+
+	/**
+	 * Sets the visibility of the instance.
+	 *
+	 * @param {number} instanceId - The id of the instance to set the visibility of.
+	 * @param {boolean} visible - Whether the instance is visible or not.
+	 * @return {BatchedMesh} A reference to this batched mesh.
+	 */
+	setVisibleAt( instanceId, visible ) {
+
+		this.validateInstanceId( instanceId );
+
+		if ( this._instanceInfo[ instanceId ].visible === visible ) {
+
+			return this;
+
+		}
+
+		this._instanceInfo[ instanceId ].visible = visible;
+		this._visibilityChanged = true;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the visibility state of the defined instance.
+	 *
+	 * @param {number} instanceId - The ID of an instance to get the visibility state of.
+	 * @return {boolean} Whether the instance is visible or not.
+	 */
+	getVisibleAt( instanceId ) {
+
+		this.validateInstanceId( instanceId );
+
+		return this._instanceInfo[ instanceId ].visible;
+
+	}
+
+	/**
+	 * Sets the geometry ID of the instance at the given index.
+	 *
+	 * @param {number} instanceId - The ID of the instance to set the geometry ID of.
+	 * @param {number} geometryId - The geometry ID to be use by the instance.
+	 * @return {BatchedMesh} A reference to this batched mesh.
+	 */
+	setGeometryIdAt( instanceId, geometryId ) {
+
+		this.validateInstanceId( instanceId );
+		this.validateGeometryId( geometryId );
+
+		this._instanceInfo[ instanceId ].geometryIndex = geometryId;
+		this._visibilityChanged = true;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the geometry ID of the defined instance.
+	 *
+	 * @param {number} instanceId - The ID of an instance to get the geometry ID of.
+	 * @return {number} The instance's geometry ID.
+	 */
+	getGeometryIdAt( instanceId ) {
+
+		this.validateInstanceId( instanceId );
+
+		return this._instanceInfo[ instanceId ].geometryIndex;
+
+	}
+
+	/**
+	 * Get the range representing the subset of triangles related to the attached geometry,
+	 * indicating the starting offset and count, or `null` if invalid.
+	 *
+	 * @param {number} geometryId - The id of the geometry to get the range of.
+	 * @param {Object} [target] - The target object that is used to store the method's result.
+	 * @return {{
+	 * 	vertexStart:number,vertexCount:number,reservedVertexCount:number,
+	 * 	indexStart:number,indexCount:number,reservedIndexCount:number,
+	 * 	start:number,count:number
+	 * }} The result object with range data.
+	 */
+	getGeometryRangeAt( geometryId, target = {} ) {
+
+		this.validateGeometryId( geometryId );
+
+		const geometryInfo = this._geometryInfo[ geometryId ];
+		target.vertexStart = geometryInfo.vertexStart;
+		target.vertexCount = geometryInfo.vertexCount;
+		target.reservedVertexCount = geometryInfo.reservedVertexCount;
+
+		target.indexStart = geometryInfo.indexStart;
+		target.indexCount = geometryInfo.indexCount;
+		target.reservedIndexCount = geometryInfo.reservedIndexCount;
+
+		target.start = geometryInfo.start;
+		target.count = geometryInfo.count;
+
+		return target;
+
+	}
+
+	/**
+	 * Resizes the necessary buffers to support the provided number of instances.
+	 * If the provided arguments shrink the number of instances but there are not enough
+	 * unused Ids at the end of the list then an error is thrown.
+	 *
+	 * @param {number} maxInstanceCount - The max number of individual instances that can be added and rendered by the batch.
+	*/
+	setInstanceCount( maxInstanceCount ) {
+
+		// shrink the available instances as much as possible
+		const availableInstanceIds = this._availableInstanceIds;
+		const instanceInfo = this._instanceInfo;
+		availableInstanceIds.sort( ascIdSort );
+		while ( availableInstanceIds[ availableInstanceIds.length - 1 ] === instanceInfo.length - 1 ) {
+
+			instanceInfo.pop();
+			availableInstanceIds.pop();
+
+		}
+
+		// throw an error if it can't be shrunk to the desired size
+		if ( maxInstanceCount < instanceInfo.length ) {
+
+			throw new Error( `THREE.BatchedMesh: Instance ids outside the range ${ maxInstanceCount } are being used. Cannot shrink instance count.` );
+
+		}
+
+		// copy the multi draw counts
+		const multiDrawCounts = new Int32Array( maxInstanceCount );
+		const multiDrawStarts = new Int32Array( maxInstanceCount );
+		copyArrayContents( this._multiDrawCounts, multiDrawCounts );
+		copyArrayContents( this._multiDrawStarts, multiDrawStarts );
+
+		this._multiDrawCounts = multiDrawCounts;
+		this._multiDrawStarts = multiDrawStarts;
+		this._maxInstanceCount = maxInstanceCount;
+
+		// update texture data for instance sampling
+		const indirectTexture = this._indirectTexture;
+		const matricesTexture = this._matricesTexture;
+		const colorsTexture = this._colorsTexture;
+
+		indirectTexture.dispose();
+		this._initIndirectTexture();
+		copyArrayContents( indirectTexture.image.data, this._indirectTexture.image.data );
+
+		matricesTexture.dispose();
+		this._initMatricesTexture();
+		copyArrayContents( matricesTexture.image.data, this._matricesTexture.image.data );
+
+		if ( colorsTexture ) {
+
+			colorsTexture.dispose();
+			this._initColorsTexture();
+			copyArrayContents( colorsTexture.image.data, this._colorsTexture.image.data );
+
+		}
+
+	}
+
+	/**
+	 * Resizes the available space in the batch's vertex and index buffer attributes to the provided sizes.
+	 * If the provided arguments shrink the geometry buffers but there is not enough unused space at the
+	 * end of the geometry attributes then an error is thrown.
+	 *
+	 * @param {number} maxVertexCount - The maximum number of vertices to be used by all unique geometries to resize to.
+	 * @param {number} maxIndexCount - The maximum number of indices to be used by all unique geometries to resize to.
+	*/
+	setGeometrySize( maxVertexCount, maxIndexCount ) {
+
+		// Check if we can shrink to the requested vertex attribute size
+		const validRanges = [ ...this._geometryInfo ].filter( info => info.active );
+		const requiredVertexLength = Math.max( ...validRanges.map( range => range.vertexStart + range.reservedVertexCount ) );
+		if ( requiredVertexLength > maxVertexCount ) {
+
+			throw new Error( `THREE.BatchedMesh: Geometry vertex values are being used outside the range ${ maxIndexCount }. Cannot shrink further.` );
+
+		}
+
+		// Check if we can shrink to the requested index attribute size
+		if ( this.geometry.index ) {
+
+			const requiredIndexLength = Math.max( ...validRanges.map( range => range.indexStart + range.reservedIndexCount ) );
+			if ( requiredIndexLength > maxIndexCount ) {
+
+				throw new Error( `THREE.BatchedMesh: Geometry index values are being used outside the range ${ maxIndexCount }. Cannot shrink further.` );
+
+			}
+
+		}
+
+		//
+
+		// dispose of the previous geometry
+		const oldGeometry = this.geometry;
+		oldGeometry.dispose();
+
+		// recreate the geometry needed based on the previous variant
+		this._maxVertexCount = maxVertexCount;
+		this._maxIndexCount = maxIndexCount;
+
+		if ( this._geometryInitialized ) {
+
+			this._geometryInitialized = false;
+			this.geometry = new BufferGeometry();
+			this._initializeGeometry( oldGeometry );
+
+		}
+
+		// copy data from the previous geometry
+		const geometry = this.geometry;
+		if ( oldGeometry.index ) {
+
+			copyArrayContents( oldGeometry.index.array, geometry.index.array );
+
+		}
+
+		for ( const key in oldGeometry.attributes ) {
+
+			copyArrayContents( oldGeometry.attributes[ key ].array, geometry.attributes[ key ].array );
+
+		}
+
+	}
+
+	raycast( raycaster, intersects ) {
+
+		const instanceInfo = this._instanceInfo;
+		const geometryInfoList = this._geometryInfo;
+		const matrixWorld = this.matrixWorld;
+		const batchGeometry = this.geometry;
+
+		// iterate over each geometry
+		_mesh.material = this.material;
+		_mesh.geometry.index = batchGeometry.index;
+		_mesh.geometry.attributes = batchGeometry.attributes;
+		if ( _mesh.geometry.boundingBox === null ) {
+
+			_mesh.geometry.boundingBox = new Box3();
+
+		}
+
+		if ( _mesh.geometry.boundingSphere === null ) {
+
+			_mesh.geometry.boundingSphere = new Sphere();
+
+		}
+
+		for ( let i = 0, l = instanceInfo.length; i < l; i ++ ) {
+
+			if ( ! instanceInfo[ i ].visible || ! instanceInfo[ i ].active ) {
+
+				continue;
+
+			}
+
+			const geometryId = instanceInfo[ i ].geometryIndex;
+			const geometryInfo = geometryInfoList[ geometryId ];
+			_mesh.geometry.setDrawRange( geometryInfo.start, geometryInfo.count );
+
+			// get the intersects
+			this.getMatrixAt( i, _mesh.matrixWorld ).premultiply( matrixWorld );
+			this.getBoundingBoxAt( geometryId, _mesh.geometry.boundingBox );
+			this.getBoundingSphereAt( geometryId, _mesh.geometry.boundingSphere );
+			_mesh.raycast( raycaster, _batchIntersects );
+
+			// add batch id to the intersects
+			for ( let j = 0, l = _batchIntersects.length; j < l; j ++ ) {
+
+				const intersect = _batchIntersects[ j ];
+				intersect.object = this;
+				intersect.batchId = i;
+				intersects.push( intersect );
+
+			}
+
+			_batchIntersects.length = 0;
+
+		}
+
+		_mesh.material = null;
+		_mesh.geometry.index = null;
+		_mesh.geometry.attributes = {};
+		_mesh.geometry.setDrawRange( 0, Infinity );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.geometry = source.geometry.clone();
+		this.perObjectFrustumCulled = source.perObjectFrustumCulled;
+		this.sortObjects = source.sortObjects;
+		this.boundingBox = source.boundingBox !== null ? source.boundingBox.clone() : null;
+		this.boundingSphere = source.boundingSphere !== null ? source.boundingSphere.clone() : null;
+
+		this._geometryInfo = source._geometryInfo.map( info => ( {
+			...info,
+
+			boundingBox: info.boundingBox !== null ? info.boundingBox.clone() : null,
+			boundingSphere: info.boundingSphere !== null ? info.boundingSphere.clone() : null,
+		} ) );
+		this._instanceInfo = source._instanceInfo.map( info => ( { ...info } ) );
+
+		this._availableInstanceIds = source._availableInstanceIds.slice();
+		this._availableGeometryIds = source._availableGeometryIds.slice();
+
+		this._nextIndexStart = source._nextIndexStart;
+		this._nextVertexStart = source._nextVertexStart;
+		this._geometryCount = source._geometryCount;
+
+		this._maxInstanceCount = source._maxInstanceCount;
+		this._maxVertexCount = source._maxVertexCount;
+		this._maxIndexCount = source._maxIndexCount;
+
+		this._geometryInitialized = source._geometryInitialized;
+		this._multiDrawCounts = source._multiDrawCounts.slice();
+		this._multiDrawStarts = source._multiDrawStarts.slice();
+		this._multiDrawBytesPerElement = source._multiDrawBytesPerElement;
+
+		this._indirectTexture = source._indirectTexture.clone();
+		this._indirectTexture.image.data = this._indirectTexture.image.data.slice();
+
+		this._matricesTexture = source._matricesTexture.clone();
+		this._matricesTexture.image.data = this._matricesTexture.image.data.slice();
+
+		if ( this._colorsTexture !== null ) {
+
+			this._colorsTexture = source._colorsTexture.clone();
+			this._colorsTexture.image.data = this._colorsTexture.image.data.slice();
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		// Assuming the geometry is not shared with other meshes
+		this.geometry.dispose();
+
+		this._matricesTexture.dispose();
+		this._matricesTexture = null;
+
+		this._indirectTexture.dispose();
+		this._indirectTexture = null;
+
+		if ( this._colorsTexture !== null ) {
+
+			this._colorsTexture.dispose();
+			this._colorsTexture = null;
+
+		}
+
+	}
+
+	onBeforeRender( renderer, scene, camera, geometry, material/*, _group*/ ) {
+
+		// if visibility has not changed and frustum culling and object sorting is not required
+		// then skip iterating over all items
+		if ( ! this._visibilityChanged && ! this.perObjectFrustumCulled && ! this.sortObjects ) {
+
+			return;
+
+		}
+
+		// the indexed version of the multi draw function requires specifying the start
+		// offset in bytes.
+		const index = geometry.getIndex();
+		let bytesPerElement = index === null ? 1 : index.array.BYTES_PER_ELEMENT;
+
+
+		// the "wireframe" attribute implicitly creates a line attribute in the renderer, which is double
+		// the vertices to draw (3 lines per triangle) so we multiply the draw counts / starts and make
+		// assumptions about the index buffer byte size.
+		let multiDrawMultiplier = 1;
+		if ( material.wireframe ) {
+
+			multiDrawMultiplier = 2;
+			bytesPerElement = geometry.attributes.position.count > 65535 ? 4 : 2;
+
+		}
+
+		const instanceInfo = this._instanceInfo;
+		const multiDrawStarts = this._multiDrawStarts;
+		const multiDrawCounts = this._multiDrawCounts;
+		const geometryInfoList = this._geometryInfo;
+		const perObjectFrustumCulled = this.perObjectFrustumCulled;
+		const indirectTexture = this._indirectTexture;
+		const indirectArray = indirectTexture.image.data;
+
+		const frustum = camera.isArrayCamera ? _frustumArray : _frustum;
+		// prepare the frustum in the local frame
+		if ( perObjectFrustumCulled ) {
+
+			if ( camera.isArrayCamera ) {
+
+				frustum.setFromArrayCamera( camera );
+
+			} else {
+
+				_matrix$1
+					.multiplyMatrices( camera.projectionMatrix, camera.matrixWorldInverse )
+					.multiply( this.matrixWorld );
+
+				frustum.setFromProjectionMatrix(
+					_matrix$1,
+					camera.coordinateSystem,
+					camera.reversedDepth
+				);
+
+			}
+
+		}
+
+		let multiDrawCount = 0;
+		if ( this.sortObjects ) {
+
+			// get the camera position in the local frame
+			_matrix$1.copy( this.matrixWorld ).invert();
+			_vector$5.setFromMatrixPosition( camera.matrixWorld ).applyMatrix4( _matrix$1 );
+			_forward$1.set( 0, 0, -1 ).transformDirection( camera.matrixWorld ).transformDirection( _matrix$1 );
+
+			for ( let i = 0, l = instanceInfo.length; i < l; i ++ ) {
+
+				if ( instanceInfo[ i ].visible && instanceInfo[ i ].active ) {
+
+					const geometryId = instanceInfo[ i ].geometryIndex;
+
+					// get the bounds in world space
+					this.getMatrixAt( i, _matrix$1 );
+					this.getBoundingSphereAt( geometryId, _sphere$2 ).applyMatrix4( _matrix$1 );
+
+					// determine whether the batched geometry is within the frustum
+					let culled = false;
+					if ( perObjectFrustumCulled ) {
+
+						culled = ! frustum.intersectsSphere( _sphere$2 );
+
+					}
+
+					if ( ! culled ) {
+
+						// get the distance from camera used for sorting
+						const geometryInfo = geometryInfoList[ geometryId ];
+						const z = _temp.subVectors( _sphere$2.center, _vector$5 ).dot( _forward$1 );
+						_renderList.push( geometryInfo.start, geometryInfo.count, z, i );
+
+					}
+
+				}
+
+			}
+
+			// Sort the draw ranges and prep for rendering
+			const list = _renderList.list;
+			const customSort = this.customSort;
+			if ( customSort === null ) {
+
+				list.sort( material.transparent ? sortTransparent : sortOpaque );
+
+			} else {
+
+				customSort.call( this, list, camera );
+
+			}
+
+			for ( let i = 0, l = list.length; i < l; i ++ ) {
+
+				const item = list[ i ];
+				multiDrawStarts[ multiDrawCount ] = item.start * bytesPerElement * multiDrawMultiplier;
+				multiDrawCounts[ multiDrawCount ] = item.count * multiDrawMultiplier;
+				indirectArray[ multiDrawCount ] = item.index;
+				multiDrawCount ++;
+
+			}
+
+			_renderList.reset();
+
+		} else {
+
+			for ( let i = 0, l = instanceInfo.length; i < l; i ++ ) {
+
+				if ( instanceInfo[ i ].visible && instanceInfo[ i ].active ) {
+
+					const geometryId = instanceInfo[ i ].geometryIndex;
+
+					// determine whether the batched geometry is within the frustum
+					let culled = false;
+					if ( perObjectFrustumCulled ) {
+
+						// get the bounds in world space
+						this.getMatrixAt( i, _matrix$1 );
+						this.getBoundingSphereAt( geometryId, _sphere$2 ).applyMatrix4( _matrix$1 );
+						culled = ! frustum.intersectsSphere( _sphere$2 );
+
+					}
+
+					if ( ! culled ) {
+
+						const geometryInfo = geometryInfoList[ geometryId ];
+						multiDrawStarts[ multiDrawCount ] = geometryInfo.start * bytesPerElement * multiDrawMultiplier;
+						multiDrawCounts[ multiDrawCount ] = geometryInfo.count * multiDrawMultiplier;
+						indirectArray[ multiDrawCount ] = i;
+						multiDrawCount ++;
+
+					}
+
+				}
+
+			}
+
+		}
+
+		indirectTexture.needsUpdate = true;
+		this._multiDrawCount = multiDrawCount;
+		this._multiDrawBytesPerElement = bytesPerElement;
+		this._visibilityChanged = false;
+
+	}
+
+	onBeforeShadow( renderer, object, camera, shadowCamera, geometry, depthMaterial/* , group */ ) {
+
+		this.onBeforeRender( renderer, null, shadowCamera, geometry, depthMaterial );
+
+	}
+
+}
+
+/**
+ * A material for rendering line primitives.
+ *
+ * Materials define the appearance of renderable 3D objects.
+ *
+ * ```js
+ * const material = new THREE.LineBasicMaterial( { color: 0xffffff } );
+ * ```
+ *
+ * @augments Material
+ */
+class LineBasicMaterial extends Material {
+
+	/**
+	 * Constructs a new line basic material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isLineBasicMaterial = true;
+
+		this.type = 'LineBasicMaterial';
+
+		/**
+		 * Color of the material.
+		 *
+		 * @type {Color}
+		 * @default (1,1,1)
+		 */
+		this.color = new Color( 0xffffff );
+
+		/**
+		 * Sets the color of the lines using data from a texture. The texture map
+		 * color is modulated by the diffuse `color`.
+		 *
+		 * `map` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `map` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.map = null;
+
+		/**
+		 * Controls line thickness or lines.
+		 *
+		 * Can only be used with {@link SVGRenderer}. WebGL and WebGPU
+		 * ignore this setting and always render line primitives with a
+		 * width of one pixel.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.linewidth = 1;
+
+		/**
+		 * Defines appearance of line ends.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {('butt'|'round'|'square')}
+		 * @default 'round'
+		 */
+		this.linecap = 'round';
+
+		/**
+		 * Defines appearance of line joints.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {('round'|'bevel'|'miter')}
+		 * @default 'round'
+		 */
+		this.linejoin = 'round';
+
+		/**
+		 * Whether the material is affected by fog or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.fog = true;
+
+		this.setValues( parameters );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.color.copy( source.color );
+
+		this.map = source.map;
+
+		this.linewidth = source.linewidth;
+		this.linecap = source.linecap;
+		this.linejoin = source.linejoin;
+
+		this.fog = source.fog;
+
+		return this;
+
+	}
+
+}
+
+const _vStart = /*@__PURE__*/ new Vector3();
+const _vEnd = /*@__PURE__*/ new Vector3();
+
+const _inverseMatrix$1 = /*@__PURE__*/ new Matrix4();
+const _ray$1 = /*@__PURE__*/ new Ray();
+const _sphere$1 = /*@__PURE__*/ new Sphere();
+
+const _intersectPointOnRay = /*@__PURE__*/ new Vector3();
+const _intersectPointOnSegment = /*@__PURE__*/ new Vector3();
+
+/**
+ * A continuous line. The line are rendered by connecting consecutive
+ * vertices with straight lines.
+ *
+ * ```js
+ * const material = new THREE.LineBasicMaterial( { color: 0x0000ff } );
+ *
+ * const points = [];
+ * points.push( new THREE.Vector3( - 10, 0, 0 ) );
+ * points.push( new THREE.Vector3( 0, 10, 0 ) );
+ * points.push( new THREE.Vector3( 10, 0, 0 ) );
+ *
+ * const geometry = new THREE.BufferGeometry().setFromPoints( points );
+ *
+ * const line = new THREE.Line( geometry, material );
+ * scene.add( line );
+ * ```
+ *
+ * @augments Object3D
+ */
+class Line extends Object3D {
+
+	/**
+	 * Constructs a new line.
+	 *
+	 * @param {BufferGeometry} [geometry] - The line geometry.
+	 * @param {Material|Array<Material>} [material] - The line material.
+	 */
+	constructor( geometry = new BufferGeometry(), material = new LineBasicMaterial() ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isLine = true;
+
+		this.type = 'Line';
+
+		/**
+		 * The line geometry.
+		 *
+		 * @type {BufferGeometry}
+		 */
+		this.geometry = geometry;
+
+		/**
+		 * The line material.
+		 *
+		 * @type {Material|Array<Material>}
+		 * @default LineBasicMaterial
+		 */
+		this.material = material;
+
+		/**
+		 * A dictionary representing the morph targets in the geometry. The key is the
+		 * morph targets name, the value its attribute index. This member is `undefined`
+		 * by default and only set when morph targets are detected in the geometry.
+		 *
+		 * @type {Object<string,number>|undefined}
+		 * @default undefined
+		 */
+		this.morphTargetDictionary = undefined;
+
+		/**
+		 * An array of weights typically in the range `[0,1]` that specify how much of the morph
+		 * is applied. This member is `undefined` by default and only set when morph targets are
+		 * detected in the geometry.
+		 *
+		 * @type {Array<number>|undefined}
+		 * @default undefined
+		 */
+		this.morphTargetInfluences = undefined;
+
+		this.updateMorphTargets();
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		this.material = Array.isArray( source.material ) ? source.material.slice() : source.material;
+		this.geometry = source.geometry;
+
+		return this;
+
+	}
+
+	/**
+	 * Computes an array of distance values which are necessary for rendering dashed lines.
+	 * For each vertex in the geometry, the method calculates the cumulative length from the
+	 * current point to the very beginning of the line.
+	 *
+	 * @return {Line} A reference to this line.
+	 */
+	computeLineDistances() {
+
+		const geometry = this.geometry;
+
+		// we assume non-indexed geometry
+
+		if ( geometry.index === null ) {
+
+			const positionAttribute = geometry.attributes.position;
+			const lineDistances = [ 0 ];
+
+			for ( let i = 1, l = positionAttribute.count; i < l; i ++ ) {
+
+				_vStart.fromBufferAttribute( positionAttribute, i - 1 );
+				_vEnd.fromBufferAttribute( positionAttribute, i );
+
+				lineDistances[ i ] = lineDistances[ i - 1 ];
+				lineDistances[ i ] += _vStart.distanceTo( _vEnd );
+
+			}
+
+			geometry.setAttribute( 'lineDistance', new Float32BufferAttribute( lineDistances, 1 ) );
+
+		} else {
+
+			warn( 'Line.computeLineDistances(): Computation only possible with non-indexed BufferGeometry.' );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this line intersects the given frustum.
+	 *
+	 * @param {Frustum|FrustumArray} frustum - The frustum to test.
+	 * @return {boolean} Whether this line intersects the given frustum or not.
+	 */
+	intersectsFrustum( frustum ) {
+
+		return frustum.intersectsObject( this );
+
+	}
+
+	/**
+	 * Computes intersection points between a casted ray and this line.
+	 *
+	 * @param {Raycaster} raycaster - The raycaster.
+	 * @param {Array<Object>} intersects - The target array that holds the intersection points.
+	 */
+	raycast( raycaster, intersects ) {
+
+		const geometry = this.geometry;
+		const matrixWorld = this.matrixWorld;
+		const threshold = raycaster.params.Line.threshold;
+		const drawRange = geometry.drawRange;
+
+		// Checking boundingSphere distance to ray
+
+		if ( geometry.boundingSphere === null ) geometry.computeBoundingSphere();
+
+		_sphere$1.copy( geometry.boundingSphere );
+		_sphere$1.applyMatrix4( matrixWorld );
+		_sphere$1.radius += threshold;
+
+		if ( raycaster.ray.intersectsSphere( _sphere$1 ) === false ) return;
+
+		//
+
+		_inverseMatrix$1.copy( matrixWorld ).invert();
+		_ray$1.copy( raycaster.ray ).applyMatrix4( _inverseMatrix$1 );
+
+		const localThreshold = threshold / ( ( this.scale.x + this.scale.y + this.scale.z ) / 3 );
+		const localThresholdSq = localThreshold * localThreshold;
+
+		const step = this.isLineSegments ? 2 : 1;
+
+		const index = geometry.index;
+		const attributes = geometry.attributes;
+		const positionAttribute = attributes.position;
+
+		if ( index !== null ) {
+
+			const start = Math.max( 0, drawRange.start );
+			const end = Math.min( index.count, ( drawRange.start + drawRange.count ) );
+
+			for ( let i = start, l = end - 1; i < l; i += step ) {
+
+				const a = index.getX( i );
+				const b = index.getX( i + 1 );
+
+				const intersect = checkIntersection( this, raycaster, _ray$1, localThresholdSq, a, b, i );
+
+				if ( intersect ) {
+
+					intersects.push( intersect );
+
+				}
+
+			}
+
+			if ( this.isLineLoop ) {
+
+				const a = index.getX( end - 1 );
+				const b = index.getX( start );
+
+				const intersect = checkIntersection( this, raycaster, _ray$1, localThresholdSq, a, b, end - 1 );
+
+				if ( intersect ) {
+
+					intersects.push( intersect );
+
+				}
+
+			}
+
+		} else {
+
+			const start = Math.max( 0, drawRange.start );
+			const end = Math.min( positionAttribute.count, ( drawRange.start + drawRange.count ) );
+
+			for ( let i = start, l = end - 1; i < l; i += step ) {
+
+				const intersect = checkIntersection( this, raycaster, _ray$1, localThresholdSq, i, i + 1, i );
+
+				if ( intersect ) {
+
+					intersects.push( intersect );
+
+				}
+
+			}
+
+			if ( this.isLineLoop ) {
+
+				const intersect = checkIntersection( this, raycaster, _ray$1, localThresholdSq, end - 1, start, end - 1 );
+
+				if ( intersect ) {
+
+					intersects.push( intersect );
+
+				}
+
+			}
+
+		}
+
+	}
+
+	/**
+	 * Sets the values of {@link Line#morphTargetDictionary} and {@link Line#morphTargetInfluences}
+	 * to make sure existing morph targets can influence this 3D object.
+	 */
+	updateMorphTargets() {
+
+		const geometry = this.geometry;
+
+		const morphAttributes = geometry.morphAttributes;
+		const keys = Object.keys( morphAttributes );
+
+		if ( keys.length > 0 ) {
+
+			const morphAttribute = morphAttributes[ keys[ 0 ] ];
+
+			if ( morphAttribute !== undefined ) {
+
+				this.morphTargetInfluences = [];
+				this.morphTargetDictionary = {};
+
+				for ( let m = 0, ml = morphAttribute.length; m < ml; m ++ ) {
+
+					const name = morphAttribute[ m ].name || String( m );
+
+					this.morphTargetInfluences.push( 0 );
+					this.morphTargetDictionary[ name ] = m;
+
+				}
+
+			}
+
+		}
+
+	}
+
+}
+
+function checkIntersection( object, raycaster, ray, thresholdSq, a, b, i ) {
+
+	const positionAttribute = object.geometry.attributes.position;
+
+	_vStart.fromBufferAttribute( positionAttribute, a );
+	_vEnd.fromBufferAttribute( positionAttribute, b );
+
+	const distSq = ray.distanceSqToSegment( _vStart, _vEnd, _intersectPointOnRay, _intersectPointOnSegment );
+
+	if ( distSq > thresholdSq ) return;
+
+	_intersectPointOnRay.applyMatrix4( object.matrixWorld ); // Move back to world space for distance calculation
+
+	const distance = raycaster.ray.origin.distanceTo( _intersectPointOnRay );
+
+	if ( distance < raycaster.near || distance > raycaster.far ) return;
+
+	return {
+
+		distance: distance,
+		// What do we want? intersection point on the ray or on the segment??
+		// point: raycaster.ray.at( distance ),
+		point: _intersectPointOnSegment.clone().applyMatrix4( object.matrixWorld ),
+		index: i,
+		face: null,
+		faceIndex: null,
+		barycoord: null,
+		object: object
+
+	};
+
+}
+
+const _start = /*@__PURE__*/ new Vector3();
+const _end = /*@__PURE__*/ new Vector3();
+
+/**
+ * A series of lines drawn between pairs of vertices.
+ *
+ * @augments Line
+ */
+class LineSegments extends Line {
+
+	/**
+	 * Constructs a new line segments.
+	 *
+	 * @param {BufferGeometry} [geometry] - The line geometry.
+	 * @param {Material|Array<Material>} [material] - The line material.
+	 */
+	constructor( geometry, material ) {
+
+		super( geometry, material );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isLineSegments = true;
+
+		this.type = 'LineSegments';
+
+	}
+
+	computeLineDistances() {
+
+		const geometry = this.geometry;
+
+		// we assume non-indexed geometry
+
+		if ( geometry.index === null ) {
+
+			const positionAttribute = geometry.attributes.position;
+			const lineDistances = [];
+
+			for ( let i = 0, l = positionAttribute.count; i < l; i += 2 ) {
+
+				_start.fromBufferAttribute( positionAttribute, i );
+				_end.fromBufferAttribute( positionAttribute, i + 1 );
+
+				lineDistances[ i ] = ( i === 0 ) ? 0 : lineDistances[ i - 1 ];
+				lineDistances[ i + 1 ] = lineDistances[ i ] + _start.distanceTo( _end );
+
+			}
+
+			geometry.setAttribute( 'lineDistance', new Float32BufferAttribute( lineDistances, 1 ) );
+
+		} else {
+
+			warn( 'LineSegments.computeLineDistances(): Computation only possible with non-indexed BufferGeometry.' );
+
+		}
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A continuous line. This is nearly the same as {@link Line} the only difference
+ * is that the last vertex is connected with the first vertex in order to close
+ * the line to form a loop.
+ *
+ * @augments Line
+ */
+class LineLoop extends Line {
+
+	/**
+	 * Constructs a new line loop.
+	 *
+	 * @param {BufferGeometry} [geometry] - The line geometry.
+	 * @param {Material|Array<Material>} [material] - The line material.
+	 */
+	constructor( geometry, material ) {
+
+		super( geometry, material );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isLineLoop = true;
+
+		this.type = 'LineLoop';
+
+	}
+
+}
+
+/**
+ * A material for rendering point primitives.
+ *
+ * Materials define the appearance of renderable 3D objects.
+ *
+ * ```js
+ * const vertices = [];
+ *
+ * for ( let i = 0; i < 10000; i ++ ) {
+ * 	const x = THREE.MathUtils.randFloatSpread( 2000 );
+ * 	const y = THREE.MathUtils.randFloatSpread( 2000 );
+ * 	const z = THREE.MathUtils.randFloatSpread( 2000 );
+ *
+ * 	vertices.push( x, y, z );
+ * }
+ *
+ * const geometry = new THREE.BufferGeometry();
+ * geometry.setAttribute( 'position', new THREE.Float32BufferAttribute( vertices, 3 ) );
+ * const material = new THREE.PointsMaterial( { color: 0x888888 } );
+ * const points = new THREE.Points( geometry, material );
+ * scene.add( points );
+ * ```
+ *
+ * @augments Material
+ */
+class PointsMaterial extends Material {
+
+	/**
+	 * Constructs a new points material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isPointsMaterial = true;
+
+		this.type = 'PointsMaterial';
+
+		/**
+		 * Color of the material.
+		 *
+		 * @type {Color}
+		 * @default (1,1,1)
+		 */
+		this.color = new Color( 0xffffff );
+
+		/**
+		 * The color map. May optionally include an alpha channel, typically combined
+		 * with {@link Material#transparent} or {@link Material#alphaTest}. The texture map
+		 * color is modulated by the diffuse `color`.
+		 *
+		 * `map` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `map` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.map = null;
+
+		/**
+		 * The alpha map is a grayscale texture that controls the opacity across the
+		 * surface (black: fully transparent; white: fully opaque).
+		 *
+		 * Only the color of the texture is used, ignoring the alpha channel if one
+		 * exists. For RGB and RGBA textures, the renderer will use the green channel
+		 * when sampling this texture due to the extra bit of precision provided for
+		 * green in DXT-compressed and uncompressed RGB 565 formats. Luminance-only and
+		 * luminance/alpha textures will also still work as expected.
+		 *
+		 * `alphaMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.alphaMap = null;
+
+		/**
+		 * Defines the size of the points in pixels.
+		 *
+		 * Might be capped if the value exceeds hardware dependent parameters like [gl.ALIASED_POINT_SIZE_RANGE](https://developer.mozilla.org/en-US/docs/Web/API/WebGLRenderingContext/getParamete).
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.size = 1;
+
+		/**
+		 * Specifies whether size of individual points is attenuated by the camera depth (perspective camera only).
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.sizeAttenuation = true;
+
+		/**
+		 * Whether the material is affected by fog or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.fog = true;
+
+		this.setValues( parameters );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.color.copy( source.color );
+
+		this.map = source.map;
+
+		this.alphaMap = source.alphaMap;
+
+		this.size = source.size;
+		this.sizeAttenuation = source.sizeAttenuation;
+
+		this.fog = source.fog;
+
+		return this;
+
+	}
+
+}
+
+const _inverseMatrix = /*@__PURE__*/ new Matrix4();
+const _ray = /*@__PURE__*/ new Ray();
+const _sphere = /*@__PURE__*/ new Sphere();
+const _position$3 = /*@__PURE__*/ new Vector3();
+
+/**
+ * A class for displaying points or point clouds.
+ *
+ * @augments Object3D
+ */
+class Points extends Object3D {
+
+	/**
+	 * Constructs a new point cloud.
+	 *
+	 * @param {BufferGeometry} [geometry] - The points geometry.
+	 * @param {Material|Array<Material>} [material] - The points material.
+	 */
+	constructor( geometry = new BufferGeometry(), material = new PointsMaterial() ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isPoints = true;
+
+		this.type = 'Points';
+
+		/**
+		 * The points geometry.
+		 *
+		 * @type {BufferGeometry}
+		 */
+		this.geometry = geometry;
+
+		/**
+		 * The line material.
+		 *
+		 * @type {Material|Array<Material>}
+		 * @default PointsMaterial
+		 */
+		this.material = material;
+
+		/**
+		 * A dictionary representing the morph targets in the geometry. The key is the
+		 * morph targets name, the value its attribute index. This member is `undefined`
+		 * by default and only set when morph targets are detected in the geometry.
+		 *
+		 * @type {Object<string,number>|undefined}
+		 * @default undefined
+		 */
+		this.morphTargetDictionary = undefined;
+
+		/**
+		 * An array of weights typically in the range `[0,1]` that specify how much of the morph
+		 * is applied. This member is `undefined` by default and only set when morph targets are
+		 * detected in the geometry.
+		 *
+		 * @type {Array<number>|undefined}
+		 * @default undefined
+		 */
+		this.morphTargetInfluences = undefined;
+
+		this.updateMorphTargets();
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		this.material = Array.isArray( source.material ) ? source.material.slice() : source.material;
+		this.geometry = source.geometry;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this point cloud intersects the given frustum.
+	 *
+	 * @param {Frustum|FrustumArray} frustum - The frustum to test.
+	 * @return {boolean} Whether this point cloud intersects the given frustum or not.
+	 */
+	intersectsFrustum( frustum ) {
+
+		return frustum.intersectsObject( this );
+
+	}
+
+	/**
+	 * Computes intersection points between a casted ray and this point cloud.
+	 *
+	 * @param {Raycaster} raycaster - The raycaster.
+	 * @param {Array<Object>} intersects - The target array that holds the intersection points.
+	 */
+	raycast( raycaster, intersects ) {
+
+		const geometry = this.geometry;
+		const matrixWorld = this.matrixWorld;
+		const threshold = raycaster.params.Points.threshold;
+		const drawRange = geometry.drawRange;
+
+		// Checking boundingSphere distance to ray
+
+		if ( geometry.boundingSphere === null ) geometry.computeBoundingSphere();
+
+		_sphere.copy( geometry.boundingSphere );
+		_sphere.applyMatrix4( matrixWorld );
+		_sphere.radius += threshold;
+
+		if ( raycaster.ray.intersectsSphere( _sphere ) === false ) return;
+
+		//
+
+		_inverseMatrix.copy( matrixWorld ).invert();
+		_ray.copy( raycaster.ray ).applyMatrix4( _inverseMatrix );
+
+		const localThreshold = threshold / ( ( this.scale.x + this.scale.y + this.scale.z ) / 3 );
+		const localThresholdSq = localThreshold * localThreshold;
+
+		const index = geometry.index;
+		const attributes = geometry.attributes;
+		const positionAttribute = attributes.position;
+
+		if ( index !== null ) {
+
+			const start = Math.max( 0, drawRange.start );
+			const end = Math.min( index.count, ( drawRange.start + drawRange.count ) );
+
+			for ( let i = start, il = end; i < il; i ++ ) {
+
+				const a = index.getX( i );
+
+				_position$3.fromBufferAttribute( positionAttribute, a );
+
+				testPoint( _position$3, a, localThresholdSq, matrixWorld, raycaster, intersects, this );
+
+			}
+
+		} else {
+
+			const start = Math.max( 0, drawRange.start );
+			const end = Math.min( positionAttribute.count, ( drawRange.start + drawRange.count ) );
+
+			for ( let i = start, l = end; i < l; i ++ ) {
+
+				_position$3.fromBufferAttribute( positionAttribute, i );
+
+				testPoint( _position$3, i, localThresholdSq, matrixWorld, raycaster, intersects, this );
+
+			}
+
+		}
+
+	}
+
+	/**
+	 * Sets the values of {@link Points#morphTargetDictionary} and {@link Points#morphTargetInfluences}
+	 * to make sure existing morph targets can influence this 3D object.
+	 */
+	updateMorphTargets() {
+
+		const geometry = this.geometry;
+
+		const morphAttributes = geometry.morphAttributes;
+		const keys = Object.keys( morphAttributes );
+
+		if ( keys.length > 0 ) {
+
+			const morphAttribute = morphAttributes[ keys[ 0 ] ];
+
+			if ( morphAttribute !== undefined ) {
+
+				this.morphTargetInfluences = [];
+				this.morphTargetDictionary = {};
+
+				for ( let m = 0, ml = morphAttribute.length; m < ml; m ++ ) {
+
+					const name = morphAttribute[ m ].name || String( m );
+
+					this.morphTargetInfluences.push( 0 );
+					this.morphTargetDictionary[ name ] = m;
+
+				}
+
+			}
+
+		}
+
+	}
+
+}
+
+function testPoint( point, index, localThresholdSq, matrixWorld, raycaster, intersects, object ) {
+
+	const rayPointDistanceSq = _ray.distanceSqToPoint( point );
+
+	if ( rayPointDistanceSq < localThresholdSq ) {
+
+		const intersectPoint = new Vector3();
+
+		_ray.closestPointToPoint( point, intersectPoint );
+		intersectPoint.applyMatrix4( matrixWorld );
+
+		const distance = raycaster.ray.origin.distanceTo( intersectPoint );
+
+		if ( distance < raycaster.near || distance > raycaster.far ) return;
+
+		intersects.push( {
+
+			distance: distance,
+			distanceToRay: Math.sqrt( rayPointDistanceSq ),
+			point: intersectPoint,
+			index: index,
+			face: null,
+			faceIndex: null,
+			barycoord: null,
+			object: object
+
+		} );
+
+	}
+
+}
+
+/**
+ * A texture for use with a video.
+ *
+ * ```js
+ * // assuming you have created a HTML video element with id="video"
+ * const video = document.getElementById( 'video' );
+ * const texture = new THREE.VideoTexture( video );
+ * ```
+ *
+ * Note: When using video textures with {@link WebGPURenderer}, {@link Texture#colorSpace} must be
+ * set to THREE.SRGBColorSpace.
+ *
+ * Note: After the initial use of a texture, its dimensions, format, and type
+ * cannot be changed. Instead, call {@link Texture#dispose} on the texture and instantiate a new one.
+ *
+ * @augments Texture
+ */
+class VideoTexture extends Texture {
+
+	/**
+	 * Constructs a new video texture.
+	 *
+	 * @param {HTMLVideoElement} video - The video element to use as a data source for the texture.
+	 * @param {number} [mapping=Texture.DEFAULT_MAPPING] - The texture mapping.
+	 * @param {number} [wrapS=ClampToEdgeWrapping] - The wrapS value.
+	 * @param {number} [wrapT=ClampToEdgeWrapping] - The wrapT value.
+	 * @param {number} [magFilter=LinearFilter] - The mag filter value.
+	 * @param {number} [minFilter=LinearFilter] - The min filter value.
+	 * @param {number} [format=RGBAFormat] - The texture format.
+	 * @param {number} [type=UnsignedByteType] - The texture type.
+	 * @param {number} [anisotropy=Texture.DEFAULT_ANISOTROPY] - The anisotropy value.
+	 */
+	constructor( video, mapping, wrapS, wrapT, magFilter = LinearFilter, minFilter = LinearFilter, format, type, anisotropy ) {
+
+		super( video, mapping, wrapS, wrapT, magFilter, minFilter, format, type, anisotropy );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isVideoTexture = true;
+
+		/**
+		 * Whether to generate mipmaps (if possible) for a texture.
+		 *
+		 * Overwritten and set to `false` by default.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.generateMipmaps = false;
+
+		/**
+		 * The video frame request callback identifier, which is a positive integer.
+		 *
+		 * Value of 0 represents no scheduled rVFC.
+		 *
+		 * @private
+		 * @type {number}
+		 */
+		this._requestVideoFrameCallbackId = 0;
+
+		const scope = this;
+
+		function updateVideo() {
+
+			scope.needsUpdate = true;
+			scope._requestVideoFrameCallbackId = video.requestVideoFrameCallback( updateVideo );
+
+		}
+
+		if ( 'requestVideoFrameCallback' in video ) {
+
+			this._requestVideoFrameCallbackId = video.requestVideoFrameCallback( updateVideo );
+
+		}
+
+	}
+
+	clone() {
+
+		return new this.constructor( this.image ).copy( this );
+
+	}
+
+	/**
+	 * This method is called automatically by the renderer and sets {@link Texture#needsUpdate}
+	 * to `true` every time a new frame is available.
+	 *
+	 * Only relevant if `requestVideoFrameCallback` is not supported in the browser.
+	 */
+	update() {
+
+		const video = this.image;
+		const hasVideoFrameCallback = 'requestVideoFrameCallback' in video;
+
+		if ( hasVideoFrameCallback === false && video.readyState >= video.HAVE_CURRENT_DATA ) {
+
+			this.needsUpdate = true;
+
+		}
+
+	}
+
+	dispose() {
+
+		if ( this._requestVideoFrameCallbackId !== 0 ) {
+
+			this.source.data.cancelVideoFrameCallback( this._requestVideoFrameCallbackId );
+
+			this._requestVideoFrameCallbackId = 0;
+
+		}
+
+		super.dispose();
+
+	}
+
+}
+
+/**
+ * This class can be used as an alternative way to define video data. Instead of using
+ * an instance of `HTMLVideoElement` like with `VideoTexture`, `VideoFrameTexture` expects each frame is
+ * defined manually via {@link VideoFrameTexture#setFrame}. A typical use case for this module is when
+ * video frames are decoded with the WebCodecs API.
+ *
+ * ```js
+ * const texture = new THREE.VideoFrameTexture();
+ * texture.setFrame( frame );
+ * ```
+ *
+ * @augments VideoTexture
+ */
+class VideoFrameTexture extends VideoTexture {
+
+	/**
+	 * Constructs a new video frame texture.
+	 *
+	 * @param {number} [mapping=Texture.DEFAULT_MAPPING] - The texture mapping.
+	 * @param {number} [wrapS=ClampToEdgeWrapping] - The wrapS value.
+	 * @param {number} [wrapT=ClampToEdgeWrapping] - The wrapT value.
+	 * @param {number} [magFilter=LinearFilter] - The mag filter value.
+	 * @param {number} [minFilter=LinearFilter] - The min filter value.
+	 * @param {number} [format=RGBAFormat] - The texture format.
+	 * @param {number} [type=UnsignedByteType] - The texture type.
+	 * @param {number} [anisotropy=Texture.DEFAULT_ANISOTROPY] - The anisotropy value.
+	 */
+	constructor( mapping, wrapS, wrapT, magFilter, minFilter, format, type, anisotropy ) {
+
+		super( {}, mapping, wrapS, wrapT, magFilter, minFilter, format, type, anisotropy );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isVideoFrameTexture = true;
+
+	}
+
+	/**
+	 * This method overwritten with an empty implementation since
+	 * this type of texture is updated via `setFrame()`.
+	 */
+	update() {}
+
+	clone() {
+
+		return new this.constructor().copy( this ); // restoring Texture.clone()
+
+	}
+
+	/**
+	 * Sets the current frame of the video. This will automatically update the texture
+	 * so the data can be used for rendering.
+	 *
+	 * @param {VideoFrame} frame - The video frame.
+	 */
+	setFrame( frame ) {
+
+		this.image = frame;
+		this.needsUpdate = true;
+
+	}
+
+}
+
+/**
+ * This class can only be used in combination with `copyFramebufferToTexture()` methods
+ * of renderers. It extracts the contents of the current bound framebuffer and provides it
+ * as a texture for further usage.
+ *
+ * ```js
+ * const pixelRatio = window.devicePixelRatio;
+ * const textureSize = 128 * pixelRatio;
+ *
+ * const frameTexture = new FramebufferTexture( textureSize, textureSize );
+ *
+ * // calculate start position for copying part of the frame data
+ * const vector = new Vector2();
+ * vector.x = ( window.innerWidth * pixelRatio / 2 ) - ( textureSize / 2 );
+ * vector.y = ( window.innerHeight * pixelRatio / 2 ) - ( textureSize / 2 );
+ *
+ * renderer.render( scene, camera );
+ *
+ * // copy part of the rendered frame into the framebuffer texture
+ * renderer.copyFramebufferToTexture( frameTexture, vector );
+ * ```
+ *
+ * @augments Texture
+ */
+class FramebufferTexture extends Texture {
+
+	/**
+	 * Constructs a new framebuffer texture.
+	 *
+	 * @param {number} [width] - The width of the texture.
+	 * @param {number} [height] - The height of the texture.
+	 */
+	constructor( width, height ) {
+
+		super( { width, height } );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isFramebufferTexture = true;
+
+		/**
+		 * How the texture is sampled when a texel covers more than one pixel.
+		 *
+		 * Overwritten and set to `NearestFilter` by default to disable filtering.
+		 *
+		 * @type {(NearestFilter|NearestMipmapNearestFilter|NearestMipmapLinearFilter|LinearFilter|LinearMipmapNearestFilter|LinearMipmapLinearFilter)}
+		 * @default NearestFilter
+		 */
+		this.magFilter = NearestFilter;
+
+		/**
+		 * How the texture is sampled when a texel covers less than one pixel.
+		 *
+		 * Overwritten and set to `NearestFilter` by default to disable filtering.
+		 *
+		 * @type {(NearestFilter|NearestMipmapNearestFilter|NearestMipmapLinearFilter|LinearFilter|LinearMipmapNearestFilter|LinearMipmapLinearFilter)}
+		 * @default NearestFilter
+		 */
+		this.minFilter = NearestFilter;
+
+		/**
+		 * Whether to generate mipmaps (if possible) for a texture.
+		 *
+		 * Overwritten and set to `false` by default.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.generateMipmaps = false;
+
+		this.needsUpdate = true;
+
+	}
+
+}
+
+/**
+ * Creates a texture based on data in compressed form.
+ *
+ * These texture are usually loaded with {@link CompressedTextureLoader}.
+ *
+ * @augments Texture
+ */
+class CompressedTexture extends Texture {
+
+	/**
+	 * Constructs a new compressed texture.
+	 *
+	 * @param {Array<Object>} mipmaps - This array holds for all mipmaps (including the bases mip)
+	 * the data and dimensions.
+	 * @param {number} width - The width of the texture.
+	 * @param {number} height - The height of the texture.
+	 * @param {number} [format=RGBAFormat] - The texture format.
+	 * @param {number} [type=UnsignedByteType] - The texture type.
+	 * @param {number} [mapping=Texture.DEFAULT_MAPPING] - The texture mapping.
+	 * @param {number} [wrapS=ClampToEdgeWrapping] - The wrapS value.
+	 * @param {number} [wrapT=ClampToEdgeWrapping] - The wrapT value.
+	 * @param {number} [magFilter=LinearFilter] - The mag filter value.
+	 * @param {number} [minFilter=LinearMipmapLinearFilter] - The min filter value.
+	 * @param {number} [anisotropy=Texture.DEFAULT_ANISOTROPY] - The anisotropy value.
+	 * @param {string} [colorSpace=NoColorSpace] - The color space.
+	 */
+	constructor( mipmaps, width, height, format, type, mapping, wrapS, wrapT, magFilter, minFilter, anisotropy, colorSpace ) {
+
+		super( null, mapping, wrapS, wrapT, magFilter, minFilter, format, type, anisotropy, colorSpace );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isCompressedTexture = true;
+
+		/**
+		 * The image property of a compressed texture just defines its dimensions.
+		 *
+		 * @type {{width:number,height:number}}
+		 */
+		this.image = { width: width, height: height };
+
+		/**
+		 * This array holds for all mipmaps (including the bases mip) the data and dimensions.
+		 *
+		 * @type {Array<Object>}
+		 */
+		this.mipmaps = mipmaps;
+
+		/**
+		 * If set to `true`, the texture is flipped along the vertical axis when
+		 * uploaded to the GPU.
+		 *
+		 * Overwritten and set to `false` by default since it is not possible to
+		 * flip compressed textures.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 * @readonly
+		 */
+		this.flipY = false;
+
+		/**
+		 * Whether to generate mipmaps (if possible) for a texture.
+		 *
+		 * Overwritten and set to `false` by default since it is not
+		 * possible to generate mipmaps for compressed data. Mipmaps
+		 * must be embedded in the compressed texture file.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 * @readonly
+		 */
+		this.generateMipmaps = false;
+
+	}
+
+}
+
+/**
+ * Creates a texture 2D array based on data in compressed form.
+ *
+ * These texture are usually loaded with {@link CompressedTextureLoader}.
+ *
+ * @augments CompressedTexture
+ */
+class CompressedArrayTexture extends CompressedTexture {
+
+	/**
+	 * Constructs a new compressed array texture.
+	 *
+	 * @param {Array<Object>} mipmaps - This array holds for all mipmaps (including the bases mip)
+	 * the data and dimensions.
+	 * @param {number} width - The width of the texture.
+	 * @param {number} height - The height of the texture.
+	 * @param {number} depth - The depth of the texture.
+	 * @param {number} [format=RGBAFormat] - The min filter value.
+	 * @param {number} [type=UnsignedByteType] - The min filter value.
+	 */
+	constructor( mipmaps, width, height, depth, format, type ) {
+
+		super( mipmaps, width, height, format, type );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isCompressedArrayTexture = true;
+
+		/**
+		 * The image property of a compressed texture just defines its dimensions.
+		 *
+		 * @name CompressedArrayTexture#image
+		 * @type {{width:number,height:number,depth:number}}
+		 */
+		this.image.depth = depth;
+
+		/**
+		 * This defines how the texture is wrapped in the depth and corresponds to
+		 * *W* in UVW mapping.
+		 *
+		 * @type {(RepeatWrapping|ClampToEdgeWrapping|MirroredRepeatWrapping)}
+		 * @default ClampToEdgeWrapping
+		 */
+		this.wrapR = ClampToEdgeWrapping;
+
+		/**
+		 * A set of all layers which need to be updated in the texture.
+		 *
+		 * @type {Set<number>}
+		 */
+		this.layerUpdates = new Set();
+
+	}
+
+	/**
+	 * Copies the values of the given texture to this instance.
+	 *
+	 * @param {CompressedArrayTexture} source - The texture to copy.
+	 * @return {CompressedArrayTexture} A reference to this instance.
+	 */
+	copy( source ) {
+
+		super.copy( source );
+
+		this.wrapR = source.wrapR;
+
+		return this;
+
+	}
+
+	/**
+	 * Describes that a specific layer of the texture needs to be updated.
+	 * Normally when {@link Texture#needsUpdate} is set to `true`, the
+	 * entire compressed texture array is sent to the GPU. Marking specific
+	 * layers will only transmit subsets of all mipmaps associated with a
+	 * specific depth in the array which is often much more performant.
+	 *
+	 * @param {number} layerIndex - The layer index that should be updated.
+	 */
+	addLayerUpdate( layerIndex ) {
+
+		this.layerUpdates.add( layerIndex );
+
+	}
+
+	/**
+	 * Resets the layer updates registry.
+	 */
+	clearLayerUpdates() {
+
+		this.layerUpdates.clear();
+
+	}
+
+}
+
+/**
+ * Creates a cube texture based on data in compressed form.
+ *
+ * These texture are usually loaded with {@link CompressedTextureLoader}.
+ *
+ * @augments CompressedTexture
+ */
+class CompressedCubeTexture extends CompressedTexture {
+
+	/**
+	 * Constructs a new compressed texture.
+	 *
+	 * @param {Array<CompressedTexture>} images - An array of compressed textures.
+	 * @param {number} [format=RGBAFormat] - The texture format.
+	 * @param {number} [type=UnsignedByteType] - The texture type.
+	 */
+	constructor( images, format, type ) {
+
+		super( undefined, images[ 0 ].width, images[ 0 ].height, format, type, CubeReflectionMapping );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isCompressedCubeTexture = true;
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isCubeTexture = true;
+
+		this.image = images;
+
+	}
+
+}
+
+/**
+ * Creates a cube texture made up of six images.
+ *
+ * ```js
+ * const loader = new THREE.CubeTextureLoader();
+ * loader.setPath( 'textures/cube/pisa/' );
+ *
+ * const textureCube = loader.load( [
+ * 	'px.png', 'nx.png', 'py.png', 'ny.png', 'pz.png', 'nz.png'
+ * ] );
+ *
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffffff, envMap: textureCube } );
+ * ```
+ *
+ * @augments Texture
+ */
+class CubeTexture extends Texture {
+
+	/**
+	 * Constructs a new cube texture.
+	 *
+	 * @param {Array<Image>} [images=[]] - An array holding a image for each side of a cube.
+	 * @param {number} [mapping=CubeReflectionMapping] - The texture mapping.
+	 * @param {number} [wrapS=ClampToEdgeWrapping] - The wrapS value.
+	 * @param {number} [wrapT=ClampToEdgeWrapping] - The wrapT value.
+	 * @param {number} [magFilter=LinearFilter] - The mag filter value.
+	 * @param {number} [minFilter=LinearMipmapLinearFilter] - The min filter value.
+	 * @param {number} [format=RGBAFormat] - The texture format.
+	 * @param {number} [type=UnsignedByteType] - The texture type.
+	 * @param {number} [anisotropy=Texture.DEFAULT_ANISOTROPY] - The anisotropy value.
+	 * @param {string} [colorSpace=NoColorSpace] - The color space value.
+	 */
+	constructor( images = [], mapping = CubeReflectionMapping, wrapS, wrapT, magFilter, minFilter, format, type, anisotropy, colorSpace ) {
+
+		super( images, mapping, wrapS, wrapT, magFilter, minFilter, format, type, anisotropy, colorSpace );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isCubeTexture = true;
+
+		/**
+		 * If set to `true`, the texture is flipped along the vertical axis when
+		 * uploaded to the GPU.
+		 *
+		 * Overwritten and set to `false` by default.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.flipY = false;
+
+	}
+
+	/**
+	 * Alias for {@link CubeTexture#image}.
+	 *
+	 * @type {Array<Image>}
+	 */
+	get images() {
+
+		return this.image;
+
+	}
+
+	set images( value ) {
+
+		this.image = value;
+
+	}
+
+}
+
+/**
+ * Creates a texture from a canvas element.
+ *
+ * This is almost the same as the base texture class, except that it sets {@link Texture#needsUpdate}
+ * to `true` immediately since a canvas can directly be used for rendering.
+ *
+ * @augments Texture
+ */
+class CanvasTexture extends Texture {
+
+	/**
+	 * Constructs a new texture.
+	 *
+	 * @param {HTMLCanvasElement} [canvas] - The HTML canvas element.
+	 * @param {number} [mapping=Texture.DEFAULT_MAPPING] - The texture mapping.
+	 * @param {number} [wrapS=ClampToEdgeWrapping] - The wrapS value.
+	 * @param {number} [wrapT=ClampToEdgeWrapping] - The wrapT value.
+	 * @param {number} [magFilter=LinearFilter] - The mag filter value.
+	 * @param {number} [minFilter=LinearMipmapLinearFilter] - The min filter value.
+	 * @param {number} [format=RGBAFormat] - The texture format.
+	 * @param {number} [type=UnsignedByteType] - The texture type.
+	 * @param {number} [anisotropy=Texture.DEFAULT_ANISOTROPY] - The anisotropy value.
+	 */
+	constructor( canvas, mapping, wrapS, wrapT, magFilter, minFilter, format, type, anisotropy ) {
+
+		super( canvas, mapping, wrapS, wrapT, magFilter, minFilter, format, type, anisotropy );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isCanvasTexture = true;
+
+		this.needsUpdate = true;
+
+	}
+
+}
+
+/**
+ * Creates a texture from an HTML element.
+ *
+ * This is almost the same as the base texture class, except that it sets {@link Texture#needsUpdate}
+ * to `true` immediately and listens for the parent canvas's paint events to trigger updates.
+ *
+ * @augments Texture
+ */
+class HTMLTexture extends Texture {
+
+	/**
+	 * Constructs a new texture.
+	 *
+	 * @param {HTMLElement} [element] - The HTML element.
+	 * @param {number} [mapping=Texture.DEFAULT_MAPPING] - The texture mapping.
+	 * @param {number} [wrapS=ClampToEdgeWrapping] - The wrapS value.
+	 * @param {number} [wrapT=ClampToEdgeWrapping] - The wrapT value.
+	 * @param {number} [magFilter=LinearFilter] - The mag filter value.
+	 * @param {number} [minFilter=LinearMipmapLinearFilter] - The min filter value.
+	 * @param {number} [format=RGBAFormat] - The texture format.
+	 * @param {number} [type=UnsignedByteType] - The texture type.
+	 * @param {number} [anisotropy=Texture.DEFAULT_ANISOTROPY] - The anisotropy value.
+	 */
+	constructor( element, mapping, wrapS, wrapT, magFilter, minFilter, format, type, anisotropy ) {
+
+		super( element, mapping, wrapS, wrapT, magFilter, minFilter, format, type, anisotropy );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isHTMLTexture = true;
+		this.generateMipmaps = false;
+
+		this.needsUpdate = true;
+
+		const parent = element ? element.parentNode : null;
+
+		if ( parent !== null && 'requestPaint' in parent ) {
+
+			parent.onpaint = () => {
+
+				this.needsUpdate = true;
+
+			};
+
+			parent.requestPaint();
+
+		}
+
+	}
+
+	dispose() {
+
+		const parent = this.image ? this.image.parentNode : null;
+
+		if ( parent !== null && 'onpaint' in parent ) {
+
+			parent.onpaint = null;
+
+		}
+
+		super.dispose();
+
+	}
+
+}
+
+/**
+ * This class can be used to automatically save the depth information of a
+ * rendering into a texture.
+ *
+ * @augments Texture
+ */
+class DepthTexture extends Texture {
+
+	/**
+	 * Constructs a new depth texture.
+	 *
+	 * @param {number} width - The width of the texture.
+	 * @param {number} height - The height of the texture.
+	 * @param {number} [type=UnsignedIntType] - The texture type.
+	 * @param {number} [mapping=Texture.DEFAULT_MAPPING] - The texture mapping.
+	 * @param {number} [wrapS=ClampToEdgeWrapping] - The wrapS value.
+	 * @param {number} [wrapT=ClampToEdgeWrapping] - The wrapT value.
+	 * @param {number} [magFilter=LinearFilter] - The mag filter value.
+	 * @param {number} [minFilter=LinearFilter] - The min filter value.
+	 * @param {number} [anisotropy=Texture.DEFAULT_ANISOTROPY] - The anisotropy value.
+	 * @param {number} [format=DepthFormat] - The texture format.
+	 * @param {number} [depth=1] - The depth of the texture.
+	 */
+	constructor( width, height, type = UnsignedIntType, mapping, wrapS, wrapT, magFilter = NearestFilter, minFilter = NearestFilter, anisotropy, format = DepthFormat, depth = 1 ) {
+
+		if ( format !== DepthFormat && format !== DepthStencilFormat ) {
+
+			throw new Error( 'THREE.DepthTexture: format must be either THREE.DepthFormat or THREE.DepthStencilFormat' );
+
+		}
+
+		const image = { width: width, height: height, depth: depth };
+
+		super( image, mapping, wrapS, wrapT, magFilter, minFilter, format, type, anisotropy );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isDepthTexture = true;
+
+		/**
+		 * If set to `true`, the texture is flipped along the vertical axis when
+		 * uploaded to the GPU.
+		 *
+		 * Overwritten and set to `false` by default.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.flipY = false;
+
+		/**
+		 * Whether to generate mipmaps (if possible) for a texture.
+		 *
+		 * Overwritten and set to `false` by default.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.generateMipmaps = false;
+
+		/**
+		 * Code corresponding to the depth compare function.
+		 *
+		 * @type {?(NeverCompare|LessCompare|EqualCompare|LessEqualCompare|GreaterCompare|NotEqualCompare|GreaterEqualCompare|AlwaysCompare)}
+		 * @default null
+		 */
+		this.compareFunction = null;
+
+	}
+
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.source = new TextureSource( Object.assign( {}, source.image ) ); // see #30540
+		this.compareFunction = source.compareFunction;
+
+		return this;
+
+	}
+
+	toJSON( meta ) {
+
+		const data = super.toJSON( meta );
+
+		data.compareFunction = this.compareFunction;
+
+		return data;
+
+	}
+
+}
+
+/**
+ * This class can be used to automatically save the depth information of a
+ * cube rendering into a cube texture with depth format. Used for PointLight shadows.
+ *
+ * @augments DepthTexture
+ */
+class CubeDepthTexture extends DepthTexture {
+
+	/**
+	 * Constructs a new cube depth texture.
+	 *
+	 * @param {number} size - The size (width and height) of each cube face.
+	 * @param {number} [type=UnsignedIntType] - The texture type.
+	 * @param {number} [mapping=CubeReflectionMapping] - The texture mapping.
+	 * @param {number} [wrapS=ClampToEdgeWrapping] - The wrapS value.
+	 * @param {number} [wrapT=ClampToEdgeWrapping] - The wrapT value.
+	 * @param {number} [magFilter=NearestFilter] - The mag filter value.
+	 * @param {number} [minFilter=NearestFilter] - The min filter value.
+	 * @param {number} [anisotropy=Texture.DEFAULT_ANISOTROPY] - The anisotropy value.
+	 * @param {number} [format=DepthFormat] - The texture format.
+	 */
+	constructor( size, type = UnsignedIntType, mapping = CubeReflectionMapping, wrapS, wrapT, magFilter = NearestFilter, minFilter = NearestFilter, anisotropy, format = DepthFormat ) {
+
+		// Create 6 identical image descriptors for the cube faces
+		const image = { width: size, height: size, depth: 1 };
+		const images = [ image, image, image, image, image, image ];
+
+		// Call DepthTexture constructor with width, height
+		super( size, size, type, mapping, wrapS, wrapT, magFilter, minFilter, anisotropy, format );
+
+		// Replace the single image with the array of 6 images
+		this.image = images;
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isCubeDepthTexture = true;
+
+		/**
+		 * Set to true for cube texture handling in WebGLTextures.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isCubeTexture = true;
+
+	}
+
+	/**
+	 * Alias for {@link CubeDepthTexture#image}.
+	 *
+	 * @type {Array<Image>}
+	 */
+	get images() {
+
+		return this.image;
+
+	}
+
+	set images( value ) {
+
+		this.image = value;
+
+	}
+
+}
+
+/**
+ * Represents a texture created externally with the same renderer context.
+ *
+ * This may be a texture from a protected media stream, device camera feed,
+ * or other data feeds like a depth sensor.
+ *
+ * @augments Texture
+ */
+class ExternalTexture extends Texture {
+
+	/**
+	 * Creates a new raw texture.
+	 *
+	 * @param {?(WebGLTexture|GPUTexture)} [sourceTexture=null] - The external texture.
+	 */
+	constructor( sourceTexture = null ) {
+
+		super();
+
+		/**
+		 * The external source texture.
+		 *
+		 * @type {?(WebGLTexture|GPUTexture)}
+		 * @default null
+		 */
+		this.sourceTexture = sourceTexture;
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isExternalTexture = true;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.sourceTexture = source.sourceTexture;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A geometry class for a rectangular cuboid with a given width, height, and depth.
+ * On creation, the cuboid is centred on the origin, with each edge parallel to one
+ * of the axes.
+ *
+ * ```js
+ * const geometry = new THREE.BoxGeometry( 1, 1, 1 );
+ * const material = new THREE.MeshBasicMaterial( { color: 0x00ff00 } );
+ * const cube = new THREE.Mesh( geometry, material );
+ * scene.add( cube );
+ * ```
+ *
+ * @augments BufferGeometry
+ * @demo scenes/geometry-browser.html#BoxGeometry
+ */
+class BoxGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new box geometry.
+	 *
+	 * @param {number} [width=1] - The width. That is, the length of the edges parallel to the X axis.
+	 * @param {number} [height=1] - The height. That is, the length of the edges parallel to the Y axis.
+	 * @param {number} [depth=1] - The depth. That is, the length of the edges parallel to the Z axis.
+	 * @param {number} [widthSegments=1] - Number of segmented rectangular faces along the width of the sides.
+	 * @param {number} [heightSegments=1] - Number of segmented rectangular faces along the height of the sides.
+	 * @param {number} [depthSegments=1] - Number of segmented rectangular faces along the depth of the sides.
+	 */
+	constructor( width = 1, height = 1, depth = 1, widthSegments = 1, heightSegments = 1, depthSegments = 1 ) {
+
+		super();
+
+		this.type = 'BoxGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			width: width,
+			height: height,
+			depth: depth,
+			widthSegments: widthSegments,
+			heightSegments: heightSegments,
+			depthSegments: depthSegments
+		};
+
+		const scope = this;
+
+		// segments
+
+		widthSegments = Math.floor( widthSegments );
+		heightSegments = Math.floor( heightSegments );
+		depthSegments = Math.floor( depthSegments );
+
+		// buffers
+
+		const indices = [];
+		const vertices = [];
+		const normals = [];
+		const uvs = [];
+
+		// helper variables
+
+		let numberOfVertices = 0;
+		let groupStart = 0;
+
+		// build each side of the box geometry
+
+		buildPlane( 'z', 'y', 'x', -1, -1, depth, height, width, depthSegments, heightSegments, 0 ); // px
+		buildPlane( 'z', 'y', 'x', 1, -1, depth, height, - width, depthSegments, heightSegments, 1 ); // nx
+		buildPlane( 'x', 'z', 'y', 1, 1, width, depth, height, widthSegments, depthSegments, 2 ); // py
+		buildPlane( 'x', 'z', 'y', 1, -1, width, depth, - height, widthSegments, depthSegments, 3 ); // ny
+		buildPlane( 'x', 'y', 'z', 1, -1, width, height, depth, widthSegments, heightSegments, 4 ); // pz
+		buildPlane( 'x', 'y', 'z', -1, -1, width, height, - depth, widthSegments, heightSegments, 5 ); // nz
+
+		// build geometry
+
+		this.setIndex( indices );
+		this.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		this.setAttribute( 'normal', new Float32BufferAttribute( normals, 3 ) );
+		this.setAttribute( 'uv', new Float32BufferAttribute( uvs, 2 ) );
+
+		function buildPlane( u, v, w, udir, vdir, width, height, depth, gridX, gridY, materialIndex ) {
+
+			const segmentWidth = width / gridX;
+			const segmentHeight = height / gridY;
+
+			const widthHalf = width / 2;
+			const heightHalf = height / 2;
+			const depthHalf = depth / 2;
+
+			const gridX1 = gridX + 1;
+			const gridY1 = gridY + 1;
+
+			let vertexCounter = 0;
+			let groupCount = 0;
+
+			const vector = new Vector3();
+
+			// generate vertices, normals and uvs
+
+			for ( let iy = 0; iy < gridY1; iy ++ ) {
+
+				const y = iy * segmentHeight - heightHalf;
+
+				for ( let ix = 0; ix < gridX1; ix ++ ) {
+
+					const x = ix * segmentWidth - widthHalf;
+
+					// set values to correct vector component
+
+					vector[ u ] = x * udir;
+					vector[ v ] = y * vdir;
+					vector[ w ] = depthHalf;
+
+					// now apply vector to vertex buffer
+
+					vertices.push( vector.x, vector.y, vector.z );
+
+					// set values to correct vector component
+
+					vector[ u ] = 0;
+					vector[ v ] = 0;
+					vector[ w ] = depth > 0 ? 1 : -1;
+
+					// now apply vector to normal buffer
+
+					normals.push( vector.x, vector.y, vector.z );
+
+					// uvs
+
+					uvs.push( ix / gridX );
+					uvs.push( 1 - ( iy / gridY ) );
+
+					// counters
+
+					vertexCounter += 1;
+
+				}
+
+			}
+
+			// indices
+
+			// 1. you need three indices to draw a single face
+			// 2. a single segment consists of two faces
+			// 3. so we need to generate six (2*3) indices per segment
+
+			for ( let iy = 0; iy < gridY; iy ++ ) {
+
+				for ( let ix = 0; ix < gridX; ix ++ ) {
+
+					const a = numberOfVertices + ix + gridX1 * iy;
+					const b = numberOfVertices + ix + gridX1 * ( iy + 1 );
+					const c = numberOfVertices + ( ix + 1 ) + gridX1 * ( iy + 1 );
+					const d = numberOfVertices + ( ix + 1 ) + gridX1 * iy;
+
+					// faces
+
+					indices.push( a, b, d );
+					indices.push( b, c, d );
+
+					// increase counter
+
+					groupCount += 6;
+
+				}
+
+			}
+
+			// add a group to the geometry. this will ensure multi material support
+
+			scope.addGroup( groupStart, groupCount, materialIndex );
+
+			// calculate new start value for groups
+
+			groupStart += groupCount;
+
+			// update total number of vertices
+
+			numberOfVertices += vertexCounter;
+
+		}
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {BoxGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new BoxGeometry( data.width, data.height, data.depth, data.widthSegments, data.heightSegments, data.depthSegments );
+
+	}
+
+}
+
+/**
+ * A geometry class for representing a capsule.
+ *
+ * ```js
+ * const geometry = new THREE.CapsuleGeometry( 1, 1, 4, 8, 1 );
+ * const material = new THREE.MeshBasicMaterial( { color: 0x00ff00 } );
+ * const capsule = new THREE.Mesh( geometry, material );
+ * scene.add( capsule );
+ * ```
+ *
+ * @augments BufferGeometry
+ * @demo scenes/geometry-browser.html#CapsuleGeometry
+ */
+class CapsuleGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new capsule geometry.
+	 *
+	 * @param {number} [radius=1] - Radius of the capsule.
+	 * @param {number} [height=1] - Height of the middle section.
+	 * @param {number} [capSegments=4] - Number of curve segments used to build each cap.
+	 * @param {number} [radialSegments=8] - Number of segmented faces around the circumference of the capsule. Must be an integer >= 3.
+	 * @param {number} [heightSegments=1] - Number of rows of faces along the height of the middle section. Must be an integer >= 1.
+	 */
+	constructor( radius = 1, height = 1, capSegments = 4, radialSegments = 8, heightSegments = 1 ) {
+
+		super();
+
+		this.type = 'CapsuleGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			radius: radius,
+			height: height,
+			capSegments: capSegments,
+			radialSegments: radialSegments,
+			heightSegments: heightSegments,
+		};
+
+		height = Math.max( 0, height );
+		capSegments = Math.max( 1, Math.floor( capSegments ) );
+		radialSegments = Math.max( 3, Math.floor( radialSegments ) );
+		heightSegments = Math.max( 1, Math.floor( heightSegments ) );
+
+		// buffers
+
+		const indices = [];
+		const vertices = [];
+		const normals = [];
+		const uvs = [];
+
+		// helper variables
+
+		const halfHeight = height / 2;
+		const capArcLength = ( Math.PI / 2 ) * radius;
+		const cylinderPartLength = height;
+		const totalArcLength = 2 * capArcLength + cylinderPartLength;
+
+		const numVerticalSegments = capSegments * 2 + heightSegments;
+		const verticesPerRow = radialSegments + 1;
+
+		const normal = new Vector3();
+		const vertex = new Vector3();
+
+		// generate vertices, normals, and uvs
+
+		for ( let iy = 0; iy <= numVerticalSegments; iy ++ ) {
+
+			let currentArcLength = 0;
+			let profileY = 0;
+			let profileRadius = 0;
+			let normalYComponent = 0;
+
+			if ( iy <= capSegments ) {
+
+				// bottom cap
+				const segmentProgress = iy / capSegments;
+				const angle = ( segmentProgress * Math.PI ) / 2;
+				profileY = - halfHeight - radius * Math.cos( angle );
+				profileRadius = radius * Math.sin( angle );
+				normalYComponent = - radius * Math.cos( angle );
+				currentArcLength = segmentProgress * capArcLength;
+
+			} else if ( iy <= capSegments + heightSegments ) {
+
+				// middle section
+				const segmentProgress = ( iy - capSegments ) / heightSegments;
+				profileY = - halfHeight + segmentProgress * height;
+				profileRadius = radius;
+				normalYComponent = 0;
+				currentArcLength = capArcLength + segmentProgress * cylinderPartLength;
+
+			} else {
+
+				// top cap
+				const segmentProgress =
+					( iy - capSegments - heightSegments ) / capSegments;
+				const angle = ( segmentProgress * Math.PI ) / 2;
+				profileY = halfHeight + radius * Math.sin( angle );
+				profileRadius = radius * Math.cos( angle );
+				normalYComponent = radius * Math.sin( angle );
+				currentArcLength =
+					capArcLength + cylinderPartLength + segmentProgress * capArcLength;
+
+			}
+
+			const v = Math.max( 0, Math.min( 1, currentArcLength / totalArcLength ) );
+
+
+			// special case for the poles
+
+			let uOffset = 0;
+
+			if ( iy === 0 ) {
+
+				uOffset = 0.5 / radialSegments;
+
+			} else if ( iy === numVerticalSegments ) {
+
+				uOffset = -0.5 / radialSegments;
+
+			}
+
+			for ( let ix = 0; ix <= radialSegments; ix ++ ) {
+
+				const u = ix / radialSegments;
+				const theta = u * Math.PI * 2;
+
+				const sinTheta = Math.sin( theta );
+				const cosTheta = Math.cos( theta );
+
+				// vertex
+
+				vertex.x = - profileRadius * cosTheta;
+				vertex.y = profileY;
+				vertex.z = profileRadius * sinTheta;
+				vertices.push( vertex.x, vertex.y, vertex.z );
+
+				// normal
+
+				normal.set(
+					- profileRadius * cosTheta,
+					normalYComponent,
+					profileRadius * sinTheta
+				);
+				normal.normalize();
+				normals.push( normal.x, normal.y, normal.z );
+
+				// uv
+
+				uvs.push( u + uOffset, v );
+
+			}
+
+			if ( iy > 0 ) {
+
+				const prevIndexRow = ( iy - 1 ) * verticesPerRow;
+				for ( let ix = 0; ix < radialSegments; ix ++ ) {
+
+					const i1 = prevIndexRow + ix;
+					const i2 = prevIndexRow + ix + 1;
+					const i3 = iy * verticesPerRow + ix;
+					const i4 = iy * verticesPerRow + ix + 1;
+
+					indices.push( i1, i2, i3 );
+					indices.push( i2, i4, i3 );
+
+				}
+
+			}
+
+		}
+
+		// build geometry
+
+		this.setIndex( indices );
+		this.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		this.setAttribute( 'normal', new Float32BufferAttribute( normals, 3 ) );
+		this.setAttribute( 'uv', new Float32BufferAttribute( uvs, 2 ) );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {CapsuleGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new CapsuleGeometry( data.radius, data.height, data.capSegments, data.radialSegments, data.heightSegments );
+
+	}
+
+}
+
+/**
+ * A simple shape of Euclidean geometry. It is constructed from a
+ * number of triangular segments that are oriented around a central point and
+ * extend as far out as a given radius. It is built counter-clockwise from a
+ * start angle and a given central angle. It can also be used to create
+ * regular polygons, where the number of segments determines the number of
+ * sides.
+ *
+ * ```js
+ * const geometry = new THREE.CircleGeometry( 5, 32 );
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00 } );
+ * const circle = new THREE.Mesh( geometry, material );
+ * scene.add( circle )
+ * ```
+ *
+ * @augments BufferGeometry
+ * @demo scenes/geometry-browser.html#CircleGeometry
+ */
+class CircleGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new circle geometry.
+	 *
+	 * @param {number} [radius=1] - Radius of the circle.
+	 * @param {number} [segments=32] - Number of segments (triangles), minimum = `3`.
+	 * @param {number} [thetaStart=0] - Start angle for first segment in radians.
+	 * @param {number} [thetaLength=Math.PI*2] - The central angle, often called theta,
+	 * of the circular sector in radians. The default value results in a complete circle.
+	 */
+	constructor( radius = 1, segments = 32, thetaStart = 0, thetaLength = Math.PI * 2 ) {
+
+		super();
+
+		this.type = 'CircleGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			radius: radius,
+			segments: segments,
+			thetaStart: thetaStart,
+			thetaLength: thetaLength
+		};
+
+		segments = Math.max( 3, segments );
+
+		// buffers
+
+		const indices = [];
+		const vertices = [];
+		const normals = [];
+		const uvs = [];
+
+		// helper variables
+
+		const vertex = new Vector3();
+		const uv = new Vector2();
+
+		// center point
+
+		vertices.push( 0, 0, 0 );
+		normals.push( 0, 0, 1 );
+		uvs.push( 0.5, 0.5 );
+
+		for ( let s = 0, i = 3; s <= segments; s ++, i += 3 ) {
+
+			const segment = thetaStart + s / segments * thetaLength;
+
+			// vertex
+
+			vertex.x = radius * Math.cos( segment );
+			vertex.y = radius * Math.sin( segment );
+
+			vertices.push( vertex.x, vertex.y, vertex.z );
+
+			// normal
+
+			normals.push( 0, 0, 1 );
+
+			// uvs
+
+			uv.x = ( vertices[ i ] / radius + 1 ) / 2;
+			uv.y = ( vertices[ i + 1 ] / radius + 1 ) / 2;
+
+			uvs.push( uv.x, uv.y );
+
+		}
+
+		// indices
+
+		for ( let i = 1; i <= segments; i ++ ) {
+
+			indices.push( i, i + 1, 0 );
+
+		}
+
+		// build geometry
+
+		this.setIndex( indices );
+		this.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		this.setAttribute( 'normal', new Float32BufferAttribute( normals, 3 ) );
+		this.setAttribute( 'uv', new Float32BufferAttribute( uvs, 2 ) );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {CircleGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new CircleGeometry( data.radius, data.segments, data.thetaStart, data.thetaLength );
+
+	}
+
+}
+
+/**
+ * A geometry class for representing a cylinder.
+ *
+ * ```js
+ * const geometry = new THREE.CylinderGeometry( 5, 5, 20, 32 );
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00 } );
+ * const cylinder = new THREE.Mesh( geometry, material );
+ * scene.add( cylinder );
+ * ```
+ *
+ * @augments BufferGeometry
+ * @demo scenes/geometry-browser.html#CylinderGeometry
+ */
+class CylinderGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new cylinder geometry.
+	 *
+	 * @param {number} [radiusTop=1] - Radius of the cylinder at the top.
+	 * @param {number} [radiusBottom=1] - Radius of the cylinder at the bottom.
+	 * @param {number} [height=1] - Height of the cylinder.
+	 * @param {number} [radialSegments=32] - Number of segmented faces around the circumference of the cylinder.
+	 * @param {number} [heightSegments=1] - Number of rows of faces along the height of the cylinder.
+	 * @param {boolean} [openEnded=false] - Whether the base of the cylinder is open or capped.
+	 * @param {number} [thetaStart=0] - Start angle for first segment, in radians.
+	 * @param {number} [thetaLength=Math.PI*2] - The central angle, often called theta, of the circular sector, in radians.
+	 * The default value results in a complete cylinder.
+	 */
+	constructor( radiusTop = 1, radiusBottom = 1, height = 1, radialSegments = 32, heightSegments = 1, openEnded = false, thetaStart = 0, thetaLength = Math.PI * 2 ) {
+
+		super();
+
+		this.type = 'CylinderGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			radiusTop: radiusTop,
+			radiusBottom: radiusBottom,
+			height: height,
+			radialSegments: radialSegments,
+			heightSegments: heightSegments,
+			openEnded: openEnded,
+			thetaStart: thetaStart,
+			thetaLength: thetaLength
+		};
+
+		const scope = this;
+
+		radialSegments = Math.floor( radialSegments );
+		heightSegments = Math.floor( heightSegments );
+
+		// buffers
+
+		const indices = [];
+		const vertices = [];
+		const normals = [];
+		const uvs = [];
+
+		// helper variables
+
+		let index = 0;
+		const indexArray = [];
+		const halfHeight = height / 2;
+		let groupStart = 0;
+
+		// generate geometry
+
+		generateTorso();
+
+		if ( openEnded === false ) {
+
+			if ( radiusTop > 0 ) generateCap( true );
+			if ( radiusBottom > 0 ) generateCap( false );
+
+		}
+
+		// build geometry
+
+		this.setIndex( indices );
+		this.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		this.setAttribute( 'normal', new Float32BufferAttribute( normals, 3 ) );
+		this.setAttribute( 'uv', new Float32BufferAttribute( uvs, 2 ) );
+
+		function generateTorso() {
+
+			const normal = new Vector3();
+			const vertex = new Vector3();
+
+			let groupCount = 0;
+
+			// this will be used to calculate the normal
+			const slope = ( radiusBottom - radiusTop ) / height;
+
+			// generate vertices, normals and uvs
+
+			for ( let y = 0; y <= heightSegments; y ++ ) {
+
+				const indexRow = [];
+
+				const v = y / heightSegments;
+
+				// calculate the radius of the current row
+
+				const radius = v * ( radiusBottom - radiusTop ) + radiusTop;
+
+				for ( let x = 0; x <= radialSegments; x ++ ) {
+
+					const u = x / radialSegments;
+
+					const theta = u * thetaLength + thetaStart;
+
+					const sinTheta = Math.sin( theta );
+					const cosTheta = Math.cos( theta );
+
+					// vertex
+
+					vertex.x = radius * sinTheta;
+					vertex.y = - v * height + halfHeight;
+					vertex.z = radius * cosTheta;
+					vertices.push( vertex.x, vertex.y, vertex.z );
+
+					// normal
+
+					normal.set( sinTheta, slope, cosTheta ).normalize();
+					normals.push( normal.x, normal.y, normal.z );
+
+					// uv
+
+					uvs.push( u, 1 - v );
+
+					// save index of vertex in respective row
+
+					indexRow.push( index ++ );
+
+				}
+
+				// now save vertices of the row in our index array
+
+				indexArray.push( indexRow );
+
+			}
+
+			// generate indices
+
+			for ( let x = 0; x < radialSegments; x ++ ) {
+
+				for ( let y = 0; y < heightSegments; y ++ ) {
+
+					// we use the index array to access the correct indices
+
+					const a = indexArray[ y ][ x ];
+					const b = indexArray[ y + 1 ][ x ];
+					const c = indexArray[ y + 1 ][ x + 1 ];
+					const d = indexArray[ y ][ x + 1 ];
+
+					// faces
+
+					if ( radiusTop > 0 || y !== 0 ) {
+
+						indices.push( a, b, d );
+						groupCount += 3;
+
+					}
+
+					if ( radiusBottom > 0 || y !== heightSegments - 1 ) {
+
+						indices.push( b, c, d );
+						groupCount += 3;
+
+					}
+
+				}
+
+			}
+
+			// add a group to the geometry. this will ensure multi material support
+
+			scope.addGroup( groupStart, groupCount, 0 );
+
+			// calculate new start value for groups
+
+			groupStart += groupCount;
+
+		}
+
+		function generateCap( top ) {
+
+			// save the index of the first center vertex
+			const centerIndexStart = index;
+
+			const uv = new Vector2();
+			const vertex = new Vector3();
+
+			let groupCount = 0;
+
+			const radius = ( top === true ) ? radiusTop : radiusBottom;
+			const sign = ( top === true ) ? 1 : -1;
+
+			// first we generate the center vertex data of the cap.
+			// because the geometry needs one set of uvs per face,
+			// we must generate a center vertex per face/segment
+
+			for ( let x = 1; x <= radialSegments; x ++ ) {
+
+				// vertex
+
+				vertices.push( 0, halfHeight * sign, 0 );
+
+				// normal
+
+				normals.push( 0, sign, 0 );
+
+				// uv
+
+				uvs.push( 0.5, 0.5 );
+
+				// increase index
+
+				index ++;
+
+			}
+
+			// save the index of the last center vertex
+			const centerIndexEnd = index;
+
+			// now we generate the surrounding vertices, normals and uvs
+
+			for ( let x = 0; x <= radialSegments; x ++ ) {
+
+				const u = x / radialSegments;
+				const theta = u * thetaLength + thetaStart;
+
+				const cosTheta = Math.cos( theta );
+				const sinTheta = Math.sin( theta );
+
+				// vertex
+
+				vertex.x = radius * sinTheta;
+				vertex.y = halfHeight * sign;
+				vertex.z = radius * cosTheta;
+				vertices.push( vertex.x, vertex.y, vertex.z );
+
+				// normal
+
+				normals.push( 0, sign, 0 );
+
+				// uv
+
+				uv.x = ( cosTheta * 0.5 ) + 0.5;
+				uv.y = ( sinTheta * 0.5 * sign ) + 0.5;
+				uvs.push( uv.x, uv.y );
+
+				// increase index
+
+				index ++;
+
+			}
+
+			// generate indices
+
+			for ( let x = 0; x < radialSegments; x ++ ) {
+
+				const c = centerIndexStart + x;
+				const i = centerIndexEnd + x;
+
+				if ( top === true ) {
+
+					// face top
+
+					indices.push( i, i + 1, c );
+
+				} else {
+
+					// face bottom
+
+					indices.push( i + 1, i, c );
+
+				}
+
+				groupCount += 3;
+
+			}
+
+			// add a group to the geometry. this will ensure multi material support
+
+			scope.addGroup( groupStart, groupCount, top === true ? 1 : 2 );
+
+			// calculate new start value for groups
+
+			groupStart += groupCount;
+
+		}
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {CylinderGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new CylinderGeometry( data.radiusTop, data.radiusBottom, data.height, data.radialSegments, data.heightSegments, data.openEnded, data.thetaStart, data.thetaLength );
+
+	}
+
+}
+
+/**
+ * A geometry class for representing a cone.
+ *
+ * ```js
+ * const geometry = new THREE.ConeGeometry( 5, 20, 32 );
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00 } );
+ * const cone = new THREE.Mesh(geometry, material );
+ * scene.add( cone );
+ * ```
+ *
+ * @augments CylinderGeometry
+ * @demo scenes/geometry-browser.html#ConeGeometry
+ */
+class ConeGeometry extends CylinderGeometry {
+
+	/**
+	 * Constructs a new cone geometry.
+	 *
+	 * @param {number} [radius=1] - Radius of the cone base.
+	 * @param {number} [height=1] - Height of the cone.
+	 * @param {number} [radialSegments=32] - Number of segmented faces around the circumference of the cone.
+	 * @param {number} [heightSegments=1] - Number of rows of faces along the height of the cone.
+	 * @param {boolean} [openEnded=false] - Whether the base of the cone is open or capped.
+	 * @param {number} [thetaStart=0] - Start angle for first segment, in radians.
+	 * @param {number} [thetaLength=Math.PI*2] - The central angle, often called theta, of the circular sector, in radians.
+	 * The default value results in a complete cone.
+	 */
+	constructor( radius = 1, height = 1, radialSegments = 32, heightSegments = 1, openEnded = false, thetaStart = 0, thetaLength = Math.PI * 2 ) {
+
+		super( 0, radius, height, radialSegments, heightSegments, openEnded, thetaStart, thetaLength );
+
+		this.type = 'ConeGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			radius: radius,
+			height: height,
+			radialSegments: radialSegments,
+			heightSegments: heightSegments,
+			openEnded: openEnded,
+			thetaStart: thetaStart,
+			thetaLength: thetaLength
+		};
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {ConeGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new ConeGeometry( data.radius, data.height, data.radialSegments, data.heightSegments, data.openEnded, data.thetaStart, data.thetaLength );
+
+	}
+
+}
+
+/**
+ * A polyhedron is a solid in three dimensions with flat faces. This class
+ * will take an array of vertices, project them onto a sphere, and then
+ * divide them up to the desired level of detail.
+ *
+ * @augments BufferGeometry
+ */
+class PolyhedronGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new polyhedron geometry.
+	 *
+	 * @param {Array<number>} [vertices] - A flat array of vertices describing the base shape.
+	 * @param {Array<number>} [indices] - A flat array of indices describing the base shape.
+	 * @param {number} [radius=1] - The radius of the shape.
+	 * @param {number} [detail=0] - How many levels to subdivide the geometry. The more detail, the smoother the shape.
+	 */
+	constructor( vertices = [], indices = [], radius = 1, detail = 0 ) {
+
+		super();
+
+		this.type = 'PolyhedronGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			vertices: vertices,
+			indices: indices,
+			radius: radius,
+			detail: detail
+		};
+
+		// default buffer data
+
+		const vertexBuffer = [];
+		const uvBuffer = [];
+
+		// the subdivision creates the vertex buffer data
+
+		subdivide( detail );
+
+		// all vertices should lie on a conceptual sphere with a given radius
+
+		applyRadius( radius );
+
+		// finally, create the uv data
+
+		generateUVs();
+
+		// build non-indexed geometry
+
+		this.setAttribute( 'position', new Float32BufferAttribute( vertexBuffer, 3 ) );
+		this.setAttribute( 'normal', new Float32BufferAttribute( vertexBuffer.slice(), 3 ) );
+		this.setAttribute( 'uv', new Float32BufferAttribute( uvBuffer, 2 ) );
+
+		if ( detail === 0 ) {
+
+			this.computeVertexNormals(); // flat normals
+
+		} else {
+
+			this.normalizeNormals(); // smooth normals
+
+		}
+
+		// helper functions
+
+		function subdivide( detail ) {
+
+			const a = new Vector3();
+			const b = new Vector3();
+			const c = new Vector3();
+
+			// iterate over all faces and apply a subdivision with the given detail value
+
+			for ( let i = 0; i < indices.length; i += 3 ) {
+
+				// get the vertices of the face
+
+				getVertexByIndex( indices[ i + 0 ], a );
+				getVertexByIndex( indices[ i + 1 ], b );
+				getVertexByIndex( indices[ i + 2 ], c );
+
+				// perform subdivision
+
+				subdivideFace( a, b, c, detail );
+
+			}
+
+		}
+
+		function subdivideFace( a, b, c, detail ) {
+
+			const cols = detail + 1;
+
+			// we use this multidimensional array as a data structure for creating the subdivision
+
+			const v = [];
+
+			// construct all of the vertices for this subdivision
+
+			for ( let i = 0; i <= cols; i ++ ) {
+
+				v[ i ] = [];
+
+				const aj = a.clone().lerp( c, i / cols );
+				const bj = b.clone().lerp( c, i / cols );
+
+				const rows = cols - i;
+
+				for ( let j = 0; j <= rows; j ++ ) {
+
+					if ( j === 0 && i === cols ) {
+
+						v[ i ][ j ] = aj;
+
+					} else {
+
+						v[ i ][ j ] = aj.clone().lerp( bj, j / rows );
+
+					}
+
+				}
+
+			}
+
+			// construct all of the faces
+
+			for ( let i = 0; i < cols; i ++ ) {
+
+				for ( let j = 0; j < 2 * ( cols - i ) - 1; j ++ ) {
+
+					const k = Math.floor( j / 2 );
+
+					if ( j % 2 === 0 ) {
+
+						pushVertex( v[ i ][ k + 1 ] );
+						pushVertex( v[ i + 1 ][ k ] );
+						pushVertex( v[ i ][ k ] );
+
+					} else {
+
+						pushVertex( v[ i ][ k + 1 ] );
+						pushVertex( v[ i + 1 ][ k + 1 ] );
+						pushVertex( v[ i + 1 ][ k ] );
+
+					}
+
+				}
+
+			}
+
+		}
+
+		function applyRadius( radius ) {
+
+			const vertex = new Vector3();
+
+			// iterate over the entire buffer and apply the radius to each vertex
+
+			for ( let i = 0; i < vertexBuffer.length; i += 3 ) {
+
+				vertex.x = vertexBuffer[ i + 0 ];
+				vertex.y = vertexBuffer[ i + 1 ];
+				vertex.z = vertexBuffer[ i + 2 ];
+
+				vertex.normalize().multiplyScalar( radius );
+
+				vertexBuffer[ i + 0 ] = vertex.x;
+				vertexBuffer[ i + 1 ] = vertex.y;
+				vertexBuffer[ i + 2 ] = vertex.z;
+
+			}
+
+		}
+
+		function generateUVs() {
+
+			const vertex = new Vector3();
+
+			for ( let i = 0; i < vertexBuffer.length; i += 3 ) {
+
+				vertex.x = vertexBuffer[ i + 0 ];
+				vertex.y = vertexBuffer[ i + 1 ];
+				vertex.z = vertexBuffer[ i + 2 ];
+
+				const u = azimuth( vertex ) / 2 / Math.PI + 0.5;
+				const v = inclination( vertex ) / Math.PI + 0.5;
+				uvBuffer.push( u, 1 - v );
+
+			}
+
+			correctUVs();
+
+			correctSeam();
+
+		}
+
+		function correctSeam() {
+
+			// handle case when face straddles the seam, see #3269
+
+			for ( let i = 0; i < uvBuffer.length; i += 6 ) {
+
+				// uv data of a single face
+
+				const x0 = uvBuffer[ i + 0 ];
+				const x1 = uvBuffer[ i + 2 ];
+				const x2 = uvBuffer[ i + 4 ];
+
+				const max = Math.max( x0, x1, x2 );
+				const min = Math.min( x0, x1, x2 );
+
+				// 0.9 is somewhat arbitrary
+
+				if ( max > 0.9 && min < 0.1 ) {
+
+					if ( x0 < 0.2 ) uvBuffer[ i + 0 ] += 1;
+					if ( x1 < 0.2 ) uvBuffer[ i + 2 ] += 1;
+					if ( x2 < 0.2 ) uvBuffer[ i + 4 ] += 1;
+
+				}
+
+			}
+
+		}
+
+		function pushVertex( vertex ) {
+
+			vertexBuffer.push( vertex.x, vertex.y, vertex.z );
+
+		}
+
+		function getVertexByIndex( index, vertex ) {
+
+			const stride = index * 3;
+
+			vertex.x = vertices[ stride + 0 ];
+			vertex.y = vertices[ stride + 1 ];
+			vertex.z = vertices[ stride + 2 ];
+
+		}
+
+		function correctUVs() {
+
+			const a = new Vector3();
+			const b = new Vector3();
+			const c = new Vector3();
+
+			const centroid = new Vector3();
+
+			const uvA = new Vector2();
+			const uvB = new Vector2();
+			const uvC = new Vector2();
+
+			for ( let i = 0, j = 0; i < vertexBuffer.length; i += 9, j += 6 ) {
+
+				a.set( vertexBuffer[ i + 0 ], vertexBuffer[ i + 1 ], vertexBuffer[ i + 2 ] );
+				b.set( vertexBuffer[ i + 3 ], vertexBuffer[ i + 4 ], vertexBuffer[ i + 5 ] );
+				c.set( vertexBuffer[ i + 6 ], vertexBuffer[ i + 7 ], vertexBuffer[ i + 8 ] );
+
+				uvA.set( uvBuffer[ j + 0 ], uvBuffer[ j + 1 ] );
+				uvB.set( uvBuffer[ j + 2 ], uvBuffer[ j + 3 ] );
+				uvC.set( uvBuffer[ j + 4 ], uvBuffer[ j + 5 ] );
+
+				centroid.copy( a ).add( b ).add( c ).divideScalar( 3 );
+
+				const azi = azimuth( centroid );
+
+				correctUV( uvA, j + 0, a, azi );
+				correctUV( uvB, j + 2, b, azi );
+				correctUV( uvC, j + 4, c, azi );
+
+			}
+
+		}
+
+		function correctUV( uv, stride, vector, azimuth ) {
+
+			if ( ( azimuth < 0 ) && ( uv.x === 1 ) ) {
+
+				uvBuffer[ stride ] = uv.x - 1;
+
+			}
+
+			if ( ( vector.x === 0 ) && ( vector.z === 0 ) ) {
+
+				uvBuffer[ stride ] = azimuth / 2 / Math.PI + 0.5;
+
+			}
+
+		}
+
+		// Angle around the Y axis, counter-clockwise when looking from above.
+
+		function azimuth( vector ) {
+
+			return Math.atan2( vector.z, - vector.x );
+
+		}
+
+
+		// Angle above the XZ plane.
+
+		function inclination( vector ) {
+
+			return Math.atan2( - vector.y, Math.sqrt( ( vector.x * vector.x ) + ( vector.z * vector.z ) ) );
+
+		}
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {PolyhedronGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new PolyhedronGeometry( data.vertices, data.indices, data.radius, data.detail );
+
+	}
+
+}
+
+/**
+ * A geometry class for representing a dodecahedron.
+ *
+ * ```js
+ * const geometry = new THREE.DodecahedronGeometry();
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00 } );
+ * const dodecahedron = new THREE.Mesh( geometry, material );
+ * scene.add( dodecahedron );
+ * ```
+ *
+ * @augments PolyhedronGeometry
+ * @demo scenes/geometry-browser.html#DodecahedronGeometry
+ */
+class DodecahedronGeometry extends PolyhedronGeometry {
+
+	/**
+	 * Constructs a new dodecahedron geometry.
+	 *
+	 * @param {number} [radius=1] - Radius of the dodecahedron.
+	 * @param {number} [detail=0] - Setting this to a value greater than `0` adds vertices making it no longer a dodecahedron.
+	 */
+	constructor( radius = 1, detail = 0 ) {
+
+		const t = ( 1 + Math.sqrt( 5 ) ) / 2;
+		const r = 1 / t;
+
+		const vertices = [
+
+			// (±1, ±1, ±1)
+			-1, -1, -1,	-1, -1, 1,
+			-1, 1, -1, -1, 1, 1,
+			1, -1, -1, 1, -1, 1,
+			1, 1, -1, 1, 1, 1,
+
+			// (0, ±1/φ, ±φ)
+			0, - r, - t, 0, - r, t,
+			0, r, - t, 0, r, t,
+
+			// (±1/φ, ±φ, 0)
+			- r, - t, 0, - r, t, 0,
+			r, - t, 0, r, t, 0,
+
+			// (±φ, 0, ±1/φ)
+			- t, 0, - r, t, 0, - r,
+			- t, 0, r, t, 0, r
+		];
+
+		const indices = [
+			3, 11, 7, 	3, 7, 15, 	3, 15, 13,
+			7, 19, 17, 	7, 17, 6, 	7, 6, 15,
+			17, 4, 8, 	17, 8, 10, 	17, 10, 6,
+			8, 0, 16, 	8, 16, 2, 	8, 2, 10,
+			0, 12, 1, 	0, 1, 18, 	0, 18, 16,
+			6, 10, 2, 	6, 2, 13, 	6, 13, 15,
+			2, 16, 18, 	2, 18, 3, 	2, 3, 13,
+			18, 1, 9, 	18, 9, 11, 	18, 11, 3,
+			4, 14, 12, 	4, 12, 0, 	4, 0, 8,
+			11, 9, 5, 	11, 5, 19, 	11, 19, 7,
+			19, 5, 14, 	19, 14, 4, 	19, 4, 17,
+			1, 12, 14, 	1, 14, 5, 	1, 5, 9
+		];
+
+		super( vertices, indices, radius, detail );
+
+		this.type = 'DodecahedronGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			radius: radius,
+			detail: detail
+		};
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {DodecahedronGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new DodecahedronGeometry( data.radius, data.detail );
+
+	}
+
+}
+
+const _v0 = /*@__PURE__*/ new Vector3();
+const _v1$1 = /*@__PURE__*/ new Vector3();
+const _normal = /*@__PURE__*/ new Vector3();
+const _triangle = /*@__PURE__*/ new Triangle();
+
+/**
+ * Can be used as a helper object to view the edges of a geometry.
+ *
+ * ```js
+ * const geometry = new THREE.BoxGeometry();
+ * const edges = new THREE.EdgesGeometry( geometry );
+ * const line = new THREE.LineSegments( edges );
+ * scene.add( line );
+ * ```
+ *
+ * Note: It is not yet possible to serialize/deserialize instances of this class.
+ *
+ * @augments BufferGeometry
+ */
+class EdgesGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new edges geometry.
+	 *
+	 * @param {?BufferGeometry} [geometry=null] - The geometry.
+	 * @param {number} [thresholdAngle=1] - An edge is only rendered if the angle (in degrees)
+	 * between the face normals of the adjoining faces exceeds this value.
+	 */
+	constructor( geometry = null, thresholdAngle = 1 ) {
+
+		super();
+
+		this.type = 'EdgesGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			geometry: geometry,
+			thresholdAngle: thresholdAngle
+		};
+
+		if ( geometry !== null ) {
+
+			const precisionPoints = 4;
+			const precision = Math.pow( 10, precisionPoints );
+			const thresholdDot = Math.cos( DEG2RAD * thresholdAngle );
+
+			const indexAttr = geometry.getIndex();
+			const positionAttr = geometry.getAttribute( 'position' );
+			const indexCount = indexAttr ? indexAttr.count : positionAttr.count;
+
+			const indexArr = [ 0, 0, 0 ];
+			const vertKeys = [ 'a', 'b', 'c' ];
+			const hashes = new Array( 3 );
+
+			const edgeData = {};
+			const vertices = [];
+			for ( let i = 0; i < indexCount; i += 3 ) {
+
+				if ( indexAttr ) {
+
+					indexArr[ 0 ] = indexAttr.getX( i );
+					indexArr[ 1 ] = indexAttr.getX( i + 1 );
+					indexArr[ 2 ] = indexAttr.getX( i + 2 );
+
+				} else {
+
+					indexArr[ 0 ] = i;
+					indexArr[ 1 ] = i + 1;
+					indexArr[ 2 ] = i + 2;
+
+				}
+
+				const { a, b, c } = _triangle;
+				a.fromBufferAttribute( positionAttr, indexArr[ 0 ] );
+				b.fromBufferAttribute( positionAttr, indexArr[ 1 ] );
+				c.fromBufferAttribute( positionAttr, indexArr[ 2 ] );
+				_triangle.getNormal( _normal );
+
+				// create hashes for the edge from the vertices
+				hashes[ 0 ] = `${ Math.round( a.x * precision ) },${ Math.round( a.y * precision ) },${ Math.round( a.z * precision ) }`;
+				hashes[ 1 ] = `${ Math.round( b.x * precision ) },${ Math.round( b.y * precision ) },${ Math.round( b.z * precision ) }`;
+				hashes[ 2 ] = `${ Math.round( c.x * precision ) },${ Math.round( c.y * precision ) },${ Math.round( c.z * precision ) }`;
+
+				// skip degenerate triangles
+				if ( hashes[ 0 ] === hashes[ 1 ] || hashes[ 1 ] === hashes[ 2 ] || hashes[ 2 ] === hashes[ 0 ] ) {
+
+					continue;
+
+				}
+
+				// iterate over every edge
+				for ( let j = 0; j < 3; j ++ ) {
+
+					// get the first and next vertex making up the edge
+					const jNext = ( j + 1 ) % 3;
+					const vecHash0 = hashes[ j ];
+					const vecHash1 = hashes[ jNext ];
+					const v0 = _triangle[ vertKeys[ j ] ];
+					const v1 = _triangle[ vertKeys[ jNext ] ];
+
+					const hash = `${ vecHash0 }_${ vecHash1 }`;
+					const reverseHash = `${ vecHash1 }_${ vecHash0 }`;
+
+					if ( reverseHash in edgeData && edgeData[ reverseHash ] ) {
+
+						// if we found a sibling edge add it into the vertex array if
+						// it meets the angle threshold and delete the edge from the map.
+						if ( _normal.dot( edgeData[ reverseHash ].normal ) <= thresholdDot ) {
+
+							vertices.push( v0.x, v0.y, v0.z );
+							vertices.push( v1.x, v1.y, v1.z );
+
+						}
+
+						edgeData[ reverseHash ] = null;
+
+					} else if ( ! ( hash in edgeData ) ) {
+
+						// if we've already got an edge here then skip adding a new one
+						edgeData[ hash ] = {
+
+							index0: indexArr[ j ],
+							index1: indexArr[ jNext ],
+							normal: _normal.clone(),
+
+						};
+
+					}
+
+				}
+
+			}
+
+			// iterate over all remaining, unmatched edges and add them to the vertex array
+			for ( const key in edgeData ) {
+
+				if ( edgeData[ key ] ) {
+
+					const { index0, index1 } = edgeData[ key ];
+					_v0.fromBufferAttribute( positionAttr, index0 );
+					_v1$1.fromBufferAttribute( positionAttr, index1 );
+
+					vertices.push( _v0.x, _v0.y, _v0.z );
+					vertices.push( _v1$1.x, _v1$1.y, _v1$1.z );
+
+				}
+
+			}
+
+			this.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+
+		}
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+}
+
+/**
+ * An abstract base class for creating an analytic curve object that contains methods
+ * for interpolation.
+ *
+ * @abstract
+ */
+class Curve {
+
+	/**
+	 * Constructs a new curve.
+	 */
+	constructor() {
+
+		/**
+		 * The type property is used for detecting the object type
+		 * in context of serialization/deserialization.
+		 *
+		 * @type {string}
+		 * @readonly
+		 */
+		this.type = 'Curve';
+
+		/**
+		 * This value determines the amount of divisions when calculating the
+		 * cumulative segment lengths of a curve via {@link Curve#getLengths}. To ensure
+		 * precision when using methods like {@link Curve#getSpacedPoints}, it is
+		 * recommended to increase the value of this property if the curve is very large.
+		 *
+		 * @type {number}
+		 * @default 200
+		 */
+		this.arcLengthDivisions = 200;
+
+		/**
+		 * Must be set to `true` if the curve parameters have changed.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.needsUpdate = false;
+
+		/**
+		 * An internal cache that holds precomputed curve length values.
+		 *
+		 * @private
+		 * @type {?Array<number>}
+		 * @default null
+		 */
+		this.cacheArcLengths = null;
+
+	}
+
+	/**
+	 * This method returns a vector in 2D or 3D space (depending on the curve definition)
+	 * for the given interpolation factor.
+	 *
+	 * @abstract
+	 * @param {number} t - A interpolation factor representing a position on the curve. Must be in the range `[0,1]`.
+	 * @param {(Vector2|Vector3)} [optionalTarget] - The optional target vector the result is written to.
+	 * @return {(Vector2|Vector3)} The position on the curve. It can be a 2D or 3D vector depending on the curve definition.
+	 */
+	getPoint( /* t, optionalTarget */ ) {
+
+		warn( 'Curve: .getPoint() not implemented.' );
+
+	}
+
+	/**
+	 * This method returns a vector in 2D or 3D space (depending on the curve definition)
+	 * for the given interpolation factor. Unlike {@link Curve#getPoint}, this method honors the length
+	 * of the curve which equidistant samples.
+	 *
+	 * @param {number} u - A interpolation factor representing a position on the curve. Must be in the range `[0,1]`.
+	 * @param {(Vector2|Vector3)} [optionalTarget] - The optional target vector the result is written to.
+	 * @return {(Vector2|Vector3)} The position on the curve. It can be a 2D or 3D vector depending on the curve definition.
+	 */
+	getPointAt( u, optionalTarget ) {
+
+		const t = this.getUtoTmapping( u );
+		return this.getPoint( t, optionalTarget );
+
+	}
+
+	/**
+	 * This method samples the curve via {@link Curve#getPoint} and returns an array of points representing
+	 * the curve shape.
+	 *
+	 * @param {number} [divisions=5] - The number of divisions.
+	 * @return {Array<(Vector2|Vector3)>} An array holding the sampled curve values. The number of points is `divisions + 1`.
+	 */
+	getPoints( divisions = 5 ) {
+
+		const points = [];
+
+		for ( let d = 0; d <= divisions; d ++ ) {
+
+			points.push( this.getPoint( d / divisions ) );
+
+		}
+
+		return points;
+
+	}
+
+	// Get sequence of points using getPointAt( u )
+
+	/**
+	 * This method samples the curve via {@link Curve#getPointAt} and returns an array of points representing
+	 * the curve shape. Unlike {@link Curve#getPoints}, this method returns equi-spaced points across the entire
+	 * curve.
+	 *
+	 * @param {number} [divisions=5] - The number of divisions.
+	 * @return {Array<(Vector2|Vector3)>} An array holding the sampled curve values. The number of points is `divisions + 1`.
+	 */
+	getSpacedPoints( divisions = 5 ) {
+
+		const points = [];
+
+		for ( let d = 0; d <= divisions; d ++ ) {
+
+			points.push( this.getPointAt( d / divisions ) );
+
+		}
+
+		return points;
+
+	}
+
+	/**
+	 * Returns the total arc length of the curve.
+	 *
+	 * @return {number} The length of the curve.
+	 */
+	getLength() {
+
+		const lengths = this.getLengths();
+		return lengths[ lengths.length - 1 ];
+
+	}
+
+	/**
+	 * Returns an array of cumulative segment lengths of the curve.
+	 *
+	 * @param {number} [divisions=this.arcLengthDivisions] - The number of divisions.
+	 * @return {Array<number>} An array holding the cumulative segment lengths.
+	 */
+	getLengths( divisions = this.arcLengthDivisions ) {
+
+		if ( this.cacheArcLengths &&
+			( this.cacheArcLengths.length === divisions + 1 ) &&
+			! this.needsUpdate ) {
+
+			return this.cacheArcLengths;
+
+		}
+
+		this.needsUpdate = false;
+
+		const cache = [];
+		let current, last = this.getPoint( 0 );
+		let sum = 0;
+
+		cache.push( 0 );
+
+		for ( let p = 1; p <= divisions; p ++ ) {
+
+			current = this.getPoint( p / divisions );
+			sum += current.distanceTo( last );
+			cache.push( sum );
+			last = current;
+
+		}
+
+		this.cacheArcLengths = cache;
+
+		return cache; // { sums: cache, sum: sum }; Sum is in the last element.
+
+	}
+
+	/**
+	 * Update the cumulative segment distance cache. The method must be called
+	 * every time curve parameters are changed. If an updated curve is part of a
+	 * composed curve like {@link CurvePath}, this method must be called on the
+	 * composed curve, too.
+	 */
+	updateArcLengths() {
+
+		this.needsUpdate = true;
+		this.getLengths();
+
+	}
+
+	/**
+	 * Given an interpolation factor in the range `[0,1]`, this method returns an updated
+	 * interpolation factor in the same range that can be ued to sample equidistant points
+	 * from a curve.
+	 *
+	 * @param {number} u - The interpolation factor.
+	 * @param {?number} distance - An optional distance on the curve.
+	 * @return {number} The updated interpolation factor.
+	 */
+	getUtoTmapping( u, distance = null ) {
+
+		const arcLengths = this.getLengths();
+
+		let i = 0;
+		const il = arcLengths.length;
+
+		let targetArcLength; // The targeted u distance value to get
+
+		if ( distance ) {
+
+			targetArcLength = distance;
+
+		} else {
+
+			targetArcLength = u * arcLengths[ il - 1 ];
+
+		}
+
+		// binary search for the index with largest value smaller than target u distance
+
+		let low = 0, high = il - 1, comparison;
+
+		while ( low <= high ) {
+
+			i = Math.floor( low + ( high - low ) / 2 ); // less likely to overflow, though probably not issue here, JS doesn't really have integers, all numbers are floats
+
+			comparison = arcLengths[ i ] - targetArcLength;
+
+			if ( comparison < 0 ) {
+
+				low = i + 1;
+
+			} else if ( comparison > 0 ) {
+
+				high = i - 1;
+
+			} else {
+
+				high = i;
+				break;
+
+				// DONE
+
+			}
+
+		}
+
+		i = high;
+
+		if ( arcLengths[ i ] === targetArcLength ) {
+
+			return i / ( il - 1 );
+
+		}
+
+		// we could get finer grain at lengths, or use simple interpolation between two points
+
+		const lengthBefore = arcLengths[ i ];
+		const lengthAfter = arcLengths[ i + 1 ];
+
+		const segmentLength = lengthAfter - lengthBefore;
+
+		// determine where we are between the 'before' and 'after' points
+
+		const segmentFraction = ( targetArcLength - lengthBefore ) / segmentLength;
+
+		// add that fractional amount to t
+
+		const t = ( i + segmentFraction ) / ( il - 1 );
+
+		return t;
+
+	}
+
+	/**
+	 * Returns a unit vector tangent for the given interpolation factor.
+	 * If the derived curve does not implement its tangent derivation,
+	 * two points a small delta apart will be used to find its gradient
+	 * which seems to give a reasonable approximation.
+	 *
+	 * @param {number} t - The interpolation factor.
+	 * @param {(Vector2|Vector3)} [optionalTarget] - The optional target vector the result is written to.
+	 * @return {(Vector2|Vector3)} The tangent vector.
+	 */
+	getTangent( t, optionalTarget ) {
+
+		const delta = 0.0001;
+		let t1 = t - delta;
+		let t2 = t + delta;
+
+		// Capping in case of danger
+
+		if ( t1 < 0 ) t1 = 0;
+		if ( t2 > 1 ) t2 = 1;
+
+		const pt1 = this.getPoint( t1 );
+		const pt2 = this.getPoint( t2 );
+
+		const tangent = optionalTarget || ( ( pt1.isVector2 ) ? new Vector2() : new Vector3() );
+
+		tangent.copy( pt2 ).sub( pt1 ).normalize();
+
+		return tangent;
+
+	}
+
+	/**
+	 * Same as {@link Curve#getTangent} but with equidistant samples.
+	 *
+	 * @param {number} u - The interpolation factor.
+	 * @param {(Vector2|Vector3)} [optionalTarget] - The optional target vector the result is written to.
+	 * @return {(Vector2|Vector3)} The tangent vector.
+	 * @see {@link Curve#getPointAt}
+	 */
+	getTangentAt( u, optionalTarget ) {
+
+		const t = this.getUtoTmapping( u );
+		return this.getTangent( t, optionalTarget );
+
+	}
+
+	/**
+	 * Generates the Frenet Frames. Requires a curve definition in 3D space. Used
+	 * in geometries like {@link TubeGeometry} or {@link ExtrudeGeometry}.
+	 *
+	 * @param {number} segments - The number of segments.
+	 * @param {boolean} [closed=false] - Whether the curve is closed or not.
+	 * @return {{tangents: Array<Vector3>, normals: Array<Vector3>, binormals: Array<Vector3>}} The Frenet Frames.
+	 */
+	computeFrenetFrames( segments, closed = false ) {
+
+		// see http://www.cs.indiana.edu/pub/techreports/TR425.pdf
+
+		const normal = new Vector3();
+
+		const tangents = [];
+		const normals = [];
+		const binormals = [];
+
+		const vec = new Vector3();
+		const mat = new Matrix4();
+
+		// compute the tangent vectors for each segment on the curve
+
+		for ( let i = 0; i <= segments; i ++ ) {
+
+			const u = i / segments;
+
+			tangents[ i ] = this.getTangentAt( u, new Vector3() );
+
+		}
+
+		// select an initial normal vector perpendicular to the first tangent vector,
+		// and in the direction of the minimum tangent xyz component
+
+		normals[ 0 ] = new Vector3();
+		binormals[ 0 ] = new Vector3();
+		let min = Number.MAX_VALUE;
+		const tx = Math.abs( tangents[ 0 ].x );
+		const ty = Math.abs( tangents[ 0 ].y );
+		const tz = Math.abs( tangents[ 0 ].z );
+
+		if ( tx <= min ) {
+
+			min = tx;
+			normal.set( 1, 0, 0 );
+
+		}
+
+		if ( ty <= min ) {
+
+			min = ty;
+			normal.set( 0, 1, 0 );
+
+		}
+
+		if ( tz <= min ) {
+
+			normal.set( 0, 0, 1 );
+
+		}
+
+		vec.crossVectors( tangents[ 0 ], normal ).normalize();
+
+		normals[ 0 ].crossVectors( tangents[ 0 ], vec );
+		binormals[ 0 ].crossVectors( tangents[ 0 ], normals[ 0 ] );
+
+
+		// compute the slowly-varying normal and binormal vectors for each segment on the curve
+
+		for ( let i = 1; i <= segments; i ++ ) {
+
+			normals[ i ] = normals[ i - 1 ].clone();
+
+			binormals[ i ] = binormals[ i - 1 ].clone();
+
+			vec.crossVectors( tangents[ i - 1 ], tangents[ i ] );
+
+			if ( vec.length() > Number.EPSILON ) {
+
+				vec.normalize();
+
+				const theta = Math.acos( clamp( tangents[ i - 1 ].dot( tangents[ i ] ), -1, 1 ) ); // clamp for floating pt errors
+
+				normals[ i ].applyMatrix4( mat.makeRotationAxis( vec, theta ) );
+
+			}
+
+			binormals[ i ].crossVectors( tangents[ i ], normals[ i ] );
+
+		}
+
+		// if the curve is closed, postprocess the vectors so the first and last normal vectors are the same
+
+		if ( closed === true ) {
+
+			let theta = Math.acos( clamp( normals[ 0 ].dot( normals[ segments ] ), -1, 1 ) );
+			theta /= segments;
+
+			if ( tangents[ 0 ].dot( vec.crossVectors( normals[ 0 ], normals[ segments ] ) ) > 0 ) {
+
+				theta = - theta;
+
+			}
+
+			for ( let i = 1; i <= segments; i ++ ) {
+
+				// twist a little...
+				normals[ i ].applyMatrix4( mat.makeRotationAxis( tangents[ i ], theta * i ) );
+				binormals[ i ].crossVectors( tangents[ i ], normals[ i ] );
+
+			}
+
+		}
+
+		return {
+			tangents: tangents,
+			normals: normals,
+			binormals: binormals
+		};
+
+	}
+
+	/**
+	 * Returns a new curve with copied values from this instance.
+	 *
+	 * @return {Curve} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+	/**
+	 * Copies the values of the given curve to this instance.
+	 *
+	 * @param {Curve} source - The curve to copy.
+	 * @return {Curve} A reference to this curve.
+	 */
+	copy( source ) {
+
+		this.arcLengthDivisions = source.arcLengthDivisions;
+
+		return this;
+
+	}
+
+	/**
+	 * Serializes the curve into JSON.
+	 *
+	 * @return {Object} A JSON object representing the serialized curve.
+	 * @see {@link ObjectLoader#parse}
+	 */
+	toJSON() {
+
+		const data = {
+			metadata: {
+				version: 4.7,
+				type: 'Curve',
+				generator: 'Curve.toJSON'
+			}
+		};
+
+		data.arcLengthDivisions = this.arcLengthDivisions;
+		data.type = this.type;
+
+		return data;
+
+	}
+
+	/**
+	 * Deserializes the curve from the given JSON.
+	 *
+	 * @param {Object} json - The JSON holding the serialized curve.
+	 * @return {Curve} A reference to this curve.
+	 */
+	fromJSON( json ) {
+
+		this.arcLengthDivisions = json.arcLengthDivisions;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A curve representing an ellipse.
+ *
+ * ```js
+ * const curve = new THREE.EllipseCurve(
+ * 	0, 0,
+ * 	10, 10,
+ * 	0, 2 * Math.PI,
+ * 	false,
+ * 	0
+ * );
+ *
+ * const points = curve.getPoints( 50 );
+ * const geometry = new THREE.BufferGeometry().setFromPoints( points );
+ *
+ * const material = new THREE.LineBasicMaterial( { color: 0xff0000 } );
+ *
+ * // Create the final object to add to the scene
+ * const ellipse = new THREE.Line( geometry, material );
+ * ```
+ *
+ * @augments Curve
+ */
+class EllipseCurve extends Curve {
+
+	/**
+	 * Constructs a new ellipse curve.
+	 *
+	 * @param {number} [aX=0] - The X center of the ellipse.
+	 * @param {number} [aY=0] - The Y center of the ellipse.
+	 * @param {number} [xRadius=1] - The radius of the ellipse in the x direction.
+	 * @param {number} [yRadius=1] - The radius of the ellipse in the y direction.
+	 * @param {number} [aStartAngle=0] - The start angle of the curve in radians starting from the positive X axis.
+	 * @param {number} [aEndAngle=Math.PI*2] - The end angle of the curve in radians starting from the positive X axis.
+	 * @param {boolean} [aClockwise=false] - Whether the ellipse is drawn clockwise or not.
+	 * @param {number} [aRotation=0] - The rotation angle of the ellipse in radians, counterclockwise from the positive X axis.
+	 */
+	constructor( aX = 0, aY = 0, xRadius = 1, yRadius = 1, aStartAngle = 0, aEndAngle = Math.PI * 2, aClockwise = false, aRotation = 0 ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isEllipseCurve = true;
+
+		this.type = 'EllipseCurve';
+
+		/**
+		 * The X center of the ellipse.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.aX = aX;
+
+		/**
+		 * The Y center of the ellipse.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.aY = aY;
+
+		/**
+		 * The radius of the ellipse in the x direction.
+		 * Setting the this value equal to the {@link EllipseCurve#yRadius} will result in a circle.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.xRadius = xRadius;
+
+		/**
+		 * The radius of the ellipse in the y direction.
+		 * Setting the this value equal to the {@link EllipseCurve#xRadius} will result in a circle.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.yRadius = yRadius;
+
+		/**
+		 * The start angle of the curve in radians starting from the positive X axis.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.aStartAngle = aStartAngle;
+
+		/**
+		 * The end angle of the curve in radians starting from the positive X axis.
+		 *
+		 * @type {number}
+		 * @default Math.PI*2
+		 */
+		this.aEndAngle = aEndAngle;
+
+		/**
+		 * Whether the ellipse is drawn clockwise or not.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.aClockwise = aClockwise;
+
+		/**
+		 * The rotation angle of the ellipse in radians, counterclockwise from the positive X axis.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.aRotation = aRotation;
+
+	}
+
+	/**
+	 * Returns a point on the curve.
+	 *
+	 * @param {number} t - A interpolation factor representing a position on the curve. Must be in the range `[0,1]`.
+	 * @param {Vector2} [optionalTarget] - The optional target vector the result is written to.
+	 * @return {Vector2} The position on the curve.
+	 */
+	getPoint( t, optionalTarget = new Vector2() ) {
+
+		const point = optionalTarget;
+
+		const twoPi = Math.PI * 2;
+		let deltaAngle = this.aEndAngle - this.aStartAngle;
+		const samePoints = Math.abs( deltaAngle ) < Number.EPSILON;
+
+		// ensures that deltaAngle is 0 .. 2 PI
+		while ( deltaAngle < 0 ) deltaAngle += twoPi;
+		while ( deltaAngle > twoPi ) deltaAngle -= twoPi;
+
+		if ( deltaAngle < Number.EPSILON ) {
+
+			if ( samePoints ) {
+
+				deltaAngle = 0;
+
+			} else {
+
+				deltaAngle = twoPi;
+
+			}
+
+		}
+
+		if ( this.aClockwise === true && ! samePoints ) {
+
+			if ( deltaAngle === twoPi ) {
+
+				deltaAngle = - twoPi;
+
+			} else {
+
+				deltaAngle = deltaAngle - twoPi;
+
+			}
+
+		}
+
+		const angle = this.aStartAngle + t * deltaAngle;
+		let x = this.aX + this.xRadius * Math.cos( angle );
+		let y = this.aY + this.yRadius * Math.sin( angle );
+
+		if ( this.aRotation !== 0 ) {
+
+			const cos = Math.cos( this.aRotation );
+			const sin = Math.sin( this.aRotation );
+
+			const tx = x - this.aX;
+			const ty = y - this.aY;
+
+			// Rotate the point about the center of the ellipse.
+			x = tx * cos - ty * sin + this.aX;
+			y = tx * sin + ty * cos + this.aY;
+
+		}
+
+		return point.set( x, y );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.aX = source.aX;
+		this.aY = source.aY;
+
+		this.xRadius = source.xRadius;
+		this.yRadius = source.yRadius;
+
+		this.aStartAngle = source.aStartAngle;
+		this.aEndAngle = source.aEndAngle;
+
+		this.aClockwise = source.aClockwise;
+
+		this.aRotation = source.aRotation;
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.aX = this.aX;
+		data.aY = this.aY;
+
+		data.xRadius = this.xRadius;
+		data.yRadius = this.yRadius;
+
+		data.aStartAngle = this.aStartAngle;
+		data.aEndAngle = this.aEndAngle;
+
+		data.aClockwise = this.aClockwise;
+
+		data.aRotation = this.aRotation;
+
+		return data;
+
+	}
+
+	fromJSON( json ) {
+
+		super.fromJSON( json );
+
+		this.aX = json.aX;
+		this.aY = json.aY;
+
+		this.xRadius = json.xRadius;
+		this.yRadius = json.yRadius;
+
+		this.aStartAngle = json.aStartAngle;
+		this.aEndAngle = json.aEndAngle;
+
+		this.aClockwise = json.aClockwise;
+
+		this.aRotation = json.aRotation;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A curve representing an arc.
+ *
+ * @augments EllipseCurve
+ */
+class ArcCurve extends EllipseCurve {
+
+	/**
+	 * Constructs a new arc curve.
+	 *
+	 * @param {number} [aX=0] - The X center of the ellipse.
+	 * @param {number} [aY=0] - The Y center of the ellipse.
+	 * @param {number} [aRadius=1] - The radius of the ellipse in the x direction.
+	 * @param {number} [aStartAngle=0] - The start angle of the curve in radians starting from the positive X axis.
+	 * @param {number} [aEndAngle=Math.PI*2] - The end angle of the curve in radians starting from the positive X axis.
+	 * @param {boolean} [aClockwise=false] - Whether the ellipse is drawn clockwise or not.
+	 */
+	constructor( aX, aY, aRadius, aStartAngle, aEndAngle, aClockwise ) {
+
+		super( aX, aY, aRadius, aRadius, aStartAngle, aEndAngle, aClockwise );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isArcCurve = true;
+
+		this.type = 'ArcCurve';
+
+	}
+
+}
+
+function CubicPoly() {
+
+	/**
+	 * Centripetal CatmullRom Curve - which is useful for avoiding
+	* cusps and self-intersections in non-uniform catmull rom curves.
+	* http://www.cemyuksel.com/research/catmullrom_param/catmullrom.pdf
+	*
+	* curve.type accepts centripetal(default), chordal and catmullrom
+	* curve.tension is used for catmullrom which defaults to 0.5
+	*/
+
+	/*
+	Based on an optimized c++ solution in
+	- http://stackoverflow.com/questions/9489736/catmull-rom-curve-with-no-cusps-and-no-self-intersections/
+	- http://ideone.com/NoEbVM
+
+	This CubicPoly class could be used for reusing some variables and calculations,
+	but for three.js curve use, it could be possible inlined and flatten into a single function call
+	which can be placed in CurveUtils.
+	*/
+
+	let c0 = 0, c1 = 0, c2 = 0, c3 = 0;
+
+	/*
+	 * Compute coefficients for a cubic polynomial
+	 *   p(s) = c0 + c1*s + c2*s^2 + c3*s^3
+	 * such that
+	 *   p(0) = x0, p(1) = x1
+	 *  and
+	 *   p'(0) = t0, p'(1) = t1.
+	 */
+	function init( x0, x1, t0, t1 ) {
+
+		c0 = x0;
+		c1 = t0;
+		c2 = -3 * x0 + 3 * x1 - 2 * t0 - t1;
+		c3 = 2 * x0 - 2 * x1 + t0 + t1;
+
+	}
+
+	return {
+
+		initCatmullRom: function ( x0, x1, x2, x3, tension ) {
+
+			init( x1, x2, tension * ( x2 - x0 ), tension * ( x3 - x1 ) );
+
+		},
+
+		initNonuniformCatmullRom: function ( x0, x1, x2, x3, dt0, dt1, dt2 ) {
+
+			// compute tangents when parameterized in [t1,t2]
+			let t1 = ( x1 - x0 ) / dt0 - ( x2 - x0 ) / ( dt0 + dt1 ) + ( x2 - x1 ) / dt1;
+			let t2 = ( x2 - x1 ) / dt1 - ( x3 - x1 ) / ( dt1 + dt2 ) + ( x3 - x2 ) / dt2;
+
+			// rescale tangents for parametrization in [0,1]
+			t1 *= dt1;
+			t2 *= dt1;
+
+			init( x1, x2, t1, t2 );
+
+		},
+
+		calc: function ( t ) {
+
+			const t2 = t * t;
+			const t3 = t2 * t;
+			return c0 + c1 * t + c2 * t2 + c3 * t3;
+
+		}
+
+	};
+
+}
+
+//
+
+const tmp = /*@__PURE__*/ new Vector3();
+const tmp2 = /*@__PURE__*/ new Vector3();
+const px = /*@__PURE__*/ new CubicPoly();
+const py = /*@__PURE__*/ new CubicPoly();
+const pz = /*@__PURE__*/ new CubicPoly();
+
+/**
+ * A curve representing a Catmull-Rom spline.
+ *
+ * ```js
+ * //Create a closed wavey loop
+ * const curve = new THREE.CatmullRomCurve3( [
+ * 	new THREE.Vector3( -10, 0, 10 ),
+ * 	new THREE.Vector3( -5, 5, 5 ),
+ * 	new THREE.Vector3( 0, 0, 0 ),
+ * 	new THREE.Vector3( 5, -5, 5 ),
+ * 	new THREE.Vector3( 10, 0, 10 )
+ * ] );
+ *
+ * const points = curve.getPoints( 50 );
+ * const geometry = new THREE.BufferGeometry().setFromPoints( points );
+ *
+ * const material = new THREE.LineBasicMaterial( { color: 0xff0000 } );
+ *
+ * // Create the final object to add to the scene
+ * const curveObject = new THREE.Line( geometry, material );
+ * ```
+ *
+ * @augments Curve
+ */
+class CatmullRomCurve3 extends Curve {
+
+	/**
+	 * Constructs a new Catmull-Rom curve.
+	 *
+	 * @param {Array<Vector3>} [points] - An array of 3D points defining the curve.
+	 * @param {boolean} [closed=false] - Whether the curve is closed or not.
+	 * @param {('centripetal'|'chordal'|'catmullrom')} [curveType='centripetal'] - The curve type.
+	 * @param {number} [tension=0.5] - Tension of the curve.
+	 */
+	constructor( points = [], closed = false, curveType = 'centripetal', tension = 0.5 ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isCatmullRomCurve3 = true;
+
+		this.type = 'CatmullRomCurve3';
+
+		/**
+		 * An array of 3D points defining the curve.
+		 *
+		 * @type {Array<Vector3>}
+		 */
+		this.points = points;
+
+		/**
+		 * Whether the curve is closed or not.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.closed = closed;
+
+		/**
+		 * The curve type.
+		 *
+		 * @type {('centripetal'|'chordal'|'catmullrom')}
+		 * @default 'centripetal'
+		 */
+		this.curveType = curveType;
+
+		/**
+		 * Tension of the curve.
+		 *
+		 * @type {number}
+		 * @default 0.5
+		 */
+		this.tension = tension;
+
+	}
+
+	/**
+	 * Returns a point on the curve.
+	 *
+	 * @param {number} t - A interpolation factor representing a position on the curve. Must be in the range `[0,1]`.
+	 * @param {Vector3} [optionalTarget] - The optional target vector the result is written to.
+	 * @return {Vector3} The position on the curve.
+	 */
+	getPoint( t, optionalTarget = new Vector3() ) {
+
+		const point = optionalTarget;
+
+		const points = this.points;
+		const l = points.length;
+
+		const p = ( l - ( this.closed ? 0 : 1 ) ) * t;
+		let intPoint = Math.floor( p );
+		let weight = p - intPoint;
+
+		if ( this.closed ) {
+
+			intPoint += intPoint > 0 ? 0 : ( Math.floor( Math.abs( intPoint ) / l ) + 1 ) * l;
+
+		} else if ( weight === 0 && intPoint === l - 1 ) {
+
+			intPoint = l - 2;
+			weight = 1;
+
+		}
+
+		let p0, p3; // 4 points (p1 & p2 defined below)
+
+		if ( this.closed || intPoint > 0 ) {
+
+			p0 = points[ ( intPoint - 1 ) % l ];
+
+		} else {
+
+			// extrapolate first point
+			tmp2.subVectors( points[ 0 ], points[ 1 ] ).add( points[ 0 ] );
+			p0 = tmp2;
+
+		}
+
+		const p1 = points[ intPoint % l ];
+		const p2 = points[ ( intPoint + 1 ) % l ];
+
+		if ( this.closed || intPoint + 2 < l ) {
+
+			p3 = points[ ( intPoint + 2 ) % l ];
+
+		} else {
+
+			// extrapolate last point
+			tmp.subVectors( points[ l - 1 ], points[ l - 2 ] ).add( points[ l - 1 ] );
+			p3 = tmp;
+
+		}
+
+		if ( this.curveType === 'centripetal' || this.curveType === 'chordal' ) {
+
+			// init Centripetal / Chordal Catmull-Rom
+			const pow = this.curveType === 'chordal' ? 0.5 : 0.25;
+			let dt0 = Math.pow( p0.distanceToSquared( p1 ), pow );
+			let dt1 = Math.pow( p1.distanceToSquared( p2 ), pow );
+			let dt2 = Math.pow( p2.distanceToSquared( p3 ), pow );
+
+			// safety check for repeated points
+			if ( dt1 < 1e-4 ) dt1 = 1.0;
+			if ( dt0 < 1e-4 ) dt0 = dt1;
+			if ( dt2 < 1e-4 ) dt2 = dt1;
+
+			px.initNonuniformCatmullRom( p0.x, p1.x, p2.x, p3.x, dt0, dt1, dt2 );
+			py.initNonuniformCatmullRom( p0.y, p1.y, p2.y, p3.y, dt0, dt1, dt2 );
+			pz.initNonuniformCatmullRom( p0.z, p1.z, p2.z, p3.z, dt0, dt1, dt2 );
+
+		} else if ( this.curveType === 'catmullrom' ) {
+
+			px.initCatmullRom( p0.x, p1.x, p2.x, p3.x, this.tension );
+			py.initCatmullRom( p0.y, p1.y, p2.y, p3.y, this.tension );
+			pz.initCatmullRom( p0.z, p1.z, p2.z, p3.z, this.tension );
+
+		}
+
+		point.set(
+			px.calc( weight ),
+			py.calc( weight ),
+			pz.calc( weight )
+		);
+
+		return point;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.points = [];
+
+		for ( let i = 0, l = source.points.length; i < l; i ++ ) {
+
+			const point = source.points[ i ];
+
+			this.points.push( point.clone() );
+
+		}
+
+		this.closed = source.closed;
+		this.curveType = source.curveType;
+		this.tension = source.tension;
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.points = [];
+
+		for ( let i = 0, l = this.points.length; i < l; i ++ ) {
+
+			const point = this.points[ i ];
+			data.points.push( point.toArray() );
+
+		}
+
+		data.closed = this.closed;
+		data.curveType = this.curveType;
+		data.tension = this.tension;
+
+		return data;
+
+	}
+
+	fromJSON( json ) {
+
+		super.fromJSON( json );
+
+		this.points = [];
+
+		for ( let i = 0, l = json.points.length; i < l; i ++ ) {
+
+			const point = json.points[ i ];
+			this.points.push( new Vector3().fromArray( point ) );
+
+		}
+
+		this.closed = json.closed;
+		this.curveType = json.curveType;
+		this.tension = json.tension;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * Interpolations contains spline and Bézier functions internally used by concrete curve classes.
+ *
+ * Bezier Curves formulas obtained from: https://en.wikipedia.org/wiki/B%C3%A9zier_curve
+ *
+ * @module Interpolations
+ */
+
+/**
+ * Computes a point on a Catmull-Rom spline.
+ *
+ * @param {number} t - The interpolation factor.
+ * @param {number} p0 - The first control point.
+ * @param {number} p1 - The second control point.
+ * @param {number} p2 - The third control point.
+ * @param {number} p3 - The fourth control point.
+ * @return {number} The calculated point on a Catmull-Rom spline.
+ */
+function CatmullRom( t, p0, p1, p2, p3 ) {
+
+	const v0 = ( p2 - p0 ) * 0.5;
+	const v1 = ( p3 - p1 ) * 0.5;
+	const t2 = t * t;
+	const t3 = t * t2;
+	return ( 2 * p1 - 2 * p2 + v0 + v1 ) * t3 + ( -3 * p1 + 3 * p2 - 2 * v0 - v1 ) * t2 + v0 * t + p1;
+
+}
+
+//
+
+function QuadraticBezierP0( t, p ) {
+
+	const k = 1 - t;
+	return k * k * p;
+
+}
+
+function QuadraticBezierP1( t, p ) {
+
+	return 2 * ( 1 - t ) * t * p;
+
+}
+
+function QuadraticBezierP2( t, p ) {
+
+	return t * t * p;
+
+}
+
+/**
+ * Computes a point on a Quadratic Bezier curve.
+ *
+ * @param {number} t - The interpolation factor.
+ * @param {number} p0 - The first control point.
+ * @param {number} p1 - The second control point.
+ * @param {number} p2 - The third control point.
+ * @return {number} The calculated point on a Quadratic Bezier curve.
+ */
+function QuadraticBezier( t, p0, p1, p2 ) {
+
+	return QuadraticBezierP0( t, p0 ) + QuadraticBezierP1( t, p1 ) +
+		QuadraticBezierP2( t, p2 );
+
+}
+
+//
+
+function CubicBezierP0( t, p ) {
+
+	const k = 1 - t;
+	return k * k * k * p;
+
+}
+
+function CubicBezierP1( t, p ) {
+
+	const k = 1 - t;
+	return 3 * k * k * t * p;
+
+}
+
+function CubicBezierP2( t, p ) {
+
+	return 3 * ( 1 - t ) * t * t * p;
+
+}
+
+function CubicBezierP3( t, p ) {
+
+	return t * t * t * p;
+
+}
+
+/**
+ * Computes a point on a Cubic Bezier curve.
+ *
+ * @param {number} t - The interpolation factor.
+ * @param {number} p0 - The first control point.
+ * @param {number} p1 - The second control point.
+ * @param {number} p2 - The third control point.
+ * @param {number} p3 - The fourth control point.
+ * @return {number} The calculated point on a Cubic Bezier curve.
+ */
+function CubicBezier( t, p0, p1, p2, p3 ) {
+
+	return CubicBezierP0( t, p0 ) + CubicBezierP1( t, p1 ) + CubicBezierP2( t, p2 ) +
+		CubicBezierP3( t, p3 );
+
+}
+
+/**
+ * A curve representing a 2D Cubic Bezier curve.
+ *
+ * ```js
+ * const curve = new THREE.CubicBezierCurve(
+ * 	new THREE.Vector2( - 0, 0 ),
+ * 	new THREE.Vector2( - 5, 15 ),
+ * 	new THREE.Vector2( 20, 15 ),
+ * 	new THREE.Vector2( 10, 0 )
+ * );
+ *
+ * const points = curve.getPoints( 50 );
+ * const geometry = new THREE.BufferGeometry().setFromPoints( points );
+ *
+ * const material = new THREE.LineBasicMaterial( { color: 0xff0000 } );
+ *
+ * // Create the final object to add to the scene
+ * const curveObject = new THREE.Line( geometry, material );
+ * ```
+ *
+ * @augments Curve
+ */
+class CubicBezierCurve extends Curve {
+
+	/**
+	 * Constructs a new Cubic Bezier curve.
+	 *
+	 * @param {Vector2} [v0] - The start point.
+	 * @param {Vector2} [v1] - The first control point.
+	 * @param {Vector2} [v2] - The second control point.
+	 * @param {Vector2} [v3] - The end point.
+	 */
+	constructor( v0 = new Vector2(), v1 = new Vector2(), v2 = new Vector2(), v3 = new Vector2() ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isCubicBezierCurve = true;
+
+		this.type = 'CubicBezierCurve';
+
+		/**
+		 * The start point.
+		 *
+		 * @type {Vector2}
+		 */
+		this.v0 = v0;
+
+		/**
+		 * The first control point.
+		 *
+		 * @type {Vector2}
+		 */
+		this.v1 = v1;
+
+		/**
+		 * The second control point.
+		 *
+		 * @type {Vector2}
+		 */
+		this.v2 = v2;
+
+		/**
+		 * The end point.
+		 *
+		 * @type {Vector2}
+		 */
+		this.v3 = v3;
+
+	}
+
+	/**
+	 * Returns a point on the curve.
+	 *
+	 * @param {number} t - A interpolation factor representing a position on the curve. Must be in the range `[0,1]`.
+	 * @param {Vector2} [optionalTarget] - The optional target vector the result is written to.
+	 * @return {Vector2} The position on the curve.
+	 */
+	getPoint( t, optionalTarget = new Vector2() ) {
+
+		const point = optionalTarget;
+
+		const v0 = this.v0, v1 = this.v1, v2 = this.v2, v3 = this.v3;
+
+		point.set(
+			CubicBezier( t, v0.x, v1.x, v2.x, v3.x ),
+			CubicBezier( t, v0.y, v1.y, v2.y, v3.y )
+		);
+
+		return point;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.v0.copy( source.v0 );
+		this.v1.copy( source.v1 );
+		this.v2.copy( source.v2 );
+		this.v3.copy( source.v3 );
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.v0 = this.v0.toArray();
+		data.v1 = this.v1.toArray();
+		data.v2 = this.v2.toArray();
+		data.v3 = this.v3.toArray();
+
+		return data;
+
+	}
+
+	fromJSON( json ) {
+
+		super.fromJSON( json );
+
+		this.v0.fromArray( json.v0 );
+		this.v1.fromArray( json.v1 );
+		this.v2.fromArray( json.v2 );
+		this.v3.fromArray( json.v3 );
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A curve representing a 3D Cubic Bezier curve.
+ *
+ * @augments Curve
+ */
+class CubicBezierCurve3 extends Curve {
+
+	/**
+	 * Constructs a new Cubic Bezier curve.
+	 *
+	 * @param {Vector3} [v0] - The start point.
+	 * @param {Vector3} [v1] - The first control point.
+	 * @param {Vector3} [v2] - The second control point.
+	 * @param {Vector3} [v3] - The end point.
+	 */
+	constructor( v0 = new Vector3(), v1 = new Vector3(), v2 = new Vector3(), v3 = new Vector3() ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isCubicBezierCurve3 = true;
+
+		this.type = 'CubicBezierCurve3';
+
+		/**
+		 * The start point.
+		 *
+		 * @type {Vector3}
+		 */
+		this.v0 = v0;
+
+		/**
+		 * The first control point.
+		 *
+		 * @type {Vector3}
+		 */
+		this.v1 = v1;
+
+		/**
+		 * The second control point.
+		 *
+		 * @type {Vector3}
+		 */
+		this.v2 = v2;
+
+		/**
+		 * The end point.
+		 *
+		 * @type {Vector3}
+		 */
+		this.v3 = v3;
+
+	}
+
+	/**
+	 * Returns a point on the curve.
+	 *
+	 * @param {number} t - A interpolation factor representing a position on the curve. Must be in the range `[0,1]`.
+	 * @param {Vector3} [optionalTarget] - The optional target vector the result is written to.
+	 * @return {Vector3} The position on the curve.
+	 */
+	getPoint( t, optionalTarget = new Vector3() ) {
+
+		const point = optionalTarget;
+
+		const v0 = this.v0, v1 = this.v1, v2 = this.v2, v3 = this.v3;
+
+		point.set(
+			CubicBezier( t, v0.x, v1.x, v2.x, v3.x ),
+			CubicBezier( t, v0.y, v1.y, v2.y, v3.y ),
+			CubicBezier( t, v0.z, v1.z, v2.z, v3.z )
+		);
+
+		return point;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.v0.copy( source.v0 );
+		this.v1.copy( source.v1 );
+		this.v2.copy( source.v2 );
+		this.v3.copy( source.v3 );
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.v0 = this.v0.toArray();
+		data.v1 = this.v1.toArray();
+		data.v2 = this.v2.toArray();
+		data.v3 = this.v3.toArray();
+
+		return data;
+
+	}
+
+	fromJSON( json ) {
+
+		super.fromJSON( json );
+
+		this.v0.fromArray( json.v0 );
+		this.v1.fromArray( json.v1 );
+		this.v2.fromArray( json.v2 );
+		this.v3.fromArray( json.v3 );
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A curve representing a 2D line segment.
+ *
+ * @augments Curve
+ */
+class LineCurve extends Curve {
+
+	/**
+	 * Constructs a new line curve.
+	 *
+	 * @param {Vector2} [v1] - The start point.
+	 * @param {Vector2} [v2] - The end point.
+	 */
+	constructor( v1 = new Vector2(), v2 = new Vector2() ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isLineCurve = true;
+
+		this.type = 'LineCurve';
+
+		/**
+		 * The start point.
+		 *
+		 * @type {Vector2}
+		 */
+		this.v1 = v1;
+
+		/**
+		 * The end point.
+		 *
+		 * @type {Vector2}
+		 */
+		this.v2 = v2;
+
+	}
+
+	/**
+	 * Returns a point on the line.
+	 *
+	 * @param {number} t - A interpolation factor representing a position on the line. Must be in the range `[0,1]`.
+	 * @param {Vector2} [optionalTarget] - The optional target vector the result is written to.
+	 * @return {Vector2} The position on the line.
+	 */
+	getPoint( t, optionalTarget = new Vector2() ) {
+
+		const point = optionalTarget;
+
+		if ( t === 1 ) {
+
+			point.copy( this.v2 );
+
+		} else {
+
+			point.copy( this.v2 ).sub( this.v1 );
+			point.multiplyScalar( t ).add( this.v1 );
+
+		}
+
+		return point;
+
+	}
+
+	// Line curve is linear, so we can overwrite default getPointAt
+	getPointAt( u, optionalTarget ) {
+
+		return this.getPoint( u, optionalTarget );
+
+	}
+
+	getTangent( t, optionalTarget = new Vector2() ) {
+
+		return optionalTarget.subVectors( this.v2, this.v1 ).normalize();
+
+	}
+
+	getTangentAt( u, optionalTarget ) {
+
+		return this.getTangent( u, optionalTarget );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.v1.copy( source.v1 );
+		this.v2.copy( source.v2 );
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.v1 = this.v1.toArray();
+		data.v2 = this.v2.toArray();
+
+		return data;
+
+	}
+
+	fromJSON( json ) {
+
+		super.fromJSON( json );
+
+		this.v1.fromArray( json.v1 );
+		this.v2.fromArray( json.v2 );
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A curve representing a 3D line segment.
+ *
+ * @augments Curve
+ */
+class LineCurve3 extends Curve {
+
+	/**
+	 * Constructs a new line curve.
+	 *
+	 * @param {Vector3} [v1] - The start point.
+	 * @param {Vector3} [v2] - The end point.
+	 */
+	constructor( v1 = new Vector3(), v2 = new Vector3() ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isLineCurve3 = true;
+
+		this.type = 'LineCurve3';
+
+		/**
+		 * The start point.
+		 *
+		 * @type {Vector3}
+		 */
+		this.v1 = v1;
+
+		/**
+		 * The end point.
+		 *
+		 * @type {Vector2}
+		 */
+		this.v2 = v2;
+
+	}
+
+	/**
+	 * Returns a point on the line.
+	 *
+	 * @param {number} t - A interpolation factor representing a position on the line. Must be in the range `[0,1]`.
+	 * @param {Vector3} [optionalTarget] - The optional target vector the result is written to.
+	 * @return {Vector3} The position on the line.
+	 */
+	getPoint( t, optionalTarget = new Vector3() ) {
+
+		const point = optionalTarget;
+
+		if ( t === 1 ) {
+
+			point.copy( this.v2 );
+
+		} else {
+
+			point.copy( this.v2 ).sub( this.v1 );
+			point.multiplyScalar( t ).add( this.v1 );
+
+		}
+
+		return point;
+
+	}
+
+	// Line curve is linear, so we can overwrite default getPointAt
+	getPointAt( u, optionalTarget ) {
+
+		return this.getPoint( u, optionalTarget );
+
+	}
+
+	getTangent( t, optionalTarget = new Vector3() ) {
+
+		return optionalTarget.subVectors( this.v2, this.v1 ).normalize();
+
+	}
+
+	getTangentAt( u, optionalTarget ) {
+
+		return this.getTangent( u, optionalTarget );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.v1.copy( source.v1 );
+		this.v2.copy( source.v2 );
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.v1 = this.v1.toArray();
+		data.v2 = this.v2.toArray();
+
+		return data;
+
+	}
+
+	fromJSON( json ) {
+
+		super.fromJSON( json );
+
+		this.v1.fromArray( json.v1 );
+		this.v2.fromArray( json.v2 );
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A curve representing a 2D Quadratic Bezier curve.
+ *
+ * ```js
+ * const curve = new THREE.QuadraticBezierCurve(
+ * 	new THREE.Vector2( - 10, 0 ),
+ * 	new THREE.Vector2( 20, 15 ),
+ * 	new THREE.Vector2( 10, 0 )
+ * )
+ *
+ * const points = curve.getPoints( 50 );
+ * const geometry = new THREE.BufferGeometry().setFromPoints( points );
+ *
+ * const material = new THREE.LineBasicMaterial( { color: 0xff0000 } );
+ *
+ * // Create the final object to add to the scene
+ * const curveObject = new THREE.Line( geometry, material );
+ * ```
+ *
+ * @augments Curve
+ */
+class QuadraticBezierCurve extends Curve {
+
+	/**
+	 * Constructs a new Quadratic Bezier curve.
+	 *
+	 * @param {Vector2} [v0] - The start point.
+	 * @param {Vector2} [v1] - The control point.
+	 * @param {Vector2} [v2] - The end point.
+	 */
+	constructor( v0 = new Vector2(), v1 = new Vector2(), v2 = new Vector2() ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isQuadraticBezierCurve = true;
+
+		this.type = 'QuadraticBezierCurve';
+
+		/**
+		 * The start point.
+		 *
+		 * @type {Vector2}
+		 */
+		this.v0 = v0;
+
+		/**
+		 * The control point.
+		 *
+		 * @type {Vector2}
+		 */
+		this.v1 = v1;
+
+		/**
+		 * The end point.
+		 *
+		 * @type {Vector2}
+		 */
+		this.v2 = v2;
+
+	}
+
+	/**
+	 * Returns a point on the curve.
+	 *
+	 * @param {number} t - A interpolation factor representing a position on the curve. Must be in the range `[0,1]`.
+	 * @param {Vector2} [optionalTarget] - The optional target vector the result is written to.
+	 * @return {Vector2} The position on the curve.
+	 */
+	getPoint( t, optionalTarget = new Vector2() ) {
+
+		const point = optionalTarget;
+
+		const v0 = this.v0, v1 = this.v1, v2 = this.v2;
+
+		point.set(
+			QuadraticBezier( t, v0.x, v1.x, v2.x ),
+			QuadraticBezier( t, v0.y, v1.y, v2.y )
+		);
+
+		return point;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.v0.copy( source.v0 );
+		this.v1.copy( source.v1 );
+		this.v2.copy( source.v2 );
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.v0 = this.v0.toArray();
+		data.v1 = this.v1.toArray();
+		data.v2 = this.v2.toArray();
+
+		return data;
+
+	}
+
+	fromJSON( json ) {
+
+		super.fromJSON( json );
+
+		this.v0.fromArray( json.v0 );
+		this.v1.fromArray( json.v1 );
+		this.v2.fromArray( json.v2 );
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A curve representing a 3D Quadratic Bezier curve.
+ *
+ * @augments Curve
+ */
+class QuadraticBezierCurve3 extends Curve {
+
+	/**
+	 * Constructs a new Quadratic Bezier curve.
+	 *
+	 * @param {Vector3} [v0] - The start point.
+	 * @param {Vector3} [v1] - The control point.
+	 * @param {Vector3} [v2] - The end point.
+	 */
+	constructor( v0 = new Vector3(), v1 = new Vector3(), v2 = new Vector3() ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isQuadraticBezierCurve3 = true;
+
+		this.type = 'QuadraticBezierCurve3';
+
+		/**
+		 * The start point.
+		 *
+		 * @type {Vector3}
+		 */
+		this.v0 = v0;
+
+		/**
+		 * The control point.
+		 *
+		 * @type {Vector3}
+		 */
+		this.v1 = v1;
+
+		/**
+		 * The end point.
+		 *
+		 * @type {Vector3}
+		 */
+		this.v2 = v2;
+
+	}
+
+	/**
+	 * Returns a point on the curve.
+	 *
+	 * @param {number} t - A interpolation factor representing a position on the curve. Must be in the range `[0,1]`.
+	 * @param {Vector3} [optionalTarget] - The optional target vector the result is written to.
+	 * @return {Vector3} The position on the curve.
+	 */
+	getPoint( t, optionalTarget = new Vector3() ) {
+
+		const point = optionalTarget;
+
+		const v0 = this.v0, v1 = this.v1, v2 = this.v2;
+
+		point.set(
+			QuadraticBezier( t, v0.x, v1.x, v2.x ),
+			QuadraticBezier( t, v0.y, v1.y, v2.y ),
+			QuadraticBezier( t, v0.z, v1.z, v2.z )
+		);
+
+		return point;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.v0.copy( source.v0 );
+		this.v1.copy( source.v1 );
+		this.v2.copy( source.v2 );
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.v0 = this.v0.toArray();
+		data.v1 = this.v1.toArray();
+		data.v2 = this.v2.toArray();
+
+		return data;
+
+	}
+
+	fromJSON( json ) {
+
+		super.fromJSON( json );
+
+		this.v0.fromArray( json.v0 );
+		this.v1.fromArray( json.v1 );
+		this.v2.fromArray( json.v2 );
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A curve representing a 2D spline curve.
+ *
+ * ```js
+ * // Create a sine-like wave
+ * const curve = new THREE.SplineCurve( [
+ * 	new THREE.Vector2( -10, 0 ),
+ * 	new THREE.Vector2( -5, 5 ),
+ * 	new THREE.Vector2( 0, 0 ),
+ * 	new THREE.Vector2( 5, -5 ),
+ * 	new THREE.Vector2( 10, 0 )
+ * ] );
+ *
+ * const points = curve.getPoints( 50 );
+ * const geometry = new THREE.BufferGeometry().setFromPoints( points );
+ *
+ * const material = new THREE.LineBasicMaterial( { color: 0xff0000 } );
+ *
+ * // Create the final object to add to the scene
+ * const splineObject = new THREE.Line( geometry, material );
+ * ```
+ *
+ * @augments Curve
+ */
+class SplineCurve extends Curve {
+
+	/**
+	 * Constructs a new 2D spline curve.
+	 *
+	 * @param {Array<Vector2>} [points] -  An array of 2D points defining the curve.
+	 */
+	constructor( points = [] ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isSplineCurve = true;
+
+		this.type = 'SplineCurve';
+
+		/**
+		 * An array of 2D points defining the curve.
+		 *
+		 * @type {Array<Vector2>}
+		 */
+		this.points = points;
+
+	}
+
+	/**
+	 * Returns a point on the curve.
+	 *
+	 * @param {number} t - A interpolation factor representing a position on the curve. Must be in the range `[0,1]`.
+	 * @param {Vector2} [optionalTarget] - The optional target vector the result is written to.
+	 * @return {Vector2} The position on the curve.
+	 */
+	getPoint( t, optionalTarget = new Vector2() ) {
+
+		const point = optionalTarget;
+
+		const points = this.points;
+		const p = ( points.length - 1 ) * t;
+
+		const intPoint = Math.floor( p );
+		const weight = p - intPoint;
+
+		const p0 = points[ intPoint === 0 ? intPoint : intPoint - 1 ];
+		const p1 = points[ intPoint ];
+		const p2 = points[ intPoint > points.length - 2 ? points.length - 1 : intPoint + 1 ];
+		const p3 = points[ intPoint > points.length - 3 ? points.length - 1 : intPoint + 2 ];
+
+		point.set(
+			CatmullRom( weight, p0.x, p1.x, p2.x, p3.x ),
+			CatmullRom( weight, p0.y, p1.y, p2.y, p3.y )
+		);
+
+		return point;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.points = [];
+
+		for ( let i = 0, l = source.points.length; i < l; i ++ ) {
+
+			const point = source.points[ i ];
+
+			this.points.push( point.clone() );
+
+		}
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.points = [];
+
+		for ( let i = 0, l = this.points.length; i < l; i ++ ) {
+
+			const point = this.points[ i ];
+			data.points.push( point.toArray() );
+
+		}
+
+		return data;
+
+	}
+
+	fromJSON( json ) {
+
+		super.fromJSON( json );
+
+		this.points = [];
+
+		for ( let i = 0, l = json.points.length; i < l; i ++ ) {
+
+			const point = json.points[ i ];
+			this.points.push( new Vector2().fromArray( point ) );
+
+		}
+
+		return this;
+
+	}
+
+}
+
+var Curves = /*#__PURE__*/Object.freeze({
+	__proto__: null,
+	ArcCurve: ArcCurve,
+	CatmullRomCurve3: CatmullRomCurve3,
+	CubicBezierCurve: CubicBezierCurve,
+	CubicBezierCurve3: CubicBezierCurve3,
+	EllipseCurve: EllipseCurve,
+	LineCurve: LineCurve,
+	LineCurve3: LineCurve3,
+	QuadraticBezierCurve: QuadraticBezierCurve,
+	QuadraticBezierCurve3: QuadraticBezierCurve3,
+	SplineCurve: SplineCurve
+});
+
+/**
+ * A base class extending {@link Curve}. `CurvePath` is simply an
+ * array of connected curves, but retains the API of a curve.
+ *
+ * @augments Curve
+ */
+class CurvePath extends Curve {
+
+	/**
+	 * Constructs a new curve path.
+	 */
+	constructor() {
+
+		super();
+
+		this.type = 'CurvePath';
+
+		/**
+		 * An array of curves defining the
+		 * path.
+		 *
+		 * @type {Array<Curve>}
+		 */
+		this.curves = [];
+
+		/**
+		 * Whether the path should automatically be closed
+		 * by a line curve.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.autoClose = false;
+
+	}
+
+	/**
+	 * Adds a curve to this curve path.
+	 *
+	 * @param {Curve} curve - The curve to add.
+	 */
+	add( curve ) {
+
+		this.curves.push( curve );
+
+	}
+
+	/**
+	 * Adds a line curve to close the path.
+	 *
+	 * @return {CurvePath} A reference to this curve path.
+	 */
+	closePath() {
+
+		// Add a line curve if start and end of lines are not connected
+		const startPoint = this.curves[ 0 ].getPoint( 0 );
+		const endPoint = this.curves[ this.curves.length - 1 ].getPoint( 1 );
+
+		if ( ! startPoint.equals( endPoint ) ) {
+
+			const lineType = ( startPoint.isVector2 === true ) ? 'LineCurve' : 'LineCurve3';
+			this.curves.push( new Curves[ lineType ]( endPoint, startPoint ) );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * This method returns a vector in 2D or 3D space (depending on the curve definitions)
+	 * for the given interpolation factor.
+	 *
+	 * @param {number} t - A interpolation factor representing a position on the curve. Must be in the range `[0,1]`.
+	 * @param {(Vector2|Vector3)} [optionalTarget] - The optional target vector the result is written to.
+	 * @return {?(Vector2|Vector3)} The position on the curve. It can be a 2D or 3D vector depending on the curve definition.
+	 */
+	getPoint( t, optionalTarget ) {
+
+		// To get accurate point with reference to
+		// entire path distance at time t,
+		// following has to be done:
+
+		// 1. Length of each sub path have to be known
+		// 2. Locate and identify type of curve
+		// 3. Get t for the curve
+		// 4. Return curve.getPointAt(t')
+
+		const d = t * this.getLength();
+		const curveLengths = this.getCurveLengths();
+		let i = 0;
+
+		// To think about boundaries points.
+
+		while ( i < curveLengths.length ) {
+
+			if ( curveLengths[ i ] >= d ) {
+
+				const diff = curveLengths[ i ] - d;
+				const curve = this.curves[ i ];
+
+				const segmentLength = curve.getLength();
+				const u = segmentLength === 0 ? 0 : 1 - diff / segmentLength;
+
+				return curve.getPointAt( u, optionalTarget );
+
+			}
+
+			i ++;
+
+		}
+
+		return null;
+
+		// loop where sum != 0, sum > d , sum+1 <d
+
+	}
+
+	getLength() {
+
+		// We cannot use the default THREE.Curve getPoint() with getLength() because in
+		// THREE.Curve, getLength() depends on getPoint() but in THREE.CurvePath
+		// getPoint() depends on getLength
+
+		const lens = this.getCurveLengths();
+		return lens[ lens.length - 1 ];
+
+	}
+
+	updateArcLengths() {
+
+		// cacheLengths must be recalculated.
+
+		this.needsUpdate = true;
+		this.cacheLengths = null;
+		this.getCurveLengths();
+
+	}
+
+	/**
+	 * Returns list of cumulative curve lengths of the defined curves.
+	 *
+	 * @return {Array<number>} The curve lengths.
+	 */
+	getCurveLengths() {
+
+		// Compute lengths and cache them
+		// We cannot overwrite getLengths() because UtoT mapping uses it.
+		// We use cache values if curves and cache array are same length
+
+		if ( this.cacheLengths && this.cacheLengths.length === this.curves.length ) {
+
+			return this.cacheLengths;
+
+		}
+
+		// Get length of sub-curve
+		// Push sums into cached array
+
+		const lengths = [];
+		let sums = 0;
+
+		for ( let i = 0, l = this.curves.length; i < l; i ++ ) {
+
+			sums += this.curves[ i ].getLength();
+			lengths.push( sums );
+
+		}
+
+		this.cacheLengths = lengths;
+
+		return lengths;
+
+	}
+
+	getSpacedPoints( divisions = 40 ) {
+
+		const points = [];
+
+		for ( let i = 0; i <= divisions; i ++ ) {
+
+			points.push( this.getPoint( i / divisions ) );
+
+		}
+
+		if ( this.autoClose ) {
+
+			points.push( points[ 0 ] );
+
+		}
+
+		return points;
+
+	}
+
+	getPoints( divisions = 12 ) {
+
+		const points = [];
+		let last;
+
+		for ( let i = 0, curves = this.curves; i < curves.length; i ++ ) {
+
+			const curve = curves[ i ];
+			const resolution = curve.isEllipseCurve ? divisions * 2
+				: ( curve.isLineCurve || curve.isLineCurve3 ) ? 1
+					: curve.isSplineCurve ? divisions * curve.points.length
+						: divisions;
+
+			const pts = curve.getPoints( resolution );
+
+			for ( let j = 0; j < pts.length; j ++ ) {
+
+				const point = pts[ j ];
+
+				if ( last && last.equals( point ) ) continue; // ensures no consecutive points are duplicates
+
+				points.push( point );
+				last = point;
+
+			}
+
+		}
+
+		if ( this.autoClose && points.length > 1 && ! points[ points.length - 1 ].equals( points[ 0 ] ) ) {
+
+			points.push( points[ 0 ] );
+
+		}
+
+		return points;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.curves = [];
+
+		for ( let i = 0, l = source.curves.length; i < l; i ++ ) {
+
+			const curve = source.curves[ i ];
+
+			this.curves.push( curve.clone() );
+
+		}
+
+		this.autoClose = source.autoClose;
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.autoClose = this.autoClose;
+		data.curves = [];
+
+		for ( let i = 0, l = this.curves.length; i < l; i ++ ) {
+
+			const curve = this.curves[ i ];
+			data.curves.push( curve.toJSON() );
+
+		}
+
+		return data;
+
+	}
+
+	fromJSON( json ) {
+
+		super.fromJSON( json );
+
+		this.autoClose = json.autoClose;
+		this.curves = [];
+
+		for ( let i = 0, l = json.curves.length; i < l; i ++ ) {
+
+			const curve = json.curves[ i ];
+			this.curves.push( new Curves[ curve.type ]().fromJSON( curve ) );
+
+		}
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A 2D path representation. The class provides methods for creating paths
+ * and contours of 2D shapes similar to the 2D Canvas API.
+ *
+ * ```js
+ * const path = new THREE.Path();
+ *
+ * path.lineTo( 0, 0.8 );
+ * path.quadraticCurveTo( 0, 1, 0.2, 1 );
+ * path.lineTo( 1, 1 );
+ *
+ * const points = path.getPoints();
+ *
+ * const geometry = new THREE.BufferGeometry().setFromPoints( points );
+ * const material = new THREE.LineBasicMaterial( { color: 0xffffff } );
+ *
+ * const line = new THREE.Line( geometry, material );
+ * scene.add( line );
+ * ```
+ *
+ * @augments CurvePath
+ */
+class Path extends CurvePath {
+
+	/**
+	 * Constructs a new path.
+	 *
+	 * @param {Array<Vector2>} [points] - An array of 2D points defining the path.
+	 */
+	constructor( points ) {
+
+		super();
+
+		this.type = 'Path';
+
+		/**
+		 * The current offset of the path. Any new curve added will start here.
+		 *
+		 * @type {Vector2}
+		 */
+		this.currentPoint = new Vector2();
+
+		if ( points ) {
+
+			this.setFromPoints( points );
+
+		}
+
+	}
+
+	/**
+	 * Creates a path from the given list of points. The points are added
+	 * to the path as instances of {@link LineCurve}.
+	 *
+	 * @param {Array<Vector2>} points - An array of 2D points.
+	 * @return {Path} A reference to this path.
+	 */
+	setFromPoints( points ) {
+
+		this.moveTo( points[ 0 ].x, points[ 0 ].y );
+
+		for ( let i = 1, l = points.length; i < l; i ++ ) {
+
+			this.lineTo( points[ i ].x, points[ i ].y );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Moves {@link Path#currentPoint} to the given point.
+	 *
+	 * @param {number} x - The x coordinate.
+	 * @param {number} y - The y coordinate.
+	 * @return {Path} A reference to this path.
+	 */
+	moveTo( x, y ) {
+
+		this.currentPoint.set( x, y ); // TODO consider referencing vectors instead of copying?
+
+		return this;
+
+	}
+
+	/**
+	 * Adds an instance of {@link LineCurve} to the path by connecting
+	 * the current point with the given one.
+	 *
+	 * @param {number} x - The x coordinate of the end point.
+	 * @param {number} y - The y coordinate of the end point.
+	 * @return {Path} A reference to this path.
+	 */
+	lineTo( x, y ) {
+
+		const curve = new LineCurve( this.currentPoint.clone(), new Vector2( x, y ) );
+		this.curves.push( curve );
+
+		this.currentPoint.set( x, y );
+
+		return this;
+
+	}
+
+	/**
+	 * Adds an instance of {@link QuadraticBezierCurve} to the path by connecting
+	 * the current point with the given one.
+	 *
+	 * @param {number} aCPx - The x coordinate of the control point.
+	 * @param {number} aCPy - The y coordinate of the control point.
+	 * @param {number} aX - The x coordinate of the end point.
+	 * @param {number} aY - The y coordinate of the end point.
+	 * @return {Path} A reference to this path.
+	 */
+	quadraticCurveTo( aCPx, aCPy, aX, aY ) {
+
+		const curve = new QuadraticBezierCurve(
+			this.currentPoint.clone(),
+			new Vector2( aCPx, aCPy ),
+			new Vector2( aX, aY )
+		);
+
+		this.curves.push( curve );
+
+		this.currentPoint.set( aX, aY );
+
+		return this;
+
+	}
+
+	/**
+	 * Adds an instance of {@link CubicBezierCurve} to the path by connecting
+	 * the current point with the given one.
+	 *
+	 * @param {number} aCP1x - The x coordinate of the first control point.
+	 * @param {number} aCP1y - The y coordinate of the first control point.
+	 * @param {number} aCP2x - The x coordinate of the second control point.
+	 * @param {number} aCP2y - The y coordinate of the second control point.
+	 * @param {number} aX - The x coordinate of the end point.
+	 * @param {number} aY - The y coordinate of the end point.
+	 * @return {Path} A reference to this path.
+	 */
+	bezierCurveTo( aCP1x, aCP1y, aCP2x, aCP2y, aX, aY ) {
+
+		const curve = new CubicBezierCurve(
+			this.currentPoint.clone(),
+			new Vector2( aCP1x, aCP1y ),
+			new Vector2( aCP2x, aCP2y ),
+			new Vector2( aX, aY )
+		);
+
+		this.curves.push( curve );
+
+		this.currentPoint.set( aX, aY );
+
+		return this;
+
+	}
+
+	/**
+	 * Adds an instance of {@link SplineCurve} to the path by connecting
+	 * the current point with the given list of points.
+	 *
+	 * @param {Array<Vector2>} pts - An array of points in 2D space.
+	 * @return {Path} A reference to this path.
+	 */
+	splineThru( pts ) {
+
+		const npts = [ this.currentPoint.clone() ].concat( pts );
+
+		const curve = new SplineCurve( npts );
+		this.curves.push( curve );
+
+		this.currentPoint.copy( pts[ pts.length - 1 ] );
+
+		return this;
+
+	}
+
+	/**
+	 * Adds an arc as an instance of {@link EllipseCurve} to the path, positioned relative
+	 * to the current point.
+	 *
+	 * @param {number} [aX=0] - The x coordinate of the center of the arc offsetted from the previous curve.
+	 * @param {number} [aY=0] - The y coordinate of the center of the arc offsetted from the previous curve.
+	 * @param {number} [aRadius=1] - The radius of the arc.
+	 * @param {number} [aStartAngle=0] - The start angle in radians.
+	 * @param {number} [aEndAngle=Math.PI*2] - The end angle in radians.
+	 * @param {boolean} [aClockwise=false] - Whether to sweep the arc clockwise or not.
+	 * @return {Path} A reference to this path.
+	 */
+	arc( aX, aY, aRadius, aStartAngle, aEndAngle, aClockwise ) {
+
+		const x0 = this.currentPoint.x;
+		const y0 = this.currentPoint.y;
+
+		this.absarc( aX + x0, aY + y0, aRadius,
+			aStartAngle, aEndAngle, aClockwise );
+
+		return this;
+
+	}
+
+	/**
+	 * Adds an absolutely positioned arc as an instance of {@link EllipseCurve} to the path.
+	 *
+	 * @param {number} [aX=0] - The x coordinate of the center of the arc.
+	 * @param {number} [aY=0] - The y coordinate of the center of the arc.
+	 * @param {number} [aRadius=1] - The radius of the arc.
+	 * @param {number} [aStartAngle=0] - The start angle in radians.
+	 * @param {number} [aEndAngle=Math.PI*2] - The end angle in radians.
+	 * @param {boolean} [aClockwise=false] - Whether to sweep the arc clockwise or not.
+	 * @return {Path} A reference to this path.
+	 */
+	absarc( aX, aY, aRadius, aStartAngle, aEndAngle, aClockwise ) {
+
+		this.absellipse( aX, aY, aRadius, aRadius, aStartAngle, aEndAngle, aClockwise );
+
+		return this;
+
+	}
+
+	/**
+	 * Adds an ellipse as an instance of {@link EllipseCurve} to the path, positioned relative
+	 * to the current point
+	 *
+	 * @param {number} [aX=0] - The x coordinate of the center of the ellipse offsetted from the previous curve.
+	 * @param {number} [aY=0] - The y coordinate of the center of the ellipse offsetted from the previous curve.
+	 * @param {number} [xRadius=1] - The radius of the ellipse in the x axis.
+	 * @param {number} [yRadius=1] - The radius of the ellipse in the y axis.
+	 * @param {number} [aStartAngle=0] - The start angle in radians.
+	 * @param {number} [aEndAngle=Math.PI*2] - The end angle in radians.
+	 * @param {boolean} [aClockwise=false] - Whether to sweep the ellipse clockwise or not.
+	 * @param {number} [aRotation=0] - The rotation angle of the ellipse in radians, counterclockwise from the positive X axis.
+	 * @return {Path} A reference to this path.
+	 */
+	ellipse( aX, aY, xRadius, yRadius, aStartAngle, aEndAngle, aClockwise, aRotation ) {
+
+		const x0 = this.currentPoint.x;
+		const y0 = this.currentPoint.y;
+
+		this.absellipse( aX + x0, aY + y0, xRadius, yRadius, aStartAngle, aEndAngle, aClockwise, aRotation );
+
+		return this;
+
+	}
+
+	/**
+	 * Adds an absolutely positioned ellipse as an instance of {@link EllipseCurve} to the path.
+	 *
+	 * @param {number} [aX=0] - The x coordinate of the absolute center of the ellipse.
+	 * @param {number} [aY=0] - The y coordinate of the absolute center of the ellipse.
+	 * @param {number} [xRadius=1] - The radius of the ellipse in the x axis.
+	 * @param {number} [yRadius=1] - The radius of the ellipse in the y axis.
+	 * @param {number} [aStartAngle=0] - The start angle in radians.
+	 * @param {number} [aEndAngle=Math.PI*2] - The end angle in radians.
+	 * @param {boolean} [aClockwise=false] - Whether to sweep the ellipse clockwise or not.
+	 * @param {number} [aRotation=0] - The rotation angle of the ellipse in radians, counterclockwise from the positive X axis.
+	 * @return {Path} A reference to this path.
+	 */
+	absellipse( aX, aY, xRadius, yRadius, aStartAngle, aEndAngle, aClockwise, aRotation ) {
+
+		const curve = new EllipseCurve( aX, aY, xRadius, yRadius, aStartAngle, aEndAngle, aClockwise, aRotation );
+
+		if ( this.curves.length > 0 ) {
+
+			// if a previous curve is present, attempt to join
+			const firstPoint = curve.getPoint( 0 );
+
+			if ( ! firstPoint.equals( this.currentPoint ) ) {
+
+				this.lineTo( firstPoint.x, firstPoint.y );
+
+			}
+
+		}
+
+		this.curves.push( curve );
+
+		const lastPoint = curve.getPoint( 1 );
+		this.currentPoint.copy( lastPoint );
+
+		return this;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.currentPoint.copy( source.currentPoint );
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.currentPoint = this.currentPoint.toArray();
+
+		return data;
+
+	}
+
+	fromJSON( json ) {
+
+		super.fromJSON( json );
+
+		this.currentPoint.fromArray( json.currentPoint );
+
+		return this;
+
+	}
+
+}
+
+/**
+ * Defines an arbitrary 2d shape plane using paths with optional holes. It
+ * can be used with {@link ExtrudeGeometry}, {@link ShapeGeometry}, to get
+ * points, or to get triangulated faces.
+ *
+ * ```js
+ * const heartShape = new THREE.Shape();
+ *
+ * heartShape.moveTo( 25, 25 );
+ * heartShape.bezierCurveTo( 25, 25, 20, 0, 0, 0 );
+ * heartShape.bezierCurveTo( - 30, 0, - 30, 35, - 30, 35 );
+ * heartShape.bezierCurveTo( - 30, 55, - 10, 77, 25, 95 );
+ * heartShape.bezierCurveTo( 60, 77, 80, 55, 80, 35 );
+ * heartShape.bezierCurveTo( 80, 35, 80, 0, 50, 0 );
+ * heartShape.bezierCurveTo( 35, 0, 25, 25, 25, 25 );
+ *
+ * const extrudeSettings = {
+ * 	depth: 8,
+ * 	bevelEnabled: true,
+ * 	bevelSegments: 2,
+ * 	steps: 2,
+ * 	bevelSize: 1,
+ * 	bevelThickness: 1
+ * };
+ *
+ * const geometry = new THREE.ExtrudeGeometry( heartShape, extrudeSettings );
+ * const mesh = new THREE.Mesh( geometry, new THREE.MeshBasicMaterial() );
+ * ```
+ *
+ * @augments Path
+ */
+class Shape extends Path {
+
+	/**
+	 * Constructs a new shape.
+	 *
+	 * @param {Array<Vector2>} [points] - An array of 2D points defining the shape.
+	 */
+	constructor( points ) {
+
+		super( points );
+
+		/**
+		 * The UUID of the shape.
+		 *
+		 * @type {string}
+		 * @readonly
+		 */
+		this.uuid = generateUUID();
+
+		this.type = 'Shape';
+
+		/**
+		 * Defines the holes in the shape. Hole definitions must use the
+		 * opposite winding order (CW/CCW) than the outer shape.
+		 *
+		 * @type {Array<Path>}
+		 * @readonly
+		 */
+		this.holes = [];
+
+	}
+
+	/**
+	 * Returns an array representing each contour of the holes
+	 * as a list of 2D points.
+	 *
+	 * @param {number} divisions - The fineness of the result.
+	 * @return {Array<Array<Vector2>>} The holes as a series of 2D points.
+	 */
+	getPointsHoles( divisions ) {
+
+		const holesPts = [];
+
+		for ( let i = 0, l = this.holes.length; i < l; i ++ ) {
+
+			holesPts[ i ] = this.holes[ i ].getPoints( divisions );
+
+		}
+
+		return holesPts;
+
+	}
+
+	// get points of shape and holes (keypoints based on segments parameter)
+
+	/**
+	 * Returns an object that holds contour data for the shape and its holes as
+	 * arrays of 2D points.
+	 *
+	 * @param {number} divisions - The fineness of the result.
+	 * @return {{shape:Array<Vector2>,holes:Array<Array<Vector2>>}} An object with contour data.
+	 */
+	extractPoints( divisions ) {
+
+		return {
+
+			shape: this.getPoints( divisions ),
+			holes: this.getPointsHoles( divisions )
+
+		};
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.holes = [];
+
+		for ( let i = 0, l = source.holes.length; i < l; i ++ ) {
+
+			const hole = source.holes[ i ];
+
+			this.holes.push( hole.clone() );
+
+		}
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.uuid = this.uuid;
+		data.holes = [];
+
+		for ( let i = 0, l = this.holes.length; i < l; i ++ ) {
+
+			const hole = this.holes[ i ];
+			data.holes.push( hole.toJSON() );
+
+		}
+
+		return data;
+
+	}
+
+	fromJSON( json ) {
+
+		super.fromJSON( json );
+
+		this.uuid = json.uuid;
+		this.holes = [];
+
+		for ( let i = 0, l = json.holes.length; i < l; i ++ ) {
+
+			const hole = json.holes[ i ];
+			this.holes.push( new Path().fromJSON( hole ) );
+
+		}
+
+		return this;
+
+	}
+
+}
+
+/* eslint-disable */
+// copy of mapbox/earcut version 3.0.2
+// https://github.com/mapbox/earcut/tree/v3.0.2
+
+function earcut(data, holeIndices, dim = 2) {
+
+    const hasHoles = holeIndices && holeIndices.length;
+    const outerLen = hasHoles ? holeIndices[0] * dim : data.length;
+    let outerNode = linkedList(data, 0, outerLen, dim, true);
+    const triangles = [];
+
+    if (!outerNode || outerNode.next === outerNode.prev) return triangles;
+
+    let minX, minY, invSize;
+
+    if (hasHoles) outerNode = eliminateHoles(data, holeIndices, outerNode, dim);
+
+    // if the shape is not too simple, we'll use z-order curve hash later; calculate polygon bbox
+    if (data.length > 80 * dim) {
+        minX = data[0];
+        minY = data[1];
+        let maxX = minX;
+        let maxY = minY;
+
+        for (let i = dim; i < outerLen; i += dim) {
+            const x = data[i];
+            const y = data[i + 1];
+            if (x < minX) minX = x;
+            if (y < minY) minY = y;
+            if (x > maxX) maxX = x;
+            if (y > maxY) maxY = y;
+        }
+
+        // minX, minY and invSize are later used to transform coords into integers for z-order calculation
+        invSize = Math.max(maxX - minX, maxY - minY);
+        invSize = invSize !== 0 ? 32767 / invSize : 0;
+    }
+
+    earcutLinked(outerNode, triangles, dim, minX, minY, invSize, 0);
+
+    return triangles;
+}
+
+// create a circular doubly linked list from polygon points in the specified winding order
+function linkedList(data, start, end, dim, clockwise) {
+    let last;
+
+    if (clockwise === (signedArea(data, start, end, dim) > 0)) {
+        for (let i = start; i < end; i += dim) last = insertNode(i / dim | 0, data[i], data[i + 1], last);
+    } else {
+        for (let i = end - dim; i >= start; i -= dim) last = insertNode(i / dim | 0, data[i], data[i + 1], last);
+    }
+
+    if (last && equals(last, last.next)) {
+        removeNode(last);
+        last = last.next;
+    }
+
+    return last;
+}
+
+// eliminate colinear or duplicate points
+function filterPoints(start, end) {
+    if (!start) return start;
+    if (!end) end = start;
+
+    let p = start,
+        again;
+    do {
+        again = false;
+
+        if (!p.steiner && (equals(p, p.next) || area(p.prev, p, p.next) === 0)) {
+            removeNode(p);
+            p = end = p.prev;
+            if (p === p.next) break;
+            again = true;
+
+        } else {
+            p = p.next;
+        }
+    } while (again || p !== end);
+
+    return end;
+}
+
+// main ear slicing loop which triangulates a polygon (given as a linked list)
+function earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {
+    if (!ear) return;
+
+    // interlink polygon nodes in z-order
+    if (!pass && invSize) indexCurve(ear, minX, minY, invSize);
+
+    let stop = ear;
+
+    // iterate through ears, slicing them one by one
+    while (ear.prev !== ear.next) {
+        const prev = ear.prev;
+        const next = ear.next;
+
+        if (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear)) {
+            triangles.push(prev.i, ear.i, next.i); // cut off the triangle
+
+            removeNode(ear);
+
+            // skipping the next vertex leads to less sliver triangles
+            ear = next.next;
+            stop = next.next;
+
+            continue;
+        }
+
+        ear = next;
+
+        // if we looped through the whole remaining polygon and can't find any more ears
+        if (ear === stop) {
+            // try filtering points and slicing again
+            if (!pass) {
+                earcutLinked(filterPoints(ear), triangles, dim, minX, minY, invSize, 1);
+
+            // if this didn't work, try curing all small self-intersections locally
+            } else if (pass === 1) {
+                ear = cureLocalIntersections(filterPoints(ear), triangles);
+                earcutLinked(ear, triangles, dim, minX, minY, invSize, 2);
+
+            // as a last resort, try splitting the remaining polygon into two
+            } else if (pass === 2) {
+                splitEarcut(ear, triangles, dim, minX, minY, invSize);
+            }
+
+            break;
+        }
+    }
+}
+
+// check whether a polygon node forms a valid ear with adjacent nodes
+function isEar(ear) {
+    const a = ear.prev,
+        b = ear,
+        c = ear.next;
+
+    if (area(a, b, c) >= 0) return false; // reflex, can't be an ear
+
+    // now make sure we don't have other points inside the potential ear
+    const ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
+
+    // triangle bbox
+    const x0 = Math.min(ax, bx, cx),
+        y0 = Math.min(ay, by, cy),
+        x1 = Math.max(ax, bx, cx),
+        y1 = Math.max(ay, by, cy);
+
+    let p = c.next;
+    while (p !== a) {
+        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 &&
+            pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, p.x, p.y) &&
+            area(p.prev, p, p.next) >= 0) return false;
+        p = p.next;
+    }
+
+    return true;
+}
+
+function isEarHashed(ear, minX, minY, invSize) {
+    const a = ear.prev,
+        b = ear,
+        c = ear.next;
+
+    if (area(a, b, c) >= 0) return false; // reflex, can't be an ear
+
+    const ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
+
+    // triangle bbox
+    const x0 = Math.min(ax, bx, cx),
+        y0 = Math.min(ay, by, cy),
+        x1 = Math.max(ax, bx, cx),
+        y1 = Math.max(ay, by, cy);
+
+    // z-order range for the current triangle bbox;
+    const minZ = zOrder(x0, y0, minX, minY, invSize),
+        maxZ = zOrder(x1, y1, minX, minY, invSize);
+
+    let p = ear.prevZ,
+        n = ear.nextZ;
+
+    // look for points inside the triangle in both directions
+    while (p && p.z >= minZ && n && n.z <= maxZ) {
+        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c &&
+            pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
+        p = p.prevZ;
+
+        if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c &&
+            pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;
+        n = n.nextZ;
+    }
+
+    // look for remaining points in decreasing z-order
+    while (p && p.z >= minZ) {
+        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c &&
+            pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
+        p = p.prevZ;
+    }
+
+    // look for remaining points in increasing z-order
+    while (n && n.z <= maxZ) {
+        if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c &&
+            pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;
+        n = n.nextZ;
+    }
+
+    return true;
+}
+
+// go through all polygon nodes and cure small local self-intersections
+function cureLocalIntersections(start, triangles) {
+    let p = start;
+    do {
+        const a = p.prev,
+            b = p.next.next;
+
+        if (!equals(a, b) && intersects(a, p, p.next, b) && locallyInside(a, b) && locallyInside(b, a)) {
+
+            triangles.push(a.i, p.i, b.i);
+
+            // remove two nodes involved
+            removeNode(p);
+            removeNode(p.next);
+
+            p = start = b;
+        }
+        p = p.next;
+    } while (p !== start);
+
+    return filterPoints(p);
+}
+
+// try splitting polygon into two and triangulate them independently
+function splitEarcut(start, triangles, dim, minX, minY, invSize) {
+    // look for a valid diagonal that divides the polygon into two
+    let a = start;
+    do {
+        let b = a.next.next;
+        while (b !== a.prev) {
+            if (a.i !== b.i && isValidDiagonal(a, b)) {
+                // split the polygon in two by the diagonal
+                let c = splitPolygon(a, b);
+
+                // filter colinear points around the cuts
+                a = filterPoints(a, a.next);
+                c = filterPoints(c, c.next);
+
+                // run earcut on each half
+                earcutLinked(a, triangles, dim, minX, minY, invSize, 0);
+                earcutLinked(c, triangles, dim, minX, minY, invSize, 0);
+                return;
+            }
+            b = b.next;
+        }
+        a = a.next;
+    } while (a !== start);
+}
+
+// link every hole into the outer loop, producing a single-ring polygon without holes
+function eliminateHoles(data, holeIndices, outerNode, dim) {
+    const queue = [];
+
+    for (let i = 0, len = holeIndices.length; i < len; i++) {
+        const start = holeIndices[i] * dim;
+        const end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;
+        const list = linkedList(data, start, end, dim, false);
+        if (list === list.next) list.steiner = true;
+        queue.push(getLeftmost(list));
+    }
+
+    queue.sort(compareXYSlope);
+
+    // process holes from left to right
+    for (let i = 0; i < queue.length; i++) {
+        outerNode = eliminateHole(queue[i], outerNode);
+    }
+
+    return outerNode;
+}
+
+function compareXYSlope(a, b) {
+    let result = a.x - b.x;
+    // when the left-most point of 2 holes meet at a vertex, sort the holes counterclockwise so that when we find
+    // the bridge to the outer shell is always the point that they meet at.
+    if (result === 0) {
+        result = a.y - b.y;
+        if (result === 0) {
+            const aSlope = (a.next.y - a.y) / (a.next.x - a.x);
+            const bSlope = (b.next.y - b.y) / (b.next.x - b.x);
+            result = aSlope - bSlope;
+        }
+    }
+    return result;
+}
+
+// find a bridge between vertices that connects hole with an outer ring and link it
+function eliminateHole(hole, outerNode) {
+    const bridge = findHoleBridge(hole, outerNode);
+    if (!bridge) {
+        return outerNode;
+    }
+
+    const bridgeReverse = splitPolygon(bridge, hole);
+
+    // filter collinear points around the cuts
+    filterPoints(bridgeReverse, bridgeReverse.next);
+    return filterPoints(bridge, bridge.next);
+}
+
+// David Eberly's algorithm for finding a bridge between hole and outer polygon
+function findHoleBridge(hole, outerNode) {
+    let p = outerNode;
+    const hx = hole.x;
+    const hy = hole.y;
+    let qx = -Infinity;
+    let m;
+
+    // find a segment intersected by a ray from the hole's leftmost point to the left;
+    // segment's endpoint with lesser x will be potential connection point
+    // unless they intersect at a vertex, then choose the vertex
+    if (equals(hole, p)) return p;
+    do {
+        if (equals(hole, p.next)) return p.next;
+        else if (hy <= p.y && hy >= p.next.y && p.next.y !== p.y) {
+            const x = p.x + (hy - p.y) * (p.next.x - p.x) / (p.next.y - p.y);
+            if (x <= hx && x > qx) {
+                qx = x;
+                m = p.x < p.next.x ? p : p.next;
+                if (x === hx) return m; // hole touches outer segment; pick leftmost endpoint
+            }
+        }
+        p = p.next;
+    } while (p !== outerNode);
+
+    if (!m) return null;
+
+    // look for points inside the triangle of hole point, segment intersection and endpoint;
+    // if there are no points found, we have a valid connection;
+    // otherwise choose the point of the minimum angle with the ray as connection point
+
+    const stop = m;
+    const mx = m.x;
+    const my = m.y;
+    let tanMin = Infinity;
+
+    p = m;
+
+    do {
+        if (hx >= p.x && p.x >= mx && hx !== p.x &&
+                pointInTriangle(hy < my ? hx : qx, hy, mx, my, hy < my ? qx : hx, hy, p.x, p.y)) {
+
+            const tan = Math.abs(hy - p.y) / (hx - p.x); // tangential
+
+            if (locallyInside(p, hole) &&
+                (tan < tanMin || (tan === tanMin && (p.x > m.x || (p.x === m.x && sectorContainsSector(m, p)))))) {
+                m = p;
+                tanMin = tan;
+            }
+        }
+
+        p = p.next;
+    } while (p !== stop);
+
+    return m;
+}
+
+// whether sector in vertex m contains sector in vertex p in the same coordinates
+function sectorContainsSector(m, p) {
+    return area(m.prev, m, p.prev) < 0 && area(p.next, m, m.next) < 0;
+}
+
+// interlink polygon nodes in z-order
+function indexCurve(start, minX, minY, invSize) {
+    let p = start;
+    do {
+        if (p.z === 0) p.z = zOrder(p.x, p.y, minX, minY, invSize);
+        p.prevZ = p.prev;
+        p.nextZ = p.next;
+        p = p.next;
+    } while (p !== start);
+
+    p.prevZ.nextZ = null;
+    p.prevZ = null;
+
+    sortLinked(p);
+}
+
+// Simon Tatham's linked list merge sort algorithm
+// http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html
+function sortLinked(list) {
+    let numMerges;
+    let inSize = 1;
+
+    do {
+        let p = list;
+        let e;
+        list = null;
+        let tail = null;
+        numMerges = 0;
+
+        while (p) {
+            numMerges++;
+            let q = p;
+            let pSize = 0;
+            for (let i = 0; i < inSize; i++) {
+                pSize++;
+                q = q.nextZ;
+                if (!q) break;
+            }
+            let qSize = inSize;
+
+            while (pSize > 0 || (qSize > 0 && q)) {
+
+                if (pSize !== 0 && (qSize === 0 || !q || p.z <= q.z)) {
+                    e = p;
+                    p = p.nextZ;
+                    pSize--;
+                } else {
+                    e = q;
+                    q = q.nextZ;
+                    qSize--;
+                }
+
+                if (tail) tail.nextZ = e;
+                else list = e;
+
+                e.prevZ = tail;
+                tail = e;
+            }
+
+            p = q;
+        }
+
+        tail.nextZ = null;
+        inSize *= 2;
+
+    } while (numMerges > 1);
+
+    return list;
+}
+
+// z-order of a point given coords and inverse of the longer side of data bbox
+function zOrder(x, y, minX, minY, invSize) {
+    // coords are transformed into non-negative 15-bit integer range
+    x = (x - minX) * invSize | 0;
+    y = (y - minY) * invSize | 0;
+
+    x = (x | (x << 8)) & 0x00FF00FF;
+    x = (x | (x << 4)) & 0x0F0F0F0F;
+    x = (x | (x << 2)) & 0x33333333;
+    x = (x | (x << 1)) & 0x55555555;
+
+    y = (y | (y << 8)) & 0x00FF00FF;
+    y = (y | (y << 4)) & 0x0F0F0F0F;
+    y = (y | (y << 2)) & 0x33333333;
+    y = (y | (y << 1)) & 0x55555555;
+
+    return x | (y << 1);
+}
+
+// find the leftmost node of a polygon ring
+function getLeftmost(start) {
+    let p = start,
+        leftmost = start;
+    do {
+        if (p.x < leftmost.x || (p.x === leftmost.x && p.y < leftmost.y)) leftmost = p;
+        p = p.next;
+    } while (p !== start);
+
+    return leftmost;
+}
+
+// check if a point lies within a convex triangle
+function pointInTriangle(ax, ay, bx, by, cx, cy, px, py) {
+    return (cx - px) * (ay - py) >= (ax - px) * (cy - py) &&
+           (ax - px) * (by - py) >= (bx - px) * (ay - py) &&
+           (bx - px) * (cy - py) >= (cx - px) * (by - py);
+}
+
+// check if a point lies within a convex triangle but false if its equal to the first point of the triangle
+function pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, px, py) {
+    return !(ax === px && ay === py) && pointInTriangle(ax, ay, bx, by, cx, cy, px, py);
+}
+
+// check if a diagonal between two polygon nodes is valid (lies in polygon interior)
+function isValidDiagonal(a, b) {
+    return a.next.i !== b.i && a.prev.i !== b.i && !intersectsPolygon(a, b) && // doesn't intersect other edges
+           (locallyInside(a, b) && locallyInside(b, a) && middleInside(a, b) && // locally visible
+            (area(a.prev, a, b.prev) || area(a, b.prev, b)) || // does not create opposite-facing sectors
+            equals(a, b) && area(a.prev, a, a.next) > 0 && area(b.prev, b, b.next) > 0); // special zero-length case
+}
+
+// signed area of a triangle
+function area(p, q, r) {
+    return (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
+}
+
+// check if two points are equal
+function equals(p1, p2) {
+    return p1.x === p2.x && p1.y === p2.y;
+}
+
+// check if two segments intersect
+function intersects(p1, q1, p2, q2) {
+    const o1 = sign(area(p1, q1, p2));
+    const o2 = sign(area(p1, q1, q2));
+    const o3 = sign(area(p2, q2, p1));
+    const o4 = sign(area(p2, q2, q1));
+
+    if (o1 !== o2 && o3 !== o4) return true; // general case
+
+    if (o1 === 0 && onSegment(p1, p2, q1)) return true; // p1, q1 and p2 are collinear and p2 lies on p1q1
+    if (o2 === 0 && onSegment(p1, q2, q1)) return true; // p1, q1 and q2 are collinear and q2 lies on p1q1
+    if (o3 === 0 && onSegment(p2, p1, q2)) return true; // p2, q2 and p1 are collinear and p1 lies on p2q2
+    if (o4 === 0 && onSegment(p2, q1, q2)) return true; // p2, q2 and q1 are collinear and q1 lies on p2q2
+
+    return false;
+}
+
+// for collinear points p, q, r, check if point q lies on segment pr
+function onSegment(p, q, r) {
+    return q.x <= Math.max(p.x, r.x) && q.x >= Math.min(p.x, r.x) && q.y <= Math.max(p.y, r.y) && q.y >= Math.min(p.y, r.y);
+}
+
+function sign(num) {
+    return num > 0 ? 1 : num < 0 ? -1 : 0;
+}
+
+// check if a polygon diagonal intersects any polygon segments
+function intersectsPolygon(a, b) {
+    let p = a;
+    do {
+        if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&
+                intersects(p, p.next, a, b)) return true;
+        p = p.next;
+    } while (p !== a);
+
+    return false;
+}
+
+// check if a polygon diagonal is locally inside the polygon
+function locallyInside(a, b) {
+    return area(a.prev, a, a.next) < 0 ?
+        area(a, b, a.next) >= 0 && area(a, a.prev, b) >= 0 :
+        area(a, b, a.prev) < 0 || area(a, a.next, b) < 0;
+}
+
+// check if the middle point of a polygon diagonal is inside the polygon
+function middleInside(a, b) {
+    let p = a;
+    let inside = false;
+    const px = (a.x + b.x) / 2;
+    const py = (a.y + b.y) / 2;
+    do {
+        if (((p.y > py) !== (p.next.y > py)) && p.next.y !== p.y &&
+                (px < (p.next.x - p.x) * (py - p.y) / (p.next.y - p.y) + p.x))
+            inside = !inside;
+        p = p.next;
+    } while (p !== a);
+
+    return inside;
+}
+
+// link two polygon vertices with a bridge; if the vertices belong to the same ring, it splits polygon into two;
+// if one belongs to the outer ring and another to a hole, it merges it into a single ring
+function splitPolygon(a, b) {
+    const a2 = createNode(a.i, a.x, a.y),
+        b2 = createNode(b.i, b.x, b.y),
+        an = a.next,
+        bp = b.prev;
+
+    a.next = b;
+    b.prev = a;
+
+    a2.next = an;
+    an.prev = a2;
+
+    b2.next = a2;
+    a2.prev = b2;
+
+    bp.next = b2;
+    b2.prev = bp;
+
+    return b2;
+}
+
+// create a node and optionally link it with previous one (in a circular doubly linked list)
+function insertNode(i, x, y, last) {
+    const p = createNode(i, x, y);
+
+    if (!last) {
+        p.prev = p;
+        p.next = p;
+
+    } else {
+        p.next = last.next;
+        p.prev = last;
+        last.next.prev = p;
+        last.next = p;
+    }
+    return p;
+}
+
+function removeNode(p) {
+    p.next.prev = p.prev;
+    p.prev.next = p.next;
+
+    if (p.prevZ) p.prevZ.nextZ = p.nextZ;
+    if (p.nextZ) p.nextZ.prevZ = p.prevZ;
+}
+
+function createNode(i, x, y) {
+    return {
+        i, // vertex index in coordinates array
+        x, y, // vertex coordinates
+        prev: null, // previous and next vertex nodes in a polygon ring
+        next: null,
+        z: 0, // z-order curve value
+        prevZ: null, // previous and next nodes in z-order
+        nextZ: null,
+        steiner: false // indicates whether this is a steiner point
+    };
+}
+
+function signedArea(data, start, end, dim) {
+    let sum = 0;
+    for (let i = start, j = end - dim; i < end; i += dim) {
+        sum += (data[j] - data[i]) * (data[i + 1] + data[j + 1]);
+        j = i;
+    }
+    return sum;
+}
+
+/**
+ * An implementation of the earcut polygon triangulation algorithm.
+ * The code is a port of [mapbox/earcut](https://github.com/mapbox/earcut).
+ *
+ * @see https://github.com/mapbox/earcut
+ */
+class Earcut {
+
+	/**
+	 * Triangulates the given shape definition by returning an array of triangles.
+	 *
+	 * @param {Array<number>} data - An array with 2D points.
+	 * @param {Array<number>} holeIndices - An array with indices defining holes.
+	 * @param {number} [dim=2] - The number of coordinates per vertex in the input array.
+	 * @return {Array<number>} An array representing the triangulated faces. Each face is defined by three consecutive numbers
+	 * representing vertex indices.
+	 */
+	static triangulate( data, holeIndices, dim = 2 ) {
+
+		return earcut( data, holeIndices, dim );
+
+	}
+
+}
+
+/**
+ * A class containing utility functions for shapes.
+ *
+ * @hideconstructor
+ */
+class ShapeUtils {
+
+	/**
+	 * Calculate area of a ( 2D ) contour polygon.
+	 *
+	 * @param {Array<Vector2>} contour - An array of 2D points.
+	 * @return {number} The area.
+	 */
+	static area( contour ) {
+
+		const n = contour.length;
+		let a = 0.0;
+
+		for ( let p = n - 1, q = 0; q < n; p = q ++ ) {
+
+			a += contour[ p ].x * contour[ q ].y - contour[ q ].x * contour[ p ].y;
+
+		}
+
+		return a * 0.5;
+
+	}
+
+	/**
+	 * Returns `true` if the given contour uses a clockwise winding order.
+	 *
+	 * @param {Array<Vector2>} pts - An array of 2D points defining a polygon.
+	 * @return {boolean} Whether the given contour uses a clockwise winding order or not.
+	 */
+	static isClockWise( pts ) {
+
+		return ShapeUtils.area( pts ) < 0;
+
+	}
+
+	/**
+	 * Triangulates the given shape definition.
+	 *
+	 * @param {Array<Vector2>} contour - An array of 2D points defining the contour.
+	 * @param {Array<Array<Vector2>>} holes - An array that holds arrays of 2D points defining the holes.
+	 * @return {Array<Array<number>>} An array that holds for each face definition an array with three indices.
+	 */
+	static triangulateShape( contour, holes ) {
+
+		const vertices = []; // flat array of vertices like [ x0,y0, x1,y1, x2,y2, ... ]
+		const holeIndices = []; // array of hole indices
+		const faces = []; // final array of vertex indices like [ [ a,b,d ], [ b,c,d ] ]
+
+		removeDupEndPts( contour );
+		addContour( vertices, contour );
+
+		//
+
+		let holeIndex = contour.length;
+
+		holes.forEach( removeDupEndPts );
+
+		for ( let i = 0; i < holes.length; i ++ ) {
+
+			holeIndices.push( holeIndex );
+			holeIndex += holes[ i ].length;
+			addContour( vertices, holes[ i ] );
+
+		}
+
+		//
+
+		const triangles = Earcut.triangulate( vertices, holeIndices );
+
+		//
+
+		for ( let i = 0; i < triangles.length; i += 3 ) {
+
+			faces.push( triangles.slice( i, i + 3 ) );
+
+		}
+
+		return faces;
+
+	}
+
+}
+
+function removeDupEndPts( points ) {
+
+	const l = points.length;
+
+	if ( l > 2 && points[ l - 1 ].equals( points[ 0 ] ) ) {
+
+		points.pop();
+
+	}
+
+}
+
+function addContour( vertices, contour ) {
+
+	for ( let i = 0; i < contour.length; i ++ ) {
+
+		vertices.push( contour[ i ].x );
+		vertices.push( contour[ i ].y );
+
+	}
+
+}
+
+/**
+ * Creates extruded geometry from a path shape.
+ *
+ * ```js
+ * const length = 12, width = 8;
+ *
+ * const shape = new THREE.Shape();
+ * shape.moveTo( 0,0 );
+ * shape.lineTo( 0, width );
+ * shape.lineTo( length, width );
+ * shape.lineTo( length, 0 );
+ * shape.lineTo( 0, 0 );
+ *
+ * const geometry = new THREE.ExtrudeGeometry( shape );
+ * const material = new THREE.MeshBasicMaterial( { color: 0x00ff00 } );
+ * const mesh = new THREE.Mesh( geometry, material ) ;
+ * scene.add( mesh );
+ * ```
+ *
+ * @augments BufferGeometry
+ * @demo scenes/geometry-browser.html#ExtrudeGeometry
+ */
+class ExtrudeGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new extrude geometry.
+	 *
+	 * @param {Shape|Array<Shape>} [shapes] - A shape or an array of shapes.
+	 * @param {ExtrudeGeometry~Options} [options] - The extrude settings.
+	 */
+	constructor( shapes = new Shape( [ new Vector2( 0.5, 0.5 ), new Vector2( -0.5, 0.5 ), new Vector2( -0.5, -0.5 ), new Vector2( 0.5, -0.5 ) ] ), options = {} ) {
+
+		super();
+
+		this.type = 'ExtrudeGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			shapes: shapes,
+			options: options
+		};
+
+		shapes = Array.isArray( shapes ) ? shapes : [ shapes ];
+
+		const scope = this;
+
+		const verticesArray = [];
+		const uvArray = [];
+
+		for ( let i = 0, l = shapes.length; i < l; i ++ ) {
+
+			const shape = shapes[ i ];
+			addShape( shape );
+
+		}
+
+		// build geometry
+
+		this.setAttribute( 'position', new Float32BufferAttribute( verticesArray, 3 ) );
+		this.setAttribute( 'uv', new Float32BufferAttribute( uvArray, 2 ) );
+
+		this.computeVertexNormals();
+
+		// functions
+
+		function addShape( shape ) {
+
+			const placeholder = [];
+
+			// options
+
+			const curveSegments = options.curveSegments !== undefined ? options.curveSegments : 12;
+			const steps = options.steps !== undefined ? options.steps : 1;
+			const depth = options.depth !== undefined ? options.depth : 1;
+
+			let bevelEnabled = options.bevelEnabled !== undefined ? options.bevelEnabled : true;
+			let bevelThickness = options.bevelThickness !== undefined ? options.bevelThickness : 0.2;
+			let bevelSize = options.bevelSize !== undefined ? options.bevelSize : bevelThickness - 0.1;
+			let bevelOffset = options.bevelOffset !== undefined ? options.bevelOffset : 0;
+			let bevelSegments = options.bevelSegments !== undefined ? options.bevelSegments : 3;
+
+			const extrudePath = options.extrudePath;
+
+			const uvgen = options.UVGenerator !== undefined ? options.UVGenerator : WorldUVGenerator;
+
+			//
+
+			let extrudePts, extrudeByPath = false;
+			let splineTube, binormal, normal, position2;
+
+			if ( extrudePath ) {
+
+				extrudePts = extrudePath.getSpacedPoints( steps );
+
+				extrudeByPath = true;
+				bevelEnabled = false; // bevels not supported for path extrusion
+
+				// SETUP TNB variables
+
+				const isClosed = extrudePath.isCatmullRomCurve3 ? extrudePath.closed : false;
+
+				splineTube = extrudePath.computeFrenetFrames( steps, isClosed );
+
+				// log(splineTube, 'splineTube', splineTube.normals.length, 'steps', steps, 'extrudePts', extrudePts.length);
+
+				binormal = new Vector3();
+				normal = new Vector3();
+				position2 = new Vector3();
+
+			}
+
+			// Safeguards if bevels are not enabled
+
+			if ( ! bevelEnabled ) {
+
+				bevelSegments = 0;
+				bevelThickness = 0;
+				bevelSize = 0;
+				bevelOffset = 0;
+
+			}
+
+			// Variables initialization
+
+			const shapePoints = shape.extractPoints( curveSegments );
+
+			let vertices = shapePoints.shape;
+			const holes = shapePoints.holes;
+
+			const reverse = ! ShapeUtils.isClockWise( vertices );
+
+			if ( reverse ) {
+
+				vertices = vertices.reverse();
+
+				// Maybe we should also check if holes are in the opposite direction, just to be safe ...
+
+				for ( let h = 0, hl = holes.length; h < hl; h ++ ) {
+
+					const ahole = holes[ h ];
+
+					if ( ShapeUtils.isClockWise( ahole ) ) {
+
+						holes[ h ] = ahole.reverse();
+
+					}
+
+				}
+
+			}
+
+			/**Merges index-adjacent points that are within a threshold distance of each other. Array is modified in-place. Threshold distance is empirical, and scaled based on the magnitude of point coordinates.
+			 * @param {Array<Vector2>} points
+			*/
+			function mergeOverlappingPoints( points ) {
+
+				const THRESHOLD = 1e-10;
+				const THRESHOLD_SQ = THRESHOLD * THRESHOLD;
+				let prevPos = points[ 0 ];
+				for ( let i = 1; i <= points.length; i ++ ) {
+
+					const currentIndex = i % points.length;
+					const currentPos = points[ currentIndex ];
+					const dx = currentPos.x - prevPos.x;
+					const dy = currentPos.y - prevPos.y;
+					const distSq = dx * dx + dy * dy;
+
+					const scalingFactorSqrt = Math.max(
+						Math.abs( currentPos.x ),
+						Math.abs( currentPos.y ),
+						Math.abs( prevPos.x ),
+						Math.abs( prevPos.y )
+					);
+					const thresholdSqScaled = THRESHOLD_SQ * scalingFactorSqrt * scalingFactorSqrt;
+					if ( distSq <= thresholdSqScaled ) {
+
+						points.splice( currentIndex, 1 );
+						i --;
+						continue;
+
+					}
+
+					prevPos = currentPos;
+
+				}
+
+			}
+
+			mergeOverlappingPoints( vertices );
+			holes.forEach( mergeOverlappingPoints );
+
+			const numHoles = holes.length;
+
+			/* Vertices */
+
+			const contour = vertices; // vertices has all points but contour has only points of circumference
+
+			for ( let h = 0; h < numHoles; h ++ ) {
+
+				const ahole = holes[ h ];
+
+				vertices = vertices.concat( ahole );
+
+			}
+
+
+			function scalePt2( pt, vec, size ) {
+
+				if ( ! vec ) error( 'ExtrudeGeometry: vec does not exist' );
+
+				return pt.clone().addScaledVector( vec, size );
+
+			}
+
+			const vlen = vertices.length;
+
+
+			// Find directions for point movement
+
+
+			function getBevelVec( inPt, inPrev, inNext ) {
+
+				// computes for inPt the corresponding point inPt' on a new contour
+				//   shifted by 1 unit (length of normalized vector) to the left
+				// if we walk along contour clockwise, this new contour is outside the old one
+				//
+				// inPt' is the intersection of the two lines parallel to the two
+				//  adjacent edges of inPt at a distance of 1 unit on the left side.
+
+				let v_trans_x, v_trans_y, shrink_by; // resulting translation vector for inPt
+
+				// good reading for geometry algorithms (here: line-line intersection)
+				// http://geomalgorithms.com/a05-_intersect-1.html
+
+				const v_prev_x = inPt.x - inPrev.x,
+					v_prev_y = inPt.y - inPrev.y;
+				const v_next_x = inNext.x - inPt.x,
+					v_next_y = inNext.y - inPt.y;
+
+				const v_prev_lensq = ( v_prev_x * v_prev_x + v_prev_y * v_prev_y );
+
+				// check for collinear edges
+				const collinear0 = ( v_prev_x * v_next_y - v_prev_y * v_next_x );
+
+				if ( Math.abs( collinear0 ) > Number.EPSILON ) {
+
+					// not collinear
+
+					// length of vectors for normalizing
+
+					const v_prev_len = Math.sqrt( v_prev_lensq );
+					const v_next_len = Math.sqrt( v_next_x * v_next_x + v_next_y * v_next_y );
+
+					// shift adjacent points by unit vectors to the left
+
+					const ptPrevShift_x = ( inPrev.x - v_prev_y / v_prev_len );
+					const ptPrevShift_y = ( inPrev.y + v_prev_x / v_prev_len );
+
+					const ptNextShift_x = ( inNext.x - v_next_y / v_next_len );
+					const ptNextShift_y = ( inNext.y + v_next_x / v_next_len );
+
+					// scaling factor for v_prev to intersection point
+
+					const sf = ( ( ptNextShift_x - ptPrevShift_x ) * v_next_y -
+							( ptNextShift_y - ptPrevShift_y ) * v_next_x ) /
+						( v_prev_x * v_next_y - v_prev_y * v_next_x );
+
+					// vector from inPt to intersection point
+
+					v_trans_x = ( ptPrevShift_x + v_prev_x * sf - inPt.x );
+					v_trans_y = ( ptPrevShift_y + v_prev_y * sf - inPt.y );
+
+					// Don't normalize!, otherwise sharp corners become ugly
+					//  but prevent crazy spikes
+					const v_trans_lensq = ( v_trans_x * v_trans_x + v_trans_y * v_trans_y );
+					if ( v_trans_lensq <= 2 ) {
+
+						return new Vector2( v_trans_x, v_trans_y );
+
+					} else {
+
+						shrink_by = Math.sqrt( v_trans_lensq / 2 );
+
+					}
+
+				} else {
+
+					// handle special case of collinear edges
+
+					let direction_eq = false; // assumes: opposite
+
+					if ( v_prev_x > Number.EPSILON ) {
+
+						if ( v_next_x > Number.EPSILON ) {
+
+							direction_eq = true;
+
+						}
+
+					} else {
+
+						if ( v_prev_x < - Number.EPSILON ) {
+
+							if ( v_next_x < - Number.EPSILON ) {
+
+								direction_eq = true;
+
+							}
+
+						} else {
+
+							if ( Math.sign( v_prev_y ) === Math.sign( v_next_y ) ) {
+
+								direction_eq = true;
+
+							}
+
+						}
+
+					}
+
+					if ( direction_eq ) {
+
+						// log("Warning: lines are a straight sequence");
+						v_trans_x = - v_prev_y;
+						v_trans_y = v_prev_x;
+						shrink_by = Math.sqrt( v_prev_lensq );
+
+					} else {
+
+						// log("Warning: lines are a straight spike");
+						v_trans_x = v_prev_x;
+						v_trans_y = v_prev_y;
+						shrink_by = Math.sqrt( v_prev_lensq / 2 );
+
+					}
+
+				}
+
+				return new Vector2( v_trans_x / shrink_by, v_trans_y / shrink_by );
+
+			}
+
+
+			const contourMovements = [];
+
+			for ( let i = 0, il = contour.length, j = il - 1, k = i + 1; i < il; i ++, j ++, k ++ ) {
+
+				if ( j === il ) j = 0;
+				if ( k === il ) k = 0;
+
+				//  (j)---(i)---(k)
+				// log('i,j,k', i, j , k)
+
+				contourMovements[ i ] = getBevelVec( contour[ i ], contour[ j ], contour[ k ] );
+
+			}
+
+			const holesMovements = [];
+			let oneHoleMovements, verticesMovements = contourMovements.concat();
+
+			for ( let h = 0, hl = numHoles; h < hl; h ++ ) {
+
+				const ahole = holes[ h ];
+
+				oneHoleMovements = [];
+
+				for ( let i = 0, il = ahole.length, j = il - 1, k = i + 1; i < il; i ++, j ++, k ++ ) {
+
+					if ( j === il ) j = 0;
+					if ( k === il ) k = 0;
+
+					//  (j)---(i)---(k)
+					oneHoleMovements[ i ] = getBevelVec( ahole[ i ], ahole[ j ], ahole[ k ] );
+
+				}
+
+				holesMovements.push( oneHoleMovements );
+				verticesMovements = verticesMovements.concat( oneHoleMovements );
+
+			}
+
+			let faces;
+
+			if ( bevelSegments === 0 ) {
+
+				faces = ShapeUtils.triangulateShape( contour, holes );
+
+			} else {
+
+				const contractedContourVertices = [];
+				const expandedHoleVertices = [];
+
+				// Loop bevelSegments, 1 for the front, 1 for the back
+
+				for ( let b = 0; b < bevelSegments; b ++ ) {
+
+					//for ( b = bevelSegments; b > 0; b -- ) {
+
+					const t = b / bevelSegments;
+					const z = bevelThickness * Math.cos( t * Math.PI / 2 );
+					const bs = bevelSize * Math.sin( t * Math.PI / 2 ) + bevelOffset;
+
+					// contract shape
+
+					for ( let i = 0, il = contour.length; i < il; i ++ ) {
+
+						const vert = scalePt2( contour[ i ], contourMovements[ i ], bs );
+
+						v( vert.x, vert.y, - z );
+						if ( t === 0 ) contractedContourVertices.push( vert );
+
+					}
+
+					// expand holes
+
+					for ( let h = 0, hl = numHoles; h < hl; h ++ ) {
+
+						const ahole = holes[ h ];
+						oneHoleMovements = holesMovements[ h ];
+						const oneHoleVertices = [];
+						for ( let i = 0, il = ahole.length; i < il; i ++ ) {
+
+							const vert = scalePt2( ahole[ i ], oneHoleMovements[ i ], bs );
+
+							v( vert.x, vert.y, - z );
+							if ( t === 0 ) oneHoleVertices.push( vert );
+
+						}
+
+						if ( t === 0 ) expandedHoleVertices.push( oneHoleVertices );
+
+					}
+
+				}
+
+				faces = ShapeUtils.triangulateShape( contractedContourVertices, expandedHoleVertices );
+
+			}
+
+			const flen = faces.length;
+
+			const bs = bevelSize + bevelOffset;
+
+			// Back facing vertices
+
+			for ( let i = 0; i < vlen; i ++ ) {
+
+				const vert = bevelEnabled ? scalePt2( vertices[ i ], verticesMovements[ i ], bs ) : vertices[ i ];
+
+				if ( ! extrudeByPath ) {
+
+					v( vert.x, vert.y, 0 );
+
+				} else {
+
+					// v( vert.x, vert.y + extrudePts[ 0 ].y, extrudePts[ 0 ].x );
+
+					normal.copy( splineTube.normals[ 0 ] ).multiplyScalar( vert.x );
+					binormal.copy( splineTube.binormals[ 0 ] ).multiplyScalar( vert.y );
+
+					position2.copy( extrudePts[ 0 ] ).add( normal ).add( binormal );
+
+					v( position2.x, position2.y, position2.z );
+
+				}
+
+			}
+
+			// Add stepped vertices...
+			// Including front facing vertices
+
+			for ( let s = 1; s <= steps; s ++ ) {
+
+				for ( let i = 0; i < vlen; i ++ ) {
+
+					const vert = bevelEnabled ? scalePt2( vertices[ i ], verticesMovements[ i ], bs ) : vertices[ i ];
+
+					if ( ! extrudeByPath ) {
+
+						v( vert.x, vert.y, depth / steps * s );
+
+					} else {
+
+						// v( vert.x, vert.y + extrudePts[ s - 1 ].y, extrudePts[ s - 1 ].x );
+
+						normal.copy( splineTube.normals[ s ] ).multiplyScalar( vert.x );
+						binormal.copy( splineTube.binormals[ s ] ).multiplyScalar( vert.y );
+
+						position2.copy( extrudePts[ s ] ).add( normal ).add( binormal );
+
+						v( position2.x, position2.y, position2.z );
+
+					}
+
+				}
+
+			}
+
+
+			// Add bevel segments planes
+
+			//for ( b = 1; b <= bevelSegments; b ++ ) {
+			for ( let b = bevelSegments - 1; b >= 0; b -- ) {
+
+				const t = b / bevelSegments;
+				const z = bevelThickness * Math.cos( t * Math.PI / 2 );
+				const bs = bevelSize * Math.sin( t * Math.PI / 2 ) + bevelOffset;
+
+				// contract shape
+
+				for ( let i = 0, il = contour.length; i < il; i ++ ) {
+
+					const vert = scalePt2( contour[ i ], contourMovements[ i ], bs );
+					v( vert.x, vert.y, depth + z );
+
+				}
+
+				// expand holes
+
+				for ( let h = 0, hl = holes.length; h < hl; h ++ ) {
+
+					const ahole = holes[ h ];
+					oneHoleMovements = holesMovements[ h ];
+
+					for ( let i = 0, il = ahole.length; i < il; i ++ ) {
+
+						const vert = scalePt2( ahole[ i ], oneHoleMovements[ i ], bs );
+
+						if ( ! extrudeByPath ) {
+
+							v( vert.x, vert.y, depth + z );
+
+						} else {
+
+							v( vert.x, vert.y + extrudePts[ steps - 1 ].y, extrudePts[ steps - 1 ].x + z );
+
+						}
+
+					}
+
+				}
+
+			}
+
+			/* Faces */
+
+			// Top and bottom faces
+
+			buildLidFaces();
+
+			// Sides faces
+
+			buildSideFaces();
+
+
+			/////  Internal functions
+
+			function buildLidFaces() {
+
+				const start = verticesArray.length / 3;
+
+				if ( bevelEnabled ) {
+
+					let layer = 0; // steps + 1
+					let offset = vlen * layer;
+
+					// Bottom faces
+
+					for ( let i = 0; i < flen; i ++ ) {
+
+						const face = faces[ i ];
+						f3( face[ 2 ] + offset, face[ 1 ] + offset, face[ 0 ] + offset );
+
+					}
+
+					layer = steps + bevelSegments * 2;
+					offset = vlen * layer;
+
+					// Top faces
+
+					for ( let i = 0; i < flen; i ++ ) {
+
+						const face = faces[ i ];
+						f3( face[ 0 ] + offset, face[ 1 ] + offset, face[ 2 ] + offset );
+
+					}
+
+				} else {
+
+					// Bottom faces
+
+					for ( let i = 0; i < flen; i ++ ) {
+
+						const face = faces[ i ];
+						f3( face[ 2 ], face[ 1 ], face[ 0 ] );
+
+					}
+
+					// Top faces
+
+					for ( let i = 0; i < flen; i ++ ) {
+
+						const face = faces[ i ];
+						f3( face[ 0 ] + vlen * steps, face[ 1 ] + vlen * steps, face[ 2 ] + vlen * steps );
+
+					}
+
+				}
+
+				scope.addGroup( start, verticesArray.length / 3 - start, 0 );
+
+			}
+
+			// Create faces for the z-sides of the shape
+
+			function buildSideFaces() {
+
+				const start = verticesArray.length / 3;
+				let layeroffset = 0;
+				sidewalls( contour, layeroffset );
+				layeroffset += contour.length;
+
+				for ( let h = 0, hl = holes.length; h < hl; h ++ ) {
+
+					const ahole = holes[ h ];
+					sidewalls( ahole, layeroffset );
+
+					//, true
+					layeroffset += ahole.length;
+
+				}
+
+
+				scope.addGroup( start, verticesArray.length / 3 - start, 1 );
+
+
+			}
+
+			function sidewalls( contour, layeroffset ) {
+
+				let i = contour.length;
+
+				while ( -- i >= 0 ) {
+
+					const j = i;
+					let k = i - 1;
+					if ( k < 0 ) k = contour.length - 1;
+
+					//log('b', i,j, i-1, k,vertices.length);
+
+					for ( let s = 0, sl = ( steps + bevelSegments * 2 ); s < sl; s ++ ) {
+
+						const slen1 = vlen * s;
+						const slen2 = vlen * ( s + 1 );
+
+						const a = layeroffset + j + slen1,
+							b = layeroffset + k + slen1,
+							c = layeroffset + k + slen2,
+							d = layeroffset + j + slen2;
+
+						f4( a, b, c, d );
+
+					}
+
+				}
+
+			}
+
+			function v( x, y, z ) {
+
+				placeholder.push( x );
+				placeholder.push( y );
+				placeholder.push( z );
+
+			}
+
+
+			function f3( a, b, c ) {
+
+				addVertex( a );
+				addVertex( b );
+				addVertex( c );
+
+				const nextIndex = verticesArray.length / 3;
+				const uvs = uvgen.generateTopUV( scope, verticesArray, nextIndex - 3, nextIndex - 2, nextIndex - 1 );
+
+				addUV( uvs[ 0 ] );
+				addUV( uvs[ 1 ] );
+				addUV( uvs[ 2 ] );
+
+			}
+
+			function f4( a, b, c, d ) {
+
+				addVertex( a );
+				addVertex( b );
+				addVertex( d );
+
+				addVertex( b );
+				addVertex( c );
+				addVertex( d );
+
+
+				const nextIndex = verticesArray.length / 3;
+				const uvs = uvgen.generateSideWallUV( scope, verticesArray, nextIndex - 6, nextIndex - 3, nextIndex - 2, nextIndex - 1 );
+
+				addUV( uvs[ 0 ] );
+				addUV( uvs[ 1 ] );
+				addUV( uvs[ 3 ] );
+
+				addUV( uvs[ 1 ] );
+				addUV( uvs[ 2 ] );
+				addUV( uvs[ 3 ] );
+
+			}
+
+			function addVertex( index ) {
+
+				verticesArray.push( placeholder[ index * 3 + 0 ] );
+				verticesArray.push( placeholder[ index * 3 + 1 ] );
+				verticesArray.push( placeholder[ index * 3 + 2 ] );
+
+			}
+
+
+			function addUV( vector2 ) {
+
+				uvArray.push( vector2.x );
+				uvArray.push( vector2.y );
+
+			}
+
+		}
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		const shapes = this.parameters.shapes;
+		const options = this.parameters.options;
+
+		return toJSON$1( shapes, options, data );
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @param {Array<Shape>} shapes - An array of shapes.
+	 * @return {ExtrudeGeometry} A new instance.
+	 */
+	static fromJSON( data, shapes ) {
+
+		const geometryShapes = [];
+
+		for ( let j = 0, jl = data.shapes.length; j < jl; j ++ ) {
+
+			const shape = shapes[ data.shapes[ j ] ];
+
+			geometryShapes.push( shape );
+
+		}
+
+		const extrudePath = data.options.extrudePath;
+
+		if ( extrudePath !== undefined ) {
+
+			data.options.extrudePath = new Curves[ extrudePath.type ]().fromJSON( extrudePath );
+
+		}
+
+		return new ExtrudeGeometry( geometryShapes, data.options );
+
+	}
+
+}
+
+const WorldUVGenerator = {
+
+	generateTopUV: function ( geometry, vertices, indexA, indexB, indexC ) {
+
+		const a_x = vertices[ indexA * 3 ];
+		const a_y = vertices[ indexA * 3 + 1 ];
+		const b_x = vertices[ indexB * 3 ];
+		const b_y = vertices[ indexB * 3 + 1 ];
+		const c_x = vertices[ indexC * 3 ];
+		const c_y = vertices[ indexC * 3 + 1 ];
+
+		return [
+			new Vector2( a_x, a_y ),
+			new Vector2( b_x, b_y ),
+			new Vector2( c_x, c_y )
+		];
+
+	},
+
+	generateSideWallUV: function ( geometry, vertices, indexA, indexB, indexC, indexD ) {
+
+		const a_x = vertices[ indexA * 3 ];
+		const a_y = vertices[ indexA * 3 + 1 ];
+		const a_z = vertices[ indexA * 3 + 2 ];
+		const b_x = vertices[ indexB * 3 ];
+		const b_y = vertices[ indexB * 3 + 1 ];
+		const b_z = vertices[ indexB * 3 + 2 ];
+		const c_x = vertices[ indexC * 3 ];
+		const c_y = vertices[ indexC * 3 + 1 ];
+		const c_z = vertices[ indexC * 3 + 2 ];
+		const d_x = vertices[ indexD * 3 ];
+		const d_y = vertices[ indexD * 3 + 1 ];
+		const d_z = vertices[ indexD * 3 + 2 ];
+
+		if ( Math.abs( a_y - b_y ) < Math.abs( a_x - b_x ) ) {
+
+			return [
+				new Vector2( a_x, 1 - a_z ),
+				new Vector2( b_x, 1 - b_z ),
+				new Vector2( c_x, 1 - c_z ),
+				new Vector2( d_x, 1 - d_z )
+			];
+
+		} else {
+
+			return [
+				new Vector2( a_y, 1 - a_z ),
+				new Vector2( b_y, 1 - b_z ),
+				new Vector2( c_y, 1 - c_z ),
+				new Vector2( d_y, 1 - d_z )
+			];
+
+		}
+
+	}
+
+};
+
+function toJSON$1( shapes, options, data ) {
+
+	data.shapes = [];
+
+	if ( Array.isArray( shapes ) ) {
+
+		for ( let i = 0, l = shapes.length; i < l; i ++ ) {
+
+			const shape = shapes[ i ];
+
+			data.shapes.push( shape.uuid );
+
+		}
+
+	} else {
+
+		data.shapes.push( shapes.uuid );
+
+	}
+
+	data.options = Object.assign( {}, options );
+
+	if ( options.extrudePath !== undefined ) data.options.extrudePath = options.extrudePath.toJSON();
+
+	return data;
+
+}
+
+/**
+ * A geometry class for representing an icosahedron.
+ *
+ * ```js
+ * const geometry = new THREE.IcosahedronGeometry();
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00 } );
+ * const icosahedron = new THREE.Mesh( geometry, material );
+ * scene.add( icosahedron );
+ * ```
+ *
+ * @augments PolyhedronGeometry
+ * @demo scenes/geometry-browser.html#IcosahedronGeometry
+ */
+class IcosahedronGeometry extends PolyhedronGeometry {
+
+	/**
+	 * Constructs a new icosahedron geometry.
+	 *
+	 * @param {number} [radius=1] - Radius of the icosahedron.
+	 * @param {number} [detail=0] - Setting this to a value greater than `0` adds vertices making it no longer a icosahedron.
+	 */
+	constructor( radius = 1, detail = 0 ) {
+
+		const t = ( 1 + Math.sqrt( 5 ) ) / 2;
+
+		const vertices = [
+			-1, t, 0, 	1, t, 0, 	-1, - t, 0, 	1, - t, 0,
+			0, -1, t, 	0, 1, t,	0, -1, - t, 	0, 1, - t,
+			t, 0, -1, 	t, 0, 1, 	- t, 0, -1, 	- t, 0, 1
+		];
+
+		const indices = [
+			0, 11, 5, 	0, 5, 1, 	0, 1, 7, 	0, 7, 10, 	0, 10, 11,
+			1, 5, 9, 	5, 11, 4,	11, 10, 2,	10, 7, 6,	7, 1, 8,
+			3, 9, 4, 	3, 4, 2,	3, 2, 6,	3, 6, 8,	3, 8, 9,
+			4, 9, 5, 	2, 4, 11,	6, 2, 10,	8, 6, 7,	9, 8, 1
+		];
+
+		super( vertices, indices, radius, detail );
+
+		this.type = 'IcosahedronGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			radius: radius,
+			detail: detail
+		};
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {IcosahedronGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new IcosahedronGeometry( data.radius, data.detail );
+
+	}
+
+}
+
+/**
+ * Creates meshes with axial symmetry like vases. The lathe rotates around the Y axis.
+ *
+ * ```js
+ * const points = [];
+ * for ( let i = 0; i < 10; i ++ ) {
+ * 	points.push( new THREE.Vector2( Math.sin( i * 0.2 ) * 10 + 5, ( i - 5 ) * 2 ) );
+ * }
+ * const geometry = new THREE.LatheGeometry( points );
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00 } );
+ * const lathe = new THREE.Mesh( geometry, material );
+ * scene.add( lathe );
+ * ```
+ *
+ * @augments BufferGeometry
+ * @demo scenes/geometry-browser.html#LatheGeometry
+ */
+class LatheGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new lathe geometry.
+	 *
+	 * @param {Array<Vector2|Vector3>} [points] - An array of points in 2D space. The x-coordinate of each point
+	 * must be greater than zero.
+	 * @param {number} [segments=12] - The number of circumference segments to generate.
+	 * @param {number} [phiStart=0] - The starting angle in radians.
+	 * @param {number} [phiLength=Math.PI*2] - The radian (0 to 2PI) range of the lathed section 2PI is a
+	 * closed lathe, less than 2PI is a portion.
+	 */
+	constructor( points = [ new Vector2( 0, -0.5 ), new Vector2( 0.5, 0 ), new Vector2( 0, 0.5 ) ], segments = 12, phiStart = 0, phiLength = Math.PI * 2 ) {
+
+		super();
+
+		this.type = 'LatheGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			points: points,
+			segments: segments,
+			phiStart: phiStart,
+			phiLength: phiLength
+		};
+
+		segments = Math.floor( segments );
+
+		// clamp phiLength so it's in range of [ 0, 2PI ]
+
+		phiLength = clamp( phiLength, 0, Math.PI * 2 );
+
+		// buffers
+
+		const indices = [];
+		const vertices = [];
+		const uvs = [];
+		const initNormals = [];
+		const normals = [];
+
+		// helper variables
+
+		const inverseSegments = 1.0 / segments;
+		const vertex = new Vector3();
+		const uv = new Vector2();
+		const normal = new Vector3();
+		const curNormal = new Vector3();
+		const prevNormal = new Vector3();
+		let dx = 0;
+		let dy = 0;
+
+		// pre-compute normals for initial "meridian"
+
+		for ( let j = 0; j <= ( points.length - 1 ); j ++ ) {
+
+			switch ( j ) {
+
+				case 0:				// special handling for 1st vertex on path
+
+					dx = points[ j + 1 ].x - points[ j ].x;
+					dy = points[ j + 1 ].y - points[ j ].y;
+
+					normal.x = dy * 1.0;
+					normal.y = - dx;
+					normal.z = dy * 0.0;
+
+					prevNormal.copy( normal );
+
+					normal.normalize();
+
+					initNormals.push( normal.x, normal.y, normal.z );
+
+					break;
+
+				case ( points.length - 1 ):	// special handling for last Vertex on path
+
+					initNormals.push( prevNormal.x, prevNormal.y, prevNormal.z );
+
+					break;
+
+				default:			// default handling for all vertices in between
+
+					dx = points[ j + 1 ].x - points[ j ].x;
+					dy = points[ j + 1 ].y - points[ j ].y;
+
+					normal.x = dy * 1.0;
+					normal.y = - dx;
+					normal.z = dy * 0.0;
+
+					curNormal.copy( normal );
+
+					normal.x += prevNormal.x;
+					normal.y += prevNormal.y;
+					normal.z += prevNormal.z;
+
+					normal.normalize();
+
+					initNormals.push( normal.x, normal.y, normal.z );
+
+					prevNormal.copy( curNormal );
+
+			}
+
+		}
+
+		// generate vertices, uvs and normals
+
+		for ( let i = 0; i <= segments; i ++ ) {
+
+			const phi = phiStart + i * inverseSegments * phiLength;
+
+			const sin = Math.sin( phi );
+			const cos = Math.cos( phi );
+
+			for ( let j = 0; j <= ( points.length - 1 ); j ++ ) {
+
+				// vertex
+
+				vertex.x = points[ j ].x * sin;
+				vertex.y = points[ j ].y;
+				vertex.z = points[ j ].x * cos;
+
+				vertices.push( vertex.x, vertex.y, vertex.z );
+
+				// uv
+
+				uv.x = i / segments;
+				uv.y = j / ( points.length - 1 );
+
+				uvs.push( uv.x, uv.y );
+
+				// normal
+
+				const x = initNormals[ 3 * j + 0 ] * sin;
+				const y = initNormals[ 3 * j + 1 ];
+				const z = initNormals[ 3 * j + 0 ] * cos;
+
+				normals.push( x, y, z );
+
+			}
+
+		}
+
+		// indices
+
+		for ( let i = 0; i < segments; i ++ ) {
+
+			for ( let j = 0; j < ( points.length - 1 ); j ++ ) {
+
+				const base = j + i * points.length;
+
+				const a = base;
+				const b = base + points.length;
+				const c = base + points.length + 1;
+				const d = base + 1;
+
+				// faces
+
+				indices.push( a, b, d );
+				indices.push( c, d, b );
+
+			}
+
+		}
+
+		// build geometry
+
+		this.setIndex( indices );
+		this.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		this.setAttribute( 'uv', new Float32BufferAttribute( uvs, 2 ) );
+		this.setAttribute( 'normal', new Float32BufferAttribute( normals, 3 ) );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {LatheGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new LatheGeometry( data.points, data.segments, data.phiStart, data.phiLength );
+
+	}
+
+}
+
+/**
+ * A geometry class for representing an octahedron.
+ *
+ * ```js
+ * const geometry = new THREE.OctahedronGeometry();
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00 } );
+ * const octahedron = new THREE.Mesh( geometry, material );
+ * scene.add( octahedron );
+ * ```
+ *
+ * @augments PolyhedronGeometry
+ * @demo scenes/geometry-browser.html#OctahedronGeometry
+ */
+class OctahedronGeometry extends PolyhedronGeometry {
+
+	/**
+	 * Constructs a new octahedron geometry.
+	 *
+	 * @param {number} [radius=1] - Radius of the octahedron.
+	 * @param {number} [detail=0] - Setting this to a value greater than `0` adds vertices making it no longer a octahedron.
+	 */
+	constructor( radius = 1, detail = 0 ) {
+
+		const vertices = [
+			1, 0, 0, 	-1, 0, 0,	0, 1, 0,
+			0, -1, 0, 	0, 0, 1,	0, 0, -1
+		];
+
+		const indices = [
+			0, 2, 4,	0, 4, 3,	0, 3, 5,
+			0, 5, 2,	1, 2, 5,	1, 5, 3,
+			1, 3, 4,	1, 4, 2
+		];
+
+		super( vertices, indices, radius, detail );
+
+		this.type = 'OctahedronGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			radius: radius,
+			detail: detail
+		};
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {OctahedronGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new OctahedronGeometry( data.radius, data.detail );
+
+	}
+
+}
+
+/**
+ * A geometry class for representing a plane.
+ *
+ * ```js
+ * const geometry = new THREE.PlaneGeometry( 1, 1 );
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00, side: THREE.DoubleSide } );
+ * const plane = new THREE.Mesh( geometry, material );
+ * scene.add( plane );
+ * ```
+ *
+ * @augments BufferGeometry
+ * @demo scenes/geometry-browser.html#PlaneGeometry
+ */
+class PlaneGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new plane geometry.
+	 *
+	 * @param {number} [width=1] - The width along the X axis.
+	 * @param {number} [height=1] - The height along the Y axis
+	 * @param {number} [widthSegments=1] - The number of segments along the X axis.
+	 * @param {number} [heightSegments=1] - The number of segments along the Y axis.
+	 */
+	constructor( width = 1, height = 1, widthSegments = 1, heightSegments = 1 ) {
+
+		super();
+
+		this.type = 'PlaneGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			width: width,
+			height: height,
+			widthSegments: widthSegments,
+			heightSegments: heightSegments
+		};
+
+		const width_half = width / 2;
+		const height_half = height / 2;
+
+		const gridX = Math.floor( widthSegments );
+		const gridY = Math.floor( heightSegments );
+
+		const gridX1 = gridX + 1;
+		const gridY1 = gridY + 1;
+
+		const segment_width = width / gridX;
+		const segment_height = height / gridY;
+
+		//
+
+		const indices = [];
+		const vertices = [];
+		const normals = [];
+		const uvs = [];
+
+		for ( let iy = 0; iy < gridY1; iy ++ ) {
+
+			const y = iy * segment_height - height_half;
+
+			for ( let ix = 0; ix < gridX1; ix ++ ) {
+
+				const x = ix * segment_width - width_half;
+
+				vertices.push( x, - y, 0 );
+
+				normals.push( 0, 0, 1 );
+
+				uvs.push( ix / gridX );
+				uvs.push( 1 - ( iy / gridY ) );
+
+			}
+
+		}
+
+		for ( let iy = 0; iy < gridY; iy ++ ) {
+
+			for ( let ix = 0; ix < gridX; ix ++ ) {
+
+				const a = ix + gridX1 * iy;
+				const b = ix + gridX1 * ( iy + 1 );
+				const c = ( ix + 1 ) + gridX1 * ( iy + 1 );
+				const d = ( ix + 1 ) + gridX1 * iy;
+
+				indices.push( a, b, d );
+				indices.push( b, c, d );
+
+			}
+
+		}
+
+		this.setIndex( indices );
+		this.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		this.setAttribute( 'normal', new Float32BufferAttribute( normals, 3 ) );
+		this.setAttribute( 'uv', new Float32BufferAttribute( uvs, 2 ) );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {PlaneGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new PlaneGeometry( data.width, data.height, data.widthSegments, data.heightSegments );
+
+	}
+
+}
+
+/**
+ * A class for generating a two-dimensional ring geometry.
+ *
+ * ```js
+ * const geometry = new THREE.RingGeometry( 1, 5, 32 );
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00, side: THREE.DoubleSide } );
+ * const mesh = new THREE.Mesh( geometry, material );
+ * scene.add( mesh );
+ * ```
+ *
+ * @augments BufferGeometry
+ * @demo scenes/geometry-browser.html#RingGeometry
+ */
+class RingGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new ring geometry.
+	 *
+	 * @param {number} [innerRadius=0.5] - The inner radius of the ring.
+	 * @param {number} [outerRadius=1] - The outer radius of the ring.
+	 * @param {number} [thetaSegments=32] - Number of segments. A higher number means the ring will be more round. Minimum is `3`.
+	 * @param {number} [phiSegments=1] - Number of segments per ring segment. Minimum is `1`.
+	 * @param {number} [thetaStart=0] - Starting angle in radians.
+	 * @param {number} [thetaLength=Math.PI*2] - Central angle in radians.
+	 */
+	constructor( innerRadius = 0.5, outerRadius = 1, thetaSegments = 32, phiSegments = 1, thetaStart = 0, thetaLength = Math.PI * 2 ) {
+
+		super();
+
+		this.type = 'RingGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			innerRadius: innerRadius,
+			outerRadius: outerRadius,
+			thetaSegments: thetaSegments,
+			phiSegments: phiSegments,
+			thetaStart: thetaStart,
+			thetaLength: thetaLength
+		};
+
+		thetaSegments = Math.max( 3, thetaSegments );
+		phiSegments = Math.max( 1, phiSegments );
+
+		// buffers
+
+		const indices = [];
+		const vertices = [];
+		const normals = [];
+		const uvs = [];
+
+		// some helper variables
+
+		let radius = innerRadius;
+		const radiusStep = ( ( outerRadius - innerRadius ) / phiSegments );
+		const vertex = new Vector3();
+		const uv = new Vector2();
+
+		// generate vertices, normals and uvs
+
+		for ( let j = 0; j <= phiSegments; j ++ ) {
+
+			for ( let i = 0; i <= thetaSegments; i ++ ) {
+
+				// values are generate from the inside of the ring to the outside
+
+				const segment = thetaStart + i / thetaSegments * thetaLength;
+
+				// vertex
+
+				vertex.x = radius * Math.cos( segment );
+				vertex.y = radius * Math.sin( segment );
+
+				vertices.push( vertex.x, vertex.y, vertex.z );
+
+				// normal
+
+				normals.push( 0, 0, 1 );
+
+				// uv
+
+				uv.x = ( vertex.x / outerRadius + 1 ) / 2;
+				uv.y = ( vertex.y / outerRadius + 1 ) / 2;
+
+				uvs.push( uv.x, uv.y );
+
+			}
+
+			// increase the radius for next row of vertices
+
+			radius += radiusStep;
+
+		}
+
+		// indices
+
+		for ( let j = 0; j < phiSegments; j ++ ) {
+
+			const thetaSegmentLevel = j * ( thetaSegments + 1 );
+
+			for ( let i = 0; i < thetaSegments; i ++ ) {
+
+				const segment = i + thetaSegmentLevel;
+
+				const a = segment;
+				const b = segment + thetaSegments + 1;
+				const c = segment + thetaSegments + 2;
+				const d = segment + 1;
+
+				// faces
+
+				indices.push( a, b, d );
+				indices.push( b, c, d );
+
+			}
+
+		}
+
+		// build geometry
+
+		this.setIndex( indices );
+		this.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		this.setAttribute( 'normal', new Float32BufferAttribute( normals, 3 ) );
+		this.setAttribute( 'uv', new Float32BufferAttribute( uvs, 2 ) );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {RingGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new RingGeometry( data.innerRadius, data.outerRadius, data.thetaSegments, data.phiSegments, data.thetaStart, data.thetaLength );
+
+	}
+
+}
+
+/**
+ * Creates an one-sided polygonal geometry from one or more path shapes.
+ *
+ * ```js
+ * const arcShape = new THREE.Shape()
+ *	.moveTo( 5, 1 )
+ *	.absarc( 1, 1, 4, 0, Math.PI * 2, false );
+ *
+ * const geometry = new THREE.ShapeGeometry( arcShape );
+ * const material = new THREE.MeshBasicMaterial( { color: 0x00ff00, side: THREE.DoubleSide } );
+ * const mesh = new THREE.Mesh( geometry, material ) ;
+ * scene.add( mesh );
+ * ```
+ *
+ * @augments BufferGeometry
+ * @demo scenes/geometry-browser.html#ShapeGeometry
+ */
+class ShapeGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new shape geometry.
+	 *
+	 * @param {Shape|Array<Shape>} [shapes] - A shape or an array of shapes.
+	 * @param {number} [curveSegments=12] - Number of segments per shape.
+	 */
+	constructor( shapes = new Shape( [ new Vector2( 0, 0.5 ), new Vector2( -0.5, -0.5 ), new Vector2( 0.5, -0.5 ) ] ), curveSegments = 12 ) {
+
+		super();
+
+		this.type = 'ShapeGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			shapes: shapes,
+			curveSegments: curveSegments
+		};
+
+		// buffers
+
+		const indices = [];
+		const vertices = [];
+		const normals = [];
+		const uvs = [];
+
+		// helper variables
+
+		let groupStart = 0;
+		let groupCount = 0;
+
+		// allow single and array values for "shapes" parameter
+
+		if ( Array.isArray( shapes ) === false ) {
+
+			addShape( shapes );
+
+		} else {
+
+			for ( let i = 0; i < shapes.length; i ++ ) {
+
+				addShape( shapes[ i ] );
+
+				this.addGroup( groupStart, groupCount, i ); // enables MultiMaterial support
+
+				groupStart += groupCount;
+				groupCount = 0;
+
+			}
+
+		}
+
+		// build geometry
+
+		this.setIndex( indices );
+		this.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		this.setAttribute( 'normal', new Float32BufferAttribute( normals, 3 ) );
+		this.setAttribute( 'uv', new Float32BufferAttribute( uvs, 2 ) );
+
+
+		// helper functions
+
+		function addShape( shape ) {
+
+			const indexOffset = vertices.length / 3;
+			const points = shape.extractPoints( curveSegments );
+
+			let shapeVertices = points.shape;
+			const shapeHoles = points.holes;
+
+			// check direction of vertices
+
+			if ( ShapeUtils.isClockWise( shapeVertices ) === false ) {
+
+				shapeVertices = shapeVertices.reverse();
+
+			}
+
+			for ( let i = 0, l = shapeHoles.length; i < l; i ++ ) {
+
+				const shapeHole = shapeHoles[ i ];
+
+				if ( ShapeUtils.isClockWise( shapeHole ) === true ) {
+
+					shapeHoles[ i ] = shapeHole.reverse();
+
+				}
+
+			}
+
+			const faces = ShapeUtils.triangulateShape( shapeVertices, shapeHoles );
+
+			// join vertices of inner and outer paths to a single array
+
+			for ( let i = 0, l = shapeHoles.length; i < l; i ++ ) {
+
+				const shapeHole = shapeHoles[ i ];
+				shapeVertices = shapeVertices.concat( shapeHole );
+
+			}
+
+			// vertices, normals, uvs
+
+			for ( let i = 0, l = shapeVertices.length; i < l; i ++ ) {
+
+				const vertex = shapeVertices[ i ];
+
+				vertices.push( vertex.x, vertex.y, 0 );
+				normals.push( 0, 0, 1 );
+				uvs.push( vertex.x, vertex.y ); // world uvs
+
+			}
+
+			// indices
+
+			for ( let i = 0, l = faces.length; i < l; i ++ ) {
+
+				const face = faces[ i ];
+
+				const a = face[ 0 ] + indexOffset;
+				const b = face[ 1 ] + indexOffset;
+				const c = face[ 2 ] + indexOffset;
+
+				indices.push( a, b, c );
+				groupCount += 3;
+
+			}
+
+		}
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		const shapes = this.parameters.shapes;
+
+		return toJSON( shapes, data );
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @param {Array<Shape>} shapes - An array of shapes.
+	 * @return {ShapeGeometry} A new instance.
+	 */
+	static fromJSON( data, shapes ) {
+
+		const geometryShapes = [];
+
+		for ( let j = 0, jl = data.shapes.length; j < jl; j ++ ) {
+
+			const shape = shapes[ data.shapes[ j ] ];
+
+			geometryShapes.push( shape );
+
+		}
+
+		return new ShapeGeometry( geometryShapes, data.curveSegments );
+
+	}
+
+}
+
+function toJSON( shapes, data ) {
+
+	data.shapes = [];
+
+	if ( Array.isArray( shapes ) ) {
+
+		for ( let i = 0, l = shapes.length; i < l; i ++ ) {
+
+			const shape = shapes[ i ];
+
+			data.shapes.push( shape.uuid );
+
+		}
+
+	} else {
+
+		data.shapes.push( shapes.uuid );
+
+	}
+
+	return data;
+
+}
+
+/**
+ * A class for generating a sphere geometry.
+ *
+ * ```js
+ * const geometry = new THREE.SphereGeometry( 15, 32, 16 );
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00 } );
+ * const sphere = new THREE.Mesh( geometry, material );
+ * scene.add( sphere );
+ * ```
+ *
+ * @augments BufferGeometry
+ * @demo scenes/geometry-browser.html#SphereGeometry
+ */
+class SphereGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new sphere geometry.
+	 *
+	 * @param {number} [radius=1] - The sphere radius.
+	 * @param {number} [widthSegments=32] - The number of horizontal segments. Minimum value is `3`.
+	 * @param {number} [heightSegments=16] - The number of vertical segments. Minimum value is `2`.
+	 * @param {number} [phiStart=0] - The horizontal starting angle in radians.
+	 * @param {number} [phiLength=Math.PI*2] - The horizontal sweep angle size.
+	 * @param {number} [thetaStart=0] - The vertical starting angle in radians.
+	 * @param {number} [thetaLength=Math.PI] - The vertical sweep angle size.
+	 */
+	constructor( radius = 1, widthSegments = 32, heightSegments = 16, phiStart = 0, phiLength = Math.PI * 2, thetaStart = 0, thetaLength = Math.PI ) {
+
+		super();
+
+		this.type = 'SphereGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			radius: radius,
+			widthSegments: widthSegments,
+			heightSegments: heightSegments,
+			phiStart: phiStart,
+			phiLength: phiLength,
+			thetaStart: thetaStart,
+			thetaLength: thetaLength
+		};
+
+		widthSegments = Math.max( 3, Math.floor( widthSegments ) );
+		heightSegments = Math.max( 2, Math.floor( heightSegments ) );
+
+		const thetaEnd = Math.min( thetaStart + thetaLength, Math.PI );
+
+		let index = 0;
+		const grid = [];
+
+		const vertex = new Vector3();
+		const normal = new Vector3();
+
+		// buffers
+
+		const indices = [];
+		const vertices = [];
+		const normals = [];
+		const uvs = [];
+
+		// generate vertices, normals and uvs
+
+		for ( let iy = 0; iy <= heightSegments; iy ++ ) {
+
+			const verticesRow = [];
+
+			const v = iy / heightSegments;
+			const theta = thetaStart + v * thetaLength;
+
+			const y = radius * Math.cos( theta );
+			const ringRadius = Math.sqrt( radius * radius - y * y );
+
+			// special case for the poles
+
+			let uOffset = 0;
+
+			if ( iy === 0 && thetaStart === 0 ) {
+
+				uOffset = 0.5 / widthSegments;
+
+			} else if ( iy === heightSegments && thetaEnd === Math.PI ) {
+
+				uOffset = -0.5 / widthSegments;
+
+			}
+
+			for ( let ix = 0; ix <= widthSegments; ix ++ ) {
+
+				const u = ix / widthSegments;
+				const phi = phiStart + u * phiLength;
+
+				// vertex
+
+				vertex.x = - ringRadius * Math.cos( phi );
+				vertex.y = y;
+				vertex.z = ringRadius * Math.sin( phi );
+
+				vertices.push( vertex.x, vertex.y, vertex.z );
+
+				// normal
+
+				normal.copy( vertex ).normalize();
+				normals.push( normal.x, normal.y, normal.z );
+
+				// uv
+
+				uvs.push( u + uOffset, 1 - v );
+
+				verticesRow.push( index ++ );
+
+			}
+
+			grid.push( verticesRow );
+
+		}
+
+		// indices
+
+		for ( let iy = 0; iy < heightSegments; iy ++ ) {
+
+			for ( let ix = 0; ix < widthSegments; ix ++ ) {
+
+				const a = grid[ iy ][ ix + 1 ];
+				const b = grid[ iy ][ ix ];
+				const c = grid[ iy + 1 ][ ix ];
+				const d = grid[ iy + 1 ][ ix + 1 ];
+
+				if ( iy !== 0 || thetaStart > 0 ) indices.push( a, b, d );
+				if ( iy !== heightSegments - 1 || thetaEnd < Math.PI ) indices.push( b, c, d );
+
+			}
+
+		}
+
+		// build geometry
+
+		this.setIndex( indices );
+		this.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		this.setAttribute( 'normal', new Float32BufferAttribute( normals, 3 ) );
+		this.setAttribute( 'uv', new Float32BufferAttribute( uvs, 2 ) );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {SphereGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new SphereGeometry( data.radius, data.widthSegments, data.heightSegments, data.phiStart, data.phiLength, data.thetaStart, data.thetaLength );
+
+	}
+
+}
+
+/**
+ * A geometry class for representing an tetrahedron.
+ *
+ * ```js
+ * const geometry = new THREE.TetrahedronGeometry();
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00 } );
+ * const tetrahedron = new THREE.Mesh( geometry, material );
+ * scene.add( tetrahedron );
+ * ```
+ *
+ * @augments PolyhedronGeometry
+ * @demo scenes/geometry-browser.html#TetrahedronGeometry
+ */
+class TetrahedronGeometry extends PolyhedronGeometry {
+
+	/**
+	 * Constructs a new tetrahedron geometry.
+	 *
+	 * @param {number} [radius=1] - Radius of the tetrahedron.
+	 * @param {number} [detail=0] - Setting this to a value greater than `0` adds vertices making it no longer a tetrahedron.
+	 */
+	constructor( radius = 1, detail = 0 ) {
+
+		const vertices = [
+			1, 1, 1, 	-1, -1, 1, 	-1, 1, -1, 	1, -1, -1
+		];
+
+		const indices = [
+			2, 1, 0, 	0, 3, 2,	1, 3, 0,	2, 3, 1
+		];
+
+		super( vertices, indices, radius, detail );
+
+		this.type = 'TetrahedronGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			radius: radius,
+			detail: detail
+		};
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {TetrahedronGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new TetrahedronGeometry( data.radius, data.detail );
+
+	}
+
+}
+
+/**
+ * A geometry class for representing an torus.
+ *
+ * ```js
+ * const geometry = new THREE.TorusGeometry( 10, 3, 16, 100 );
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00 } );
+ * const torus = new THREE.Mesh( geometry, material );
+ * scene.add( torus );
+ * ```
+ *
+ * @augments BufferGeometry
+ * @demo scenes/geometry-browser.html#TorusGeometry
+ */
+class TorusGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new torus geometry.
+	 *
+	 * @param {number} [radius=1] - Radius of the torus, from the center of the torus to the center of the tube.
+	 * @param {number} [tube=0.4] - Radius of the tube. Must be smaller than `radius`.
+	 * @param {number} [radialSegments=12] - The number of radial segments.
+	 * @param {number} [tubularSegments=48] - The number of tubular segments.
+	 * @param {number} [arc=Math.PI*2] - Central angle in radians.
+	 * @param {number} [thetaStart=0] - Start of the tubular sweep in radians.
+	 * @param {number} [thetaLength=Math.PI*2] - Length of the tubular sweep in radians.
+	 */
+	constructor( radius = 1, tube = 0.4, radialSegments = 12, tubularSegments = 48, arc = Math.PI * 2, thetaStart = 0, thetaLength = Math.PI * 2 ) {
+
+		super();
+
+		this.type = 'TorusGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			radius: radius,
+			tube: tube,
+			radialSegments: radialSegments,
+			tubularSegments: tubularSegments,
+			arc: arc,
+			thetaStart: thetaStart,
+			thetaLength: thetaLength,
+		};
+
+		radialSegments = Math.floor( radialSegments );
+		tubularSegments = Math.floor( tubularSegments );
+
+		// buffers
+
+		const indices = [];
+		const vertices = [];
+		const normals = [];
+		const uvs = [];
+
+		// helper variables
+
+		const center = new Vector3();
+		const vertex = new Vector3();
+		const normal = new Vector3();
+
+		// generate vertices, normals and uvs
+
+		for ( let j = 0; j <= radialSegments; j ++ ) {
+
+			const v = thetaStart + ( j / radialSegments ) * thetaLength;
+
+			for ( let i = 0; i <= tubularSegments; i ++ ) {
+
+				const u = i / tubularSegments * arc;
+
+				// vertex
+
+				vertex.x = ( radius + tube * Math.cos( v ) ) * Math.cos( u );
+				vertex.y = ( radius + tube * Math.cos( v ) ) * Math.sin( u );
+				vertex.z = tube * Math.sin( v );
+
+				vertices.push( vertex.x, vertex.y, vertex.z );
+
+				// normal
+
+				center.x = radius * Math.cos( u );
+				center.y = radius * Math.sin( u );
+				normal.subVectors( vertex, center ).normalize();
+
+				normals.push( normal.x, normal.y, normal.z );
+
+				// uv
+
+				uvs.push( i / tubularSegments );
+				uvs.push( j / radialSegments );
+
+			}
+
+		}
+
+		// generate indices
+
+		for ( let j = 1; j <= radialSegments; j ++ ) {
+
+			for ( let i = 1; i <= tubularSegments; i ++ ) {
+
+				// indices
+
+				const a = ( tubularSegments + 1 ) * j + i - 1;
+				const b = ( tubularSegments + 1 ) * ( j - 1 ) + i - 1;
+				const c = ( tubularSegments + 1 ) * ( j - 1 ) + i;
+				const d = ( tubularSegments + 1 ) * j + i;
+
+				// faces
+
+				indices.push( a, b, d );
+				indices.push( b, c, d );
+
+			}
+
+		}
+
+		// build geometry
+
+		this.setIndex( indices );
+		this.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		this.setAttribute( 'normal', new Float32BufferAttribute( normals, 3 ) );
+		this.setAttribute( 'uv', new Float32BufferAttribute( uvs, 2 ) );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {TorusGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new TorusGeometry( data.radius, data.tube, data.radialSegments, data.tubularSegments, data.arc, data.thetaStart, data.thetaLength );
+
+	}
+
+}
+
+/**
+ * Creates a torus knot, the particular shape of which is defined by a pair
+ * of coprime integers, p and q. If p and q are not coprime, the result will
+ * be a torus link.
+ *
+ * ```js
+ * const geometry = new THREE.TorusKnotGeometry( 10, 3, 100, 16 );
+ * const material = new THREE.MeshBasicMaterial( { color: 0xffff00 } );
+ * const torusKnot = new THREE.Mesh( geometry, material );
+ * scene.add( torusKnot );
+ * ```
+ *
+ * @augments BufferGeometry
+ * @demo scenes/geometry-browser.html#TorusKnotGeometry
+ */
+class TorusKnotGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new torus knot geometry.
+	 *
+	 * @param {number} [radius=1] - Radius of the torus knot.
+	 * @param {number} [tube=0.4] - Radius of the tube.
+	 * @param {number} [tubularSegments=64] - The number of tubular segments.
+	 * @param {number} [radialSegments=8] - The number of radial segments.
+	 * @param {number} [p=2] - This value determines, how many times the geometry winds around its axis of rotational symmetry.
+	 * @param {number} [q=3] - This value determines, how many times the geometry winds around a circle in the interior of the torus.
+	 */
+	constructor( radius = 1, tube = 0.4, tubularSegments = 64, radialSegments = 8, p = 2, q = 3 ) {
+
+		super();
+
+		this.type = 'TorusKnotGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			radius: radius,
+			tube: tube,
+			tubularSegments: tubularSegments,
+			radialSegments: radialSegments,
+			p: p,
+			q: q
+		};
+
+		tubularSegments = Math.floor( tubularSegments );
+		radialSegments = Math.floor( radialSegments );
+
+		// buffers
+
+		const indices = [];
+		const vertices = [];
+		const normals = [];
+		const uvs = [];
+
+		// helper variables
+
+		const vertex = new Vector3();
+		const normal = new Vector3();
+
+		const P1 = new Vector3();
+		const P2 = new Vector3();
+
+		const B = new Vector3();
+		const T = new Vector3();
+		const N = new Vector3();
+
+		// generate vertices, normals and uvs
+
+		for ( let i = 0; i <= tubularSegments; ++ i ) {
+
+			// the radian "u" is used to calculate the position on the torus curve of the current tubular segment
+
+			const u = i / tubularSegments * p * Math.PI * 2;
+
+			// now we calculate two points. P1 is our current position on the curve, P2 is a little farther ahead.
+			// these points are used to create a special "coordinate space", which is necessary to calculate the correct vertex positions
+
+			calculatePositionOnCurve( u, p, q, radius, P1 );
+			calculatePositionOnCurve( u + 0.01, p, q, radius, P2 );
+
+			// calculate orthonormal basis
+
+			T.subVectors( P2, P1 );
+			N.addVectors( P2, P1 );
+			B.crossVectors( T, N );
+			N.crossVectors( B, T );
+
+			// normalize B, N. T can be ignored, we don't use it
+
+			B.normalize();
+			N.normalize();
+
+			for ( let j = 0; j <= radialSegments; ++ j ) {
+
+				// now calculate the vertices. they are nothing more than an extrusion of the torus curve.
+				// because we extrude a shape in the xy-plane, there is no need to calculate a z-value.
+
+				const v = j / radialSegments * Math.PI * 2;
+				const cx = - tube * Math.cos( v );
+				const cy = tube * Math.sin( v );
+
+				// now calculate the final vertex position.
+				// first we orient the extrusion with our basis vectors, then we add it to the current position on the curve
+
+				vertex.x = P1.x + ( cx * N.x + cy * B.x );
+				vertex.y = P1.y + ( cx * N.y + cy * B.y );
+				vertex.z = P1.z + ( cx * N.z + cy * B.z );
+
+				vertices.push( vertex.x, vertex.y, vertex.z );
+
+				// normal (P1 is always the center/origin of the extrusion, thus we can use it to calculate the normal)
+
+				normal.subVectors( vertex, P1 ).normalize();
+
+				normals.push( normal.x, normal.y, normal.z );
+
+				// uv
+
+				uvs.push( i / tubularSegments );
+				uvs.push( j / radialSegments );
+
+			}
+
+		}
+
+		// generate indices
+
+		for ( let j = 1; j <= tubularSegments; j ++ ) {
+
+			for ( let i = 1; i <= radialSegments; i ++ ) {
+
+				// indices
+
+				const a = ( radialSegments + 1 ) * ( j - 1 ) + ( i - 1 );
+				const b = ( radialSegments + 1 ) * j + ( i - 1 );
+				const c = ( radialSegments + 1 ) * j + i;
+				const d = ( radialSegments + 1 ) * ( j - 1 ) + i;
+
+				// faces
+
+				indices.push( a, b, d );
+				indices.push( b, c, d );
+
+			}
+
+		}
+
+		// build geometry
+
+		this.setIndex( indices );
+		this.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		this.setAttribute( 'normal', new Float32BufferAttribute( normals, 3 ) );
+		this.setAttribute( 'uv', new Float32BufferAttribute( uvs, 2 ) );
+
+		// this function calculates the current position on the torus curve
+
+		function calculatePositionOnCurve( u, p, q, radius, position ) {
+
+			const cu = Math.cos( u );
+			const su = Math.sin( u );
+			const quOverP = q / p * u;
+			const cs = Math.cos( quOverP );
+
+			position.x = radius * ( 2 + cs ) * 0.5 * cu;
+			position.y = radius * ( 2 + cs ) * su * 0.5;
+			position.z = radius * Math.sin( quOverP ) * 0.5;
+
+		}
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {TorusKnotGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		return new TorusKnotGeometry( data.radius, data.tube, data.tubularSegments, data.radialSegments, data.p, data.q );
+
+	}
+
+}
+
+/**
+ * Creates a tube that extrudes along a 3D curve.
+ *
+ * ```js
+ * class CustomSinCurve extends THREE.Curve {
+ *
+ * 	getPoint( t, optionalTarget = new THREE.Vector3() ) {
+ *
+ * 		const tx = t * 3 - 1.5;
+ * 		const ty = Math.sin( 2 * Math.PI * t );
+ * 		const tz = 0;
+ *
+ * 		return optionalTarget.set( tx, ty, tz );
+ * 	}
+ *
+ * }
+ *
+ * const path = new CustomSinCurve( 10 );
+ * const geometry = new THREE.TubeGeometry( path, 20, 2, 8, false );
+ * const material = new THREE.MeshBasicMaterial( { color: 0x00ff00 } );
+ * const mesh = new THREE.Mesh( geometry, material );
+ * scene.add( mesh );
+ * ```
+ *
+ * @augments BufferGeometry
+ * @demo scenes/geometry-browser.html#TubeGeometry
+ */
+class TubeGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new tube geometry.
+	 *
+	 * @param {Curve} [path=QuadraticBezierCurve3] - A 3D curve defining the path of the tube.
+	 * @param {number} [tubularSegments=64] - The number of segments that make up the tube.
+	 * @param {number} [radius=1] -The radius of the tube.
+	 * @param {number} [radialSegments=8] - The number of segments that make up the cross-section.
+	 * @param {boolean} [closed=false] - Whether the tube is closed or not.
+	 */
+	constructor( path = new QuadraticBezierCurve3( new Vector3( -1, -1, 0 ), new Vector3( -1, 1, 0 ), new Vector3( 1, 1, 0 ) ), tubularSegments = 64, radius = 1, radialSegments = 8, closed = false ) {
+
+		super();
+
+		this.type = 'TubeGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			path: path,
+			tubularSegments: tubularSegments,
+			radius: radius,
+			radialSegments: radialSegments,
+			closed: closed
+		};
+
+		const frames = path.computeFrenetFrames( tubularSegments, closed );
+
+		// expose internals
+
+		this.tangents = frames.tangents;
+		this.normals = frames.normals;
+		this.binormals = frames.binormals;
+
+		// helper variables
+
+		const vertex = new Vector3();
+		const normal = new Vector3();
+		const uv = new Vector2();
+		let P = new Vector3();
+
+		// buffer
+
+		const vertices = [];
+		const normals = [];
+		const uvs = [];
+		const indices = [];
+
+		// create buffer data
+
+		generateBufferData();
+
+		// build geometry
+
+		this.setIndex( indices );
+		this.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		this.setAttribute( 'normal', new Float32BufferAttribute( normals, 3 ) );
+		this.setAttribute( 'uv', new Float32BufferAttribute( uvs, 2 ) );
+
+		// functions
+
+		function generateBufferData() {
+
+			for ( let i = 0; i < tubularSegments; i ++ ) {
+
+				generateSegment( i );
+
+			}
+
+			// if the geometry is not closed, generate the last row of vertices and normals
+			// at the regular position on the given path
+			//
+			// if the geometry is closed, duplicate the first row of vertices and normals (uvs will differ)
+
+			generateSegment( ( closed === false ) ? tubularSegments : 0 );
+
+			// uvs are generated in a separate function.
+			// this makes it easy compute correct values for closed geometries
+
+			generateUVs();
+
+			// finally create faces
+
+			generateIndices();
+
+		}
+
+		function generateSegment( i ) {
+
+			// we use getPointAt to sample evenly distributed points from the given path
+
+			P = path.getPointAt( i / tubularSegments, P );
+
+			// retrieve corresponding normal and binormal
+
+			const N = frames.normals[ i ];
+			const B = frames.binormals[ i ];
+
+			// generate normals and vertices for the current segment
+
+			for ( let j = 0; j <= radialSegments; j ++ ) {
+
+				const v = j / radialSegments * Math.PI * 2;
+
+				const sin = Math.sin( v );
+				const cos = - Math.cos( v );
+
+				// normal
+
+				normal.x = ( cos * N.x + sin * B.x );
+				normal.y = ( cos * N.y + sin * B.y );
+				normal.z = ( cos * N.z + sin * B.z );
+				normal.normalize();
+
+				normals.push( normal.x, normal.y, normal.z );
+
+				// vertex
+
+				vertex.x = P.x + radius * normal.x;
+				vertex.y = P.y + radius * normal.y;
+				vertex.z = P.z + radius * normal.z;
+
+				vertices.push( vertex.x, vertex.y, vertex.z );
+
+			}
+
+		}
+
+		function generateIndices() {
+
+			for ( let j = 1; j <= tubularSegments; j ++ ) {
+
+				for ( let i = 1; i <= radialSegments; i ++ ) {
+
+					const a = ( radialSegments + 1 ) * ( j - 1 ) + ( i - 1 );
+					const b = ( radialSegments + 1 ) * j + ( i - 1 );
+					const c = ( radialSegments + 1 ) * j + i;
+					const d = ( radialSegments + 1 ) * ( j - 1 ) + i;
+
+					// faces
+
+					indices.push( a, b, d );
+					indices.push( b, c, d );
+
+				}
+
+			}
+
+		}
+
+		function generateUVs() {
+
+			for ( let i = 0; i <= tubularSegments; i ++ ) {
+
+				for ( let j = 0; j <= radialSegments; j ++ ) {
+
+					uv.x = i / tubularSegments;
+					uv.y = j / radialSegments;
+
+					uvs.push( uv.x, uv.y );
+
+				}
+
+			}
+
+		}
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.path = this.parameters.path.toJSON();
+
+		return data;
+
+	}
+
+	/**
+	 * Factory method for creating an instance of this class from the given
+	 * JSON object.
+	 *
+	 * @param {Object} data - A JSON object representing the serialized geometry.
+	 * @return {TubeGeometry} A new instance.
+	 */
+	static fromJSON( data ) {
+
+		// This only works for built-in curves (e.g. CatmullRomCurve3).
+		// User defined curves or instances of CurvePath will not be deserialized.
+		return new TubeGeometry(
+			new Curves[ data.path.type ]().fromJSON( data.path ),
+			data.tubularSegments,
+			data.radius,
+			data.radialSegments,
+			data.closed
+		);
+
+	}
+
+}
+
+/**
+ * Can be used as a helper object to visualize a geometry as a wireframe.
+ *
+ * ```js
+ * const geometry = new THREE.SphereGeometry();
+ *
+ * const wireframe = new THREE.WireframeGeometry( geometry );
+ *
+ * const line = new THREE.LineSegments( wireframe );
+ * line.material.depthWrite = false;
+ * line.material.opacity = 0.25;
+ * line.material.transparent = true;
+ *
+ * scene.add( line );
+ * ```
+ *
+ * Note: It is not yet possible to serialize/deserialize instances of this class.
+ *
+ * @augments BufferGeometry
+ */
+class WireframeGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new wireframe geometry.
+	 *
+	 * @param {?BufferGeometry} [geometry=null] - The geometry.
+	 */
+	constructor( geometry = null ) {
+
+		super();
+
+		this.type = 'WireframeGeometry';
+
+		/**
+		 * Holds the constructor parameters that have been
+		 * used to generate the geometry. Any modification
+		 * after instantiation does not change the geometry.
+		 *
+		 * @type {Object}
+		 */
+		this.parameters = {
+			geometry: geometry
+		};
+
+		if ( geometry !== null ) {
+
+			// buffer
+
+			const vertices = [];
+			const edges = new Set();
+
+			// helper variables
+
+			const start = new Vector3();
+			const end = new Vector3();
+
+			if ( geometry.index !== null ) {
+
+				// indexed BufferGeometry
+
+				const position = geometry.attributes.position;
+				const indices = geometry.index;
+				let groups = geometry.groups;
+
+				if ( groups.length === 0 ) {
+
+					groups = [ { start: 0, count: indices.count, materialIndex: 0 } ];
+
+				}
+
+				// create a data structure that contains all edges without duplicates
+
+				for ( let o = 0, ol = groups.length; o < ol; ++ o ) {
+
+					const group = groups[ o ];
+
+					const groupStart = group.start;
+					const groupCount = group.count;
+
+					for ( let i = groupStart, l = ( groupStart + groupCount ); i < l; i += 3 ) {
+
+						for ( let j = 0; j < 3; j ++ ) {
+
+							const index1 = indices.getX( i + j );
+							const index2 = indices.getX( i + ( j + 1 ) % 3 );
+
+							start.fromBufferAttribute( position, index1 );
+							end.fromBufferAttribute( position, index2 );
+
+							if ( isUniqueEdge( start, end, edges ) === true ) {
+
+								vertices.push( start.x, start.y, start.z );
+								vertices.push( end.x, end.y, end.z );
+
+							}
+
+						}
+
+					}
+
+				}
+
+			} else {
+
+				// non-indexed BufferGeometry
+
+				const position = geometry.attributes.position;
+
+				for ( let i = 0, l = ( position.count / 3 ); i < l; i ++ ) {
+
+					for ( let j = 0; j < 3; j ++ ) {
+
+						// three edges per triangle, an edge is represented as (index1, index2)
+						// e.g. the first triangle has the following edges: (0,1),(1,2),(2,0)
+
+						const index1 = 3 * i + j;
+						const index2 = 3 * i + ( ( j + 1 ) % 3 );
+
+						start.fromBufferAttribute( position, index1 );
+						end.fromBufferAttribute( position, index2 );
+
+						if ( isUniqueEdge( start, end, edges ) === true ) {
+
+							vertices.push( start.x, start.y, start.z );
+							vertices.push( end.x, end.y, end.z );
+
+						}
+
+					}
+
+				}
+
+			}
+
+			// build geometry
+
+			this.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+
+		}
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.parameters = Object.assign( {}, source.parameters );
+
+		return this;
+
+	}
+
+}
+
+function isUniqueEdge( start, end, edges ) {
+
+	const hash1 = `${start.x},${start.y},${start.z}-${end.x},${end.y},${end.z}`;
+	const hash2 = `${end.x},${end.y},${end.z}-${start.x},${start.y},${start.z}`; // coincident edge
+
+	if ( edges.has( hash1 ) === true || edges.has( hash2 ) === true ) {
+
+		return false;
+
+	} else {
+
+		edges.add( hash1 );
+		edges.add( hash2 );
+		return true;
+
+	}
+
+}
+
+var Geometries = /*#__PURE__*/Object.freeze({
+	__proto__: null,
+	BoxGeometry: BoxGeometry,
+	CapsuleGeometry: CapsuleGeometry,
+	CircleGeometry: CircleGeometry,
+	ConeGeometry: ConeGeometry,
+	CylinderGeometry: CylinderGeometry,
+	DodecahedronGeometry: DodecahedronGeometry,
+	EdgesGeometry: EdgesGeometry,
+	ExtrudeGeometry: ExtrudeGeometry,
+	IcosahedronGeometry: IcosahedronGeometry,
+	LatheGeometry: LatheGeometry,
+	OctahedronGeometry: OctahedronGeometry,
+	PlaneGeometry: PlaneGeometry,
+	PolyhedronGeometry: PolyhedronGeometry,
+	RingGeometry: RingGeometry,
+	ShapeGeometry: ShapeGeometry,
+	SphereGeometry: SphereGeometry,
+	TetrahedronGeometry: TetrahedronGeometry,
+	TorusGeometry: TorusGeometry,
+	TorusKnotGeometry: TorusKnotGeometry,
+	TubeGeometry: TubeGeometry,
+	WireframeGeometry: WireframeGeometry
+});
+
+/**
+ * This material can receive shadows, but otherwise is completely transparent.
+ *
+ * ```js
+ * const geometry = new THREE.PlaneGeometry( 2000, 2000 );
+ * geometry.rotateX( - Math.PI / 2 );
+ *
+ * const material = new THREE.ShadowMaterial();
+ * material.opacity = 0.2;
+ *
+ * const plane = new THREE.Mesh( geometry, material );
+ * plane.position.y = -200;
+ * plane.receiveShadow = true;
+ * scene.add( plane );
+ * ```
+ *
+ * @augments Material
+ */
+class ShadowMaterial extends Material {
+
+	/**
+	 * Constructs a new shadow material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isShadowMaterial = true;
+
+		this.type = 'ShadowMaterial';
+
+		/**
+		 * Color of the material.
+		 *
+		 * @type {Color}
+		 * @default (0,0,0)
+		 */
+		this.color = new Color( 0x000000 );
+
+		/**
+		 * Overwritten since shadow materials are transparent
+		 * by default.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.transparent = true;
+
+		/**
+		 * Whether the material is affected by fog or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.fog = true;
+
+		this.setValues( parameters );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.color.copy( source.color );
+
+		this.fog = source.fog;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * Provides utility functions for managing uniforms.
+ *
+ * @module UniformsUtils
+ */
+
+/**
+ * Clones the given uniform definitions by performing a deep-copy. That means
+ * if the value of a uniform refers to an object like a Vector3 or Texture,
+ * the cloned uniform will refer to a new object reference.
+ *
+ * @param {Object} src - An object representing uniform definitions.
+ * @return {Object} The cloned uniforms.
+ */
+function cloneUniforms( src ) {
+
+	const dst = {};
+
+	for ( const u in src ) {
+
+		dst[ u ] = {};
+
+		for ( const p in src[ u ] ) {
+
+			const property = src[ u ][ p ];
+
+			if ( isThreeObject( property ) ) {
+
+				if ( property.isRenderTargetTexture ) {
+
+					warn( 'UniformsUtils: Textures of render targets cannot be cloned via cloneUniforms() or mergeUniforms().' );
+					dst[ u ][ p ] = null;
+
+				} else {
+
+					dst[ u ][ p ] = property.clone();
+
+				}
+
+			} else if ( Array.isArray( property ) ) {
+
+				if ( isThreeObject( property[ 0 ] ) ) {
+
+					const clonedProperty = [];
+
+					for ( let i = 0, l = property.length; i < l; i ++ ) {
+
+						clonedProperty[ i ] = property[ i ].clone();
+
+					}
+
+					dst[ u ][ p ] = clonedProperty;
+
+				} else {
+
+					dst[ u ][ p ] = property.slice();
+
+				}
+
+			} else {
+
+				dst[ u ][ p ] = property;
+
+			}
+
+		}
+
+	}
+
+	return dst;
+
+}
+
+/**
+ * Merges the given uniform definitions into a single object. Since the
+ * method internally uses cloneUniforms(), it performs a deep-copy when
+ * producing the merged uniform definitions.
+ *
+ * @param {Array} uniforms - An array of objects containing uniform definitions.
+ * @return {Object} The merged uniforms.
+ */
+function mergeUniforms( uniforms ) {
+
+	const merged = {};
+
+	for ( let u = 0; u < uniforms.length; u ++ ) {
+
+		const tmp = cloneUniforms( uniforms[ u ] );
+
+		for ( const p in tmp ) {
+
+			merged[ p ] = tmp[ p ];
+
+		}
+
+	}
+
+	return merged;
+
+}
+
+function isThreeObject( property ) {
+
+	return ( property && ( property.isColor ||
+		property.isMatrix3 || property.isMatrix4 ||
+		property.isVector2 || property.isVector3 || property.isVector4 ||
+		property.isTexture || property.isQuaternion ) );
+
+}
+
+function cloneUniformsGroups( src ) {
+
+	const dst = [];
+
+	for ( let u = 0; u < src.length; u ++ ) {
+
+		dst.push( src[ u ].clone() );
+
+	}
+
+	return dst;
+
+}
+
+function getUnlitUniformColorSpace( renderer ) {
+
+	const currentRenderTarget = renderer.getRenderTarget();
+
+	if ( currentRenderTarget === null ) {
+
+		// https://github.com/mrdoob/three.js/pull/23937#issuecomment-1111067398
+		return renderer.outputColorSpace;
+
+	}
+
+	// https://github.com/mrdoob/three.js/issues/27868
+	if ( currentRenderTarget.isXRRenderTarget === true ) {
+
+		return currentRenderTarget.texture.colorSpace;
+
+	}
+
+	return ColorManagement.workingColorSpace;
+
+}
+
+// Legacy
+
+const UniformsUtils = { clone: cloneUniforms, merge: mergeUniforms };
+
+var default_vertex = "void main() {\n\tgl_Position = projectionMatrix * modelViewMatrix * vec4( position, 1.0 );\n}";
+
+var default_fragment = "void main() {\n\tgl_FragColor = vec4( 1.0, 0.0, 0.0, 1.0 );\n}";
+
+/**
+ * A material rendered with custom shaders. A shader is a small program written in GLSL.
+ * that runs on the GPU. You may want to use a custom shader if you need to implement an
+ * effect not included with any of the built-in materials.
+ *
+ * There are the following notes to bear in mind when using a `ShaderMaterial`:
+ *
+ * - `ShaderMaterial` can only be used with {@link WebGLRenderer}.
+ * - Built in attributes and uniforms are passed to the shaders along with your code. If
+ * you don't want that, use {@link RawShaderMaterial} instead.
+ * - You can use the directive `#pragma unroll_loop_start` and `#pragma unroll_loop_end`
+ * in order to unroll a `for` loop in GLSL by the shader preprocessor. The directive has
+ * to be placed right above the loop. The loop formatting has to correspond to a defined standard.
+ *   - The loop has to be [normalized](https://en.wikipedia.org/wiki/Normalized_loop).
+ *   - The loop variable has to be *i*.
+ *   - The value `UNROLLED_LOOP_INDEX` will be replaced with the explicitly
+ * value of *i* for the given iteration and can be used in preprocessor
+ * statements.
+ *
+ * ```js
+ * const material = new THREE.ShaderMaterial( {
+ * 	uniforms: {
+ * 		time: { value: 1.0 },
+ * 		resolution: { value: new THREE.Vector2() }
+ * 	},
+ * 	vertexShader: document.getElementById( 'vertexShader' ).textContent,
+ * 	fragmentShader: document.getElementById( 'fragmentShader' ).textContent
+ * } );
+ * ```
+ *
+ * @augments Material
+ */
+class ShaderMaterial extends Material {
+
+	/**
+	 * Constructs a new shader material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isShaderMaterial = true;
+
+		this.type = 'ShaderMaterial';
+
+		/**
+		 * Defines custom constants using `#define` directives within the GLSL code
+		 * for both the vertex shader and the fragment shader; each key/value pair
+		 * yields another directive.
+		 * ```js
+		 * defines: {
+		 * 	FOO: 15,
+		 * 	BAR: true
+		 * }
+		 * ```
+		 * Yields the lines:
+		 * ```
+		 * #define FOO 15
+		 * #define BAR true
+		 * ```
+		 *
+		 * @type {Object}
+		 */
+		this.defines = {};
+
+		/**
+		 * An object of the form:
+		 * ```js
+		 * {
+		 * 	"uniform1": { value: 1.0 },
+		 * 	"uniform2": { value: 2 }
+		 * }
+		 * ```
+		 * specifying the uniforms to be passed to the shader code; keys are uniform
+		 * names, values are definitions of the form
+		 * ```
+		 * {
+		 * 	value: 1.0
+		 * }
+		 * ```
+		 * where `value` is the value of the uniform. Names must match the name of
+		 * the uniform, as defined in the GLSL code. Note that uniforms are refreshed
+		 * on every frame, so updating the value of the uniform will immediately
+		 * update the value available to the GLSL code.
+		 *
+		 * @type {Object}
+		 */
+		this.uniforms = {};
+
+		/**
+		 * An array holding uniforms groups for configuring UBOs.
+		 *
+		 * @type {Array<UniformsGroup>}
+		 */
+		this.uniformsGroups = [];
+
+		/**
+		 * Vertex shader GLSL code. This is the actual code for the shader.
+		 *
+		 * @type {string}
+		 */
+		this.vertexShader = default_vertex;
+
+		/**
+		 * Fragment shader GLSL code. This is the actual code for the shader.
+		 *
+		 * @type {string}
+		 */
+		this.fragmentShader = default_fragment;
+
+		/**
+		 * Controls line thickness or lines.
+		 *
+		 * WebGL and WebGPU ignore this setting and always render line primitives with a
+		 * width of one pixel.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.linewidth = 1;
+
+		/**
+		 * Renders the geometry as a wireframe.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.wireframe = false;
+
+		/**
+		 * Controls the thickness of the wireframe.
+		 *
+		 * WebGL and WebGPU ignore this property and always render
+		 * 1 pixel wide lines.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.wireframeLinewidth = 1;
+
+		/**
+		 * Defines whether the material color is affected by global fog settings; `true`
+		 * to pass fog uniforms to the shader.
+		 *
+		 * Setting this property to `true` requires the definition of fog uniforms. It is
+		 * recommended to use `UniformsUtils.merge()` to combine the custom shader uniforms
+		 * with predefined fog uniforms.
+		 *
+		 * ```js
+		 * const material = new ShaderMaterial( {
+		 *     uniforms: UniformsUtils.merge( [ UniformsLib[ 'fog' ], shaderUniforms ] );
+		 *     vertexShader: vertexShader,
+		 *     fragmentShader: fragmentShader,
+		 *     fog: true
+		 * } );
+		 * ```
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.fog = false;
+
+		/**
+		 * Defines whether this material uses lighting; `true` to pass uniform data
+		 * related to lighting to this shader.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.lights = false;
+
+		/**
+		 * Defines whether this material supports clipping; `true` to let the renderer
+		 * pass the clippingPlanes uniform.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.clipping = false;
+
+		/**
+		 * Overwritten and set to `true` by default.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.forceSinglePass = true;
+
+		/**
+		 * This object allows to enable certain WebGL 2 extensions.
+		 *
+		 * - clipCullDistance: set to `true` to use vertex shader clipping
+		 * - multiDraw: set to `true` to use vertex shader multi_draw / enable gl_DrawID
+		 *
+		 * @type {{clipCullDistance:false,multiDraw:false}}
+		 */
+		this.extensions = {
+			clipCullDistance: false, // set to use vertex shader clipping
+			multiDraw: false // set to use vertex shader multi_draw / enable gl_DrawID
+		};
+
+		/**
+		 * When the rendered geometry doesn't include these attributes but the
+		 * material does, these default values will be passed to the shaders. This
+		 * avoids errors when buffer data is missing.
+		 *
+		 * - color: [ 1, 1, 1 ]
+		 * - uv: [ 0, 0 ]
+		 * - uv1: [ 0, 0 ]
+		 *
+		 * @type {Object}
+		 */
+		this.defaultAttributeValues = {
+			'color': [ 1, 1, 1 ],
+			'uv': [ 0, 0 ],
+			'uv1': [ 0, 0 ]
+		};
+
+		/**
+		 * If set, this calls [gl.bindAttribLocation](https://developer.mozilla.org/en-US/docs/Web/API/WebGLRenderingContext/bindAttribLocation)
+		 * to bind a generic vertex index to an attribute variable.
+		 *
+		 * @type {string|undefined}
+		 * @default undefined
+		 */
+		this.index0AttributeName = undefined;
+
+		/**
+		 * Can be used to force a uniform update while changing uniforms in
+		 * {@link Object3D#onBeforeRender}.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.uniformsNeedUpdate = false;
+
+		/**
+		 * Defines the GLSL version of custom shader code.
+		 *
+		 * @type {?(GLSL1|GLSL3)}
+		 * @default null
+		 */
+		this.glslVersion = null;
+
+		if ( parameters !== undefined ) {
+
+			this.setValues( parameters );
+
+		}
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.fragmentShader = source.fragmentShader;
+		this.vertexShader = source.vertexShader;
+
+		this.uniforms = cloneUniforms( source.uniforms );
+		this.uniformsGroups = cloneUniformsGroups( source.uniformsGroups );
+
+		this.defines = Object.assign( {}, source.defines );
+
+		this.wireframe = source.wireframe;
+		this.wireframeLinewidth = source.wireframeLinewidth;
+
+		this.fog = source.fog;
+		this.lights = source.lights;
+		this.clipping = source.clipping;
+
+		this.extensions = Object.assign( {}, source.extensions );
+
+		this.glslVersion = source.glslVersion;
+
+		this.defaultAttributeValues = Object.assign( {}, source.defaultAttributeValues );
+
+		this.index0AttributeName = source.index0AttributeName;
+
+		this.uniformsNeedUpdate = source.uniformsNeedUpdate;
+
+		return this;
+
+	}
+
+	toJSON( meta ) {
+
+		const data = super.toJSON( meta );
+
+		data.glslVersion = this.glslVersion;
+		data.uniforms = {};
+
+		for ( const name in this.uniforms ) {
+
+			const uniform = this.uniforms[ name ];
+			const value = uniform.value;
+
+			if ( value && value.isTexture ) {
+
+				data.uniforms[ name ] = {
+					type: 't',
+					value: value.toJSON( meta ).uuid
+				};
+
+			} else if ( value && value.isColor ) {
+
+				data.uniforms[ name ] = {
+					type: 'c',
+					value: value.getHex()
+				};
+
+			} else if ( value && value.isVector2 ) {
+
+				data.uniforms[ name ] = {
+					type: 'v2',
+					value: value.toArray()
+				};
+
+			} else if ( value && value.isVector3 ) {
+
+				data.uniforms[ name ] = {
+					type: 'v3',
+					value: value.toArray()
+				};
+
+			} else if ( value && value.isVector4 ) {
+
+				data.uniforms[ name ] = {
+					type: 'v4',
+					value: value.toArray()
+				};
+
+			} else if ( value && value.isMatrix3 ) {
+
+				data.uniforms[ name ] = {
+					type: 'm3',
+					value: value.toArray()
+				};
+
+			} else if ( value && value.isMatrix4 ) {
+
+				data.uniforms[ name ] = {
+					type: 'm4',
+					value: value.toArray()
+				};
+
+			} else {
+
+				data.uniforms[ name ] = {
+					value: value
+				};
+
+				// note: the array variants v2v, v3v, v4v, m4v and tv are not supported so far
+
+			}
+
+		}
+
+		if ( Object.keys( this.defines ).length > 0 ) data.defines = this.defines;
+
+		data.vertexShader = this.vertexShader;
+		data.fragmentShader = this.fragmentShader;
+
+		data.lights = this.lights;
+		data.clipping = this.clipping;
+
+		const extensions = {};
+
+		for ( const key in this.extensions ) {
+
+			if ( this.extensions[ key ] === true ) extensions[ key ] = true;
+
+		}
+
+		if ( Object.keys( extensions ).length > 0 ) data.extensions = extensions;
+
+		return data;
+
+	}
+
+	/**
+	 * Deserializes the material from the given JSON.
+	 *
+	 * @param {Object} json - The JSON holding the serialized material.
+	 * @param {Object<string,Texture>} textures - A dictionary holding textures referenced by the material.
+	 * @return {ShaderMaterial} A reference to this material.
+	 */
+	fromJSON( json, textures ) {
+
+		super.fromJSON( json, textures );
+
+		if ( json.uniforms !== undefined ) {
+
+			for ( const name in json.uniforms ) {
+
+				const uniform = json.uniforms[ name ];
+
+				this.uniforms[ name ] = {};
+
+				switch ( uniform.type ) {
+
+					case 't':
+						this.uniforms[ name ].value = textures[ uniform.value ] || null;
+						break;
+
+					case 'c':
+						this.uniforms[ name ].value = new Color().setHex( uniform.value );
+						break;
+
+					case 'v2':
+						this.uniforms[ name ].value = new Vector2().fromArray( uniform.value );
+						break;
+
+					case 'v3':
+						this.uniforms[ name ].value = new Vector3().fromArray( uniform.value );
+						break;
+
+					case 'v4':
+						this.uniforms[ name ].value = new Vector4().fromArray( uniform.value );
+						break;
+
+					case 'm3':
+						this.uniforms[ name ].value = new Matrix3().fromArray( uniform.value );
+						break;
+
+					case 'm4':
+						this.uniforms[ name ].value = new Matrix4().fromArray( uniform.value );
+						break;
+
+					default:
+						this.uniforms[ name ].value = uniform.value;
+
+				}
+
+			}
+
+		}
+
+		if ( json.defines !== undefined ) this.defines = json.defines;
+		if ( json.vertexShader !== undefined ) this.vertexShader = json.vertexShader;
+		if ( json.fragmentShader !== undefined ) this.fragmentShader = json.fragmentShader;
+		if ( json.glslVersion !== undefined ) this.glslVersion = json.glslVersion;
+
+		if ( json.extensions !== undefined ) {
+
+			for ( const key in json.extensions ) {
+
+				this.extensions[ key ] = json.extensions[ key ];
+
+			}
+
+		}
+
+		if ( json.lights !== undefined ) this.lights = json.lights;
+		if ( json.clipping !== undefined ) this.clipping = json.clipping;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * This class works just like {@link ShaderMaterial}, except that definitions
+ * of built-in uniforms and attributes are not automatically prepended to the
+ * GLSL shader code.
+ *
+ * `RawShaderMaterial` can only be used with {@link WebGLRenderer}.
+ *
+ * @augments ShaderMaterial
+ */
+class RawShaderMaterial extends ShaderMaterial {
+
+	/**
+	 * Constructs a new raw shader material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super( parameters );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isRawShaderMaterial = true;
+
+		this.type = 'RawShaderMaterial';
+
+	}
+
+}
+
+/**
+ * A standard physically based material, using Metallic-Roughness workflow.
+ *
+ * Physically based rendering (PBR) has recently become the standard in many
+ * 3D applications, such as [Unity](https://blogs.unity3d.com/2014/10/29/physically-based-shading-in-unity-5-a-primer/),
+ * [Unreal](https://docs.unrealengine.com/latest/INT/Engine/Rendering/Materials/PhysicallyBased/) and
+ * [3D Studio Max](http://area.autodesk.com/blogs/the-3ds-max-blog/what039s-new-for-rendering-in-3ds-max-2017).
+ *
+ * This approach differs from older approaches in that instead of using
+ * approximations for the way in which light interacts with a surface, a
+ * physically correct model is used. The idea is that, instead of tweaking
+ * materials to look good under specific lighting, a material can be created
+ * that will react 'correctly' under all lighting scenarios.
+ *
+ * In practice this gives a more accurate and realistic looking result than
+ * the {@link MeshLambertMaterial} or {@link MeshPhongMaterial}, at the cost of
+ * being somewhat more computationally expensive. `MeshStandardMaterial` uses per-fragment
+ * shading.
+ *
+ * Note that for best results you should always specify an environment map when using this material.
+ *
+ * For a non-technical introduction to the concept of PBR and how to set up a
+ * PBR material, check out these articles by the people at [marmoset](https://www.marmoset.co):
+ *
+ * - [Basic Theory of Physically Based Rendering](https://www.marmoset.co/posts/basic-theory-of-physically-based-rendering/)
+ * - [Physically Based Rendering and You Can Too](https://www.marmoset.co/posts/physically-based-rendering-and-you-can-too/)
+ *
+ * Technical details of the approach used in three.js (and most other PBR systems) can be found is this
+ * [paper from Disney](https://media.disneyanimation.com/uploads/production/publication_asset/48/asset/s2012_pbs_disney_brdf_notes_v3.pdf)
+ * (pdf), by Brent Burley.
+ *
+ * @augments Material
+ * @demo scenes/material-browser.html#MeshStandardMaterial
+ */
+class MeshStandardMaterial extends Material {
+
+	/**
+	 * Constructs a new mesh standard material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isMeshStandardMaterial = true;
+
+		this.type = 'MeshStandardMaterial';
+
+		this.defines = { 'STANDARD': '' };
+
+		/**
+		 * Color of the material.
+		 *
+		 * @type {Color}
+		 * @default (1,1,1)
+		 */
+		this.color = new Color( 0xffffff ); // diffuse
+
+		/**
+		 * How rough the material appears. `0.0` means a smooth mirror reflection, `1.0`
+		 * means fully diffuse. If `roughnessMap` is also provided,
+		 * both values are multiplied.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.roughness = 1.0;
+
+		/**
+		 * How much the material is like a metal. Non-metallic materials such as wood
+		 * or stone use `0.0`, metallic use `1.0`, with nothing (usually) in between.
+		 * A value between `0.0` and `1.0` could be used for a rusty metal look.
+		 * If `metalnessMap` is also provided, both values are multiplied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.metalness = 0.0;
+
+		/**
+		 * The color map. May optionally include an alpha channel, typically combined
+		 * with {@link Material#transparent} or {@link Material#alphaTest}. The texture map
+		 * color is modulated by the diffuse `color`.
+		 *
+		 * `map` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `map` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.map = null;
+
+		/**
+		 * The light map. Requires a second set of UVs.
+		 *
+		 * `lightMap` represents pre-baked illuminance data, and the texture must be assigned
+		 * a {@link Texture#colorSpace}. Most `lightMap` textures set
+		 * `texture.colorSpace = LinearSRGBColorSpace` and use float-type formats
+		 * such as `.exr` or `.hdr`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.lightMap = null;
+
+		/**
+		 * Intensity of the baked light.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.lightMapIntensity = 1.0;
+
+		/**
+		 * The red channel of this texture is used as the ambient occlusion map.
+		 * Requires a second set of UVs.
+		 *
+		 * `aoMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.aoMap = null;
+
+		/**
+		 * Intensity of the ambient occlusion effect. Range is `[0,1]`, where `0`
+		 * disables ambient occlusion. Where intensity is `1` and the AO map's
+		 * red channel is also `1`, ambient light is fully occluded on a surface.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.aoMapIntensity = 1.0;
+
+		/**
+		 * Emissive (light) color of the material, essentially a solid color
+		 * unaffected by other lighting.
+		 *
+		 * @type {Color}
+		 * @default (0,0,0)
+		 */
+		this.emissive = new Color( 0x000000 );
+
+		/**
+		 * Intensity of the emissive light. Modulates the emissive color.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.emissiveIntensity = 1.0;
+
+		/**
+		 * Set emissive (glow) map. The emissive map color is modulated by the
+		 * emissive color and the emissive intensity. If you have an emissive map,
+		 * be sure to set the emissive color to something other than black.
+		 *
+		 * `emissiveMap` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `emissiveMap` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.emissiveMap = null;
+
+		/**
+		 * The texture to create a bump map. The black and white values map to the
+		 * perceived depth in relation to the lights. Bump doesn't actually affect
+		 * the geometry of the object, only the lighting. If a normal map is defined
+		 * this will be ignored.
+		 *
+		 * `bumpMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.bumpMap = null;
+
+		/**
+		 * How much the bump map affects the material. Typical range is `[0,1]`.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.bumpScale = 1;
+
+		/**
+		 * The texture to create a normal map. The RGB values affect the surface
+		 * normal for each pixel fragment and change the way the color is lit. Normal
+		 * maps do not change the actual shape of the surface, only the lighting. In
+		 * case the material has a normal map authored using the left handed
+		 * convention, the `y` component of `normalScale` should be negated to compensate
+		 * for the different handedness.
+		 *
+		 * `normalMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.normalMap = null;
+
+		/**
+		 * The type of normal map.
+		 *
+		 * @type {(TangentSpaceNormalMap|ObjectSpaceNormalMap)}
+		 * @default TangentSpaceNormalMap
+		 */
+		this.normalMapType = TangentSpaceNormalMap;
+
+		/**
+		 * How much the normal map affects the material. Typical value range is `[0,1]`.
+		 *
+		 * @type {Vector2}
+		 * @default (1,1)
+		 */
+		this.normalScale = new Vector2( 1, 1 );
+
+		/**
+		 * The displacement map affects the position of the mesh's vertices. Unlike
+		 * other maps which only affect the light and shade of the material the
+		 * displaced vertices can cast shadows, block other objects, and otherwise
+		 * act as real geometry. The displacement texture is an image where the value
+		 * of each pixel (white being the highest) is mapped against, and
+		 * repositions, the vertices of the mesh. For best results, pair a
+		 * displacement map with a matching normal map, since the renderer can
+		 * not recompute surface normals from the displaced vertices.
+		 *
+		 * `displacementMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.displacementMap = null;
+
+		/**
+		 * How much the displacement map affects the mesh (where black is no
+		 * displacement, and white is maximum displacement). Without a displacement
+		 * map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementScale = 1;
+
+		/**
+		 * The offset of the displacement map's values on the mesh's vertices.
+		 * The bias is added to the scaled sample of the displacement map.
+		 * Without a displacement map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementBias = 0;
+
+		/**
+		 * The green channel of this texture is used to alter the roughness of the
+		 * material.
+		 *
+		 * `roughnessMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.roughnessMap = null;
+
+		/**
+		 * The blue channel of this texture is used to alter the metalness of the
+		 * material.
+		 *
+		 * `metalnessMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.metalnessMap = null;
+
+		/**
+		 * The alpha map is a grayscale texture that controls the opacity across the
+		 * surface (black: fully transparent; white: fully opaque).
+		 *
+		 * Only the color of the texture is used, ignoring the alpha channel if one
+		 * exists. For RGB and RGBA textures, the renderer will use the green channel
+		 * when sampling this texture due to the extra bit of precision provided for
+		 * green in DXT-compressed and uncompressed RGB 565 formats. Luminance-only and
+		 * luminance/alpha textures will also still work as expected.
+		 *
+		 * `alphaMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.alphaMap = null;
+
+		/**
+		 * The environment map. To ensure a physically correct rendering, environment maps
+		 * are internally pre-processed with {@link PMREMGenerator}.
+		 *
+		 * `envMap` represents luminance data, and the texture must be assigned
+		 * a {@link Texture#colorSpace}. Most `envMap` textures set
+		 * `texture.colorSpace = LinearSRGBColorSpace` and use float-type formats
+		 * such as `.exr` or `.hdr`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.envMap = null;
+
+		/**
+		 * The rotation of the environment map in radians.
+		 *
+		 * @type {Euler}
+		 * @default (0,0,0)
+		 */
+		this.envMapRotation = new Euler();
+
+		/**
+		 * Scales the effect of the environment map by multiplying its color.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.envMapIntensity = 1.0;
+
+		/**
+		 * Renders the geometry as a wireframe.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.wireframe = false;
+
+		/**
+		 * Controls the thickness of the wireframe.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.wireframeLinewidth = 1;
+
+		/**
+		 * Defines appearance of wireframe ends.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {('round'|'bevel'|'miter')}
+		 * @default 'round'
+		 */
+		this.wireframeLinecap = 'round';
+
+		/**
+		 * Defines appearance of wireframe joints.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {('round'|'bevel'|'miter')}
+		 * @default 'round'
+		 */
+		this.wireframeLinejoin = 'round';
+
+		/**
+		 * Whether the material is rendered with flat shading or not.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.flatShading = false;
+
+		/**
+		 * Whether the material is affected by fog or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.fog = true;
+
+		this.setValues( parameters );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.defines = { 'STANDARD': '' };
+
+		this.color.copy( source.color );
+		this.roughness = source.roughness;
+		this.metalness = source.metalness;
+
+		this.map = source.map;
+
+		this.lightMap = source.lightMap;
+		this.lightMapIntensity = source.lightMapIntensity;
+
+		this.aoMap = source.aoMap;
+		this.aoMapIntensity = source.aoMapIntensity;
+
+		this.emissive.copy( source.emissive );
+		this.emissiveMap = source.emissiveMap;
+		this.emissiveIntensity = source.emissiveIntensity;
+
+		this.bumpMap = source.bumpMap;
+		this.bumpScale = source.bumpScale;
+
+		this.normalMap = source.normalMap;
+		this.normalMapType = source.normalMapType;
+		this.normalScale.copy( source.normalScale );
+
+		this.displacementMap = source.displacementMap;
+		this.displacementScale = source.displacementScale;
+		this.displacementBias = source.displacementBias;
+
+		this.roughnessMap = source.roughnessMap;
+
+		this.metalnessMap = source.metalnessMap;
+
+		this.alphaMap = source.alphaMap;
+
+		this.envMap = source.envMap;
+		this.envMapRotation.copy( source.envMapRotation );
+		this.envMapIntensity = source.envMapIntensity;
+
+		this.wireframe = source.wireframe;
+		this.wireframeLinewidth = source.wireframeLinewidth;
+		this.wireframeLinecap = source.wireframeLinecap;
+		this.wireframeLinejoin = source.wireframeLinejoin;
+
+		this.flatShading = source.flatShading;
+
+		this.fog = source.fog;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * An extension of the {@link MeshStandardMaterial}, providing more advanced
+ * physically-based rendering properties:
+ *
+ * - Anisotropy: Ability to represent the anisotropic property of materials
+ * as observable with brushed metals.
+ * - Clearcoat: Some materials — like car paints, carbon fiber, and wet surfaces — require
+ * a clear, reflective layer on top of another layer that may be irregular or rough.
+ * Clearcoat approximates this effect, without the need for a separate transparent surface.
+ * - Iridescence: Allows to render the effect where hue varies  depending on the viewing
+ * angle and illumination angle. This can be seen on soap bubbles, oil films, or on the
+ * wings of many insects.
+ * - Physically-based transparency: One limitation of {@link Material#opacity} is that highly
+ * transparent materials are less reflective. Physically-based transmission provides a more
+ * realistic option for thin, transparent surfaces like glass.
+ * - Advanced reflectivity: More flexible reflectivity for non-metallic materials.
+ * - Retroreflection: Redirects specular light back toward the light source for
+ * safety materials like road markings and reflective tape.
+ * - Sheen: Can be used for representing cloth and fabric materials.
+ *
+ * As a result of these complex shading features, `MeshPhysicalMaterial` has a
+ * higher performance cost, per pixel, than other three.js materials. Most
+ * effects are disabled by default, and add cost as they are enabled. For
+ * best results, always specify an environment map when using this material.
+ *
+ * @augments MeshStandardMaterial
+ * @demo scenes/material-browser.html#MeshPhysicalMaterial
+ */
+class MeshPhysicalMaterial extends MeshStandardMaterial {
+
+	/**
+	 * Constructs a new mesh physical material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isMeshPhysicalMaterial = true;
+
+		this.defines = {
+
+			'STANDARD': '',
+			'PHYSICAL': ''
+
+		};
+
+		this.type = 'MeshPhysicalMaterial';
+
+		/**
+		 * The rotation of the anisotropy in tangent, bitangent space, measured in radians
+		 * counter-clockwise from the tangent. When `anisotropyMap` is present, this
+		 * property provides additional rotation to the vectors in the texture.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.anisotropyRotation = 0;
+
+		/**
+		 * Red and green channels represent the anisotropy direction in `[-1, 1]` tangent,
+		 * bitangent space, to be rotated by `anisotropyRotation`. The blue channel
+		 * contains strength as `[0, 1]` to be multiplied by `anisotropy`.
+		 *
+		 * `anisotropyMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.anisotropyMap = null;
+
+		/**
+		 * The red channel of this texture is multiplied against `clearcoat`,
+		 * for per-pixel control over a coating's intensity.
+		 *
+		 * `clearcoatMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.clearcoatMap = null;
+
+		/**
+		 * Roughness of the clear coat layer, from `0.0` to `1.0`.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.clearcoatRoughness = 0.0;
+
+		/**
+		 * The green channel of this texture is multiplied against
+		 * `clearcoatRoughness`, for per-pixel control over a coating's roughness.
+		 *
+		 * `clearcoatRoughnessMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.clearcoatRoughnessMap = null;
+
+		/**
+		 * How much `clearcoatNormalMap` affects the clear coat layer, from
+		 * `(0,0)` to `(1,1)`.
+		 *
+		 * @type {Vector2}
+		 * @default (1,1)
+		 */
+		this.clearcoatNormalScale = new Vector2( 1, 1 );
+
+		/**
+		 * Can be used to enable independent normals for the clear coat layer.
+		 *
+		 * `clearcoatNormalMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.clearcoatNormalMap = null;
+
+		/**
+		 * Index-of-refraction for non-metallic materials, from `1.0` to `2.333`.
+		 *
+		 * @type {number}
+		 * @default 1.5
+		 */
+		this.ior = 1.5;
+
+		/**
+		 * Degree of reflectivity, from `0.0` to `1.0`. Default is `0.5`, which
+		 * corresponds to an index-of-refraction of `1.5`.
+		 *
+		 * This models the reflectivity of non-metallic materials. It has no effect
+		 * when `metalness` is `1.0`
+		 *
+		 * @name MeshPhysicalMaterial#reflectivity
+		 * @type {number}
+		 * @default 0.5
+		 */
+		Object.defineProperty( this, 'reflectivity', {
+			get: function () {
+
+				return ( clamp( 2.5 * ( this.ior - 1 ) / ( this.ior + 1 ), 0, 1 ) );
+
+			},
+			set: function ( reflectivity ) {
+
+				this.ior = ( 1 + 0.4 * reflectivity ) / ( 1 - 0.4 * reflectivity );
+
+			}
+		} );
+
+		/**
+		 * The red channel of this texture is multiplied against `iridescence`, for per-pixel
+		 * control over iridescence.
+		 *
+		 * `iridescenceMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.iridescenceMap = null;
+
+		/**
+		 * Strength of the iridescence RGB color shift effect, represented by an index-of-refraction.
+		 * Between `1.0` to `2.333`.
+		 *
+		 * @type {number}
+		 * @default 1.3
+		 */
+		this.iridescenceIOR = 1.3;
+
+		/**
+		 *Array of exactly 2 elements, specifying minimum and maximum thickness of the iridescence layer.
+		 Thickness of iridescence layer has an equivalent effect of the one `thickness` has on `ior`.
+		 *
+		 * @type {Array<number,number>}
+		 * @default [100,400]
+		 */
+		this.iridescenceThicknessRange = [ 100, 400 ];
+
+		/**
+		 * A texture that defines the thickness of the iridescence layer, stored in the green channel.
+		 * Minimum and maximum values of thickness are defined by `iridescenceThicknessRange` array:
+		 * - `0.0` in the green channel will result in thickness equal to first element of the array.
+		 * - `1.0` in the green channel will result in thickness equal to second element of the array.
+		 * - Values in-between will linearly interpolate between the elements of the array.
+		 *
+		 * `iridescenceThicknessMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.iridescenceThicknessMap = null;
+
+		/**
+		 * The sheen tint.
+		 *
+		 * @type {Color}
+		 * @default (0,0,0)
+		 */
+		this.sheenColor = new Color( 0x000000 );
+
+		/**
+		 * The RGB channels of this texture are multiplied against  `sheenColor`, for per-pixel control
+		 * over sheen tint.
+		 *
+		 * `sheenColorMap` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `sheenColorMap` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.sheenColorMap = null;
+
+		/**
+		 * Roughness of the sheen layer, from `0.0` to `1.0`.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.sheenRoughness = 1.0;
+
+		/**
+		 * The alpha channel of this texture is multiplied against `sheenRoughness`, for per-pixel control
+		 * over sheen roughness.
+		 *
+		 * `sheenRoughnessMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.sheenRoughnessMap = null;
+
+		/**
+		 * The red channel of this texture is multiplied against `transmission`, for per-pixel control over
+		 * optical transparency.
+		 *
+		 * `transmissionMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.transmissionMap = null;
+
+		/**
+		 * The thickness of the volume beneath the surface. The value is given in the
+		 * coordinate space of the mesh. If the value is `0` the material is
+		 * thin-walled. Otherwise the material is a volume boundary.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.thickness = 0;
+
+		/**
+		 * A texture that defines the thickness, stored in the green channel. This will
+		 * be multiplied by `thickness`.
+		 *
+		 * `thicknessMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.thicknessMap = null;
+
+		/**
+		 * Density of the medium given as the average distance that light travels in
+		 * the medium before interacting with a particle. The value is given in world
+		 * space units, and must be greater than zero.
+		 *
+		 * @type {number}
+		 * @default Infinity
+		 */
+		this.attenuationDistance = Infinity;
+
+		/**
+		 * The color that white light turns into due to absorption when reaching the
+		 * attenuation distance.
+		 *
+		 * @type {Color}
+		 * @default (1,1,1)
+		 */
+		this.attenuationColor = new Color( 1, 1, 1 );
+
+		/**
+		 * A float that scales the amount of specular reflection for non-metals only.
+		 * When set to zero, the model is effectively Lambertian. From `0.0` to `1.0`.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.specularIntensity = 1.0;
+
+		/**
+		 * The alpha channel of this texture is multiplied against `specularIntensity`,
+		 * for per-pixel control over specular intensity.
+		 *
+		 * `specularIntensityMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.specularIntensityMap = null;
+
+		/**
+		 * Tints the specular reflection at normal incidence for non-metals only.
+		 *
+		 * @type {Color}
+		 * @default (1,1,1)
+		 */
+		this.specularColor = new Color( 1, 1, 1 );
+
+		/**
+		 * The RGB channels of this texture are multiplied against `specularColor`,
+		 * for per-pixel control over specular color.
+		 *
+		 * `specularColorMap` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `specularColorMap` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.specularColorMap = null;
+
+		this._anisotropy = 0;
+		this._clearcoat = 0;
+		this._dispersion = 0;
+		this._iridescence = 0;
+		this._retroreflectivity = 0;
+		this._sheen = 0.0;
+		this._transmission = 0;
+
+		this.setValues( parameters );
+
+	}
+
+	/**
+	 * The anisotropy strength, from `0.0` to `1.0`.
+	 *
+	 * @type {number}
+	 * @default 0
+	 */
+	get anisotropy() {
+
+		return this._anisotropy;
+
+	}
+
+	set anisotropy( value ) {
+
+		if ( this._anisotropy > 0 !== value > 0 ) {
+
+			this.version ++;
+
+		}
+
+		this._anisotropy = value;
+
+	}
+
+	/**
+	 * Represents the intensity of the clear coat layer, from `0.0` to `1.0`. Use
+	 * clear coat related properties to enable multilayer materials that have a
+	 * thin translucent layer over the base layer.
+	 *
+	 * @type {number}
+	 * @default 0
+	 */
+	get clearcoat() {
+
+		return this._clearcoat;
+
+	}
+
+	set clearcoat( value ) {
+
+		if ( this._clearcoat > 0 !== value > 0 ) {
+
+			this.version ++;
+
+		}
+
+		this._clearcoat = value;
+
+	}
+	/**
+	 * The intensity of the iridescence layer, simulating RGB color shift based on the angle between
+	 * the surface and the viewer, from `0.0` to `1.0`.
+	 *
+	 * @type {number}
+	 * @default 0
+	 */
+	get iridescence() {
+
+		return this._iridescence;
+
+	}
+
+	set iridescence( value ) {
+
+		if ( this._iridescence > 0 !== value > 0 ) {
+
+			this.version ++;
+
+		}
+
+		this._iridescence = value;
+
+	}
+
+	/**
+	 * Defines the strength of the angular separation of colors (chromatic aberration) transmitting
+	 * through a relatively clear volume. Any value zero or larger is valid, the typical range of
+	 * realistic values is `[0, 1]`. This property can be only be used with transmissive objects.
+	 *
+	 * @type {number}
+	 * @default 0
+	 */
+	get dispersion() {
+
+		return this._dispersion;
+
+	}
+
+	set dispersion( value ) {
+
+		if ( this._dispersion > 0 !== value > 0 ) {
+
+			this.version ++;
+
+		}
+
+		this._dispersion = value;
+
+	}
+
+	/**
+	 * The strength of retroreflection, from `0.0` to `1.0`. A value of `1.0`
+	 * evaluates the material's microfacet reflection with the view direction
+	 * reflected about the surface normal, redirecting the specular lobe back
+	 * toward the light source.
+	 *
+	 * @type {number}
+	 * @default 0
+	 */
+	get retroreflectivity() {
+
+		return this._retroreflectivity;
+
+	}
+
+	set retroreflectivity( value ) {
+
+		if ( this._retroreflectivity > 0 !== value > 0 ) {
+
+			this.version ++;
+
+		}
+
+		this._retroreflectivity = value;
+
+	}
+
+	/**
+	 * The intensity of the sheen layer, from `0.0` to `1.0`.
+	 *
+	 * @type {number}
+	 * @default 0
+	 */
+	get sheen() {
+
+		return this._sheen;
+
+	}
+
+	set sheen( value ) {
+
+		if ( this._sheen > 0 !== value > 0 ) {
+
+			this.version ++;
+
+		}
+
+		this._sheen = value;
+
+	}
+
+	/**
+	 * Degree of transmission (or optical transparency), from `0.0` to `1.0`.
+	 *
+	 * Thin, transparent or semitransparent, plastic or glass materials remain
+	 * largely reflective even if they are fully transmissive. The transmission
+	 * property can be used to model these materials.
+	 *
+	 * When transmission is non-zero, `opacity` should be  set to `1`.
+	 *
+	 * @type {number}
+	 * @default 0
+	 */
+	get transmission() {
+
+		return this._transmission;
+
+	}
+
+	set transmission( value ) {
+
+		if ( this._transmission > 0 !== value > 0 ) {
+
+			this.version ++;
+
+		}
+
+		this._transmission = value;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.defines = {
+
+			'STANDARD': '',
+			'PHYSICAL': ''
+
+		};
+
+		this.anisotropy = source.anisotropy;
+		this.anisotropyRotation = source.anisotropyRotation;
+		this.anisotropyMap = source.anisotropyMap;
+
+		this.clearcoat = source.clearcoat;
+		this.clearcoatMap = source.clearcoatMap;
+		this.clearcoatRoughness = source.clearcoatRoughness;
+		this.clearcoatRoughnessMap = source.clearcoatRoughnessMap;
+		this.clearcoatNormalMap = source.clearcoatNormalMap;
+		this.clearcoatNormalScale.copy( source.clearcoatNormalScale );
+
+		this.dispersion = source.dispersion;
+		this.ior = source.ior;
+
+		this.iridescence = source.iridescence;
+		this.iridescenceMap = source.iridescenceMap;
+		this.iridescenceIOR = source.iridescenceIOR;
+		this.iridescenceThicknessRange = [ ...source.iridescenceThicknessRange ];
+		this.iridescenceThicknessMap = source.iridescenceThicknessMap;
+
+		this.retroreflectivity = source.retroreflectivity;
+
+		this.sheen = source.sheen;
+		this.sheenColor.copy( source.sheenColor );
+		this.sheenColorMap = source.sheenColorMap;
+		this.sheenRoughness = source.sheenRoughness;
+		this.sheenRoughnessMap = source.sheenRoughnessMap;
+
+		this.transmission = source.transmission;
+		this.transmissionMap = source.transmissionMap;
+
+		this.thickness = source.thickness;
+		this.thicknessMap = source.thicknessMap;
+		this.attenuationDistance = source.attenuationDistance;
+		this.attenuationColor.copy( source.attenuationColor );
+
+		this.specularIntensity = source.specularIntensity;
+		this.specularIntensityMap = source.specularIntensityMap;
+		this.specularColor.copy( source.specularColor );
+		this.specularColorMap = source.specularColorMap;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A material for shiny surfaces with specular highlights.
+ *
+ * The material uses a non-physically based [Blinn-Phong](https://en.wikipedia.org/wiki/Blinn-Phong_shading_model)
+ * model for calculating reflectance. Unlike the Lambertian model used in the
+ * {@link MeshLambertMaterial} this can simulate shiny surfaces with specular
+ * highlights (such as varnished wood). `MeshPhongMaterial` uses per-fragment shading.
+ *
+ * Performance will generally be greater when using this material over the
+ * {@link MeshStandardMaterial} or {@link MeshPhysicalMaterial}, at the cost of
+ * some graphical accuracy.
+ *
+ * @augments Material
+ * @demo scenes/material-browser.html#MeshPhongMaterial
+ */
+class MeshPhongMaterial extends Material {
+
+	/**
+	 * Constructs a new mesh phong material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isMeshPhongMaterial = true;
+
+		this.type = 'MeshPhongMaterial';
+
+		/**
+		 * Color of the material.
+		 *
+		 * @type {Color}
+		 * @default (1,1,1)
+		 */
+		this.color = new Color( 0xffffff ); // diffuse
+
+		/**
+		 * Specular color of the material. The default color is set to `0x111111` (very dark grey)
+		 *
+		 * This defines how shiny the material is and the color of its shine.
+		 *
+		 * @type {Color}
+		 */
+		this.specular = new Color( 0x111111 );
+
+		/**
+		 * How shiny the specular highlight is; a higher value gives a sharper highlight.
+		 *
+		 * @type {number}
+		 * @default 30
+		 */
+		this.shininess = 30;
+
+		/**
+		 * The color map. May optionally include an alpha channel, typically combined
+		 * with {@link Material#transparent} or {@link Material#alphaTest}. The texture map
+		 * color is modulated by the diffuse `color`.
+		 *
+		 * `map` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `map` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.map = null;
+
+		/**
+		 * The light map. Requires a second set of UVs.
+		 *
+		 * `lightMap` represents pre-baked illuminance data, and the texture must be assigned
+		 * a {@link Texture#colorSpace}. Most `lightMap` textures set
+		 * `texture.colorSpace = LinearSRGBColorSpace` and use float-type formats
+		 * such as `.exr` or `.hdr`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.lightMap = null;
+
+		/**
+		 * Intensity of the baked light.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.lightMapIntensity = 1.0;
+
+		/**
+		 * The red channel of this texture is used as the ambient occlusion map.
+		 * Requires a second set of UVs.
+		 *
+		 * `aoMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.aoMap = null;
+
+		/**
+		 * Intensity of the ambient occlusion effect. Range is `[0,1]`, where `0`
+		 * disables ambient occlusion. Where intensity is `1` and the AO map's
+		 * red channel is also `1`, ambient light is fully occluded on a surface.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.aoMapIntensity = 1.0;
+
+		/**
+		 * Emissive (light) color of the material, essentially a solid color
+		 * unaffected by other lighting.
+		 *
+		 * @type {Color}
+		 * @default (0,0,0)
+		 */
+		this.emissive = new Color( 0x000000 );
+
+		/**
+		 * Intensity of the emissive light. Modulates the emissive color.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.emissiveIntensity = 1.0;
+
+		/**
+		 * Set emissive (glow) map. The emissive map color is modulated by the
+		 * emissive color and the emissive intensity. If you have an emissive map,
+		 * be sure to set the emissive color to something other than black.
+		 *
+		 * `emissiveMap` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `emissiveMap` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.emissiveMap = null;
+
+		/**
+		 * The texture to create a bump map. The black and white values map to the
+		 * perceived depth in relation to the lights. Bump doesn't actually affect
+		 * the geometry of the object, only the lighting. If a normal map is defined
+		 * this will be ignored.
+		 *
+		 * `bumpMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.bumpMap = null;
+
+		/**
+		 * How much the bump map affects the material. Typical range is `[0,1]`.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.bumpScale = 1;
+
+		/**
+		 * The texture to create a normal map. The RGB values affect the surface
+		 * normal for each pixel fragment and change the way the color is lit. Normal
+		 * maps do not change the actual shape of the surface, only the lighting. In
+		 * case the material has a normal map authored using the left handed
+		 * convention, the `y` component of `normalScale` should be negated to compensate
+		 * for the different handedness.
+		 *
+		 * `normalMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.normalMap = null;
+
+		/**
+		 * The type of normal map.
+		 *
+		 * @type {(TangentSpaceNormalMap|ObjectSpaceNormalMap)}
+		 * @default TangentSpaceNormalMap
+		 */
+		this.normalMapType = TangentSpaceNormalMap;
+
+		/**
+		 * How much the normal map affects the material. Typical value range is `[0,1]`.
+		 *
+		 * @type {Vector2}
+		 * @default (1,1)
+		 */
+		this.normalScale = new Vector2( 1, 1 );
+
+		/**
+		 * The displacement map affects the position of the mesh's vertices. Unlike
+		 * other maps which only affect the light and shade of the material the
+		 * displaced vertices can cast shadows, block other objects, and otherwise
+		 * act as real geometry. The displacement texture is an image where the value
+		 * of each pixel (white being the highest) is mapped against, and
+		 * repositions, the vertices of the mesh. For best results, pair a
+		 * displacement map with a matching normal map, since the renderer can
+		 * not recompute surface normals from the displaced vertices.
+		 *
+		 * `displacementMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.displacementMap = null;
+
+		/**
+		 * How much the displacement map affects the mesh (where black is no
+		 * displacement, and white is maximum displacement). Without a displacement
+		 * map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementScale = 1;
+
+		/**
+		 * The offset of the displacement map's values on the mesh's vertices.
+		 * The bias is added to the scaled sample of the displacement map.
+		 * Without a displacement map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementBias = 0;
+
+		/**
+		 * The specular map value affects both how much the specular surface
+		 * highlight contributes and how much of the environment map affects the
+		 * surface.
+		 *
+		 * `specularMap` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `specularMap` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.specularMap = null;
+
+		/**
+		 * The alpha map is a grayscale texture that controls the opacity across the
+		 * surface (black: fully transparent; white: fully opaque).
+		 *
+		 * Only the color of the texture is used, ignoring the alpha channel if one
+		 * exists. For RGB and RGBA textures, the renderer will use the green channel
+		 * when sampling this texture due to the extra bit of precision provided for
+		 * green in DXT-compressed and uncompressed RGB 565 formats. Luminance-only and
+		 * luminance/alpha textures will also still work as expected.
+		 *
+		 * `alphaMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.alphaMap = null;
+
+		/**
+		 * The environment map.
+		 *
+		 * `envMap` represents luminance data, and the texture must be assigned
+		 * a {@link Texture#colorSpace}. Most `envMap` textures set
+		 * `texture.colorSpace = LinearSRGBColorSpace` and use float-type formats
+		 * such as `.exr` or `.hdr`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.envMap = null;
+
+		/**
+		 * The rotation of the environment map in radians.
+		 *
+		 * @type {Euler}
+		 * @default (0,0,0)
+		 */
+		this.envMapRotation = new Euler();
+
+		/**
+		 * How to combine the result of the surface's color with the environment map, if any.
+		 *
+		 * When set to `MixOperation`, the {@link MeshBasicMaterial#reflectivity} is used to
+		 * blend between the two colors.
+		 *
+		 * @type {(MultiplyOperation|MixOperation|AddOperation)}
+		 * @default MultiplyOperation
+		 */
+		this.combine = MultiplyOperation;
+
+		/**
+		 * How much the environment map affects the surface.
+		 * The valid range is between `0` (no reflections) and `1` (full reflections).
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.reflectivity = 1;
+
+		/**
+		 * Scales the effect of the environment map by multiplying its color.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.envMapIntensity = 1.0;
+
+		/**
+		 * The index of refraction (IOR) of air (approximately 1) divided by the
+		 * index of refraction of the material. It is used with environment mapping
+		 * modes {@link CubeRefractionMapping} and {@link EquirectangularRefractionMapping}.
+		 * The refraction ratio should not exceed `1`.
+		 *
+		 * @type {number}
+		 * @default 0.98
+		 */
+		this.refractionRatio = 0.98;
+
+		/**
+		 * Renders the geometry as a wireframe.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.wireframe = false;
+
+		/**
+		 * Controls the thickness of the wireframe.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.wireframeLinewidth = 1;
+
+		/**
+		 * Defines appearance of wireframe ends.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {('round'|'bevel'|'miter')}
+		 * @default 'round'
+		 */
+		this.wireframeLinecap = 'round';
+
+		/**
+		 * Defines appearance of wireframe joints.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {('round'|'bevel'|'miter')}
+		 * @default 'round'
+		 */
+		this.wireframeLinejoin = 'round';
+
+		/**
+		 * Whether the material is rendered with flat shading or not.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.flatShading = false;
+
+		/**
+		 * Whether the material is affected by fog or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.fog = true;
+
+		this.setValues( parameters );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.color.copy( source.color );
+		this.specular.copy( source.specular );
+		this.shininess = source.shininess;
+
+		this.map = source.map;
+
+		this.lightMap = source.lightMap;
+		this.lightMapIntensity = source.lightMapIntensity;
+
+		this.aoMap = source.aoMap;
+		this.aoMapIntensity = source.aoMapIntensity;
+
+		this.emissive.copy( source.emissive );
+		this.emissiveMap = source.emissiveMap;
+		this.emissiveIntensity = source.emissiveIntensity;
+
+		this.bumpMap = source.bumpMap;
+		this.bumpScale = source.bumpScale;
+
+		this.normalMap = source.normalMap;
+		this.normalMapType = source.normalMapType;
+		this.normalScale.copy( source.normalScale );
+
+		this.displacementMap = source.displacementMap;
+		this.displacementScale = source.displacementScale;
+		this.displacementBias = source.displacementBias;
+
+		this.specularMap = source.specularMap;
+
+		this.alphaMap = source.alphaMap;
+
+		this.envMap = source.envMap;
+		this.envMapRotation.copy( source.envMapRotation );
+		this.combine = source.combine;
+		this.reflectivity = source.reflectivity;
+		this.envMapIntensity = source.envMapIntensity;
+		this.refractionRatio = source.refractionRatio;
+
+		this.wireframe = source.wireframe;
+		this.wireframeLinewidth = source.wireframeLinewidth;
+		this.wireframeLinecap = source.wireframeLinecap;
+		this.wireframeLinejoin = source.wireframeLinejoin;
+
+		this.flatShading = source.flatShading;
+
+		this.fog = source.fog;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A material implementing toon shading.
+ *
+ * @augments Material
+ * @demo scenes/material-browser.html#MeshToonMaterial
+ */
+class MeshToonMaterial extends Material {
+
+	/**
+	 * Constructs a new mesh toon material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isMeshToonMaterial = true;
+
+		this.defines = { 'TOON': '' };
+
+		this.type = 'MeshToonMaterial';
+
+		/**
+		 * Color of the material.
+		 *
+		 * @type {Color}
+		 * @default (1,1,1)
+		 */
+		this.color = new Color( 0xffffff );
+
+		/**
+		 * The color map. May optionally include an alpha channel, typically combined
+		 * with {@link Material#transparent} or {@link Material#alphaTest}. The texture map
+		 * color is modulated by the diffuse `color`.
+		 *
+		 * `map` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `map` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.map = null;
+
+		/**
+		 * Gradient map for toon shading. It's required to set
+		 * {@link Texture#minFilter} and {@link Texture#magFilter} to {@link NearestFilter}
+		 * when using this type of texture.
+		 *
+		 * `gradientMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.gradientMap = null;
+
+		/**
+		 * The light map. Requires a second set of UVs.
+		 *
+		 * `lightMap` represents pre-baked illuminance data, and the texture must be assigned
+		 * a {@link Texture#colorSpace}. Most `lightMap` textures set
+		 * `texture.colorSpace = LinearSRGBColorSpace` and use float-type formats
+		 * such as `.exr` or `.hdr`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.lightMap = null;
+
+		/**
+		 * Intensity of the baked light.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.lightMapIntensity = 1.0;
+
+		/**
+		 * The red channel of this texture is used as the ambient occlusion map.
+		 * Requires a second set of UVs.
+		 *
+		 * `aoMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.aoMap = null;
+
+		/**
+		 * Intensity of the ambient occlusion effect. Range is `[0,1]`, where `0`
+		 * disables ambient occlusion. Where intensity is `1` and the AO map's
+		 * red channel is also `1`, ambient light is fully occluded on a surface.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.aoMapIntensity = 1.0;
+
+		/**
+		 * Emissive (light) color of the material, essentially a solid color
+		 * unaffected by other lighting.
+		 *
+		 * @type {Color}
+		 * @default (0,0,0)
+		 */
+		this.emissive = new Color( 0x000000 );
+
+		/**
+		 * Intensity of the emissive light. Modulates the emissive color.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.emissiveIntensity = 1.0;
+
+		/**
+		 * Set emissive (glow) map. The emissive map color is modulated by the
+		 * emissive color and the emissive intensity. If you have an emissive map,
+		 * be sure to set the emissive color to something other than black.
+		 *
+		 * `emissiveMap` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `emissiveMap` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.emissiveMap = null;
+
+		/**
+		 * The texture to create a bump map. The black and white values map to the
+		 * perceived depth in relation to the lights. Bump doesn't actually affect
+		 * the geometry of the object, only the lighting. If a normal map is defined
+		 * this will be ignored.
+		 *
+		 * `bumpMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.bumpMap = null;
+
+		/**
+		 * How much the bump map affects the material. Typical range is `[0,1]`.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.bumpScale = 1;
+
+		/**
+		 * The texture to create a normal map. The RGB values affect the surface
+		 * normal for each pixel fragment and change the way the color is lit. Normal
+		 * maps do not change the actual shape of the surface, only the lighting. In
+		 * case the material has a normal map authored using the left handed
+		 * convention, the `y` component of `normalScale` should be negated to compensate
+		 * for the different handedness.
+		 *
+		 * `normalMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.normalMap = null;
+
+		/**
+		 * The type of normal map.
+		 *
+		 * @type {(TangentSpaceNormalMap|ObjectSpaceNormalMap)}
+		 * @default TangentSpaceNormalMap
+		 */
+		this.normalMapType = TangentSpaceNormalMap;
+
+		/**
+		 * How much the normal map affects the material. Typical value range is `[0,1]`.
+		 *
+		 * @type {Vector2}
+		 * @default (1,1)
+		 */
+		this.normalScale = new Vector2( 1, 1 );
+
+		/**
+		 * The displacement map affects the position of the mesh's vertices. Unlike
+		 * other maps which only affect the light and shade of the material the
+		 * displaced vertices can cast shadows, block other objects, and otherwise
+		 * act as real geometry. The displacement texture is an image where the value
+		 * of each pixel (white being the highest) is mapped against, and
+		 * repositions, the vertices of the mesh. For best results, pair a
+		 * displacement map with a matching normal map, since the renderer can
+		 * not recompute surface normals from the displaced vertices.
+		 *
+		 * `displacementMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.displacementMap = null;
+
+		/**
+		 * How much the displacement map affects the mesh (where black is no
+		 * displacement, and white is maximum displacement). Without a displacement
+		 * map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementScale = 1;
+
+		/**
+		 * The offset of the displacement map's values on the mesh's vertices.
+		 * The bias is added to the scaled sample of the displacement map.
+		 * Without a displacement map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementBias = 0;
+
+		/**
+		 * The alpha map is a grayscale texture that controls the opacity across the
+		 * surface (black: fully transparent; white: fully opaque).
+		 *
+		 * Only the color of the texture is used, ignoring the alpha channel if one
+		 * exists. For RGB and RGBA textures, the renderer will use the green channel
+		 * when sampling this texture due to the extra bit of precision provided for
+		 * green in DXT-compressed and uncompressed RGB 565 formats. Luminance-only and
+		 * luminance/alpha textures will also still work as expected.
+		 *
+		 * `alphaMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.alphaMap = null;
+
+		/**
+		 * Renders the geometry as a wireframe.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.wireframe = false;
+
+		/**
+		 * Controls the thickness of the wireframe.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.wireframeLinewidth = 1;
+
+		/**
+		 * Defines appearance of wireframe ends.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {('round'|'bevel'|'miter')}
+		 * @default 'round'
+		 */
+		this.wireframeLinecap = 'round';
+
+		/**
+		 * Defines appearance of wireframe joints.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {('round'|'bevel'|'miter')}
+		 * @default 'round'
+		 */
+		this.wireframeLinejoin = 'round';
+
+		/**
+		 * Whether the material is affected by fog or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.fog = true;
+
+		this.setValues( parameters );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.color.copy( source.color );
+
+		this.map = source.map;
+		this.gradientMap = source.gradientMap;
+
+		this.lightMap = source.lightMap;
+		this.lightMapIntensity = source.lightMapIntensity;
+
+		this.aoMap = source.aoMap;
+		this.aoMapIntensity = source.aoMapIntensity;
+
+		this.emissive.copy( source.emissive );
+		this.emissiveMap = source.emissiveMap;
+		this.emissiveIntensity = source.emissiveIntensity;
+
+		this.bumpMap = source.bumpMap;
+		this.bumpScale = source.bumpScale;
+
+		this.normalMap = source.normalMap;
+		this.normalMapType = source.normalMapType;
+		this.normalScale.copy( source.normalScale );
+
+		this.displacementMap = source.displacementMap;
+		this.displacementScale = source.displacementScale;
+		this.displacementBias = source.displacementBias;
+
+		this.alphaMap = source.alphaMap;
+
+		this.wireframe = source.wireframe;
+		this.wireframeLinewidth = source.wireframeLinewidth;
+		this.wireframeLinecap = source.wireframeLinecap;
+		this.wireframeLinejoin = source.wireframeLinejoin;
+
+		this.fog = source.fog;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A material that maps the normal vectors to RGB colors.
+ *
+ * @augments Material
+ * @demo scenes/material-browser.html#MeshNormalMaterial
+ */
+class MeshNormalMaterial extends Material {
+
+	/**
+	 * Constructs a new mesh normal material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isMeshNormalMaterial = true;
+
+		this.type = 'MeshNormalMaterial';
+
+		/**
+		 * The texture to create a bump map. The black and white values map to the
+		 * perceived depth in relation to the lights. Bump doesn't actually affect
+		 * the geometry of the object, only the lighting. If a normal map is defined
+		 * this will be ignored.
+		 *
+		 * `bumpMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.bumpMap = null;
+
+		/**
+		 * How much the bump map affects the material. Typical range is `[0,1]`.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.bumpScale = 1;
+
+		/**
+		 * The texture to create a normal map. The RGB values affect the surface
+		 * normal for each pixel fragment and change the way the color is lit. Normal
+		 * maps do not change the actual shape of the surface, only the lighting. In
+		 * case the material has a normal map authored using the left handed
+		 * convention, the `y` component of `normalScale` should be negated to compensate
+		 * for the different handedness.
+		 *
+		 * `normalMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.normalMap = null;
+
+		/**
+		 * The type of normal map.
+		 *
+		 * @type {(TangentSpaceNormalMap|ObjectSpaceNormalMap)}
+		 * @default TangentSpaceNormalMap
+		 */
+		this.normalMapType = TangentSpaceNormalMap;
+
+		/**
+		 * How much the normal map affects the material. Typical value range is `[0,1]`.
+		 *
+		 * @type {Vector2}
+		 * @default (1,1)
+		 */
+		this.normalScale = new Vector2( 1, 1 );
+
+		/**
+		 * The displacement map affects the position of the mesh's vertices. Unlike
+		 * other maps which only affect the light and shade of the material the
+		 * displaced vertices can cast shadows, block other objects, and otherwise
+		 * act as real geometry. The displacement texture is an image where the value
+		 * of each pixel (white being the highest) is mapped against, and
+		 * repositions, the vertices of the mesh. For best results, pair a
+		 * displacement map with a matching normal map, since the renderer can
+		 * not recompute surface normals from the displaced vertices.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.displacementMap = null;
+
+		/**
+		 * How much the displacement map affects the mesh (where black is no
+		 * displacement, and white is maximum displacement). Without a displacement
+		 * map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementScale = 1;
+
+		/**
+		 * The offset of the displacement map's values on the mesh's vertices.
+		 * The bias is added to the scaled sample of the displacement map.
+		 * Without a displacement map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementBias = 0;
+
+		/**
+		 * Renders the geometry as a wireframe.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.wireframe = false;
+
+		/**
+		 * Controls the thickness of the wireframe.
+		 *
+		 * WebGL and WebGPU ignore this property and always render
+		 * 1 pixel wide lines.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.wireframeLinewidth = 1;
+
+		/**
+		 * Whether the material is rendered with flat shading or not.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.flatShading = false;
+
+		this.setValues( parameters );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.bumpMap = source.bumpMap;
+		this.bumpScale = source.bumpScale;
+
+		this.normalMap = source.normalMap;
+		this.normalMapType = source.normalMapType;
+		this.normalScale.copy( source.normalScale );
+
+		this.displacementMap = source.displacementMap;
+		this.displacementScale = source.displacementScale;
+		this.displacementBias = source.displacementBias;
+
+		this.wireframe = source.wireframe;
+		this.wireframeLinewidth = source.wireframeLinewidth;
+
+		this.flatShading = source.flatShading;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A material for non-shiny surfaces, without specular highlights.
+ *
+ * The material uses a non-physically based [Lambertian](https://en.wikipedia.org/wiki/Lambertian_reflectance)
+ * model for calculating reflectance. This can simulate some surfaces (such
+ * as untreated wood or stone) well, but cannot simulate shiny surfaces with
+ * specular highlights (such as varnished wood). `MeshLambertMaterial` uses per-fragment
+ * shading.
+ *
+ * Due to the simplicity of the reflectance and illumination models,
+ * performance will be greater when using this material over the
+ * {@link MeshPhongMaterial}, {@link MeshStandardMaterial} or
+ * {@link MeshPhysicalMaterial}, at the cost of some graphical accuracy.
+ *
+ * @augments Material
+ * @demo scenes/material-browser.html#MeshLambertMaterial
+ */
+class MeshLambertMaterial extends Material {
+
+	/**
+	 * Constructs a new mesh lambert material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isMeshLambertMaterial = true;
+
+		this.type = 'MeshLambertMaterial';
+
+		/**
+		 * Color of the material.
+		 *
+		 * @type {Color}
+		 * @default (1,1,1)
+		 */
+		this.color = new Color( 0xffffff ); // diffuse
+
+		/**
+		 * The color map. May optionally include an alpha channel, typically combined
+		 * with {@link Material#transparent} or {@link Material#alphaTest}. The texture map
+		 * color is modulated by the diffuse `color`.
+		 *
+		 * `map` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `map` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.map = null;
+
+		/**
+		 * The light map. Requires a second set of UVs.
+		 *
+		 * `lightMap` represents pre-baked illuminance data, and the texture must be assigned
+		 * a {@link Texture#colorSpace}. Most `lightMap` textures set
+		 * `texture.colorSpace = LinearSRGBColorSpace` and use float-type formats
+		 * such as `.exr` or `.hdr`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.lightMap = null;
+
+		/**
+		 * Intensity of the baked light.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.lightMapIntensity = 1.0;
+
+		/**
+		 * The red channel of this texture is used as the ambient occlusion map.
+		 * Requires a second set of UVs.
+		 *
+		 * `aoMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.aoMap = null;
+
+		/**
+		 * Intensity of the ambient occlusion effect. Range is `[0,1]`, where `0`
+		 * disables ambient occlusion. Where intensity is `1` and the AO map's
+		 * red channel is also `1`, ambient light is fully occluded on a surface.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.aoMapIntensity = 1.0;
+
+		/**
+		 * Emissive (light) color of the material, essentially a solid color
+		 * unaffected by other lighting.
+		 *
+		 * @type {Color}
+		 * @default (0,0,0)
+		 */
+		this.emissive = new Color( 0x000000 );
+
+		/**
+		 * Intensity of the emissive light. Modulates the emissive color.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.emissiveIntensity = 1.0;
+
+		/**
+		 * Set emissive (glow) map. The emissive map color is modulated by the
+		 * emissive color and the emissive intensity. If you have an emissive map,
+		 * be sure to set the emissive color to something other than black.
+		 *
+		 * `emissiveMap` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `emissiveMap` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.emissiveMap = null;
+
+		/**
+		 * The texture to create a bump map. The black and white values map to the
+		 * perceived depth in relation to the lights. Bump doesn't actually affect
+		 * the geometry of the object, only the lighting. If a normal map is defined
+		 * this will be ignored.
+		 *
+		 * `bumpMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.bumpMap = null;
+
+		/**
+		 * How much the bump map affects the material. Typical range is `[0,1]`.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.bumpScale = 1;
+
+		/**
+		 * The texture to create a normal map. The RGB values affect the surface
+		 * normal for each pixel fragment and change the way the color is lit. Normal
+		 * maps do not change the actual shape of the surface, only the lighting. In
+		 * case the material has a normal map authored using the left handed
+		 * convention, the `y` component of `normalScale` should be negated to compensate
+		 * for the different handedness.
+		 *
+		 * `normalMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.normalMap = null;
+
+		/**
+		 * The type of normal map.
+		 *
+		 * @type {(TangentSpaceNormalMap|ObjectSpaceNormalMap)}
+		 * @default TangentSpaceNormalMap
+		 */
+		this.normalMapType = TangentSpaceNormalMap;
+
+		/**
+		 * How much the normal map affects the material. Typical value range is `[0,1]`.
+		 *
+		 * @type {Vector2}
+		 * @default (1,1)
+		 */
+		this.normalScale = new Vector2( 1, 1 );
+
+		/**
+		 * The displacement map affects the position of the mesh's vertices. Unlike
+		 * other maps which only affect the light and shade of the material the
+		 * displaced vertices can cast shadows, block other objects, and otherwise
+		 * act as real geometry. The displacement texture is an image where the value
+		 * of each pixel (white being the highest) is mapped against, and
+		 * repositions, the vertices of the mesh. For best results, pair a
+		 * displacement map with a matching normal map, since the renderer can
+		 * not recompute surface normals from the displaced vertices.
+		 *
+		 * `displacementMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.displacementMap = null;
+
+		/**
+		 * How much the displacement map affects the mesh (where black is no
+		 * displacement, and white is maximum displacement). Without a displacement
+		 * map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementScale = 1;
+
+		/**
+		 * The offset of the displacement map's values on the mesh's vertices.
+		 * The bias is added to the scaled sample of the displacement map.
+		 * Without a displacement map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementBias = 0;
+
+		/**
+		 * Specular map used by the material.
+		 *
+		 * `specularMap` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `specularMap` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.specularMap = null;
+
+		/**
+		 * The alpha map is a grayscale texture that controls the opacity across the
+		 * surface (black: fully transparent; white: fully opaque).
+		 *
+		 * Only the color of the texture is used, ignoring the alpha channel if one
+		 * exists. For RGB and RGBA textures, the renderer will use the green channel
+		 * when sampling this texture due to the extra bit of precision provided for
+		 * green in DXT-compressed and uncompressed RGB 565 formats. Luminance-only and
+		 * luminance/alpha textures will also still work as expected.
+		 *
+		 * `alphaMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.alphaMap = null;
+
+		/**
+		 * The environment map.
+		 *
+		 * `envMap` represents luminance data, and the texture must be assigned
+		 * a {@link Texture#colorSpace}. Most `envMap` textures set
+		 * `texture.colorSpace = LinearSRGBColorSpace` and use float-type formats
+		 * such as `.exr` or `.hdr`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.envMap = null;
+
+		/**
+		 * The rotation of the environment map in radians.
+		 *
+		 * @type {Euler}
+		 * @default (0,0,0)
+		 */
+		this.envMapRotation = new Euler();
+
+		/**
+		 * How to combine the result of the surface's color with the environment map, if any.
+		 *
+		 * When set to `MixOperation`, the {@link MeshBasicMaterial#reflectivity} is used to
+		 * blend between the two colors.
+		 *
+		 * @type {(MultiplyOperation|MixOperation|AddOperation)}
+		 * @default MultiplyOperation
+		 */
+		this.combine = MultiplyOperation;
+
+		/**
+		 * How much the environment map affects the surface.
+		 * The valid range is between `0` (no reflections) and `1` (full reflections).
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.reflectivity = 1;
+
+		/**
+		 * Scales the effect of the environment map by multiplying its color.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.envMapIntensity = 1.0;
+
+		/**
+		 * The index of refraction (IOR) of air (approximately 1) divided by the
+		 * index of refraction of the material. It is used with environment mapping
+		 * modes {@link CubeRefractionMapping} and {@link EquirectangularRefractionMapping}.
+		 * The refraction ratio should not exceed `1`.
+		 *
+		 * @type {number}
+		 * @default 0.98
+		 */
+		this.refractionRatio = 0.98;
+
+		/**
+		 * Renders the geometry as a wireframe.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.wireframe = false;
+
+		/**
+		 * Controls the thickness of the wireframe.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.wireframeLinewidth = 1;
+
+		/**
+		 * Defines appearance of wireframe ends.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {('round'|'bevel'|'miter')}
+		 * @default 'round'
+		 */
+		this.wireframeLinecap = 'round';
+
+		/**
+		 * Defines appearance of wireframe joints.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {('round'|'bevel'|'miter')}
+		 * @default 'round'
+		 */
+		this.wireframeLinejoin = 'round';
+
+		/**
+		 * Whether the material is rendered with flat shading or not.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.flatShading = false;
+
+		/**
+		 * Whether the material is affected by fog or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.fog = true;
+
+		this.setValues( parameters );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.color.copy( source.color );
+
+		this.map = source.map;
+
+		this.lightMap = source.lightMap;
+		this.lightMapIntensity = source.lightMapIntensity;
+
+		this.aoMap = source.aoMap;
+		this.aoMapIntensity = source.aoMapIntensity;
+
+		this.emissive.copy( source.emissive );
+		this.emissiveMap = source.emissiveMap;
+		this.emissiveIntensity = source.emissiveIntensity;
+
+		this.bumpMap = source.bumpMap;
+		this.bumpScale = source.bumpScale;
+
+		this.normalMap = source.normalMap;
+		this.normalMapType = source.normalMapType;
+		this.normalScale.copy( source.normalScale );
+
+		this.displacementMap = source.displacementMap;
+		this.displacementScale = source.displacementScale;
+		this.displacementBias = source.displacementBias;
+
+		this.specularMap = source.specularMap;
+
+		this.alphaMap = source.alphaMap;
+
+		this.envMap = source.envMap;
+		this.envMapRotation.copy( source.envMapRotation );
+		this.combine = source.combine;
+		this.reflectivity = source.reflectivity;
+		this.envMapIntensity = source.envMapIntensity;
+		this.refractionRatio = source.refractionRatio;
+
+		this.wireframe = source.wireframe;
+		this.wireframeLinewidth = source.wireframeLinewidth;
+		this.wireframeLinecap = source.wireframeLinecap;
+		this.wireframeLinejoin = source.wireframeLinejoin;
+
+		this.flatShading = source.flatShading;
+
+		this.fog = source.fog;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A material for drawing geometry by depth. Depth is based off of the camera
+ * near and far plane. White is nearest, black is farthest.
+ *
+ * @augments Material
+ * @demo scenes/material-browser.html#MeshDepthMaterial
+ */
+class MeshDepthMaterial extends Material {
+
+	/**
+	 * Constructs a new mesh depth material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isMeshDepthMaterial = true;
+
+		this.type = 'MeshDepthMaterial';
+
+		/**
+		 * Type for depth packing.
+		 *
+		 * @type {(BasicDepthPacking|RGBADepthPacking|RGBDepthPacking|RGDepthPacking)}
+		 * @default BasicDepthPacking
+		 */
+		this.depthPacking = BasicDepthPacking;
+
+		/**
+		 * The color map. May optionally include an alpha channel, typically combined
+		 * with {@link Material#transparent} or {@link Material#alphaTest}.
+		 *
+		 * `map` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `map` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.map = null;
+
+		/**
+		 * The alpha map is a grayscale texture that controls the opacity across the
+		 * surface (black: fully transparent; white: fully opaque).
+		 *
+		 * Only the color of the texture is used, ignoring the alpha channel if one
+		 * exists. For RGB and RGBA textures, the renderer will use the green channel
+		 * when sampling this texture due to the extra bit of precision provided for
+		 * green in DXT-compressed and uncompressed RGB 565 formats. Luminance-only and
+		 * luminance/alpha textures will also still work as expected.
+		 *
+		 * `alphaMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.alphaMap = null;
+
+		/**
+		 * The displacement map affects the position of the mesh's vertices. Unlike
+		 * other maps which only affect the light and shade of the material the
+		 * displaced vertices can cast shadows, block other objects, and otherwise
+		 * act as real geometry. The displacement texture is an image where the value
+		 * of each pixel (white being the highest) is mapped against, and
+		 * repositions, the vertices of the mesh.
+		 *
+		 * `displacementMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.displacementMap = null;
+
+		/**
+		 * How much the displacement map affects the mesh (where black is no
+		 * displacement, and white is maximum displacement). Without a displacement
+		 * map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementScale = 1;
+
+		/**
+		 * The offset of the displacement map's values on the mesh's vertices.
+		 * The bias is added to the scaled sample of the displacement map.
+		 * Without a displacement map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementBias = 0;
+
+		/**
+		 * Renders the geometry as a wireframe.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.wireframe = false;
+
+		/**
+		 * Controls the thickness of the wireframe.
+		 *
+		 * WebGL and WebGPU ignore this property and always render
+		 * 1 pixel wide lines.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.wireframeLinewidth = 1;
+
+		this.setValues( parameters );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.depthPacking = source.depthPacking;
+
+		this.map = source.map;
+
+		this.alphaMap = source.alphaMap;
+
+		this.displacementMap = source.displacementMap;
+		this.displacementScale = source.displacementScale;
+		this.displacementBias = source.displacementBias;
+
+		this.wireframe = source.wireframe;
+		this.wireframeLinewidth = source.wireframeLinewidth;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A material used internally for implementing shadow mapping with
+ * point lights.
+ *
+ * Can also be used to customize the shadow casting of an object by assigning
+ * an instance of `MeshDistanceMaterial` to {@link Object3D#customDistanceMaterial}.
+ * The following examples demonstrates this approach in order to ensure
+ * transparent parts of objects do not cast shadows.
+ *
+ * @augments Material
+ */
+class MeshDistanceMaterial extends Material {
+
+	/**
+	 * Constructs a new mesh distance material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isMeshDistanceMaterial = true;
+
+		this.type = 'MeshDistanceMaterial';
+
+		/**
+		 * The color map. May optionally include an alpha channel, typically combined
+		 * with {@link Material#transparent} or {@link Material#alphaTest}.
+		 *
+		 * `map` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `map` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.map = null;
+
+		/**
+		 * The alpha map is a grayscale texture that controls the opacity across the
+		 * surface (black: fully transparent; white: fully opaque).
+		 *
+		 * Only the color of the texture is used, ignoring the alpha channel if one
+		 * exists. For RGB and RGBA textures, the renderer will use the green channel
+		 * when sampling this texture due to the extra bit of precision provided for
+		 * green in DXT-compressed and uncompressed RGB 565 formats. Luminance-only and
+		 * luminance/alpha textures will also still work as expected.
+		 *
+		 * `alphaMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.alphaMap = null;
+
+		/**
+		 * The displacement map affects the position of the mesh's vertices. Unlike
+		 * other maps which only affect the light and shade of the material the
+		 * displaced vertices can cast shadows, block other objects, and otherwise
+		 * act as real geometry. The displacement texture is an image where the value
+		 * of each pixel (white being the highest) is mapped against, and
+		 * repositions, the vertices of the mesh.
+		 *
+		 * `displacementMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.displacementMap = null;
+
+		/**
+		 * How much the displacement map affects the mesh (where black is no
+		 * displacement, and white is maximum displacement). Without a displacement
+		 * map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementScale = 1;
+
+		/**
+		 * The offset of the displacement map's values on the mesh's vertices.
+		 * The bias is added to the scaled sample of the displacement map.
+		 * Without a displacement map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementBias = 0;
+
+		this.setValues( parameters );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.map = source.map;
+
+		this.alphaMap = source.alphaMap;
+
+		this.displacementMap = source.displacementMap;
+		this.displacementScale = source.displacementScale;
+		this.displacementBias = source.displacementBias;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * This material is defined by a MatCap (or Lit Sphere) texture, which encodes the
+ * material color and shading.
+ *
+ * `MeshMatcapMaterial` does not respond to lights since the matcap image file encodes
+ * baked lighting. It will cast a shadow onto an object that receives shadows
+ * (and shadow clipping works), but it will not self-shadow or receive
+ * shadows.
+ *
+ * @augments Material
+ * @demo scenes/material-browser.html#MeshMatcapMaterial
+ */
+class MeshMatcapMaterial extends Material {
+
+	/**
+	 * Constructs a new mesh matcap material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isMeshMatcapMaterial = true;
+
+		this.defines = { 'MATCAP': '' };
+
+		this.type = 'MeshMatcapMaterial';
+
+		/**
+		 * Color of the material.
+		 *
+		 * @type {Color}
+		 * @default (1,1,1)
+		 */
+		this.color = new Color( 0xffffff ); // diffuse
+
+		/**
+		 * The matcap map.
+		 *
+		 * `matcap` represents luminance data, and the texture must be assigned
+		 * a {@link Texture#colorSpace}. HDR `matcap` textures (e.g. `.exr`)
+		 * typically set `texture.colorSpace = LinearSRGBColorSpace`, while LDR
+		 * `matcap` textures (e.g. `.png`, `.jpg`, `.webp`) typically set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.matcap = null;
+
+		/**
+		 * The color map. May optionally include an alpha channel, typically combined
+		 * with {@link Material#transparent} or {@link Material#alphaTest}. The texture map
+		 * color is modulated by the diffuse `color`.
+		 *
+		 * `map` represents color data, and the texture must be assigned a
+		 * {@link Texture#colorSpace}. Most `map` textures set
+		 * `texture.colorSpace = SRGBColorSpace`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.map = null;
+
+		/**
+		 * The texture to create a bump map. The black and white values map to the
+		 * perceived depth in relation to the lights. Bump doesn't actually affect
+		 * the geometry of the object, only the lighting. If a normal map is defined
+		 * this will be ignored.
+		 *
+		 * `bumpMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.bumpMap = null;
+
+		/**
+		 * How much the bump map affects the material. Typical range is `[0,1]`.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.bumpScale = 1;
+
+		/**
+		 * The texture to create a normal map. The RGB values affect the surface
+		 * normal for each pixel fragment and change the way the color is lit. Normal
+		 * maps do not change the actual shape of the surface, only the lighting. In
+		 * case the material has a normal map authored using the left handed
+		 * convention, the `y` component of `normalScale` should be negated to compensate
+		 * for the different handedness.
+		 *
+		 * `normalMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.normalMap = null;
+
+		/**
+		 * The type of normal map.
+		 *
+		 * @type {(TangentSpaceNormalMap|ObjectSpaceNormalMap)}
+		 * @default TangentSpaceNormalMap
+		 */
+		this.normalMapType = TangentSpaceNormalMap;
+
+		/**
+		 * How much the normal map affects the material. Typical value range is `[0,1]`.
+		 *
+		 * @type {Vector2}
+		 * @default (1,1)
+		 */
+		this.normalScale = new Vector2( 1, 1 );
+
+		/**
+		 * The displacement map affects the position of the mesh's vertices. Unlike
+		 * other maps which only affect the light and shade of the material the
+		 * displaced vertices can cast shadows, block other objects, and otherwise
+		 * act as real geometry. The displacement texture is an image where the value
+		 * of each pixel (white being the highest) is mapped against, and
+		 * repositions, the vertices of the mesh. For best results, pair a
+		 * displacement map with a matching normal map, since the renderer can
+		 * not recompute surface normals from the displaced vertices.
+		 *
+		 * `displacementMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.displacementMap = null;
+
+		/**
+		 * How much the displacement map affects the mesh (where black is no
+		 * displacement, and white is maximum displacement). Without a displacement
+		 * map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementScale = 1;
+
+		/**
+		 * The offset of the displacement map's values on the mesh's vertices.
+		 * The bias is added to the scaled sample of the displacement map.
+		 * Without a displacement map set, this value is not applied.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.displacementBias = 0;
+
+		/**
+		 * The alpha map is a grayscale texture that controls the opacity across the
+		 * surface (black: fully transparent; white: fully opaque).
+		 *
+		 * Only the color of the texture is used, ignoring the alpha channel if one
+		 * exists. For RGB and RGBA textures, the renderer will use the green channel
+		 * when sampling this texture due to the extra bit of precision provided for
+		 * green in DXT-compressed and uncompressed RGB 565 formats. Luminance-only and
+		 * luminance/alpha textures will also still work as expected.
+		 *
+		 * `alphaMap` represents non-color data. Any texture assigned must have
+		 * `texture.colorSpace = NoColorSpace` (default).
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.alphaMap = null;
+
+		/**
+		 * Renders the geometry as a wireframe.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.wireframe = false;
+
+		/**
+		 * Controls the thickness of the wireframe.
+		 *
+		 * Can only be used with {@link SVGRenderer}.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.wireframeLinewidth = 1;
+
+		/**
+		 * Whether the material is rendered with flat shading or not.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.flatShading = false;
+
+		/**
+		 * Whether the material is affected by fog or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.fog = true;
+
+		this.setValues( parameters );
+
+	}
+
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.defines = { 'MATCAP': '' };
+
+		this.color.copy( source.color );
+
+		this.matcap = source.matcap;
+
+		this.map = source.map;
+
+		this.bumpMap = source.bumpMap;
+		this.bumpScale = source.bumpScale;
+
+		this.normalMap = source.normalMap;
+		this.normalMapType = source.normalMapType;
+		this.normalScale.copy( source.normalScale );
+
+		this.displacementMap = source.displacementMap;
+		this.displacementScale = source.displacementScale;
+		this.displacementBias = source.displacementBias;
+
+		this.alphaMap = source.alphaMap;
+
+		this.wireframe = source.wireframe;
+		this.wireframeLinewidth = source.wireframeLinewidth;
+
+		this.flatShading = source.flatShading;
+
+		this.fog = source.fog;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * A material for rendering line primitives.
+ *
+ * Materials define the appearance of renderable 3D objects.
+ *
+ * ```js
+ * const material = new THREE.LineDashedMaterial( {
+ * 	color: 0xffffff,
+ * 	scale: 1,
+ * 	dashSize: 3,
+ * 	gapSize: 1,
+ * } );
+ * ```
+ *
+ * @augments LineBasicMaterial
+ */
+class LineDashedMaterial extends LineBasicMaterial {
+
+	/**
+	 * Constructs a new line dashed material.
+	 *
+	 * @param {Object} [parameters] - An object with one or more properties
+	 * defining the material's appearance. Any property of the material
+	 * (including any property from inherited materials) can be passed
+	 * in here. Color values can be passed any type of value accepted
+	 * by {@link Color#set}.
+	 */
+	constructor( parameters ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isLineDashedMaterial = true;
+		this.type = 'LineDashedMaterial';
+
+		/**
+		 * The scale of the dashed part of a line.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.scale = 1;
+
+		/**
+		 * The size of the dash. This is both the gap with the stroke.
+		 *
+		 * @type {number}
+		 * @default 3
+		 */
+		this.dashSize = 3;
+
+		/**
+		 * The size of the gap.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.gapSize = 1;
+
+		this.setValues( parameters );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.scale = source.scale;
+		this.dashSize = source.dashSize;
+		this.gapSize = source.gapSize;
+
+		return this;
+
+	}
+
+}
+
+/**
+ * Converts an array to a specific type.
+ *
+ * @param {TypedArray|Array} array - The array to convert.
+ * @param {TypedArray.constructor} type - The constructor of a typed array that defines the new type.
+ * @return {TypedArray} The converted array.
+ */
+function convertArray( array, type ) {
+
+	if ( ! array || array.constructor === type ) return array;
+
+	if ( typeof type.BYTES_PER_ELEMENT === 'number' ) {
+
+		return new type( array ); // create typed array
+
+	}
+
+	return Array.prototype.slice.call( array ); // create Array
+
+}
+
+/**
+ * Returns `true` if the given keyframe track settings hold Bezier tangent data.
+ *
+ * @param {?Object} settings - The settings of a keyframe track.
+ * @return {boolean} Whether both tangent arrays are defined or not.
+ */
+function hasTangents( settings ) {
+
+	return settings !== undefined && settings.inTangents !== undefined && settings.outTangents !== undefined;
+
+}
+
+/**
+ * Returns an array by which times and values can be sorted.
+ *
+ * @param {Array<number>} times - The keyframe time values.
+ * @return {Array<number>} The array.
+ */
+function getKeyframeOrder( times ) {
+
+	function compareTime( i, j ) {
+
+		return times[ i ] - times[ j ];
+
+	}
+
+	const n = times.length;
+	const result = new Array( n );
+	for ( let i = 0; i !== n; ++ i ) result[ i ] = i;
+
+	result.sort( compareTime );
+
+	return result;
+
+}
+
+/**
+ * Sorts the given array by the previously computed order via `getKeyframeOrder()`.
+ *
+ * @param {Array<number>} values - The values to sort.
+ * @param {number} stride - The stride.
+ * @param {Array<number>} order - The sort order.
+ * @return {Array<number>} The sorted values.
+ */
+function sortedArray( values, stride, order ) {
+
+	const nValues = values.length;
+	const result = new values.constructor( nValues );
+
+	for ( let i = 0, dstOffset = 0; dstOffset !== nValues; ++ i ) {
+
+		const srcOffset = order[ i ] * stride;
+
+		for ( let j = 0; j !== stride; ++ j ) {
+
+			result[ dstOffset ++ ] = values[ srcOffset + j ];
+
+		}
+
+	}
+
+	return result;
+
+}
+
+/**
+ * Used for parsing AOS keyframe formats.
+ *
+ * @param {Array<number>} jsonKeys - A list of JSON keyframes.
+ * @param {Array<number>} times - This array will be filled with keyframe times by this function.
+ * @param {Array<number>} values - This array will be filled with keyframe values by this function.
+ * @param {string} valuePropertyName - The name of the property to use.
+ */
+function flattenJSON( jsonKeys, times, values, valuePropertyName ) {
+
+	let i = 1, key = jsonKeys[ 0 ];
+
+	while ( key !== undefined && key[ valuePropertyName ] === undefined ) {
+
+		key = jsonKeys[ i ++ ];
+
+	}
+
+	if ( key === undefined ) return; // no data
+
+	let value = key[ valuePropertyName ];
+	if ( value === undefined ) return; // no data
+
+	if ( Array.isArray( value ) ) {
+
+		do {
+
+			value = key[ valuePropertyName ];
+
+			if ( value !== undefined ) {
+
+				times.push( key.time );
+				values.push( ...value ); // push all elements
+
+			}
+
+			key = jsonKeys[ i ++ ];
+
+		} while ( key !== undefined );
+
+	} else if ( value.toArray !== undefined ) {
+
+		// ...assume THREE.Math-ish
+
+		do {
+
+			value = key[ valuePropertyName ];
+
+			if ( value !== undefined ) {
+
+				times.push( key.time );
+				value.toArray( values, values.length );
+
+			}
+
+			key = jsonKeys[ i ++ ];
+
+		} while ( key !== undefined );
+
+	} else {
+
+		// otherwise push as-is
+
+		do {
+
+			value = key[ valuePropertyName ];
+
+			if ( value !== undefined ) {
+
+				times.push( key.time );
+				values.push( value );
+
+			}
+
+			key = jsonKeys[ i ++ ];
+
+		} while ( key !== undefined );
+
+	}
+
+}
+
+/**
+ * Creates a new clip, containing only the segment of the original clip between the given frames.
+ *
+ * @param {AnimationClip} sourceClip - The values to sort.
+ * @param {string} name - The name of the clip.
+ * @param {number} startFrame - The start frame.
+ * @param {number} endFrame - The end frame.
+ * @param {number} [fps=30] - The FPS.
+ * @return {AnimationClip} The new sub clip.
+ */
+function subclip( sourceClip, name, startFrame, endFrame, fps = 30 ) {
+
+	const clip = sourceClip.clone();
+
+	clip.name = name;
+
+	const tracks = [];
+
+	for ( let i = 0; i < clip.tracks.length; ++ i ) {
+
+		const track = clip.tracks[ i ];
+		const valueSize = track.getValueSize();
+
+		const times = [];
+		const values = [];
+
+		for ( let j = 0; j < track.times.length; ++ j ) {
+
+			const frame = track.times[ j ] * fps;
+
+			if ( frame < startFrame || frame >= endFrame ) continue;
+
+			times.push( track.times[ j ] );
+
+			for ( let k = 0; k < valueSize; ++ k ) {
+
+				values.push( track.values[ j * valueSize + k ] );
+
+			}
+
+		}
+
+		if ( times.length === 0 ) continue;
+
+		track.times = convertArray( times, track.times.constructor );
+		track.values = convertArray( values, track.values.constructor );
+
+		tracks.push( track );
+
+	}
+
+	clip.tracks = tracks;
+
+	// find minimum .times value across all tracks in the trimmed clip
+
+	let minStartTime = Infinity;
+
+	for ( let i = 0; i < clip.tracks.length; ++ i ) {
+
+		if ( minStartTime > clip.tracks[ i ].times[ 0 ] ) {
+
+			minStartTime = clip.tracks[ i ].times[ 0 ];
+
+		}
+
+	}
+
+	// shift all tracks such that clip begins at t=0
+
+	for ( let i = 0; i < clip.tracks.length; ++ i ) {
+
+		clip.tracks[ i ].shift( -1 * minStartTime );
+
+	}
+
+	clip.resetDuration();
+
+	return clip;
+
+}
+
+/**
+ * Converts the keyframes of the given animation clip to an additive format.
+ *
+ * @param {AnimationClip} targetClip - The clip to make additive.
+ * @param {number} [referenceFrame=0] - The reference frame.
+ * @param {AnimationClip} [referenceClip=targetClip] - The reference clip.
+ * @param {number} [fps=30] - The FPS.
+ * @return {AnimationClip} The updated clip which is now additive.
+ */
+function makeClipAdditive( targetClip, referenceFrame = 0, referenceClip = targetClip, fps = 30 ) {
+
+	if ( fps <= 0 ) fps = 30;
+
+	const numTracks = referenceClip.tracks.length;
+	const referenceTime = referenceFrame / fps;
+
+	// Make each track's values relative to the values at the reference frame
+	for ( let i = 0; i < numTracks; ++ i ) {
+
+		const referenceTrack = referenceClip.tracks[ i ];
+		const referenceTrackType = referenceTrack.ValueTypeName;
+
+		// Skip this track if it's non-numeric
+		if ( referenceTrackType === 'bool' || referenceTrackType === 'string' ) continue;
+
+		// Find the track in the target clip whose name and type matches the reference track
+		const targetTrack = targetClip.tracks.find( function ( track ) {
+
+			return track.name === referenceTrack.name
+				&& track.ValueTypeName === referenceTrackType;
+
+		} );
+
+		if ( targetTrack === undefined ) continue;
+
+		let referenceOffset = 0;
+		const referenceValueSize = referenceTrack.getValueSize();
+
+		if ( referenceTrack.createInterpolant.isInterpolantFactoryMethodGLTFCubicSpline ) {
+
+			referenceOffset = referenceValueSize / 3;
+
+		}
+
+		let targetOffset = 0;
+		const targetValueSize = targetTrack.getValueSize();
+
+		if ( targetTrack.createInterpolant.isInterpolantFactoryMethodGLTFCubicSpline ) {
+
+			targetOffset = targetValueSize / 3;
+
+		}
+
+		const lastIndex = referenceTrack.times.length - 1;
+		let referenceValue;
+
+		// Find the value to subtract out of the track
+		if ( referenceTime <= referenceTrack.times[ 0 ] ) {
+
+			// Reference frame is earlier than the first keyframe, so just use the first keyframe
+			const startIndex = referenceOffset;
+			const endIndex = referenceValueSize - referenceOffset;
+			referenceValue = referenceTrack.values.slice( startIndex, endIndex );
+
+		} else if ( referenceTime >= referenceTrack.times[ lastIndex ] ) {
+
+			// Reference frame is after the last keyframe, so just use the last keyframe
+			const startIndex = lastIndex * referenceValueSize + referenceOffset;
+			const endIndex = startIndex + referenceValueSize - referenceOffset;
+			referenceValue = referenceTrack.values.slice( startIndex, endIndex );
+
+		} else {
+
+			// Interpolate to the reference value
+			const interpolant = referenceTrack.createInterpolant();
+			const startIndex = referenceOffset;
+			const endIndex = referenceValueSize - referenceOffset;
+			interpolant.evaluate( referenceTime );
+			referenceValue = interpolant.resultBuffer.slice( startIndex, endIndex );
+
+		}
+
+		// Conjugate the quaternion
+		if ( referenceTrackType === 'quaternion' ) {
+
+			const referenceQuat = new Quaternion().fromArray( referenceValue ).normalize().conjugate();
+			referenceQuat.toArray( referenceValue );
+
+		}
+
+		// Subtract the reference value from all of the track values
+
+		const numTimes = targetTrack.times.length;
+		for ( let j = 0; j < numTimes; ++ j ) {
+
+			const valueStart = j * targetValueSize + targetOffset;
+
+			if ( referenceTrackType === 'quaternion' ) {
+
+				// Multiply the conjugate for quaternion track types
+				Quaternion.multiplyQuaternionsFlat(
+					targetTrack.values,
+					valueStart,
+					referenceValue,
+					0,
+					targetTrack.values,
+					valueStart
+				);
+
+			} else {
+
+				const valueEnd = targetValueSize - targetOffset * 2;
+
+				// Subtract each value for all other numeric track types
+				for ( let k = 0; k < valueEnd; ++ k ) {
+
+					targetTrack.values[ valueStart + k ] -= referenceValue[ k ];
+
+				}
+
+			}
+
+		}
+
+	}
+
+	targetClip.blendMode = AdditiveAnimationBlendMode;
+
+	return targetClip;
+
+}
+
+/**
+ * A class with various methods to assist with animations.
+ *
+ * @hideconstructor
+ */
+class AnimationUtils {
+
+	/**
+	 * Converts an array to a specific type
+	 *
+	 * @static
+	 * @param {TypedArray|Array} array - The array to convert.
+	 * @param {TypedArray.constructor} type - The constructor of a type array.
+	 * @return {TypedArray} The converted array
+	 */
+	static convertArray( array, type ) {
+
+		return convertArray( array, type );
+
+	}
+
+	/**
+	 * Returns `true` if the given object is a typed array.
+	 *
+	 * @static
+	 * @param {any} object - The object to check.
+	 * @return {boolean} Whether the given object is a typed array.
+	 */
+	static isTypedArray( object ) {
+
+		return isTypedArray( object );
+
+	}
+
+	/**
+	 * Returns `true` if the given keyframe track settings hold Bezier tangent data.
+	 *
+	 * @static
+	 * @param {?Object} settings - The settings of a keyframe track.
+	 * @return {boolean} Whether both tangent arrays are defined or not.
+	 */
+	static hasTangents( settings ) {
+
+		return hasTangents( settings );
+
+	}
+
+	/**
+	 * Returns an array by which times and values can be sorted.
+	 *
+	 * @static
+	 * @param {Array<number>} times - The keyframe time values.
+	 * @return {Array<number>} The array.
+	 */
+	static getKeyframeOrder( times ) {
+
+		return getKeyframeOrder( times );
+
+	}
+
+	/**
+	 * Sorts the given array by the previously computed order via `getKeyframeOrder()`.
+	 *
+	 * @static
+	 * @param {Array<number>} values - The values to sort.
+	 * @param {number} stride - The stride.
+	 * @param {Array<number>} order - The sort order.
+	 * @return {Array<number>} The sorted values.
+	 */
+	static sortedArray( values, stride, order ) {
+
+		return sortedArray( values, stride, order );
+
+	}
+
+	/**
+	 * Used for parsing AOS keyframe formats.
+	 *
+	 * @static
+	 * @param {Array<number>} jsonKeys - A list of JSON keyframes.
+	 * @param {Array<number>} times - This array will be filled with keyframe times by this method.
+	 * @param {Array<number>} values - This array will be filled with keyframe values by this method.
+	 * @param {string} valuePropertyName - The name of the property to use.
+	 */
+	static flattenJSON( jsonKeys, times, values, valuePropertyName ) {
+
+		flattenJSON( jsonKeys, times, values, valuePropertyName );
+
+	}
+
+	/**
+	 * Creates a new clip, containing only the segment of the original clip between the given frames.
+	 *
+	 * @static
+	 * @param {AnimationClip} sourceClip - The values to sort.
+	 * @param {string} name - The name of the clip.
+	 * @param {number} startFrame - The start frame.
+	 * @param {number} endFrame - The end frame.
+	 * @param {number} [fps=30] - The FPS.
+	 * @return {AnimationClip} The new sub clip.
+	 */
+	static subclip( sourceClip, name, startFrame, endFrame, fps = 30 ) {
+
+		return subclip( sourceClip, name, startFrame, endFrame, fps );
+
+	}
+
+	/**
+	 * Converts the keyframes of the given animation clip to an additive format.
+	 *
+	 * @static
+	 * @param {AnimationClip} targetClip - The clip to make additive.
+	 * @param {number} [referenceFrame=0] - The reference frame.
+	 * @param {AnimationClip} [referenceClip=targetClip] - The reference clip.
+	 * @param {number} [fps=30] - The FPS.
+	 * @return {AnimationClip} The updated clip which is now additive.
+	 */
+	static makeClipAdditive( targetClip, referenceFrame = 0, referenceClip = targetClip, fps = 30 ) {
+
+		return makeClipAdditive( targetClip, referenceFrame, referenceClip, fps );
+
+	}
+
+}
+
+/**
+ * Abstract base class of interpolants over parametric samples.
+ *
+ * The parameter domain is one dimensional, typically the time or a path
+ * along a curve defined by the data.
+ *
+ * The sample values can have any dimensionality and derived classes may
+ * apply special interpretations to the data.
+ *
+ * This class provides the interval seek in a Template Method, deferring
+ * the actual interpolation to derived classes.
+ *
+ * Time complexity is O(1) for linear access crossing at most two points
+ * and O(log N) for random access, where N is the number of positions.
+ *
+ * References: {@link http://www.oodesign.com/template-method-pattern.html}
+ *
+ * @abstract
+ */
+class Interpolant {
+
+	/**
+	 * Constructs a new interpolant.
+	 *
+	 * @param {TypedArray} parameterPositions - The parameter positions hold the interpolation factors.
+	 * @param {TypedArray} sampleValues - The sample values.
+	 * @param {number} sampleSize - The sample size
+	 * @param {TypedArray} [resultBuffer] - The result buffer.
+	 */
+	constructor( parameterPositions, sampleValues, sampleSize, resultBuffer ) {
+
+		/**
+		 * The parameter positions.
+		 *
+		 * @type {TypedArray}
+		 */
+		this.parameterPositions = parameterPositions;
+
+		/**
+		 * A cache index.
+		 *
+		 * @private
+		 * @type {number}
+		 * @default 0
+		 */
+		this._cachedIndex = 0;
+
+		/**
+		 * The result buffer.
+		 *
+		 * @type {TypedArray}
+		 */
+		this.resultBuffer = resultBuffer !== undefined ? resultBuffer : new sampleValues.constructor( sampleSize );
+
+		/**
+		 * The sample values.
+		 *
+		 * @type {TypedArray}
+		 */
+		this.sampleValues = sampleValues;
+
+		/**
+		 * The value size.
+		 *
+		 * @type {TypedArray}
+		 */
+		this.valueSize = sampleSize;
+
+		/**
+		 * The interpolation settings.
+		 *
+		 * @type {?Object}
+		 * @default null
+		 */
+		this.settings = null;
+
+		/**
+		 * The default settings object.
+		 *
+		 * @type {Object}
+		 */
+		this.DefaultSettings_ = {};
+
+	}
+
+	/**
+	 * Evaluate the interpolant at position `t`.
+	 *
+	 * @param {number} t - The interpolation factor.
+	 * @return {TypedArray} The result buffer.
+	 */
+	evaluate( t ) {
+
+		const pp = this.parameterPositions;
+		let i1 = this._cachedIndex,
+			t1 = pp[ i1 ],
+			t0 = pp[ i1 - 1 ];
+
+		validate_interval: {
+
+			seek: {
+
+				let right;
+
+				linear_scan: {
+
+					//- See http://jsperf.com/comparison-to-undefined/3
+					//- slower code:
+					//-
+					//- 				if ( t >= t1 || t1 === undefined ) {
+					forward_scan: if ( ! ( t < t1 ) ) {
+
+						for ( let giveUpAt = i1 + 2; ; ) {
+
+							if ( t1 === undefined ) {
+
+								if ( t < t0 ) break forward_scan;
+
+								// after end
+
+								i1 = pp.length;
+								this._cachedIndex = i1;
+								return this.copySampleValue_( i1 - 1 );
+
+							}
+
+							if ( i1 === giveUpAt ) break; // this loop
+
+							t0 = t1;
+							t1 = pp[ ++ i1 ];
+
+							if ( t < t1 ) {
+
+								// we have arrived at the sought interval
+								break seek;
+
+							}
+
+						}
+
+						// prepare binary search on the right side of the index
+						right = pp.length;
+						break linear_scan;
+
+					}
+
+					//- slower code:
+					//-					if ( t < t0 || t0 === undefined ) {
+					if ( ! ( t >= t0 ) ) {
+
+						// looping?
+
+						const t1global = pp[ 1 ];
+
+						if ( t < t1global ) {
+
+							i1 = 2; // + 1, using the scan for the details
+							t0 = t1global;
+
+						}
+
+						// linear reverse scan
+
+						for ( let giveUpAt = i1 - 2; ; ) {
+
+							if ( t0 === undefined ) {
+
+								// before start
+
+								this._cachedIndex = 0;
+								return this.copySampleValue_( 0 );
+
+							}
+
+							if ( i1 === giveUpAt ) break; // this loop
+
+							t1 = t0;
+							t0 = pp[ -- i1 - 1 ];
+
+							if ( t >= t0 ) {
+
+								// we have arrived at the sought interval
+								break seek;
+
+							}
+
+						}
+
+						// prepare binary search on the left side of the index
+						right = i1;
+						i1 = 0;
+						break linear_scan;
+
+					}
+
+					// the interval is valid
+
+					break validate_interval;
+
+				} // linear scan
+
+				// binary search
+
+				while ( i1 < right ) {
+
+					const mid = ( i1 + right ) >>> 1;
+
+					if ( t < pp[ mid ] ) {
+
+						right = mid;
+
+					} else {
+
+						i1 = mid + 1;
+
+					}
+
+				}
+
+				t1 = pp[ i1 ];
+				t0 = pp[ i1 - 1 ];
+
+				// check boundary cases, again
+
+				if ( t0 === undefined ) {
+
+					this._cachedIndex = 0;
+					return this.copySampleValue_( 0 );
+
+				}
+
+				if ( t1 === undefined ) {
+
+					i1 = pp.length;
+					this._cachedIndex = i1;
+					return this.copySampleValue_( i1 - 1 );
+
+				}
+
+			} // seek
+
+			this._cachedIndex = i1;
+
+			this.intervalChanged_( i1, t0, t1 );
+
+		} // validate_interval
+
+		return this.interpolate_( i1, t0, t, t1 );
+
+	}
+
+	/**
+	 * Returns the interpolation settings.
+	 *
+	 * @return {Object} The interpolation settings.
+	 */
+	getSettings_() {
+
+		return this.settings || this.DefaultSettings_;
+
+	}
+
+	/**
+	 * Copies a sample value to the result buffer.
+	 *
+	 * @param {number} index - An index into the sample value buffer.
+	 * @return {TypedArray} The result buffer.
+	 */
+	copySampleValue_( index ) {
+
+		// copies a sample value to the result buffer
+
+		const result = this.resultBuffer,
+			values = this.sampleValues,
+			stride = this.valueSize,
+			offset = index * stride;
+
+		for ( let i = 0; i !== stride; ++ i ) {
+
+			result[ i ] = values[ offset + i ];
+
+		}
+
+		return result;
+
+	}
+
+	/**
+	 * Copies a sample value to the result buffer.
+	 *
+	 * @abstract
+	 * @param {number} i1 - An index into the sample value buffer.
+	 * @param {number} t0 - The previous interpolation factor.
+	 * @param {number} t - The current interpolation factor.
+	 * @param {number} t1 - The next interpolation factor.
+	 * @return {TypedArray} The result buffer.
+	 */
+	interpolate_( /* i1, t0, t, t1 */ ) {
+
+		throw new Error( 'THREE.Interpolant: Call to abstract method.' );
+		// implementations shall return this.resultBuffer
+
+	}
+
+	/**
+	 * Optional method that is executed when the interval has changed.
+	 *
+	 * @param {number} i1 - An index into the sample value buffer.
+	 * @param {number} t0 - The previous interpolation factor.
+	 * @param {number} t - The current interpolation factor.
+	 */
+	intervalChanged_( /* i1, t0, t1 */ ) {
+
+		// empty
+
+	}
+
+}
+
+/**
+ * Fast and simple cubic spline interpolant.
+ *
+ * It was derived from a Hermitian construction setting the first derivative
+ * at each sample position to the linear slope between neighboring positions
+ * over their parameter interval.
+ *
+ * @augments Interpolant
+ */
+class CubicInterpolant extends Interpolant {
+
+	/**
+	 * Constructs a new cubic interpolant.
+	 *
+	 * @param {TypedArray} parameterPositions - The parameter positions hold the interpolation factors.
+	 * @param {TypedArray} sampleValues - The sample values.
+	 * @param {number} sampleSize - The sample size
+	 * @param {TypedArray} [resultBuffer] - The result buffer.
+	 */
+	constructor( parameterPositions, sampleValues, sampleSize, resultBuffer ) {
+
+		super( parameterPositions, sampleValues, sampleSize, resultBuffer );
+
+		this._weightPrev = -0;
+		this._offsetPrev = -0;
+		this._weightNext = -0;
+		this._offsetNext = -0;
+
+		this.DefaultSettings_ = {
+
+			endingStart: ZeroCurvatureEnding,
+			endingEnd: ZeroCurvatureEnding
+
+		};
+
+	}
+
+	intervalChanged_( i1, t0, t1 ) {
+
+		const pp = this.parameterPositions;
+		let iPrev = i1 - 2,
+			iNext = i1 + 1,
+
+			tPrev = pp[ iPrev ],
+			tNext = pp[ iNext ];
+
+		if ( tPrev === undefined ) {
+
+			switch ( this.getSettings_().endingStart ) {
+
+				case ZeroSlopeEnding:
+
+					// f'(t0) = 0
+					iPrev = i1;
+					tPrev = 2 * t0 - t1;
+
+					break;
+
+				case WrapAroundEnding:
+
+					// use the other end of the curve
+					iPrev = pp.length - 2;
+					tPrev = t0 + pp[ iPrev ] - pp[ iPrev + 1 ];
+
+					break;
+
+				default: // ZeroCurvatureEnding
+
+					// f''(t0) = 0 a.k.a. Natural Spline
+					iPrev = i1;
+					tPrev = t1;
+
+			}
+
+		}
+
+		if ( tNext === undefined ) {
+
+			switch ( this.getSettings_().endingEnd ) {
+
+				case ZeroSlopeEnding:
+
+					// f'(tN) = 0
+					iNext = i1;
+					tNext = 2 * t1 - t0;
+
+					break;
+
+				case WrapAroundEnding:
+
+					// use the other end of the curve
+					iNext = 1;
+					tNext = t1 + pp[ 1 ] - pp[ 0 ];
+
+					break;
+
+				default: // ZeroCurvatureEnding
+
+					// f''(tN) = 0, a.k.a. Natural Spline
+					iNext = i1 - 1;
+					tNext = t0;
+
+			}
+
+		}
+
+		const halfDt = ( t1 - t0 ) * 0.5,
+			stride = this.valueSize;
+
+		this._weightPrev = halfDt / ( t0 - tPrev );
+		this._weightNext = halfDt / ( tNext - t1 );
+		this._offsetPrev = iPrev * stride;
+		this._offsetNext = iNext * stride;
+
+	}
+
+	interpolate_( i1, t0, t, t1 ) {
+
+		const result = this.resultBuffer,
+			values = this.sampleValues,
+			stride = this.valueSize,
+
+			o1 = i1 * stride,		o0 = o1 - stride,
+			oP = this._offsetPrev, 	oN = this._offsetNext,
+			wP = this._weightPrev,	wN = this._weightNext,
+
+			p = ( t - t0 ) / ( t1 - t0 ),
+			pp = p * p,
+			ppp = pp * p;
+
+		// evaluate polynomials
+
+		const sP = - wP * ppp + 2 * wP * pp - wP * p;
+		const s0 = ( 1 + wP ) * ppp + ( -1.5 - 2 * wP ) * pp + ( -0.5 + wP ) * p + 1;
+		const s1 = ( -1 - wN ) * ppp + ( 1.5 + wN ) * pp + 0.5 * p;
+		const sN = wN * ppp - wN * pp;
+
+		// combine data linearly
+
+		for ( let i = 0; i !== stride; ++ i ) {
+
+			result[ i ] =
+					sP * values[ oP + i ] +
+					s0 * values[ o0 + i ] +
+					s1 * values[ o1 + i ] +
+					sN * values[ oN + i ];
+
+		}
+
+		return result;
+
+	}
+
+}
+
+/**
+ * A basic linear interpolant.
+ *
+ * @augments Interpolant
+ */
+class LinearInterpolant extends Interpolant {
+
+	/**
+	 * Constructs a new linear interpolant.
+	 *
+	 * @param {TypedArray} parameterPositions - The parameter positions hold the interpolation factors.
+	 * @param {TypedArray} sampleValues - The sample values.
+	 * @param {number} sampleSize - The sample size
+	 * @param {TypedArray} [resultBuffer] - The result buffer.
+	 */
+	constructor( parameterPositions, sampleValues, sampleSize, resultBuffer ) {
+
+		super( parameterPositions, sampleValues, sampleSize, resultBuffer );
+
+	}
+
+	interpolate_( i1, t0, t, t1 ) {
+
+		const result = this.resultBuffer,
+			values = this.sampleValues,
+			stride = this.valueSize,
+
+			offset1 = i1 * stride,
+			offset0 = offset1 - stride,
+
+			weight1 = ( t - t0 ) / ( t1 - t0 ),
+			weight0 = 1 - weight1;
+
+		for ( let i = 0; i !== stride; ++ i ) {
+
+			result[ i ] =
+					values[ offset0 + i ] * weight0 +
+					values[ offset1 + i ] * weight1;
+
+		}
+
+		return result;
+
+	}
+
+}
+
+/**
+ * Interpolant that evaluates to the sample value at the position preceding
+ * the parameter.
+ *
+ * @augments Interpolant
+ */
+class DiscreteInterpolant extends Interpolant {
+
+	/**
+	 * Constructs a new discrete interpolant.
+	 *
+	 * @param {TypedArray} parameterPositions - The parameter positions hold the interpolation factors.
+	 * @param {TypedArray} sampleValues - The sample values.
+	 * @param {number} sampleSize - The sample size
+	 * @param {TypedArray} [resultBuffer] - The result buffer.
+	 */
+	constructor( parameterPositions, sampleValues, sampleSize, resultBuffer ) {
+
+		super( parameterPositions, sampleValues, sampleSize, resultBuffer );
+
+	}
+
+	interpolate_( i1 /*, t0, t, t1 */ ) {
+
+		return this.copySampleValue_( i1 - 1 );
+
+	}
+
+}
+
+/**
+ * A Bezier interpolant using cubic Bezier curves with 2D control points.
+ *
+ * This interpolant supports the COLLADA/Maya style of Bezier animation where
+ * each keyframe has explicit in/out tangent control points specified as
+ * 2D coordinates (time, value).
+ *
+ * Tangent data is read from `inTangents` and `outTangents` on the interpolant
+ * (populated by `KeyframeTrack.InterpolantFactoryMethodBezier`).
+ *
+ * For a track with N keyframes and stride S:
+ * - Each tangent array has N * S * 2 values
+ * - Layout: [k0_c0_time, k0_c0_value, k0_c1_time, k0_c1_value, ..., k0_cS_time, k0_cS_value,
+ *            k1_c0_time, k1_c0_value, ...]
+ *
+ * @augments Interpolant
+ */
+class BezierInterpolant extends Interpolant {
+
+	interpolate_( i1, t0, t, t1 ) {
+
+		const result = this.resultBuffer;
+		const values = this.sampleValues;
+		const stride = this.valueSize;
+
+		const offset1 = i1 * stride;
+		const offset0 = offset1 - stride;
+
+		const inTangents = this.inTangents;
+		const outTangents = this.outTangents;
+
+		// If no tangent data, fall back to linear interpolation
+		if ( ! inTangents || ! outTangents ) {
+
+			const weight1 = ( t - t0 ) / ( t1 - t0 );
+			const weight0 = 1 - weight1;
+
+			for ( let i = 0; i !== stride; ++ i ) {
+
+				result[ i ] = values[ offset0 + i ] * weight0 + values[ offset1 + i ] * weight1;
+
+			}
+
+			return result;
+
+		}
+
+		const tangentStride = stride * 2;
+		const i0 = i1 - 1;
+
+		for ( let i = 0; i !== stride; ++ i ) {
+
+			const v0 = values[ offset0 + i ];
+			const v1 = values[ offset1 + i ];
+
+			// outTangent of previous keyframe (C0)
+			const outTangentOffset = i0 * tangentStride + i * 2;
+			const c0x = outTangents[ outTangentOffset ];
+			const c0y = outTangents[ outTangentOffset + 1 ];
+
+			// inTangent of current keyframe (C1)
+			const inTangentOffset = i1 * tangentStride + i * 2;
+			const c1x = inTangents[ inTangentOffset ];
+			const c1y = inTangents[ inTangentOffset + 1 ];
+
+			// Find the curve parameter s where the Bezier X(s) matches t, then evaluate Y(s)
+			const s = solveBezierParameter( t, t0, c0x, c1x, t1 );
+
+			result[ i ] = cubicBezier( s, v0, c0y, c1y, v1 );
+
+		}
+
+		return result;
+
+	}
+
+}
+
+function cubicBezier( s, p0, p1, p2, p3 ) {
+
+	const k = 1 - s;
+
+	return k * k * k * p0 + 3 * k * k * s * p1 + 3 * k * s * s * p2 + s * s * s * p3;
+
+}
+
+function cubicBezierSlope( s, p0, p1, p2, p3 ) {
+
+	const k = 1 - s;
+
+	return 3 * k * k * ( p1 - p0 ) + 6 * k * s * ( p2 - p1 ) + 3 * s * s * ( p3 - p2 );
+
+}
+
+// Solves cubicBezier( s, x0, x1, x2, x3 ) = x for s in [0,1] using Newton-Raphson
+
+function solveBezierParameter( x, x0, x1, x2, x3 ) {
+
+	let s = ( x - x0 ) / ( x3 - x0 );
+
+	for ( let i = 0; i < 8; i ++ ) {
+
+		const error = cubicBezier( s, x0, x1, x2, x3 ) - x;
+		if ( Math.abs( error ) < 1e-10 ) break;
+
+		const slope = cubicBezierSlope( s, x0, x1, x2, x3 );
+		if ( Math.abs( slope ) < 1e-10 ) break;
+
+		s = Math.max( 0, Math.min( 1, s - error / slope ) );
+
+	}
+
+	return s;
+
+}
+
+/**
+ * Represents a timed sequence of keyframes, which are composed of lists of
+ * times and related values, and which are used to animate a specific property
+ * of an object.
+ */
+class KeyframeTrack {
+
+	/**
+	 * Constructs a new keyframe track.
+	 *
+	 * @param {string} name - The keyframe track's name.
+	 * @param {Array<number>} times - A list of keyframe times.
+	 * @param {Array<number|string|boolean>} values - A list of keyframe values.
+	 * @param {(InterpolateLinear|InterpolateDiscrete|InterpolateSmooth|InterpolateBezier)} [interpolation] - The interpolation type.
+	 */
+	constructor( name, times, values, interpolation ) {
+
+		if ( name === undefined ) throw new Error( 'THREE.KeyframeTrack: track name is undefined' );
+		if ( times === undefined || times.length === 0 ) throw new Error( 'THREE.KeyframeTrack: no keyframes in track named ' + name );
+
+		/**
+		 * The track's name can refer to morph targets or bones or
+		 * possibly other values within an animated object. See {@link PropertyBinding#parseTrackName}
+		 * for the forms of strings that can be parsed for property binding.
+		 *
+		 * @type {string}
+		 */
+		this.name = name;
+
+		/**
+		 * The keyframe times.
+		 *
+		 * @type {Float32Array}
+		 */
+		this.times = convertArray( times, this.TimeBufferType );
+
+		/**
+		 * The keyframe values.
+		 *
+		 * @type {Float32Array}
+		 */
+		this.values = convertArray( values, this.ValueBufferType );
+
+		this.setInterpolation( interpolation || this.DefaultInterpolation );
+
+	}
+
+	/**
+	 * Converts the keyframe track to JSON.
+	 *
+	 * @static
+	 * @param {KeyframeTrack} track - The keyframe track to serialize.
+	 * @return {Object} The serialized keyframe track as JSON.
+	 */
+	static toJSON( track ) {
+
+		const trackType = track.constructor;
+
+		let json;
+
+		// derived classes can define a static toJSON method
+		if ( trackType.toJSON !== this.toJSON ) {
+
+			json = trackType.toJSON( track );
+
+		} else {
+
+			// by default, we assume the data can be serialized as-is
+			json = {
+
+				'name': track.name,
+				'times': convertArray( track.times, Array ),
+				'values': convertArray( track.values, Array )
+
+			};
+
+			const interpolation = track.getInterpolation();
+
+			if ( interpolation !== track.DefaultInterpolation ) {
+
+				json.interpolation = interpolation;
+
+			}
+
+			if ( hasTangents( track.settings ) ) {
+
+				json.settings = {
+					inTangents: convertArray( track.settings.inTangents, Array ),
+					outTangents: convertArray( track.settings.outTangents, Array )
+				};
+
+			}
+
+		}
+
+		json.type = track.ValueTypeName; // mandatory
+
+		return json;
+
+	}
+
+	/**
+	 * Factory method for creating a new discrete interpolant.
+	 *
+	 * @static
+	 * @param {TypedArray} [result] - The result buffer.
+	 * @return {DiscreteInterpolant} The new interpolant.
+	 */
+	InterpolantFactoryMethodDiscrete( result ) {
+
+		return new DiscreteInterpolant( this.times, this.values, this.getValueSize(), result );
+
+	}
+
+	/**
+	 * Factory method for creating a new linear interpolant.
+	 *
+	 * @static
+	 * @param {TypedArray} [result] - The result buffer.
+	 * @return {LinearInterpolant} The new interpolant.
+	 */
+	InterpolantFactoryMethodLinear( result ) {
+
+		return new LinearInterpolant( this.times, this.values, this.getValueSize(), result );
+
+	}
+
+	/**
+	 * Factory method for creating a new smooth interpolant.
+	 *
+	 * @static
+	 * @param {TypedArray} [result] - The result buffer.
+	 * @return {CubicInterpolant} The new interpolant.
+	 */
+	InterpolantFactoryMethodSmooth( result ) {
+
+		return new CubicInterpolant( this.times, this.values, this.getValueSize(), result );
+
+	}
+
+	/**
+	 * Factory method for creating a new Bezier interpolant.
+	 *
+	 * The Bezier interpolant requires tangent data to be set via the `settings` property
+	 * on the track before creating the interpolant. The settings should contain:
+	 * - `inTangents`: Float32Array with [time, value] pairs per keyframe per component
+	 * - `outTangents`: Float32Array with [time, value] pairs per keyframe per component
+	 *
+	 * @static
+	 * @param {TypedArray} [result] - The result buffer.
+	 * @return {BezierInterpolant} The new interpolant.
+	 */
+	InterpolantFactoryMethodBezier( result ) {
+
+		const interpolant = new BezierInterpolant( this.times, this.values, this.getValueSize(), result );
+
+		if ( this.settings ) {
+
+			interpolant.inTangents = this.settings.inTangents;
+			interpolant.outTangents = this.settings.outTangents;
+
+		}
+
+		return interpolant;
+
+	}
+
+	/**
+	 * Defines the interpolation factor method for this keyframe track.
+	 *
+	 * @param {(InterpolateLinear|InterpolateDiscrete|InterpolateSmooth|InterpolateBezier)} interpolation - The interpolation type.
+	 * @return {KeyframeTrack} A reference to this keyframe track.
+	 */
+	setInterpolation( interpolation ) {
+
+		let factoryMethod;
+
+		switch ( interpolation ) {
+
+			case InterpolateDiscrete:
+
+				factoryMethod = this.InterpolantFactoryMethodDiscrete;
+
+				break;
+
+			case InterpolateLinear:
+
+				factoryMethod = this.InterpolantFactoryMethodLinear;
+
+				break;
+
+			case InterpolateSmooth:
+
+				factoryMethod = this.InterpolantFactoryMethodSmooth;
+
+				break;
+
+			case InterpolateBezier:
+
+				factoryMethod = this.InterpolantFactoryMethodBezier;
+
+				break;
+
+		}
+
+		if ( factoryMethod === undefined ) {
+
+			const message = 'unsupported interpolation for ' +
+				this.ValueTypeName + ' keyframe track named ' + this.name;
+
+			if ( this.createInterpolant === undefined ) {
+
+				// fall back to default, unless the default itself is messed up
+				if ( interpolation !== this.DefaultInterpolation ) {
+
+					this.setInterpolation( this.DefaultInterpolation );
+
+				} else {
+
+					throw new Error( message ); // fatal, in this case
+
+				}
+
+			}
+
+			warn( 'KeyframeTrack:', message );
+			return this;
+
+		}
+
+		this.createInterpolant = factoryMethod;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the current interpolation type.
+	 *
+	 * @return {(InterpolateLinear|InterpolateDiscrete|InterpolateSmooth|InterpolateBezier)} The interpolation type.
+	 */
+	getInterpolation() {
+
+		switch ( this.createInterpolant ) {
+
+			case this.InterpolantFactoryMethodDiscrete:
+
+				return InterpolateDiscrete;
+
+			case this.InterpolantFactoryMethodLinear:
+
+				return InterpolateLinear;
+
+			case this.InterpolantFactoryMethodSmooth:
+
+				return InterpolateSmooth;
+
+			case this.InterpolantFactoryMethodBezier:
+
+				return InterpolateBezier;
+
+		}
+
+	}
+
+	/**
+	 * Returns the value size.
+	 *
+	 * @return {number} The value size.
+	 */
+	getValueSize() {
+
+		return this.values.length / this.times.length;
+
+	}
+
+	/**
+	 * Moves all keyframes either forward or backward in time.
+	 *
+	 * @param {number} timeOffset - The offset to move the time values.
+	 * @return {KeyframeTrack} A reference to this keyframe track.
+	 */
+	shift( timeOffset ) {
+
+		if ( timeOffset !== 0.0 ) {
+
+			const times = this.times;
+
+			for ( let i = 0, n = times.length; i !== n; ++ i ) {
+
+				times[ i ] += timeOffset;
+
+			}
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Scale all keyframe times by a factor (useful for frame - seconds conversions).
+	 *
+	 * @param {number} timeScale - The time scale.
+	 * @return {KeyframeTrack} A reference to this keyframe track.
+	 */
+	scale( timeScale ) {
+
+		if ( timeScale !== 1.0 ) {
+
+			const times = this.times;
+
+			for ( let i = 0, n = times.length; i !== n; ++ i ) {
+
+				times[ i ] *= timeScale;
+
+			}
+
+			if ( hasTangents( this.settings ) ) {
+
+				scaleTangentTimes( this.settings.inTangents, timeScale );
+				scaleTangentTimes( this.settings.outTangents, timeScale );
+
+			}
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Removes keyframes before and after animation without changing any values within the defined time range.
+	 *
+	 * Note: The method does not shift around keys to the start of the track time, because for interpolated
+	 * keys this will change their values
+	 *
+	 * @param {number} startTime - The start time.
+	 * @param {number} endTime - The end time.
+	 * @return {KeyframeTrack} A reference to this keyframe track.
+	 */
+	trim( startTime, endTime ) {
+
+		const times = this.times,
+			nKeys = times.length;
+
+		let from = 0,
+			to = nKeys - 1;
+
+		while ( from !== nKeys && times[ from ] < startTime ) {
+
+			++ from;
+
+		}
+
+		while ( to !== -1 && times[ to ] > endTime ) {
+
+			-- to;
+
+		}
+
+		++ to; // inclusive -> exclusive bound
+
+		if ( from !== 0 || to !== nKeys ) {
+
+			// empty tracks are forbidden, so keep at least one keyframe
+			if ( from >= to ) {
+
+				to = Math.max( to, 1 );
+				from = to - 1;
+
+			}
+
+			const stride = this.getValueSize();
+			this.times = times.slice( from, to );
+			this.values = this.values.slice( from * stride, to * stride );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Performs minimal validation on the keyframe track. Returns `true` if the values
+	 * are valid.
+	 *
+	 * @return {boolean} Whether the keyframes are valid or not.
+	 */
+	validate() {
+
+		let valid = true;
+
+		const valueSize = this.getValueSize();
+		if ( valueSize - Math.floor( valueSize ) !== 0 ) {
+
+			error( 'KeyframeTrack: Invalid value size in track.', this );
+			valid = false;
+
+		}
+
+		const times = this.times,
+			values = this.values,
+
+			nKeys = times.length;
+
+		if ( nKeys === 0 ) {
+
+			error( 'KeyframeTrack: Track is empty.', this );
+			valid = false;
+
+		}
+
+		let prevTime = null;
+
+		for ( let i = 0; i !== nKeys; i ++ ) {
+
+			const currTime = times[ i ];
+
+			if ( typeof currTime === 'number' && isNaN( currTime ) ) {
+
+				error( 'KeyframeTrack: Time is not a valid number.', this, i, currTime );
+				valid = false;
+				break;
+
+			}
+
+			if ( prevTime !== null && prevTime > currTime ) {
+
+				error( 'KeyframeTrack: Out of order keys.', this, i, currTime, prevTime );
+				valid = false;
+				break;
+
+			}
+
+			prevTime = currTime;
+
+		}
+
+		if ( values !== undefined ) {
+
+			if ( isTypedArray( values ) ) {
+
+				for ( let i = 0, n = values.length; i !== n; ++ i ) {
+
+					const value = values[ i ];
+
+					if ( isNaN( value ) ) {
+
+						error( 'KeyframeTrack: Value is not a valid number.', this, i, value );
+						valid = false;
+						break;
+
+					}
+
+				}
+
+			}
+
+		}
+
+		return valid;
+
+	}
+
+	/**
+	 * Optimizes this keyframe track by removing equivalent sequential keys (which are
+	 * common in morph target sequences).
+	 *
+	 * @return {KeyframeTrack} A reference to this keyframe track.
+	 */
+	optimize() {
+
+		// (0,0,0,0,1,1,1,0,0,0,0,0,0,0) --> (0,0,1,1,0,0)
+
+		// times or values may be shared with other tracks, so overwriting is unsafe
+		const times = this.times.slice(),
+			values = this.values.slice(),
+			stride = this.getValueSize(),
+
+			smoothInterpolation = this.getInterpolation() === InterpolateSmooth,
+
+			lastIndex = times.length - 1;
+
+		let writeIndex = 1;
+
+		for ( let i = 1; i < lastIndex; ++ i ) {
+
+			let keep = false;
+
+			const time = times[ i ];
+			const timeNext = times[ i + 1 ];
+
+			// remove adjacent keyframes scheduled at the same time
+
+			if ( time !== timeNext && ( i !== 1 || time !== times[ 0 ] ) ) {
+
+				if ( ! smoothInterpolation ) {
+
+					// remove unnecessary keyframes same as their neighbors
+
+					const offset = i * stride,
+						offsetP = offset - stride,
+						offsetN = offset + stride;
+
+					for ( let j = 0; j !== stride; ++ j ) {
+
+						const value = values[ offset + j ];
+
+						if ( value !== values[ offsetP + j ] ||
+							value !== values[ offsetN + j ] ) {
+
+							keep = true;
+							break;
+
+						}
+
+					}
+
+				} else {
+
+					keep = true;
+
+				}
+
+			}
+
+			// in-place compaction
+
+			if ( keep ) {
+
+				if ( i !== writeIndex ) {
+
+					times[ writeIndex ] = times[ i ];
+
+					const readOffset = i * stride,
+						writeOffset = writeIndex * stride;
+
+					for ( let j = 0; j !== stride; ++ j ) {
+
+						values[ writeOffset + j ] = values[ readOffset + j ];
+
+					}
+
+				}
+
+				++ writeIndex;
+
+			}
+
+		}
+
+		// flush last keyframe (compaction looks ahead)
+
+		if ( lastIndex > 0 ) {
+
+			times[ writeIndex ] = times[ lastIndex ];
+
+			for ( let readOffset = lastIndex * stride, writeOffset = writeIndex * stride, j = 0; j !== stride; ++ j ) {
+
+				values[ writeOffset + j ] = values[ readOffset + j ];
+
+			}
+
+			++ writeIndex;
+
+		}
+
+		if ( writeIndex !== times.length ) {
+
+			this.times = times.slice( 0, writeIndex );
+			this.values = values.slice( 0, writeIndex * stride );
+
+		} else {
+
+			this.times = times;
+			this.values = values;
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new keyframe track with copied values from this instance.
+	 *
+	 * @return {KeyframeTrack} A clone of this instance.
+	 */
+	clone() {
+
+		const times = this.times.slice();
+		const values = this.values.slice();
+
+		const TypedKeyframeTrack = this.constructor;
+		const track = new TypedKeyframeTrack( this.name, times, values );
+
+		// Interpolant argument to constructor is not saved, so copy the factory method directly.
+		track.createInterpolant = this.createInterpolant;
+
+		if ( hasTangents( this.settings ) ) {
+
+			track.settings = {
+				inTangents: this.settings.inTangents.slice(),
+				outTangents: this.settings.outTangents.slice()
+			};
+
+		}
+
+		return track;
+
+	}
+
+}
+
+function scaleTangentTimes( tangents, timeScale ) {
+
+	// tangents are [ time, value ] pairs, so only every second entry is a time
+
+	for ( let i = 0, n = tangents.length; i !== n; i += 2 ) {
+
+		tangents[ i ] *= timeScale;
+
+	}
+
+}
+
+/**
+ * The value type name.
+ *
+ * @type {string}
+ * @default ''
+ */
+KeyframeTrack.prototype.ValueTypeName = '';
+
+/**
+ * The time buffer type of this keyframe track.
+ *
+ * @type {TypedArray|Array}
+ * @default Float32Array.constructor
+ */
+KeyframeTrack.prototype.TimeBufferType = Float32Array;
+
+/**
+ * The value buffer type of this keyframe track.
+ *
+ * @type {TypedArray|Array}
+ * @default Float32Array.constructor
+ */
+KeyframeTrack.prototype.ValueBufferType = Float32Array;
+
+/**
+ * The default interpolation type of this keyframe track.
+ *
+ * @type {(InterpolateLinear|InterpolateDiscrete|InterpolateSmooth|InterpolateBezier)}
+ * @default InterpolateLinear
+ */
+KeyframeTrack.prototype.DefaultInterpolation = InterpolateLinear;
+
+/**
+ * A track for boolean keyframe values.
+ *
+ * @augments KeyframeTrack
+ */
+class BooleanKeyframeTrack extends KeyframeTrack {
+
+	/**
+	 * Constructs a new boolean keyframe track.
+	 *
+	 * This keyframe track type has no `interpolation` parameter because the
+	 * interpolation is always discrete.
+	 *
+	 * @param {string} name - The keyframe track's name.
+	 * @param {Array<number>} times - A list of keyframe times.
+	 * @param {Array<boolean>} values - A list of keyframe values.
+	 */
+	constructor( name, times, values ) {
+
+		super( name, times, values );
+
+	}
+
+}
+
+/**
+ * The value type name.
+ *
+ * @type {string}
+ * @default 'bool'
+ */
+BooleanKeyframeTrack.prototype.ValueTypeName = 'bool';
+
+/**
+ * The value buffer type of this keyframe track.
+ *
+ * @type {TypedArray|Array}
+ * @default Array.constructor
+ */
+BooleanKeyframeTrack.prototype.ValueBufferType = Array;
+
+/**
+ * The default interpolation type of this keyframe track.
+ *
+ * @type {(InterpolateLinear|InterpolateDiscrete|InterpolateSmooth)}
+ * @default InterpolateDiscrete
+ */
+BooleanKeyframeTrack.prototype.DefaultInterpolation = InterpolateDiscrete;
+BooleanKeyframeTrack.prototype.InterpolantFactoryMethodLinear = undefined;
+BooleanKeyframeTrack.prototype.InterpolantFactoryMethodSmooth = undefined;
+
+/**
+ * A track for color keyframe values.
+ *
+ * @augments KeyframeTrack
+ */
+class ColorKeyframeTrack extends KeyframeTrack {
+
+	/**
+	 * Constructs a new color keyframe track.
+	 *
+	 * @param {string} name - The keyframe track's name.
+	 * @param {Array<number>} times - A list of keyframe times.
+	 * @param {Array<number>} values - A list of keyframe values.
+	 * @param {(InterpolateLinear|InterpolateDiscrete|InterpolateSmooth)} [interpolation] - The interpolation type.
+	 */
+	constructor( name, times, values, interpolation ) {
+
+		super( name, times, values, interpolation );
+
+	}
+
+}
+
+/**
+ * The value type name.
+ *
+ * @type {string}
+ * @default 'color'
+ */
+ColorKeyframeTrack.prototype.ValueTypeName = 'color';
+
+/**
+ * A track for numeric keyframe values.
+ *
+ * @augments KeyframeTrack
+ */
+class NumberKeyframeTrack extends KeyframeTrack {
+
+	/**
+	 * Constructs a new number keyframe track.
+	 *
+	 * @param {string} name - The keyframe track's name.
+	 * @param {Array<number>} times - A list of keyframe times.
+	 * @param {Array<number>} values - A list of keyframe values.
+	 * @param {(InterpolateLinear|InterpolateDiscrete|InterpolateSmooth)} [interpolation] - The interpolation type.
+	 */
+	constructor( name, times, values, interpolation ) {
+
+		super( name, times, values, interpolation );
+
+	}
+
+}
+
+/**
+ * The value type name.
+ *
+ * @type {string}
+ * @default 'number'
+ */
+NumberKeyframeTrack.prototype.ValueTypeName = 'number';
+
+/**
+ * Spherical linear unit quaternion interpolant.
+ *
+ * @augments Interpolant
+ */
+class QuaternionLinearInterpolant extends Interpolant {
+
+	/**
+	 * Constructs a new SLERP interpolant.
+	 *
+	 * @param {TypedArray} parameterPositions - The parameter positions hold the interpolation factors.
+	 * @param {TypedArray} sampleValues - The sample values.
+	 * @param {number} sampleSize - The sample size
+	 * @param {TypedArray} [resultBuffer] - The result buffer.
+	 */
+	constructor( parameterPositions, sampleValues, sampleSize, resultBuffer ) {
+
+		super( parameterPositions, sampleValues, sampleSize, resultBuffer );
+
+	}
+
+	interpolate_( i1, t0, t, t1 ) {
+
+		const result = this.resultBuffer,
+			values = this.sampleValues,
+			stride = this.valueSize,
+
+			alpha = ( t - t0 ) / ( t1 - t0 );
+
+		let offset = i1 * stride;
+
+		for ( let end = offset + stride; offset !== end; offset += 4 ) {
+
+			Quaternion.slerpFlat( result, 0, values, offset - stride, values, offset, alpha );
+
+		}
+
+		return result;
+
+	}
+
+}
+
+/**
+ * A track for Quaternion keyframe values.
+ *
+ * @augments KeyframeTrack
+ */
+class QuaternionKeyframeTrack extends KeyframeTrack {
+
+	/**
+	 * Constructs a new Quaternion keyframe track.
+	 *
+	 * @param {string} name - The keyframe track's name.
+	 * @param {Array<number>} times - A list of keyframe times.
+	 * @param {Array<number>} values - A list of keyframe values.
+	 * @param {(InterpolateLinear|InterpolateDiscrete|InterpolateSmooth)} [interpolation] - The interpolation type.
+	 */
+	constructor( name, times, values, interpolation ) {
+
+		super( name, times, values, interpolation );
+
+	}
+
+	/**
+	 * Overwritten so the method returns Quaternion based interpolant.
+	 *
+	 * @static
+	 * @param {TypedArray} [result] - The result buffer.
+	 * @return {QuaternionLinearInterpolant} The new interpolant.
+	 */
+	InterpolantFactoryMethodLinear( result ) {
+
+		return new QuaternionLinearInterpolant( this.times, this.values, this.getValueSize(), result );
+
+	}
+
+}
+
+/**
+ * The value type name.
+ *
+ * @type {string}
+ * @default 'quaternion'
+ */
+QuaternionKeyframeTrack.prototype.ValueTypeName = 'quaternion';
+// ValueBufferType is inherited
+// DefaultInterpolation is inherited;
+QuaternionKeyframeTrack.prototype.InterpolantFactoryMethodSmooth = undefined;
+
+/**
+ * A track for string keyframe values.
+ *
+ * @augments KeyframeTrack
+ */
+class StringKeyframeTrack extends KeyframeTrack {
+
+	/**
+	 * Constructs a new string keyframe track.
+	 *
+	 * This keyframe track type has no `interpolation` parameter because the
+	 * interpolation is always discrete.
+	 *
+	 * @param {string} name - The keyframe track's name.
+	 * @param {Array<number>} times - A list of keyframe times.
+	 * @param {Array<string>} values - A list of keyframe values.
+	 */
+	constructor( name, times, values ) {
+
+		super( name, times, values );
+
+	}
+
+}
+
+/**
+ * The value type name.
+ *
+ * @type {string}
+ * @default 'string'
+ */
+StringKeyframeTrack.prototype.ValueTypeName = 'string';
+
+/**
+ * The value buffer type of this keyframe track.
+ *
+ * @type {TypedArray|Array}
+ * @default Array.constructor
+ */
+StringKeyframeTrack.prototype.ValueBufferType = Array;
+
+/**
+ * The default interpolation type of this keyframe track.
+ *
+ * @type {(InterpolateLinear|InterpolateDiscrete|InterpolateSmooth)}
+ * @default InterpolateDiscrete
+ */
+StringKeyframeTrack.prototype.DefaultInterpolation = InterpolateDiscrete;
+StringKeyframeTrack.prototype.InterpolantFactoryMethodLinear = undefined;
+StringKeyframeTrack.prototype.InterpolantFactoryMethodSmooth = undefined;
+
+/**
+ * A track for vector keyframe values.
+ *
+ * @augments KeyframeTrack
+ */
+class VectorKeyframeTrack extends KeyframeTrack {
+
+	/**
+	 * Constructs a new vector keyframe track.
+	 *
+	 * @param {string} name - The keyframe track's name.
+	 * @param {Array<number>} times - A list of keyframe times.
+	 * @param {Array<number>} values - A list of keyframe values.
+	 * @param {(InterpolateLinear|InterpolateDiscrete|InterpolateSmooth)} [interpolation] - The interpolation type.
+	 */
+	constructor( name, times, values, interpolation ) {
+
+		super( name, times, values, interpolation );
+
+	}
+
+}
+
+/**
+ * The value type name.
+ *
+ * @type {string}
+ * @default 'vector'
+ */
+VectorKeyframeTrack.prototype.ValueTypeName = 'vector';
+
+/**
+ * A reusable set of keyframe tracks which represent an animation.
+ */
+class AnimationClip {
+
+	/**
+	 * Constructs a new animation clip.
+	 *
+	 * Note: Instead of instantiating an AnimationClip directly with the constructor, you can
+	 * use the static interface of this class for creating clips. In most cases though, animation clips
+	 * will automatically be created by loaders when importing animated 3D assets.
+	 *
+	 * @param {string} [name=''] - The clip's name.
+	 * @param {number} [duration=-1] - The clip's duration in seconds. If a negative value is passed,
+	 * the duration will be calculated from the passed keyframes.
+	 * @param {Array<KeyframeTrack>} tracks - An array of keyframe tracks.
+	 * @param {(NormalAnimationBlendMode|AdditiveAnimationBlendMode)} [blendMode=NormalAnimationBlendMode] - Defines how the animation
+	 * is blended/combined when two or more animations are simultaneously played.
+	 */
+	constructor( name = '', duration = -1, tracks = [], blendMode = NormalAnimationBlendMode ) {
+
+		/**
+		 * The clip's name.
+		 *
+		 * @type {string}
+		 */
+		this.name = name;
+
+		/**
+		 *  An array of keyframe tracks.
+		 *
+		 * @type {Array<KeyframeTrack>}
+		 */
+		this.tracks = tracks;
+
+		/**
+		 * The clip's duration in seconds.
+		 *
+		 * @type {number}
+		 */
+		this.duration = duration;
+
+		/**
+		 * Defines how the animation is blended/combined when two or more animations
+		 * are simultaneously played.
+		 *
+		 * @type {(NormalAnimationBlendMode|AdditiveAnimationBlendMode)}
+		 */
+		this.blendMode = blendMode;
+
+		/**
+		 * The UUID of the animation clip.
+		 *
+		 * @type {string}
+		 * @readonly
+		 */
+		this.uuid = generateUUID();
+
+		/**
+		 * An object that can be used to store custom data about the animation clip.
+		 * It should not hold references to functions as these will not be cloned.
+		 *
+		 * @type {Object}
+		 */
+		this.userData = {};
+
+		// this means it should figure out its duration by scanning the tracks
+		if ( this.duration < 0 ) {
+
+			this.resetDuration();
+
+		}
+
+	}
+
+	/**
+	 * Factory method for creating an animation clip from the given JSON.
+	 *
+	 * @static
+	 * @param {Object} json - The serialized animation clip.
+	 * @return {AnimationClip} The new animation clip.
+	 */
+	static parse( json ) {
+
+		const tracks = [],
+			jsonTracks = json.tracks,
+			frameTime = 1.0 / ( json.fps || 1.0 );
+
+		for ( let i = 0, n = jsonTracks.length; i !== n; ++ i ) {
+
+			tracks.push( parseKeyframeTrack( jsonTracks[ i ] ).scale( frameTime ) );
+
+		}
+
+		const clip = new this( json.name, json.duration, tracks, json.blendMode );
+		clip.uuid = json.uuid;
+
+		clip.userData = JSON.parse( json.userData || '{}' );
+
+		return clip;
+
+	}
+
+	/**
+	 * Serializes the given animation clip into JSON.
+	 *
+	 * @static
+	 * @param {AnimationClip} clip - The animation clip to serialize.
+	 * @return {Object} The JSON object.
+	 */
+	static toJSON( clip ) {
+
+		const tracks = [],
+			clipTracks = clip.tracks;
+
+		const json = {
+
+			'name': clip.name,
+			'duration': clip.duration,
+			'tracks': tracks,
+			'uuid': clip.uuid,
+			'blendMode': clip.blendMode,
+			'userData': JSON.stringify( clip.userData ),
+
+		};
+
+		for ( let i = 0, n = clipTracks.length; i !== n; ++ i ) {
+
+			tracks.push( KeyframeTrack.toJSON( clipTracks[ i ] ) );
+
+		}
+
+		return json;
+
+	}
+
+	/**
+	 * Returns a new animation clip from the passed morph targets array of a
+	 * geometry, taking a name and the number of frames per second.
+	 *
+	 * Note: The fps parameter is required, but the animation speed can be
+	 * overridden via {@link AnimationAction#setDuration}.
+	 *
+	 * @static
+	 * @param {string} name - The name of the animation clip.
+	 * @param {Array<Object>} morphTargetSequence - A sequence of morph targets.
+	 * @param {number} fps - The Frames-Per-Second value.
+	 * @param {boolean} noLoop - Whether the clip should be no loop or not.
+	 * @return {AnimationClip} The new animation clip.
+	 */
+	static CreateFromMorphTargetSequence( name, morphTargetSequence, fps, noLoop ) {
+
+		const numMorphTargets = morphTargetSequence.length;
+		const tracks = [];
+
+		for ( let i = 0; i < numMorphTargets; i ++ ) {
+
+			let times = [];
+			let values = [];
+
+			times.push(
+				( i + numMorphTargets - 1 ) % numMorphTargets,
+				i,
+				( i + 1 ) % numMorphTargets );
+
+			values.push( 0, 1, 0 );
+
+			const order = getKeyframeOrder( times );
+			times = sortedArray( times, 1, order );
+			values = sortedArray( values, 1, order );
+
+			// if there is a key at the first frame, duplicate it as the
+			// last frame as well for perfect loop.
+			if ( ! noLoop && times[ 0 ] === 0 ) {
+
+				times.push( numMorphTargets );
+				values.push( values[ 0 ] );
+
+			}
+
+			tracks.push(
+				new NumberKeyframeTrack(
+					'.morphTargetInfluences[' + morphTargetSequence[ i ].name + ']',
+					times, values
+				).scale( 1.0 / fps ) );
+
+		}
+
+		return new this( name, -1, tracks );
+
+	}
+
+	/**
+	 * Searches for an animation clip by name, taking as its first parameter
+	 * either an array of clips, or a mesh or geometry that contains an
+	 * array named "animations" property.
+	 *
+	 * @static
+	 * @param {(Array<AnimationClip>|Object3D)} objectOrClipArray - The array or object to search through.
+	 * @param {string} name - The name to search for.
+	 * @return {?AnimationClip} The found animation clip. Returns `null` if no clip has been found.
+	 */
+	static findByName( objectOrClipArray, name ) {
+
+		let clipArray = objectOrClipArray;
+
+		if ( ! Array.isArray( objectOrClipArray ) ) {
+
+			const o = objectOrClipArray;
+			clipArray = o.geometry && o.geometry.animations || o.animations;
+
+		}
+
+		for ( let i = 0; i < clipArray.length; i ++ ) {
+
+			if ( clipArray[ i ].name === name ) {
+
+				return clipArray[ i ];
+
+			}
+
+		}
+
+		return null;
+
+	}
+
+	/**
+	 * Returns an array of new AnimationClips created from the morph target
+	 * sequences of a geometry, trying to sort morph target names into
+	 * animation-group-based patterns like "Walk_001, Walk_002, Run_001, Run_002...".
+	 *
+	 * See {@link MD2Loader#parse} as an example for how the method should be used.
+	 *
+	 * @static
+	 * @param {Array<Object>} morphTargets - A sequence of morph targets.
+	 * @param {number} fps - The Frames-Per-Second value.
+	 * @param {boolean} noLoop - Whether the clip should be no loop or not.
+	 * @return {Array<AnimationClip>} An array of new animation clips.
+	 */
+	static CreateClipsFromMorphTargetSequences( morphTargets, fps, noLoop ) {
+
+		const animationToMorphTargets = {};
+
+		// tested with https://regex101.com/ on trick sequences
+		// such flamingo_flyA_003, flamingo_run1_003, crdeath0059
+		const pattern = /^([\w-]*?)([\d]+)$/;
+
+		// sort morph target names into animation groups based
+		// patterns like Walk_001, Walk_002, Run_001, Run_002
+		for ( let i = 0, il = morphTargets.length; i < il; i ++ ) {
+
+			const morphTarget = morphTargets[ i ];
+			const parts = morphTarget.name.match( pattern );
+
+			if ( parts && parts.length > 1 ) {
+
+				const name = parts[ 1 ];
+
+				let animationMorphTargets = animationToMorphTargets[ name ];
+
+				if ( ! animationMorphTargets ) {
+
+					animationToMorphTargets[ name ] = animationMorphTargets = [];
+
+				}
+
+				animationMorphTargets.push( morphTarget );
+
+			}
+
+		}
+
+		const clips = [];
+
+		for ( const name in animationToMorphTargets ) {
+
+			clips.push( this.CreateFromMorphTargetSequence( name, animationToMorphTargets[ name ], fps, noLoop ) );
+
+		}
+
+		return clips;
+
+	}
+
+	/**
+	 * Sets the duration of this clip to the duration of its longest keyframe track.
+	 *
+	 * @return {AnimationClip} A reference to this animation clip.
+	 */
+	resetDuration() {
+
+		const tracks = this.tracks;
+		let duration = 0;
+
+		for ( let i = 0, n = tracks.length; i !== n; ++ i ) {
+
+			const track = this.tracks[ i ];
+
+			duration = Math.max( duration, track.times[ track.times.length - 1 ] );
+
+		}
+
+		this.duration = duration;
+
+		return this;
+
+	}
+
+	/**
+	 * Trims all tracks to the clip's duration.
+	 *
+	 * @return {AnimationClip} A reference to this animation clip.
+	 */
+	trim() {
+
+		for ( let i = 0; i < this.tracks.length; i ++ ) {
+
+			this.tracks[ i ].trim( 0, this.duration );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Performs minimal validation on each track in the clip. Returns `true` if all
+	 * tracks are valid.
+	 *
+	 * @return {boolean} Whether the clip's keyframes are valid or not.
+	 */
+	validate() {
+
+		let valid = true;
+
+		for ( let i = 0; i < this.tracks.length; i ++ ) {
+
+			valid = valid && this.tracks[ i ].validate();
+
+		}
+
+		return valid;
+
+	}
+
+	/**
+	 * Optimizes each track by removing equivalent sequential keys (which are
+	 * common in morph target sequences).
+	 *
+	 * @return {AnimationClip} A reference to this animation clip.
+	 */
+	optimize() {
+
+		for ( let i = 0; i < this.tracks.length; i ++ ) {
+
+			this.tracks[ i ].optimize();
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new animation clip with copied values from this instance.
+	 *
+	 * @return {AnimationClip} A clone of this instance.
+	 */
+	clone() {
+
+		const tracks = [];
+
+		for ( let i = 0; i < this.tracks.length; i ++ ) {
+
+			tracks.push( this.tracks[ i ].clone() );
+
+		}
+
+		const clip = new this.constructor( this.name, this.duration, tracks, this.blendMode );
+
+		clip.userData = JSON.parse( JSON.stringify( this.userData ) );
+
+		return clip;
+
+	}
+
+	/**
+	 * Serializes this animation clip into JSON.
+	 *
+	 * @return {Object} The JSON object.
+	 */
+	toJSON() {
+
+		return this.constructor.toJSON( this );
+
+	}
+
+}
+
+function getTrackTypeForValueTypeName( typeName ) {
+
+	switch ( typeName.toLowerCase() ) {
+
+		case 'scalar':
+		case 'double':
+		case 'float':
+		case 'number':
+		case 'integer':
+
+			return NumberKeyframeTrack;
+
+		case 'vector':
+		case 'vector2':
+		case 'vector3':
+		case 'vector4':
+
+			return VectorKeyframeTrack;
+
+		case 'color':
+
+			return ColorKeyframeTrack;
+
+		case 'quaternion':
+
+			return QuaternionKeyframeTrack;
+
+		case 'bool':
+		case 'boolean':
+
+			return BooleanKeyframeTrack;
+
+		case 'string':
+
+			return StringKeyframeTrack;
+
+	}
+
+	throw new Error( 'THREE.KeyframeTrack: Unsupported typeName: ' + typeName );
+
+}
+
+function parseKeyframeTrack( json ) {
+
+	if ( json.type === undefined ) {
+
+		throw new Error( 'THREE.KeyframeTrack: track type undefined, can not parse' );
+
+	}
+
+	const trackType = getTrackTypeForValueTypeName( json.type );
+
+	if ( json.times === undefined ) {
+
+		const times = [], values = [];
+
+		flattenJSON( json.keys, times, values, 'value' );
+
+		json.times = times;
+		json.values = values;
+
+	}
+
+	let track;
+
+	// derived classes can define a static parse method
+	if ( trackType.parse !== undefined ) {
+
+		track = trackType.parse( json );
+
+	} else {
+
+		// by default, we assume a constructor compatible with the base
+		track = new trackType( json.name, json.times, json.values, json.interpolation );
+
+	}
+
+	if ( hasTangents( json.settings ) ) {
+
+		track.settings = {
+			inTangents: convertArray( json.settings.inTangents, Float32Array ),
+			outTangents: convertArray( json.settings.outTangents, Float32Array )
+		};
+
+	}
+
+	return track;
+
+}
+
+/**
+ * @class
+ * @classdesc A simple caching system, used internally by {@link FileLoader}.
+ * To enable caching across all loaders that use {@link FileLoader}, add `THREE.Cache.enabled = true.` once in your app.
+ * @hideconstructor
+ */
+const Cache = {
+
+	/**
+	 * Whether caching is enabled or not.
+	 *
+	 * @static
+	 * @type {boolean}
+	 * @default false
+	 */
+	enabled: false,
+
+	/**
+	 * A dictionary that holds cached files.
+	 *
+	 * @static
+	 * @type {Object<string,Object>}
+	 */
+	files: {},
+
+	/**
+	 * Adds a cache entry with a key to reference the file. If this key already
+	 * holds a file, it is overwritten.
+	 *
+	 * @static
+	 * @param {string} key - The key to reference the cached file.
+	 * @param {Object} file -  The file to be cached.
+	 */
+	add: function ( key, file ) {
+
+		if ( this.enabled === false ) return;
+
+		if ( isBlobURL( key ) ) return;
+
+		// log( 'Cache', 'Adding key:', key );
+
+		this.files[ key ] = file;
+
+	},
+
+	/**
+	 * Gets the cached value for the given key.
+	 *
+	 * @static
+	 * @param {string} key - The key to reference the cached file.
+	 * @return {Object|undefined} The cached file. If the key does not exist `undefined` is returned.
+	 */
+	get: function ( key ) {
+
+		if ( this.enabled === false ) return;
+
+		if ( isBlobURL( key ) ) return;
+
+		// log( 'Cache', 'Checking key:', key );
+
+		return this.files[ key ];
+
+	},
+
+	/**
+	 * Removes the cached file associated with the given key.
+	 *
+	 * @static
+	 * @param {string} key - The key to reference the cached file.
+	 */
+	remove: function ( key ) {
+
+		delete this.files[ key ];
+
+	},
+
+	/**
+	 * Remove all values from the cache.
+	 *
+	 * @static
+	 */
+	clear: function () {
+
+		this.files = {};
+
+	}
+
+};
+
+/**
+ * Returns true if the given cache key contains the blob: scheme.
+ *
+ * @private
+ * @param {string} key - The cache key.
+ * @return {boolean} Whether the given cache key contains the blob: scheme or not.
+ */
+function isBlobURL( key ) {
+
+	try {
+
+		const urlString = key.slice( key.indexOf( ':' ) + 1 ); // remove type identifier
+
+		const url = new URL( urlString );
+		return url.protocol === 'blob:';
+
+	} catch ( e ) {
+
+		// If the string is not a valid URL, it throws an error
+		return false;
+
+	}
+
+}
+
+/**
+ * Handles and keeps track of loaded and pending data. A default global
+ * instance of this class is created and used by loaders if not supplied
+ * manually.
+ *
+ * In general that should be sufficient, however there are times when it can
+ * be useful to have separate loaders - for example if you want to show
+ * separate loading bars for objects and textures.
+ *
+ * ```js
+ * const manager = new THREE.LoadingManager();
+ * manager.onLoad = () => console.log( 'Loading complete!' );
+ *
+ * const loader1 = new OBJLoader( manager );
+ * const loader2 = new ColladaLoader( manager );
+ * ```
+ */
+class LoadingManager {
+
+	/**
+	 * Constructs a new loading manager.
+	 *
+	 * @param {Function} [onLoad] - Executes when all items have been loaded.
+	 * @param {Function} [onProgress] - Executes when single items have been loaded.
+	 * @param {Function} [onError] - Executes when an error occurs.
+	 */
+	constructor( onLoad, onProgress, onError ) {
+
+		const scope = this;
+
+		let isLoading = false;
+		let itemsLoaded = 0;
+		let itemsTotal = 0;
+		let urlModifier = undefined;
+		const handlers = [];
+
+		// Refer to #5689 for the reason why we don't set .onStart
+		// in the constructor
+
+		/**
+		 * Executes when an item starts loading.
+		 *
+		 * @type {Function|undefined}
+		 * @default undefined
+		 */
+		this.onStart = undefined;
+
+		/**
+		 * Executes when all items have been loaded.
+		 *
+		 * @type {Function|undefined}
+		 * @default undefined
+		 */
+		this.onLoad = onLoad;
+
+		/**
+		 * Executes when single items have been loaded.
+		 *
+		 * @type {Function|undefined}
+		 * @default undefined
+		 */
+		this.onProgress = onProgress;
+
+		/**
+		 * Executes when an error occurs.
+		 *
+		 * @type {Function|undefined}
+		 * @default undefined
+		 */
+		this.onError = onError;
+
+		/**
+		 * Used for aborting ongoing requests in loaders using this manager.
+		 *
+		 * @private
+		 * @type {AbortController | null}
+		 */
+		this._abortController = null;
+
+		/**
+		 * This should be called by any loader using the manager when the loader
+		 * starts loading an item.
+		 *
+		 * @param {string} url - The URL to load.
+		 */
+		this.itemStart = function ( url ) {
+
+			itemsTotal ++;
+
+			if ( isLoading === false ) {
+
+				if ( scope.onStart !== undefined ) {
+
+					scope.onStart( url, itemsLoaded, itemsTotal );
+
+				}
+
+			}
+
+			isLoading = true;
+
+		};
+
+		/**
+		 * This should be called by any loader using the manager when the loader
+		 * ended loading an item.
+		 *
+		 * @param {string} url - The URL of the loaded item.
+		 */
+		this.itemEnd = function ( url ) {
+
+			itemsLoaded ++;
+
+			if ( scope.onProgress !== undefined ) {
+
+				scope.onProgress( url, itemsLoaded, itemsTotal );
+
+			}
+
+			if ( itemsLoaded === itemsTotal ) {
+
+				isLoading = false;
+
+				if ( scope.onLoad !== undefined ) {
+
+					scope.onLoad();
+
+				}
+
+			}
+
+		};
+
+		/**
+		 * This should be called by any loader using the manager when the loader
+		 * encounters an error when loading an item.
+		 *
+		 * @param {string} url - The URL of the item that produces an error.
+		 */
+		this.itemError = function ( url ) {
+
+			if ( scope.onError !== undefined ) {
+
+				scope.onError( url );
+
+			}
+
+		};
+
+		/**
+		 * Given a URL, uses the URL modifier callback (if any) and returns a
+		 * resolved URL. If no URL modifier is set, returns the original URL.
+		 *
+		 * @param {string} url - The URL to load.
+		 * @return {string} The resolved URL.
+		 */
+		this.resolveURL = function ( url ) {
+
+			// Normalize to NFC so that Unicode URIs (e.g. from glTF)
+			// are percent-encoded correctly per RFC 3987.
+
+			url = url.normalize( 'NFC' );
+
+			if ( urlModifier ) {
+
+				return urlModifier( url );
+
+			}
+
+			return url;
+
+		};
+
+		/**
+		 * If provided, the callback will be passed each resource URL before a
+		 * request is sent. The callback may return the original URL, or a new URL to
+		 * override loading behavior. This behavior can be used to load assets from
+		 * .ZIP files, drag-and-drop APIs, and Data URIs.
+		 *
+		 * ```js
+		 * const blobs = {'fish.gltf': blob1, 'diffuse.png': blob2, 'normal.png': blob3};
+		 *
+		 * const manager = new THREE.LoadingManager();
+		 *
+		 * // Initialize loading manager with URL callback.
+		 * const objectURLs = [];
+		 * manager.setURLModifier( ( url ) => {
+		 *
+		 * 	url = URL.createObjectURL( blobs[ url ] );
+		 * 	objectURLs.push( url );
+		 * 	return url;
+		 *
+		 * } );
+		 *
+		 * // Load as usual, then revoke the blob URLs.
+		 * const loader = new GLTFLoader( manager );
+		 * loader.load( 'fish.gltf', (gltf) => {
+		 *
+		 * 	scene.add( gltf.scene );
+		 * 	objectURLs.forEach( ( url ) => URL.revokeObjectURL( url ) );
+		 *
+		 * } );
+		 * ```
+		 *
+		 * @param {function(string):string} transform - URL modifier callback. Called with an URL and must return a resolved URL.
+		 * @return {LoadingManager} A reference to this loading manager.
+		 */
+		this.setURLModifier = function ( transform ) {
+
+			urlModifier = transform;
+
+			return this;
+
+		};
+
+		/**
+		 * Registers a loader with the given regular expression. Can be used to
+		 * define what loader should be used in order to load specific files. A
+		 * typical use case is to overwrite the default loader for textures.
+		 *
+		 * ```js
+		 * // add handler for TGA textures
+		 * manager.addHandler( /\.tga$/i, new TGALoader() );
+		 * ```
+		 *
+		 * @param {string} regex - A regular expression.
+		 * @param {Loader} loader - A loader that should handle matched cases.
+		 * @return {LoadingManager} A reference to this loading manager.
+		 */
+		this.addHandler = function ( regex, loader ) {
+
+			handlers.push( regex, loader );
+
+			return this;
+
+		};
+
+		/**
+		 * Removes the loader for the given regular expression.
+		 *
+		 * @param {string} regex - A regular expression.
+		 * @return {LoadingManager} A reference to this loading manager.
+		 */
+		this.removeHandler = function ( regex ) {
+
+			const index = handlers.indexOf( regex );
+
+			if ( index !== -1 ) {
+
+				handlers.splice( index, 2 );
+
+			}
+
+			return this;
+
+		};
+
+		/**
+		 * Can be used to retrieve the registered loader for the given file path.
+		 *
+		 * @param {string} file - The file path.
+		 * @return {?Loader} The registered loader. Returns `null` if no loader was found.
+		 */
+		this.getHandler = function ( file ) {
+
+			for ( let i = 0, l = handlers.length; i < l; i += 2 ) {
+
+				const regex = handlers[ i ];
+				const loader = handlers[ i + 1 ];
+
+				if ( regex.global ) regex.lastIndex = 0; // see #17920
+
+				if ( regex.test( file ) ) {
+
+					return loader;
+
+				}
+
+			}
+
+			return null;
+
+		};
+
+		/**
+		 * Can be used to abort ongoing loading requests in loaders using this manager.
+		 * The abort only works if the loaders implement {@link Loader#abort} and `AbortSignal.any()`
+		 * is supported in the browser.
+		 *
+		 * @return {LoadingManager} A reference to this loading manager.
+		 */
+		this.abort = function () {
+
+
+			this.abortController.abort();
+			this._abortController = null;
+
+			return this;
+
+		};
+
+	}
+
+	// TODO: Revert this back to a single member variable once this issue has been fixed
+	// https://github.com/cloudflare/workerd/issues/3657
+
+	/**
+	 * Used for aborting ongoing requests in loaders using this manager.
+	 *
+	 * @type {AbortController}
+	 */
+	get abortController() {
+
+		if ( ! this._abortController ) {
+
+			this._abortController = new AbortController();
+
+		}
+
+		return this._abortController;
+
+	}
+
+}
+
+/**
+ * The global default loading manager.
+ *
+ * @constant
+ * @type {LoadingManager}
+ */
+const DefaultLoadingManager = /*@__PURE__*/ new LoadingManager();
+
+/**
+ * Abstract base class for loaders.
+ *
+ * @abstract
+ */
+class Loader {
+
+	/**
+	 * Constructs a new loader.
+	 *
+	 * @param {LoadingManager} [manager] - The loading manager.
+	 */
+	constructor( manager ) {
+
+		/**
+		 * The loading manager.
+		 *
+		 * @type {LoadingManager}
+		 * @default DefaultLoadingManager
+		 */
+		this.manager = ( manager !== undefined ) ? manager : DefaultLoadingManager;
+
+		/**
+		 * The crossOrigin string to implement CORS for loading the url from a
+		 * different domain that allows CORS.
+		 *
+		 * @type {string}
+		 * @default 'anonymous'
+		 */
+		this.crossOrigin = 'anonymous';
+
+		/**
+		 * Whether the XMLHttpRequest uses credentials.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.withCredentials = false;
+
+		/**
+		 * The base path from which the asset will be loaded.
+		 *
+		 * @type {string}
+		 */
+		this.path = '';
+
+		/**
+		 * The base path from which additional resources like textures will be loaded.
+		 *
+		 * @type {string}
+		 */
+		this.resourcePath = '';
+
+		/**
+		 * The [request header](https://developer.mozilla.org/en-US/docs/Glossary/Request_header)
+		 * used in HTTP request.
+		 *
+		 * @type {Object<string, any>}
+		 */
+		this.requestHeader = {};
+
+		if ( typeof __THREE_DEVTOOLS__ !== 'undefined' ) {
+
+			__THREE_DEVTOOLS__.dispatchEvent( new CustomEvent( 'observe', { detail: this } ) );
+
+		}
+
+	}
+
+	/**
+	 * This method needs to be implemented by all concrete loaders. It holds the
+	 * logic for loading assets from the backend.
+	 *
+	 * @abstract
+	 * @param {string} url - The path/URL of the file to be loaded.
+	 * @param {Function} onLoad - Executed when the loading process has been finished.
+	 * @param {onProgressCallback} [onProgress] - Executed while the loading is in progress.
+	 * @param {onErrorCallback} [onError] - Executed when errors occur.
+	 */
+	load( /* url, onLoad, onProgress, onError */ ) {}
+
+	/**
+	 * A async version of {@link Loader#load}.
+	 *
+	 * @param {string} url - The path/URL of the file to be loaded.
+	 * @param {onProgressCallback} [onProgress] - Executed while the loading is in progress.
+	 * @return {Promise} A Promise that resolves when the asset has been loaded.
+	 */
+	loadAsync( url, onProgress ) {
+
+		const scope = this;
+
+		return new Promise( function ( resolve, reject ) {
+
+			scope.load( url, resolve, onProgress, reject );
+
+		} );
+
+	}
+
+	/**
+	 * This method needs to be implemented by all concrete loaders. It holds the
+	 * logic for parsing the asset into three.js entities.
+	 *
+	 * @abstract
+	 * @param {any} data - The data to parse.
+	 */
+	parse( /* data */ ) {}
+
+	/**
+	 * Sets the `crossOrigin` String to implement CORS for loading the URL
+	 * from a different domain that allows CORS.
+	 *
+	 * @param {string} crossOrigin - The `crossOrigin` value.
+	 * @return {Loader} A reference to this instance.
+	 */
+	setCrossOrigin( crossOrigin ) {
+
+		this.crossOrigin = crossOrigin;
+		return this;
+
+	}
+
+	/**
+	 * Whether the XMLHttpRequest uses credentials such as cookies, authorization
+	 * headers or TLS client certificates, see [XMLHttpRequest.withCredentials](https://developer.mozilla.org/en-US/docs/Web/API/XMLHttpRequest/withCredentials).
+	 *
+	 * Note: This setting has no effect if you are loading files locally or from the same domain.
+	 *
+	 * @param {boolean} value - The `withCredentials` value.
+	 * @return {Loader} A reference to this instance.
+	 */
+	setWithCredentials( value ) {
+
+		this.withCredentials = value;
+		return this;
+
+	}
+
+	/**
+	 * Sets the base path for the asset.
+	 *
+	 * @param {string} path - The base path.
+	 * @return {Loader} A reference to this instance.
+	 */
+	setPath( path ) {
+
+		this.path = path;
+		return this;
+
+	}
+
+	/**
+	 * Sets the base path for dependent resources like textures.
+	 *
+	 * @param {string} resourcePath - The resource path.
+	 * @return {Loader} A reference to this instance.
+	 */
+	setResourcePath( resourcePath ) {
+
+		this.resourcePath = resourcePath;
+		return this;
+
+	}
+
+	/**
+	 * Sets the given request header.
+	 *
+	 * @param {Object} requestHeader - A [request header](https://developer.mozilla.org/en-US/docs/Glossary/Request_header)
+	 * for configuring the HTTP request.
+	 * @return {Loader} A reference to this instance.
+	 */
+	setRequestHeader( requestHeader ) {
+
+		this.requestHeader = requestHeader;
+		return this;
+
+	}
+
+	/**
+	 * This method can be implemented in loaders for aborting ongoing requests.
+	 *
+	 * @abstract
+	 * @return {Loader} A reference to this instance.
+	 */
+	abort() {
+
+		return this;
+
+	}
+
+}
+
+/**
+ * Callback for onProgress in loaders.
+ *
+ * @callback onProgressCallback
+ * @param {ProgressEvent} event - An instance of `ProgressEvent` that represents the current loading status.
+ */
+
+/**
+ * Callback for onError in loaders.
+ *
+ * @callback onErrorCallback
+ * @param {Error} error - The error which occurred during the loading process.
+ */
+
+/**
+ * The default material name that is used by loaders
+ * when creating materials for loaded 3D objects.
+ *
+ * Note: Not all loaders might honor this setting.
+ *
+ * @static
+ * @type {string}
+ * @default '__DEFAULT'
+ */
+Loader.DEFAULT_MATERIAL_NAME = '__DEFAULT';
+
+const loading = {};
+
+class HttpError extends Error {
+
+	constructor( message, response ) {
+
+		super( message );
+		this.response = response;
+
+	}
+
+}
+
+/**
+ * A low level class for loading resources with the Fetch API, used internally by
+ * most loaders. It can also be used directly to load any file type that does
+ * not have a loader.
+ *
+ * This loader supports caching. If you want to use it, add `THREE.Cache.enabled = true;`
+ * once to your application.
+ *
+ * ```js
+ * const loader = new THREE.FileLoader();
+ * const data = await loader.loadAsync( 'example.txt' );
+ * ```
+ *
+ * @augments Loader
+ */
+class FileLoader extends Loader {
+
+	/**
+	 * Constructs a new file loader.
+	 *
+	 * @param {LoadingManager} [manager] - The loading manager.
+	 */
+	constructor( manager ) {
+
+		super( manager );
+
+		/**
+		 * The expected mime type. Valid values can be found
+		 * [here](https://developer.mozilla.org/en-US/docs/Web/API/DOMParser/parseFromString#mimetype)
+		 *
+		 * @type {string}
+		 */
+		this.mimeType = '';
+
+		/**
+		 * The expected response type.
+		 *
+		 * @type {('arraybuffer'|'blob'|'document'|'json'|'')}
+		 * @default ''
+		 */
+		this.responseType = '';
+
+		/**
+		 * Used for aborting requests.
+		 *
+		 * @private
+		 * @type {AbortController}
+		 */
+		this._abortController = new AbortController();
+
+	}
+
+	/**
+	 * Starts loading from the given URL and pass the loaded response to the `onLoad()` callback.
+	 *
+	 * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.
+	 * @param {function(any)} onLoad - Executed when the loading process has been finished.
+	 * @param {onProgressCallback} [onProgress] - Executed while the loading is in progress.
+	 * @param {onErrorCallback} [onError] - Executed when errors occur.
+	 */
+	load( url, onLoad, onProgress, onError ) {
+
+		if ( url === undefined ) url = '';
+
+		if ( this.path !== undefined ) url = this.path + url;
+
+		url = this.manager.resolveURL( url );
+
+		const cached = Cache.get( `file:${url}` );
+
+		if ( cached !== undefined ) {
+
+			this.manager.itemStart( url );
+
+			setTimeout( () => {
+
+				if ( onLoad ) onLoad( cached );
+
+				this.manager.itemEnd( url );
+
+			}, 0 );
+
+			return;
+
+		}
+
+		// Check if request is duplicate
+
+		if ( loading[ url ] !== undefined ) {
+
+			loading[ url ].push( {
+
+				onLoad: onLoad,
+				onProgress: onProgress,
+				onError: onError
+
+			} );
+
+			return;
+
+		}
+
+		// Initialise array for duplicate requests
+		loading[ url ] = [];
+
+		loading[ url ].push( {
+			onLoad: onLoad,
+			onProgress: onProgress,
+			onError: onError,
+		} );
+
+		// create request
+		const req = new Request( url, {
+			headers: new Headers( this.requestHeader ),
+			credentials: this.withCredentials ? 'include' : 'same-origin',
+			signal: ( typeof AbortSignal.any === 'function' ) ? AbortSignal.any( [ this._abortController.signal, this.manager.abortController.signal ] ) : this._abortController.signal
+		} );
+
+		// record states ( avoid data race )
+		const mimeType = this.mimeType;
+		const responseType = this.responseType;
+
+		// start the fetch
+		fetch( req )
+			.then( response => {
+
+				if ( response.status === 200 || response.status === 0 ) {
+
+					// Some browsers return HTTP Status 0 when using non-http protocol
+					// e.g. 'file://' or 'data://'. Handle as success.
+
+					if ( response.status === 0 ) {
+
+						warn( 'FileLoader: HTTP Status 0 received.' );
+
+					}
+
+					// Workaround: Checking if response.body === undefined for Alipay browser #23548
+
+					if ( typeof ReadableStream === 'undefined' || response.body === undefined || response.body.getReader === undefined ) {
+
+						return response;
+
+					}
+
+					const callbacks = loading[ url ];
+					const reader = response.body.getReader();
+
+					// Nginx needs X-File-Size check
+					// https://serverfault.com/questions/482875/why-does-nginx-remove-content-length-header-for-chunked-content
+					const contentLength = response.headers.get( 'X-File-Size' ) || response.headers.get( 'Content-Length' );
+					const total = contentLength ? parseInt( contentLength ) : 0;
+					const lengthComputable = total !== 0;
+					let loaded = 0;
+
+					// periodically read data into the new stream tracking while download progress
+					const stream = new ReadableStream( {
+						start( controller ) {
+
+							readData();
+
+							function readData() {
+
+								reader.read().then( ( { done, value } ) => {
+
+									if ( done ) {
+
+										controller.close();
+
+									} else {
+
+										loaded += value.byteLength;
+
+										const event = new ProgressEvent( 'progress', { lengthComputable, loaded, total } );
+										for ( let i = 0, il = callbacks.length; i < il; i ++ ) {
+
+											const callback = callbacks[ i ];
+											if ( callback.onProgress ) callback.onProgress( event );
+
+										}
+
+										controller.enqueue( value );
+										readData();
+
+									}
+
+								}, ( e ) => {
+
+									controller.error( e );
+
+								} );
+
+							}
+
+						}
+
+					} );
+
+					return new Response( stream );
+
+				} else {
+
+					throw new HttpError( `fetch for "${response.url}" responded with ${response.status}: ${response.statusText}`, response );
+
+				}
+
+			} )
+			.then( response => {
+
+				switch ( responseType ) {
+
+					case 'arraybuffer':
+
+						return response.arrayBuffer();
+
+					case 'blob':
+
+						return response.blob();
+
+					case 'document':
+
+						return response.text()
+							.then( text => {
+
+								const parser = new DOMParser();
+								return parser.parseFromString( text, mimeType );
+
+							} );
+
+					case 'json':
+
+						return response.json();
+
+					default:
+
+						if ( mimeType === '' ) {
+
+							return response.text();
+
+						} else {
+
+							// sniff encoding
+							const re = /charset="?([^;"\s]*)"?/i;
+							const exec = re.exec( mimeType );
+							const label = exec && exec[ 1 ] ? exec[ 1 ].toLowerCase() : undefined;
+							const decoder = new TextDecoder( label );
+							return response.arrayBuffer().then( ab => decoder.decode( ab ) );
+
+						}
+
+				}
+
+			} )
+			.then( data => {
+
+				// Add to cache only on HTTP success, so that we do not cache
+				// error response bodies as proper responses to requests.
+				Cache.add( `file:${url}`, data );
+
+				const callbacks = loading[ url ];
+				delete loading[ url ];
+
+				for ( let i = 0, il = callbacks.length; i < il; i ++ ) {
+
+					const callback = callbacks[ i ];
+					if ( callback.onLoad ) callback.onLoad( data );
+
+				}
+
+			} )
+			.catch( err => {
+
+				// Abort errors and other errors are handled the same
+
+				const callbacks = loading[ url ];
+
+				if ( callbacks === undefined ) {
+
+					// When onLoad was called and url was deleted in `loading`
+					this.manager.itemError( url );
+					throw err;
+
+				}
+
+				delete loading[ url ];
+
+				for ( let i = 0, il = callbacks.length; i < il; i ++ ) {
+
+					const callback = callbacks[ i ];
+					if ( callback.onError ) callback.onError( err );
+
+				}
+
+				this.manager.itemError( url );
+
+			} )
+			.finally( () => {
+
+				this.manager.itemEnd( url );
+
+			} );
+
+		this.manager.itemStart( url );
+
+	}
+
+	/**
+	 * Sets the expected response type.
+	 *
+	 * @param {('arraybuffer'|'blob'|'document'|'json'|'')} value - The response type.
+	 * @return {FileLoader} A reference to this file loader.
+	 */
+	setResponseType( value ) {
+
+		this.responseType = value;
+		return this;
+
+	}
+
+	/**
+	 * Sets the expected mime type of the loaded file.
+	 *
+	 * @param {string} value - The mime type.
+	 * @return {FileLoader} A reference to this file loader.
+	 */
+	setMimeType( value ) {
+
+		this.mimeType = value;
+		return this;
+
+	}
+
+	/**
+	 * Aborts ongoing fetch requests.
+	 *
+	 * @return {FileLoader} A reference to this instance.
+	 */
+	abort() {
+
+		this._abortController.abort();
+		this._abortController = new AbortController();
+
+		return this;
+
+	}
+
+}
+
+/**
+ * Class for loading animation clips in the JSON format. The files are internally
+ * loaded via {@link FileLoader}.
+ *
+ * ```js
+ * const loader = new THREE.AnimationLoader();
+ * const animations = await loader.loadAsync( 'animations/animation.js' );
+ * ```
+ *
+ * @augments Loader
+ */
+class AnimationLoader extends Loader {
+
+	/**
+	 * Constructs a new animation loader.
+	 *
+	 * @param {LoadingManager} [manager] - The loading manager.
+	 */
+	constructor( manager ) {
+
+		super( manager );
+
+	}
+
+	/**
+	 * Starts loading from the given URL and pass the loaded animations as an array
+	 * holding instances of {@link AnimationClip} to the `onLoad()` callback.
+	 *
+	 * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.
+	 * @param {function(Array<AnimationClip>)} onLoad - Executed when the loading process has been finished.
+	 * @param {onProgressCallback} onProgress - Executed while the loading is in progress.
+	 * @param {onErrorCallback} onError - Executed when errors occur.
+	 */
+	load( url, onLoad, onProgress, onError ) {
+
+		const scope = this;
+
+		const loader = new FileLoader( this.manager );
+		loader.setPath( this.path );
+		loader.setRequestHeader( this.requestHeader );
+		loader.setWithCredentials( this.withCredentials );
+		loader.load( url, function ( text ) {
+
+			try {
+
+				onLoad( scope.parse( JSON.parse( text ) ) );
+
+			} catch ( e ) {
+
+				if ( onError ) {
+
+					onError( e );
+
+				} else {
+
+					error( e );
+
+				}
+
+				scope.manager.itemError( url );
+
+			}
+
+		}, onProgress, onError );
+
+	}
+
+	/**
+	 * Parses the given JSON object and returns an array of animation clips.
+	 *
+	 * @param {Object} json - The serialized animation clips.
+	 * @return {Array<AnimationClip>} The parsed animation clips.
+	 */
+	parse( json ) {
+
+		const animations = [];
+
+		for ( let i = 0; i < json.length; i ++ ) {
+
+			const clip = AnimationClip.parse( json[ i ] );
+
+			animations.push( clip );
+
+		}
+
+		return animations;
+
+	}
+
+}
+
+/**
+ * Abstract base class for loading compressed texture formats S3TC, ASTC or ETC.
+ * Textures are internally loaded via {@link FileLoader}.
+ *
+ * Derived classes have to implement the `parse()` method which holds the parsing
+ * for the respective format.
+ *
+ * @abstract
+ * @augments Loader
+ */
+class CompressedTextureLoader extends Loader {
+
+	/**
+	 * Constructs a new compressed texture loader.
+	 *
+	 * @param {LoadingManager} [manager] - The loading manager.
+	 */
+	constructor( manager ) {
+
+		super( manager );
+
+	}
+
+	/**
+	 * Starts loading from the given URL and passes the loaded compressed texture
+	 * to the `onLoad()` callback. The method also returns a new texture object which can
+	 * directly be used for material creation. If you do it this way, the texture
+	 * may pop up in your scene once the respective loading process is finished.
+	 *
+	 * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.
+	 * @param {function(CompressedTexture)} onLoad - Executed when the loading process has been finished.
+	 * @param {onProgressCallback} onProgress - Executed while the loading is in progress.
+	 * @param {onErrorCallback} onError - Executed when errors occur.
+	 * @return {CompressedTexture} The compressed texture.
+	 */
+	load( url, onLoad, onProgress, onError ) {
+
+		const scope = this;
+
+		const images = [];
+
+		const texture = new CompressedTexture();
+
+		const loader = new FileLoader( this.manager );
+		loader.setPath( this.path );
+		loader.setResponseType( 'arraybuffer' );
+		loader.setRequestHeader( this.requestHeader );
+		loader.setWithCredentials( scope.withCredentials );
+
+		let loaded = 0;
+
+		function loadTexture( i ) {
+
+			loader.load( url[ i ], function ( buffer ) {
+
+				const texDatas = scope.parse( buffer, true );
+
+				images[ i ] = {
+					width: texDatas.width,
+					height: texDatas.height,
+					format: texDatas.format,
+					mipmaps: texDatas.mipmaps
+				};
+
+				loaded += 1;
+
+				if ( loaded === 6 ) {
+
+					if ( texDatas.mipmapCount === 1 ) texture.minFilter = LinearFilter;
+
+					texture.image = images;
+					texture.format = texDatas.format;
+					texture.needsUpdate = true;
+
+					if ( onLoad ) onLoad( texture );
+
+				}
+
+			}, onProgress, onError );
+
+		}
+
+		if ( Array.isArray( url ) ) {
+
+			for ( let i = 0, il = url.length; i < il; ++ i ) {
+
+				loadTexture( i );
+
+			}
+
+		} else {
+
+			// compressed cubemap texture stored in a single DDS file
+
+			loader.load( url, function ( buffer ) {
+
+				const texDatas = scope.parse( buffer, true );
+
+				if ( texDatas.isCubemap ) {
+
+					const faces = texDatas.mipmaps.length / texDatas.mipmapCount;
+
+					for ( let f = 0; f < faces; f ++ ) {
+
+						images[ f ] = { mipmaps: [] };
+
+						for ( let i = 0; i < texDatas.mipmapCount; i ++ ) {
+
+							images[ f ].mipmaps.push( texDatas.mipmaps[ f * texDatas.mipmapCount + i ] );
+							images[ f ].format = texDatas.format;
+							images[ f ].width = texDatas.width;
+							images[ f ].height = texDatas.height;
+
+						}
+
+					}
+
+					texture.image = images;
+
+				} else {
+
+					texture.image.width = texDatas.width;
+					texture.image.height = texDatas.height;
+					texture.mipmaps = texDatas.mipmaps;
+
+				}
+
+				if ( texDatas.mipmapCount === 1 ) {
+
+					texture.minFilter = LinearFilter;
+
+				}
+
+				texture.format = texDatas.format;
+				texture.needsUpdate = true;
+
+				if ( onLoad ) onLoad( texture );
+
+			}, onProgress, onError );
+
+		}
+
+		return texture;
+
+	}
+
+}
+
+const _loading = new WeakMap();
+
+/**
+ * A loader for loading images. The class loads images with the HTML `Image` API.
+ *
+ * ```js
+ * const loader = new THREE.ImageLoader();
+ * const image = await loader.loadAsync( 'image.png' );
+ * ```
+ * Please note that `ImageLoader` has dropped support for progress
+ * events in `r84`. For an `ImageLoader` that supports progress events, see
+ * [this thread](https://github.com/mrdoob/three.js/issues/10439#issuecomment-275785639).
+ *
+ * @augments Loader
+ */
+class ImageLoader extends Loader {
+
+	/**
+	 * Constructs a new image loader.
+	 *
+	 * @param {LoadingManager} [manager] - The loading manager.
+	 */
+	constructor( manager ) {
+
+		super( manager );
+
+	}
+
+	/**
+	 * Starts loading from the given URL and passes the loaded image
+	 * to the `onLoad()` callback. The method also returns a new `Image` object which can
+	 * directly be used for texture creation. If you do it this way, the texture
+	 * may pop up in your scene once the respective loading process is finished.
+	 *
+	 * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.
+	 * @param {function(Image)} onLoad - Executed when the loading process has been finished.
+	 * @param {onProgressCallback} onProgress - Unsupported in this loader.
+	 * @param {onErrorCallback} onError - Executed when errors occur.
+	 * @return {Image} The image.
+	 */
+	load( url, onLoad, onProgress, onError ) {
+
+		if ( this.path !== undefined ) url = this.path + url;
+
+		url = this.manager.resolveURL( url );
+
+		const scope = this;
+
+		const cached = Cache.get( `image:${url}` );
+
+		if ( cached !== undefined ) {
+
+			if ( cached.complete === true ) {
+
+				scope.manager.itemStart( url );
+
+				setTimeout( function () {
+
+					if ( onLoad ) onLoad( cached );
+
+					scope.manager.itemEnd( url );
+
+				}, 0 );
+
+			} else {
+
+				let arr = _loading.get( cached );
+
+				if ( arr === undefined ) {
+
+					arr = [];
+					_loading.set( cached, arr );
+
+				}
+
+				arr.push( { onLoad, onError } );
+
+			}
+
+			return cached;
+
+		}
+
+		const image = createElementNS( 'img' );
+
+		function onImageLoad() {
+
+			removeEventListeners();
+
+			if ( onLoad ) onLoad( this );
+
+			//
+
+			const callbacks = _loading.get( this ) || [];
+
+			for ( let i = 0; i < callbacks.length; i ++ ) {
+
+				const callback = callbacks[ i ];
+				if ( callback.onLoad ) callback.onLoad( this );
+
+			}
+
+			_loading.delete( this );
+
+			scope.manager.itemEnd( url );
+
+		}
+
+		function onImageError( event ) {
+
+			removeEventListeners();
+
+			if ( onError ) onError( event );
+
+			Cache.remove( `image:${url}` );
+
+			//
+
+			const callbacks = _loading.get( this ) || [];
+
+			for ( let i = 0; i < callbacks.length; i ++ ) {
+
+				const callback = callbacks[ i ];
+				if ( callback.onError ) callback.onError( event );
+
+			}
+
+			_loading.delete( this );
+
+
+			scope.manager.itemError( url );
+			scope.manager.itemEnd( url );
+
+		}
+
+		function removeEventListeners() {
+
+			image.removeEventListener( 'load', onImageLoad, false );
+			image.removeEventListener( 'error', onImageError, false );
+
+		}
+
+		image.addEventListener( 'load', onImageLoad, false );
+		image.addEventListener( 'error', onImageError, false );
+
+		if ( url.slice( 0, 5 ) !== 'data:' ) {
+
+			if ( this.crossOrigin !== undefined ) image.crossOrigin = this.crossOrigin;
+
+		}
+
+		Cache.add( `image:${url}`, image );
+		scope.manager.itemStart( url );
+
+		image.src = url;
+
+		return image;
+
+	}
+
+}
+
+/**
+ * Class for loading cube textures. Images are internally loaded via {@link ImageLoader}.
+ *
+ * The loader returns an instance of {@link CubeTexture} and expects the cube map to
+ * be defined as six separate images representing the sides of a cube. Other cube map definitions
+ * like vertical and horizontal cross, column and row layouts are not supported.
+ *
+ * Note that, by convention, cube maps are specified in a coordinate system
+ * in which positive-x is to the right when looking up the positive-z axis --
+ * in other words, using a left-handed coordinate system. Since three.js uses
+ * a right-handed coordinate system, environment maps used in three.js will
+ * have pos-x and neg-x swapped.
+ *
+ * The loaded cube texture is in sRGB color space. Meaning {@link Texture#colorSpace}
+ * is set to `SRGBColorSpace` by default.
+ *
+ * ```js
+ * const loader = new THREE.CubeTextureLoader().setPath( 'textures/cubeMaps/' );
+ * const cubeTexture = await loader.loadAsync( [
+ * 	'px.png', 'nx.png', 'py.png', 'ny.png', 'pz.png', 'nz.png'
+ * ] );
+ * scene.background = cubeTexture;
+ * ```
+ *
+ * @augments Loader
+ */
+class CubeTextureLoader extends Loader {
+
+	/**
+	 * Constructs a new cube texture loader.
+	 *
+	 * @param {LoadingManager} [manager] - The loading manager.
+	 */
+	constructor( manager ) {
+
+		super( manager );
+
+	}
+
+	/**
+	 * Starts loading from the given URL and pass the fully loaded cube texture
+	 * to the `onLoad()` callback. The method also returns a new cube texture object which can
+	 * directly be used for material creation. If you do it this way, the cube texture
+	 * may pop up in your scene once the respective loading process is finished.
+	 *
+	 * @param {Array<string>} urls - Array of 6 URLs to images, one for each side of the
+	 * cube texture. The urls should be specified in the following order: pos-x,
+	 * neg-x, pos-y, neg-y, pos-z, neg-z. An array of data URIs are allowed as well.
+	 * @param {function(CubeTexture)} onLoad - Executed when the loading process has been finished.
+	 * @param {onProgressCallback} onProgress - Unsupported in this loader.
+	 * @param {onErrorCallback} onError - Executed when errors occur.
+	 * @return {CubeTexture} The cube texture.
+	 */
+	load( urls, onLoad, onProgress, onError ) {
+
+		const texture = new CubeTexture();
+		texture.colorSpace = SRGBColorSpace;
+
+		const loader = new ImageLoader( this.manager );
+		loader.setCrossOrigin( this.crossOrigin );
+		loader.setPath( this.path );
+
+		let loaded = 0;
+
+		function loadTexture( i ) {
+
+			loader.load( urls[ i ], function ( image ) {
+
+				texture.images[ i ] = image;
+
+				loaded ++;
+
+				if ( loaded === 6 ) {
+
+					texture.needsUpdate = true;
+
+					if ( onLoad ) onLoad( texture );
+
+				}
+
+			}, undefined, onError );
+
+		}
+
+		for ( let i = 0; i < urls.length; ++ i ) {
+
+			loadTexture( i );
+
+		}
+
+		return texture;
+
+	}
+
+}
+
+/**
+ * Abstract base class for loading binary texture formats RGBE, EXR or TGA.
+ * Textures are internally loaded via {@link FileLoader}.
+ *
+ * Derived classes have to implement the `parse()` method which holds the parsing
+ * for the respective format.
+ *
+ * @abstract
+ * @augments Loader
+ */
+class DataTextureLoader extends Loader {
+
+	/**
+	 * Constructs a new data texture loader.
+	 *
+	 * @param {LoadingManager} [manager] - The loading manager.
+	 */
+	constructor( manager ) {
+
+		super( manager );
+
+	}
+
+	/**
+	 * Starts loading from the given URL and passes the loaded data texture
+	 * to the `onLoad()` callback. The method also returns a new texture object which can
+	 * directly be used for material creation. If you do it this way, the texture
+	 * may pop up in your scene once the respective loading process is finished.
+	 *
+	 * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.
+	 * @param {function(DataTexture)} onLoad - Executed when the loading process has been finished.
+	 * @param {onProgressCallback} onProgress - Executed while the loading is in progress.
+	 * @param {onErrorCallback} onError - Executed when errors occur.
+	 * @return {DataTexture} The data texture.
+	 */
+	load( url, onLoad, onProgress, onError ) {
+
+		const scope = this;
+
+		const texture = new DataTexture();
+
+		const loader = new FileLoader( this.manager );
+		loader.setResponseType( 'arraybuffer' );
+		loader.setRequestHeader( this.requestHeader );
+		loader.setPath( this.path );
+		loader.setWithCredentials( scope.withCredentials );
+		loader.load( url, function ( buffer ) {
+
+			let texData;
+
+			try {
+
+				texData = scope.parse( buffer );
+
+			} catch ( e ) {
+
+				if ( onError !== undefined ) {
+
+					onError( e );
+
+				} else {
+
+					error( e );
+
+				}
+
+				return;
+
+			}
+
+			scope._applyTexData( texture, texData );
+
+			if ( onLoad ) onLoad( texture, texData );
+
+		}, onProgress, onError );
+
+
+		return texture;
+
+	}
+
+	/**
+	 * Parses the given buffer and returns a configured data texture. Use this method
+	 * for parsing texture data that is already in memory (e.g. drag and drop or data
+	 * loaded from a server) without going through {@link DataTextureLoader#load}.
+	 *
+	 * @param {ArrayBuffer} buffer - The raw texture data.
+	 * @return {DataTexture} The data texture.
+	 */
+	createDataTexture( buffer ) {
+
+		const texture = new DataTexture();
+
+		this._applyTexData( texture, this.parse( buffer ) );
+
+		return texture;
+
+	}
+
+	/**
+	 * Applies the given parsed texture data to the given data texture.
+	 *
+	 * @private
+	 * @param {DataTexture} texture - The data texture.
+	 * @param {DataTextureLoader~TexData} texData - The parsed texture data.
+	 */
+	_applyTexData( texture, texData ) {
+
+		if ( texData.image !== undefined ) {
+
+			texture.image = texData.image;
+
+		} else if ( texData.data !== undefined ) {
+
+			texture.image.width = texData.width;
+			texture.image.height = texData.height;
+			texture.image.data = texData.data;
+
+		}
+
+		texture.wrapS = texData.wrapS !== undefined ? texData.wrapS : ClampToEdgeWrapping;
+		texture.wrapT = texData.wrapT !== undefined ? texData.wrapT : ClampToEdgeWrapping;
+
+		texture.magFilter = texData.magFilter !== undefined ? texData.magFilter : LinearFilter;
+		texture.minFilter = texData.minFilter !== undefined ? texData.minFilter : LinearFilter;
+
+		texture.anisotropy = texData.anisotropy !== undefined ? texData.anisotropy : 1;
+
+		if ( texData.colorSpace !== undefined ) {
+
+			texture.colorSpace = texData.colorSpace;
+
+		}
+
+		if ( texData.flipY !== undefined ) {
+
+			texture.flipY = texData.flipY;
+
+		}
+
+		if ( texData.format !== undefined ) {
+
+			texture.format = texData.format;
+
+		}
+
+		if ( texData.type !== undefined ) {
+
+			texture.type = texData.type;
+
+		}
+
+		if ( texData.mipmaps !== undefined ) {
+
+			texture.mipmaps = texData.mipmaps;
+			texture.minFilter = LinearMipmapLinearFilter; // presumably...
+
+		}
+
+		if ( texData.mipmapCount === 1 ) {
+
+			texture.minFilter = LinearFilter;
+
+		}
+
+		if ( texData.generateMipmaps !== undefined ) {
+
+			texture.generateMipmaps = texData.generateMipmaps;
+
+		}
+
+		texture.needsUpdate = true;
+
+	}
+
+}
+
+/**
+ * Class for loading textures. Images are internally
+ * loaded via {@link ImageLoader}.
+ *
+ * ```js
+ * const loader = new THREE.TextureLoader();
+ * const texture = await loader.loadAsync( 'textures/land_ocean_ice_cloud_2048.jpg' );
+ *
+ * const material = new THREE.MeshBasicMaterial( { map:texture } );
+ * ```
+ * Please note that `TextureLoader` has dropped support for progress
+ * events in `r84`. For a `TextureLoader` that supports progress events, see
+ * [this thread](https://github.com/mrdoob/three.js/issues/10439#issuecomment-293260145).
+ *
+ * @augments Loader
+ */
+class TextureLoader extends Loader {
+
+	/**
+	 * Constructs a new texture loader.
+	 *
+	 * @param {LoadingManager} [manager] - The loading manager.
+	 */
+	constructor( manager ) {
+
+		super( manager );
+
+	}
+
+	/**
+	 * Starts loading from the given URL and pass the fully loaded texture
+	 * to the `onLoad()` callback. The method also returns a new texture object which can
+	 * directly be used for material creation. If you do it this way, the texture
+	 * may pop up in your scene once the respective loading process is finished.
+	 *
+	 * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.
+	 * @param {function(Texture)} onLoad - Executed when the loading process has been finished.
+	 * @param {onProgressCallback} onProgress - Unsupported in this loader.
+	 * @param {onErrorCallback} onError - Executed when errors occur.
+	 * @return {Texture} The texture.
+	 */
+	load( url, onLoad, onProgress, onError ) {
+
+		const texture = new Texture();
+
+		const loader = new ImageLoader( this.manager );
+		loader.setCrossOrigin( this.crossOrigin );
+		loader.setPath( this.path );
+
+		loader.load( url, function ( image ) {
+
+			texture.image = image;
+			texture.needsUpdate = true;
+
+			if ( onLoad !== undefined ) {
+
+				onLoad( texture );
+
+			}
+
+		}, onProgress, onError );
+
+		return texture;
+
+	}
+
+}
+
+/**
+ * Abstract base class for lights - all other light types inherit the
+ * properties and methods described here.
+ *
+ * @abstract
+ * @augments Object3D
+ */
+class Light extends Object3D {
+
+	/**
+	 * Constructs a new light.
+	 *
+	 * @param {(number|Color|string)} [color=0xffffff] - The light's color.
+	 * @param {number} [intensity=1] - The light's strength/intensity.
+	 */
+	constructor( color, intensity = 1 ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isLight = true;
+
+		this.type = 'Light';
+
+		/**
+		 * The light's color.
+		 *
+		 * @type {Color}
+		 */
+		this.color = new Color( color );
+
+		/**
+		 * The light's intensity.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.intensity = intensity;
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		this.color.copy( source.color );
+		this.intensity = source.intensity;
+
+		return this;
+
+	}
+
+	toJSON( meta ) {
+
+		const data = super.toJSON( meta );
+
+		data.object.color = this.color.getHex();
+		data.object.intensity = this.intensity;
+
+		return data;
+
+	}
+
+}
+
+/**
+ * A light source positioned directly above the scene, with color fading from
+ * the sky color to the ground color.
+ *
+ * This light cannot be used to cast shadows.
+ *
+ * ```js
+ * const light = new THREE.HemisphereLight( 0xffffbb, 0x080820, 1 );
+ * scene.add( light );
+ * ```
+ *
+ * @augments Light
+ */
+class HemisphereLight extends Light {
+
+	/**
+	 * Constructs a new hemisphere light.
+	 *
+	 * @param {(number|Color|string)} [skyColor=0xffffff] - The light's sky color.
+	 * @param {(number|Color|string)} [groundColor=0xffffff] - The light's ground color.
+	 * @param {number} [intensity=1] - The light's strength/intensity.
+	 */
+	constructor( skyColor, groundColor, intensity ) {
+
+		super( skyColor, intensity );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isHemisphereLight = true;
+
+		this.type = 'HemisphereLight';
+
+		this.position.copy( Object3D.DEFAULT_UP );
+		this.updateMatrix();
+
+		/**
+		 * The light's ground color.
+		 *
+		 * @type {Color}
+		 */
+		this.groundColor = new Color( groundColor );
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		this.groundColor.copy( source.groundColor );
+
+		return this;
+
+	}
+
+	toJSON( meta ) {
+
+		const data = super.toJSON( meta );
+
+		data.object.groundColor = this.groundColor.getHex();
+
+		return data;
+
+	}
+
+}
+
+const _projScreenMatrix = /*@__PURE__*/ new Matrix4();
+const _lightPositionWorld = /*@__PURE__*/ new Vector3();
+const _lookTarget = /*@__PURE__*/ new Vector3();
+
+/**
+ * Abstract base class for light shadow classes. These classes
+ * represent the shadow configuration for different light types.
+ *
+ * @abstract
+ */
+class LightShadow {
+
+	/**
+	 * Constructs a new light shadow.
+	 *
+	 * @param {Camera} camera - The light's view of the world.
+	 */
+	constructor( camera ) {
+
+		/**
+		 * The light's view of the world.
+		 *
+		 * @type {Camera}
+		 */
+		this.camera = camera;
+
+		/**
+		 * The intensity of the shadow. The default is `1`.
+		 * Valid values are in the range `[0, 1]`.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.intensity = 1;
+
+		/**
+		 * Shadow map bias, how much to add or subtract from the normalized depth
+		 * when deciding whether a surface is in shadow.
+		 *
+		 * The default is `0`. Very tiny adjustments here (in the order of `0.0001`)
+		 * may help reduce artifacts in shadows.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.bias = 0;
+
+		/**
+		 * A node version of `bias`. Only supported with `WebGPURenderer`.
+		 *
+		 * If a bias node is defined, `bias` has no effect.
+		 *
+		 * @type {?Node<float>}
+		 * @default null
+		 */
+		this.biasNode = null;
+
+		/**
+		 * Defines how much the position used to query the shadow map is offset along
+		 * the object normal. The default is `0`. Increasing this value can be used to
+		 * reduce shadow acne especially in large scenes where light shines onto
+		 * geometry at a shallow angle. The cost is that shadows may appear distorted.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.normalBias = 0;
+
+		/**
+		 * Setting this to values greater than 1 will blur the edges of the shadow.
+		 * High values will cause unwanted banding effects in the shadows - a greater
+		 * map size will allow for a higher value to be used here before these effects
+		 * become visible.
+		 *
+		 * The property has no effect when the shadow map type is `BasicShadowMap`.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.radius = 1;
+
+		/**
+		 * The amount of samples to use when blurring a VSM shadow map.
+		 *
+		 * @type {number}
+		 * @default 8
+		 */
+		this.blurSamples = 8;
+
+		/**
+		 * Defines the width and height of the shadow map. Higher values give better quality
+		 * shadows at the cost of computation time. Values must be powers of two.
+		 *
+		 * @type {Vector2}
+		 * @default (512,512)
+		 */
+		this.mapSize = new Vector2( 512, 512 );
+
+		/**
+		 * The type of shadow texture. The default is `UnsignedByteType`.
+		 *
+		 * @type {number}
+		 * @default UnsignedByteType
+		 */
+		this.mapType = UnsignedByteType;
+
+		/**
+		 * The depth map generated using the internal camera; a location beyond a
+		 * pixel's depth is in shadow. Computed internally during rendering.
+		 *
+		 * @type {?RenderTarget}
+		 * @default null
+		 */
+		this.map = null;
+
+		/**
+		 * The distribution map generated using the internal camera; an occlusion is
+		 * calculated based on the distribution of depths. Computed internally during
+		 * rendering.
+		 *
+		 * @type {?RenderTarget}
+		 * @default null
+		 */
+		this.mapPass = null;
+
+		/**
+		 * Model to shadow camera space, to compute location and depth in shadow map.
+		 * This is computed internally during rendering.
+		 *
+		 * @type {Matrix4}
+		 */
+		this.matrix = new Matrix4();
+
+		/**
+		 * Enables automatic updates of the light's shadow. If you do not require dynamic
+		 * lighting / shadows, you may set this to `false`.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.autoUpdate = true;
+
+		/**
+		 * When set to `true`, shadow maps will be updated in the next `render` call.
+		 * If you have set {@link LightShadow#autoUpdate} to `false`, you will need to
+		 * set this property to `true` and then make a render call to update the light's shadow.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.needsUpdate = false;
+
+		this._frustum = new Frustum();
+		this._frameExtents = new Vector2( 1, 1 );
+
+		this._viewportCount = 1;
+
+		this._viewports = [
+
+			new Vector4( 0, 0, 1, 1 )
+
+		];
+
+	}
+
+	/**
+	 * Used internally by the renderer to get the number of viewports that need
+	 * to be rendered for this shadow.
+	 *
+	 * @return {number} The viewport count.
+	 */
+	getViewportCount() {
+
+		return this._viewportCount;
+
+	}
+
+	/**
+	 * Used internally by the renderer to get the camera that renders the given viewport.
+	 *
+	 * @param {number} [viewportIndex=0] - The viewport index.
+	 * @return {Camera} The shadow camera.
+	 */
+	getCamera( /* viewportIndex */ ) {
+
+		return this.camera;
+
+	}
+
+	/**
+	 * Gets the shadow cameras frustum. Used internally by the renderer to cull objects.
+	 *
+	 * @return {Frustum} The shadow camera frustum.
+	 */
+	getFrustum() {
+
+		return this._frustum;
+
+	}
+
+	/**
+	 * Update the matrices for the camera and shadow, used internally by the renderer.
+	 *
+	 * @param {Light} light - The light for which the shadow is being rendered.
+	 */
+	updateMatrices( light ) {
+
+		const shadowCamera = this.camera;
+		_lightPositionWorld.setFromMatrixPosition( light.matrixWorld );
+		shadowCamera.position.copy( _lightPositionWorld );
+
+		_lookTarget.setFromMatrixPosition( light.target.matrixWorld );
+		shadowCamera.lookAt( _lookTarget );
+		shadowCamera.updateMatrixWorld();
+		this._updateMatrix( shadowCamera, this.matrix, this._frustum );
+
+	}
+
+	/**
+	 * Updates a shadow projection matrix and its corresponding frustum.
+	 *
+	 * @private
+	 * @param {Camera} shadowCamera - The shadow camera.
+	 * @param {Matrix4} shadowMatrix - The target shadow matrix.
+	 * @param {Frustum} frustum - The target frustum.
+	 * @param {Vector4} [viewport] - The viewport within the shadow atlas.
+	 */
+	_updateMatrix( shadowCamera, shadowMatrix, frustum, viewport ) {
+
+		_projScreenMatrix.multiplyMatrices( shadowCamera.projectionMatrix, shadowCamera.matrixWorldInverse );
+		frustum.setFromProjectionMatrix( _projScreenMatrix, shadowCamera.coordinateSystem, shadowCamera.reversedDepth );
+
+		const frameExtents = this._frameExtents;
+		const scaleX = viewport ? viewport.z / frameExtents.x : 1;
+		const scaleY = viewport ? viewport.w / frameExtents.y : 1;
+		const offsetX = viewport ? viewport.x / frameExtents.x : 0;
+		const offsetY = viewport ? viewport.y / frameExtents.y : 0;
+
+		if ( shadowCamera.coordinateSystem === WebGPUCoordinateSystem || shadowCamera.reversedDepth ) {
+
+			shadowMatrix.set(
+				0.5 * scaleX, 0.0, 0.0, 0.5 * scaleX + offsetX,
+				0.0, 0.5 * scaleY, 0.0, 0.5 * scaleY + offsetY,
+				0.0, 0.0, 1.0, 0.0, // Identity Z (preserving the correct [0, 1] range from the projection matrix)
+				0.0, 0.0, 0.0, 1.0
+			);
+
+		} else {
+
+			shadowMatrix.set(
+				0.5 * scaleX, 0.0, 0.0, 0.5 * scaleX + offsetX,
+				0.0, 0.5 * scaleY, 0.0, 0.5 * scaleY + offsetY,
+				0.0, 0.0, 0.5, 0.5,
+				0.0, 0.0, 0.0, 1.0
+			);
+
+		}
+
+		shadowMatrix.multiply( _projScreenMatrix );
+
+	}
+
+	/**
+	 * Returns a viewport definition for the given viewport index.
+	 *
+	 * @param {number} viewportIndex - The viewport index.
+	 * @return {Vector4} The viewport.
+	 */
+	getViewport( viewportIndex ) {
+
+		return this._viewports[ viewportIndex ];
+
+	}
+
+	/**
+	 * Returns the frame extends.
+	 *
+	 * @return {Vector2} The frame extends.
+	 */
+	getFrameExtents() {
+
+		return this._frameExtents;
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		if ( this.map ) {
+
+			this.map.dispose();
+
+		}
+
+		if ( this.mapPass ) {
+
+			this.mapPass.dispose();
+
+		}
+
+	}
+
+	/**
+	 * Copies the values of the given light shadow instance to this instance.
+	 *
+	 * @param {LightShadow} source - The light shadow to copy.
+	 * @return {LightShadow} A reference to this light shadow instance.
+	 */
+	copy( source ) {
+
+		this.camera = source.camera.clone();
+
+		this.intensity = source.intensity;
+
+		this.bias = source.bias;
+		this.radius = source.radius;
+
+		this.autoUpdate = source.autoUpdate;
+		this.needsUpdate = source.needsUpdate;
+		this.normalBias = source.normalBias;
+		this.blurSamples = source.blurSamples;
+
+		this.mapSize.copy( source.mapSize );
+
+		this.biasNode = source.biasNode;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new light shadow instance with copied values from this instance.
+	 *
+	 * @return {LightShadow} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+	/**
+	 * Serializes the light shadow into JSON.
+	 *
+	 * @return {Object} A JSON object representing the serialized light shadow.
+	 * @see {@link ObjectLoader#parse}
+	 */
+	toJSON() {
+
+		const object = {};
+
+		object.intensity = this.intensity;
+		object.bias = this.bias;
+		object.normalBias = this.normalBias;
+		object.radius = this.radius;
+		object.blurSamples = this.blurSamples;
+		object.mapSize = this.mapSize.toArray();
+
+		object.camera = this.camera.toJSON( false ).object;
+		delete object.camera.matrix;
+
+		return object;
+
+	}
+
+}
+
+const _position$2 = /*@__PURE__*/ new Vector3();
+const _quaternion$2 = /*@__PURE__*/ new Quaternion();
+const _scale$2 = /*@__PURE__*/ new Vector3();
+
+/**
+ * Abstract base class for cameras. This class should always be inherited
+ * when you build a new camera.
+ *
+ * @abstract
+ * @augments Object3D
+ */
+class Camera extends Object3D {
+
+	/**
+	 * Constructs a new camera.
+	 */
+	constructor() {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isCamera = true;
+
+		this.type = 'Camera';
+
+		/**
+		 * The inverse of the camera's world matrix.
+		 *
+		 * @type {Matrix4}
+		 */
+		this.matrixWorldInverse = new Matrix4();
+
+		/**
+		 * The camera's projection matrix.
+		 *
+		 * @type {Matrix4}
+		 */
+		this.projectionMatrix = new Matrix4();
+
+		/**
+		 * The inverse of the camera's projection matrix.
+		 *
+		 * @type {Matrix4}
+		 */
+		this.projectionMatrixInverse = new Matrix4();
+
+		/**
+		 * The coordinate system in which the camera is used.
+		 *
+		 * @type {(WebGLCoordinateSystem|WebGPUCoordinateSystem)}
+		 */
+		this.coordinateSystem = WebGLCoordinateSystem;
+
+		this._reversedDepth = false;
+
+	}
+
+	/**
+	 * The flag that indicates whether the camera uses a reversed depth buffer.
+	 *
+	 * @type {boolean}
+	 * @default false
+	 */
+	get reversedDepth() {
+
+		return this._reversedDepth;
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		this.matrixWorldInverse.copy( source.matrixWorldInverse );
+
+		this.projectionMatrix.copy( source.projectionMatrix );
+		this.projectionMatrixInverse.copy( source.projectionMatrixInverse );
+
+		this.coordinateSystem = source.coordinateSystem;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a vector representing the ("look") direction of the 3D object in world space.
+	 *
+	 * This method is overwritten since cameras have a different forward vector compared to other
+	 * 3D objects. A camera looks down its local, negative z-axis by default.
+	 *
+	 * @param {Vector3} target - The target vector the result is stored to.
+	 * @return {Vector3} The 3D object's direction in world space.
+	 */
+	getWorldDirection( target ) {
+
+		return super.getWorldDirection( target ).negate();
+
+	}
+
+	updateMatrixWorld( force ) {
+
+		super.updateMatrixWorld( force );
+
+		// exclude scale from view matrix to be glTF conform
+
+		this.matrixWorld.decompose( _position$2, _quaternion$2, _scale$2 );
+
+		if ( _scale$2.x === 1 && _scale$2.y === 1 && _scale$2.z === 1 ) {
+
+			this.matrixWorldInverse.copy( this.matrixWorld ).invert();
+
+		} else {
+
+			this.matrixWorldInverse.compose( _position$2, _quaternion$2, _scale$2.set( 1, 1, 1 ) ).invert();
+
+		}
+
+	}
+
+	updateWorldMatrix( updateParents, updateChildren, force = false ) {
+
+		super.updateWorldMatrix( updateParents, updateChildren, force );
+
+		// exclude scale from view matrix to be glTF conform
+
+		this.matrixWorld.decompose( _position$2, _quaternion$2, _scale$2 );
+
+		if ( _scale$2.x === 1 && _scale$2.y === 1 && _scale$2.z === 1 ) {
+
+			this.matrixWorldInverse.copy( this.matrixWorld ).invert();
+
+		} else {
+
+			this.matrixWorldInverse.compose( _position$2, _quaternion$2, _scale$2.set( 1, 1, 1 ) ).invert();
+
+		}
+
+	}
+
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+}
+
+const _v3$1 = /*@__PURE__*/ new Vector3();
+const _minTarget = /*@__PURE__*/ new Vector2();
+const _maxTarget = /*@__PURE__*/ new Vector2();
+
+/**
+ * Camera that uses [perspective projection](https://en.wikipedia.org/wiki/Perspective_(graphical)).
+ *
+ * This projection mode is designed to mimic the way the human eye sees. It
+ * is the most common projection mode used for rendering a 3D scene.
+ *
+ * ```js
+ * const camera = new THREE.PerspectiveCamera( 45, width / height, 1, 1000 );
+ * scene.add( camera );
+ * ```
+ *
+ * @augments Camera
+ */
+class PerspectiveCamera extends Camera {
+
+	/**
+	 * Constructs a new perspective camera.
+	 *
+	 * @param {number} [fov=50] - The vertical field of view.
+	 * @param {number} [aspect=1] - The aspect ratio.
+	 * @param {number} [near=0.1] - The camera's near plane.
+	 * @param {number} [far=2000] - The camera's far plane.
+	 */
+	constructor( fov = 50, aspect = 1, near = 0.1, far = 2000 ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isPerspectiveCamera = true;
+
+		this.type = 'PerspectiveCamera';
+
+		/**
+		 * The vertical field of view, from bottom to top of view,
+		 * in degrees.
+		 *
+		 * @type {number}
+		 * @default 50
+		 */
+		this.fov = fov;
+
+		/**
+		 * The zoom factor of the camera.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.zoom = 1;
+
+		/**
+		 * The camera's near plane. The valid range is greater than `0`
+		 * and less than the current value of {@link PerspectiveCamera#far}.
+		 *
+		 * Note that, unlike for the {@link OrthographicCamera}, `0` is <em>not</em> a
+		 * valid value for a perspective camera's near plane.
+		 *
+		 * @type {number}
+		 * @default 0.1
+		 */
+		this.near = near;
+
+		/**
+		 * The camera's far plane. Must be greater than the
+		 * current value of {@link PerspectiveCamera#near}.
+		 *
+		 * @type {number}
+		 * @default 2000
+		 */
+		this.far = far;
+
+		/**
+		 * Object distance used for stereoscopy and depth-of-field effects. This
+		 * parameter does not influence the projection matrix unless a
+		 * {@link StereoCamera} is being used.
+		 *
+		 * @type {number}
+		 * @default 10
+		 */
+		this.focus = 10;
+
+		/**
+		 * The aspect ratio, usually the canvas width / canvas height.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.aspect = aspect;
+
+		/**
+		 * Represents the frustum window specification. This property should not be edited
+		 * directly but via {@link PerspectiveCamera#setViewOffset} and {@link PerspectiveCamera#clearViewOffset}.
+		 *
+		 * @type {?Object}
+		 * @default null
+		 */
+		this.view = null;
+
+		/**
+		 * Film size used for the larger axis. Default is `35` (millimeters). This
+		 * parameter does not influence the projection matrix unless {@link PerspectiveCamera#filmOffset}
+		 * is set to a nonzero value.
+		 *
+		 * @type {number}
+		 * @default 35
+		 */
+		this.filmGauge = 35;
+
+		/**
+		 * Horizontal off-center offset in the same unit as {@link PerspectiveCamera#filmGauge}.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.filmOffset = 0;
+
+		this.updateProjectionMatrix();
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		this.fov = source.fov;
+		this.zoom = source.zoom;
+
+		this.near = source.near;
+		this.far = source.far;
+		this.focus = source.focus;
+
+		this.aspect = source.aspect;
+		this.view = source.view === null ? null : Object.assign( {}, source.view );
+
+		this.filmGauge = source.filmGauge;
+		this.filmOffset = source.filmOffset;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the FOV by focal length in respect to the current {@link PerspectiveCamera#filmGauge}.
+	 *
+	 * The default film gauge is 35, so that the focal length can be specified for
+	 * a 35mm (full frame) camera.
+	 *
+	 * @param {number} focalLength - Values for focal length and film gauge must have the same unit.
+	 */
+	setFocalLength( focalLength ) {
+
+		/** see {@link http://www.bobatkins.com/photography/technical/field_of_view.html} */
+		const vExtentSlope = 0.5 * this.getFilmHeight() / focalLength;
+
+		this.fov = RAD2DEG * 2 * Math.atan( vExtentSlope );
+		this.updateProjectionMatrix();
+
+	}
+
+	/**
+	 * Returns the focal length from the current {@link PerspectiveCamera#fov} and
+	 * {@link PerspectiveCamera#filmGauge}.
+	 *
+	 * @return {number} The computed focal length.
+	 */
+	getFocalLength() {
+
+		const vExtentSlope = Math.tan( DEG2RAD * 0.5 * this.fov );
+
+		return 0.5 * this.getFilmHeight() / vExtentSlope;
+
+	}
+
+	/**
+	 * Returns the current vertical field of view angle in degrees considering {@link PerspectiveCamera#zoom}.
+	 *
+	 * @return {number} The effective FOV.
+	 */
+	getEffectiveFOV() {
+
+		return RAD2DEG * 2 * Math.atan(
+			Math.tan( DEG2RAD * 0.5 * this.fov ) / this.zoom );
+
+	}
+
+	/**
+	 * Returns the width of the image on the film. If {@link PerspectiveCamera#aspect} is greater than or
+	 * equal to one (landscape format), the result equals {@link PerspectiveCamera#filmGauge}.
+	 *
+	 * @return {number} The film width.
+	 */
+	getFilmWidth() {
+
+		// film not completely covered in portrait format (aspect < 1)
+		return this.filmGauge * Math.min( this.aspect, 1 );
+
+	}
+
+	/**
+	 * Returns the height of the image on the film. If {@link PerspectiveCamera#aspect} is greater than or
+	 * equal to one (landscape format), the result equals {@link PerspectiveCamera#filmGauge}.
+	 *
+	 * @return {number} The film width.
+	 */
+	getFilmHeight() {
+
+		// film not completely covered in landscape format (aspect > 1)
+		return this.filmGauge / Math.max( this.aspect, 1 );
+
+	}
+
+	/**
+	 * Computes the 2D bounds of the camera's viewable rectangle at a given distance along the viewing direction.
+	 * Sets `minTarget` and `maxTarget` to the coordinates of the lower-left and upper-right corners of the view rectangle.
+	 *
+	 * @param {number} distance - The viewing distance.
+	 * @param {Vector2} minTarget - The lower-left corner of the view rectangle is written into this vector.
+	 * @param {Vector2} maxTarget - The upper-right corner of the view rectangle is written into this vector.
+	 */
+	getViewBounds( distance, minTarget, maxTarget ) {
+
+		_v3$1.set( -1, -1, 0.5 ).applyMatrix4( this.projectionMatrixInverse );
+
+		minTarget.set( _v3$1.x, _v3$1.y ).multiplyScalar( - distance / _v3$1.z );
+
+		_v3$1.set( 1, 1, 0.5 ).applyMatrix4( this.projectionMatrixInverse );
+
+		maxTarget.set( _v3$1.x, _v3$1.y ).multiplyScalar( - distance / _v3$1.z );
+
+	}
+
+	/**
+	 * Computes the width and height of the camera's viewable rectangle at a given distance along the viewing direction.
+	 *
+	 * @param {number} distance - The viewing distance.
+	 * @param {Vector2} target - The target vector that is used to store result where x is width and y is height.
+	 * @returns {Vector2} The view size.
+	 */
+	getViewSize( distance, target ) {
+
+		this.getViewBounds( distance, _minTarget, _maxTarget );
+
+		return target.subVectors( _maxTarget, _minTarget );
+
+	}
+
+	/**
+	 * Sets an offset in a larger frustum. This is useful for multi-window or
+	 * multi-monitor/multi-machine setups.
+	 *
+	 * For example, if you have 3x2 monitors and each monitor is 1920x1080 and
+	 * the monitors are in grid like this
+	 *```
+	 *   +---+---+---+
+	 *   | A | B | C |
+	 *   +---+---+---+
+	 *   | D | E | F |
+	 *   +---+---+---+
+	 *```
+	 * then for each monitor you would call it like this:
+	 *```js
+	 * const w = 1920;
+	 * const h = 1080;
+	 * const fullWidth = w * 3;
+	 * const fullHeight = h * 2;
+	 *
+	 * // --A--
+	 * camera.setViewOffset( fullWidth, fullHeight, w * 0, h * 0, w, h );
+	 * // --B--
+	 * camera.setViewOffset( fullWidth, fullHeight, w * 1, h * 0, w, h );
+	 * // --C--
+	 * camera.setViewOffset( fullWidth, fullHeight, w * 2, h * 0, w, h );
+	 * // --D--
+	 * camera.setViewOffset( fullWidth, fullHeight, w * 0, h * 1, w, h );
+	 * // --E--
+	 * camera.setViewOffset( fullWidth, fullHeight, w * 1, h * 1, w, h );
+	 * // --F--
+	 * camera.setViewOffset( fullWidth, fullHeight, w * 2, h * 1, w, h );
+	 * ```
+	 *
+	 * Note there is no reason monitors have to be the same size or in a grid.
+	 *
+	 * @param {number} fullWidth - The full width of multiview setup.
+	 * @param {number} fullHeight - The full height of multiview setup.
+	 * @param {number} x - The horizontal offset of the subcamera.
+	 * @param {number} y - The vertical offset of the subcamera.
+	 * @param {number} width - The width of subcamera.
+	 * @param {number} height - The height of subcamera.
+	 */
+	setViewOffset( fullWidth, fullHeight, x, y, width, height ) {
+
+		this.aspect = fullWidth / fullHeight;
+
+		if ( this.view === null ) {
+
+			this.view = {
+				enabled: true,
+				fullWidth: 1,
+				fullHeight: 1,
+				offsetX: 0,
+				offsetY: 0,
+				width: 1,
+				height: 1
+			};
+
+		}
+
+		this.view.enabled = true;
+		this.view.fullWidth = fullWidth;
+		this.view.fullHeight = fullHeight;
+		this.view.offsetX = x;
+		this.view.offsetY = y;
+		this.view.width = width;
+		this.view.height = height;
+
+		this.updateProjectionMatrix();
+
+	}
+
+	/**
+	 * Removes the view offset from the projection matrix.
+	 */
+	clearViewOffset() {
+
+		if ( this.view !== null ) {
+
+			this.view.enabled = false;
+
+		}
+
+		this.updateProjectionMatrix();
+
+	}
+
+	/**
+	 * Updates the camera's projection matrix. Must be called after any change of
+	 * camera properties.
+	 */
+	updateProjectionMatrix() {
+
+		const near = this.near;
+		let top = near * Math.tan( DEG2RAD * 0.5 * this.fov ) / this.zoom;
+		let height = 2 * top;
+		let width = this.aspect * height;
+		let left = -0.5 * width;
+		const view = this.view;
+
+		if ( this.view !== null && this.view.enabled ) {
+
+			const fullWidth = view.fullWidth,
+				fullHeight = view.fullHeight;
+
+			left += view.offsetX * width / fullWidth;
+			top -= view.offsetY * height / fullHeight;
+			width *= view.width / fullWidth;
+			height *= view.height / fullHeight;
+
+		}
+
+		const skew = this.filmOffset;
+		if ( skew !== 0 ) left += near * skew / this.getFilmWidth();
+
+		this.projectionMatrix.makePerspective( left, left + width, top, top - height, near, this.far, this.coordinateSystem, this.reversedDepth );
+
+		this.projectionMatrixInverse.copy( this.projectionMatrix ).invert();
+
+	}
+
+	toJSON( meta ) {
+
+		const data = super.toJSON( meta );
+
+		data.object.fov = this.fov;
+		data.object.zoom = this.zoom;
+
+		data.object.near = this.near;
+		data.object.far = this.far;
+		data.object.focus = this.focus;
+
+		data.object.aspect = this.aspect;
+
+		if ( this.view !== null ) data.object.view = Object.assign( {}, this.view );
+
+		data.object.filmGauge = this.filmGauge;
+		data.object.filmOffset = this.filmOffset;
+
+		return data;
+
+	}
+
+}
+
+/**
+ * Represents the shadow configuration of directional lights.
+ *
+ * @augments LightShadow
+ */
+class SpotLightShadow extends LightShadow {
+
+	/**
+	 * Constructs a new spot light shadow.
+	 */
+	constructor() {
+
+		super( new PerspectiveCamera( 50, 1, 0.5, 500 ) );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isSpotLightShadow = true;
+
+		/**
+		 * Used to focus the shadow camera. The camera's field of view is set as a
+		 * percentage of the spotlight's field-of-view. Range is `[0, 1]`.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.focus = 1;
+
+		/**
+		 * Texture aspect ratio.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.aspect = 1;
+
+	}
+
+	updateMatrices( light ) {
+
+		const camera = this.camera;
+
+		const fov = RAD2DEG * 2 * light.angle * this.focus;
+		const aspect = ( this.mapSize.width / this.mapSize.height ) * this.aspect;
+		const far = light.distance || camera.far;
+
+		if ( fov !== camera.fov || aspect !== camera.aspect || far !== camera.far ) {
+
+			camera.fov = fov;
+			camera.aspect = aspect;
+			camera.far = far;
+			camera.updateProjectionMatrix();
+
+		}
+
+		super.updateMatrices( light );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.focus = source.focus;
+		this.aspect = source.aspect;
+
+		return this;
+
+	}
+
+	/**
+	 * Serializes the light shadow into JSON.
+	 *
+	 * @return {Object} A JSON object representing the serialized light shadow.
+	 * @see {@link ObjectLoader#parse}
+	 */
+	toJSON() {
+
+		const object = super.toJSON();
+
+		object.focus = this.focus;
+		object.aspect = this.aspect;
+
+		return object;
+
+	}
+
+}
+
+/**
+ * This light gets emitted from a single point in one direction, along a cone
+ * that increases in size the further from the light it gets.
+ *
+ * This light can cast shadows - see the {@link SpotLightShadow} for details.
+ *
+ * ```js
+ * // white spotlight shining from the side, modulated by a texture
+ * const spotLight = new THREE.SpotLight( 0xffffff );
+ * spotLight.position.set( 100, 1000, 100 );
+ * spotLight.map = new THREE.TextureLoader().load( url );
+ *
+ * spotLight.castShadow = true;
+ * spotLight.shadow.mapSize.width = 1024;
+ * spotLight.shadow.mapSize.height = 1024;
+ * spotLight.shadow.camera.near = 500;
+ * spotLight.shadow.camera.far = 4000;
+ * spotLight.shadow.camera.fov = 30;s
+ * ```
+ *
+ * @augments Light
+ */
+class SpotLight extends Light {
+
+	/**
+	 * Constructs a new spot light.
+	 *
+	 * @param {(number|Color|string)} [color=0xffffff] - The light's color.
+	 * @param {number} [intensity=1] - The light's strength/intensity measured in candela (cd).
+	 * @param {number} [distance=0] - Maximum range of the light. `0` means no limit.
+	 * @param {number} [angle=Math.PI/3] - Maximum angle of light dispersion from its direction whose upper bound is `Math.PI/2`.
+	 * @param {number} [penumbra=0] - Percent of the spotlight cone that is attenuated due to penumbra. Value range is `[0,1]`.
+	 * @param {number} [decay=2] - The amount the light dims along the distance of the light.
+	 */
+	constructor( color, intensity, distance = 0, angle = Math.PI / 3, penumbra = 0, decay = 2 ) {
+
+		super( color, intensity );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isSpotLight = true;
+
+		this.type = 'SpotLight';
+
+		this.position.copy( Object3D.DEFAULT_UP );
+		this.updateMatrix();
+
+		/**
+		 * The spot light points from its position to the
+		 * target's position.
+		 *
+		 * For the target's position to be changed to anything other
+		 * than the default, it must be added to the scene.
+		 *
+		 * It is also possible to set the target to be another 3D object
+		 * in the scene. The light will now track the target object.
+		 *
+		 * @type {Object3D}
+		 */
+		this.target = new Object3D();
+
+		/**
+		 * Maximum range of the light. `0` means no limit.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.distance = distance;
+
+		/**
+		 * Maximum angle of light dispersion from its direction whose upper bound is `Math.PI/2`.
+		 *
+		 * @type {number}
+		 * @default Math.PI/3
+		 */
+		this.angle = angle;
+
+		/**
+		 * Percent of the spotlight cone that is attenuated due to penumbra.
+		 * Value range is `[0,1]`.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.penumbra = penumbra;
+
+		/**
+		 * The amount the light dims along the distance of the light. In context of
+		 * physically-correct rendering the default value should not be changed.
+		 *
+		 * @type {number}
+		 * @default 2
+		 */
+		this.decay = decay;
+
+		/**
+		 * A texture used to modulate the color of the light. The spot light
+		 * color is mixed with the RGB value of this texture, with a ratio
+		 * corresponding to its alpha value. The cookie-like masking effect is
+		 * reproduced using pixel values (0, 0, 0, 1-cookie_value).
+		 *
+		 * *Warning*: This property is disabled if {@link Object3D#castShadow} is set to `false`.
+		 *
+		 * @type {?Texture}
+		 * @default null
+		 */
+		this.map = null;
+
+		/**
+		 * This property holds the light's shadow configuration.
+		 *
+		 * @type {SpotLightShadow}
+		 */
+		this.shadow = new SpotLightShadow();
+
+	}
+
+	/**
+	 * The light's power. Power is the luminous power of the light measured in lumens (lm).
+	 *  Changing the power will also change the light's intensity.
+	 *
+	 * @type {number}
+	 */
+	get power() {
+
+		// compute the light's luminous power (in lumens) from its intensity (in candela)
+		// by convention for a spotlight, luminous power (lm) = π * luminous intensity (cd)
+		return this.intensity * Math.PI;
+
+	}
+
+	set power( power ) {
+
+		// set the light's intensity (in candela) from the desired luminous power (in lumens)
+		this.intensity = power / Math.PI;
+
+	}
+
+	dispose() {
+
+		super.dispose();
+
+		this.shadow.dispose();
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		this.distance = source.distance;
+		this.angle = source.angle;
+		this.penumbra = source.penumbra;
+		this.decay = source.decay;
+
+		this.target = source.target.clone();
+		this.map = source.map;
+		this.shadow = source.shadow.clone();
+
+		return this;
+
+	}
+
+	toJSON( meta ) {
+
+		const data = super.toJSON( meta );
+
+		data.object.distance = this.distance;
+		data.object.angle = this.angle;
+		data.object.decay = this.decay;
+		data.object.penumbra = this.penumbra;
+
+		data.object.target = this.target.uuid;
+
+		if ( this.map && this.map.isTexture ) data.object.map = this.map.toJSON( meta ).uuid;
+
+		data.object.shadow = this.shadow.toJSON();
+
+		return data;
+
+	}
+
+}
+
+/**
+ * Represents the shadow configuration of point lights.
+ *
+ * @augments LightShadow
+ */
+class PointLightShadow extends LightShadow {
+
+	/**
+	 * Constructs a new point light shadow.
+	 */
+	constructor() {
+
+		super( new PerspectiveCamera( 90, 1, 0.5, 500 ) );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isPointLightShadow = true;
+
+	}
+
+}
+
+/**
+ * A light that gets emitted from a single point in all directions. A common
+ * use case for this is to replicate the light emitted from a bare
+ * lightbulb.
+ *
+ * This light can cast shadows - see the {@link PointLightShadow} for details.
+ *
+ * ```js
+ * const light = new THREE.PointLight( 0xff0000, 1, 100 );
+ * light.position.set( 50, 50, 50 );
+ * scene.add( light );
+ * ```
+ *
+ * @augments Light
+ */
+class PointLight extends Light {
+
+	/**
+	 * Constructs a new point light.
+	 *
+	 * @param {(number|Color|string)} [color=0xffffff] - The light's color.
+	 * @param {number} [intensity=1] - The light's strength/intensity measured in candela (cd).
+	 * @param {number} [distance=0] - Maximum range of the light. `0` means no limit.
+	 * @param {number} [decay=2] - The amount the light dims along the distance of the light.
+	 */
+	constructor( color, intensity, distance = 0, decay = 2 ) {
+
+		super( color, intensity );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isPointLight = true;
+
+		this.type = 'PointLight';
+
+		/**
+		 * When distance is zero, light will attenuate according to inverse-square
+		 * law to infinite distance. When distance is non-zero, light will attenuate
+		 * according to inverse-square law until near the distance cutoff, where it
+		 * will then attenuate quickly and smoothly to 0. Inherently, cutoffs are not
+		 * physically correct.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.distance = distance;
+
+		/**
+		 * The amount the light dims along the distance of the light. In context of
+		 * physically-correct rendering the default value should not be changed.
+		 *
+		 * @type {number}
+		 * @default 2
+		 */
+		this.decay = decay;
+
+		/**
+		 * This property holds the light's shadow configuration.
+		 *
+		 * @type {PointLightShadow}
+		 */
+		this.shadow = new PointLightShadow();
+
+	}
+
+	/**
+	 * The light's power. Power is the luminous power of the light measured in lumens (lm).
+	 * Changing the power will also change the light's intensity.
+	 *
+	 * @type {number}
+	 */
+	get power() {
+
+		// compute the light's luminous power (in lumens) from its intensity (in candela)
+		// for an isotropic light source, luminous power (lm) = 4 π luminous intensity (cd)
+		return this.intensity * 4 * Math.PI;
+
+	}
+
+	set power( power ) {
+
+		// set the light's intensity (in candela) from the desired luminous power (in lumens)
+		this.intensity = power / ( 4 * Math.PI );
+
+	}
+
+	dispose() {
+
+		super.dispose();
+
+		this.shadow.dispose();
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		this.distance = source.distance;
+		this.decay = source.decay;
+
+		this.shadow = source.shadow.clone();
+
+		return this;
+
+	}
+
+	toJSON( meta ) {
+
+		const data = super.toJSON( meta );
+
+		data.object.distance = this.distance;
+		data.object.decay = this.decay;
+
+		data.object.shadow = this.shadow.toJSON();
+
+		return data;
+
+	}
+
+}
+
+/**
+ * Camera that uses [orthographic projection](https://en.wikipedia.org/wiki/Orthographic_projection).
+ *
+ * In this projection mode, an object's size in the rendered image stays
+ * constant regardless of its distance from the camera. This can be useful
+ * for rendering 2D scenes and UI elements, amongst other things.
+ *
+ * ```js
+ * const camera = new THREE.OrthographicCamera( width / - 2, width / 2, height / 2, height / - 2, 1, 1000 );
+ * scene.add( camera );
+ * ```
+ *
+ * @augments Camera
+ */
+class OrthographicCamera extends Camera {
+
+	/**
+	 * Constructs a new orthographic camera.
+	 *
+	 * @param {number} [left=-1] - The left plane of the camera's frustum.
+	 * @param {number} [right=1] - The right plane of the camera's frustum.
+	 * @param {number} [top=1] - The top plane of the camera's frustum.
+	 * @param {number} [bottom=-1] - The bottom plane of the camera's frustum.
+	 * @param {number} [near=0.1] - The camera's near plane.
+	 * @param {number} [far=2000] - The camera's far plane.
+	 */
+	constructor( left = -1, right = 1, top = 1, bottom = -1, near = 0.1, far = 2000 ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isOrthographicCamera = true;
+
+		this.type = 'OrthographicCamera';
+
+		/**
+		 * The zoom factor of the camera.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.zoom = 1;
+
+		/**
+		 * Represents the frustum window specification. This property should not be edited
+		 * directly but via {@link PerspectiveCamera#setViewOffset} and {@link PerspectiveCamera#clearViewOffset}.
+		 *
+		 * @type {?Object}
+		 * @default null
+		 */
+		this.view = null;
+
+		/**
+		 * The left plane of the camera's frustum.
+		 *
+		 * @type {number}
+		 * @default -1
+		 */
+		this.left = left;
+
+		/**
+		 * The right plane of the camera's frustum.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.right = right;
+
+		/**
+		 * The top plane of the camera's frustum.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.top = top;
+
+		/**
+		 * The bottom plane of the camera's frustum.
+		 *
+		 * @type {number}
+		 * @default -1
+		 */
+		this.bottom = bottom;
+
+		/**
+		 * The camera's near plane. The valid range is greater than `0`
+		 * and less than the current value of {@link OrthographicCamera#far}.
+		 *
+		 * Note that, unlike for the {@link PerspectiveCamera}, `0` is a
+		 * valid value for an orthographic camera's near plane.
+		 *
+		 * @type {number}
+		 * @default 0.1
+		 */
+		this.near = near;
+
+		/**
+		 * The camera's far plane. Must be greater than the
+		 * current value of {@link OrthographicCamera#near}.
+		 *
+		 * @type {number}
+		 * @default 2000
+		 */
+		this.far = far;
+
+		this.updateProjectionMatrix();
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		this.left = source.left;
+		this.right = source.right;
+		this.top = source.top;
+		this.bottom = source.bottom;
+		this.near = source.near;
+		this.far = source.far;
+
+		this.zoom = source.zoom;
+		this.view = source.view === null ? null : Object.assign( {}, source.view );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets an offset in a larger frustum. This is useful for multi-window or
+	 * multi-monitor/multi-machine setups.
+	 *
+	 * @param {number} fullWidth - The full width of multiview setup.
+	 * @param {number} fullHeight - The full height of multiview setup.
+	 * @param {number} x - The horizontal offset of the subcamera.
+	 * @param {number} y - The vertical offset of the subcamera.
+	 * @param {number} width - The width of subcamera.
+	 * @param {number} height - The height of subcamera.
+	 * @see {@link PerspectiveCamera#setViewOffset}
+	 */
+	setViewOffset( fullWidth, fullHeight, x, y, width, height ) {
+
+		if ( this.view === null ) {
+
+			this.view = {
+				enabled: true,
+				fullWidth: 1,
+				fullHeight: 1,
+				offsetX: 0,
+				offsetY: 0,
+				width: 1,
+				height: 1
+			};
+
+		}
+
+		this.view.enabled = true;
+		this.view.fullWidth = fullWidth;
+		this.view.fullHeight = fullHeight;
+		this.view.offsetX = x;
+		this.view.offsetY = y;
+		this.view.width = width;
+		this.view.height = height;
+
+		this.updateProjectionMatrix();
+
+	}
+
+	/**
+	 * Removes the view offset from the projection matrix.
+	 */
+	clearViewOffset() {
+
+		if ( this.view !== null ) {
+
+			this.view.enabled = false;
+
+		}
+
+		this.updateProjectionMatrix();
+
+	}
+
+	/**
+	 * Updates the camera's projection matrix. Must be called after any change of
+	 * camera properties.
+	 */
+	updateProjectionMatrix() {
+
+		const dx = ( this.right - this.left ) / ( 2 * this.zoom );
+		const dy = ( this.top - this.bottom ) / ( 2 * this.zoom );
+		const cx = ( this.right + this.left ) / 2;
+		const cy = ( this.top + this.bottom ) / 2;
+
+		let left = cx - dx;
+		let right = cx + dx;
+		let top = cy + dy;
+		let bottom = cy - dy;
+
+		if ( this.view !== null && this.view.enabled ) {
+
+			const scaleW = ( this.right - this.left ) / this.view.fullWidth / this.zoom;
+			const scaleH = ( this.top - this.bottom ) / this.view.fullHeight / this.zoom;
+
+			left += scaleW * this.view.offsetX;
+			right = left + scaleW * this.view.width;
+			top -= scaleH * this.view.offsetY;
+			bottom = top - scaleH * this.view.height;
+
+		}
+
+		this.projectionMatrix.makeOrthographic( left, right, top, bottom, this.near, this.far, this.coordinateSystem, this.reversedDepth );
+
+		this.projectionMatrixInverse.copy( this.projectionMatrix ).invert();
+
+	}
+
+	toJSON( meta ) {
+
+		const data = super.toJSON( meta );
+
+		data.object.zoom = this.zoom;
+		data.object.left = this.left;
+		data.object.right = this.right;
+		data.object.top = this.top;
+		data.object.bottom = this.bottom;
+		data.object.near = this.near;
+		data.object.far = this.far;
+
+		if ( this.view !== null ) data.object.view = Object.assign( {}, this.view );
+
+		return data;
+
+	}
+
+}
+
+/**
+ * Represents the shadow configuration of directional lights.
+ *
+ * @augments LightShadow
+ */
+class DirectionalLightShadow extends LightShadow {
+
+	/**
+	 * Constructs a new directional light shadow.
+	 */
+	constructor() {
+
+		super( new OrthographicCamera( -5, 5, 5, -5, 0.5, 500 ) );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isDirectionalLightShadow = true;
+
+	}
+
+}
+
+/**
+ * A light that gets emitted in a specific direction. This light will behave
+ * as though it is infinitely far away and the rays produced from it are all
+ * parallel. The common use case for this is to simulate daylight; the sun is
+ * far enough away that its position can be considered to be infinite, and
+ * all light rays coming from it are parallel.
+ *
+ * A common point of confusion for directional lights is that setting the
+ * rotation has no effect. This is because three.js's DirectionalLight is the
+ * equivalent to what is often called a 'Target Direct Light' in other
+ * applications.
+ *
+ * This means that its direction is calculated as pointing from the light's
+ * {@link Object3D#position} to the {@link DirectionalLight#target} position
+ * (as opposed to a 'Free Direct Light' that just has a rotation
+ * component).
+ *
+ * This light can cast shadows - see the {@link DirectionalLightShadow} for details.
+ *
+ * ```js
+ * // White directional light at half intensity shining from the top.
+ * const directionalLight = new THREE.DirectionalLight( 0xffffff, 0.5 );
+ * scene.add( directionalLight );
+ * ```
+ *
+ * @augments Light
+ */
+class DirectionalLight extends Light {
+
+	/**
+	 * Constructs a new directional light.
+	 *
+	 * @param {(number|Color|string)} [color=0xffffff] - The light's color.
+	 * @param {number} [intensity=1] - The light's strength/intensity.
+	 */
+	constructor( color, intensity ) {
+
+		super( color, intensity );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isDirectionalLight = true;
+
+		this.type = 'DirectionalLight';
+
+		this.position.copy( Object3D.DEFAULT_UP );
+		this.updateMatrix();
+
+		/**
+		 * The directional light points from its position to the
+		 * target's position.
+		 *
+		 * For the target's position to be changed to anything other
+		 * than the default, it must be added to the scene.
+		 *
+		 * It is also possible to set the target to be another 3D object
+		 * in the scene. The light will now track the target object.
+		 *
+		 * @type {Object3D}
+		 */
+		this.target = new Object3D();
+
+		/**
+		 * This property holds the light's shadow configuration.
+		 *
+		 * @type {DirectionalLightShadow}
+		 */
+		this.shadow = new DirectionalLightShadow();
+
+	}
+
+	dispose() {
+
+		super.dispose();
+
+		this.shadow.dispose();
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.target = source.target.clone();
+		this.shadow = source.shadow.clone();
+
+		return this;
+
+	}
+
+	toJSON( meta ) {
+
+		const data = super.toJSON( meta );
+
+		data.object.shadow = this.shadow.toJSON();
+		data.object.target = this.target.uuid;
+
+		return data;
+
+	}
+
+}
+
+/**
+ * This light globally illuminates all objects in the scene equally.
+ *
+ * It cannot be used to cast shadows as it does not have a direction.
+ *
+ * ```js
+ * const light = new THREE.AmbientLight( 0x404040 ); // soft white light
+ * scene.add( light );
+ * ```
+ *
+ * @augments Light
+ */
+class AmbientLight extends Light {
+
+	/**
+	 * Constructs a new ambient light.
+	 *
+	 * @param {(number|Color|string)} [color=0xffffff] - The light's color.
+	 * @param {number} [intensity=1] - The light's strength/intensity.
+	 */
+	constructor( color, intensity ) {
+
+		super( color, intensity );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isAmbientLight = true;
+
+		this.type = 'AmbientLight';
+
+	}
+
+}
+
+/**
+ * This class emits light uniformly across the face a rectangular plane.
+ * This light type can be used to simulate light sources such as bright
+ * windows or strip lighting.
+ *
+ * Important Notes:
+ *
+ * - There is no shadow support.
+ * - Only PBR materials are supported.
+ * - You have to include `RectAreaLightUniformsLib` (`WebGLRenderer`) or `RectAreaLightTexturesLib` (`WebGPURenderer`)
+ * into your app and init the uniforms/textures.
+ *
+ * ```js
+ * RectAreaLightUniformsLib.init(); // only relevant for WebGLRenderer
+ * THREE.RectAreaLightNode.setLTC( RectAreaLightTexturesLib.init() ); //  only relevant for WebGPURenderer
+ *
+ * const intensity = 1; const width = 10; const height = 10;
+ * const rectLight = new THREE.RectAreaLight( 0xffffff, intensity, width, height );
+ * rectLight.position.set( 5, 5, 0 );
+ * rectLight.lookAt( 0, 0, 0 );
+ * scene.add( rectLight )
+ * ```
+ *
+ * @augments Light
+ */
+class RectAreaLight extends Light {
+
+	/**
+	 * Constructs a new area light.
+	 *
+	 * @param {(number|Color|string)} [color=0xffffff] - The light's color.
+	 * @param {number} [intensity=1] - The light's strength/intensity.
+	 * @param {number} [width=10] - The width of the light.
+	 * @param {number} [height=10] - The height of the light.
+	 */
+	constructor( color, intensity, width = 10, height = 10 ) {
+
+		super( color, intensity );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isRectAreaLight = true;
+
+		this.type = 'RectAreaLight';
+
+		/**
+		 * The width of the light.
+		 *
+		 * @type {number}
+		 * @default 10
+		 */
+		this.width = width;
+
+		/**
+		 * The height of the light.
+		 *
+		 * @type {number}
+		 * @default 10
+		 */
+		this.height = height;
+
+	}
+
+	/**
+	 * The light's power. Power is the luminous power of the light measured in lumens (lm).
+	 * Changing the power will also change the light's intensity.
+	 *
+	 * @type {number}
+	 */
+	get power() {
+
+		// compute the light's luminous power (in lumens) from its intensity (in nits)
+		return this.intensity * this.width * this.height * Math.PI;
+
+	}
+
+	set power( power ) {
+
+		// set the light's intensity (in nits) from the desired luminous power (in lumens)
+		this.intensity = power / ( this.width * this.height * Math.PI );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.width = source.width;
+		this.height = source.height;
+
+		return this;
+
+	}
+
+	toJSON( meta ) {
+
+		const data = super.toJSON( meta );
+
+		data.object.width = this.width;
+		data.object.height = this.height;
+
+		return data;
+
+	}
+
+}
+
+/**
+ * Represents a third-order spherical harmonics (SH). Light probes use this class
+ * to encode lighting information.
+ *
+ * - Primary reference: {@link https://graphics.stanford.edu/papers/envmap/envmap.pdf}
+ * - Secondary reference: {@link https://www.ppsloan.org/publications/StupidSH36.pdf}
+ */
+class SphericalHarmonics3 {
+
+	/**
+	 * Constructs a new spherical harmonics.
+	 */
+	constructor() {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isSphericalHarmonics3 = true;
+
+		/**
+		 * An array holding the (9) SH coefficients.
+		 *
+		 * @type {Array<Vector3>}
+		 */
+		this.coefficients = [];
+
+		for ( let i = 0; i < 9; i ++ ) {
+
+			this.coefficients.push( new Vector3() );
+
+		}
+
+	}
+
+	/**
+	 * Sets the given SH coefficients to this instance by copying
+	 * the values.
+	 *
+	 * @param {Array<Vector3>} coefficients - The SH coefficients.
+	 * @return {SphericalHarmonics3} A reference to this spherical harmonics.
+	 */
+	set( coefficients ) {
+
+		for ( let i = 0; i < 9; i ++ ) {
+
+			this.coefficients[ i ].copy( coefficients[ i ] );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets all SH coefficients to `0`.
+	 *
+	 * @return {SphericalHarmonics3} A reference to this spherical harmonics.
+	 */
+	zero() {
+
+		for ( let i = 0; i < 9; i ++ ) {
+
+			this.coefficients[ i ].set( 0, 0, 0 );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the radiance in the direction of the given normal.
+	 *
+	 * @param {Vector3} normal - The normal vector (assumed to be unit length)
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The radiance.
+	 */
+	getAt( normal, target ) {
+
+		// normal is assumed to be unit length
+
+		const x = normal.x, y = normal.y, z = normal.z;
+
+		const coeff = this.coefficients;
+
+		// band 0
+		target.copy( coeff[ 0 ] ).multiplyScalar( 0.282095 );
+
+		// band 1
+		target.addScaledVector( coeff[ 1 ], 0.488603 * y );
+		target.addScaledVector( coeff[ 2 ], 0.488603 * z );
+		target.addScaledVector( coeff[ 3 ], 0.488603 * x );
+
+		// band 2
+		target.addScaledVector( coeff[ 4 ], 1.092548 * ( x * y ) );
+		target.addScaledVector( coeff[ 5 ], 1.092548 * ( y * z ) );
+		target.addScaledVector( coeff[ 6 ], 0.315392 * ( 3.0 * z * z - 1.0 ) );
+		target.addScaledVector( coeff[ 7 ], 1.092548 * ( x * z ) );
+		target.addScaledVector( coeff[ 8 ], 0.546274 * ( x * x - y * y ) );
+
+		return target;
+
+	}
+
+	/**
+	 * Returns the irradiance (radiance convolved with cosine lobe) in the
+	 * direction of the given normal.
+	 *
+	 * @param {Vector3} normal - The normal vector (assumed to be unit length)
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The irradiance.
+	 */
+	getIrradianceAt( normal, target ) {
+
+		// normal is assumed to be unit length
+
+		const x = normal.x, y = normal.y, z = normal.z;
+
+		const coeff = this.coefficients;
+
+		// band 0
+		target.copy( coeff[ 0 ] ).multiplyScalar( 0.886227 ); // π * 0.282095
+
+		// band 1
+		target.addScaledVector( coeff[ 1 ], 2.0 * 0.511664 * y ); // ( 2 * π / 3 ) * 0.488603
+		target.addScaledVector( coeff[ 2 ], 2.0 * 0.511664 * z );
+		target.addScaledVector( coeff[ 3 ], 2.0 * 0.511664 * x );
+
+		// band 2
+		target.addScaledVector( coeff[ 4 ], 2.0 * 0.429043 * x * y ); // ( π / 4 ) * 1.092548
+		target.addScaledVector( coeff[ 5 ], 2.0 * 0.429043 * y * z );
+		target.addScaledVector( coeff[ 6 ], 0.743125 * z * z - 0.247708 ); // ( π / 4 ) * 0.315392 * 3
+		target.addScaledVector( coeff[ 7 ], 2.0 * 0.429043 * x * z );
+		target.addScaledVector( coeff[ 8 ], 0.429043 * ( x * x - y * y ) ); // ( π / 4 ) * 0.546274
+
+		return target;
+
+	}
+
+	/**
+	 * Adds the given SH to this instance.
+	 *
+	 * @param {SphericalHarmonics3} sh - The SH to add.
+	 * @return {SphericalHarmonics3} A reference to this spherical harmonics.
+	 */
+	add( sh ) {
+
+		for ( let i = 0; i < 9; i ++ ) {
+
+			this.coefficients[ i ].add( sh.coefficients[ i ] );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * A convenience method for performing {@link SphericalHarmonics3#add} and
+	 * {@link SphericalHarmonics3#scale} at once.
+	 *
+	 * @param {SphericalHarmonics3} sh - The SH to add.
+	 * @param {number} s - The scale factor.
+	 * @return {SphericalHarmonics3} A reference to this spherical harmonics.
+	 */
+	addScaledSH( sh, s ) {
+
+		for ( let i = 0; i < 9; i ++ ) {
+
+			this.coefficients[ i ].addScaledVector( sh.coefficients[ i ], s );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Scales this SH by the given scale factor.
+	 *
+	 * @param {number} s - The scale factor.
+	 * @return {SphericalHarmonics3} A reference to this spherical harmonics.
+	 */
+	scale( s ) {
+
+		for ( let i = 0; i < 9; i ++ ) {
+
+			this.coefficients[ i ].multiplyScalar( s );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Linear interpolates between the given SH and this instance by the given
+	 * alpha factor.
+	 *
+	 * @param {SphericalHarmonics3} sh - The SH to interpolate with.
+	 * @param {number} alpha - The alpha factor.
+	 * @return {SphericalHarmonics3} A reference to this spherical harmonics.
+	 */
+	lerp( sh, alpha ) {
+
+		for ( let i = 0; i < 9; i ++ ) {
+
+			this.coefficients[ i ].lerp( sh.coefficients[ i ], alpha );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this spherical harmonics is equal with the given one.
+	 *
+	 * @param {SphericalHarmonics3} sh - The spherical harmonics to test for equality.
+	 * @return {boolean} Whether this spherical harmonics is equal with the given one.
+	 */
+	equals( sh ) {
+
+		for ( let i = 0; i < 9; i ++ ) {
+
+			if ( ! this.coefficients[ i ].equals( sh.coefficients[ i ] ) ) {
+
+				return false;
+
+			}
+
+		}
+
+		return true;
+
+	}
+
+	/**
+	 * Copies the values of the given spherical harmonics to this instance.
+	 *
+	 * @param {SphericalHarmonics3} sh - The spherical harmonics to copy.
+	 * @return {SphericalHarmonics3} A reference to this spherical harmonics.
+	 */
+	copy( sh ) {
+
+		return this.set( sh.coefficients );
+
+	}
+
+	/**
+	 * Returns a new spherical harmonics with copied values from this instance.
+	 *
+	 * @return {SphericalHarmonics3} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+	/**
+	 * Sets the SH coefficients of this instance from the given array.
+	 *
+	 * @param {Array<number>} array - An array holding the SH coefficients.
+	 * @param {number} [offset=0] - The array offset where to start copying.
+	 * @return {SphericalHarmonics3} A clone of this instance.
+	 */
+	fromArray( array, offset = 0 ) {
+
+		const coefficients = this.coefficients;
+
+		for ( let i = 0; i < 9; i ++ ) {
+
+			coefficients[ i ].fromArray( array, offset + ( i * 3 ) );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns an array with the SH coefficients, or copies them into the provided
+	 * array. The coefficients are represented as numbers.
+	 *
+	 * @param {Array<number>} [array=[]] - The target array.
+	 * @param {number} [offset=0] - The array offset where to start copying.
+	 * @return {Array<number>} An array with flat SH coefficients.
+	 */
+	toArray( array = [], offset = 0 ) {
+
+		const coefficients = this.coefficients;
+
+		for ( let i = 0; i < 9; i ++ ) {
+
+			coefficients[ i ].toArray( array, offset + ( i * 3 ) );
+
+		}
+
+		return array;
+
+	}
+
+	/**
+	 * Computes the SH basis for the given normal vector.
+	 *
+	 * @param {Vector3} normal - The normal.
+	 * @param {Array<number>} shBasis - The target array holding the SH basis.
+	 */
+	static getBasisAt( normal, shBasis ) {
+
+		// normal is assumed to be unit length
+
+		const x = normal.x, y = normal.y, z = normal.z;
+
+		// band 0
+		shBasis[ 0 ] = 0.282095;
+
+		// band 1
+		shBasis[ 1 ] = 0.488603 * y;
+		shBasis[ 2 ] = 0.488603 * z;
+		shBasis[ 3 ] = 0.488603 * x;
+
+		// band 2
+		shBasis[ 4 ] = 1.092548 * x * y;
+		shBasis[ 5 ] = 1.092548 * y * z;
+		shBasis[ 6 ] = 0.315392 * ( 3 * z * z - 1 );
+		shBasis[ 7 ] = 1.092548 * x * z;
+		shBasis[ 8 ] = 0.546274 * ( x * x - y * y );
+
+	}
+
+}
+
+/**
+ * Light probes are an alternative way of adding light to a 3D scene. Unlike
+ * classical light sources (e.g. directional, point or spot lights), light
+ * probes do not emit light. Instead they store information about light
+ * passing through 3D space. During rendering, the light that hits a 3D
+ * object is approximated by using the data from the light probe.
+ *
+ * Light probes are usually created from (radiance) environment maps. The
+ * class {@link LightProbeGenerator} can be used to create light probes from
+ * cube textures or render targets. However, light estimation data could also
+ * be provided in other forms e.g. by WebXR. This enables the rendering of
+ * augmented reality content that reacts to real world lighting.
+ *
+ * The current probe implementation in three.js supports so-called diffuse
+ * light probes. This type of light probe is functionally equivalent to an
+ * irradiance environment map.
+ *
+ * @augments Light
+ */
+class LightProbe extends Light {
+
+	/**
+	 * Constructs a new light probe.
+	 *
+	 * @param {SphericalHarmonics3} sh - The spherical harmonics which represents encoded lighting information.
+	 * @param {number} [intensity=1] - The light's strength/intensity.
+	 */
+	constructor( sh = new SphericalHarmonics3(), intensity = 1 ) {
+
+		super( undefined, intensity );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isLightProbe = true;
+
+		/**
+		 * A light probe uses spherical harmonics to encode lighting information.
+		 *
+		 * @type {SphericalHarmonics3}
+		 */
+		this.sh = sh;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.sh.copy( source.sh );
+
+		return this;
+
+	}
+
+	toJSON( meta ) {
+
+		const data = super.toJSON( meta );
+
+		data.object.sh = this.sh.toArray();
+
+		return data;
+
+	}
+
+}
+
+const _customMaterials = {};
+
+/**
+ * Class for loading materials. The files are internally
+ * loaded via {@link FileLoader}.
+ *
+ * ```js
+ * const loader = new THREE.MaterialLoader();
+ * const material = await loader.loadAsync( 'material.json' );
+ * ```
+ * This loader does not support node materials. Use {@link NodeMaterialLoader} instead.
+ *
+ * @augments Loader
+ */
+class MaterialLoader extends Loader {
+
+	/**
+	 * Constructs a new material loader.
+	 *
+	 * @param {LoadingManager} [manager] - The loading manager.
+	 */
+	constructor( manager ) {
+
+		super( manager );
+
+		/**
+		 * A dictionary holding textures used by the material.
+		 *
+		 * @type {Object<string,Texture>}
+		 */
+		this.textures = {};
+
+	}
+
+	/**
+	 * Starts loading from the given URL and pass the loaded material to the `onLoad()` callback.
+	 *
+	 * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.
+	 * @param {function(Material)} onLoad - Executed when the loading process has been finished.
+	 * @param {onProgressCallback} onProgress - Executed while the loading is in progress.
+	 * @param {onErrorCallback} onError - Executed when errors occur.
+	 */
+	load( url, onLoad, onProgress, onError ) {
+
+		const scope = this;
+
+		const loader = new FileLoader( scope.manager );
+		loader.setPath( scope.path );
+		loader.setRequestHeader( scope.requestHeader );
+		loader.setWithCredentials( scope.withCredentials );
+		loader.load( url, function ( text ) {
+
+			try {
+
+				onLoad( scope.parse( JSON.parse( text ) ) );
+
+			} catch ( e ) {
+
+				if ( onError ) {
+
+					onError( e );
+
+				} else {
+
+					error( e );
+
+				}
+
+				scope.manager.itemError( url );
+
+			}
+
+		}, onProgress, onError );
+
+	}
+
+	/**
+	 * Parses the given JSON object and returns a material.
+	 *
+	 * @param {Object} json - The serialized material.
+	 * @return {Material} The parsed material.
+	 */
+	parse( json ) {
+
+		const material = this.createMaterialFromType( json.type );
+
+		material.fromJSON( json, this.textures );
+
+		return material;
+
+	}
+
+	/**
+	 * Textures are not embedded in the material JSON so they have
+	 * to be injected before the loading process starts.
+	 *
+	 * @param {Object} value - A dictionary holding textures for material properties.
+	 * @return {MaterialLoader} A reference to this material loader.
+	 */
+	setTextures( value ) {
+
+		this.textures = value;
+		return this;
+
+	}
+
+	/**
+	 * Creates a material for the given type.
+	 *
+	 * @param {string} type - The material type.
+	 * @return {Material} The new material.
+	 */
+	createMaterialFromType( type ) {
+
+		return MaterialLoader.createMaterialFromType( type );
+
+	}
+
+	/**
+	 * Creates a material for the given type.
+	 *
+	 * @static
+	 * @param {string} type - The material type.
+	 * @return {Material} The new material.
+	 */
+	static createMaterialFromType( type ) {
+
+		const materialLib = {
+			ShadowMaterial,
+			SpriteMaterial,
+			RawShaderMaterial,
+			ShaderMaterial,
+			PointsMaterial,
+			MeshPhysicalMaterial,
+			MeshStandardMaterial,
+			MeshPhongMaterial,
+			MeshToonMaterial,
+			MeshNormalMaterial,
+			MeshLambertMaterial,
+			MeshDepthMaterial,
+			MeshDistanceMaterial,
+			MeshBasicMaterial,
+			MeshMatcapMaterial,
+			LineDashedMaterial,
+			LineBasicMaterial,
+			Material,
+			... _customMaterials
+		};
+
+		const MaterialType = materialLib[ type ];
+
+		let materialInstance;
+
+		if ( MaterialType === undefined ) {
+
+			warnOnce( `MaterialLoader: Unknown material type "${ type }". Use .registerMaterial() before starting the deserialization process.` );
+			materialInstance = new Material();
+
+		} else {
+
+			materialInstance = new MaterialType();
+
+		}
+
+		return materialInstance;
+
+	}
+
+	/**
+	 * Registers the given material at the internal
+	 * material library.
+	 *
+	 * @static
+	 * @param {string} type - The material type.
+	 * @param {Material.constructor} materialClass - The material class.
+	 */
+	static registerMaterial( type, materialClass ) {
+
+		_customMaterials[ type ] = materialClass;
+
+	}
+
+}
+
+/**
+ * A class with loader utility functions.
+ */
+class LoaderUtils {
+
+	/**
+	 * Extracts the base URL from the given URL.
+	 *
+	 * @param {string} url -The URL to extract the base URL from.
+	 * @return {string} The extracted base URL.
+	 */
+	static extractUrlBase( url ) {
+
+		const index = url.lastIndexOf( '/' );
+
+		if ( index === -1 ) return './';
+
+		return url.slice( 0, index + 1 );
+
+	}
+
+	/**
+	 * Resolves relative URLs against the given path. Absolute paths, data urls,
+	 * and blob URLs will be returned as is. Invalid URLs will return an empty
+	 * string.
+	 *
+	 * @param {string} url -The URL to resolve.
+	 * @param {string} path - The base path for relative URLs to be resolved against.
+	 * @return {string} The resolved URL.
+	 */
+	static resolveURL( url, path ) {
+
+		// Invalid URL
+		if ( typeof url !== 'string' || url === '' ) return '';
+
+		// Host Relative URL
+		if ( /^https?:\/\//i.test( path ) && /^\//.test( url ) ) {
+
+			path = path.replace( /(^https?:\/\/[^\/]+).*/i, '$1' );
+
+		}
+
+		// Absolute URL http://,https://,//
+		if ( /^(https?:)?\/\//i.test( url ) ) return url;
+
+		// Data URI
+		if ( /^data:.*,.*$/i.test( url ) ) return url;
+
+		// Blob URL
+		if ( /^blob:.*$/i.test( url ) ) return url;
+
+		// Relative URL
+		return path + url;
+
+	}
+
+}
+
+/**
+ * An instanced version of a geometry.
+ */
+class InstancedBufferGeometry extends BufferGeometry {
+
+	/**
+	 * Constructs a new instanced buffer geometry.
+	 */
+	constructor() {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isInstancedBufferGeometry = true;
+
+		this.type = 'InstancedBufferGeometry';
+
+		/**
+		 * The instance count.
+		 *
+		 * @type {number}
+		 * @default Infinity
+		 */
+		this.instanceCount = Infinity;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.instanceCount = source.instanceCount;
+
+		return this;
+
+	}
+
+	toJSON() {
+
+		const data = super.toJSON();
+
+		data.instanceCount = this.instanceCount;
+
+		data.isInstancedBufferGeometry = true;
+
+		return data;
+
+	}
+
+}
+
+/**
+ * Class for loading geometries. The files are internally
+ * loaded via {@link FileLoader}.
+ *
+ * ```js
+ * const loader = new THREE.BufferGeometryLoader();
+ * const geometry = await loader.loadAsync( 'models/json/pressure.json' );
+ *
+ * const material = new THREE.MeshBasicMaterial( { color: 0xF5F5F5 } );
+ * const object = new THREE.Mesh( geometry, material );
+ * scene.add( object );
+ * ```
+ *
+ * @augments Loader
+ */
+class BufferGeometryLoader extends Loader {
+
+	/**
+	 * Constructs a new geometry loader.
+	 *
+	 * @param {LoadingManager} [manager] - The loading manager.
+	 */
+	constructor( manager ) {
+
+		super( manager );
+
+	}
+
+	/**
+	 * Starts loading from the given URL and pass the loaded geometry to the `onLoad()` callback.
+	 *
+	 * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.
+	 * @param {function(BufferGeometry)} onLoad - Executed when the loading process has been finished.
+	 * @param {onProgressCallback} onProgress - Executed while the loading is in progress.
+	 * @param {onErrorCallback} onError - Executed when errors occur.
+	 */
+	load( url, onLoad, onProgress, onError ) {
+
+		const scope = this;
+
+		const loader = new FileLoader( scope.manager );
+		loader.setPath( scope.path );
+		loader.setRequestHeader( scope.requestHeader );
+		loader.setWithCredentials( scope.withCredentials );
+		loader.load( url, function ( text ) {
+
+			try {
+
+				onLoad( scope.parse( JSON.parse( text ) ) );
+
+			} catch ( e ) {
+
+				if ( onError ) {
+
+					onError( e );
+
+				} else {
+
+					error( e );
+
+				}
+
+				scope.manager.itemError( url );
+
+			}
+
+		}, onProgress, onError );
+
+	}
+
+	/**
+	 * Parses the given JSON object and returns a geometry.
+	 *
+	 * @param {Object} json - The serialized geometry.
+	 * @return {BufferGeometry} The parsed geometry.
+	 */
+	parse( json ) {
+
+		const interleavedBufferMap = {};
+		const arrayBufferMap = {};
+
+		function getInterleavedBuffer( json, uuid ) {
+
+			if ( interleavedBufferMap[ uuid ] !== undefined ) return interleavedBufferMap[ uuid ];
+
+			const interleavedBuffers = json.interleavedBuffers;
+			const interleavedBuffer = interleavedBuffers[ uuid ];
+
+			const buffer = getArrayBuffer( json, interleavedBuffer.buffer );
+
+			const array = getTypedArray( interleavedBuffer.type, buffer );
+			const ib = new InterleavedBuffer( array, interleavedBuffer.stride );
+			ib.uuid = interleavedBuffer.uuid;
+
+			if ( interleavedBuffer.usage !== undefined ) ib.setUsage( interleavedBuffer.usage );
+
+			interleavedBufferMap[ uuid ] = ib;
+
+			return ib;
+
+		}
+
+		function getArrayBuffer( json, uuid ) {
+
+			if ( arrayBufferMap[ uuid ] !== undefined ) return arrayBufferMap[ uuid ];
+
+			const arrayBuffers = json.arrayBuffers;
+			const arrayBuffer = arrayBuffers[ uuid ];
+
+			const ab = new Uint32Array( arrayBuffer ).buffer;
+
+			arrayBufferMap[ uuid ] = ab;
+
+			return ab;
+
+		}
+
+		const geometry = json.isInstancedBufferGeometry ? new InstancedBufferGeometry() : new BufferGeometry();
+
+		const index = json.data.index;
+
+		if ( index !== undefined ) {
+
+			const typedArray = getTypedArray( index.type, index.array );
+			geometry.setIndex( new BufferAttribute( typedArray, 1 ) );
+
+		}
+
+		const attributes = json.data.attributes;
+
+		for ( const key in attributes ) {
+
+			const attribute = attributes[ key ];
+			let bufferAttribute;
+
+			if ( attribute.isInterleavedBufferAttribute ) {
+
+				const interleavedBuffer = getInterleavedBuffer( json.data, attribute.data );
+				bufferAttribute = new InterleavedBufferAttribute( interleavedBuffer, attribute.itemSize, attribute.offset, attribute.normalized );
+
+			} else {
+
+				const typedArray = getTypedArray( attribute.type, attribute.array );
+				const bufferAttributeConstr = attribute.isInstancedBufferAttribute ? InstancedBufferAttribute : BufferAttribute;
+				bufferAttribute = new bufferAttributeConstr( typedArray, attribute.itemSize, attribute.normalized );
+
+			}
+
+			if ( attribute.name !== undefined ) bufferAttribute.name = attribute.name;
+			if ( attribute.usage !== undefined ) bufferAttribute.setUsage( attribute.usage );
+			if ( attribute.gpuType !== undefined ) bufferAttribute.gpuType = attribute.gpuType;
+
+			geometry.setAttribute( key, bufferAttribute );
+
+		}
+
+		const morphAttributes = json.data.morphAttributes;
+
+		if ( morphAttributes ) {
+
+			for ( const key in morphAttributes ) {
+
+				const attributeArray = morphAttributes[ key ];
+
+				const array = [];
+
+				for ( let i = 0, il = attributeArray.length; i < il; i ++ ) {
+
+					const attribute = attributeArray[ i ];
+					let bufferAttribute;
+
+					if ( attribute.isInterleavedBufferAttribute ) {
+
+						const interleavedBuffer = getInterleavedBuffer( json.data, attribute.data );
+						bufferAttribute = new InterleavedBufferAttribute( interleavedBuffer, attribute.itemSize, attribute.offset, attribute.normalized );
+
+					} else {
+
+						const typedArray = getTypedArray( attribute.type, attribute.array );
+						bufferAttribute = new BufferAttribute( typedArray, attribute.itemSize, attribute.normalized );
+
+					}
+
+					if ( attribute.name !== undefined ) bufferAttribute.name = attribute.name;
+					if ( attribute.usage !== undefined ) bufferAttribute.setUsage( attribute.usage );
+					if ( attribute.gpuType !== undefined ) bufferAttribute.gpuType = attribute.gpuType;
+					array.push( bufferAttribute );
+
+				}
+
+				geometry.morphAttributes[ key ] = array;
+
+			}
+
+		}
+
+		const morphTargetsRelative = json.data.morphTargetsRelative;
+
+		if ( morphTargetsRelative ) {
+
+			geometry.morphTargetsRelative = true;
+
+		}
+
+		const groups = json.data.groups || json.data.drawcalls || json.data.offsets;
+
+		if ( groups !== undefined ) {
+
+			for ( let i = 0, n = groups.length; i !== n; ++ i ) {
+
+				const group = groups[ i ];
+
+				geometry.addGroup( group.start, group.count, group.materialIndex );
+
+			}
+
+		}
+
+		const boundingSphere = json.data.boundingSphere;
+
+		if ( boundingSphere !== undefined ) {
+
+			geometry.boundingSphere = new Sphere().fromJSON( boundingSphere );
+
+		}
+
+		if ( json.name ) geometry.name = json.name;
+		if ( json.userData ) geometry.userData = json.userData;
+
+		return geometry;
+
+	}
+
+}
+
+const _customGeometries = {};
+
+/**
+ * A loader for loading a JSON resource in the [JSON Object/Scene format](https://github.com/mrdoob/three.js/wiki/JSON-Object-Scene-format-4).
+ * The files are internally loaded via {@link FileLoader}.
+ *
+ * ```js
+ * const loader = new THREE.ObjectLoader();
+ * const obj = await loader.loadAsync( 'models/json/example.json' );
+ * scene.add( obj );
+ *
+ * // Alternatively, to parse a previously loaded JSON structure
+ * const object = await loader.parseAsync( a_json_object );
+ * scene.add( object );
+ * ```
+ *
+ * @augments Loader
+ */
+class ObjectLoader extends Loader {
+
+	/**
+	 * Constructs a new object loader.
+	 *
+	 * @param {LoadingManager} [manager] - The loading manager.
+	 */
+	constructor( manager ) {
+
+		super( manager );
+
+	}
+
+	/**
+	 * Starts loading from the given URL and pass the loaded 3D object to the `onLoad()` callback.
+	 *
+	 * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.
+	 * @param {function(Object3D)} onLoad - Executed when the loading process has been finished.
+	 * @param {onProgressCallback} onProgress - Executed while the loading is in progress.
+	 * @param {onErrorCallback} onError - Executed when errors occur.
+	 */
+	load( url, onLoad, onProgress, onError ) {
+
+		const scope = this;
+
+		const path = ( this.path === '' ) ? LoaderUtils.extractUrlBase( url ) : this.path;
+		this.resourcePath = this.resourcePath || path;
+
+		const loader = new FileLoader( this.manager );
+		loader.setPath( this.path );
+		loader.setRequestHeader( this.requestHeader );
+		loader.setWithCredentials( this.withCredentials );
+		loader.load( url, function ( text ) {
+
+			let json = null;
+
+			try {
+
+				json = JSON.parse( text );
+
+			} catch ( e ) {
+
+				if ( onError !== undefined ) onError( e );
+
+				error( 'ObjectLoader: Can\'t parse ' + url + '.', e.message );
+
+				return;
+
+			}
+
+			const metadata = json.metadata;
+
+			if ( metadata === undefined || metadata.type === undefined || metadata.type.toLowerCase() === 'geometry' ) {
+
+				if ( onError !== undefined ) onError( new Error( 'THREE.ObjectLoader: Can\'t load ' + url ) );
+
+				error( 'ObjectLoader: Can\'t load ' + url );
+				return;
+
+			}
+
+			scope.parse( json, onLoad );
+
+		}, onProgress, onError );
+
+	}
+
+	/**
+	 * Async version of {@link ObjectLoader#load}.
+	 *
+	 * @async
+	 * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.
+	 * @param {onProgressCallback} onProgress - Executed while the loading is in progress.
+	 * @return {Promise<Object3D>} A Promise that resolves with the loaded 3D object.
+	 */
+	async loadAsync( url, onProgress ) {
+
+		const scope = this;
+
+		const path = ( this.path === '' ) ? LoaderUtils.extractUrlBase( url ) : this.path;
+		this.resourcePath = this.resourcePath || path;
+
+		const loader = new FileLoader( this.manager );
+		loader.setPath( this.path );
+		loader.setRequestHeader( this.requestHeader );
+		loader.setWithCredentials( this.withCredentials );
+
+		const text = await loader.loadAsync( url, onProgress );
+
+		let json;
+
+		try {
+
+			json = JSON.parse( text );
+
+		} catch ( e ) {
+
+			throw new Error( 'THREE.ObjectLoader: Can\'t parse ' + url + '. ' + e.message );
+
+		}
+
+		const metadata = json.metadata;
+
+		if ( metadata === undefined || metadata.type === undefined || metadata.type.toLowerCase() === 'geometry' ) {
+
+			throw new Error( 'THREE.ObjectLoader: Can\'t load ' + url );
+
+		}
+
+		return await scope.parseAsync( json );
+
+	}
+
+	/**
+	 * Parses the given JSON. This is used internally by {@link ObjectLoader#load}
+	 * but can also be used directly to parse a previously loaded JSON structure.
+	 *
+	 * @param {Object} json - The serialized 3D object.
+	 * @param {onLoad} onLoad - Executed when all resources (e.g. textures) have been fully loaded.
+	 * @return {Object3D} The parsed 3D object.
+	 */
+	parse( json, onLoad ) {
+
+		const animations = this.parseAnimations( json.animations );
+		const shapes = this.parseShapes( json.shapes );
+		const geometries = this.parseGeometries( json.geometries, shapes );
+
+		const images = this.parseImages( json.images, function () {
+
+			if ( onLoad !== undefined ) onLoad( object );
+
+		} );
+
+		const textures = this.parseTextures( json.textures, images );
+		const materials = this.parseMaterials( json.materials, textures );
+
+		const object = this.parseObject( json.object, geometries, materials, textures, animations );
+		const skeletons = this.parseSkeletons( json.skeletons, object );
+
+		this.bindSkeletons( object, skeletons );
+		this.bindLightTargets( object );
+
+		//
+
+		if ( onLoad !== undefined ) {
+
+			let hasImages = false;
+
+			for ( const uuid in images ) {
+
+				if ( images[ uuid ].data instanceof HTMLImageElement ) {
+
+					hasImages = true;
+					break;
+
+				}
+
+			}
+
+			if ( hasImages === false ) onLoad( object );
+
+		}
+
+		return object;
+
+	}
+
+	/**
+	 * Async version of {@link ObjectLoader#parse}.
+	 *
+	 * @param {Object} json - The serialized 3D object.
+	 * @return {Promise<Object3D>} A Promise that resolves with the parsed 3D object.
+	 */
+	async parseAsync( json ) {
+
+		const animations = this.parseAnimations( json.animations );
+		const shapes = this.parseShapes( json.shapes );
+		const geometries = this.parseGeometries( json.geometries, shapes );
+
+		const images = await this.parseImagesAsync( json.images );
+
+		const textures = this.parseTextures( json.textures, images );
+		const materials = this.parseMaterials( json.materials, textures );
+
+		const object = this.parseObject( json.object, geometries, materials, textures, animations );
+		const skeletons = this.parseSkeletons( json.skeletons, object );
+
+		this.bindSkeletons( object, skeletons );
+		this.bindLightTargets( object );
+
+		return object;
+
+	}
+
+	/**
+	 * Registers the given geometry at the internal
+	 * geometry library.
+	 *
+	 * @static
+	 * @param {string} type - The geometry type.
+	 * @param {BufferGeometry.constructor} geometryClass - The geometry class.
+	 */
+	static registerGeometry( type, geometryClass ) {
+
+		_customGeometries[ type ] = geometryClass;
+
+	}
+
+	// internals
+
+	parseShapes( json ) {
+
+		const shapes = {};
+
+		if ( json !== undefined ) {
+
+			for ( let i = 0, l = json.length; i < l; i ++ ) {
+
+				const shape = new Shape().fromJSON( json[ i ] );
+
+				shapes[ shape.uuid ] = shape;
+
+			}
+
+		}
+
+		return shapes;
+
+	}
+
+	parseSkeletons( json, object ) {
+
+		const skeletons = {};
+		const bones = {};
+
+		// generate bone lookup table
+
+		object.traverse( function ( child ) {
+
+			if ( child.isBone ) bones[ child.uuid ] = child;
+
+		} );
+
+		// create skeletons
+
+		if ( json !== undefined ) {
+
+			for ( let i = 0, l = json.length; i < l; i ++ ) {
+
+				const skeleton = new Skeleton().fromJSON( json[ i ], bones );
+
+				skeletons[ skeleton.uuid ] = skeleton;
+
+			}
+
+		}
+
+		return skeletons;
+
+	}
+
+	parseGeometries( json, shapes ) {
+
+		const geometries = {};
+
+		if ( json !== undefined ) {
+
+			const bufferGeometryLoader = new BufferGeometryLoader();
+
+			for ( let i = 0, l = json.length; i < l; i ++ ) {
+
+				let geometry;
+				const data = json[ i ];
+
+				switch ( data.type ) {
+
+					case 'BufferGeometry':
+					case 'InstancedBufferGeometry':
+
+						geometry = bufferGeometryLoader.parse( data );
+						break;
+
+					default:
+
+						if ( data.type in Geometries ) {
+
+							geometry = Geometries[ data.type ].fromJSON( data, shapes );
+
+						} else if ( data.type in _customGeometries ) {
+
+							geometry = _customGeometries[ data.type ].fromJSON( data, shapes );
+
+						} else {
+
+							warn( `ObjectLoader: Unknown geometry type "${ data.type }". Use .registerGeometry() before starting the deserialization process.` );
+
+						}
+
+				}
+
+				geometry.uuid = data.uuid;
+
+				if ( data.name !== undefined ) geometry.name = data.name;
+				if ( data.userData !== undefined ) geometry.userData = data.userData;
+
+				geometries[ data.uuid ] = geometry;
+
+			}
+
+		}
+
+		return geometries;
+
+	}
+
+	parseMaterials( json, textures ) {
+
+		const cache = {}; // MultiMaterial
+		const materials = {};
+
+		if ( json !== undefined ) {
+
+			const loader = new MaterialLoader();
+			loader.setTextures( textures );
+
+			for ( let i = 0, l = json.length; i < l; i ++ ) {
+
+				const data = json[ i ];
+
+				if ( cache[ data.uuid ] === undefined ) {
+
+					cache[ data.uuid ] = loader.parse( data );
+
+				}
+
+				materials[ data.uuid ] = cache[ data.uuid ];
+
+			}
+
+		}
+
+		return materials;
+
+	}
+
+	parseAnimations( json ) {
+
+		const animations = {};
+
+		if ( json !== undefined ) {
+
+			for ( let i = 0; i < json.length; i ++ ) {
+
+				const data = json[ i ];
+
+				const clip = AnimationClip.parse( data );
+
+				animations[ clip.uuid ] = clip;
+
+			}
+
+		}
+
+		return animations;
+
+	}
+
+	parseImages( json, onLoad ) {
+
+		const scope = this;
+		const images = {};
+
+		let loader;
+
+		function loadImage( url ) {
+
+			url = scope.manager.resolveURL( url );
+
+			scope.manager.itemStart( url );
+
+			return loader.load( url, function () {
+
+				scope.manager.itemEnd( url );
+
+			}, undefined, function () {
+
+				scope.manager.itemError( url );
+				scope.manager.itemEnd( url );
+
+			} );
+
+		}
+
+		function deserializeImage( image ) {
+
+			if ( typeof image === 'string' ) {
+
+				const url = image;
+
+				const path = /^(\/\/)|([a-z]+:(\/\/)?)/i.test( url ) ? url : scope.resourcePath + url;
+
+				return loadImage( path );
+
+			} else {
+
+				if ( image.data ) {
+
+					return {
+						data: getTypedArray( image.type, image.data ),
+						width: image.width,
+						height: image.height
+					};
+
+				} else {
+
+					return null;
+
+				}
+
+			}
+
+		}
+
+		if ( json !== undefined && json.length > 0 ) {
+
+			const manager = new LoadingManager( onLoad );
+
+			loader = new ImageLoader( manager );
+			loader.setCrossOrigin( this.crossOrigin );
+
+			for ( let i = 0, il = json.length; i < il; i ++ ) {
+
+				const image = json[ i ];
+				const url = image.url;
+
+				if ( Array.isArray( url ) ) {
+
+					// load array of images e.g CubeTexture
+
+					const imageArray = [];
+
+					for ( let j = 0, jl = url.length; j < jl; j ++ ) {
+
+						const currentUrl = url[ j ];
+
+						const deserializedImage = deserializeImage( currentUrl );
+
+						if ( deserializedImage !== null ) {
+
+							if ( deserializedImage instanceof HTMLImageElement ) {
+
+								imageArray.push( deserializedImage );
+
+							} else {
+
+								// special case: handle array of data textures for cube textures
+
+								imageArray.push( new DataTexture( deserializedImage.data, deserializedImage.width, deserializedImage.height ) );
+
+							}
+
+						}
+
+					}
+
+					images[ image.uuid ] = new TextureSource( imageArray );
+
+				} else {
+
+					// load single image
+
+					const deserializedImage = deserializeImage( image.url );
+					images[ image.uuid ] = new TextureSource( deserializedImage );
+
+
+				}
+
+			}
+
+		}
+
+		return images;
+
+	}
+
+	async parseImagesAsync( json ) {
+
+		const scope = this;
+		const images = {};
+
+		let loader;
+
+		async function deserializeImage( image ) {
+
+			if ( typeof image === 'string' ) {
+
+				const url = image;
+
+				const path = /^(\/\/)|([a-z]+:(\/\/)?)/i.test( url ) ? url : scope.resourcePath + url;
+
+				return await loader.loadAsync( path );
+
+			} else {
+
+				if ( image.data ) {
+
+					return {
+						data: getTypedArray( image.type, image.data ),
+						width: image.width,
+						height: image.height
+					};
+
+				} else {
+
+					return null;
+
+				}
+
+			}
+
+		}
+
+		if ( json !== undefined && json.length > 0 ) {
+
+			loader = new ImageLoader( this.manager );
+			loader.setCrossOrigin( this.crossOrigin );
+
+			for ( let i = 0, il = json.length; i < il; i ++ ) {
+
+				const image = json[ i ];
+				const url = image.url;
+
+				if ( Array.isArray( url ) ) {
+
+					// load array of images e.g CubeTexture
+
+					const imageArray = [];
+
+					for ( let j = 0, jl = url.length; j < jl; j ++ ) {
+
+						const currentUrl = url[ j ];
+
+						const deserializedImage = await deserializeImage( currentUrl );
+
+						if ( deserializedImage !== null ) {
+
+							if ( deserializedImage instanceof HTMLImageElement ) {
+
+								imageArray.push( deserializedImage );
+
+							} else {
+
+								// special case: handle array of data textures for cube textures
+
+								imageArray.push( new DataTexture( deserializedImage.data, deserializedImage.width, deserializedImage.height ) );
+
+							}
+
+						}
+
+					}
+
+					images[ image.uuid ] = new TextureSource( imageArray );
+
+				} else {
+
+					// load single image
+
+					const deserializedImage = await deserializeImage( image.url );
+					images[ image.uuid ] = new TextureSource( deserializedImage );
+
+				}
+
+			}
+
+		}
+
+		return images;
+
+	}
+
+	parseTextures( json, images ) {
+
+		function parseConstant( value, type ) {
+
+			if ( typeof value === 'number' ) return value;
+
+			warn( 'ObjectLoader.parseTexture: Constant should be in numeric form.', value );
+
+			return type[ value ];
+
+		}
+
+		const textures = {};
+
+		if ( json !== undefined ) {
+
+			for ( let i = 0, l = json.length; i < l; i ++ ) {
+
+				const data = json[ i ];
+
+				if ( data.image === undefined ) {
+
+					warn( 'ObjectLoader: No "image" specified for', data.uuid );
+
+				}
+
+				if ( images[ data.image ] === undefined ) {
+
+					warn( 'ObjectLoader: Undefined image', data.image );
+
+				}
+
+				const source = images[ data.image ];
+				const image = source.data;
+
+				let texture;
+
+				if ( Array.isArray( image ) ) {
+
+					texture = new CubeTexture();
+
+					if ( image.length === 6 ) texture.needsUpdate = true;
+
+				} else {
+
+					if ( image && image.data ) {
+
+						texture = new DataTexture();
+
+					} else {
+
+						texture = new Texture();
+
+					}
+
+					if ( image ) texture.needsUpdate = true; // textures can have undefined image data
+
+				}
+
+				texture.source = source;
+
+				texture.uuid = data.uuid;
+
+				if ( data.name !== undefined ) texture.name = data.name;
+
+				if ( data.mapping !== undefined ) texture.mapping = parseConstant( data.mapping, TEXTURE_MAPPING );
+				if ( data.channel !== undefined ) texture.channel = data.channel;
+
+				if ( data.offset !== undefined ) texture.offset.fromArray( data.offset );
+				if ( data.repeat !== undefined ) texture.repeat.fromArray( data.repeat );
+				if ( data.center !== undefined ) texture.center.fromArray( data.center );
+				if ( data.rotation !== undefined ) texture.rotation = data.rotation;
+
+				if ( data.wrap !== undefined ) {
+
+					texture.wrapS = parseConstant( data.wrap[ 0 ], TEXTURE_WRAPPING );
+					texture.wrapT = parseConstant( data.wrap[ 1 ], TEXTURE_WRAPPING );
+
+				}
+
+				if ( data.format !== undefined ) texture.format = data.format;
+				if ( data.internalFormat !== undefined ) texture.internalFormat = data.internalFormat;
+				if ( data.type !== undefined ) texture.type = data.type;
+				if ( data.colorSpace !== undefined ) texture.colorSpace = data.colorSpace;
+
+				if ( data.minFilter !== undefined ) texture.minFilter = parseConstant( data.minFilter, TEXTURE_FILTER );
+				if ( data.magFilter !== undefined ) texture.magFilter = parseConstant( data.magFilter, TEXTURE_FILTER );
+				if ( data.anisotropy !== undefined ) texture.anisotropy = data.anisotropy;
+
+				if ( data.flipY !== undefined ) texture.flipY = data.flipY;
+
+				if ( data.generateMipmaps !== undefined ) texture.generateMipmaps = data.generateMipmaps;
+				if ( data.premultiplyAlpha !== undefined ) texture.premultiplyAlpha = data.premultiplyAlpha;
+				if ( data.unpackAlignment !== undefined ) texture.unpackAlignment = data.unpackAlignment;
+				if ( data.compareFunction !== undefined ) texture.compareFunction = data.compareFunction;
+				if ( data.normalized !== undefined ) texture.normalized = data.normalized;
+
+				if ( data.userData !== undefined ) texture.userData = data.userData;
+
+				textures[ data.uuid ] = texture;
+
+			}
+
+		}
+
+		return textures;
+
+	}
+
+	parseObject( data, geometries, materials, textures, animations ) {
+
+		let object;
+
+		function getGeometry( name ) {
+
+			if ( geometries[ name ] === undefined ) {
+
+				warn( 'ObjectLoader: Undefined geometry', name );
+
+			}
+
+			return geometries[ name ];
+
+		}
+
+		function getMaterial( name ) {
+
+			if ( name === undefined ) return undefined;
+
+			if ( Array.isArray( name ) ) {
+
+				const array = [];
+
+				for ( let i = 0, l = name.length; i < l; i ++ ) {
+
+					const uuid = name[ i ];
+
+					if ( materials[ uuid ] === undefined ) {
+
+						warn( 'ObjectLoader: Undefined material', uuid );
+
+					}
+
+					array.push( materials[ uuid ] );
+
+				}
+
+				return array;
+
+			}
+
+			if ( materials[ name ] === undefined ) {
+
+				warn( 'ObjectLoader: Undefined material', name );
+
+			}
+
+			return materials[ name ];
+
+		}
+
+		function getTexture( uuid ) {
+
+			if ( textures[ uuid ] === undefined ) {
+
+				warn( 'ObjectLoader: Undefined texture', uuid );
+
+			}
+
+			return textures[ uuid ];
+
+		}
+
+		let geometry, material;
+
+		switch ( data.type ) {
+
+			case 'Scene':
+
+				object = new Scene();
+
+				if ( data.background !== undefined ) {
+
+					if ( Number.isInteger( data.background ) ) {
+
+						object.background = new Color( data.background );
+
+					} else {
+
+						object.background = getTexture( data.background );
+
+					}
+
+				}
+
+				if ( data.environment !== undefined ) {
+
+					object.environment = getTexture( data.environment );
+
+				}
+
+				if ( data.fog !== undefined ) {
+
+					if ( data.fog.type === 'Fog' ) {
+
+						object.fog = new Fog( data.fog.color, data.fog.near, data.fog.far );
+
+					} else if ( data.fog.type === 'FogExp2' ) {
+
+						object.fog = new FogExp2( data.fog.color, data.fog.density );
+
+					}
+
+					if ( data.fog.name !== '' ) {
+
+						object.fog.name = data.fog.name;
+
+					}
+
+				}
+
+				if ( data.backgroundBlurriness !== undefined ) object.backgroundBlurriness = data.backgroundBlurriness;
+				if ( data.backgroundIntensity !== undefined ) object.backgroundIntensity = data.backgroundIntensity;
+				if ( data.backgroundRotation !== undefined ) object.backgroundRotation.fromArray( data.backgroundRotation );
+
+				if ( data.environmentIntensity !== undefined ) object.environmentIntensity = data.environmentIntensity;
+				if ( data.environmentRotation !== undefined ) object.environmentRotation.fromArray( data.environmentRotation );
+
+				break;
+
+			case 'PerspectiveCamera':
+
+				object = new PerspectiveCamera( data.fov, data.aspect, data.near, data.far );
+
+				if ( data.focus !== undefined ) object.focus = data.focus;
+				if ( data.zoom !== undefined ) object.zoom = data.zoom;
+				if ( data.filmGauge !== undefined ) object.filmGauge = data.filmGauge;
+				if ( data.filmOffset !== undefined ) object.filmOffset = data.filmOffset;
+				if ( data.view !== undefined ) object.view = Object.assign( {}, data.view );
+
+				break;
+
+			case 'OrthographicCamera':
+
+				object = new OrthographicCamera( data.left, data.right, data.top, data.bottom, data.near, data.far );
+
+				if ( data.zoom !== undefined ) object.zoom = data.zoom;
+				if ( data.view !== undefined ) object.view = Object.assign( {}, data.view );
+
+				break;
+
+			case 'AmbientLight':
+
+				object = new AmbientLight( data.color, data.intensity );
+
+				break;
+
+			case 'DirectionalLight':
+
+				object = new DirectionalLight( data.color, data.intensity );
+				object.target = data.target || '';
+
+				break;
+
+			case 'PointLight':
+
+				object = new PointLight( data.color, data.intensity, data.distance, data.decay );
+
+				break;
+
+			case 'RectAreaLight':
+
+				object = new RectAreaLight( data.color, data.intensity, data.width, data.height );
+
+				break;
+
+			case 'SpotLight':
+
+				object = new SpotLight( data.color, data.intensity, data.distance, data.angle, data.penumbra, data.decay );
+				object.target = data.target || '';
+
+				break;
+
+			case 'HemisphereLight':
+
+				object = new HemisphereLight( data.color, data.groundColor, data.intensity );
+
+				break;
+
+			case 'LightProbe':
+
+				const sh = new SphericalHarmonics3().fromArray( data.sh );
+				object = new LightProbe( sh, data.intensity );
+
+				break;
+
+			case 'SkinnedMesh':
+
+				geometry = getGeometry( data.geometry );
+			 	material = getMaterial( data.material );
+
+				object = new SkinnedMesh( geometry, material );
+
+				if ( data.bindMode !== undefined ) object.bindMode = data.bindMode;
+				if ( data.bindMatrix !== undefined ) object.bindMatrix.fromArray( data.bindMatrix );
+				if ( data.skeleton !== undefined ) object.skeleton = data.skeleton;
+
+				break;
+
+			case 'Mesh':
+
+				geometry = getGeometry( data.geometry );
+				material = getMaterial( data.material );
+
+				object = new Mesh( geometry, material );
+
+				break;
+
+			case 'InstancedMesh':
+
+				geometry = getGeometry( data.geometry );
+				material = getMaterial( data.material );
+				const count = data.count;
+				const instanceMatrix = data.instanceMatrix;
+				const instanceColor = data.instanceColor;
+
+				object = new InstancedMesh( geometry, material, count );
+				object.instanceMatrix = new InstancedBufferAttribute( new Float32Array( instanceMatrix.array ), 16 );
+				if ( instanceColor !== undefined ) object.instanceColor = new InstancedBufferAttribute( new Float32Array( instanceColor.array ), instanceColor.itemSize );
+
+				break;
+
+			case 'BatchedMesh':
+
+				geometry = getGeometry( data.geometry );
+				material = getMaterial( data.material );
+
+				object = new BatchedMesh( data.maxInstanceCount, data.maxVertexCount, data.maxIndexCount, material );
+				object.geometry = geometry;
+				object.perObjectFrustumCulled = data.perObjectFrustumCulled;
+				object.sortObjects = data.sortObjects;
+
+				object._drawRanges = data.drawRanges;
+				object._reservedRanges = data.reservedRanges;
+
+				object._geometryInfo = data.geometryInfo.map( info => {
+
+					let box = null;
+					let sphere = null;
+					if ( info.boundingBox !== undefined ) {
+
+						box = new Box3().fromJSON( info.boundingBox );
+
+					}
+
+					if ( info.boundingSphere !== undefined ) {
+
+						sphere = new Sphere().fromJSON( info.boundingSphere );
+
+					}
+
+					return {
+						...info,
+						boundingBox: box,
+						boundingSphere: sphere
+					};
+
+				} );
+				object._instanceInfo = data.instanceInfo;
+
+				object._availableInstanceIds = data._availableInstanceIds;
+				object._availableGeometryIds = data._availableGeometryIds;
+
+				object._nextIndexStart = data.nextIndexStart;
+				object._nextVertexStart = data.nextVertexStart;
+				object._geometryCount = data.geometryCount;
+
+				object._maxInstanceCount = data.maxInstanceCount;
+				object._maxVertexCount = data.maxVertexCount;
+				object._maxIndexCount = data.maxIndexCount;
+
+				object._geometryInitialized = data.geometryInitialized;
+
+				object._matricesTexture = getTexture( data.matricesTexture.uuid );
+
+				object._indirectTexture = getTexture( data.indirectTexture.uuid );
+
+				if ( data.colorsTexture !== undefined ) {
+
+					object._colorsTexture = getTexture( data.colorsTexture.uuid );
+
+				}
+
+				if ( data.boundingSphere !== undefined ) {
+
+					object.boundingSphere = new Sphere().fromJSON( data.boundingSphere );
+
+				}
+
+				if ( data.boundingBox !== undefined ) {
+
+					object.boundingBox = new Box3().fromJSON( data.boundingBox );
+
+				}
+
+				break;
+
+			case 'LOD':
+
+				object = new LOD();
+
+				break;
+
+			case 'Line':
+
+				object = new Line( getGeometry( data.geometry ), getMaterial( data.material ) );
+
+				break;
+
+			case 'LineLoop':
+
+				object = new LineLoop( getGeometry( data.geometry ), getMaterial( data.material ) );
+
+				break;
+
+			case 'LineSegments':
+
+				object = new LineSegments( getGeometry( data.geometry ), getMaterial( data.material ) );
+
+				break;
+
+			case 'PointCloud':
+			case 'Points':
+
+				object = new Points( getGeometry( data.geometry ), getMaterial( data.material ) );
+
+				break;
+
+			case 'Sprite':
+
+				object = new Sprite( getMaterial( data.material ) );
+
+				break;
+
+			case 'Group':
+
+				object = new Group();
+
+				break;
+
+			case 'Bone':
+
+				object = new Bone();
+
+				break;
+
+			default:
+
+				object = new Object3D();
+
+		}
+
+		object.uuid = data.uuid;
+
+		if ( data.name !== undefined ) object.name = data.name;
+
+		if ( data.matrix !== undefined ) {
+
+			object.matrix.fromArray( data.matrix );
+
+			if ( data.matrixAutoUpdate !== undefined ) object.matrixAutoUpdate = data.matrixAutoUpdate;
+			if ( object.matrixAutoUpdate ) object.matrix.decompose( object.position, object.quaternion, object.scale );
+
+		} else {
+
+			if ( data.position !== undefined ) object.position.fromArray( data.position );
+			if ( data.rotation !== undefined ) object.rotation.fromArray( data.rotation );
+			if ( data.quaternion !== undefined ) object.quaternion.fromArray( data.quaternion );
+			if ( data.scale !== undefined ) object.scale.fromArray( data.scale );
+
+		}
+
+		if ( data.up !== undefined ) object.up.fromArray( data.up );
+
+		if ( data.pivot !== undefined ) object.pivot = new Vector3().fromArray( data.pivot );
+
+		if ( data.morphTargetDictionary !== undefined ) object.morphTargetDictionary = Object.assign( {}, data.morphTargetDictionary );
+		if ( data.morphTargetInfluences !== undefined ) object.morphTargetInfluences = data.morphTargetInfluences.slice();
+
+		if ( data.castShadow !== undefined ) object.castShadow = data.castShadow;
+		if ( data.receiveShadow !== undefined ) object.receiveShadow = data.receiveShadow;
+
+		if ( data.shadow ) {
+
+			if ( data.shadow.intensity !== undefined ) object.shadow.intensity = data.shadow.intensity;
+			if ( data.shadow.bias !== undefined ) object.shadow.bias = data.shadow.bias;
+			if ( data.shadow.normalBias !== undefined ) object.shadow.normalBias = data.shadow.normalBias;
+			if ( data.shadow.radius !== undefined ) object.shadow.radius = data.shadow.radius;
+			if ( data.shadow.blurSamples !== undefined ) object.shadow.blurSamples = data.shadow.blurSamples;
+			if ( data.shadow.focus !== undefined ) object.shadow.focus = data.shadow.focus;
+			if ( data.shadow.aspect !== undefined ) object.shadow.aspect = data.shadow.aspect;
+			if ( data.shadow.mapSize !== undefined ) object.shadow.mapSize.fromArray( data.shadow.mapSize );
+			if ( data.shadow.camera !== undefined ) object.shadow.camera = this.parseObject( data.shadow.camera );
+
+		}
+
+		if ( data.visible !== undefined ) object.visible = data.visible;
+		if ( data.frustumCulled !== undefined ) object.frustumCulled = data.frustumCulled;
+		if ( data.renderOrder !== undefined ) object.renderOrder = data.renderOrder;
+		if ( data.static !== undefined ) object.static = data.static;
+		if ( data.userData !== undefined ) object.userData = data.userData;
+		if ( data.layers !== undefined ) object.layers.mask = data.layers;
+
+		if ( data.children !== undefined ) {
+
+			const children = data.children;
+
+			for ( let i = 0; i < children.length; i ++ ) {
+
+				object.add( this.parseObject( children[ i ], geometries, materials, textures, animations ) );
+
+			}
+
+		}
+
+		if ( data.animations !== undefined ) {
+
+			const objectAnimations = data.animations;
+
+			for ( let i = 0; i < objectAnimations.length; i ++ ) {
+
+				const uuid = objectAnimations[ i ];
+
+				object.animations.push( animations[ uuid ] );
+
+			}
+
+		}
+
+		if ( data.type === 'LOD' ) {
+
+			if ( data.autoUpdate !== undefined ) object.autoUpdate = data.autoUpdate;
+
+			const levels = data.levels;
+
+			for ( let l = 0; l < levels.length; l ++ ) {
+
+				const level = levels[ l ];
+				const child = object.getObjectByProperty( 'uuid', level.object );
+
+				if ( child !== undefined ) {
+
+					object.addLevel( child, level.distance, level.hysteresis );
+
+				}
+
+			}
+
+		}
+
+		return object;
+
+	}
+
+	bindSkeletons( object, skeletons ) {
+
+		if ( Object.keys( skeletons ).length === 0 ) return;
+
+		object.traverse( function ( child ) {
+
+			if ( child.isSkinnedMesh === true && child.skeleton !== undefined ) {
+
+				const skeleton = skeletons[ child.skeleton ];
+
+				if ( skeleton === undefined ) {
+
+					warn( 'ObjectLoader: No skeleton found with UUID:', child.skeleton );
+
+				} else {
+
+					child.bind( skeleton, child.bindMatrix );
+
+				}
+
+			}
+
+		} );
+
+	}
+
+	bindLightTargets( object ) {
+
+		object.traverse( function ( child ) {
+
+			if ( child.isDirectionalLight || child.isSpotLight ) {
+
+				const uuid = child.target;
+
+				const target = object.getObjectByProperty( 'uuid', uuid );
+
+				if ( target !== undefined ) {
+
+					child.target = target;
+
+				} else {
+
+					child.target = new Object3D();
+
+				}
+
+			}
+
+		} );
+
+	}
+
+}
+
+const TEXTURE_MAPPING = {
+	UVMapping: UVMapping,
+	CubeReflectionMapping: CubeReflectionMapping,
+	CubeRefractionMapping: CubeRefractionMapping,
+	EquirectangularReflectionMapping: EquirectangularReflectionMapping,
+	EquirectangularRefractionMapping: EquirectangularRefractionMapping,
+	CubeUVReflectionMapping: CubeUVReflectionMapping
+};
+
+const TEXTURE_WRAPPING = {
+	RepeatWrapping: RepeatWrapping,
+	ClampToEdgeWrapping: ClampToEdgeWrapping,
+	MirroredRepeatWrapping: MirroredRepeatWrapping
+};
+
+const TEXTURE_FILTER = {
+	NearestFilter: NearestFilter,
+	NearestMipmapNearestFilter: NearestMipmapNearestFilter,
+	NearestMipmapLinearFilter: NearestMipmapLinearFilter,
+	LinearFilter: LinearFilter,
+	LinearMipmapNearestFilter: LinearMipmapNearestFilter,
+	LinearMipmapLinearFilter: LinearMipmapLinearFilter
+};
+
+const _errorMap = new WeakMap();
+
+/**
+ * A loader for loading images as an [ImageBitmap](https://developer.mozilla.org/en-US/docs/Web/API/ImageBitmap).
+ * An `ImageBitmap` provides an asynchronous and resource efficient pathway to prepare
+ * textures for rendering.
+ *
+ * Note that {@link Texture#flipY} and {@link Texture#premultiplyAlpha} are ignored with image bitmaps.
+ * These options need to be configured via {@link ImageBitmapLoader#setOptions} prior to loading,
+ * unlike regular images which can be configured on the Texture to set these options on GPU upload instead.
+ *
+ * To match the default behaviour of {@link Texture}, the following options are needed:
+ *
+ * ```js
+ * { imageOrientation: 'flipY', premultiplyAlpha: 'none' }
+ * ```
+ *
+ * Also note that unlike {@link FileLoader}, this loader will only avoid multiple concurrent requests to the same URL if {@link Cache} is enabled.
+ *
+ * ```js
+ * const loader = new THREE.ImageBitmapLoader();
+ * loader.setOptions( { imageOrientation: 'flipY' } ); // set options if needed
+ * const imageBitmap = await loader.loadAsync( 'image.png' );
+ *
+ * const texture = new THREE.Texture( imageBitmap );
+ * texture.needsUpdate = true;
+ * ```
+ *
+ * @augments Loader
+ */
+class ImageBitmapLoader extends Loader {
+
+	/**
+	 * Constructs a new image bitmap loader.
+	 *
+	 * @param {LoadingManager} [manager] - The loading manager.
+	 */
+	constructor( manager ) {
+
+		super( manager );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isImageBitmapLoader = true;
+
+		if ( typeof createImageBitmap === 'undefined' ) {
+
+			warn( 'ImageBitmapLoader: createImageBitmap() not supported.' );
+
+		}
+
+		if ( typeof fetch === 'undefined' ) {
+
+			warn( 'ImageBitmapLoader: fetch() not supported.' );
+
+		}
+
+		/**
+		 * Represents the loader options.
+		 *
+		 * @type {Object}
+		 * @default {premultiplyAlpha:'none'}
+		 */
+		this.options = { premultiplyAlpha: 'none' };
+
+		/**
+		 * Used for aborting requests.
+		 *
+		 * @private
+		 * @type {AbortController}
+		 */
+		this._abortController = new AbortController();
+
+	}
+
+	/**
+	 * Sets the given loader options. The structure of the object must match the `options` parameter of
+	 * [createImageBitmap](https://developer.mozilla.org/en-US/docs/Web/API/Window/createImageBitmap).
+	 *
+	 * Note: When caching is enabled, the cache key is based on the URL only. Loading the same URL with
+	 * different options will return the cached result of the first request.
+	 *
+	 * @param {Object} options - The loader options to set.
+	 * @return {ImageBitmapLoader} A reference to this image bitmap loader.
+	 */
+	setOptions( options ) {
+
+		this.options = options;
+
+		return this;
+
+	}
+
+	/**
+	 * Starts loading from the given URL and pass the loaded image bitmap to the `onLoad()` callback.
+	 *
+	 * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.
+	 * @param {function(ImageBitmap)} onLoad - Executed when the loading process has been finished.
+	 * @param {onProgressCallback} onProgress - Unsupported in this loader.
+	 * @param {onErrorCallback} onError - Executed when errors occur.
+	 */
+	load( url, onLoad, onProgress, onError ) {
+
+		if ( url === undefined ) url = '';
+
+		if ( this.path !== undefined ) url = this.path + url;
+
+		url = this.manager.resolveURL( url );
+
+		const scope = this;
+
+		const cached = Cache.get( `image-bitmap:${url}` );
+
+		if ( cached !== undefined ) {
+
+			scope.manager.itemStart( url );
+
+			// If cached is a promise, wait for it to resolve
+			if ( cached.then ) {
+
+				cached.then( imageBitmap => {
+
+					// check if there is an error for the cached promise
+
+					if ( _errorMap.has( cached ) === true ) {
+
+						if ( onError ) onError( _errorMap.get( cached ) );
+
+						scope.manager.itemError( url );
+						scope.manager.itemEnd( url );
+
+					} else {
+
+						if ( onLoad ) onLoad( imageBitmap );
+
+						scope.manager.itemEnd( url );
+
+					}
+
+				} );
+
+				return;
+
+			}
+
+			// If cached is not a promise (i.e., it's already an imageBitmap)
+			setTimeout( function () {
+
+				if ( onLoad ) onLoad( cached );
+
+				scope.manager.itemEnd( url );
+
+			}, 0 );
+
+			return;
+
+		}
+
+		const fetchOptions = {};
+		fetchOptions.credentials = ( this.crossOrigin === 'anonymous' ) ? 'same-origin' : 'include';
+		fetchOptions.headers = this.requestHeader;
+		fetchOptions.signal = ( typeof AbortSignal.any === 'function' ) ? AbortSignal.any( [ this._abortController.signal, this.manager.abortController.signal ] ) : this._abortController.signal;
+
+		const promise = fetch( url, fetchOptions ).then( function ( res ) {
+
+			return res.blob();
+
+		} ).then( function ( blob ) {
+
+			return createImageBitmap( blob, Object.assign( {}, scope.options, { colorSpaceConversion: 'none' } ) );
+
+		} ).then( function ( imageBitmap ) {
+
+			Cache.add( `image-bitmap:${url}`, imageBitmap );
+
+			if ( onLoad ) onLoad( imageBitmap );
+
+			scope.manager.itemEnd( url );
+
+			return imageBitmap; // see #34150
+
+		} ).catch( function ( e ) {
+
+			if ( onError ) onError( e );
+
+			_errorMap.set( promise, e );
+
+			Cache.remove( `image-bitmap:${url}` );
+
+			scope.manager.itemError( url );
+			scope.manager.itemEnd( url );
+
+		} );
+
+		Cache.add( `image-bitmap:${url}`, promise );
+		scope.manager.itemStart( url );
+
+	}
+
+	/**
+	 * Aborts ongoing fetch requests.
+	 *
+	 * @return {ImageBitmapLoader} A reference to this instance.
+	 */
+	abort() {
+
+		this._abortController.abort();
+		this._abortController = new AbortController();
+
+		return this;
+
+	}
+
+}
+
+let _context;
+
+/**
+ * Manages the global audio context in the engine.
+ *
+ * @hideconstructor
+ */
+class AudioContext {
+
+	/**
+	 * Returns the global native audio context.
+	 *
+	 * @return {Window.AudioContext} The native audio context.
+	 */
+	static getContext() {
+
+		if ( _context === undefined ) {
+
+			_context = new ( window.AudioContext || window.webkitAudioContext )();
+
+		}
+
+		return _context;
+
+	}
+
+	/**
+	 * Allows to set the global native audio context from outside.
+	 *
+	 * @param {Window.AudioContext} value - The native context to set.
+	 */
+	static setContext( value ) {
+
+		_context = value;
+
+	}
+
+}
+
+/**
+ * Class for loading audio buffers. Audios are internally
+ * loaded via {@link FileLoader}.
+ *
+ * ```js
+ * const audioListener = new THREE.AudioListener();
+ * const ambientSound = new THREE.Audio( audioListener );
+ *
+ * const loader = new THREE.AudioLoader();
+ * const audioBuffer = await loader.loadAsync( 'audio/ambient_ocean.ogg' );
+ *
+ * ambientSound.setBuffer( audioBuffer );
+ * ambientSound.play();
+ * ```
+ *
+ * @augments Loader
+ */
+class AudioLoader extends Loader {
+
+	/**
+	 * Constructs a new audio loader.
+	 *
+	 * @param {LoadingManager} [manager] - The loading manager.
+	 */
+	constructor( manager ) {
+
+		super( manager );
+
+	}
+
+	/**
+	 * Starts loading from the given URL and passes the loaded audio buffer
+	 * to the `onLoad()` callback.
+	 *
+	 * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.
+	 * @param {function(AudioBuffer)} onLoad - Executed when the loading process has been finished.
+	 * @param {onProgressCallback} onProgress - Executed while the loading is in progress.
+	 * @param {onErrorCallback} onError - Executed when errors occur.
+	 */
+	load( url, onLoad, onProgress, onError ) {
+
+		const scope = this;
+
+		const loader = new FileLoader( this.manager );
+		loader.setResponseType( 'arraybuffer' );
+		loader.setPath( this.path );
+		loader.setRequestHeader( this.requestHeader );
+		loader.setWithCredentials( this.withCredentials );
+		loader.load( url, function ( buffer ) {
+
+			try {
+
+				// Create a copy of the buffer. The `decodeAudioData` method
+				// detaches the buffer when complete, preventing reuse.
+				const bufferCopy = buffer.slice( 0 );
+
+				const context = AudioContext.getContext();
+
+				const decodeUrl = url + '#decode';
+				scope.manager.itemStart( decodeUrl ); // prevent loading manager from completing too early, see #33378
+
+				context.decodeAudioData( bufferCopy, function ( audioBuffer ) {
+
+					onLoad( audioBuffer );
+					scope.manager.itemEnd( decodeUrl );
+
+				} ).catch( function ( e ) {
+
+					handleError( e );
+					scope.manager.itemEnd( decodeUrl );
+
+				} );
+
+			} catch ( e ) {
+
+				handleError( e );
+
+			}
+
+		}, onProgress, onError );
+
+		function handleError( e ) {
+
+			if ( onError ) {
+
+				onError( e );
+
+			} else {
+
+				error( e );
+
+			}
+
+			scope.manager.itemError( url );
+
+		}
+
+	}
+
+}
+
+const _eyeRight = /*@__PURE__*/ new Matrix4();
+const _eyeLeft = /*@__PURE__*/ new Matrix4();
+const _projectionMatrix = /*@__PURE__*/ new Matrix4();
+
+/**
+ * A special type of camera that uses two perspective cameras with
+ * stereoscopic projection. Can be used for rendering stereo effects
+ * like [3D Anaglyph](https://en.wikipedia.org/wiki/Anaglyph_3D) or
+ * [Parallax Barrier](https://en.wikipedia.org/wiki/parallax_barrier).
+ */
+class StereoCamera {
+
+	/**
+	 * Constructs a new stereo camera.
+	 */
+	constructor() {
+
+		/**
+		 * The type property is used for detecting the object type
+		 * in context of serialization/deserialization.
+		 *
+		 * @type {string}
+		 * @readonly
+		 */
+		this.type = 'StereoCamera';
+
+		/**
+		 * The aspect.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.aspect = 1;
+
+		/**
+		 * The eye separation which represents the distance
+		 * between the left and right camera.
+		 *
+		 * @type {number}
+		 * @default 0.064
+		 */
+		this.eyeSep = 0.064;
+
+		/**
+		 * The camera representing the left eye. This is added to layer `1` so objects to be
+		 * rendered by the left camera must also be added to this layer.
+		 *
+		 * @type {PerspectiveCamera}
+		 */
+		this.cameraL = new PerspectiveCamera();
+		this.cameraL.layers.enable( 1 );
+		this.cameraL.matrixAutoUpdate = false;
+
+		/**
+		 * The camera representing the right eye. This is added to layer `2` so objects to be
+		 * rendered by the right camera must also be added to this layer.
+		 *
+		 * @type {PerspectiveCamera}
+		 */
+		this.cameraR = new PerspectiveCamera();
+		this.cameraR.layers.enable( 2 );
+		this.cameraR.matrixAutoUpdate = false;
+
+		this._cache = {
+			focus: null,
+			fov: null,
+			aspect: null,
+			near: null,
+			far: null,
+			zoom: null,
+			eyeSep: null
+		};
+
+	}
+
+	/**
+	 * Updates the stereo camera based on the given perspective camera.
+	 *
+	 * @param {PerspectiveCamera} camera - The perspective camera.
+	 */
+	update( camera ) {
+
+		const cache = this._cache;
+
+		const needsUpdate = cache.focus !== camera.focus || cache.fov !== camera.fov ||
+			cache.aspect !== camera.aspect * this.aspect || cache.near !== camera.near ||
+			cache.far !== camera.far || cache.zoom !== camera.zoom || cache.eyeSep !== this.eyeSep;
+
+		if ( needsUpdate ) {
+
+			cache.focus = camera.focus;
+			cache.fov = camera.fov;
+			cache.aspect = camera.aspect * this.aspect;
+			cache.near = camera.near;
+			cache.far = camera.far;
+			cache.zoom = camera.zoom;
+			cache.eyeSep = this.eyeSep;
+
+			// Off-axis stereoscopic effect based on
+			// http://paulbourke.net/stereographics/stereorender/
+
+			_projectionMatrix.copy( camera.projectionMatrix );
+			const eyeSepHalf = cache.eyeSep / 2;
+			const eyeSepOnProjection = eyeSepHalf * cache.near / cache.focus;
+			const ymax = ( cache.near * Math.tan( DEG2RAD * cache.fov * 0.5 ) ) / cache.zoom;
+			let xmin, xmax;
+
+			// translate xOffset
+
+			_eyeLeft.elements[ 12 ] = - eyeSepHalf;
+			_eyeRight.elements[ 12 ] = eyeSepHalf;
+
+			// for left eye
+
+			xmin = - ymax * cache.aspect + eyeSepOnProjection;
+			xmax = ymax * cache.aspect + eyeSepOnProjection;
+
+			_projectionMatrix.elements[ 0 ] = 2 * cache.near / ( xmax - xmin );
+			_projectionMatrix.elements[ 8 ] = ( xmax + xmin ) / ( xmax - xmin );
+
+			this.cameraL.projectionMatrix.copy( _projectionMatrix );
+
+			// for right eye
+
+			xmin = - ymax * cache.aspect - eyeSepOnProjection;
+			xmax = ymax * cache.aspect - eyeSepOnProjection;
+
+			_projectionMatrix.elements[ 0 ] = 2 * cache.near / ( xmax - xmin );
+			_projectionMatrix.elements[ 8 ] = ( xmax + xmin ) / ( xmax - xmin );
+
+			this.cameraR.projectionMatrix.copy( _projectionMatrix );
+
+		}
+
+		this.cameraL.matrix.copy( camera.matrixWorld ).multiply( _eyeLeft );
+		this.cameraL.matrixWorldNeedsUpdate = true;
+
+		this.cameraR.matrix.copy( camera.matrixWorld ).multiply( _eyeRight );
+		this.cameraR.matrixWorldNeedsUpdate = true;
+
+	}
+
+}
+
+const fov = -90; // negative fov is not an error
+const aspect = 1;
+
+/**
+ * A special type of camera that is positioned in 3D space to render its surroundings into a
+ * cube render target. The render target can then be used as an environment map for rendering
+ * realtime reflections in your scene.
+ *
+ * ```js
+ * // Create cube render target
+ * const cubeRenderTarget = new THREE.WebGLCubeRenderTarget( 256, { generateMipmaps: true, minFilter: THREE.LinearMipmapLinearFilter } );
+ *
+ * // Create cube camera
+ * const cubeCamera = new THREE.CubeCamera( 1, 100000, cubeRenderTarget );
+ * scene.add( cubeCamera );
+ *
+ * // Create car
+ * const chromeMaterial = new THREE.MeshLambertMaterial( { color: 0xffffff, envMap: cubeRenderTarget.texture } );
+ * const car = new THREE.Mesh( carGeometry, chromeMaterial );
+ * scene.add( car );
+ *
+ * // Update the render target cube
+ * car.visible = false;
+ * cubeCamera.position.copy( car.position );
+ * cubeCamera.update( renderer, scene );
+ *
+ * // Render the scene
+ * car.visible = true;
+ * renderer.render( scene, camera );
+ * ```
+ *
+ * @augments Object3D
+ */
+class CubeCamera extends Object3D {
+
+	/**
+	 * Constructs a new cube camera.
+	 *
+	 * @param {number} near - The camera's near plane.
+	 * @param {number} far - The camera's far plane.
+	 * @param {WebGLCubeRenderTarget} renderTarget - The cube render target.
+	 */
+	constructor( near, far, renderTarget ) {
+
+		super();
+
+		this.type = 'CubeCamera';
+
+		/**
+		 * A reference to the cube render target.
+		 *
+		 * @type {WebGLCubeRenderTarget}
+		 */
+		this.renderTarget = renderTarget;
+
+		/**
+		 * The current active coordinate system.
+		 *
+		 * @type {?(WebGLCoordinateSystem|WebGPUCoordinateSystem)}
+		 * @default null
+		 */
+		this.coordinateSystem = null;
+
+		/**
+		 * The current active mipmap level
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.activeMipmapLevel = 0;
+
+		const cameraPX = new PerspectiveCamera( fov, aspect, near, far );
+		cameraPX.layers = this.layers;
+		this.add( cameraPX );
+
+		const cameraNX = new PerspectiveCamera( fov, aspect, near, far );
+		cameraNX.layers = this.layers;
+		this.add( cameraNX );
+
+		const cameraPY = new PerspectiveCamera( fov, aspect, near, far );
+		cameraPY.layers = this.layers;
+		this.add( cameraPY );
+
+		const cameraNY = new PerspectiveCamera( fov, aspect, near, far );
+		cameraNY.layers = this.layers;
+		this.add( cameraNY );
+
+		const cameraPZ = new PerspectiveCamera( fov, aspect, near, far );
+		cameraPZ.layers = this.layers;
+		this.add( cameraPZ );
+
+		const cameraNZ = new PerspectiveCamera( fov, aspect, near, far );
+		cameraNZ.layers = this.layers;
+		this.add( cameraNZ );
+
+	}
+
+	/**
+	 * Must be called when the coordinate system of the cube camera is changed.
+	 */
+	updateCoordinateSystem() {
+
+		const coordinateSystem = this.coordinateSystem;
+
+		const cameras = this.children.concat();
+
+		const [ cameraPX, cameraNX, cameraPY, cameraNY, cameraPZ, cameraNZ ] = cameras;
+
+		for ( const camera of cameras ) this.remove( camera );
+
+		if ( coordinateSystem === WebGLCoordinateSystem ) {
+
+			cameraPX.up.set( 0, 1, 0 );
+			cameraPX.lookAt( 1, 0, 0 );
+
+			cameraNX.up.set( 0, 1, 0 );
+			cameraNX.lookAt( -1, 0, 0 );
+
+			cameraPY.up.set( 0, 0, -1 );
+			cameraPY.lookAt( 0, 1, 0 );
+
+			cameraNY.up.set( 0, 0, 1 );
+			cameraNY.lookAt( 0, -1, 0 );
+
+			cameraPZ.up.set( 0, 1, 0 );
+			cameraPZ.lookAt( 0, 0, 1 );
+
+			cameraNZ.up.set( 0, 1, 0 );
+			cameraNZ.lookAt( 0, 0, -1 );
+
+		} else if ( coordinateSystem === WebGPUCoordinateSystem ) {
+
+			cameraPX.up.set( 0, -1, 0 );
+			cameraPX.lookAt( -1, 0, 0 );
+
+			cameraNX.up.set( 0, -1, 0 );
+			cameraNX.lookAt( 1, 0, 0 );
+
+			cameraPY.up.set( 0, 0, 1 );
+			cameraPY.lookAt( 0, 1, 0 );
+
+			cameraNY.up.set( 0, 0, -1 );
+			cameraNY.lookAt( 0, -1, 0 );
+
+			cameraPZ.up.set( 0, -1, 0 );
+			cameraPZ.lookAt( 0, 0, 1 );
+
+			cameraNZ.up.set( 0, -1, 0 );
+			cameraNZ.lookAt( 0, 0, -1 );
+
+		} else {
+
+			throw new Error( 'THREE.CubeCamera.updateCoordinateSystem(): Invalid coordinate system: ' + coordinateSystem );
+
+		}
+
+		for ( const camera of cameras ) {
+
+			this.add( camera );
+
+			camera.updateMatrixWorld();
+
+		}
+
+	}
+
+	/**
+	 * Calling this method will render the given scene with the given renderer
+	 * into the cube render target of the camera.
+	 *
+	 * @param {(Renderer|WebGLRenderer)} renderer - The renderer.
+	 * @param {Scene} scene - The scene to render.
+	 */
+	update( renderer, scene ) {
+
+		if ( this.parent === null ) this.updateMatrixWorld();
+
+		const { renderTarget, activeMipmapLevel } = this;
+
+		if ( this.coordinateSystem !== renderer.coordinateSystem ) {
+
+			this.coordinateSystem = renderer.coordinateSystem;
+
+			this.updateCoordinateSystem();
+
+		}
+
+		const [ cameraPX, cameraNX, cameraPY, cameraNY, cameraPZ, cameraNZ ] = this.children;
+
+		const currentRenderTarget = renderer.getRenderTarget();
+		const currentActiveCubeFace = renderer.getActiveCubeFace();
+		const currentActiveMipmapLevel = renderer.getActiveMipmapLevel();
+
+		const currentXrEnabled = renderer.xr.enabled;
+
+		renderer.xr.enabled = false;
+
+		const generateMipmaps = renderTarget.texture.generateMipmaps;
+
+		renderTarget.texture.generateMipmaps = false;
+
+		// https://github.com/mrdoob/three.js/issues/31413#issuecomment-3095966812
+
+		let reversedDepthBuffer = false;
+
+		if ( renderer.isWebGLRenderer === true ) {
+
+			reversedDepthBuffer = renderer.state.buffers.depth.getReversed();
+
+		} else {
+
+			reversedDepthBuffer = renderer.reversedDepthBuffer;
+
+		}
+
+		renderer.setRenderTarget( renderTarget, 0, activeMipmapLevel );
+		if ( reversedDepthBuffer && renderer.autoClear === false ) renderer.clearDepth();
+		renderer.render( scene, cameraPX );
+
+		renderer.setRenderTarget( renderTarget, 1, activeMipmapLevel );
+		if ( reversedDepthBuffer && renderer.autoClear === false ) renderer.clearDepth();
+		renderer.render( scene, cameraNX );
+
+		renderer.setRenderTarget( renderTarget, 2, activeMipmapLevel );
+		if ( reversedDepthBuffer && renderer.autoClear === false ) renderer.clearDepth();
+		renderer.render( scene, cameraPY );
+
+		renderer.setRenderTarget( renderTarget, 3, activeMipmapLevel );
+		if ( reversedDepthBuffer && renderer.autoClear === false ) renderer.clearDepth();
+		renderer.render( scene, cameraNY );
+
+		renderer.setRenderTarget( renderTarget, 4, activeMipmapLevel );
+		if ( reversedDepthBuffer && renderer.autoClear === false ) renderer.clearDepth();
+		renderer.render( scene, cameraPZ );
+
+		// mipmaps are generated during the last call of render()
+		// at this point, all sides of the cube render target are defined
+
+		renderTarget.texture.generateMipmaps = generateMipmaps;
+
+		renderer.setRenderTarget( renderTarget, 5, activeMipmapLevel );
+		if ( reversedDepthBuffer && renderer.autoClear === false ) renderer.clearDepth();
+		renderer.render( scene, cameraNZ );
+
+		renderer.setRenderTarget( currentRenderTarget, currentActiveCubeFace, currentActiveMipmapLevel );
+
+		renderer.xr.enabled = currentXrEnabled;
+
+		renderTarget.texture.needsPMREMUpdate = true;
+
+	}
+
+}
+
+/**
+ * This type of camera can be used in order to efficiently render a scene with a
+ * predefined set of cameras. This is an important performance aspect for
+ * rendering VR scenes.
+ *
+ * An instance of `ArrayCamera` always has an array of sub cameras. It's mandatory
+ * to define for each sub camera the `viewport` property which determines the
+ * part of the viewport that is rendered with this camera.
+ *
+ * @augments PerspectiveCamera
+ */
+class ArrayCamera extends PerspectiveCamera {
+
+	/**
+	 * Constructs a new array camera.
+	 *
+	 * @param {Array<PerspectiveCamera>} [array=[]] - An array of perspective sub cameras.
+	 */
+	constructor( array = [] ) {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isArrayCamera = true;
+
+		/**
+		 * Whether this camera is used with multiview rendering or not.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default false
+		 */
+		this.isMultiViewCamera = false;
+
+		/**
+		 * An array of perspective sub cameras.
+		 *
+		 * @type {Array<PerspectiveCamera>}
+		 */
+		this.cameras = array;
+
+	}
+
+}
+
+/**
+ * This class is an alternative to {@link Clock} with a different API design and behavior.
+ * The goal is to avoid the conceptual flaws that became apparent in `Clock` over time.
+ *
+ * - `Timer` has an `update()` method that updates its internal state. That makes it possible to
+ * call `getDelta()` and `getElapsed()` multiple times per simulation step without getting different values.
+ * - The class can make use of the Page Visibility API to avoid large time delta values when the app
+ * is inactive (e.g. tab switched or browser hidden).
+ *
+ * ```js
+ * const timer = new Timer();
+ * timer.connect( document ); // use Page Visibility API
+ * ```
+ */
+class Timer {
+
+	/**
+	 * Constructs a new timer.
+	 */
+	constructor() {
+
+		this._previousTime = 0;
+		this._currentTime = 0;
+		this._startTime = performance.now();
+
+		this._delta = 0;
+		this._elapsed = 0;
+
+		this._timescale = 1;
+
+		this._document = null;
+		this._pageVisibilityHandler = null;
+
+	}
+
+	/**
+	 * Connect the timer to the given document.Calling this method is not mandatory to
+	 * use the timer but enables the usage of the Page Visibility API to avoid large time
+	 * delta values.
+	 *
+	 * @param {Document} document - The document.
+	 */
+	connect( document ) {
+
+		this._document = document;
+
+		// use Page Visibility API to avoid large time delta values
+
+		if ( document.hidden !== undefined ) {
+
+			this._pageVisibilityHandler = handleVisibilityChange.bind( this );
+
+			document.addEventListener( 'visibilitychange', this._pageVisibilityHandler, false );
+
+		}
+
+	}
+
+	/**
+	 * Disconnects the timer from the DOM and also disables the usage of the Page Visibility API.
+	 */
+	disconnect() {
+
+		if ( this._pageVisibilityHandler !== null ) {
+
+			this._document.removeEventListener( 'visibilitychange', this._pageVisibilityHandler );
+			this._pageVisibilityHandler = null;
+
+		}
+
+		this._document = null;
+
+	}
+
+	/**
+	 * Returns the time delta in seconds.
+	 *
+	 * @return {number} The time delta in second.
+	 */
+	getDelta() {
+
+		return this._delta / 1000;
+
+	}
+
+	/**
+	 * Returns the elapsed time in seconds.
+	 *
+	 * @return {number} The elapsed time in second.
+	 */
+	getElapsed() {
+
+		return this._elapsed / 1000;
+
+	}
+
+	/**
+	 * Returns the timescale.
+	 *
+	 * @return {number} The timescale.
+	 */
+	getTimescale() {
+
+		return this._timescale;
+
+	}
+
+	/**
+	 * Sets the given timescale which scale the time delta computation
+	 * in `update()`.
+	 *
+	 * @param {number} timescale - The timescale to set.
+	 * @return {Timer} A reference to this timer.
+	 */
+	setTimescale( timescale ) {
+
+		this._timescale = timescale;
+
+		return this;
+
+	}
+
+	/**
+	 * Resets the time computation for the current simulation step.
+	 *
+	 * @return {Timer} A reference to this timer.
+	 */
+	reset() {
+
+		this._currentTime = performance.now() - this._startTime;
+
+		return this;
+
+	}
+
+	/**
+	 * Can be used to free all internal resources. Usually called when
+	 * the timer instance isn't required anymore.
+	 */
+	dispose() {
+
+		this.disconnect();
+
+	}
+
+	/**
+	 * Updates the internal state of the timer. This method should be called
+	 * once per simulation step and before you perform queries against the timer
+	 * (e.g. via `getDelta()`).
+	 *
+	 * @param {number} timestamp - The current time in milliseconds. Can be obtained
+	 * from the `requestAnimationFrame` callback argument. If not provided, the current
+	 * time will be determined with `performance.now`.
+	 * @return {Timer} A reference to this timer.
+	 */
+	update( timestamp ) {
+
+		if ( this._pageVisibilityHandler !== null && this._document.hidden === true ) {
+
+			this._delta = 0;
+
+		} else {
+
+			this._previousTime = this._currentTime;
+			this._currentTime = ( timestamp !== undefined ? timestamp : performance.now() ) - this._startTime;
+
+			this._delta = ( this._currentTime - this._previousTime ) * this._timescale;
+			this._elapsed += this._delta; // _elapsed is the accumulation of all previous deltas
+
+		}
+
+		return this;
+
+	}
+
+}
+
+function handleVisibilityChange() {
+
+	if ( this._document.hidden === false ) this.reset();
+
+}
+
+const _position$1 = /*@__PURE__*/ new Vector3();
+const _quaternion$1 = /*@__PURE__*/ new Quaternion();
+const _scale$1 = /*@__PURE__*/ new Vector3();
+
+const _forward = /*@__PURE__*/ new Vector3();
+const _up = /*@__PURE__*/ new Vector3();
+
+/**
+ * The class represents a virtual listener of the all positional and non-positional audio effects
+ * in the scene. A three.js application usually creates a single listener. It is a mandatory
+ * constructor parameter for audios entities like {@link Audio} and {@link PositionalAudio}.
+ *
+ * In most cases, the listener object is a child of the camera. So the 3D transformation of the
+ * camera represents the 3D transformation of the listener.
+ *
+ * @augments Object3D
+ */
+class AudioListener extends Object3D {
+
+	/**
+	 * Constructs a new audio listener.
+	 */
+	constructor() {
+
+		super();
+
+		this.type = 'AudioListener';
+
+		/**
+		 * The native audio context.
+		 *
+		 * @type {AudioContext}
+		 * @readonly
+		 */
+		this.context = AudioContext.getContext();
+
+		/**
+		 * The gain node used for volume control.
+		 *
+		 * @type {GainNode}
+		 * @readonly
+		 */
+		this.gain = this.context.createGain();
+		this.gain.connect( this.context.destination );
+
+		/**
+		 * An optional filter.
+		 *
+		 * Defined via {@link AudioListener#setFilter}.
+		 *
+		 * @type {?AudioNode}
+		 * @default null
+		 * @readonly
+		 */
+		this.filter = null;
+
+		/**
+		 * Time delta values required for `linearRampToValueAtTime()` usage.
+		 *
+		 * @type {number}
+		 * @default 0
+		 * @readonly
+		 */
+		this.timeDelta = 0;
+
+		// private
+
+		this._timer = new Timer();
+
+	}
+
+	/**
+	 * Returns the listener's input node.
+	 *
+	 * This method is used by other audio nodes to connect to this listener.
+	 *
+	 * @return {GainNode} The input node.
+	 */
+	getInput() {
+
+		return this.gain;
+
+	}
+
+	/**
+	 * Removes the current filter from this listener.
+	 *
+	 * @return {AudioListener} A reference to this listener.
+	 */
+	removeFilter() {
+
+		if ( this.filter !== null ) {
+
+			this.gain.disconnect( this.filter );
+			this.filter.disconnect( this.context.destination );
+			this.gain.connect( this.context.destination );
+			this.filter = null;
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the current set filter.
+	 *
+	 * @return {?AudioNode} The filter.
+	 */
+	getFilter() {
+
+		return this.filter;
+
+	}
+
+	/**
+	 * Sets the given filter to this listener.
+	 *
+	 * @param {AudioNode} value - The filter to set.
+	 * @return {AudioListener} A reference to this listener.
+	 */
+	setFilter( value ) {
+
+		if ( this.filter !== null ) {
+
+			this.gain.disconnect( this.filter );
+			this.filter.disconnect( this.context.destination );
+
+		} else {
+
+			this.gain.disconnect( this.context.destination );
+
+		}
+
+		this.filter = value;
+		this.gain.connect( this.filter );
+		this.filter.connect( this.context.destination );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the applications master volume.
+	 *
+	 * @return {number} The master volume.
+	 */
+	getMasterVolume() {
+
+		return this.gain.gain.value;
+
+	}
+
+	/**
+	 * Sets the applications master volume. This volume setting affects
+	 * all audio nodes in the scene.
+	 *
+	 * @param {number} value - The master volume to set.
+	 * @return {AudioListener} A reference to this listener.
+	 */
+	setMasterVolume( value ) {
+
+		this.gain.gain.setTargetAtTime( value, this.context.currentTime, 0.01 );
+
+		return this;
+
+	}
+
+	updateMatrixWorld( force ) {
+
+		super.updateMatrixWorld( force );
+
+		this._timer.update();
+
+		const listener = this.context.listener;
+
+		this.timeDelta = this._timer.getDelta();
+
+		this.matrixWorld.decompose( _position$1, _quaternion$1, _scale$1 );
+
+		// the initial forward and up directions must be orthogonal
+		_forward.set( 0, 0, -1 ).applyQuaternion( _quaternion$1 );
+		_up.set( 0, 1, 0 ).applyQuaternion( _quaternion$1 );
+
+		if ( listener.positionX ) {
+
+			// code path for Chrome (see #14393)
+
+			const endTime = this.context.currentTime + this.timeDelta;
+
+			listener.positionX.linearRampToValueAtTime( _position$1.x, endTime );
+			listener.positionY.linearRampToValueAtTime( _position$1.y, endTime );
+			listener.positionZ.linearRampToValueAtTime( _position$1.z, endTime );
+			listener.forwardX.linearRampToValueAtTime( _forward.x, endTime );
+			listener.forwardY.linearRampToValueAtTime( _forward.y, endTime );
+			listener.forwardZ.linearRampToValueAtTime( _forward.z, endTime );
+			listener.upX.linearRampToValueAtTime( _up.x, endTime );
+			listener.upY.linearRampToValueAtTime( _up.y, endTime );
+			listener.upZ.linearRampToValueAtTime( _up.z, endTime );
+
+		} else {
+
+			listener.setPosition( _position$1.x, _position$1.y, _position$1.z );
+			listener.setOrientation( _forward.x, _forward.y, _forward.z, _up.x, _up.y, _up.z );
+
+		}
+
+	}
+
+}
+
+/**
+ * Represents a non-positional ( global ) audio object.
+ *
+ * This and related audio modules make use of the [Web Audio API](https://www.w3.org/TR/webaudio-1.1/).
+ *
+ * ```js
+ * // create an AudioListener and add it to the camera
+ * const listener = new THREE.AudioListener();
+ * camera.add( listener );
+ *
+ * // create a global audio source
+ * const sound = new THREE.Audio( listener );
+ *
+ * // load a sound and set it as the Audio object's buffer
+ * const audioLoader = new THREE.AudioLoader();
+ * audioLoader.load( 'sounds/ambient.ogg', function( buffer ) {
+ * 	sound.setBuffer( buffer );
+ * 	sound.setLoop( true );
+ * 	sound.setVolume( 0.5 );
+ * 	sound.play();
+ * });
+ * ```
+ *
+ * @augments Object3D
+ */
+class Audio extends Object3D {
+
+	/**
+	 * Constructs a new audio.
+	 *
+	 * @param {AudioListener} listener - The global audio listener.
+	 */
+	constructor( listener ) {
+
+		super();
+
+		this.type = 'Audio';
+
+		/**
+		 * The global audio listener.
+		 *
+		 * @type {AudioListener}
+		 * @readonly
+		 */
+		this.listener = listener;
+
+		/**
+		 * The audio context.
+		 *
+		 * @type {AudioContext}
+		 * @readonly
+		 */
+		this.context = listener.context;
+
+		/**
+		 * The gain node used for volume control.
+		 *
+		 * @type {GainNode}
+		 * @readonly
+		 */
+		this.gain = this.context.createGain();
+		this.gain.connect( listener.getInput() );
+
+		/**
+		 * Whether to start playback automatically or not.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.autoplay = false;
+
+		/**
+		 * A reference to an audio buffer.
+		 *
+		 * Defined via {@link Audio#setBuffer}.
+		 *
+		 * @type {?AudioBuffer}
+		 * @default null
+		 * @readonly
+		 */
+		this.buffer = null;
+
+		/**
+		 * Modify pitch, measured in cents. +/- 100 is a semitone.
+		 * +/- 1200 is an octave.
+		 *
+		 * Defined via {@link Audio#setDetune}.
+		 *
+		 * @type {number}
+		 * @default 0
+		 * @readonly
+		 */
+		this.detune = 0;
+
+		/**
+		 * Whether the audio should loop or not.
+		 *
+		 * Defined via {@link Audio#setLoop}.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 * @readonly
+		 */
+		this.loop = false;
+
+		/**
+		 * Defines where in the audio buffer the replay should
+		 * start, in seconds.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.loopStart = 0;
+
+		/**
+		 * Defines where in the audio buffer the replay should
+		 * stop, in seconds.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.loopEnd = 0;
+
+		/**
+		 * An offset to the time within the audio buffer the playback
+		 * should begin, in seconds.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.offset = 0;
+
+		/**
+		 * Overrides the default duration of the audio.
+		 *
+		 * @type {undefined|number}
+		 * @default undefined
+		 */
+		this.duration = undefined;
+
+		/**
+		 * The playback speed.
+		 *
+		 * Defined via {@link Audio#setPlaybackRate}.
+		 *
+		 * @type {number}
+		 * @readonly
+		 * @default 1
+		 */
+		this.playbackRate = 1;
+
+		/**
+		 * Indicates whether the audio is playing or not.
+		 *
+		 * This flag will be automatically set when using {@link Audio#play},
+		 * {@link Audio#pause}, {@link Audio#stop}.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default false
+		 */
+		this.isPlaying = false;
+
+		/**
+		 * Indicates whether the audio playback can be controlled
+		 * with method like {@link Audio#play} or {@link Audio#pause}.
+		 *
+		 * This flag will be automatically set when audio sources are
+		 * defined.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.hasPlaybackControl = true;
+
+		/**
+		 * Holds a reference to the current audio source.
+		 *
+		 * The property is automatically by one of the `set*()` methods.
+		 *
+		 * @type {?AudioNode}
+		 * @readonly
+		 * @default null
+		 */
+		this.source = null;
+
+		/**
+		 * Defines the source type.
+		 *
+		 * The property is automatically set by one of the `set*()` methods.
+		 *
+		 * @type {('empty'|'audioNode'|'mediaNode'|'mediaStreamNode'|'buffer')}
+		 * @readonly
+		 * @default 'empty'
+		 */
+		this.sourceType = 'empty';
+
+		this._startedAt = 0;
+		this._progress = 0;
+		this._connected = false;
+
+		/**
+		 * Can be used to apply a variety of low-order filters to create
+		 * more complex sound effects e.g. via `BiquadFilterNode`.
+		 *
+		 * The property is automatically set by {@link Audio#setFilters}.
+		 *
+		 * @type {Array<AudioNode>}
+		 * @readonly
+		 */
+		this.filters = [];
+
+	}
+
+	/**
+	 * Returns the output audio node.
+	 *
+	 * @return {GainNode} The output node.
+	 */
+	getOutput() {
+
+		return this.gain;
+
+	}
+
+	/**
+	 * Sets the given audio node as the source of this instance.
+	 *
+	 * {@link Audio#sourceType} is set to `audioNode` and {@link Audio#hasPlaybackControl} to `false`.
+	 *
+	 * @param {AudioNode} audioNode - The audio node like an instance of `OscillatorNode`.
+	 * @return {Audio} A reference to this instance.
+	 */
+	setNodeSource( audioNode ) {
+
+		this.hasPlaybackControl = false;
+		this.sourceType = 'audioNode';
+		this.source = audioNode;
+		this.connect();
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the given media element as the source of this instance.
+	 *
+	 * {@link Audio#sourceType} is set to `mediaNode` and {@link Audio#hasPlaybackControl} to `false`.
+	 *
+	 * @param {HTMLMediaElement} mediaElement - The media element.
+	 * @return {Audio} A reference to this instance.
+	 */
+	setMediaElementSource( mediaElement ) {
+
+		this.hasPlaybackControl = false;
+		this.sourceType = 'mediaNode';
+		this.source = this.context.createMediaElementSource( mediaElement );
+		this.connect();
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the given media stream as the source of this instance.
+	 *
+	 * {@link Audio#sourceType} is set to `mediaStreamNode` and {@link Audio#hasPlaybackControl} to `false`.
+	 *
+	 * @param {MediaStream} mediaStream - The media stream.
+	 * @return {Audio} A reference to this instance.
+	 */
+	setMediaStreamSource( mediaStream ) {
+
+		this.hasPlaybackControl = false;
+		this.sourceType = 'mediaStreamNode';
+		this.source = this.context.createMediaStreamSource( mediaStream );
+		this.connect();
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the given audio buffer as the source of this instance.
+	 *
+	 * {@link Audio#sourceType} is set to `buffer` and {@link Audio#hasPlaybackControl} to `true`.
+	 *
+	 * @param {AudioBuffer} audioBuffer - The audio buffer.
+	 * @return {Audio} A reference to this instance.
+	 */
+	setBuffer( audioBuffer ) {
+
+		this.buffer = audioBuffer;
+		this.sourceType = 'buffer';
+
+		if ( this.autoplay ) this.play();
+
+		return this;
+
+	}
+
+	/**
+	 * Starts the playback of the audio.
+	 *
+	 * Can only be used with compatible audio sources that allow playback control.
+	 *
+	 * @param {number} [delay=0] - The delay, in seconds, at which the audio should start playing.
+	 * @return {Audio|undefined} A reference to this instance.
+	 */
+	play( delay = 0 ) {
+
+		if ( this.isPlaying === true ) {
+
+			warn( 'Audio: Audio is already playing.' );
+			return;
+
+		}
+
+		if ( this.hasPlaybackControl === false ) {
+
+			warn( 'Audio: this Audio has no playback control.' );
+			return;
+
+		}
+
+		this._startedAt = this.context.currentTime + delay;
+
+		const source = this.context.createBufferSource();
+		source.buffer = this.buffer;
+		source.loop = this.loop;
+		source.loopStart = this.loopStart;
+		source.loopEnd = this.loopEnd;
+		source.onended = this.onEnded.bind( this );
+		source.start( this._startedAt, this._progress + this.offset, this.duration );
+
+		this.isPlaying = true;
+
+		this.source = source;
+
+		this.setDetune( this.detune );
+		this.setPlaybackRate( this.playbackRate );
+
+		return this.connect();
+
+	}
+
+	/**
+	 * Pauses the playback of the audio.
+	 *
+	 * Can only be used with compatible audio sources that allow playback control.
+	 *
+	 * @return {Audio|undefined} A reference to this instance.
+	 */
+	pause() {
+
+		if ( this.hasPlaybackControl === false ) {
+
+			warn( 'Audio: this Audio has no playback control.' );
+			return;
+
+		}
+
+		if ( this.isPlaying === true ) {
+
+			// update current progress
+
+			this._progress += Math.max( this.context.currentTime - this._startedAt, 0 ) * this.playbackRate;
+
+			if ( this.loop === true ) {
+
+				// ensure _progress does not exceed duration with looped audios
+
+				this._progress = this._progress % ( this.duration || this.buffer.duration );
+
+			}
+
+			this.source.stop();
+			this.source.onended = null;
+
+			this.isPlaying = false;
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Stops the playback of the audio.
+	 *
+	 * Can only be used with compatible audio sources that allow playback control.
+	 *
+	 * @param {number} [delay=0] - The delay, in seconds, at which the audio should stop playing.
+	 * @return {Audio|undefined} A reference to this instance.
+	 */
+	stop( delay = 0 ) {
+
+		if ( this.hasPlaybackControl === false ) {
+
+			warn( 'Audio: this Audio has no playback control.' );
+			return;
+
+		}
+
+		this._progress = 0;
+
+		if ( this.source !== null ) {
+
+			this.source.stop( this.context.currentTime + delay );
+			this.source.onended = null;
+
+		}
+
+		this.isPlaying = false;
+
+		return this;
+
+	}
+
+	/**
+	 * Connects to the audio source. This is used internally on
+	 * initialisation and when setting / removing filters.
+	 *
+	 * @return {Audio} A reference to this instance.
+	 */
+	connect() {
+
+		if ( this.filters.length > 0 ) {
+
+			this.source.connect( this.filters[ 0 ] );
+
+			for ( let i = 1, l = this.filters.length; i < l; i ++ ) {
+
+				this.filters[ i - 1 ].connect( this.filters[ i ] );
+
+			}
+
+			this.filters[ this.filters.length - 1 ].connect( this.getOutput() );
+
+		} else {
+
+			this.source.connect( this.getOutput() );
+
+		}
+
+		this._connected = true;
+
+		return this;
+
+	}
+
+	/**
+	 * Disconnects to the audio source. This is used internally on
+	 * initialisation and when setting / removing filters.
+	 *
+	 * @return {Audio|undefined} A reference to this instance.
+	 */
+	disconnect() {
+
+		if ( this._connected === false ) {
+
+			return;
+
+		}
+
+		if ( this.filters.length > 0 ) {
+
+			this.source.disconnect( this.filters[ 0 ] );
+
+			for ( let i = 1, l = this.filters.length; i < l; i ++ ) {
+
+				this.filters[ i - 1 ].disconnect( this.filters[ i ] );
+
+			}
+
+			this.filters[ this.filters.length - 1 ].disconnect( this.getOutput() );
+
+		} else {
+
+			this.source.disconnect( this.getOutput() );
+
+		}
+
+		this._connected = false;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the current set filters.
+	 *
+	 * @return {Array<AudioNode>} The list of filters.
+	 */
+	getFilters() {
+
+		return this.filters;
+
+	}
+
+	/**
+	 * Sets an array of filters and connects them with the audio source.
+	 *
+	 * @param {Array<AudioNode>} [value] - A list of filters.
+	 * @return {Audio} A reference to this instance.
+	 */
+	setFilters( value ) {
+
+		if ( ! value ) value = [];
+
+		if ( this._connected === true ) {
+
+			this.disconnect();
+			this.filters = value.slice();
+			this.connect();
+
+		} else {
+
+			this.filters = value.slice();
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Defines the detuning of oscillation in cents.
+	 *
+	 * @param {number} value - The detuning of oscillation in cents.
+	 * @return {Audio} A reference to this instance.
+	 */
+	setDetune( value ) {
+
+		this.detune = value;
+
+		if ( this.isPlaying === true && this.source.detune !== undefined ) {
+
+			this.source.detune.setTargetAtTime( this.detune, this.context.currentTime, 0.01 );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the detuning of oscillation in cents.
+	 *
+	 * @return {number} The detuning of oscillation in cents.
+	 */
+	getDetune() {
+
+		return this.detune;
+
+	}
+
+	/**
+	 * Returns the first filter in the list of filters.
+	 *
+	 * @return {AudioNode|undefined} The first filter in the list of filters.
+	 */
+	getFilter() {
+
+		return this.getFilters()[ 0 ];
+
+	}
+
+	/**
+	 * Applies a single filter node to the audio.
+	 *
+	 * @param {AudioNode} [filter] - The filter to set.
+	 * @return {Audio} A reference to this instance.
+	 */
+	setFilter( filter ) {
+
+		return this.setFilters( filter ? [ filter ] : [] );
+
+	}
+
+	/**
+	 * Sets the playback rate.
+	 *
+	 * Can only be used with compatible audio sources that allow playback control.
+	 *
+	 * @param {number} [value] - The playback rate to set.
+	 * @return {Audio|undefined} A reference to this instance.
+	 */
+	setPlaybackRate( value ) {
+
+		if ( this.hasPlaybackControl === false ) {
+
+			warn( 'Audio: this Audio has no playback control.' );
+			return;
+
+		}
+
+		this.playbackRate = value;
+
+		if ( this.isPlaying === true ) {
+
+			this.source.playbackRate.setTargetAtTime( this.playbackRate, this.context.currentTime, 0.01 );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the current playback rate.
+
+	 * @return {number} The playback rate.
+	 */
+	getPlaybackRate() {
+
+		return this.playbackRate;
+
+	}
+
+	/**
+	 * Automatically called when playback finished.
+	 */
+	onEnded() {
+
+		this.isPlaying = false;
+		this._progress = 0;
+
+	}
+
+	/**
+	 * Returns the loop flag.
+	 *
+	 * Can only be used with compatible audio sources that allow playback control.
+	 *
+	 * @return {boolean} Whether the audio should loop or not.
+	 */
+	getLoop() {
+
+		if ( this.hasPlaybackControl === false ) {
+
+			warn( 'Audio: this Audio has no playback control.' );
+			return false;
+
+		}
+
+		return this.loop;
+
+	}
+
+	/**
+	 * Sets the loop flag.
+	 *
+	 * Can only be used with compatible audio sources that allow playback control.
+	 *
+	 * @param {boolean} value - Whether the audio should loop or not.
+	 * @return {Audio|undefined} A reference to this instance.
+	 */
+	setLoop( value ) {
+
+		if ( this.hasPlaybackControl === false ) {
+
+			warn( 'Audio: this Audio has no playback control.' );
+			return;
+
+		}
+
+		this.loop = value;
+
+		if ( this.isPlaying === true ) {
+
+			this.source.loop = this.loop;
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the loop start value which defines where in the audio buffer the replay should
+	 * start, in seconds.
+	 *
+	 * @param {number} value - The loop start value.
+	 * @return {Audio} A reference to this instance.
+	 */
+	setLoopStart( value ) {
+
+		this.loopStart = value;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the loop end value which defines where in the audio buffer the replay should
+	 * stop, in seconds.
+	 *
+	 * @param {number} value - The loop end value.
+	 * @return {Audio} A reference to this instance.
+	 */
+	setLoopEnd( value ) {
+
+		this.loopEnd = value;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the volume.
+	 *
+	 * @return {number} The volume.
+	 */
+	getVolume() {
+
+		return this.gain.gain.value;
+
+	}
+
+	/**
+	 * Sets the volume.
+	 *
+	 * @param {number} value - The volume to set.
+	 * @return {Audio} A reference to this instance.
+	 */
+	setVolume( value ) {
+
+		this.gain.gain.setTargetAtTime( value, this.context.currentTime, 0.01 );
+
+		return this;
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		if ( source.sourceType !== 'buffer' ) {
+
+			warn( 'Audio: Audio source type cannot be copied.' );
+
+			return this;
+
+		}
+
+		this.autoplay = source.autoplay;
+
+		this.buffer = source.buffer;
+		this.detune = source.detune;
+		this.loop = source.loop;
+		this.loopStart = source.loopStart;
+		this.loopEnd = source.loopEnd;
+		this.offset = source.offset;
+		this.duration = source.duration;
+		this.playbackRate = source.playbackRate;
+		this.hasPlaybackControl = source.hasPlaybackControl;
+		this.sourceType = source.sourceType;
+
+		this.filters = source.filters.slice();
+
+		return this;
+
+	}
+
+	clone( recursive ) {
+
+		return new this.constructor( this.listener ).copy( this, recursive );
+
+	}
+
+}
+
+const _position = /*@__PURE__*/ new Vector3();
+const _quaternion = /*@__PURE__*/ new Quaternion();
+const _scale = /*@__PURE__*/ new Vector3();
+const _orientation = /*@__PURE__*/ new Vector3();
+
+/**
+ * Represents a positional audio object.
+ *
+ * ```js
+ * // create an AudioListener and add it to the camera
+ * const listener = new THREE.AudioListener();
+ * camera.add( listener );
+ *
+ * // create the PositionalAudio object (passing in the listener)
+ * const sound = new THREE.PositionalAudio( listener );
+ *
+ * // load a sound and set it as the PositionalAudio object's buffer
+ * const audioLoader = new THREE.AudioLoader();
+ * audioLoader.load( 'sounds/song.ogg', function( buffer ) {
+ * 	sound.setBuffer( buffer );
+ * 	sound.setRefDistance( 20 );
+ * 	sound.play();
+ * });
+ *
+ * // create an object for the sound to play from
+ * const sphere = new THREE.SphereGeometry( 20, 32, 16 );
+ * const material = new THREE.MeshPhongMaterial( { color: 0xff2200 } );
+ * const mesh = new THREE.Mesh( sphere, material );
+ * scene.add( mesh );
+ *
+ * // finally add the sound to the mesh
+ * mesh.add( sound );
+ *
+ * @augments Audio
+ */
+class PositionalAudio extends Audio {
+
+	/**
+	 * Constructs a positional audio.
+	 *
+	 * @param {AudioListener} listener - The global audio listener.
+	 */
+	constructor( listener ) {
+
+		super( listener );
+
+		/**
+		 * The panner node represents the location, direction, and behavior of an audio
+		 * source in 3D space.
+		 *
+		 * @type {PannerNode}
+		 * @readonly
+		 */
+		this.panner = this.context.createPanner();
+		this.panner.panningModel = 'HRTF';
+		this.panner.connect( this.gain );
+
+	}
+
+	connect() {
+
+		super.connect();
+
+		this.panner.connect( this.gain );
+
+		return this;
+
+	}
+
+	disconnect() {
+
+		super.disconnect();
+
+		this.panner.disconnect( this.gain );
+
+		return this;
+
+	}
+
+	getOutput() {
+
+		return this.panner;
+
+	}
+
+	/**
+	 * Returns the current reference distance.
+	 *
+	 * @return {number} The reference distance.
+	 */
+	getRefDistance() {
+
+		return this.panner.refDistance;
+
+	}
+
+	/**
+	 * Defines the reference distance for reducing volume as the audio source moves
+	 * further from the listener – i.e. the distance at which the volume reduction
+	 * starts taking effect.
+	 *
+	 * @param {number} value - The reference distance to set.
+	 * @return {PositionalAudio} A reference to this instance.
+	 */
+	setRefDistance( value ) {
+
+		this.panner.refDistance = value;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the current rolloff factor.
+	 *
+	 * @return {number} The rolloff factor.
+	 */
+	getRolloffFactor() {
+
+		return this.panner.rolloffFactor;
+
+	}
+
+	/**
+	 * Defines how quickly the volume is reduced as the source moves away from the listener.
+	 *
+	 * @param {number} value - The rolloff factor.
+	 * @return {PositionalAudio} A reference to this instance.
+	 */
+	setRolloffFactor( value ) {
+
+		this.panner.rolloffFactor = value;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the current distance model.
+	 *
+	 * @return {('linear'|'inverse'|'exponential')} The distance model.
+	 */
+	getDistanceModel() {
+
+		return this.panner.distanceModel;
+
+	}
+
+	/**
+	 * Defines which algorithm to use to reduce the volume of the audio source
+	 * as it moves away from the listener.
+	 *
+	 * Read [the spec](https://www.w3.org/TR/webaudio-1.1/#enumdef-distancemodeltype)
+	 * for more details.
+	 *
+	 * @param {('linear'|'inverse'|'exponential')} value - The distance model to set.
+	 * @return {PositionalAudio} A reference to this instance.
+	 */
+	setDistanceModel( value ) {
+
+		this.panner.distanceModel = value;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the current max distance.
+	 *
+	 * @return {number} The max distance.
+	 */
+	getMaxDistance() {
+
+		return this.panner.maxDistance;
+
+	}
+
+	/**
+	 * Defines the maximum distance between the audio source and the listener,
+	 * after which the volume is not reduced any further.
+	 *
+	 * This value is used only by the `linear` distance model.
+	 *
+	 * @param {number} value - The max distance.
+	 * @return {PositionalAudio} A reference to this instance.
+	 */
+	setMaxDistance( value ) {
+
+		this.panner.maxDistance = value;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the directional cone in which the audio can be listened.
+	 *
+	 * @param {number} coneInnerAngle - An angle, in degrees, of a cone inside of which there will be no volume reduction.
+	 * @param {number} coneOuterAngle - An angle, in degrees, of a cone outside of which the volume will be reduced by a constant value, defined by the `coneOuterGain` parameter.
+	 * @param {number} coneOuterGain - The amount of volume reduction outside the cone defined by the `coneOuterAngle`. When set to `0`, no sound can be heard.
+	 * @return {PositionalAudio} A reference to this instance.
+	 */
+	setDirectionalCone( coneInnerAngle, coneOuterAngle, coneOuterGain ) {
+
+		this.panner.coneInnerAngle = coneInnerAngle;
+		this.panner.coneOuterAngle = coneOuterAngle;
+		this.panner.coneOuterGain = coneOuterGain;
+
+		return this;
+
+	}
+
+	updateMatrixWorld( force ) {
+
+		super.updateMatrixWorld( force );
+
+		if ( this.hasPlaybackControl === true && this.isPlaying === false ) return;
+
+		this.matrixWorld.decompose( _position, _quaternion, _scale );
+
+		_orientation.set( 0, 0, 1 ).applyQuaternion( _quaternion );
+
+		const panner = this.panner;
+
+		if ( panner.positionX ) {
+
+			// code path for Chrome and Firefox (see #14393)
+
+			const endTime = this.context.currentTime + this.listener.timeDelta;
+
+			panner.positionX.linearRampToValueAtTime( _position.x, endTime );
+			panner.positionY.linearRampToValueAtTime( _position.y, endTime );
+			panner.positionZ.linearRampToValueAtTime( _position.z, endTime );
+			panner.orientationX.linearRampToValueAtTime( _orientation.x, endTime );
+			panner.orientationY.linearRampToValueAtTime( _orientation.y, endTime );
+			panner.orientationZ.linearRampToValueAtTime( _orientation.z, endTime );
+
+		} else {
+
+			panner.setPosition( _position.x, _position.y, _position.z );
+			panner.setOrientation( _orientation.x, _orientation.y, _orientation.z );
+
+		}
+
+	}
+
+}
+
+/**
+ * This class can be used to analyse audio data.
+ *
+ * ```js
+ * // create an AudioListener and add it to the camera
+ * const listener = new THREE.AudioListener();
+ * camera.add( listener );
+ *
+ * // create an Audio source
+ * const sound = new THREE.Audio( listener );
+ *
+ * // load a sound and set it as the Audio object's buffer
+ * const audioLoader = new THREE.AudioLoader();
+ * audioLoader.load( 'sounds/ambient.ogg', function( buffer ) {
+ * 	sound.setBuffer( buffer );
+ * 	sound.setLoop(true);
+ * 	sound.setVolume(0.5);
+ * 	sound.play();
+ * });
+ *
+ * // create an AudioAnalyser, passing in the sound and desired fftSize
+ * const analyser = new THREE.AudioAnalyser( sound, 32 );
+ *
+ * // get the average frequency of the sound
+ * const data = analyser.getAverageFrequency();
+ * ```
+ */
+class AudioAnalyser {
+
+	/**
+	 * Constructs a new audio analyzer.
+	 *
+	 * @param {Audio} audio - The audio to analyze.
+	 * @param {number} [fftSize=2048] - The window size in samples that is used when performing a Fast Fourier Transform (FFT) to get frequency domain data.
+	 */
+	constructor( audio, fftSize = 2048 ) {
+
+		/**
+		 * The global audio listener.
+		 *
+		 * @type {AnalyserNode}
+		 */
+		this.analyser = audio.context.createAnalyser();
+		this.analyser.fftSize = fftSize;
+
+		/**
+		 * Holds the analyzed data.
+		 *
+		 * @type {Uint8Array}
+		 */
+		this.data = new Uint8Array( this.analyser.frequencyBinCount );
+
+		audio.getOutput().connect( this.analyser );
+
+	}
+
+	/**
+	 * Returns an array with frequency data of the audio.
+	 *
+	 * Each item in the array represents the decibel value for a specific frequency.
+	 * The frequencies are spread linearly from 0 to 1/2 of the sample rate.
+	 * For example, for 48000 sample rate, the last item of the array will represent
+	 * the decibel value for 24000 Hz.
+	 *
+	 * @return {Uint8Array} The frequency data.
+	 */
+	getFrequencyData() {
+
+		this.analyser.getByteFrequencyData( this.data );
+
+		return this.data;
+
+	}
+
+	/**
+	 * Returns the average of the frequencies returned by {@link AudioAnalyser#getFrequencyData}.
+	 *
+	 * @return {number} The average frequency.
+	 */
+	getAverageFrequency() {
+
+		let value = 0;
+		const data = this.getFrequencyData();
+
+		for ( let i = 0; i < data.length; i ++ ) {
+
+			value += data[ i ];
+
+		}
+
+		return value / data.length;
+
+	}
+
+}
+
+/**
+ * Buffered scene graph property that allows weighted accumulation; used internally.
+ */
+class PropertyMixer {
+
+	/**
+	 * Constructs a new property mixer.
+	 *
+	 * @param {PropertyBinding} binding - The property binding.
+	 * @param {string} typeName - The keyframe track type name.
+	 * @param {number} valueSize - The keyframe track value size.
+	 */
+	constructor( binding, typeName, valueSize ) {
+
+		/**
+		 * The property binding.
+		 *
+		 * @type {PropertyBinding}
+		 */
+		this.binding = binding;
+
+		/**
+		 * The keyframe track value size.
+		 *
+		 * @type {number}
+		 */
+		this.valueSize = valueSize;
+
+		let mixFunction,
+			mixFunctionAdditive,
+			setIdentity;
+
+		// buffer layout: [ incoming | accu0 | accu1 | orig | addAccu | (optional work) ]
+		//
+		// interpolators can use .buffer as their .result
+		// the data then goes to 'incoming'
+		//
+		// 'accu0' and 'accu1' are used frame-interleaved for
+		// the cumulative result and are compared to detect
+		// changes
+		//
+		// 'orig' stores the original state of the property
+		//
+		// 'add' is used for additive cumulative results
+		//
+		// 'work' is optional and is only present for quaternion types. It is used
+		// to store intermediate quaternion multiplication results
+
+		switch ( typeName ) {
+
+			case 'quaternion':
+				mixFunction = this._slerp;
+				mixFunctionAdditive = this._slerpAdditive;
+				setIdentity = this._setAdditiveIdentityQuaternion;
+
+				this.buffer = new Float64Array( valueSize * 6 );
+				this._workIndex = 5;
+				break;
+
+			case 'string':
+			case 'bool':
+				mixFunction = this._select;
+
+				// Use the regular mix function and for additive on these types,
+				// additive is not relevant for non-numeric types
+				mixFunctionAdditive = this._select;
+
+				setIdentity = this._setAdditiveIdentityOther;
+
+				this.buffer = new Array( valueSize * 5 );
+				break;
+
+			default:
+				mixFunction = this._lerp;
+				mixFunctionAdditive = this._lerpAdditive;
+				setIdentity = this._setAdditiveIdentityNumeric;
+
+				this.buffer = new Float64Array( valueSize * 5 );
+
+		}
+
+		this._mixBufferRegion = mixFunction;
+		this._mixBufferRegionAdditive = mixFunctionAdditive;
+		this._setIdentity = setIdentity;
+		this._origIndex = 3;
+		this._addIndex = 4;
+
+		/**
+		 * Accumulated weight of the property binding.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.cumulativeWeight = 0;
+
+		/**
+		 * Accumulated additive weight of the property binding.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.cumulativeWeightAdditive = 0;
+
+		/**
+		 * Number of active keyframe tracks currently using this property binding.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.useCount = 0;
+
+		/**
+		 * Number of keyframe tracks referencing this property binding.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.referenceCount = 0;
+
+	}
+
+	/**
+	 * Accumulates data in the `incoming` region into `accu<i>`.
+	 *
+	 * @param {number} accuIndex - The accumulation index.
+	 * @param {number} weight - The weight.
+	 */
+	accumulate( accuIndex, weight ) {
+
+		// note: happily accumulating nothing when weight = 0, the caller knows
+		// the weight and shouldn't have made the call in the first place
+
+		const buffer = this.buffer,
+			stride = this.valueSize,
+			offset = accuIndex * stride + stride;
+
+		let currentWeight = this.cumulativeWeight;
+
+		if ( currentWeight === 0 ) {
+
+			// accuN := incoming * weight
+
+			for ( let i = 0; i !== stride; ++ i ) {
+
+				buffer[ offset + i ] = buffer[ i ];
+
+			}
+
+			currentWeight = weight;
+
+		} else {
+
+			// accuN := accuN + incoming * weight
+
+			currentWeight += weight;
+			const mix = weight / currentWeight;
+			this._mixBufferRegion( buffer, offset, 0, mix, stride );
+
+		}
+
+		this.cumulativeWeight = currentWeight;
+
+	}
+
+	/**
+	 * Accumulates data in the `incoming` region into `add`.
+	 *
+	 * @param {number} weight - The weight.
+	 */
+	accumulateAdditive( weight ) {
+
+		const buffer = this.buffer,
+			stride = this.valueSize,
+			offset = stride * this._addIndex;
+
+		if ( this.cumulativeWeightAdditive === 0 ) {
+
+			// add = identity
+
+			this._setIdentity();
+
+		}
+
+		// add := add + incoming * weight
+
+		this._mixBufferRegionAdditive( buffer, offset, 0, weight, stride );
+		this.cumulativeWeightAdditive += weight;
+
+	}
+
+	/**
+	 * Applies the state of `accu<i>` to the binding when accus differ.
+	 *
+	 * @param {number} accuIndex - The accumulation index.
+	 */
+	apply( accuIndex ) {
+
+		const stride = this.valueSize,
+			buffer = this.buffer,
+			offset = accuIndex * stride + stride,
+
+			weight = this.cumulativeWeight,
+			weightAdditive = this.cumulativeWeightAdditive,
+
+			binding = this.binding;
+
+		this.cumulativeWeight = 0;
+		this.cumulativeWeightAdditive = 0;
+
+		if ( weight < 1 ) {
+
+			// accuN := accuN + original * ( 1 - cumulativeWeight )
+
+			const originalValueOffset = stride * this._origIndex;
+
+			this._mixBufferRegion(
+				buffer, offset, originalValueOffset, 1 - weight, stride );
+
+		}
+
+		if ( weightAdditive > 0 ) {
+
+			// accuN := accuN + additive accuN
+
+			this._mixBufferRegionAdditive( buffer, offset, this._addIndex * stride, 1, stride );
+
+		}
+
+		for ( let i = stride, e = stride + stride; i !== e; ++ i ) {
+
+			if ( buffer[ i ] !== buffer[ i + stride ] ) {
+
+				// value has changed -> update scene graph
+
+				binding.setValue( buffer, offset );
+				break;
+
+			}
+
+		}
+
+	}
+
+
+	/**
+	 * Remembers the state of the bound property and copy it to both accus.
+	 */
+	saveOriginalState() {
+
+		const binding = this.binding;
+
+		const buffer = this.buffer,
+			stride = this.valueSize,
+
+			originalValueOffset = stride * this._origIndex;
+
+		binding.getValue( buffer, originalValueOffset );
+
+		// accu[0..1] := orig -- initially detect changes against the original
+		for ( let i = stride, e = originalValueOffset; i !== e; ++ i ) {
+
+			buffer[ i ] = buffer[ originalValueOffset + ( i % stride ) ];
+
+		}
+
+		// Add to identity for additive
+		this._setIdentity();
+
+		this.cumulativeWeight = 0;
+		this.cumulativeWeightAdditive = 0;
+
+	}
+
+	/**
+	 * Applies the state previously taken via {@link PropertyMixer#saveOriginalState} to the binding.
+	 */
+	restoreOriginalState() {
+
+		const originalValueOffset = this.valueSize * 3;
+		this.binding.setValue( this.buffer, originalValueOffset );
+
+	}
+
+	// internals
+
+	_setAdditiveIdentityNumeric() {
+
+		const startIndex = this._addIndex * this.valueSize;
+		const endIndex = startIndex + this.valueSize;
+
+		for ( let i = startIndex; i < endIndex; i ++ ) {
+
+			this.buffer[ i ] = 0;
+
+		}
+
+	}
+
+	_setAdditiveIdentityQuaternion() {
+
+		this._setAdditiveIdentityNumeric();
+		this.buffer[ this._addIndex * this.valueSize + 3 ] = 1;
+
+	}
+
+	_setAdditiveIdentityOther() {
+
+		const startIndex = this._origIndex * this.valueSize;
+		const targetIndex = this._addIndex * this.valueSize;
+
+		for ( let i = 0; i < this.valueSize; i ++ ) {
+
+			this.buffer[ targetIndex + i ] = this.buffer[ startIndex + i ];
+
+		}
+
+	}
+
+
+	// mix functions
+
+	_select( buffer, dstOffset, srcOffset, t, stride ) {
+
+		if ( t >= 0.5 ) {
+
+			for ( let i = 0; i !== stride; ++ i ) {
+
+				buffer[ dstOffset + i ] = buffer[ srcOffset + i ];
+
+			}
+
+		}
+
+	}
+
+	_slerp( buffer, dstOffset, srcOffset, t ) {
+
+		Quaternion.slerpFlat( buffer, dstOffset, buffer, dstOffset, buffer, srcOffset, t );
+
+	}
+
+	_slerpAdditive( buffer, dstOffset, srcOffset, t, stride ) {
+
+		const workOffset = this._workIndex * stride;
+
+		// Store result in intermediate buffer offset
+		Quaternion.multiplyQuaternionsFlat( buffer, workOffset, buffer, dstOffset, buffer, srcOffset );
+
+		// Slerp to the intermediate result
+		Quaternion.slerpFlat( buffer, dstOffset, buffer, dstOffset, buffer, workOffset, t );
+
+	}
+
+	_lerp( buffer, dstOffset, srcOffset, t, stride ) {
+
+		const s = 1 - t;
+
+		for ( let i = 0; i !== stride; ++ i ) {
+
+			const j = dstOffset + i;
+
+			buffer[ j ] = buffer[ j ] * s + buffer[ srcOffset + i ] * t;
+
+		}
+
+	}
+
+	_lerpAdditive( buffer, dstOffset, srcOffset, t, stride ) {
+
+		for ( let i = 0; i !== stride; ++ i ) {
+
+			const j = dstOffset + i;
+
+			buffer[ j ] = buffer[ j ] + buffer[ srcOffset + i ] * t;
+
+		}
+
+	}
+
+}
+
+// Characters [].:/ are reserved for track binding syntax.
+const _RESERVED_CHARS_RE = '\\[\\]\\.:\\/';
+const _reservedRe = new RegExp( '[' + _RESERVED_CHARS_RE + ']', 'g' );
+
+// Attempts to allow node names from any language. ES5's `\w` regexp matches
+// only latin characters, and the unicode \p{L} is not yet supported. So
+// instead, we exclude reserved characters and match everything else.
+const _wordChar = '[^' + _RESERVED_CHARS_RE + ']';
+const _wordCharOrDot = '[^' + _RESERVED_CHARS_RE.replace( '\\.', '' ) + ']';
+
+// Parent directories, delimited by '/' or ':'. Currently unused, but must
+// be matched to parse the rest of the track name.
+const _directoryRe = /*@__PURE__*/ /((?:WC+[\/:])*)/.source.replace( 'WC', _wordChar );
+
+// Target node. May contain word characters (a-zA-Z0-9_) and '.' or '-'.
+const _nodeRe = /*@__PURE__*/ /(WCOD+)?/.source.replace( 'WCOD', _wordCharOrDot );
+
+// Object on target node, and accessor. May not contain reserved
+// characters. Accessor may contain any character except closing bracket.
+const _objectRe = /*@__PURE__*/ /(?:\.(WC+)(?:\[(.+)\])?)?/.source.replace( 'WC', _wordChar );
+
+// Property and accessor. May not contain reserved characters. Accessor may
+// contain any non-bracket characters.
+const _propertyRe = /*@__PURE__*/ /\.(WC+)(?:\[(.+)\])?/.source.replace( 'WC', _wordChar );
+
+const _trackRe = new RegExp( ''
+	+ '^'
+	+ _directoryRe
+	+ _nodeRe
+	+ _objectRe
+	+ _propertyRe
+	+ '$'
+);
+
+const _supportedObjectNames = [ 'material', 'materials', 'bones', 'map' ];
+
+class Composite {
+
+	constructor( targetGroup, path, optionalParsedPath ) {
+
+		const parsedPath = optionalParsedPath || PropertyBinding.parseTrackName( path );
+
+		this._targetGroup = targetGroup;
+		this._bindings = targetGroup.subscribe_( path, parsedPath );
+
+	}
+
+	getValue( array, offset ) {
+
+		this.bind(); // bind all binding
+
+		const firstValidIndex = this._targetGroup.nCachedObjects_,
+			binding = this._bindings[ firstValidIndex ];
+
+		// and only call .getValue on the first
+		if ( binding !== undefined ) binding.getValue( array, offset );
+
+	}
+
+	setValue( array, offset ) {
+
+		const bindings = this._bindings;
+
+		for ( let i = this._targetGroup.nCachedObjects_, n = bindings.length; i !== n; ++ i ) {
+
+			bindings[ i ].setValue( array, offset );
+
+		}
+
+	}
+
+	bind() {
+
+		const bindings = this._bindings;
+
+		for ( let i = this._targetGroup.nCachedObjects_, n = bindings.length; i !== n; ++ i ) {
+
+			bindings[ i ].bind();
+
+		}
+
+	}
+
+	unbind() {
+
+		const bindings = this._bindings;
+
+		for ( let i = this._targetGroup.nCachedObjects_, n = bindings.length; i !== n; ++ i ) {
+
+			bindings[ i ].unbind();
+
+		}
+
+	}
+
+}
+
+// Note: This class uses a State pattern on a per-method basis:
+// 'bind' sets 'this.getValue' / 'setValue' and shadows the
+// prototype version of these methods with one that represents
+// the bound state. When the property is not found, the methods
+// become no-ops.
+
+
+/**
+ * This holds a reference to a real property in the scene graph; used internally.
+ */
+class PropertyBinding {
+
+	/**
+	 * Constructs a new property binding.
+	 *
+	 * @param {Object} rootNode - The root node.
+	 * @param {string} path - The path.
+	 * @param {?Object} [parsedPath] - The parsed path.
+	 */
+	constructor( rootNode, path, parsedPath ) {
+
+		/**
+		 * The object path to the animated property.
+		 *
+		 * @type {string}
+		 */
+		this.path = path;
+
+		/**
+		 * An object holding information about the path.
+		 *
+		 * @type {Object}
+		 */
+		this.parsedPath = parsedPath || PropertyBinding.parseTrackName( path );
+
+		/**
+		 * The object owns the animated property.
+		 *
+		 * @type {?Object}
+		 */
+		this.node = PropertyBinding.findNode( rootNode, this.parsedPath.nodeName );
+
+		/**
+		 * The root node.
+		 *
+		 * @type {Object3D|Skeleton}
+		 */
+		this.rootNode = rootNode;
+
+		// initial state of these methods that calls 'bind'
+		this.getValue = this._getValue_unbound;
+		this.setValue = this._setValue_unbound;
+
+	}
+
+
+	/**
+	 * Factory method for creating a property binding from the given parameters.
+	 *
+	 * @static
+	 * @param {Object} root - The root node.
+	 * @param {string} path - The path.
+	 * @param {?Object} [parsedPath] - The parsed path.
+	 * @return {PropertyBinding|Composite} The created property binding or composite.
+	 */
+	static create( root, path, parsedPath ) {
+
+		if ( ! ( root && root.isAnimationObjectGroup ) ) {
+
+			return new PropertyBinding( root, path, parsedPath );
+
+		} else {
+
+			return new PropertyBinding.Composite( root, path, parsedPath );
+
+		}
+
+	}
+
+	/**
+	 * Replaces spaces with underscores and removes unsupported characters from
+	 * node names, to ensure compatibility with parseTrackName().
+	 *
+	 * @param {string} name - Node name to be sanitized.
+	 * @return {string} The sanitized node name.
+	 */
+	static sanitizeNodeName( name ) {
+
+		return name.replace( /\s/g, '_' ).replace( _reservedRe, '' );
+
+	}
+
+	/**
+	 * Parses the given track name (an object path to an animated property) and
+	 * returns an object with information about the path. Matches strings in the following forms:
+	 *
+	 * - nodeName.property
+	 * - nodeName.property[accessor]
+	 * - nodeName.material.property[accessor]
+	 * - uuid.property[accessor]
+	 * - uuid.objectName[objectIndex].propertyName[propertyIndex]
+	 * - parentName/nodeName.property
+	 * - parentName/parentName/nodeName.property[index]
+	 * - .bone[Armature.DEF_cog].position
+	 * - scene:helium_balloon_model:helium_balloon_model.position
+	 *
+	 * @static
+	 * @param {string} trackName - The track name to parse.
+	 * @return {Object} The parsed track name as an object.
+	 */
+	static parseTrackName( trackName ) {
+
+		const matches = _trackRe.exec( trackName );
+
+		if ( matches === null ) {
+
+			throw new Error( 'THREE.PropertyBinding: Cannot parse trackName: ' + trackName );
+
+		}
+
+		const results = {
+			// directoryName: matches[ 1 ], // (tschw) currently unused
+			nodeName: matches[ 2 ],
+			objectName: matches[ 3 ],
+			objectIndex: matches[ 4 ],
+			propertyName: matches[ 5 ], // required
+			propertyIndex: matches[ 6 ]
+		};
+
+		const lastDot = results.nodeName && results.nodeName.lastIndexOf( '.' );
+
+		if ( lastDot !== undefined && lastDot !== -1 ) {
+
+			const objectName = results.nodeName.substring( lastDot + 1 );
+
+			// Object names must be checked against an allowlist. Otherwise, there
+			// is no way to parse 'foo.bar.baz': 'baz' must be a property, but
+			// 'bar' could be the objectName, or part of a nodeName (which can
+			// include '.' characters).
+			if ( _supportedObjectNames.indexOf( objectName ) !== -1 ) {
+
+				results.nodeName = results.nodeName.substring( 0, lastDot );
+				results.objectName = objectName;
+
+			}
+
+		}
+
+		if ( results.propertyName === null || results.propertyName.length === 0 ) {
+
+			throw new Error( 'THREE.PropertyBinding: can not parse propertyName from trackName: ' + trackName );
+
+		}
+
+		return results;
+
+	}
+
+	/**
+	 * Searches for a node in the hierarchy of the given root object by the given
+	 * node name.
+	 *
+	 * @static
+	 * @param {Object} root - The root object.
+	 * @param {string|number} nodeName - The name of the node.
+	 * @return {?Object} The found node. Returns `null` if no object was found.
+	 */
+	static findNode( root, nodeName ) {
+
+		if ( nodeName === undefined || nodeName === '' || nodeName === '.' || nodeName === -1 || nodeName === root.name || nodeName === root.uuid ) {
+
+			return root;
+
+		}
+
+		// search into skeleton bones.
+		if ( root.skeleton ) {
+
+			const bone = root.skeleton.getBoneByName( nodeName );
+
+			if ( bone !== undefined ) {
+
+				return bone;
+
+			}
+
+		}
+
+		// search into node subtree.
+		if ( root.children ) {
+
+			const searchNodeSubtree = function ( children ) {
+
+				for ( let i = 0; i < children.length; i ++ ) {
+
+					const childNode = children[ i ];
+
+					if ( childNode.name === nodeName || childNode.uuid === nodeName ) {
+
+						return childNode;
+
+					}
+
+					const result = searchNodeSubtree( childNode.children );
+
+					if ( result ) return result;
+
+				}
+
+				return null;
+
+			};
+
+			const subTreeNode = searchNodeSubtree( root.children );
+
+			if ( subTreeNode ) {
+
+				return subTreeNode;
+
+			}
+
+		}
+
+		return null;
+
+	}
+
+	// these are used to "bind" a nonexistent property
+	_getValue_unavailable() {}
+	_setValue_unavailable() {}
+
+	// Getters
+
+	_getValue_direct( buffer, offset ) {
+
+		buffer[ offset ] = this.targetObject[ this.propertyName ];
+
+	}
+
+	_getValue_array( buffer, offset ) {
+
+		const source = this.resolvedProperty;
+
+		for ( let i = 0, n = source.length; i !== n; ++ i ) {
+
+			buffer[ offset ++ ] = source[ i ];
+
+		}
+
+	}
+
+	_getValue_arrayElement( buffer, offset ) {
+
+		buffer[ offset ] = this.resolvedProperty[ this.propertyIndex ];
+
+	}
+
+	_getValue_toArray( buffer, offset ) {
+
+		this.resolvedProperty.toArray( buffer, offset );
+
+	}
+
+	// Direct
+
+	_setValue_direct( buffer, offset ) {
+
+		this.targetObject[ this.propertyName ] = buffer[ offset ];
+
+	}
+
+	_setValue_direct_setNeedsUpdate( buffer, offset ) {
+
+		this.targetObject[ this.propertyName ] = buffer[ offset ];
+		this.targetObject.needsUpdate = true;
+
+	}
+
+	_setValue_direct_setMatrixWorldNeedsUpdate( buffer, offset ) {
+
+		this.targetObject[ this.propertyName ] = buffer[ offset ];
+		this.targetObject.matrixWorldNeedsUpdate = true;
+
+	}
+
+	// EntireArray
+
+	_setValue_array( buffer, offset ) {
+
+		const dest = this.resolvedProperty;
+
+		for ( let i = 0, n = dest.length; i !== n; ++ i ) {
+
+			dest[ i ] = buffer[ offset ++ ];
+
+		}
+
+	}
+
+	_setValue_array_setNeedsUpdate( buffer, offset ) {
+
+		const dest = this.resolvedProperty;
+
+		for ( let i = 0, n = dest.length; i !== n; ++ i ) {
+
+			dest[ i ] = buffer[ offset ++ ];
+
+		}
+
+		this.targetObject.needsUpdate = true;
+
+	}
+
+	_setValue_array_setMatrixWorldNeedsUpdate( buffer, offset ) {
+
+		const dest = this.resolvedProperty;
+
+		for ( let i = 0, n = dest.length; i !== n; ++ i ) {
+
+			dest[ i ] = buffer[ offset ++ ];
+
+		}
+
+		this.targetObject.matrixWorldNeedsUpdate = true;
+
+	}
+
+	// ArrayElement
+
+	_setValue_arrayElement( buffer, offset ) {
+
+		this.resolvedProperty[ this.propertyIndex ] = buffer[ offset ];
+
+	}
+
+	_setValue_arrayElement_setNeedsUpdate( buffer, offset ) {
+
+		this.resolvedProperty[ this.propertyIndex ] = buffer[ offset ];
+		this.targetObject.needsUpdate = true;
+
+	}
+
+	_setValue_arrayElement_setMatrixWorldNeedsUpdate( buffer, offset ) {
+
+		this.resolvedProperty[ this.propertyIndex ] = buffer[ offset ];
+		this.targetObject.matrixWorldNeedsUpdate = true;
+
+	}
+
+	// HasToFromArray
+
+	_setValue_fromArray( buffer, offset ) {
+
+		this.resolvedProperty.fromArray( buffer, offset );
+
+	}
+
+	_setValue_fromArray_setNeedsUpdate( buffer, offset ) {
+
+		this.resolvedProperty.fromArray( buffer, offset );
+		this.targetObject.needsUpdate = true;
+
+	}
+
+	_setValue_fromArray_setMatrixWorldNeedsUpdate( buffer, offset ) {
+
+		this.resolvedProperty.fromArray( buffer, offset );
+		this.targetObject.matrixWorldNeedsUpdate = true;
+
+	}
+
+	_getValue_unbound( targetArray, offset ) {
+
+		this.bind();
+		this.getValue( targetArray, offset );
+
+	}
+
+	_setValue_unbound( sourceArray, offset ) {
+
+		this.bind();
+		this.setValue( sourceArray, offset );
+
+	}
+
+	/**
+	 * Creates a getter / setter pair for the property tracked by this binding.
+	 */
+	bind() {
+
+		let targetObject = this.node;
+		const parsedPath = this.parsedPath;
+
+		const objectName = parsedPath.objectName;
+		const propertyName = parsedPath.propertyName;
+		let propertyIndex = parsedPath.propertyIndex;
+
+		if ( ! targetObject ) {
+
+			targetObject = PropertyBinding.findNode( this.rootNode, parsedPath.nodeName );
+
+			this.node = targetObject;
+
+		}
+
+		// set fail state so we can just 'return' on error
+		this.getValue = this._getValue_unavailable;
+		this.setValue = this._setValue_unavailable;
+
+		// ensure there is a value node
+		if ( ! targetObject ) {
+
+			warn( 'PropertyBinding: No target node found for track: ' + this.path + '.' );
+			return;
+
+		}
+
+		if ( objectName ) {
+
+			let objectIndex = parsedPath.objectIndex;
+
+			// special cases were we need to reach deeper into the hierarchy to get the face materials....
+			switch ( objectName ) {
+
+				case 'materials':
+
+					if ( ! targetObject.material ) {
+
+						error( 'PropertyBinding: Can not bind to material as node does not have a material.', this );
+						return;
+
+					}
+
+					if ( ! targetObject.material.materials ) {
+
+						error( 'PropertyBinding: Can not bind to material.materials as node.material does not have a materials array.', this );
+						return;
+
+					}
+
+					targetObject = targetObject.material.materials;
+
+					break;
+
+				case 'bones':
+
+					if ( ! targetObject.skeleton ) {
+
+						error( 'PropertyBinding: Can not bind to bones as node does not have a skeleton.', this );
+						return;
+
+					}
+
+					// potential future optimization: skip this if propertyIndex is already an integer
+					// and convert the integer string to a true integer.
+
+					targetObject = targetObject.skeleton.bones;
+
+					// support resolving morphTarget names into indices.
+					for ( let i = 0; i < targetObject.length; i ++ ) {
+
+						if ( targetObject[ i ].name === objectIndex ) {
+
+							objectIndex = i;
+							break;
+
+						}
+
+					}
+
+					break;
+
+				case 'map':
+
+					if ( 'map' in targetObject ) {
+
+						targetObject = targetObject.map;
+						break;
+
+					}
+
+					if ( ! targetObject.material ) {
+
+						error( 'PropertyBinding: Can not bind to material as node does not have a material.', this );
+						return;
+
+					}
+
+					if ( ! targetObject.material.map ) {
+
+						error( 'PropertyBinding: Can not bind to material.map as node.material does not have a map.', this );
+						return;
+
+					}
+
+					targetObject = targetObject.material.map;
+					break;
+
+				default:
+
+					if ( targetObject[ objectName ] === undefined ) {
+
+						error( 'PropertyBinding: Can not bind to objectName of node undefined.', this );
+						return;
+
+					}
+
+					targetObject = targetObject[ objectName ];
+
+			}
+
+
+			if ( objectIndex !== undefined ) {
+
+				if ( targetObject[ objectIndex ] === undefined ) {
+
+					error( 'PropertyBinding: Trying to bind to objectIndex of objectName, but is undefined.', this, targetObject );
+					return;
+
+				}
+
+				targetObject = targetObject[ objectIndex ];
+
+			}
+
+		}
+
+		// resolve property
+		const nodeProperty = targetObject[ propertyName ];
+
+		if ( nodeProperty === undefined ) {
+
+			const nodeName = parsedPath.nodeName;
+
+			error( 'PropertyBinding: Trying to update property for track: ' + nodeName +
+				'.' + propertyName + ' but it wasn\'t found.', targetObject );
+			return;
+
+		}
+
+		// determine versioning scheme
+		let versioning = this.Versioning.None;
+
+		this.targetObject = targetObject;
+
+		if ( targetObject.isMaterial === true ) {
+
+			versioning = this.Versioning.NeedsUpdate;
+
+		} else if ( targetObject.isObject3D === true ) {
+
+			versioning = this.Versioning.MatrixWorldNeedsUpdate;
+
+		}
+
+		// determine how the property gets bound
+		let bindingType = this.BindingType.Direct;
+
+		if ( propertyIndex !== undefined ) {
+
+			// access a sub element of the property array (only primitives are supported right now)
+
+			if ( propertyName === 'morphTargetInfluences' ) {
+
+				// potential optimization, skip this if propertyIndex is already an integer, and convert the integer string to a true integer.
+
+				// support resolving morphTarget names into indices.
+				if ( ! targetObject.geometry ) {
+
+					error( 'PropertyBinding: Can not bind to morphTargetInfluences because node does not have a geometry.', this );
+					return;
+
+				}
+
+				if ( ! targetObject.geometry.morphAttributes ) {
+
+					error( 'PropertyBinding: Can not bind to morphTargetInfluences because node does not have a geometry.morphAttributes.', this );
+					return;
+
+				}
+
+				if ( targetObject.morphTargetDictionary[ propertyIndex ] !== undefined ) {
+
+					propertyIndex = targetObject.morphTargetDictionary[ propertyIndex ];
+
+				}
+
+			}
+
+			bindingType = this.BindingType.ArrayElement;
+
+			this.resolvedProperty = nodeProperty;
+			this.propertyIndex = propertyIndex;
+
+		} else if ( nodeProperty.fromArray !== undefined && nodeProperty.toArray !== undefined ) {
+
+			// must use copy for Object3D.Euler/Quaternion
+
+			bindingType = this.BindingType.HasFromToArray;
+
+			this.resolvedProperty = nodeProperty;
+
+		} else if ( Array.isArray( nodeProperty ) ) {
+
+			bindingType = this.BindingType.EntireArray;
+
+			this.resolvedProperty = nodeProperty;
+
+		} else {
+
+			this.propertyName = propertyName;
+
+		}
+
+		// select getter / setter
+		this.getValue = this.GetterByBindingType[ bindingType ];
+		this.setValue = this.SetterByBindingTypeAndVersioning[ bindingType ][ versioning ];
+
+	}
+
+	/**
+	 * Unbinds the property.
+	 */
+	unbind() {
+
+		this.node = null;
+
+		// back to the prototype version of getValue / setValue
+		// note: avoiding to mutate the shape of 'this' via 'delete'
+		this.getValue = this._getValue_unbound;
+		this.setValue = this._setValue_unbound;
+
+	}
+
+}
+
+PropertyBinding.Composite = Composite;
+
+PropertyBinding.prototype.BindingType = {
+	Direct: 0,
+	EntireArray: 1,
+	ArrayElement: 2,
+	HasFromToArray: 3
+};
+
+PropertyBinding.prototype.Versioning = {
+	None: 0,
+	NeedsUpdate: 1,
+	MatrixWorldNeedsUpdate: 2
+};
+
+PropertyBinding.prototype.GetterByBindingType = [
+
+	PropertyBinding.prototype._getValue_direct,
+	PropertyBinding.prototype._getValue_array,
+	PropertyBinding.prototype._getValue_arrayElement,
+	PropertyBinding.prototype._getValue_toArray,
+
+];
+
+PropertyBinding.prototype.SetterByBindingTypeAndVersioning = [
+
+	[
+		// Direct
+		PropertyBinding.prototype._setValue_direct,
+		PropertyBinding.prototype._setValue_direct_setNeedsUpdate,
+		PropertyBinding.prototype._setValue_direct_setMatrixWorldNeedsUpdate,
+
+	], [
+
+		// EntireArray
+
+		PropertyBinding.prototype._setValue_array,
+		PropertyBinding.prototype._setValue_array_setNeedsUpdate,
+		PropertyBinding.prototype._setValue_array_setMatrixWorldNeedsUpdate,
+
+	], [
+
+		// ArrayElement
+		PropertyBinding.prototype._setValue_arrayElement,
+		PropertyBinding.prototype._setValue_arrayElement_setNeedsUpdate,
+		PropertyBinding.prototype._setValue_arrayElement_setMatrixWorldNeedsUpdate,
+
+	], [
+
+		// HasToFromArray
+		PropertyBinding.prototype._setValue_fromArray,
+		PropertyBinding.prototype._setValue_fromArray_setNeedsUpdate,
+		PropertyBinding.prototype._setValue_fromArray_setMatrixWorldNeedsUpdate,
+
+	]
+
+];
+
+/**
+ * A group of objects that receives a shared animation state.
+ *
+ * Usage:
+ *
+ * - Add objects you would otherwise pass as 'root' to the
+ * constructor or the .clipAction method of AnimationMixer.
+ * - Instead pass this object as 'root'.
+ * - You can also add and remove objects later when the mixer is running.
+ *
+ * Note:
+ *
+ * - Objects of this class appear as one object to the mixer,
+ * so cache control of the individual objects must be done on the group.
+ *
+ * Limitation:
+ *
+ * - The animated properties must be compatible among the all objects in the group.
+ * - A single property can either be controlled through a target group or directly, but not both.
+ */
+class AnimationObjectGroup {
+
+	/**
+	 * Constructs a new animation group.
+	 *
+	 * @param {...Object3D} arguments - An arbitrary number of 3D objects that share the same animation state.
+	 */
+	constructor() {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isAnimationObjectGroup = true;
+
+		/**
+		 * The UUID of the 3D object.
+		 *
+		 * @type {string}
+		 * @readonly
+		 */
+		this.uuid = generateUUID();
+
+		// cached objects followed by the active ones
+		this._objects = Array.prototype.slice.call( arguments );
+
+		this.nCachedObjects_ = 0; // threshold
+		// note: read by PropertyBinding.Composite
+
+		const indices = {};
+		this._indicesByUUID = indices; // for bookkeeping
+
+		for ( let i = 0, n = arguments.length; i !== n; ++ i ) {
+
+			indices[ arguments[ i ].uuid ] = i;
+
+		}
+
+		this._paths = []; // inside: string
+		this._parsedPaths = []; // inside: { we don't care, here }
+		this._bindings = []; // inside: Array< PropertyBinding >
+		this._bindingsIndicesByPath = {}; // inside: indices in these arrays
+
+		const scope = this;
+
+		this.stats = {
+
+			objects: {
+				get total() {
+
+					return scope._objects.length;
+
+				},
+				get inUse() {
+
+					return this.total - scope.nCachedObjects_;
+
+				}
+			},
+			get bindingsPerObject() {
+
+				return scope._bindings.length;
+
+			}
+
+		};
+
+	}
+
+	/**
+	 * Adds an arbitrary number of objects to this animation group.
+	 *
+	 * @param {...Object3D} arguments - The 3D objects to add.
+	 */
+	add() {
+
+		const objects = this._objects,
+			indicesByUUID = this._indicesByUUID,
+			paths = this._paths,
+			parsedPaths = this._parsedPaths,
+			bindings = this._bindings,
+			nBindings = bindings.length;
+
+		let knownObject = undefined,
+			nObjects = objects.length,
+			nCachedObjects = this.nCachedObjects_;
+
+		for ( let i = 0, n = arguments.length; i !== n; ++ i ) {
+
+			const object = arguments[ i ],
+				uuid = object.uuid;
+			let index = indicesByUUID[ uuid ];
+
+			if ( index === undefined ) {
+
+				// unknown object -> add it to the ACTIVE region
+
+				index = nObjects ++;
+				indicesByUUID[ uuid ] = index;
+				objects.push( object );
+
+				// accounting is done, now do the same for all bindings
+
+				for ( let j = 0, m = nBindings; j !== m; ++ j ) {
+
+					bindings[ j ].push( new PropertyBinding( object, paths[ j ], parsedPaths[ j ] ) );
+
+				}
+
+			} else if ( index < nCachedObjects ) {
+
+				knownObject = objects[ index ];
+
+				// move existing object to the ACTIVE region
+
+				const firstActiveIndex = -- nCachedObjects,
+					lastCachedObject = objects[ firstActiveIndex ];
+
+				indicesByUUID[ lastCachedObject.uuid ] = index;
+				objects[ index ] = lastCachedObject;
+
+				indicesByUUID[ uuid ] = firstActiveIndex;
+				objects[ firstActiveIndex ] = object;
+
+				// accounting is done, now do the same for all bindings
+
+				for ( let j = 0, m = nBindings; j !== m; ++ j ) {
+
+					const bindingsForPath = bindings[ j ],
+						lastCached = bindingsForPath[ firstActiveIndex ];
+
+					let binding = bindingsForPath[ index ];
+
+					bindingsForPath[ index ] = lastCached;
+
+					if ( binding === undefined ) {
+
+						// since we do not bother to create new bindings
+						// for objects that are cached, the binding may
+						// or may not exist
+
+						binding = new PropertyBinding( object, paths[ j ], parsedPaths[ j ] );
+
+					}
+
+					bindingsForPath[ firstActiveIndex ] = binding;
+
+				}
+
+			} else if ( objects[ index ] !== knownObject ) {
+
+				error( 'AnimationObjectGroup: Different objects with the same UUID ' +
+					'detected. Clean the caches or recreate your infrastructure when reloading scenes.' );
+
+			} // else the object is already where we want it to be
+
+		} // for arguments
+
+		this.nCachedObjects_ = nCachedObjects;
+
+	}
+
+	/**
+	 * Removes an arbitrary number of objects to this animation group
+	 *
+	 * @param {...Object3D} arguments - The 3D objects to remove.
+	 */
+	remove() {
+
+		const objects = this._objects,
+			indicesByUUID = this._indicesByUUID,
+			bindings = this._bindings,
+			nBindings = bindings.length;
+
+		let nCachedObjects = this.nCachedObjects_;
+
+		for ( let i = 0, n = arguments.length; i !== n; ++ i ) {
+
+			const object = arguments[ i ],
+				uuid = object.uuid,
+				index = indicesByUUID[ uuid ];
+
+			if ( index !== undefined && index >= nCachedObjects ) {
+
+				// move existing object into the CACHED region
+
+				const lastCachedIndex = nCachedObjects ++,
+					firstActiveObject = objects[ lastCachedIndex ];
+
+				indicesByUUID[ firstActiveObject.uuid ] = index;
+				objects[ index ] = firstActiveObject;
+
+				indicesByUUID[ uuid ] = lastCachedIndex;
+				objects[ lastCachedIndex ] = object;
+
+				// accounting is done, now do the same for all bindings
+
+				for ( let j = 0, m = nBindings; j !== m; ++ j ) {
+
+					const bindingsForPath = bindings[ j ],
+						firstActive = bindingsForPath[ lastCachedIndex ],
+						binding = bindingsForPath[ index ];
+
+					bindingsForPath[ index ] = firstActive;
+					bindingsForPath[ lastCachedIndex ] = binding;
+
+				}
+
+			}
+
+		} // for arguments
+
+		this.nCachedObjects_ = nCachedObjects;
+
+	}
+
+	/**
+	 * Deallocates all memory resources for the passed 3D objects of this animation group.
+	 *
+	 * @param {...Object3D} arguments - The 3D objects to uncache.
+	 */
+	uncache() {
+
+		const objects = this._objects,
+			indicesByUUID = this._indicesByUUID,
+			bindings = this._bindings,
+			nBindings = bindings.length;
+
+		let nCachedObjects = this.nCachedObjects_,
+			nObjects = objects.length;
+
+		for ( let i = 0, n = arguments.length; i !== n; ++ i ) {
+
+			const object = arguments[ i ],
+				uuid = object.uuid,
+				index = indicesByUUID[ uuid ];
+
+			if ( index !== undefined ) {
+
+				delete indicesByUUID[ uuid ];
+
+				if ( index < nCachedObjects ) {
+
+					// object is cached, shrink the CACHED region
+
+					const firstActiveIndex = -- nCachedObjects,
+						lastCachedObject = objects[ firstActiveIndex ],
+						lastIndex = -- nObjects,
+						lastObject = objects[ lastIndex ];
+
+					if ( index !== firstActiveIndex ) {
+
+						// last cached object takes this object's place
+
+						indicesByUUID[ lastCachedObject.uuid ] = index;
+
+					}
+
+					objects[ index ] = lastCachedObject;
+
+					if ( firstActiveIndex !== lastIndex ) {
+
+						// last object goes to the activated slot and pop
+
+						indicesByUUID[ lastObject.uuid ] = firstActiveIndex;
+
+					}
+
+					objects[ firstActiveIndex ] = lastObject;
+					objects.pop();
+
+					// accounting is done, now do the same for all bindings
+
+					for ( let j = 0, m = nBindings; j !== m; ++ j ) {
+
+						const bindingsForPath = bindings[ j ],
+							lastCached = bindingsForPath[ firstActiveIndex ],
+							last = bindingsForPath[ lastIndex ];
+
+						bindingsForPath[ index ] = lastCached;
+						bindingsForPath[ firstActiveIndex ] = last;
+						bindingsForPath.pop();
+
+					}
+
+				} else {
+
+					// object is active, just swap with the last and pop
+
+					const lastIndex = -- nObjects,
+						lastObject = objects[ lastIndex ];
+
+					if ( index !== lastIndex ) {
+
+						indicesByUUID[ lastObject.uuid ] = index;
+
+					}
+
+					objects[ index ] = lastObject;
+					objects.pop();
+
+					// accounting is done, now do the same for all bindings
+
+					for ( let j = 0, m = nBindings; j !== m; ++ j ) {
+
+						const bindingsForPath = bindings[ j ];
+
+						bindingsForPath[ index ] = bindingsForPath[ lastIndex ];
+						bindingsForPath.pop();
+
+					}
+
+				} // cached or active
+
+			} // if object is known
+
+		} // for arguments
+
+		this.nCachedObjects_ = nCachedObjects;
+
+	}
+
+	// Internal interface used by befriended PropertyBinding.Composite:
+
+	subscribe_( path, parsedPath ) {
+
+		// returns an array of bindings for the given path that is changed
+		// according to the contained objects in the group
+
+		const indicesByPath = this._bindingsIndicesByPath;
+		let index = indicesByPath[ path ];
+		const bindings = this._bindings;
+
+		if ( index !== undefined ) return bindings[ index ];
+
+		const paths = this._paths,
+			parsedPaths = this._parsedPaths,
+			objects = this._objects,
+			nObjects = objects.length,
+			nCachedObjects = this.nCachedObjects_,
+			bindingsForPath = new Array( nObjects );
+
+		index = bindings.length;
+
+		indicesByPath[ path ] = index;
+
+		paths.push( path );
+		parsedPaths.push( parsedPath );
+		bindings.push( bindingsForPath );
+
+		for ( let i = nCachedObjects, n = objects.length; i !== n; ++ i ) {
+
+			const object = objects[ i ];
+			bindingsForPath[ i ] = new PropertyBinding( object, path, parsedPath );
+
+		}
+
+		return bindingsForPath;
+
+	}
+
+	unsubscribe_( path ) {
+
+		// tells the group to forget about a property path and no longer
+		// update the array previously obtained with 'subscribe_'
+
+		const indicesByPath = this._bindingsIndicesByPath,
+			index = indicesByPath[ path ];
+
+		if ( index !== undefined ) {
+
+			const paths = this._paths,
+				parsedPaths = this._parsedPaths,
+				bindings = this._bindings,
+				lastBindingsIndex = bindings.length - 1,
+				lastBindings = bindings[ lastBindingsIndex ],
+				lastBindingsPath = paths[ lastBindingsIndex ];
+
+			indicesByPath[ lastBindingsPath ] = index;
+
+			bindings[ index ] = lastBindings;
+			bindings.pop();
+
+			parsedPaths[ index ] = parsedPaths[ lastBindingsIndex ];
+			parsedPaths.pop();
+
+			paths[ index ] = paths[ lastBindingsIndex ];
+			paths.pop();
+
+		}
+
+	}
+
+}
+
+/**
+ * An instance of `AnimationAction` schedules the playback of an animation which is
+ * stored in {@link AnimationClip}.
+ */
+class AnimationAction {
+
+	/**
+	 * Constructs a new animation action.
+	 *
+	 * @param {AnimationMixer} mixer - The mixer that is controlled by this action.
+	 * @param {AnimationClip} clip - The animation clip that holds the actual keyframes.
+	 * @param {?Object3D} [localRoot=null] - The root object on which this action is performed.
+	 * @param {(NormalAnimationBlendMode|AdditiveAnimationBlendMode)} [blendMode] - The blend mode.
+	 */
+	constructor( mixer, clip, localRoot = null, blendMode = clip.blendMode ) {
+
+		this._mixer = mixer;
+		this._clip = clip;
+		this._localRoot = localRoot;
+
+		/**
+		 * Defines how the animation is blended/combined when two or more animations
+		 * are simultaneously played.
+		 *
+		 * @type {(NormalAnimationBlendMode|AdditiveAnimationBlendMode)}
+		 */
+		this.blendMode = blendMode;
+
+		const tracks = clip.tracks,
+			nTracks = tracks.length,
+			interpolants = new Array( nTracks );
+
+		const interpolantSettings = {
+			endingStart: ZeroCurvatureEnding,
+			endingEnd: ZeroCurvatureEnding
+		};
+
+		for ( let i = 0; i !== nTracks; ++ i ) {
+
+			const interpolant = tracks[ i ].createInterpolant( null );
+			interpolants[ i ] = interpolant;
+			interpolant.settings = interpolantSettings;
+
+		}
+
+		this._interpolantSettings = interpolantSettings;
+
+		this._interpolants = interpolants; // bound by the mixer
+
+		// inside: PropertyMixer (managed by the mixer)
+		this._propertyBindings = new Array( nTracks );
+
+		this._cacheIndex = null; // for the memory manager
+		this._byClipCacheIndex = null; // for the memory manager
+
+		this._timeScaleInterpolant = null;
+		this._restoreTimeScale = null;
+		this._weightInterpolant = null;
+
+		/**
+		 * The loop mode, set via {@link AnimationAction#setLoop}.
+		 *
+		 * @type {(LoopRepeat|LoopOnce|LoopPingPong)}
+		 * @default LoopRepeat
+		 */
+		this.loop = LoopRepeat;
+		this._loopCount = -1;
+
+		// global mixer time when the action is to be started
+		// it's set back to 'null' upon start of the action
+		this._startTime = null;
+
+		/**
+		 * The local time of this action (in seconds, starting with `0`).
+		 *
+		 * The value gets clamped or wrapped to `[0,clip.duration]` (according to the
+		 * loop state).
+		 *
+		 * @type {number}
+		 * @default Infinity
+		 */
+		this.time = 0;
+
+		/**
+		 * Scaling factor for the {@link AnimationAction#time}. A value of `0` causes the
+		 * animation to pause. Negative values cause the animation to play backwards.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.timeScale = 1;
+		this._effectiveTimeScale = 1;
+
+		/**
+		 * The degree of influence of this action (in the interval `[0, 1]`). Values
+		 * between `0` (no impact) and `1` (full impact) can be used to blend between
+		 * several actions.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.weight = 1;
+		this._effectiveWeight = 1;
+
+		/**
+		 * The number of repetitions of the performed clip over the course of this action.
+		 * Can be set via {@link AnimationAction#setLoop}.
+		 *
+		 * Setting this number has no effect if {@link AnimationAction#loop} is set to
+		 * `THREE:LoopOnce`.
+		 *
+		 * @type {number}
+		 * @default Infinity
+		 */
+		this.repetitions = Infinity;
+
+		/**
+		 * If set to `true`, the playback of the action is paused.
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.paused = false;
+
+		/**
+		 * If set to `false`, the action is disabled so it has no impact.
+		 *
+		 * When the action is re-enabled, the animation continues from its current
+		 * time (setting `enabled` to `false` doesn't reset the action).
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.enabled = true;
+
+		/**
+		 * If set to true the animation will automatically be paused on its last frame.
+		 *
+		 * If set to false, {@link AnimationAction#enabled} will automatically be switched
+		 * to `false` when the last loop of the action has finished, so that this action has
+		 * no further impact.
+		 *
+		 * Note: This member has no impact if the action is interrupted (it
+		 * has only an effect if its last loop has really finished).
+		 *
+		 * @type {boolean}
+		 * @default false
+		 */
+		this.clampWhenFinished = false;
+
+		/**
+		 * Enables smooth interpolation without separate clips for start, loop and end.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.zeroSlopeAtStart = true;
+
+		/**
+		 * Enables smooth interpolation without separate clips for start, loop and end.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.zeroSlopeAtEnd = true;
+
+	}
+
+	/**
+	 * Starts the playback of the animation.
+	 *
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	play() {
+
+		this._mixer._activateAction( this );
+
+		return this;
+
+	}
+
+	/**
+	 * Stops the playback of the animation.
+	 *
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	stop() {
+
+		this._mixer._deactivateAction( this );
+
+		return this.reset();
+
+	}
+
+	/**
+	 * Resets the playback of the animation.
+	 *
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	reset() {
+
+		this.paused = false;
+		this.enabled = true;
+
+		this.time = 0; // restart clip
+		this._loopCount = -1;// forget previous loops
+		this._startTime = null;// forget scheduling
+
+		return this.stopFading().stopWarping();
+
+	}
+
+	/**
+	 * Returns `true` if the animation is running.
+	 *
+	 * @return {boolean} Whether the animation is running or not.
+	 */
+	isRunning() {
+
+		return this.enabled && ! this.paused && this.timeScale !== 0 &&
+			this._startTime === null && this._mixer._isActiveAction( this );
+
+	}
+
+	/**
+	 * Returns `true` when {@link AnimationAction#play} has been called.
+	 *
+	 * @return {boolean} Whether the animation is scheduled or not.
+	 */
+	isScheduled() {
+
+		return this._mixer._isActiveAction( this );
+
+	}
+
+	/**
+	 * Defines the time when the animation should start.
+	 *
+	 * @param {number} time - The start time in seconds.
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	startAt( time ) {
+
+		this._startTime = time;
+
+		return this;
+
+	}
+
+	/**
+	 * Configures the loop settings for this action.
+	 *
+	 * @param {(LoopRepeat|LoopOnce|LoopPingPong)} mode - The loop mode.
+	 * @param {number} repetitions - The number of repetitions.
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	setLoop( mode, repetitions ) {
+
+		this.loop = mode;
+		this.repetitions = repetitions;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the effective weight of this action.
+	 *
+	 * An action has no effect and thus an effective weight of zero when the
+	 * action is disabled.
+	 *
+	 * @param {number} weight - The weight to set.
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	setEffectiveWeight( weight ) {
+
+		this.weight = weight;
+
+		// note: same logic as when updated at runtime
+		this._effectiveWeight = this.enabled ? weight : 0;
+
+		return this.stopFading();
+
+	}
+
+	/**
+	 * Returns the effective weight of this action.
+	 *
+	 * @return {number} The effective weight.
+	 */
+	getEffectiveWeight() {
+
+		return this._effectiveWeight;
+
+	}
+
+	/**
+	 * Fades the animation in by increasing its weight gradually from `0` to `1`,
+	 * within the passed time interval.
+	 *
+	 * @param {number} duration - The duration of the fade.
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	fadeIn( duration ) {
+
+		return this._scheduleFading( duration, 0, 1 );
+
+	}
+
+	/**
+	 * Fades the animation out by decreasing its weight gradually from `1` to `0`,
+	 * within the passed time interval.
+	 *
+	 * @param {number} duration - The duration of the fade.
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	fadeOut( duration ) {
+
+		return this._scheduleFading( duration, 1, 0 );
+
+	}
+
+	/**
+	 * Causes this action to fade in and the given action to fade out,
+	 * within the passed time interval.
+	 *
+	 * @param {AnimationAction} fadeOutAction - The animation action to fade out.
+	 * @param {number} duration - The duration of the fade.
+	 * @param {boolean} [warp=false] - Whether warping should be used or not.
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	crossFadeFrom( fadeOutAction, duration, warp = false ) {
+
+		fadeOutAction.fadeOut( duration );
+		this.fadeIn( duration );
+
+		if ( warp === true ) {
+
+			const fadeInDuration = this._clip.duration,
+				fadeOutDuration = fadeOutAction._clip.duration,
+
+				startEndRatio = fadeOutDuration / fadeInDuration,
+				endStartRatio = fadeInDuration / fadeOutDuration;
+
+
+			fadeOutAction._restoreTimeScale = fadeOutAction.timeScale;
+			this._restoreTimeScale = this.timeScale;
+
+			fadeOutAction.warp( 1.0, startEndRatio, duration );
+			this.warp( endStartRatio, 1.0, duration );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Causes this action to fade out and the given action to fade in,
+	 * within the passed time interval.
+	 *
+	 * @param {AnimationAction} fadeInAction - The animation action to fade in.
+	 * @param {number} duration - The duration of the fade.
+	 * @param {boolean} [warp=false] - Whether warping should be used or not.
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	crossFadeTo( fadeInAction, duration, warp = false ) {
+
+		return fadeInAction.crossFadeFrom( this, duration, warp );
+
+	}
+
+	/**
+	 * Stops any fading which is applied to this action.
+	 *
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	stopFading() {
+
+		const weightInterpolant = this._weightInterpolant;
+
+		if ( weightInterpolant !== null ) {
+
+			this._weightInterpolant = null;
+			this._mixer._takeBackControlInterpolant( weightInterpolant );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the effective time scale of this action.
+	 *
+	 * An action has no effect and thus an effective time scale of zero when the
+	 * action is paused.
+	 *
+	 * @param {number} timeScale - The time scale to set.
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	setEffectiveTimeScale( timeScale ) {
+
+		this.timeScale = timeScale;
+		this._effectiveTimeScale = this.paused ? 0 : timeScale;
+
+		return this.stopWarping();
+
+	}
+
+	/**
+	 * Returns the effective time scale of this action.
+	 *
+	 * @return {number} The effective time scale.
+	 */
+	getEffectiveTimeScale() {
+
+		return this._effectiveTimeScale;
+
+	}
+
+	/**
+	 * Sets the duration for a single loop of this action.
+	 *
+	 * @param {number} duration - The duration to set.
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	setDuration( duration ) {
+
+		this.timeScale = this._clip.duration / duration;
+
+		return this.stopWarping();
+
+	}
+
+	/**
+	 * Synchronizes this action with the passed other action.
+	 *
+	 * @param {AnimationAction} action - The action to sync with.
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	syncWith( action ) {
+
+		this.time = action.time;
+		this.timeScale = action.timeScale;
+
+		return this.stopWarping();
+
+	}
+
+	/**
+	 * Decelerates this animation's speed to `0` within the passed time interval.
+	 *
+	 * @param {number} duration - The duration.
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	halt( duration ) {
+
+		return this.warp( this._effectiveTimeScale, 0, duration );
+
+	}
+
+	/**
+	 * Changes the playback speed, within the passed time interval, by modifying
+	 * {@link AnimationAction#timeScale} gradually from `startTimeScale` to
+	 * `endTimeScale`.
+	 *
+	 * @param {number} startTimeScale - The start time scale.
+	 * @param {number} endTimeScale - The end time scale.
+	 * @param {number} duration - The duration.
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	warp( startTimeScale, endTimeScale, duration ) {
+
+		const mixer = this._mixer,
+			now = mixer.time,
+			timeScale = this.timeScale;
+
+		let interpolant = this._timeScaleInterpolant;
+
+		if ( interpolant === null ) {
+
+			interpolant = mixer._lendControlInterpolant();
+			this._timeScaleInterpolant = interpolant;
+
+		}
+
+		const times = interpolant.parameterPositions,
+			values = interpolant.sampleValues;
+
+		times[ 0 ] = now;
+		times[ 1 ] = now + duration;
+
+		values[ 0 ] = startTimeScale / timeScale;
+		values[ 1 ] = endTimeScale / timeScale;
+
+		return this;
+
+	}
+
+	/**
+	 * Stops any scheduled warping which is applied to this action.
+	 *
+	 * @return {AnimationAction} A reference to this animation action.
+	 */
+	stopWarping() {
+
+		const timeScaleInterpolant = this._timeScaleInterpolant;
+
+		if ( timeScaleInterpolant !== null ) {
+
+			this._timeScaleInterpolant = null;
+			this._mixer._takeBackControlInterpolant( timeScaleInterpolant );
+
+		}
+
+		this._restoreTimeScale = null;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the animation mixer of this animation action.
+	 *
+	 * @return {AnimationMixer} The animation mixer.
+	 */
+	getMixer() {
+
+		return this._mixer;
+
+	}
+
+	/**
+	 * Returns the animation clip of this animation action.
+	 *
+	 * @return {AnimationClip} The animation clip.
+	 */
+	getClip() {
+
+		return this._clip;
+
+	}
+
+	/**
+	 * Returns the root object of this animation action.
+	 *
+	 * @return {Object3D} The root object.
+	 */
+	getRoot() {
+
+		return this._localRoot || this._mixer._root;
+
+	}
+
+	// Internal
+
+	_update( time, deltaTime, timeDirection, accuIndex ) {
+
+		// called by the mixer
+
+		if ( ! this.enabled ) {
+
+			// call ._updateWeight() to update ._effectiveWeight
+
+			this._updateWeight( time );
+			return;
+
+		}
+
+		const startTime = this._startTime;
+
+		if ( startTime !== null ) {
+
+			// check for scheduled start of action
+
+			const timeRunning = ( time - startTime ) * timeDirection;
+			if ( timeRunning < 0 || timeDirection === 0 ) {
+
+				deltaTime = 0;
+
+			} else {
+
+
+				this._startTime = null; // unschedule
+				deltaTime = timeDirection * timeRunning;
+
+			}
+
+		}
+
+		// apply time scale and advance time
+
+		deltaTime *= this._updateTimeScale( time );
+		const clipTime = this._updateTime( deltaTime );
+
+		// note: _updateTime may disable the action resulting in
+		// an effective weight of 0
+
+		const weight = this._updateWeight( time );
+
+		if ( weight > 0 ) {
+
+			const interpolants = this._interpolants;
+			const propertyMixers = this._propertyBindings;
+
+			switch ( this.blendMode ) {
+
+				case AdditiveAnimationBlendMode:
+
+					for ( let j = 0, m = interpolants.length; j !== m; ++ j ) {
+
+						interpolants[ j ].evaluate( clipTime );
+						propertyMixers[ j ].accumulateAdditive( weight );
+
+					}
+
+					break;
+
+				case NormalAnimationBlendMode:
+				default:
+
+					for ( let j = 0, m = interpolants.length; j !== m; ++ j ) {
+
+						interpolants[ j ].evaluate( clipTime );
+						propertyMixers[ j ].accumulate( accuIndex, weight );
+
+					}
+
+			}
+
+		}
+
+	}
+
+	_updateWeight( time ) {
+
+		let weight = 0;
+
+		if ( this.enabled ) {
+
+			weight = this.weight;
+			const interpolant = this._weightInterpolant;
+
+			if ( interpolant !== null ) {
+
+				const interpolantValue = interpolant.evaluate( time )[ 0 ];
+
+				weight *= interpolantValue;
+
+				if ( time > interpolant.parameterPositions[ 1 ] ) {
+
+					this.stopFading();
+
+					if ( interpolantValue === 0 ) {
+
+						// faded out, disable
+						this.enabled = false;
+
+					}
+
+				}
+
+			}
+
+		}
+
+		this._effectiveWeight = weight;
+		return weight;
+
+	}
+
+	_updateTimeScale( time ) {
+
+		let timeScale = 0;
+
+		if ( ! this.paused ) {
+
+			timeScale = this.timeScale;
+
+			const interpolant = this._timeScaleInterpolant;
+
+			if ( interpolant !== null ) {
+
+				const interpolantValue = interpolant.evaluate( time )[ 0 ];
+
+				timeScale *= interpolantValue;
+
+				if ( time > interpolant.parameterPositions[ 1 ] ) {
+
+					if ( timeScale === 0 ) {
+
+						// motion has halted, pause
+						this.paused = true;
+
+					} else {
+
+						if ( this._restoreTimeScale !== null ) {
+
+							timeScale = this._restoreTimeScale;
+
+						}
+
+						// warp done - apply final time scale
+						this.timeScale = timeScale;
+
+					}
+
+					this.stopWarping();
+
+				}
+
+			}
+
+		}
+
+		this._effectiveTimeScale = timeScale;
+		return timeScale;
+
+	}
+
+	_updateTime( deltaTime ) {
+
+		const duration = this._clip.duration;
+		const loop = this.loop;
+
+		let time = this.time + deltaTime;
+		let loopCount = this._loopCount;
+
+		const pingPong = ( loop === LoopPingPong );
+
+		if ( deltaTime === 0 ) {
+
+			if ( loopCount === -1 ) return time;
+
+			return ( pingPong && ( loopCount & 1 ) === 1 ) ? duration - time : time;
+
+		}
+
+		if ( loop === LoopOnce ) {
+
+			if ( loopCount === -1 ) {
+
+				// just started
+
+				this._loopCount = 0;
+				this._setEndings( true, true, false );
+
+			}
+
+			handle_stop: {
+
+				if ( time >= duration ) {
+
+					time = duration;
+
+				} else if ( time < 0 ) {
+
+					time = 0;
+
+				} else {
+
+					this.time = time;
+
+					break handle_stop;
+
+				}
+
+				if ( this.clampWhenFinished ) this.paused = true;
+				else this.enabled = false;
+
+				this.time = time;
+
+				this._mixer.dispatchEvent( {
+					type: 'finished', action: this,
+					direction: deltaTime < 0 ? -1 : 1
+				} );
+
+			}
+
+		} else { // repetitive Repeat or PingPong
+
+			if ( loopCount === -1 ) {
+
+				// just started
+
+				if ( deltaTime >= 0 ) {
+
+					loopCount = 0;
+
+					this._setEndings( true, this.repetitions === 0, pingPong );
+
+				} else {
+
+					// when looping in reverse direction, the initial
+					// transition through zero counts as a repetition,
+					// so leave loopCount at -1
+
+					this._setEndings( this.repetitions === 0, true, pingPong );
+
+				}
+
+			}
+
+			if ( time >= duration || time < 0 ) {
+
+				// wrap around
+
+				const loopDelta = Math.floor( time / duration ); // signed
+				time -= duration * loopDelta;
+
+				loopCount += Math.abs( loopDelta );
+
+				const pending = this.repetitions - loopCount;
+
+				if ( pending <= 0 ) {
+
+					// have to stop (switch state, clamp time, fire event)
+
+					if ( this.clampWhenFinished ) this.paused = true;
+					else this.enabled = false;
+
+					time = deltaTime > 0 ? duration : 0;
+
+					this.time = time;
+
+					this._mixer.dispatchEvent( {
+						type: 'finished', action: this,
+						direction: deltaTime > 0 ? 1 : -1
+					} );
+
+				} else {
+
+					// keep running
+
+					if ( pending === 1 ) {
+
+						// entering the last round
+
+						const atStart = deltaTime < 0;
+						this._setEndings( atStart, ! atStart, pingPong );
+
+					} else {
+
+						this._setEndings( false, false, pingPong );
+
+					}
+
+					this._loopCount = loopCount;
+
+					this.time = time;
+
+					this._mixer.dispatchEvent( {
+						type: 'loop', action: this, loopDelta: loopDelta
+					} );
+
+				}
+
+			} else {
+
+				this._loopCount = loopCount;
+				this.time = time;
+
+			}
+
+			if ( pingPong && ( loopCount & 1 ) === 1 ) {
+
+				// invert time for the "pong round"
+
+				return duration - time;
+
+			}
+
+		}
+
+		return time;
+
+	}
+
+	_setEndings( atStart, atEnd, pingPong ) {
+
+		const settings = this._interpolantSettings;
+
+		if ( pingPong ) {
+
+			settings.endingStart = ZeroSlopeEnding;
+			settings.endingEnd = ZeroSlopeEnding;
+
+		} else {
+
+			// assuming for LoopOnce atStart == atEnd == true
+
+			if ( atStart ) {
+
+				settings.endingStart = this.zeroSlopeAtStart ? ZeroSlopeEnding : ZeroCurvatureEnding;
+
+			} else {
+
+				settings.endingStart = WrapAroundEnding;
+
+			}
+
+			if ( atEnd ) {
+
+				settings.endingEnd = this.zeroSlopeAtEnd ? ZeroSlopeEnding : ZeroCurvatureEnding;
+
+			} else {
+
+				settings.endingEnd = WrapAroundEnding;
+
+			}
+
+		}
+
+	}
+
+	_scheduleFading( duration, weightNow, weightThen ) {
+
+		const mixer = this._mixer, now = mixer.time;
+		let interpolant = this._weightInterpolant;
+
+		if ( interpolant === null ) {
+
+			interpolant = mixer._lendControlInterpolant();
+			this._weightInterpolant = interpolant;
+
+		}
+
+		const times = interpolant.parameterPositions,
+			values = interpolant.sampleValues;
+
+		times[ 0 ] = now;
+		values[ 0 ] = weightNow;
+		times[ 1 ] = now + duration;
+		values[ 1 ] = weightThen;
+
+		return this;
+
+	}
+
+}
+
+const _controlInterpolantsResultBuffer = new Float32Array( 1 );
+
+/**
+ * `AnimationMixer` is a player for animations on a particular object in
+ * the scene. When multiple objects in the scene are animated independently,
+ * one `AnimationMixer` may be used for each object.
+ */
+class AnimationMixer extends EventDispatcher {
+
+	/**
+	 * Constructs a new animation mixer.
+	 *
+	 * @param {Object3D} root - The object whose animations shall be played by this mixer.
+	 */
+	constructor( root ) {
+
+		super();
+
+		this._root = root;
+		this._initMemoryManager();
+		this._accuIndex = 0;
+
+		/**
+		 * The global mixer time (in seconds; starting with `0` on the mixer's creation).
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.time = 0;
+
+		/**
+		 * A scaling factor for the global time.
+		 *
+		 * Note: Setting this member to `0` and later back to `1` is a
+		 * possibility to pause/unpause all actions that are controlled by this
+		 * mixer.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.timeScale = 1.0;
+
+		if ( typeof __THREE_DEVTOOLS__ !== 'undefined' ) {
+
+			__THREE_DEVTOOLS__.dispatchEvent( new CustomEvent( 'observe', { detail: this } ) );
+
+		}
+
+	}
+
+	_bindAction( action, prototypeAction ) {
+
+		const root = action._localRoot || this._root,
+			tracks = action._clip.tracks,
+			nTracks = tracks.length,
+			bindings = action._propertyBindings,
+			interpolants = action._interpolants,
+			rootUuid = root.uuid,
+			bindingsByRoot = this._bindingsByRootAndName;
+
+		let bindingsByName = bindingsByRoot[ rootUuid ];
+
+		if ( bindingsByName === undefined ) {
+
+			bindingsByName = {};
+			bindingsByRoot[ rootUuid ] = bindingsByName;
+
+		}
+
+		for ( let i = 0; i !== nTracks; ++ i ) {
+
+			const track = tracks[ i ],
+				trackName = track.name;
+
+			let binding = bindingsByName[ trackName ];
+
+			if ( binding !== undefined ) {
+
+				++ binding.referenceCount;
+				bindings[ i ] = binding;
+
+			} else {
+
+				binding = bindings[ i ];
+
+				if ( binding !== undefined ) {
+
+					// existing binding, make sure the cache knows
+
+					if ( binding._cacheIndex === null ) {
+
+						++ binding.referenceCount;
+						this._addInactiveBinding( binding, rootUuid, trackName );
+
+					}
+
+					continue;
+
+				}
+
+				const path = prototypeAction && prototypeAction.
+					_propertyBindings[ i ].binding.parsedPath;
+
+				binding = new PropertyMixer(
+					PropertyBinding.create( root, trackName, path ),
+					track.ValueTypeName, track.getValueSize() );
+
+				++ binding.referenceCount;
+				this._addInactiveBinding( binding, rootUuid, trackName );
+
+				bindings[ i ] = binding;
+
+			}
+
+			interpolants[ i ].resultBuffer = binding.buffer;
+
+		}
+
+	}
+
+	_activateAction( action ) {
+
+		if ( ! this._isActiveAction( action ) ) {
+
+			if ( action._cacheIndex === null ) {
+
+				// this action has been forgotten by the cache, but the user
+				// appears to be still using it -> rebind
+
+				const rootUuid = ( action._localRoot || this._root ).uuid,
+					clipUuid = action._clip.uuid,
+					actionsForClip = this._actionsByClip[ clipUuid ];
+
+				this._bindAction( action,
+					actionsForClip && actionsForClip.knownActions[ 0 ] );
+
+				this._addInactiveAction( action, clipUuid, rootUuid );
+
+			}
+
+			const bindings = action._propertyBindings;
+
+			// increment reference counts / sort out state
+			for ( let i = 0, n = bindings.length; i !== n; ++ i ) {
+
+				const binding = bindings[ i ];
+
+				if ( binding.useCount ++ === 0 ) {
+
+					this._lendBinding( binding );
+					binding.saveOriginalState();
+
+				}
+
+			}
+
+			this._lendAction( action );
+
+		}
+
+	}
+
+	_deactivateAction( action ) {
+
+		if ( this._isActiveAction( action ) ) {
+
+			const bindings = action._propertyBindings;
+
+			// decrement reference counts / sort out state
+			for ( let i = 0, n = bindings.length; i !== n; ++ i ) {
+
+				const binding = bindings[ i ];
+
+				if ( -- binding.useCount === 0 ) {
+
+					binding.restoreOriginalState();
+					this._takeBackBinding( binding );
+
+				}
+
+			}
+
+			this._takeBackAction( action );
+
+		}
+
+	}
+
+	// Memory manager
+
+	_initMemoryManager() {
+
+		this._actions = []; // 'nActiveActions' followed by inactive ones
+		this._nActiveActions = 0;
+
+		this._actionsByClip = {};
+		// inside:
+		// {
+		// 	knownActions: Array< AnimationAction > - used as prototypes
+		// 	actionByRoot: AnimationAction - lookup
+		// }
+
+
+		this._bindings = []; // 'nActiveBindings' followed by inactive ones
+		this._nActiveBindings = 0;
+
+		this._bindingsByRootAndName = {}; // inside: Map< name, PropertyMixer >
+
+
+		this._controlInterpolants = []; // same game as above
+		this._nActiveControlInterpolants = 0;
+
+		const scope = this;
+
+		this.stats = {
+
+			actions: {
+				get total() {
+
+					return scope._actions.length;
+
+				},
+				get inUse() {
+
+					return scope._nActiveActions;
+
+				}
+			},
+			bindings: {
+				get total() {
+
+					return scope._bindings.length;
+
+				},
+				get inUse() {
+
+					return scope._nActiveBindings;
+
+				}
+			},
+			controlInterpolants: {
+				get total() {
+
+					return scope._controlInterpolants.length;
+
+				},
+				get inUse() {
+
+					return scope._nActiveControlInterpolants;
+
+				}
+			}
+
+		};
+
+	}
+
+	// Memory management for AnimationAction objects
+
+	_isActiveAction( action ) {
+
+		const index = action._cacheIndex;
+		return index !== null && index < this._nActiveActions;
+
+	}
+
+	_addInactiveAction( action, clipUuid, rootUuid ) {
+
+		const actions = this._actions,
+			actionsByClip = this._actionsByClip;
+
+		let actionsForClip = actionsByClip[ clipUuid ];
+
+		if ( actionsForClip === undefined ) {
+
+			actionsForClip = {
+
+				knownActions: [ action ],
+				actionByRoot: {}
+
+			};
+
+			action._byClipCacheIndex = 0;
+
+			actionsByClip[ clipUuid ] = actionsForClip;
+
+		} else {
+
+			const knownActions = actionsForClip.knownActions;
+
+			action._byClipCacheIndex = knownActions.length;
+			knownActions.push( action );
+
+		}
+
+		action._cacheIndex = actions.length;
+		actions.push( action );
+
+		actionsForClip.actionByRoot[ rootUuid ] = action;
+
+	}
+
+	_removeInactiveAction( action ) {
+
+		const actions = this._actions,
+			lastInactiveAction = actions[ actions.length - 1 ],
+			cacheIndex = action._cacheIndex;
+
+		lastInactiveAction._cacheIndex = cacheIndex;
+		actions[ cacheIndex ] = lastInactiveAction;
+		actions.pop();
+
+		action._cacheIndex = null;
+
+
+		const clipUuid = action._clip.uuid,
+			actionsByClip = this._actionsByClip,
+			actionsForClip = actionsByClip[ clipUuid ],
+			knownActionsForClip = actionsForClip.knownActions,
+
+			lastKnownAction =
+				knownActionsForClip[ knownActionsForClip.length - 1 ],
+
+			byClipCacheIndex = action._byClipCacheIndex;
+
+		lastKnownAction._byClipCacheIndex = byClipCacheIndex;
+		knownActionsForClip[ byClipCacheIndex ] = lastKnownAction;
+		knownActionsForClip.pop();
+
+		action._byClipCacheIndex = null;
+
+
+		const actionByRoot = actionsForClip.actionByRoot,
+			rootUuid = ( action._localRoot || this._root ).uuid;
+
+		delete actionByRoot[ rootUuid ];
+
+		if ( knownActionsForClip.length === 0 ) {
+
+			delete actionsByClip[ clipUuid ];
+
+		}
+
+		this._removeInactiveBindingsForAction( action );
+
+	}
+
+	_removeInactiveBindingsForAction( action ) {
+
+		const bindings = action._propertyBindings;
+
+		for ( let i = 0, n = bindings.length; i !== n; ++ i ) {
+
+			const binding = bindings[ i ];
+
+			if ( -- binding.referenceCount === 0 ) {
+
+				this._removeInactiveBinding( binding );
+
+			}
+
+		}
+
+	}
+
+	_lendAction( action ) {
+
+		// [ active actions |  inactive actions  ]
+		// [  active actions >| inactive actions ]
+		//                 s        a
+		//                  <-swap->
+		//                 a        s
+
+		const actions = this._actions,
+			prevIndex = action._cacheIndex,
+
+			lastActiveIndex = this._nActiveActions ++,
+
+			firstInactiveAction = actions[ lastActiveIndex ];
+
+		action._cacheIndex = lastActiveIndex;
+		actions[ lastActiveIndex ] = action;
+
+		firstInactiveAction._cacheIndex = prevIndex;
+		actions[ prevIndex ] = firstInactiveAction;
+
+	}
+
+	_takeBackAction( action ) {
+
+		// [  active actions  | inactive actions ]
+		// [ active actions |< inactive actions  ]
+		//        a        s
+		//         <-swap->
+		//        s        a
+
+		const actions = this._actions,
+			prevIndex = action._cacheIndex,
+
+			firstInactiveIndex = -- this._nActiveActions,
+
+			lastActiveAction = actions[ firstInactiveIndex ];
+
+		action._cacheIndex = firstInactiveIndex;
+		actions[ firstInactiveIndex ] = action;
+
+		lastActiveAction._cacheIndex = prevIndex;
+		actions[ prevIndex ] = lastActiveAction;
+
+	}
+
+	// Memory management for PropertyMixer objects
+
+	_addInactiveBinding( binding, rootUuid, trackName ) {
+
+		const bindingsByRoot = this._bindingsByRootAndName,
+			bindings = this._bindings;
+
+		let bindingByName = bindingsByRoot[ rootUuid ];
+
+		if ( bindingByName === undefined ) {
+
+			bindingByName = {};
+			bindingsByRoot[ rootUuid ] = bindingByName;
+
+		}
+
+		bindingByName[ trackName ] = binding;
+
+		binding._cacheIndex = bindings.length;
+		bindings.push( binding );
+
+	}
+
+	_removeInactiveBinding( binding ) {
+
+		const bindings = this._bindings,
+			propBinding = binding.binding,
+			rootUuid = propBinding.rootNode.uuid,
+			trackName = propBinding.path,
+			bindingsByRoot = this._bindingsByRootAndName,
+			bindingByName = bindingsByRoot[ rootUuid ],
+
+			lastInactiveBinding = bindings[ bindings.length - 1 ],
+			cacheIndex = binding._cacheIndex;
+
+		lastInactiveBinding._cacheIndex = cacheIndex;
+		bindings[ cacheIndex ] = lastInactiveBinding;
+		bindings.pop();
+
+		delete bindingByName[ trackName ];
+
+		if ( Object.keys( bindingByName ).length === 0 ) {
+
+			delete bindingsByRoot[ rootUuid ];
+
+		}
+
+	}
+
+	_lendBinding( binding ) {
+
+		const bindings = this._bindings,
+			prevIndex = binding._cacheIndex,
+
+			lastActiveIndex = this._nActiveBindings ++,
+
+			firstInactiveBinding = bindings[ lastActiveIndex ];
+
+		binding._cacheIndex = lastActiveIndex;
+		bindings[ lastActiveIndex ] = binding;
+
+		firstInactiveBinding._cacheIndex = prevIndex;
+		bindings[ prevIndex ] = firstInactiveBinding;
+
+	}
+
+	_takeBackBinding( binding ) {
+
+		const bindings = this._bindings,
+			prevIndex = binding._cacheIndex,
+
+			firstInactiveIndex = -- this._nActiveBindings,
+
+			lastActiveBinding = bindings[ firstInactiveIndex ];
+
+		binding._cacheIndex = firstInactiveIndex;
+		bindings[ firstInactiveIndex ] = binding;
+
+		lastActiveBinding._cacheIndex = prevIndex;
+		bindings[ prevIndex ] = lastActiveBinding;
+
+	}
+
+
+	// Memory management of Interpolants for weight and time scale
+
+	_lendControlInterpolant() {
+
+		const interpolants = this._controlInterpolants,
+			lastActiveIndex = this._nActiveControlInterpolants ++;
+
+		let interpolant = interpolants[ lastActiveIndex ];
+
+		if ( interpolant === undefined ) {
+
+			interpolant = new LinearInterpolant(
+				new Float32Array( 2 ), new Float32Array( 2 ),
+				1, _controlInterpolantsResultBuffer );
+
+			interpolant.__cacheIndex = lastActiveIndex;
+			interpolants[ lastActiveIndex ] = interpolant;
+
+		}
+
+		return interpolant;
+
+	}
+
+	_takeBackControlInterpolant( interpolant ) {
+
+		const interpolants = this._controlInterpolants,
+			prevIndex = interpolant.__cacheIndex,
+
+			firstInactiveIndex = -- this._nActiveControlInterpolants,
+
+			lastActiveInterpolant = interpolants[ firstInactiveIndex ];
+
+		interpolant.__cacheIndex = firstInactiveIndex;
+		interpolants[ firstInactiveIndex ] = interpolant;
+
+		lastActiveInterpolant.__cacheIndex = prevIndex;
+		interpolants[ prevIndex ] = lastActiveInterpolant;
+
+	}
+
+	/**
+	 * Returns an instance of {@link AnimationAction} for the passed clip.
+	 *
+	 * If an action fitting the clip and root parameters doesn't yet exist, it
+	 * will be created by this method. Calling this method several times with the
+	 * same clip and root parameters always returns the same action.
+	 *
+	 * @param {AnimationClip|string} clip - An animation clip or alternatively the name of the animation clip.
+	 * @param {Object3D} [optionalRoot] - An alternative root object.
+	 * @param {(NormalAnimationBlendMode|AdditiveAnimationBlendMode)} [blendMode] - The blend mode.
+	 * @return {?AnimationAction} The animation action.
+	 */
+	clipAction( clip, optionalRoot, blendMode ) {
+
+		const root = optionalRoot || this._root,
+			rootUuid = root.uuid;
+
+		let clipObject = typeof clip === 'string' ? AnimationClip.findByName( root, clip ) : clip;
+
+		const clipUuid = clipObject !== null ? clipObject.uuid : clip;
+
+		const actionsForClip = this._actionsByClip[ clipUuid ];
+		let prototypeAction = null;
+
+		if ( blendMode === undefined ) {
+
+			if ( clipObject !== null ) {
+
+				blendMode = clipObject.blendMode;
+
+			} else {
+
+				blendMode = NormalAnimationBlendMode;
+
+			}
+
+		}
+
+		if ( actionsForClip !== undefined ) {
+
+			const existingAction = actionsForClip.actionByRoot[ rootUuid ];
+
+			if ( existingAction !== undefined && existingAction.blendMode === blendMode ) {
+
+				return existingAction;
+
+			}
+
+			// we know the clip, so we don't have to parse all
+			// the bindings again but can just copy
+			prototypeAction = actionsForClip.knownActions[ 0 ];
+
+			// also, take the clip from the prototype action
+			if ( clipObject === null )
+				clipObject = prototypeAction._clip;
+
+		}
+
+		// clip must be known when specified via string
+		if ( clipObject === null ) return null;
+
+		// allocate all resources required to run it
+		const newAction = new AnimationAction( this, clipObject, optionalRoot, blendMode );
+
+		this._bindAction( newAction, prototypeAction );
+
+		// and make the action known to the memory manager
+		this._addInactiveAction( newAction, clipUuid, rootUuid );
+
+		return newAction;
+
+	}
+
+	/**
+	 * Returns an existing animation action for the passed clip.
+	 *
+	 * @param {AnimationClip|string} clip - An animation clip or alternatively the name of the animation clip.
+	 * @param {Object3D} [optionalRoot] - An alternative root object.
+	 * @return {?AnimationAction} The animation action. Returns `null` if no action was found.
+	 */
+	existingAction( clip, optionalRoot ) {
+
+		const root = optionalRoot || this._root,
+			rootUuid = root.uuid,
+
+			clipObject = typeof clip === 'string' ?
+				AnimationClip.findByName( root, clip ) : clip,
+
+			clipUuid = clipObject ? clipObject.uuid : clip,
+
+			actionsForClip = this._actionsByClip[ clipUuid ];
+
+		if ( actionsForClip !== undefined ) {
+
+			return actionsForClip.actionByRoot[ rootUuid ] || null;
+
+		}
+
+		return null;
+
+	}
+
+	/**
+	 * Deactivates all previously scheduled actions on this mixer.
+	 *
+	 * @return {AnimationMixer} A reference to this animation mixer.
+	 */
+	stopAllAction() {
+
+		const actions = this._actions,
+			nActions = this._nActiveActions;
+
+		for ( let i = nActions - 1; i >= 0; -- i ) {
+
+			actions[ i ].stop();
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Advances the global mixer time and updates the animation.
+	 *
+	 * This is usually done in the render loop by passing the delta
+	 * time from {@link Clock} or {@link Timer}.
+	 *
+	 * @param {number} deltaTime - The delta time in seconds.
+	 * @return {AnimationMixer} A reference to this animation mixer.
+	 */
+	update( deltaTime ) {
+
+		deltaTime *= this.timeScale;
+
+		const actions = this._actions,
+			nActions = this._nActiveActions,
+
+			time = this.time += deltaTime,
+			timeDirection = Math.sign( deltaTime ),
+
+			accuIndex = this._accuIndex ^= 1;
+
+		// run active actions
+
+		for ( let i = 0; i !== nActions; ++ i ) {
+
+			const action = actions[ i ];
+
+			action._update( time, deltaTime, timeDirection, accuIndex );
+
+		}
+
+		// update scene graph
+
+		const bindings = this._bindings,
+			nBindings = this._nActiveBindings;
+
+		for ( let i = 0; i !== nBindings; ++ i ) {
+
+			bindings[ i ].apply( accuIndex );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the global mixer to a specific time and updates the animation accordingly.
+	 *
+	 * This is useful when you need to jump to an exact time in an animation. The
+	 * input parameter will be scaled by {@link AnimationMixer#timeScale}
+	 *
+	 * @param {number} time - The time to set in seconds.
+	 * @return {AnimationMixer} A reference to this animation mixer.
+	 */
+	setTime( time ) {
+
+		this.time = 0; // Zero out time attribute for AnimationMixer object;
+		for ( let i = 0; i < this._actions.length; i ++ ) {
+
+			this._actions[ i ].time = 0; // Zero out time attribute for all associated AnimationAction objects.
+
+		}
+
+		return this.update( time ); // Update used to set exact time. Returns "this" AnimationMixer object.
+
+	}
+
+	/**
+	 * Returns this mixer's root object.
+	 *
+	 * @return {Object3D} The mixer's root object.
+	 */
+	getRoot() {
+
+		return this._root;
+
+	}
+
+	/**
+	 * Deallocates all memory resources for a clip. Before using this method make
+	 * sure to call {@link AnimationAction#stop} for all related actions.
+	 *
+	 * @param {AnimationClip} clip - The clip to uncache.
+	 */
+	uncacheClip( clip ) {
+
+		const actions = this._actions,
+			clipUuid = clip.uuid,
+			actionsByClip = this._actionsByClip,
+			actionsForClip = actionsByClip[ clipUuid ];
+
+		if ( actionsForClip !== undefined ) {
+
+			// note: just calling _removeInactiveAction would mess up the
+			// iteration state and also require updating the state we can
+			// just throw away
+
+			const actionsToRemove = actionsForClip.knownActions;
+
+			for ( let i = 0, n = actionsToRemove.length; i !== n; ++ i ) {
+
+				const action = actionsToRemove[ i ];
+
+				this._deactivateAction( action );
+
+				const cacheIndex = action._cacheIndex,
+					lastInactiveAction = actions[ actions.length - 1 ];
+
+				action._cacheIndex = null;
+				action._byClipCacheIndex = null;
+
+				lastInactiveAction._cacheIndex = cacheIndex;
+				actions[ cacheIndex ] = lastInactiveAction;
+				actions.pop();
+
+				this._removeInactiveBindingsForAction( action );
+
+			}
+
+			delete actionsByClip[ clipUuid ];
+
+		}
+
+	}
+
+	/**
+	 * Deallocates all memory resources for a root object. Before using this
+	 * method make sure to call {@link AnimationAction#stop} for all related
+	 * actions or alternatively {@link AnimationMixer#stopAllAction} when the
+	 * mixer operates on a single root.
+	 *
+	 * @param {Object3D} root - The root object to uncache.
+	 */
+	uncacheRoot( root ) {
+
+		const rootUuid = root.uuid,
+			actionsByClip = this._actionsByClip;
+
+		for ( const clipUuid in actionsByClip ) {
+
+			const actionByRoot = actionsByClip[ clipUuid ].actionByRoot,
+				action = actionByRoot[ rootUuid ];
+
+			if ( action !== undefined ) {
+
+				this._deactivateAction( action );
+				this._removeInactiveAction( action );
+
+			}
+
+		}
+
+		const bindingsByRoot = this._bindingsByRootAndName,
+			bindingByName = bindingsByRoot[ rootUuid ];
+
+		if ( bindingByName !== undefined ) {
+
+			for ( const trackName in bindingByName ) {
+
+				const binding = bindingByName[ trackName ];
+				binding.restoreOriginalState();
+				this._removeInactiveBinding( binding );
+
+			}
+
+		}
+
+	}
+
+	/**
+	 * Deallocates all memory resources for an action. The action is identified by the
+	 * given clip and an optional root object. Before using this method make
+	 * sure to call {@link AnimationAction#stop} to deactivate the action.
+	 *
+	 * @param {AnimationClip|string} clip - An animation clip or alternatively the name of the animation clip.
+	 * @param {Object3D} [optionalRoot] - An alternative root object.
+	 */
+	uncacheAction( clip, optionalRoot ) {
+
+		const action = this.existingAction( clip, optionalRoot );
+
+		if ( action !== null ) {
+
+			this._deactivateAction( action );
+			this._removeInactiveAction( action );
+
+		}
+
+	}
+
+}
+
+/**
+ * Represents a 3D render target.
+ *
+ * @augments RenderTarget
+ */
+class RenderTarget3D extends RenderTarget {
+
+	/**
+	 * Constructs a new 3D render target.
+	 *
+	 * @param {number} [width=1] - The width of the render target.
+	 * @param {number} [height=1] - The height of the render target.
+	 * @param {number} [depth=1] - The height of the render target.
+	 * @param {RenderTarget~Options} [options] - The configuration object.
+	 */
+	constructor( width = 1, height = 1, depth = 1, options = {} ) {
+
+		super( width, height, options );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isRenderTarget3D = true;
+
+		this.depth = depth;
+
+		// overwrite attachments with 3D textures
+
+		for ( let i = 0; i < this.textures.length; i ++ ) {
+
+			const texture = new Data3DTexture( null, width, height, depth );
+			texture.isRenderTargetTexture = true;
+			texture.renderTarget = this;
+
+			this.textures[ i ] = texture;
+
+		}
+
+		this._setTextureOptions( options );
+
+	}
+
+}
+
+/**
+ * Represents a uniform which is a global shader variable. They are passed to shader programs.
+ *
+ * When declaring a uniform of a {@link ShaderMaterial}, it is declared by value or by object.
+ * ```js
+ * uniforms: {
+ * 	time: { value: 1.0 },
+ * 	resolution: new Uniform( new Vector2() )
+ * };
+ * ```
+ * Since this class can only be used in context of {@link ShaderMaterial}, it is only supported
+ * in {@link WebGLRenderer}.
+ */
+class Uniform {
+
+	/**
+	 * Constructs a new uniform.
+	 *
+	 * @param {any} value - The uniform value.
+	 */
+	constructor( value ) {
+
+		/**
+		 * The uniform value.
+		 *
+		 * @type {any}
+		 */
+		this.value = value;
+
+	}
+
+	/**
+	 * Returns a new uniform with copied values from this instance.
+	 * If the value has a `clone()` method, the value is cloned as well.
+	 *
+	 * @return {Uniform} A clone of this instance.
+	 */
+	clone() {
+
+		return new Uniform( this.value.clone === undefined ? this.value : this.value.clone() );
+
+	}
+
+}
+
+let _id = 0;
+
+/**
+ * A class for managing multiple uniforms in a single group. The renderer will process
+ * such a definition as a single UBO.
+ *
+ * Since this class can only be used in context of {@link ShaderMaterial}, it is only supported
+ * in {@link WebGLRenderer}.
+ *
+ * @augments EventDispatcher
+ */
+class UniformsGroup extends EventDispatcher {
+
+	/**
+	 * Constructs a new uniforms group.
+	 */
+	constructor() {
+
+		super();
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isUniformsGroup = true;
+
+		/**
+		 * The ID of the 3D object.
+		 *
+		 * @name UniformsGroup#id
+		 * @type {number}
+		 * @readonly
+		 */
+		Object.defineProperty( this, 'id', { value: _id ++ } );
+
+		/**
+		 * The name of the uniforms group.
+		 *
+		 * @type {string}
+		 */
+		this.name = '';
+
+		/**
+		 * The buffer usage.
+		 *
+		 * @type {(StaticDrawUsage|DynamicDrawUsage|StreamDrawUsage|StaticReadUsage|DynamicReadUsage|StreamReadUsage|StaticCopyUsage|DynamicCopyUsage|StreamCopyUsage)}
+		 * @default StaticDrawUsage
+		 */
+		this.usage = StaticDrawUsage;
+
+		/**
+		 * An array holding the uniforms.
+		 *
+		 * @type {Array<Uniform>}
+		 */
+		this.uniforms = [];
+
+	}
+
+	/**
+	 * Adds the given uniform to this uniforms group.
+	 *
+	 * @param {Uniform} uniform - The uniform to add.
+	 * @return {UniformsGroup} A reference to this uniforms group.
+	 */
+	add( uniform ) {
+
+		this.uniforms.push( uniform );
+
+		return this;
+
+	}
+
+	/**
+	 * Removes the given uniform from this uniforms group.
+	 *
+	 * @param {Uniform} uniform - The uniform to remove.
+	 * @return {UniformsGroup} A reference to this uniforms group.
+	 */
+	remove( uniform ) {
+
+		const index = this.uniforms.indexOf( uniform );
+
+		if ( index !== -1 ) this.uniforms.splice( index, 1 );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the name of this uniforms group.
+	 *
+	 * @param {string} name - The name to set.
+	 * @return {UniformsGroup} A reference to this uniforms group.
+	 */
+	setName( name ) {
+
+		this.name = name;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the usage of this uniforms group.
+	 *
+	 * @param {(StaticDrawUsage|DynamicDrawUsage|StreamDrawUsage|StaticReadUsage|DynamicReadUsage|StreamReadUsage|StaticCopyUsage|DynamicCopyUsage|StreamCopyUsage)} value - The usage to set.
+	 * @return {UniformsGroup} A reference to this uniforms group.
+	 */
+	setUsage( value ) {
+
+		this.usage = value;
+
+		return this;
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 *
+	 * @fires Texture#dispose
+	 */
+	dispose() {
+
+		this.dispatchEvent( { type: 'dispose' } );
+
+	}
+
+	/**
+	 * Copies the values of the given uniforms group to this instance.
+	 *
+	 * @param {UniformsGroup} source - The uniforms group to copy.
+	 * @return {UniformsGroup} A reference to this uniforms group.
+	 */
+	copy( source ) {
+
+		this.name = source.name;
+		this.usage = source.usage;
+
+		const uniformsSource = source.uniforms;
+
+		this.uniforms.length = 0;
+
+		for ( let i = 0, l = uniformsSource.length; i < l; i ++ ) {
+
+			const uniforms = Array.isArray( uniformsSource[ i ] ) ? uniformsSource[ i ] : [ uniformsSource[ i ] ];
+
+			for ( let j = 0; j < uniforms.length; j ++ ) {
+
+				this.uniforms.push( uniforms[ j ].clone() );
+
+			}
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new uniforms group with copied values from this instance.
+	 *
+	 * @return {UniformsGroup} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+}
+
+/**
+ * An instanced version of an interleaved buffer.
+ *
+ * @augments InterleavedBuffer
+ */
+class InstancedInterleavedBuffer extends InterleavedBuffer {
+
+	/**
+	 * Constructs a new instanced interleaved buffer.
+	 *
+	 * @param {TypedArray} array - A typed array with a shared buffer storing attribute data.
+	 * @param {number} stride - The number of typed-array elements per vertex.
+	 * @param {number} [meshPerAttribute=1] - Defines how often a value of this interleaved buffer should be repeated.
+	 */
+	constructor( array, stride, meshPerAttribute = 1 ) {
+
+		super( array, stride );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isInstancedInterleavedBuffer = true;
+
+		/**
+		 * Defines how often a value of this buffer attribute should be repeated,
+		 * see {@link InstancedBufferAttribute#meshPerAttribute}.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.meshPerAttribute = meshPerAttribute;
+
+	}
+
+	copy( source ) {
+
+		super.copy( source );
+
+		this.meshPerAttribute = source.meshPerAttribute;
+
+		return this;
+
+	}
+
+	clone( data ) {
+
+		const ib = super.clone( data );
+
+		ib.meshPerAttribute = this.meshPerAttribute;
+
+		return ib;
+
+	}
+
+	toJSON( data ) {
+
+		const json = super.toJSON( data );
+
+		json.isInstancedInterleavedBuffer = true;
+		json.meshPerAttribute = this.meshPerAttribute;
+
+		return json;
+
+	}
+
+}
+
+/**
+ * An alternative version of a buffer attribute with more control over the VBO.
+ *
+ * The renderer does not construct a VBO for this kind of attribute. Instead, it uses
+ * whatever VBO is passed in constructor and can later be altered via the `buffer` property.
+ *
+ * The most common use case for this class is when some kind of GPGPU calculation interferes
+ * or even produces the VBOs in question.
+ *
+ * Notice that this class can only be used with {@link WebGLRenderer}.
+ */
+class GLBufferAttribute {
+
+	/**
+	 * Constructs a new GL buffer attribute.
+	 *
+	 * @param {WebGLBuffer} buffer - The native WebGL buffer.
+	 * @param {number} type - The native data type (e.g. `gl.FLOAT`).
+	 * @param {number} itemSize - The item size.
+	 * @param {number} elementSize - The corresponding size (in bytes) for the given `type` parameter.
+	 * @param {number} count - The expected number of vertices in VBO.
+	 * @param {boolean} [normalized=false] - Whether the data are normalized or not.
+	 */
+	constructor( buffer, type, itemSize, elementSize, count, normalized = false ) {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isGLBufferAttribute = true;
+
+		/**
+		 * The name of the buffer attribute.
+		 *
+		 * @type {string}
+		 */
+		this.name = '';
+
+		/**
+		 * The native WebGL buffer.
+		 *
+		 * @type {WebGLBuffer}
+		 */
+		this.buffer = buffer;
+
+		/**
+		 * The native data type.
+		 *
+		 * @type {number}
+		 */
+		this.type = type;
+
+		/**
+		 * The item size, see {@link BufferAttribute#itemSize}.
+		 *
+		 * @type {number}
+		 */
+		this.itemSize = itemSize;
+
+		/**
+		 * The corresponding size (in bytes) for the given `type` parameter.
+		 *
+		 * @type {number}
+		 */
+		this.elementSize = elementSize;
+
+		/**
+		 * The expected number of vertices in VBO.
+		 *
+		 * @type {number}
+		 */
+		this.count = count;
+
+		/**
+		 * Applies to integer data only. Indicates how the underlying data in the buffer maps to
+		 * the values in the GLSL code. For instance, if `buffer` contains data of `gl.UNSIGNED_SHORT`,
+		 * and `normalized` is `true`, the values `0 - +65535` in the buffer data will be mapped to
+		 * `0.0f - +1.0f` in the GLSL attribute. If `normalized` is `false`, the values will be converted
+		 * to floats unmodified, i.e. `65535` becomes `65535.0f`.
+		 *
+		 * @type {boolean}
+		 */
+		this.normalized = normalized;
+
+		/**
+		 * A version number, incremented every time the `needsUpdate` is set to `true`.
+		 *
+		 * @type {number}
+		 */
+		this.version = 0;
+
+	}
+
+	/**
+	 * Flag to indicate that this attribute has changed and should be re-sent to
+	 * the GPU. Set this to `true` when you modify the value of the array.
+	 *
+	 * @type {number}
+	 * @default false
+	 * @param {boolean} value
+	 */
+	set needsUpdate( value ) {
+
+		if ( value === true ) this.version ++;
+
+	}
+
+	/**
+	 * Sets the given native WebGL buffer.
+	 *
+	 * @param {WebGLBuffer} buffer - The buffer to set.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	setBuffer( buffer ) {
+
+		this.buffer = buffer;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the given native data type and element size.
+	 *
+	 * @param {number} type - The native data type (e.g. `gl.FLOAT`).
+	 * @param {number} elementSize - The corresponding size (in bytes) for the given `type` parameter.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	setType( type, elementSize ) {
+
+		this.type = type;
+		this.elementSize = elementSize;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the item size.
+	 *
+	 * @param {number} itemSize - The item size.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	setItemSize( itemSize ) {
+
+		this.itemSize = itemSize;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the count (the expected number of vertices in VBO).
+	 *
+	 * @param {number} count - The count.
+	 * @return {BufferAttribute} A reference to this instance.
+	 */
+	setCount( count ) {
+
+		this.count = count;
+
+		return this;
+
+	}
+
+}
+
+const _matrix = /*@__PURE__*/ new Matrix4();
+
+/**
+ * This class is designed to assist with raycasting. Raycasting is used for
+ * mouse picking (working out what objects in the 3d space the mouse is over)
+ * amongst other things.
+ */
+class Raycaster {
+
+	/**
+	 * Constructs a new raycaster.
+	 *
+	 * @param {Vector3} origin - The origin vector where the ray casts from.
+	 * @param {Vector3} direction - The (normalized) direction vector that gives direction to the ray.
+	 * @param {number} [near=0] - All results returned are further away than near. Near can't be negative.
+	 * @param {number} [far=Infinity] - All results returned are closer than far. Far can't be lower than near.
+	 */
+	constructor( origin, direction, near = 0, far = Infinity ) {
+
+		/**
+		 * The ray used for raycasting.
+		 *
+		 * @type {Ray}
+		 */
+		this.ray = new Ray( origin, direction );
+
+		/**
+		 * All results returned are further away than near. Near can't be negative.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.near = near;
+
+		/**
+		 * All results returned are closer than far. Far can't be lower than near.
+		 *
+		 * @type {number}
+		 * @default Infinity
+		 */
+		this.far = far;
+
+		/**
+		 * The camera to use when raycasting against view-dependent objects such as
+		 * billboarded objects like sprites. This field can be set manually or
+		 * is set when calling `setFromCamera()`.
+		 *
+		 * @type {?Camera}
+		 * @default null
+		 */
+		this.camera = null;
+
+		/**
+		 * Allows to selectively ignore 3D objects when performing intersection tests.
+		 * The following code example ensures that only 3D objects on layer `1` will be
+		 * honored by raycaster.
+		 * ```js
+		 * raycaster.layers.set( 1 );
+		 * object.layers.enable( 1 );
+		 * ```
+		 *
+		 * @type {Layers}
+		 */
+		this.layers = new Layers();
+
+
+		/**
+		 * A parameter object that configures the raycasting. It has the structure:
+		 *
+		 * ```
+		 * {
+		 * 	Mesh: {},
+		 * 	Line: { threshold: 1 },
+		 * 	LOD: {},
+		 * 	Points: { threshold: 1 },
+		 * 	Sprite: {}
+		 * }
+		 * ```
+		 * Where `threshold` is the precision of the raycaster when intersecting objects, in world units.
+		 *
+		 * @type {Object}
+		 */
+		this.params = {
+			Mesh: {},
+			Line: { threshold: 1 },
+			LOD: {},
+			Points: { threshold: 1 },
+			Sprite: {}
+		};
+
+	}
+
+	/**
+	 * Updates the ray with a new origin and direction by copying the values from the arguments.
+	 *
+	 * @param {Vector3} origin - The origin vector where the ray casts from.
+	 * @param {Vector3} direction - The (normalized) direction vector that gives direction to the ray.
+	 */
+	set( origin, direction ) {
+
+		// direction is assumed to be normalized (for accurate distance calculations)
+
+		this.ray.set( origin, direction );
+
+	}
+
+	/**
+	 * Uses the given coordinates and camera to compute a new origin and direction for the internal ray.
+	 *
+	 * @param {Vector2} coords - 2D coordinates of the mouse, in normalized device coordinates (NDC).
+	 * X and Y components should be between `-1` and `1`.
+	 * @param {Camera} camera - The camera from which the ray should originate.
+	 */
+	setFromCamera( coords, camera ) {
+
+		if ( camera.isPerspectiveCamera ) {
+
+			this.ray.origin.setFromMatrixPosition( camera.matrixWorld );
+			this.ray.direction.set( coords.x, coords.y, 0.5 ).unproject( camera ).sub( this.ray.origin ).normalize();
+			this.camera = camera;
+
+		} else if ( camera.isOrthographicCamera ) {
+
+			this.ray.origin.set( coords.x, coords.y, camera.projectionMatrix.elements[ 14 ] ).unproject( camera ); // set origin in plane of camera
+			this.ray.direction.set( 0, 0, -1 ).transformDirection( camera.matrixWorld );
+			this.camera = camera;
+
+		} else {
+
+			error( 'Raycaster: Unsupported camera type: ' + camera.type );
+
+		}
+
+	}
+
+	/**
+	 * Uses the given WebXR controller to compute a new origin and direction for the internal ray.
+	 *
+	 * @param {WebXRController} controller - The controller to copy the position and direction from.
+	 * @return {Raycaster} A reference to this raycaster.
+	 */
+	setFromXRController( controller ) {
+
+		_matrix.identity().extractRotation( controller.matrixWorld );
+
+		this.ray.origin.setFromMatrixPosition( controller.matrixWorld );
+		this.ray.direction.set( 0, 0, -1 ).applyMatrix4( _matrix );
+
+		return this;
+
+	}
+
+	/**
+	 * The intersection point of a raycaster intersection test.
+	 * @typedef {Object} Raycaster~Intersection
+	 * @property {number} distance - The distance from the ray's origin to the intersection point.
+	 * @property {number} distanceToRay -  Some 3D objects e.g. {@link Points} provide the distance of the
+	 * intersection to the nearest point on the ray. For other objects it will be `undefined`.
+	 * @property {Vector3} point - The intersection point, in world coordinates.
+	 * @property {Object} face - The face that has been intersected.
+	 * @property {number} faceIndex - The face index.
+	 * @property {Object3D} object - The 3D object that has been intersected.
+	 * @property {Vector2} uv - U,V coordinates at point of intersection.
+	 * @property {Vector2} uv1 - Second set of U,V coordinates at point of intersection.
+	 * @property {Vector3} normal - Interpolated normal vector at point of intersection.
+	 * @property {number} instanceId - The index number of the instance where the ray
+	 * intersects the {@link InstancedMesh}.
+	 */
+
+	/**
+	 * Checks all intersection between the ray and the object with or without the
+	 * descendants. Intersections are returned sorted by distance, closest first.
+	 *
+	 * `Raycaster` delegates to the `raycast()` method of the passed 3D object, when
+	 * evaluating whether the ray intersects the object or not. This allows meshes to respond
+	 * differently to ray casting than lines or points.
+	 *
+	 * Note that for meshes, faces must be pointed towards the origin of the ray in order
+	 * to be detected; intersections of the ray passing through the back of a face will not
+	 * be detected. To raycast against both faces of an object, you'll want to set  {@link Material#side}
+	 * to `THREE.DoubleSide`.
+	 *
+	 * Note that a ray hitting a triangle mesh exactly along an edge shared by two faces may be
+	 * reported by both faces, resulting in two coincident intersections (identical point and
+	 * distance) in the returned array.
+	 *
+	 * @param {Object3D} object - The 3D object to check for intersection with the ray.
+	 * @param {boolean} [recursive=true] - If set to `true`, it also checks all descendants.
+	 * Otherwise it only checks intersection with the object.
+	 * @param {Array<Raycaster~Intersection>} [intersects=[]] The target array that holds the result of the method.
+	 * @return {Array<Raycaster~Intersection>} An array holding the intersection points.
+	 */
+	intersectObject( object, recursive = true, intersects = [] ) {
+
+		intersect( object, this, intersects, recursive );
+
+		intersects.sort( ascSort );
+
+		return intersects;
+
+	}
+
+	/**
+	 * Checks all intersection between the ray and the objects with or without
+	 * the descendants. Intersections are returned sorted by distance, closest first.
+	 *
+	 * @param {Array<Object3D>} objects - The 3D objects to check for intersection with the ray.
+	 * @param {boolean} [recursive=true] - If set to `true`, it also checks all descendants.
+	 * Otherwise it only checks intersection with the object.
+	 * @param {Array<Raycaster~Intersection>} [intersects=[]] The target array that holds the result of the method.
+	 * @return {Array<Raycaster~Intersection>} An array holding the intersection points.
+	 */
+	intersectObjects( objects, recursive = true, intersects = [] ) {
+
+		for ( let i = 0, l = objects.length; i < l; i ++ ) {
+
+			intersect( objects[ i ], this, intersects, recursive );
+
+		}
+
+		intersects.sort( ascSort );
+
+		return intersects;
+
+	}
+
+}
+
+function ascSort( a, b ) {
+
+	return a.distance - b.distance;
+
+}
+
+function intersect( object, raycaster, intersects, recursive ) {
+
+	let propagate = true;
+
+	if ( object.layers.test( raycaster.layers ) ) {
+
+		const result = object.raycast( raycaster, intersects );
+
+		if ( result === false ) propagate = false;
+
+	}
+
+	if ( propagate === true && recursive === true ) {
+
+		const children = object.children;
+
+		for ( let i = 0, l = children.length; i < l; i ++ ) {
+
+			intersect( children[ i ], raycaster, intersects, true );
+
+		}
+
+	}
+
+}
+
+/**
+ * Class for keeping track of time.
+ *
+ * @deprecated since r183.
+ */
+class Clock {
+
+	/**
+	 * Constructs a new clock.
+	 *
+	 * @deprecated since 183.
+	 * @param {boolean} [autoStart=true] - Whether to automatically start the clock when
+	 * `getDelta()` is called for the first time.
+	 */
+	constructor( autoStart = true ) {
+
+		/**
+		 * If set to `true`, the clock starts automatically when `getDelta()` is called
+		 * for the first time.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.autoStart = autoStart;
+
+		/**
+		 * Holds the time at which the clock's `start()` method was last called.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.startTime = 0;
+
+		/**
+		 * Holds the time at which the clock's `start()`, `getElapsedTime()` or
+		 * `getDelta()` methods were last called.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.oldTime = 0;
+
+		/**
+		 * Keeps track of the total time that the clock has been running.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.elapsedTime = 0;
+
+		/**
+		 * Whether the clock is running or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.running = false;
+
+		warn( 'Clock: This module has been deprecated. Please use THREE.Timer instead.' ); // @deprecated, r183
+
+	}
+
+	/**
+	 * Starts the clock. When `autoStart` is set to `true`, the method is automatically
+	 * called by the class.
+	 */
+	start() {
+
+		this.startTime = performance.now();
+
+		this.oldTime = this.startTime;
+		this.elapsedTime = 0;
+		this.running = true;
+
+	}
+
+	/**
+	 * Stops the clock.
+	 */
+	stop() {
+
+		this.getElapsedTime();
+		this.running = false;
+		this.autoStart = false;
+
+	}
+
+	/**
+	 * Returns the elapsed time in seconds.
+	 *
+	 * @return {number} The elapsed time.
+	 */
+	getElapsedTime() {
+
+		this.getDelta();
+		return this.elapsedTime;
+
+	}
+
+	/**
+	 * Returns the delta time in seconds.
+	 *
+	 * @return {number} The delta time.
+	 */
+	getDelta() {
+
+		let diff = 0;
+
+		if ( this.autoStart && ! this.running ) {
+
+			this.start();
+			return 0;
+
+		}
+
+		if ( this.running ) {
+
+			const newTime = performance.now();
+
+			diff = ( newTime - this.oldTime ) / 1000;
+			this.oldTime = newTime;
+
+			this.elapsedTime += diff;
+
+		}
+
+		return diff;
+
+	}
+
+}
+
+/**
+ * This class can be used to represent points in 3D space as
+ * [Spherical coordinates](https://en.wikipedia.org/wiki/Spherical_coordinate_system).
+ */
+class Spherical {
+
+	/**
+	 * Constructs a new spherical.
+	 *
+	 * @param {number} [radius=1] - The radius, or the Euclidean distance (straight-line distance) from the point to the origin.
+	 * @param {number} [phi=0] - The polar angle in radians from the y (up) axis.
+	 * @param {number} [theta=0] - The equator/azimuthal angle in radians around the y (up) axis.
+	 */
+	constructor( radius = 1, phi = 0, theta = 0 ) {
+
+		/**
+		 * The radius, or the Euclidean distance (straight-line distance) from the point to the origin.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.radius = radius;
+
+		/**
+		 * The polar angle in radians from the y (up) axis.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.phi = phi;
+
+		/**
+		 * The equator/azimuthal angle in radians around the y (up) axis.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.theta = theta;
+
+	}
+
+	/**
+	 * Sets the spherical components by copying the given values.
+	 *
+	 * @param {number} radius - The radius.
+	 * @param {number} phi - The polar angle.
+	 * @param {number} theta - The azimuthal angle.
+	 * @return {Spherical} A reference to this spherical.
+	 */
+	set( radius, phi, theta ) {
+
+		this.radius = radius;
+		this.phi = phi;
+		this.theta = theta;
+
+		return this;
+
+	}
+
+	/**
+	 * Copies the values of the given spherical to this instance.
+	 *
+	 * @param {Spherical} other - The spherical to copy.
+	 * @return {Spherical} A reference to this spherical.
+	 */
+	copy( other ) {
+
+		this.radius = other.radius;
+		this.phi = other.phi;
+		this.theta = other.theta;
+
+		return this;
+
+	}
+
+	/**
+	 * Restricts the polar angle [page:.phi phi] to be between `0.000001` and pi -
+	 * `0.000001`.
+	 *
+	 * @return {Spherical} A reference to this spherical.
+	 */
+	makeSafe() {
+
+		const EPS = 0.000001;
+		this.phi = clamp( this.phi, EPS, Math.PI - EPS );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the spherical components from the given vector which is assumed to hold
+	 * Cartesian coordinates.
+	 *
+	 * @param {Vector3} v - The vector to set.
+	 * @return {Spherical} A reference to this spherical.
+	 */
+	setFromVector3( v ) {
+
+		return this.setFromCartesianCoords( v.x, v.y, v.z );
+
+	}
+
+	/**
+	 * Sets the spherical components from the given Cartesian coordinates.
+	 *
+	 * @param {number} x - The x value.
+	 * @param {number} y - The y value.
+	 * @param {number} z - The z value.
+	 * @return {Spherical} A reference to this spherical.
+	 */
+	setFromCartesianCoords( x, y, z ) {
+
+		this.radius = Math.sqrt( x * x + y * y + z * z );
+
+		if ( this.radius === 0 ) {
+
+			this.theta = 0;
+			this.phi = 0;
+
+		} else {
+
+			this.theta = Math.atan2( x, z );
+			this.phi = Math.acos( clamp( y / this.radius, -1, 1 ) );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new spherical with copied values from this instance.
+	 *
+	 * @return {Spherical} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+}
+
+/**
+ * This class can be used to represent points in 3D space as
+ * [Cylindrical coordinates](https://en.wikipedia.org/wiki/Cylindrical_coordinate_system).
+ */
+class Cylindrical {
+
+	/**
+	 * Constructs a new cylindrical.
+	 *
+	 * @param {number} [radius=1] - The distance from the origin to a point in the x-z plane.
+	 * @param {number} [theta=0] - A counterclockwise angle in the x-z plane measured in radians from the positive z-axis.
+	 * @param {number} [y=0] - The height above the x-z plane.
+	 */
+	constructor( radius = 1, theta = 0, y = 0 ) {
+
+		/**
+		 * The distance from the origin to a point in the x-z plane.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.radius = radius;
+
+		/**
+		 * A counterclockwise angle in the x-z plane measured in radians from the positive z-axis.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.theta = theta;
+
+		/**
+		 * The height above the x-z plane.
+		 *
+		 * @type {number}
+		 * @default 0
+		 */
+		this.y = y;
+
+	}
+
+	/**
+	 * Sets the cylindrical components by copying the given values.
+	 *
+	 * @param {number} radius - The radius.
+	 * @param {number} theta - The theta angle.
+	 * @param {number} y - The height value.
+	 * @return {Cylindrical} A reference to this cylindrical.
+	 */
+	set( radius, theta, y ) {
+
+		this.radius = radius;
+		this.theta = theta;
+		this.y = y;
+
+		return this;
+
+	}
+
+	/**
+	 * Copies the values of the given cylindrical to this instance.
+	 *
+	 * @param {Cylindrical} other - The cylindrical to copy.
+	 * @return {Cylindrical} A reference to this cylindrical.
+	 */
+	copy( other ) {
+
+		this.radius = other.radius;
+		this.theta = other.theta;
+		this.y = other.y;
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the cylindrical components from the given vector which is assumed to hold
+	 * Cartesian coordinates.
+	 *
+	 * @param {Vector3} v - The vector to set.
+	 * @return {Cylindrical} A reference to this cylindrical.
+	 */
+	setFromVector3( v ) {
+
+		return this.setFromCartesianCoords( v.x, v.y, v.z );
+
+	}
+
+	/**
+	 * Sets the cylindrical components from the given Cartesian coordinates.
+	 *
+	 * @param {number} x - The x value.
+	 * @param {number} y - The x value.
+	 * @param {number} z - The x value.
+	 * @return {Cylindrical} A reference to this cylindrical.
+	 */
+	setFromCartesianCoords( x, y, z ) {
+
+		this.radius = Math.sqrt( x * x + z * z );
+		this.theta = Math.atan2( x, z );
+		this.y = y;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new cylindrical with copied values from this instance.
+	 *
+	 * @return {Cylindrical} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+}
+
+/**
+ * Represents a 2x2 matrix.
+ *
+ * A Note on Row-Major and Column-Major Ordering:
+ *
+ * The constructor and {@link Matrix2#set} method take arguments in
+ * [row-major](https://en.wikipedia.org/wiki/Row-_and_column-major_order#Column-major_order)
+ * order, while internally they are stored in the {@link Matrix2#elements} array in column-major order.
+ * This means that calling:
+ * ```js
+ * const m = new THREE.Matrix2();
+ * m.set( 11, 12,
+ *        21, 22 );
+ * ```
+ * will result in the elements array containing:
+ * ```js
+ * m.elements = [ 11, 21,
+ *                12, 22 ];
+ * ```
+ * and internally all calculations are performed using column-major ordering.
+ * However, as the actual ordering makes no difference mathematically and
+ * most people are used to thinking about matrices in row-major order, the
+ * three.js documentation shows matrices in row-major order. Just bear in
+ * mind that if you are reading the source code, you'll have to take the
+ * transpose of any matrices outlined here to make sense of the calculations.
+ */
+class Matrix2 {
+
+	static {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		Matrix2.prototype.isMatrix2 = true;
+
+	}
+
+	/**
+	 * Constructs a new 2x2 matrix. The arguments are supposed to be
+	 * in row-major order. If no arguments are provided, the constructor
+	 * initializes the matrix as an identity matrix.
+	 *
+	 * @param {number} [n11] - 1-1 matrix element.
+	 * @param {number} [n12] - 1-2 matrix element.
+	 * @param {number} [n21] - 2-1 matrix element.
+	 * @param {number} [n22] - 2-2 matrix element.
+	 */
+	constructor( n11, n12, n21, n22 ) {
+
+		/**
+		 * A column-major list of matrix values.
+		 *
+		 * @type {Array<number>}
+		 */
+		this.elements = [
+			1, 0,
+			0, 1,
+		];
+
+		if ( n11 !== undefined ) {
+
+			this.set( n11, n12, n21, n22 );
+
+		}
+
+	}
+
+	/**
+	 * Sets this matrix to the 2x2 identity matrix.
+	 *
+	 * @return {Matrix2} A reference to this matrix.
+	 */
+	identity() {
+
+		this.set(
+			1, 0,
+			0, 1,
+		);
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the elements of the matrix from the given array.
+	 *
+	 * @param {Array<number>} array - The matrix elements in column-major order.
+	 * @param {number} [offset=0] - Index of the first element in the array.
+	 * @return {Matrix2} A reference to this matrix.
+	 */
+	fromArray( array, offset = 0 ) {
+
+		for ( let i = 0; i < 4; i ++ ) {
+
+			this.elements[ i ] = array[ i + offset ];
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the elements of the matrix.The arguments are supposed to be
+	 * in row-major order.
+	 *
+	 * @param {number} n11 - 1-1 matrix element.
+	 * @param {number} n12 - 1-2 matrix element.
+	 * @param {number} n21 - 2-1 matrix element.
+	 * @param {number} n22 - 2-2 matrix element.
+	 * @return {Matrix2} A reference to this matrix.
+	 */
+	set( n11, n12, n21, n22 ) {
+
+		const te = this.elements;
+
+		te[ 0 ] = n11; te[ 2 ] = n12;
+		te[ 1 ] = n21; te[ 3 ] = n22;
+
+		return this;
+
+	}
+
+}
+
+const _vector$4 = /*@__PURE__*/ new Vector2();
+
+/**
+ * Represents an axis-aligned bounding box (AABB) in 2D space.
+ */
+class Box2 {
+
+	/**
+	 * Constructs a new bounding box.
+	 *
+	 * @param {Vector2} [min=(Infinity,Infinity)] - A vector representing the lower boundary of the box.
+	 * @param {Vector2} [max=(-Infinity,-Infinity)] - A vector representing the upper boundary of the box.
+	 */
+	constructor( min = new Vector2( + Infinity, + Infinity ), max = new Vector2( - Infinity, - Infinity ) ) {
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isBox2 = true;
+
+		/**
+		 * The lower boundary of the box.
+		 *
+		 * @type {Vector2}
+		 */
+		this.min = min;
+
+		/**
+		 * The upper boundary of the box.
+		 *
+		 * @type {Vector2}
+		 */
+		this.max = max;
+
+	}
+
+	/**
+	 * Sets the lower and upper boundaries of this box.
+	 * Please note that this method only copies the values from the given objects.
+	 *
+	 * @param {Vector2} min - The lower boundary of the box.
+	 * @param {Vector2} max - The upper boundary of the box.
+	 * @return {Box2} A reference to this bounding box.
+	 */
+	set( min, max ) {
+
+		this.min.copy( min );
+		this.max.copy( max );
+
+		return this;
+
+	}
+
+	/**
+	 * Sets the upper and lower bounds of this box so it encloses the position data
+	 * in the given array.
+	 *
+	 * @param {Array<Vector2>} points - An array holding 2D position data as instances of {@link Vector2}.
+	 * @return {Box2} A reference to this bounding box.
+	 */
+	setFromPoints( points ) {
+
+		this.makeEmpty();
+
+		for ( let i = 0, il = points.length; i < il; i ++ ) {
+
+			this.expandByPoint( points[ i ] );
+
+		}
+
+		return this;
+
+	}
+
+	/**
+	 * Centers this box on the given center vector and sets this box's width, height and
+	 * depth to the given size values.
+	 *
+	 * @param {Vector2} center - The center of the box.
+	 * @param {Vector2} size - The x and y dimensions of the box.
+	 * @return {Box2} A reference to this bounding box.
+	 */
+	setFromCenterAndSize( center, size ) {
+
+		const halfSize = _vector$4.copy( size ).multiplyScalar( 0.5 );
+		this.min.copy( center ).sub( halfSize );
+		this.max.copy( center ).add( halfSize );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns a new box with copied values from this instance.
+	 *
+	 * @return {Box2} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+	/**
+	 * Copies the values of the given box to this instance.
+	 *
+	 * @param {Box2} box - The box to copy.
+	 * @return {Box2} A reference to this bounding box.
+	 */
+	copy( box ) {
+
+		this.min.copy( box.min );
+		this.max.copy( box.max );
+
+		return this;
+
+	}
+
+	/**
+	 * Makes this box empty which means in encloses a zero space in 2D.
+	 *
+	 * @return {Box2} A reference to this bounding box.
+	 */
+	makeEmpty() {
+
+		this.min.x = this.min.y = + Infinity;
+		this.max.x = this.max.y = - Infinity;
+
+		return this;
+
+	}
+
+	/**
+	 * Returns true if this box includes zero points within its bounds.
+	 * Note that a box with equal lower and upper bounds still includes one
+	 * point, the one both bounds share.
+	 *
+	 * @return {boolean} Whether this box is empty or not.
+	 */
+	isEmpty() {
+
+		// this is a more robust check for empty than ( volume <= 0 ) because volume can get positive with two negative axes
+
+		return ( this.max.x < this.min.x ) || ( this.max.y < this.min.y );
+
+	}
+
+	/**
+	 * Returns the center point of this box.
+	 *
+	 * @param {Vector2} target - The target vector that is used to store the method's result.
+	 * @return {Vector2} The center point.
+	 */
+	getCenter( target ) {
+
+		return this.isEmpty() ? target.set( 0, 0 ) : target.addVectors( this.min, this.max ).multiplyScalar( 0.5 );
+
+	}
+
+	/**
+	 * Returns the dimensions of this box.
+	 *
+	 * @param {Vector2} target - The target vector that is used to store the method's result.
+	 * @return {Vector2} The size.
+	 */
+	getSize( target ) {
+
+		return this.isEmpty() ? target.set( 0, 0 ) : target.subVectors( this.max, this.min );
+
+	}
+
+	/**
+	 * Expands the boundaries of this box to include the given point.
+	 *
+	 * @param {Vector2} point - The point that should be included by the bounding box.
+	 * @return {Box2} A reference to this bounding box.
+	 */
+	expandByPoint( point ) {
+
+		this.min.min( point );
+		this.max.max( point );
+
+		return this;
+
+	}
+
+	/**
+	 * Expands this box equilaterally by the given vector. The width of this
+	 * box will be expanded by the x component of the vector in both
+	 * directions. The height of this box will be expanded by the y component of
+	 * the vector in both directions.
+	 *
+	 * @param {Vector2} vector - The vector that should expand the bounding box.
+	 * @return {Box2} A reference to this bounding box.
+	 */
+	expandByVector( vector ) {
+
+		this.min.sub( vector );
+		this.max.add( vector );
+
+		return this;
+
+	}
+
+	/**
+	 * Expands each dimension of the box by the given scalar. If negative, the
+	 * dimensions of the box will be contracted.
+	 *
+	 * @param {number} scalar - The scalar value that should expand the bounding box.
+	 * @return {Box2} A reference to this bounding box.
+	 */
+	expandByScalar( scalar ) {
+
+		this.min.addScalar( - scalar );
+		this.max.addScalar( scalar );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if the given point lies within or on the boundaries of this box.
+	 *
+	 * @param {Vector2} point - The point to test.
+	 * @return {boolean} Whether the bounding box contains the given point or not.
+	 */
+	containsPoint( point ) {
+
+		return point.x >= this.min.x && point.x <= this.max.x &&
+			point.y >= this.min.y && point.y <= this.max.y;
+
+	}
+
+	/**
+	 * Returns `true` if this bounding box includes the entirety of the given bounding box.
+	 * If this box and the given one are identical, this function also returns `true`.
+	 *
+	 * @param {Box2} box - The bounding box to test.
+	 * @return {boolean} Whether the bounding box contains the given bounding box or not.
+	 */
+	containsBox( box ) {
+
+		return this.min.x <= box.min.x && box.max.x <= this.max.x &&
+			this.min.y <= box.min.y && box.max.y <= this.max.y;
+
+	}
+
+	/**
+	 * Returns a point as a proportion of this box's width and height.
+	 *
+	 * @param {Vector2} point - A point in 2D space.
+	 * @param {Vector2} target - The target vector that is used to store the method's result.
+	 * @return {Vector2} A point as a proportion of this box's width and height.
+	 */
+	getParameter( point, target ) {
+
+		// This can potentially have a divide by zero if the box
+		// has a size dimension of 0.
+
+		return target.set(
+			( point.x - this.min.x ) / ( this.max.x - this.min.x ),
+			( point.y - this.min.y ) / ( this.max.y - this.min.y )
+		);
+
+	}
+
+	/**
+	 * Returns `true` if the given bounding box intersects with this bounding box.
+	 *
+	 * @param {Box2} box - The bounding box to test.
+	 * @return {boolean} Whether the given bounding box intersects with this bounding box.
+	 */
+	intersectsBox( box ) {
+
+		// using 4 splitting planes to rule out intersections
+
+		return box.max.x >= this.min.x && box.min.x <= this.max.x &&
+			box.max.y >= this.min.y && box.min.y <= this.max.y;
+
+	}
+
+	/**
+	 * Clamps the given point within the bounds of this box.
+	 *
+	 * @param {Vector2} point - The point to clamp.
+	 * @param {Vector2} target - The target vector that is used to store the method's result.
+	 * @return {Vector2} The clamped point.
+	 */
+	clampPoint( point, target ) {
+
+		return target.copy( point ).clamp( this.min, this.max );
+
+	}
+
+	/**
+	 * Returns the euclidean distance from any edge of this box to the specified point. If
+	 * the given point lies inside of this box, the distance will be `0`.
+	 *
+	 * @param {Vector2} point - The point to compute the distance to.
+	 * @return {number} The euclidean distance.
+	 */
+	distanceToPoint( point ) {
+
+		return this.clampPoint( point, _vector$4 ).distanceTo( point );
+
+	}
+
+	/**
+	 * Computes the intersection of this bounding box and the given one, setting the upper
+	 * bound of this box to the lesser of the two boxes' upper bounds and the
+	 * lower bound of this box to the greater of the two boxes' lower bounds. If
+	 * there's no overlap, makes this box empty.
+	 *
+	 * @param {Box2} box - The bounding box to intersect with.
+	 * @return {Box2} A reference to this bounding box.
+	 */
+	intersect( box ) {
+
+		this.min.max( box.min );
+		this.max.min( box.max );
+
+		if ( this.isEmpty() ) this.makeEmpty();
+
+		return this;
+
+	}
+
+	/**
+	 * Computes the union of this box and another and the given one, setting the upper
+	 * bound of this box to the greater of the two boxes' upper bounds and the
+	 * lower bound of this box to the lesser of the two boxes' lower bounds.
+	 *
+	 * @param {Box2} box - The bounding box that will be unioned with this instance.
+	 * @return {Box2} A reference to this bounding box.
+	 */
+	union( box ) {
+
+		this.min.min( box.min );
+		this.max.max( box.max );
+
+		return this;
+
+	}
+
+	/**
+	 * Adds the given offset to both the upper and lower bounds of this bounding box,
+	 * effectively moving it in 2D space.
+	 *
+	 * @param {Vector2} offset - The offset that should be used to translate the bounding box.
+	 * @return {Box2} A reference to this bounding box.
+	 */
+	translate( offset ) {
+
+		this.min.add( offset );
+		this.max.add( offset );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this bounding box is equal with the given one.
+	 *
+	 * @param {Box2} box - The box to test for equality.
+	 * @return {boolean} Whether this bounding box is equal with the given one.
+	 */
+	equals( box ) {
+
+		return box.min.equals( this.min ) && box.max.equals( this.max );
+
+	}
+
+}
+
+const _startP = /*@__PURE__*/ new Vector3();
+const _startEnd = /*@__PURE__*/ new Vector3();
+
+const _d1 = /*@__PURE__*/ new Vector3();
+const _d2 = /*@__PURE__*/ new Vector3();
+const _r = /*@__PURE__*/ new Vector3();
+const _c1 = /*@__PURE__*/ new Vector3();
+const _c2 = /*@__PURE__*/ new Vector3();
+
+/**
+ * An analytical line segment in 3D space represented by a start and end point.
+ */
+class Line3 {
+
+	/**
+	 * Constructs a new line segment.
+	 *
+	 * @param {Vector3} [start=(0,0,0)] - Start of the line segment.
+	 * @param {Vector3} [end=(0,0,0)] - End of the line segment.
+	 */
+	constructor( start = new Vector3(), end = new Vector3() ) {
+
+		/**
+		 * Start of the line segment.
+		 *
+		 * @type {Vector3}
+		 */
+		this.start = start;
+
+		/**
+		 * End of the line segment.
+		 *
+		 * @type {Vector3}
+		 */
+		this.end = end;
+
+	}
+
+	/**
+	 * Sets the start and end values by copying the given vectors.
+	 *
+	 * @param {Vector3} start - The start point.
+	 * @param {Vector3} end - The end point.
+	 * @return {Line3} A reference to this line segment.
+	 */
+	set( start, end ) {
+
+		this.start.copy( start );
+		this.end.copy( end );
+
+		return this;
+
+	}
+
+	/**
+	 * Copies the values of the given line segment to this instance.
+	 *
+	 * @param {Line3} line - The line segment to copy.
+	 * @return {Line3} A reference to this line segment.
+	 */
+	copy( line ) {
+
+		this.start.copy( line.start );
+		this.end.copy( line.end );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns the center of the line segment.
+	 *
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The center point.
+	 */
+	getCenter( target ) {
+
+		return target.addVectors( this.start, this.end ).multiplyScalar( 0.5 );
+
+	}
+
+	/**
+	 * Returns the delta vector of the line segment's start and end point.
+	 *
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The delta vector.
+	 */
+	delta( target ) {
+
+		return target.subVectors( this.end, this.start );
+
+	}
+
+	/**
+	 * Returns the squared Euclidean distance between the line' start and end point.
+	 *
+	 * @return {number} The squared Euclidean distance.
+	 */
+	distanceSq() {
+
+		return this.start.distanceToSquared( this.end );
+
+	}
+
+	/**
+	 * Returns the Euclidean distance between the line' start and end point.
+	 *
+	 * @return {number} The Euclidean distance.
+	 */
+	distance() {
+
+		return this.start.distanceTo( this.end );
+
+	}
+
+	/**
+	 * Returns a vector at a certain position along the line segment.
+	 *
+	 * @param {number} t - A value between `[0,1]` to represent a position along the line segment.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The delta vector.
+	 */
+	at( t, target ) {
+
+		return this.delta( target ).multiplyScalar( t ).add( this.start );
+
+	}
+
+	/**
+	 * Returns a point parameter based on the closest point as projected on the line segment.
+	 *
+	 * @param {Vector3} point - The point for which to return a point parameter.
+	 * @param {boolean} clampToLine - Whether to clamp the result to the range `[0,1]` or not.
+	 * @return {number} The point parameter.
+	 */
+	closestPointToPointParameter( point, clampToLine ) {
+
+		_startP.subVectors( point, this.start );
+		_startEnd.subVectors( this.end, this.start );
+
+		const startEnd2 = _startEnd.dot( _startEnd );
+
+		if ( startEnd2 === 0 ) return 0;
+
+		const startEnd_startP = _startEnd.dot( _startP );
+
+		let t = startEnd_startP / startEnd2;
+
+		if ( clampToLine ) {
+
+			t = clamp( t, 0, 1 );
+
+		}
+
+		return t;
+
+	}
+
+	/**
+	 * Returns the closest point on the line for a given point.
+	 *
+	 * @param {Vector3} point - The point to compute the closest point on the line for.
+	 * @param {boolean} clampToLine - Whether to clamp the result to the range `[0,1]` or not.
+	 * @param {Vector3} target - The target vector that is used to store the method's result.
+	 * @return {Vector3} The closest point on the line.
+	 */
+	closestPointToPoint( point, clampToLine, target ) {
+
+		const t = this.closestPointToPointParameter( point, clampToLine );
+
+		return this.delta( target ).multiplyScalar( t ).add( this.start );
+
+	}
+
+	/**
+	 * Returns the closest squared distance between this line segment and the given one.
+	 *
+	 * @param {Line3} line - The line segment to compute the closest squared distance to.
+	 * @param {Vector3} [c1] - The closest point on this line segment.
+	 * @param {Vector3} [c2] - The closest point on the given line segment.
+	 * @return {number} The squared distance between this line segment and the given one.
+	 */
+	distanceSqToLine3( line, c1 = _c1, c2 = _c2 ) {
+
+		// from Real-Time Collision Detection by Christer Ericson, chapter 5.1.9
+
+		// Computes closest points C1 and C2 of S1(s)=P1+s*(Q1-P1) and
+		// S2(t)=P2+t*(Q2-P2), returning s and t. Function result is squared
+		// distance between between S1(s) and S2(t)
+
+		const EPSILON = 1e-8 * 1e-8; // must be squared since we compare squared length
+		let s, t;
+
+		const p1 = this.start;
+		const p2 = line.start;
+		const q1 = this.end;
+		const q2 = line.end;
+
+		_d1.subVectors( q1, p1 ); // Direction vector of segment S1
+		_d2.subVectors( q2, p2 ); // Direction vector of segment S2
+		_r.subVectors( p1, p2 );
+
+		const a = _d1.dot( _d1 ); // Squared length of segment S1, always nonnegative
+		const e = _d2.dot( _d2 ); // Squared length of segment S2, always nonnegative
+		const f = _d2.dot( _r );
+
+		// Check if either or both segments degenerate into points
+
+		if ( a <= EPSILON && e <= EPSILON ) {
+
+			// Both segments degenerate into points
+
+			c1.copy( p1 );
+			c2.copy( p2 );
+
+			c1.sub( c2 );
+
+			return c1.dot( c1 );
+
+		}
+
+		if ( a <= EPSILON ) {
+
+			// First segment degenerates into a point
+
+			s = 0;
+			t = f / e; // s = 0 => t = (b*s + f) / e = f / e
+			t = clamp( t, 0, 1 );
+
+
+		} else {
+
+			const c = _d1.dot( _r );
+
+			if ( e <= EPSILON ) {
+
+				// Second segment degenerates into a point
+
+				t = 0;
+				s = clamp( - c / a, 0, 1 ); // t = 0 => s = (b*t - c) / a = -c / a
+
+			} else {
+
+				// The general nondegenerate case starts here
+
+				const b = _d1.dot( _d2 );
+				const denom = a * e - b * b; // Always nonnegative
+
+				// If segments not parallel, compute closest point on L1 to L2 and
+				// clamp to segment S1. Else pick arbitrary s (here 0)
+
+				if ( denom !== 0 ) {
+
+					s = clamp( ( b * f - c * e ) / denom, 0, 1 );
+
+				} else {
+
+					s = 0;
+
+				}
+
+				// Compute point on L2 closest to S1(s) using
+				// t = Dot((P1 + D1*s) - P2,D2) / Dot(D2,D2) = (b*s + f) / e
+
+				t = ( b * s + f ) / e;
+
+				// If t in [0,1] done. Else clamp t, recompute s for the new value
+				// of t using s = Dot((P2 + D2*t) - P1,D1) / Dot(D1,D1)= (t*b - c) / a
+				// and clamp s to [0, 1]
+
+				if ( t < 0 ) {
+
+					t = 0.;
+					s = clamp( - c / a, 0, 1 );
+
+				} else if ( t > 1 ) {
+
+					t = 1;
+					s = clamp( ( b - c ) / a, 0, 1 );
+
+				}
+
+			}
+
+		}
+
+		c1.copy( p1 ).addScaledVector( _d1, s );
+		c2.copy( p2 ).addScaledVector( _d2, t );
+
+		return c1.distanceToSquared( c2 );
+
+	}
+
+	/**
+	 * Applies a 4x4 transformation matrix to this line segment.
+	 *
+	 * @param {Matrix4} matrix - The transformation matrix.
+	 * @return {Line3} A reference to this line segment.
+	 */
+	applyMatrix4( matrix ) {
+
+		this.start.applyMatrix4( matrix );
+		this.end.applyMatrix4( matrix );
+
+		return this;
+
+	}
+
+	/**
+	 * Returns `true` if this line segment is equal with the given one.
+	 *
+	 * @param {Line3} line - The line segment to test for equality.
+	 * @return {boolean} Whether this line segment is equal with the given one.
+	 */
+	equals( line ) {
+
+		return line.start.equals( this.start ) && line.end.equals( this.end );
+
+	}
+
+	/**
+	 * Returns a new line segment with copied values from this instance.
+	 *
+	 * @return {Line3} A clone of this instance.
+	 */
+	clone() {
+
+		return new this.constructor().copy( this );
+
+	}
+
+}
+
+const _vector$3 = /*@__PURE__*/ new Vector3();
+
+/**
+ * This displays a cone shaped helper object for a {@link SpotLight}.
+ *
+ * When the spot light or its target are transformed or light properties are
+ * changed, it's necessary to call the `update()` method of the respective helper.
+ *
+ * ```js
+ * const spotLight = new THREE.SpotLight( 0xffffff );
+ * spotLight.position.set( 10, 10, 10 );
+ * scene.add( spotLight );
+ *
+ * const spotLightHelper = new THREE.SpotLightHelper( spotLight );
+ * scene.add( spotLightHelper );
+ * ```
+ *
+ * @augments Object3D
+ */
+class SpotLightHelper extends Object3D {
+
+	/**
+	 * Constructs a new spot light helper.
+	 *
+	 * @param {HemisphereLight} light - The light to be visualized.
+	 * @param {number|Color|string} [color] - The helper's color. If not set, the helper will take
+	 * the color of the light.
+	 */
+	constructor( light, color ) {
+
+		super();
+
+		/**
+		 * The light being visualized.
+		 *
+		 * @type {SpotLight}
+		 */
+		this.light = light;
+
+		this.matrixAutoUpdate = false;
+
+		/**
+		 * The color parameter passed in the constructor.
+		 * If not set, the helper will take the color of the light.
+		 *
+		 * @type {number|Color|string}
+		 */
+		this.color = color;
+
+		this.type = 'SpotLightHelper';
+
+		const geometry = new BufferGeometry();
+
+		const positions = [
+			0, 0, 0, 	0, 0, 1,
+			0, 0, 0, 	1, 0, 1,
+			0, 0, 0,	-1, 0, 1,
+			0, 0, 0, 	0, 1, 1,
+			0, 0, 0, 	0, -1, 1
+		];
+
+		for ( let i = 0, j = 1, l = 32; i < l; i ++, j ++ ) {
+
+			const p1 = ( i / l ) * Math.PI * 2;
+			const p2 = ( j / l ) * Math.PI * 2;
+
+			positions.push(
+				Math.cos( p1 ), Math.sin( p1 ), 1,
+				Math.cos( p2 ), Math.sin( p2 ), 1
+			);
+
+		}
+
+		geometry.setAttribute( 'position', new Float32BufferAttribute( positions, 3 ) );
+
+		const material = new LineBasicMaterial( { fog: false, toneMapped: false } );
+
+		this.cone = new LineSegments( geometry, material );
+		this.add( this.cone );
+
+		this.update();
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		this.cone.geometry.dispose();
+		this.cone.material.dispose();
+
+	}
+
+	/**
+	 * Updates the helper to match the position and direction of the
+	 * light being visualized.
+	 */
+	update() {
+
+		this.light.updateWorldMatrix( true, false );
+		this.light.target.updateWorldMatrix( true, false );
+
+		// update the local matrix based on the parent and light target transforms
+		if ( this.parent ) {
+
+			this.parent.updateWorldMatrix( true );
+
+			this.matrix
+				.copy( this.parent.matrixWorld )
+				.invert()
+				.multiply( this.light.matrixWorld );
+
+		} else {
+
+			this.matrix.copy( this.light.matrixWorld );
+
+		}
+
+		this.matrixWorldNeedsUpdate = true;
+
+		const coneLength = this.light.distance ? this.light.distance : 1000;
+		const coneWidth = coneLength * Math.tan( this.light.angle );
+
+		this.cone.scale.set( coneWidth, coneWidth, coneLength );
+
+		_vector$3.setFromMatrixPosition( this.light.target.matrixWorld );
+
+		this.cone.lookAt( _vector$3 );
+
+		if ( this.color !== undefined ) {
+
+			this.cone.material.color.set( this.color );
+
+		} else {
+
+			this.cone.material.color.copy( this.light.color );
+
+		}
+
+	}
+
+}
+
+const _vector$2 = /*@__PURE__*/ new Vector3();
+const _boneMatrix = /*@__PURE__*/ new Matrix4();
+const _matrixWorldInv = /*@__PURE__*/ new Matrix4();
+
+/**
+ * A helper object to assist with visualizing a {@link Skeleton}.
+ *
+ * ```js
+ * const helper = new THREE.SkeletonHelper( skinnedMesh );
+ * scene.add( helper );
+ * ```
+ *
+ * @augments LineSegments
+ */
+class SkeletonHelper extends LineSegments {
+
+	/**
+	 * Constructs a new skeleton helper.
+	 *
+	 * @param {Object3D} object -  Usually an instance of {@link SkinnedMesh}. However, any 3D object
+	 * can be used if it represents a hierarchy of bones (see {@link Bone}).
+	 */
+	constructor( object ) {
+
+		const bones = getBoneList( object );
+
+		const geometry = new BufferGeometry();
+
+		const vertices = [];
+		const colors = [];
+
+		for ( let i = 0; i < bones.length; i ++ ) {
+
+			const bone = bones[ i ];
+
+			if ( bone.parent && bone.parent.isBone ) {
+
+				vertices.push( 0, 0, 0 );
+				vertices.push( 0, 0, 0 );
+				colors.push( 0, 0, 0 );
+				colors.push( 0, 0, 0 );
+
+			}
+
+		}
+
+		geometry.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		geometry.setAttribute( 'color', new Float32BufferAttribute( colors, 3 ) );
+
+		const material = new LineBasicMaterial( { vertexColors: true, depthTest: false, depthWrite: false, toneMapped: false, transparent: true } );
+
+		super( geometry, material );
+
+		/**
+		 * This flag can be used for type testing.
+		 *
+		 * @type {boolean}
+		 * @readonly
+		 * @default true
+		 */
+		this.isSkeletonHelper = true;
+
+		this.type = 'SkeletonHelper';
+
+		/**
+		 * The object being visualized.
+		 *
+		 * @type {Object3D}
+		 */
+		this.root = object;
+
+		/**
+		 * The list of bones that the helper visualizes.
+		 *
+		 * @type {Array<Bone>}
+		 */
+		this.bones = bones;
+
+		this.matrix = object.matrixWorld;
+		this.matrixAutoUpdate = false;
+
+		// colors
+
+		const color1 = new Color( 0x0000ff );
+		const color2 = new Color( 0x00ff00 );
+
+		this.setColors( color1, color2 );
+
+	}
+
+	updateMatrixWorld( force ) {
+
+		const bones = this.bones;
+
+		const geometry = this.geometry;
+		const position = geometry.getAttribute( 'position' );
+
+		_matrixWorldInv.copy( this.root.matrixWorld ).invert();
+
+		for ( let i = 0, j = 0; i < bones.length; i ++ ) {
+
+			const bone = bones[ i ];
+
+			if ( bone.parent && bone.parent.isBone ) {
+
+				_boneMatrix.multiplyMatrices( _matrixWorldInv, bone.matrixWorld );
+				_vector$2.setFromMatrixPosition( _boneMatrix );
+				position.setXYZ( j, _vector$2.x, _vector$2.y, _vector$2.z );
+
+				_boneMatrix.multiplyMatrices( _matrixWorldInv, bone.parent.matrixWorld );
+				_vector$2.setFromMatrixPosition( _boneMatrix );
+				position.setXYZ( j + 1, _vector$2.x, _vector$2.y, _vector$2.z );
+
+				j += 2;
+
+			}
+
+		}
+
+		geometry.getAttribute( 'position' ).needsUpdate = true;
+
+		super.updateMatrixWorld( force );
+
+	}
+
+	/**
+	 * Defines the colors of the helper.
+	 *
+	 * @param {Color} color1 - The first line color for each bone.
+	 * @param {Color} color2 - The second line color for each bone.
+	 * @return {SkeletonHelper} A reference to this helper.
+	 */
+	setColors( color1, color2 ) {
+
+		const geometry = this.geometry;
+		const colorAttribute = geometry.getAttribute( 'color' );
+
+		for ( let i = 0; i < colorAttribute.count; i += 2 ) {
+
+			colorAttribute.setXYZ( i, color1.r, color1.g, color1.b );
+			colorAttribute.setXYZ( i + 1, color2.r, color2.g, color2.b );
+
+		}
+
+		colorAttribute.needsUpdate = true;
+
+		return this;
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		this.geometry.dispose();
+		this.material.dispose();
+
+	}
+
+}
+
+
+function getBoneList( object ) {
+
+	const boneList = [];
+
+	if ( object.isBone === true ) {
+
+		boneList.push( object );
+
+	}
+
+	for ( let i = 0; i < object.children.length; i ++ ) {
+
+		boneList.push( ...getBoneList( object.children[ i ] ) );
+
+	}
+
+	return boneList;
+
+}
+
+/**
+ * This displays a helper object consisting of a spherical mesh for
+ * visualizing an instance of {@link PointLight}.
+ *
+ * ```js
+ * const pointLight = new THREE.PointLight( 0xff0000, 1, 100 );
+ * pointLight.position.set( 10, 10, 10 );
+ * scene.add( pointLight );
+ *
+ * const sphereSize = 1;
+ * const pointLightHelper = new THREE.PointLightHelper( pointLight, sphereSize );
+ * scene.add( pointLightHelper );
+ * ```
+ *
+ * @augments Mesh
+ */
+class PointLightHelper extends Mesh {
+
+	/**
+	 * Constructs a new point light helper.
+	 *
+	 * @param {PointLight} light - The light to be visualized.
+	 * @param {number} [sphereSize=1] - The size of the sphere helper.
+	 * @param {number|Color|string} [color] - The helper's color. If not set, the helper will take
+	 * the color of the light.
+	 */
+	constructor( light, sphereSize, color ) {
+
+		const geometry = new SphereGeometry( sphereSize, 4, 2 );
+		const material = new MeshBasicMaterial( { wireframe: true, fog: false, toneMapped: false } );
+
+		super( geometry, material );
+
+		/**
+		 * The light being visualized.
+		 *
+		 * @type {PointLight}
+		 */
+		this.light = light;
+
+		/**
+		 * The color parameter passed in the constructor.
+		 * If not set, the helper will take the color of the light.
+		 *
+		 * @type {number|Color|string}
+		 */
+		this.color = color;
+
+		this.type = 'PointLightHelper';
+
+		this.matrix = this.light.matrixWorld;
+		this.matrixAutoUpdate = false;
+
+		this.update();
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		this.geometry.dispose();
+		this.material.dispose();
+
+	}
+
+	/**
+	 * Updates the helper to match the position of the
+	 * light being visualized.
+	 */
+	update() {
+
+		this.matrixWorldNeedsUpdate = true;
+
+		this.light.updateWorldMatrix( true, false );
+
+		if ( this.color !== undefined ) {
+
+			this.material.color.set( this.color );
+
+		} else {
+
+			this.material.color.copy( this.light.color );
+
+		}
+
+		/*
+		const d = this.light.distance;
+
+		if ( d === 0.0 ) {
+
+			this.lightDistance.visible = false;
+
+		} else {
+
+			this.lightDistance.visible = true;
+			this.lightDistance.scale.set( d, d, d );
+
+		}
+		*/
+
+	}
+
+}
+
+const _vector$1 = /*@__PURE__*/ new Vector3();
+const _color1 = /*@__PURE__*/ new Color();
+const _color2 = /*@__PURE__*/ new Color();
+
+/**
+ * Creates a visual aid consisting of a spherical mesh for a
+ * given {@link HemisphereLight}.
+ *
+ * When the hemisphere light is transformed or its light properties are changed,
+ * it's necessary to call the `update()` method of the respective helper.
+ *
+ * ```js
+ * const light = new THREE.HemisphereLight( 0xffffbb, 0x080820, 1 );
+ * const helper = new THREE.HemisphereLightHelper( light, 5 );
+ * scene.add( helper );
+ * ```
+ *
+ * @augments Object3D
+ */
+class HemisphereLightHelper extends Object3D {
+
+	/**
+	 * Constructs a new hemisphere light helper.
+	 *
+	 * @param {HemisphereLight} light - The light to be visualized.
+	 * @param {number} [size=1] - The size of the mesh used to visualize the light.
+	 * @param {number|Color|string} [color] - The helper's color. If not set, the helper will take
+	 * the color of the light.
+	 */
+	constructor( light, size, color ) {
+
+		super();
+
+		/**
+		 * The light being visualized.
+		 *
+		 * @type {HemisphereLight}
+		 */
+		this.light = light;
+
+		this.matrix = light.matrixWorld;
+		this.matrixAutoUpdate = false;
+
+		/**
+		 * The color parameter passed in the constructor.
+		 * If not set, the helper will take the color of the light.
+		 *
+		 * @type {number|Color|string}
+		 */
+		this.color = color;
+
+		this.type = 'HemisphereLightHelper';
+
+		const geometry = new OctahedronGeometry( size );
+		geometry.rotateY( Math.PI * 0.5 );
+
+		this.material = new MeshBasicMaterial( { wireframe: true, fog: false, toneMapped: false } );
+		if ( this.color === undefined ) this.material.vertexColors = true;
+
+		const position = geometry.getAttribute( 'position' );
+		const colors = new Float32Array( position.count * 3 );
+
+		geometry.setAttribute( 'color', new BufferAttribute( colors, 3 ) );
+
+		this.add( new Mesh( geometry, this.material ) );
+
+		this.update();
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		this.children[ 0 ].geometry.dispose();
+		this.children[ 0 ].material.dispose();
+
+	}
+
+	/**
+	 * Updates the helper to match the position and direction of the
+	 * light being visualized.
+	 */
+	update() {
+
+		const mesh = this.children[ 0 ];
+
+		if ( this.color !== undefined ) {
+
+			this.material.color.set( this.color );
+
+		} else {
+
+			const colors = mesh.geometry.getAttribute( 'color' );
+
+			_color1.copy( this.light.color );
+			_color2.copy( this.light.groundColor );
+
+			for ( let i = 0, l = colors.count; i < l; i ++ ) {
+
+				const color = ( i < ( l / 2 ) ) ? _color1 : _color2;
+
+				colors.setXYZ( i, color.r, color.g, color.b );
+
+			}
+
+			colors.needsUpdate = true;
+
+		}
+
+		this.matrixWorldNeedsUpdate = true;
+
+		this.light.updateWorldMatrix( true, false );
+
+		mesh.lookAt( _vector$1.setFromMatrixPosition( this.light.matrixWorld ).negate() );
+
+	}
+
+}
+
+/**
+ * The helper is an object to define grids. Grids are two-dimensional
+ * arrays of lines.
+ *
+ * ```js
+ * const size = 10;
+ * const divisions = 10;
+ *
+ * const gridHelper = new THREE.GridHelper( size, divisions );
+ * scene.add( gridHelper );
+ * ```
+ *
+ * @augments LineSegments
+ */
+class GridHelper extends LineSegments {
+
+	/**
+	 * Constructs a new grid helper.
+	 *
+	 * @param {number} [size=10] - The size of the grid.
+	 * @param {number} [divisions=10] - The number of divisions across the grid.
+	 * @param {number|Color|string} [color1=0x444444] - The color of the center line.
+	 * @param {number|Color|string} [color2=0x888888] - The color of the lines of the grid.
+	 */
+	constructor( size = 10, divisions = 10, color1 = 0x444444, color2 = 0x888888 ) {
+
+		color1 = new Color( color1 );
+		color2 = new Color( color2 );
+
+		const center = divisions / 2;
+		const step = size / divisions;
+		const halfSize = size / 2;
+
+		const vertices = [], colors = [];
+
+		for ( let i = 0, j = 0, k = - halfSize; i <= divisions; i ++, k += step ) {
+
+			vertices.push( - halfSize, 0, k, halfSize, 0, k );
+			vertices.push( k, 0, - halfSize, k, 0, halfSize );
+
+			const color = i === center ? color1 : color2;
+
+			color.toArray( colors, j ); j += 3;
+			color.toArray( colors, j ); j += 3;
+			color.toArray( colors, j ); j += 3;
+			color.toArray( colors, j ); j += 3;
+
+		}
+
+		const geometry = new BufferGeometry();
+		geometry.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		geometry.setAttribute( 'color', new Float32BufferAttribute( colors, 3 ) );
+
+		const material = new LineBasicMaterial( { vertexColors: true, toneMapped: false } );
+
+		super( geometry, material );
+
+		this.type = 'GridHelper';
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		this.geometry.dispose();
+		this.material.dispose();
+
+	}
+
+}
+
+/**
+ * This helper is an object to define polar grids. Grids are
+ * two-dimensional arrays of lines.
+ *
+ * ```js
+ * const radius = 10;
+ * const sectors = 16;
+ * const rings = 8;
+ * const divisions = 64;
+ *
+ * const helper = new THREE.PolarGridHelper( radius, sectors, rings, divisions );
+ * scene.add( helper );
+ * ```
+ *
+ * @augments LineSegments
+ */
+class PolarGridHelper extends LineSegments {
+
+	/**
+	 * Constructs a new polar grid helper.
+	 *
+	 * @param {number} [radius=10] - The radius of the polar grid. This can be any positive number.
+	 * @param {number} [sectors=16] - The number of sectors the grid will be divided into. This can be any positive integer.
+	 * @param {number} [rings=16] - The number of rings. This can be any positive integer.
+	 * @param {number} [divisions=64] - The number of line segments used for each circle. This can be any positive integer.
+	 * @param {number|Color|string} [color1=0x444444] - The first color used for grid elements.
+	 * @param {number|Color|string} [color2=0x888888] -  The second color used for grid elements.
+	 */
+	constructor( radius = 10, sectors = 16, rings = 8, divisions = 64, color1 = 0x444444, color2 = 0x888888 ) {
+
+		color1 = new Color( color1 );
+		color2 = new Color( color2 );
+
+		const vertices = [];
+		const colors = [];
+
+		// create the sectors
+
+		if ( sectors > 1 ) {
+
+			for ( let i = 0; i < sectors; i ++ ) {
+
+				const v = ( i / sectors ) * ( Math.PI * 2 );
+
+				const x = Math.sin( v ) * radius;
+				const z = Math.cos( v ) * radius;
+
+				vertices.push( 0, 0, 0 );
+				vertices.push( x, 0, z );
+
+				const color = ( i & 1 ) ? color1 : color2;
+
+				colors.push( color.r, color.g, color.b );
+				colors.push( color.r, color.g, color.b );
+
+			}
+
+		}
+
+		// create the rings
+
+		for ( let i = 0; i < rings; i ++ ) {
+
+			const color = ( i & 1 ) ? color1 : color2;
+
+			const r = radius - ( radius / rings * i );
+
+			for ( let j = 0; j < divisions; j ++ ) {
+
+				// first vertex
+
+				let v = ( j / divisions ) * ( Math.PI * 2 );
+
+				let x = Math.sin( v ) * r;
+				let z = Math.cos( v ) * r;
+
+				vertices.push( x, 0, z );
+				colors.push( color.r, color.g, color.b );
+
+				// second vertex
+
+				v = ( ( j + 1 ) / divisions ) * ( Math.PI * 2 );
+
+				x = Math.sin( v ) * r;
+				z = Math.cos( v ) * r;
+
+				vertices.push( x, 0, z );
+				colors.push( color.r, color.g, color.b );
+
+			}
+
+		}
+
+		const geometry = new BufferGeometry();
+		geometry.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		geometry.setAttribute( 'color', new Float32BufferAttribute( colors, 3 ) );
+
+		const material = new LineBasicMaterial( { vertexColors: true, toneMapped: false } );
+
+		super( geometry, material );
+
+		this.type = 'PolarGridHelper';
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		this.geometry.dispose();
+		this.material.dispose();
+
+	}
+
+}
+
+const _v1 = /*@__PURE__*/ new Vector3();
+const _v2 = /*@__PURE__*/ new Vector3();
+const _v3 = /*@__PURE__*/ new Vector3();
+
+/**
+ * Helper object to assist with visualizing a {@link DirectionalLight}'s
+ * effect on the scene. This consists of a plane and a line representing the
+ * light's position and direction.
+ *
+ * When the directional light or its target are transformed or light properties
+ * are changed, it's necessary to call the `update()` method of the respective helper.
+ *
+ * ```js
+ * const light = new THREE.DirectionalLight( 0xFFFFFF );
+ * scene.add( light );
+ *
+ * const helper = new THREE.DirectionalLightHelper( light, 5 );
+ * scene.add( helper );
+ * ```
+ *
+ * @augments Object3D
+ */
+class DirectionalLightHelper extends Object3D {
+
+	/**
+	 * Constructs a new directional light helper.
+	 *
+	 * @param {DirectionalLight} light - The light to be visualized.
+	 * @param {number} [size=1] - The dimensions of the plane.
+	 * @param {number|Color|string} [color] - The helper's color. If not set, the helper will take
+	 * the color of the light.
+	 */
+	constructor( light, size, color ) {
+
+		super();
+
+		/**
+		 * The light being visualized.
+		 *
+		 * @type {DirectionalLight}
+		 */
+		this.light = light;
+
+		this.matrix = light.matrixWorld;
+		this.matrixAutoUpdate = false;
+
+		/**
+		 * The color parameter passed in the constructor.
+		 * If not set, the helper will take the color of the light.
+		 *
+		 * @type {number|Color|string}
+		 */
+		this.color = color;
+
+		this.type = 'DirectionalLightHelper';
+
+		if ( size === undefined ) size = 1;
+
+		let geometry = new BufferGeometry();
+		geometry.setAttribute( 'position', new Float32BufferAttribute( [
+			- size, size, 0,
+			size, size, 0,
+			size, - size, 0,
+			- size, - size, 0,
+			- size, size, 0
+		], 3 ) );
+
+		const material = new LineBasicMaterial( { fog: false, toneMapped: false } );
+
+		/**
+		 * Contains the line showing the location of the directional light.
+		 *
+		 * @type {Line}
+		 */
+		this.lightPlane = new Line( geometry, material );
+		this.add( this.lightPlane );
+
+		geometry = new BufferGeometry();
+		geometry.setAttribute( 'position', new Float32BufferAttribute( [ 0, 0, 0, 0, 0, 1 ], 3 ) );
+
+		/**
+		 * Represents the target line of the directional light.
+		 *
+		 * @type {Line}
+		 */
+		this.targetLine = new Line( geometry, material );
+		this.add( this.targetLine );
+
+		this.update();
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		this.lightPlane.geometry.dispose();
+		this.lightPlane.material.dispose();
+		this.targetLine.geometry.dispose();
+		this.targetLine.material.dispose();
+
+	}
+
+	/**
+	 * Updates the helper to match the position and direction of the
+	 * light being visualized.
+	 */
+	update() {
+
+		this.matrixWorldNeedsUpdate = true;
+
+		this.light.updateWorldMatrix( true, false );
+		this.light.target.updateWorldMatrix( true, false );
+
+		_v1.setFromMatrixPosition( this.light.matrixWorld );
+		_v2.setFromMatrixPosition( this.light.target.matrixWorld );
+		_v3.subVectors( _v2, _v1 );
+
+		this.lightPlane.lookAt( _v2 );
+
+		if ( this.color !== undefined ) {
+
+			this.lightPlane.material.color.set( this.color );
+			this.targetLine.material.color.set( this.color );
+
+		} else {
+
+			this.lightPlane.material.color.copy( this.light.color );
+			this.targetLine.material.color.copy( this.light.color );
+
+		}
+
+		this.targetLine.lookAt( _v2 );
+		this.targetLine.scale.z = _v3.length();
+
+	}
+
+}
+
+const _vector = /*@__PURE__*/ new Vector3();
+const _camera = /*@__PURE__*/ new Camera();
+
+/**
+ * This helps with visualizing what a camera contains in its frustum. It
+ * visualizes the frustum of a camera using a line segments.
+ *
+ * Based on frustum visualization in [lightgl.js shadowmap example](https://github.com/evanw/lightgl.js/blob/master/tests/shadowmap.html).
+ *
+ * `CameraHelper` must be a child of the scene.
+ *
+ * When the camera is transformed or its projection matrix is changed, it's necessary
+ * to call the `update()` method of the respective helper.
+ *
+ * ```js
+ * const camera = new THREE.PerspectiveCamera( 75, window.innerWidth / window.innerHeight, 0.1, 1000 );
+ * const helper = new THREE.CameraHelper( camera );
+ * scene.add( helper );
+ * ```
+ *
+ * @augments LineSegments
+ */
+class CameraHelper extends LineSegments {
+
+	/**
+	 * Constructs a new arrow helper.
+	 *
+	 * @param {Camera} camera - The camera to visualize.
+	 */
+	constructor( camera ) {
+
+		const geometry = new BufferGeometry();
+		const material = new LineBasicMaterial( { color: 0xffffff, vertexColors: true, toneMapped: false } );
+
+		const vertices = [];
+		const colors = [];
+
+		const pointMap = {};
+
+		// near
+
+		addLine( 'n1', 'n2' );
+		addLine( 'n2', 'n4' );
+		addLine( 'n4', 'n3' );
+		addLine( 'n3', 'n1' );
+
+		// far
+
+		addLine( 'f1', 'f2' );
+		addLine( 'f2', 'f4' );
+		addLine( 'f4', 'f3' );
+		addLine( 'f3', 'f1' );
+
+		// sides
+
+		addLine( 'n1', 'f1' );
+		addLine( 'n2', 'f2' );
+		addLine( 'n3', 'f3' );
+		addLine( 'n4', 'f4' );
+
+		// cone
+
+		addLine( 'p', 'n1' );
+		addLine( 'p', 'n2' );
+		addLine( 'p', 'n3' );
+		addLine( 'p', 'n4' );
+
+		// up
+
+		addLine( 'u1', 'u2' );
+		addLine( 'u2', 'u3' );
+		addLine( 'u3', 'u1' );
+
+		// target
+
+		addLine( 'c', 't' );
+		addLine( 'p', 'c' );
+
+		// cross
+
+		addLine( 'cn1', 'cn2' );
+		addLine( 'cn3', 'cn4' );
+
+		addLine( 'cf1', 'cf2' );
+		addLine( 'cf3', 'cf4' );
+
+		function addLine( a, b ) {
+
+			addPoint( a );
+			addPoint( b );
+
+		}
+
+		function addPoint( id ) {
+
+			vertices.push( 0, 0, 0 );
+			colors.push( 0, 0, 0 );
+
+			if ( pointMap[ id ] === undefined ) {
+
+				pointMap[ id ] = [];
+
+			}
+
+			pointMap[ id ].push( ( vertices.length / 3 ) - 1 );
+
+		}
+
+		geometry.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		geometry.setAttribute( 'color', new Float32BufferAttribute( colors, 3 ) );
+
+		super( geometry, material );
+
+		this.type = 'CameraHelper';
+
+		/**
+		 * The camera being visualized.
+		 *
+		 * @type {Camera}
+		 */
+		this.camera = camera;
+		if ( this.camera.updateProjectionMatrix ) this.camera.updateProjectionMatrix();
+
+		this.matrix = camera.matrixWorld;
+		this.matrixAutoUpdate = false;
+
+		/**
+		 * This contains the points used to visualize the camera.
+		 *
+		 * @type {Object<string,Array<number>>}
+		 */
+		this.pointMap = pointMap;
+
+		this.update();
+
+		// colors
+
+		const colorFrustum = new Color( 0xffaa00 );
+		const colorCone = new Color( 0xff0000 );
+		const colorUp = new Color( 0x00aaff );
+		const colorTarget = new Color( 0xffffff );
+		const colorCross = new Color( 0x333333 );
+
+		this.setColors( colorFrustum, colorCone, colorUp, colorTarget, colorCross );
+
+	}
+
+	/**
+	 * Defines the colors of the helper.
+	 *
+	 * @param {Color} frustum - The frustum line color.
+	 * @param {Color} cone - The cone line color.
+	 * @param {Color} up - The up line color.
+	 * @param {Color} target - The target line color.
+	 * @param {Color} cross - The cross line color.
+	 * @return {CameraHelper} A reference to this helper.
+	 */
+	setColors( frustum, cone, up, target, cross ) {
+
+		const geometry = this.geometry;
+
+		const colorAttribute = geometry.getAttribute( 'color' );
+
+		// near
+
+		colorAttribute.setXYZ( 0, frustum.r, frustum.g, frustum.b ); colorAttribute.setXYZ( 1, frustum.r, frustum.g, frustum.b ); // n1, n2
+		colorAttribute.setXYZ( 2, frustum.r, frustum.g, frustum.b ); colorAttribute.setXYZ( 3, frustum.r, frustum.g, frustum.b ); // n2, n4
+		colorAttribute.setXYZ( 4, frustum.r, frustum.g, frustum.b ); colorAttribute.setXYZ( 5, frustum.r, frustum.g, frustum.b ); // n4, n3
+		colorAttribute.setXYZ( 6, frustum.r, frustum.g, frustum.b ); colorAttribute.setXYZ( 7, frustum.r, frustum.g, frustum.b ); // n3, n1
+
+		// far
+
+		colorAttribute.setXYZ( 8, frustum.r, frustum.g, frustum.b ); colorAttribute.setXYZ( 9, frustum.r, frustum.g, frustum.b ); // f1, f2
+		colorAttribute.setXYZ( 10, frustum.r, frustum.g, frustum.b ); colorAttribute.setXYZ( 11, frustum.r, frustum.g, frustum.b ); // f2, f4
+		colorAttribute.setXYZ( 12, frustum.r, frustum.g, frustum.b ); colorAttribute.setXYZ( 13, frustum.r, frustum.g, frustum.b ); // f4, f3
+		colorAttribute.setXYZ( 14, frustum.r, frustum.g, frustum.b ); colorAttribute.setXYZ( 15, frustum.r, frustum.g, frustum.b ); // f3, f1
+
+		// sides
+
+		colorAttribute.setXYZ( 16, frustum.r, frustum.g, frustum.b ); colorAttribute.setXYZ( 17, frustum.r, frustum.g, frustum.b ); // n1, f1
+		colorAttribute.setXYZ( 18, frustum.r, frustum.g, frustum.b ); colorAttribute.setXYZ( 19, frustum.r, frustum.g, frustum.b ); // n2, f2
+		colorAttribute.setXYZ( 20, frustum.r, frustum.g, frustum.b ); colorAttribute.setXYZ( 21, frustum.r, frustum.g, frustum.b ); // n3, f3
+		colorAttribute.setXYZ( 22, frustum.r, frustum.g, frustum.b ); colorAttribute.setXYZ( 23, frustum.r, frustum.g, frustum.b ); // n4, f4
+
+		// cone
+
+		colorAttribute.setXYZ( 24, cone.r, cone.g, cone.b ); colorAttribute.setXYZ( 25, cone.r, cone.g, cone.b ); // p, n1
+		colorAttribute.setXYZ( 26, cone.r, cone.g, cone.b ); colorAttribute.setXYZ( 27, cone.r, cone.g, cone.b ); // p, n2
+		colorAttribute.setXYZ( 28, cone.r, cone.g, cone.b ); colorAttribute.setXYZ( 29, cone.r, cone.g, cone.b ); // p, n3
+		colorAttribute.setXYZ( 30, cone.r, cone.g, cone.b ); colorAttribute.setXYZ( 31, cone.r, cone.g, cone.b ); // p, n4
+
+		// up
+
+		colorAttribute.setXYZ( 32, up.r, up.g, up.b ); colorAttribute.setXYZ( 33, up.r, up.g, up.b ); // u1, u2
+		colorAttribute.setXYZ( 34, up.r, up.g, up.b ); colorAttribute.setXYZ( 35, up.r, up.g, up.b ); // u2, u3
+		colorAttribute.setXYZ( 36, up.r, up.g, up.b ); colorAttribute.setXYZ( 37, up.r, up.g, up.b ); // u3, u1
+
+		// target
+
+		colorAttribute.setXYZ( 38, target.r, target.g, target.b ); colorAttribute.setXYZ( 39, target.r, target.g, target.b ); // c, t
+		colorAttribute.setXYZ( 40, cross.r, cross.g, cross.b ); colorAttribute.setXYZ( 41, cross.r, cross.g, cross.b ); // p, c
+
+		// cross
+
+		colorAttribute.setXYZ( 42, cross.r, cross.g, cross.b ); colorAttribute.setXYZ( 43, cross.r, cross.g, cross.b ); // cn1, cn2
+		colorAttribute.setXYZ( 44, cross.r, cross.g, cross.b ); colorAttribute.setXYZ( 45, cross.r, cross.g, cross.b ); // cn3, cn4
+
+		colorAttribute.setXYZ( 46, cross.r, cross.g, cross.b ); colorAttribute.setXYZ( 47, cross.r, cross.g, cross.b ); // cf1, cf2
+		colorAttribute.setXYZ( 48, cross.r, cross.g, cross.b ); colorAttribute.setXYZ( 49, cross.r, cross.g, cross.b ); // cf3, cf4
+
+		colorAttribute.needsUpdate = true;
+
+		return this;
+
+	}
+
+	/**
+	 * Updates the helper based on the projection matrix of the camera.
+	 */
+	update() {
+
+		const geometry = this.geometry;
+		const pointMap = this.pointMap;
+
+		const w = 1, h = 1;
+
+		let nearZ, farZ;
+
+		// we need just camera projection matrix inverse
+		// world matrix must be identity
+
+		_camera.projectionMatrixInverse.copy( this.camera.projectionMatrixInverse );
+
+		// Adjust z values based on coordinate system
+
+		if ( this.camera.reversedDepth === true ) {
+
+			nearZ = 1;
+			farZ = 0;
+
+		} else {
+
+			if ( this.camera.coordinateSystem === WebGLCoordinateSystem ) {
+
+				nearZ = -1;
+				farZ = 1;
+
+			} else if ( this.camera.coordinateSystem === WebGPUCoordinateSystem ) {
+
+				nearZ = 0;
+				farZ = 1;
+
+			} else {
+
+				throw new Error( 'THREE.CameraHelper.update(): Invalid coordinate system: ' + this.camera.coordinateSystem );
+
+			}
+
+		}
+
+
+		// center / target
+		setPoint( 'c', pointMap, geometry, _camera, 0, 0, nearZ );
+		setPoint( 't', pointMap, geometry, _camera, 0, 0, farZ );
+
+		// near
+
+		setPoint( 'n1', pointMap, geometry, _camera, - w, - h, nearZ );
+		setPoint( 'n2', pointMap, geometry, _camera, w, - h, nearZ );
+		setPoint( 'n3', pointMap, geometry, _camera, - w, h, nearZ );
+		setPoint( 'n4', pointMap, geometry, _camera, w, h, nearZ );
+
+		// far
+
+		setPoint( 'f1', pointMap, geometry, _camera, - w, - h, farZ );
+		setPoint( 'f2', pointMap, geometry, _camera, w, - h, farZ );
+		setPoint( 'f3', pointMap, geometry, _camera, - w, h, farZ );
+		setPoint( 'f4', pointMap, geometry, _camera, w, h, farZ );
+
+		// up
+
+		setPoint( 'u1', pointMap, geometry, _camera, w * 0.7, h * 1.1, nearZ );
+		setPoint( 'u2', pointMap, geometry, _camera, - w * 0.7, h * 1.1, nearZ );
+		setPoint( 'u3', pointMap, geometry, _camera, 0, h * 2, nearZ );
+
+		// cross
+
+		setPoint( 'cf1', pointMap, geometry, _camera, - w, 0, farZ );
+		setPoint( 'cf2', pointMap, geometry, _camera, w, 0, farZ );
+		setPoint( 'cf3', pointMap, geometry, _camera, 0, - h, farZ );
+		setPoint( 'cf4', pointMap, geometry, _camera, 0, h, farZ );
+
+		setPoint( 'cn1', pointMap, geometry, _camera, - w, 0, nearZ );
+		setPoint( 'cn2', pointMap, geometry, _camera, w, 0, nearZ );
+		setPoint( 'cn3', pointMap, geometry, _camera, 0, - h, nearZ );
+		setPoint( 'cn4', pointMap, geometry, _camera, 0, h, nearZ );
+
+		geometry.getAttribute( 'position' ).needsUpdate = true;
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		this.geometry.dispose();
+		this.material.dispose();
+
+	}
+
+}
+
+
+function setPoint( point, pointMap, geometry, camera, x, y, z ) {
+
+	_vector.set( x, y, z ).unproject( camera );
+
+	const points = pointMap[ point ];
+
+	if ( points !== undefined ) {
+
+		const position = geometry.getAttribute( 'position' );
+
+		for ( let i = 0, l = points.length; i < l; i ++ ) {
+
+			position.setXYZ( points[ i ], _vector.x, _vector.y, _vector.z );
+
+		}
+
+	}
+
+}
+
+const _box = /*@__PURE__*/ new Box3();
+
+/**
+ * Helper object to graphically show the world-axis-aligned bounding box
+ * around an object. The actual bounding box is handled with {@link Box3},
+ * this is just a visual helper for debugging. It can be automatically
+ * resized with {@link BoxHelper#update} when the object it's created from
+ * is transformed. Note that the object must have a geometry for this to work,
+ * so it won't work with sprites.
+ *
+ * ```js
+ * const sphere = new THREE.SphereGeometry();
+ * const object = new THREE.Mesh( sphere, new THREE.MeshBasicMaterial( 0xff0000 ) );
+ * const box = new THREE.BoxHelper( object, 0xffff00 );
+ * scene.add( box );
+ * ```
+ *
+ * @augments LineSegments
+ */
+class BoxHelper extends LineSegments {
+
+	/**
+	 * Constructs a new box helper.
+	 *
+	 * @param {Object3D} [object] - The 3D object to show the world-axis-aligned bounding box.
+	 * @param {number|Color|string} [color=0xffff00] - The box's color.
+	 */
+	constructor( object, color = 0xffff00 ) {
+
+		const indices = new Uint16Array( [ 0, 1, 1, 2, 2, 3, 3, 0, 4, 5, 5, 6, 6, 7, 7, 4, 0, 4, 1, 5, 2, 6, 3, 7 ] );
+		const positions = new Float32Array( 8 * 3 );
+
+		const geometry = new BufferGeometry();
+		geometry.setIndex( new BufferAttribute( indices, 1 ) );
+		geometry.setAttribute( 'position', new BufferAttribute( positions, 3 ) );
+
+		super( geometry, new LineBasicMaterial( { color: color, toneMapped: false } ) );
+
+		/**
+		 * The 3D object being visualized.
+		 *
+		 * @type {Object3D}
+		 */
+		this.object = object;
+		this.type = 'BoxHelper';
+
+		this.matrixAutoUpdate = false;
+
+		this.update();
+
+	}
+
+	/**
+	 * Updates the helper's geometry to match the dimensions of the object,
+	 * including any children.
+	 */
+	update() {
+
+		if ( this.object !== undefined ) {
+
+			_box.setFromObject( this.object );
+
+		}
+
+		if ( _box.isEmpty() ) return;
+
+		const min = _box.min;
+		const max = _box.max;
+
+		/*
+			5____4
+		1/___0/|
+		| 6__|_7
+		2/___3/
+
+		0: max.x, max.y, max.z
+		1: min.x, max.y, max.z
+		2: min.x, min.y, max.z
+		3: max.x, min.y, max.z
+		4: max.x, max.y, min.z
+		5: min.x, max.y, min.z
+		6: min.x, min.y, min.z
+		7: max.x, min.y, min.z
+		*/
+
+		const position = this.geometry.attributes.position;
+		const array = position.array;
+
+		array[ 0 ] = max.x; array[ 1 ] = max.y; array[ 2 ] = max.z;
+		array[ 3 ] = min.x; array[ 4 ] = max.y; array[ 5 ] = max.z;
+		array[ 6 ] = min.x; array[ 7 ] = min.y; array[ 8 ] = max.z;
+		array[ 9 ] = max.x; array[ 10 ] = min.y; array[ 11 ] = max.z;
+		array[ 12 ] = max.x; array[ 13 ] = max.y; array[ 14 ] = min.z;
+		array[ 15 ] = min.x; array[ 16 ] = max.y; array[ 17 ] = min.z;
+		array[ 18 ] = min.x; array[ 19 ] = min.y; array[ 20 ] = min.z;
+		array[ 21 ] = max.x; array[ 22 ] = min.y; array[ 23 ] = min.z;
+
+		position.needsUpdate = true;
+
+		this.geometry.computeBoundingSphere();
+
+	}
+
+	/**
+	 * Updates the wireframe box for the passed object.
+	 *
+	 * @param {Object3D} object - The 3D object to create the helper for.
+	 * @return {BoxHelper} A reference to this instance.
+	 */
+	setFromObject( object ) {
+
+		this.object = object;
+		this.update();
+
+		return this;
+
+	}
+
+	copy( source, recursive ) {
+
+		super.copy( source, recursive );
+
+		this.object = source.object;
+
+		return this;
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		this.geometry.dispose();
+		this.material.dispose();
+
+	}
+
+}
+
+/**
+ * A helper object to visualize an instance of {@link Box3}.
+ *
+ * ```js
+ * const box = new THREE.Box3();
+ * box.setFromCenterAndSize( new THREE.Vector3( 1, 1, 1 ), new THREE.Vector3( 2, 1, 3 ) );
+ *
+ * const helper = new THREE.Box3Helper( box, 0xffff00 );
+ * scene.add( helper )
+ * ```
+ *
+ * @augments LineSegments
+ */
+class Box3Helper extends LineSegments {
+
+	/**
+	 * Constructs a new box3 helper.
+	 *
+	 * @param {Box3} box - The box to visualize.
+	 * @param {number|Color|string} [color=0xffff00] - The box's color.
+	 */
+	constructor( box, color = 0xffff00 ) {
+
+		const indices = new Uint16Array( [ 0, 1, 1, 2, 2, 3, 3, 0, 4, 5, 5, 6, 6, 7, 7, 4, 0, 4, 1, 5, 2, 6, 3, 7 ] );
+
+		const positions = [ 1, 1, 1, -1, 1, 1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, -1, 1, -1, -1 ];
+
+		const geometry = new BufferGeometry();
+
+		geometry.setIndex( new BufferAttribute( indices, 1 ) );
+
+		geometry.setAttribute( 'position', new Float32BufferAttribute( positions, 3 ) );
+
+		super( geometry, new LineBasicMaterial( { color: color, toneMapped: false } ) );
+
+		/**
+		 * The box being visualized.
+		 *
+		 * @type {Box3}
+		 */
+		this.box = box;
+
+		this.type = 'Box3Helper';
+
+		this.geometry.computeBoundingSphere();
+
+	}
+
+	updateMatrixWorld( force ) {
+
+		const box = this.box;
+
+		if ( box.isEmpty() ) return;
+
+		box.getCenter( this.position );
+
+		box.getSize( this.scale );
+
+		this.scale.multiplyScalar( 0.5 );
+
+		super.updateMatrixWorld( force );
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		this.geometry.dispose();
+		this.material.dispose();
+
+	}
+
+}
+
+/**
+ * A helper object to visualize an instance of {@link Plane}.
+ *
+ * ```js
+ * const plane = new THREE.Plane( new THREE.Vector3( 1, 1, 0.2 ), 3 );
+ * const helper = new THREE.PlaneHelper( plane, 1, 0xffff00 );
+ * scene.add( helper );
+ * ```
+ *
+ * @augments Line
+ */
+class PlaneHelper extends Line {
+
+	/**
+	 * Constructs a new plane helper.
+	 *
+	 * @param {Plane} plane - The plane to be visualized.
+	 * @param {number} [size=1] - The side length of plane helper.
+	 * @param {number|Color|string} [hex=0xffff00] - The helper's color.
+	 */
+	constructor( plane, size = 1, hex = 0xffff00 ) {
+
+		const color = hex;
+
+		const positions = [ 1, -1, 0, -1, 1, 0, -1, -1, 0, 1, 1, 0, -1, 1, 0, -1, -1, 0, 1, -1, 0, 1, 1, 0 ];
+
+		const geometry = new BufferGeometry();
+		geometry.setAttribute( 'position', new Float32BufferAttribute( positions, 3 ) );
+		geometry.computeBoundingSphere();
+
+		super( geometry, new LineBasicMaterial( { color: color, toneMapped: false } ) );
+
+		this.type = 'PlaneHelper';
+
+		/**
+		 * The plane being visualized.
+		 *
+		 * @type {Plane}
+		 */
+		this.plane = plane;
+
+		/**
+		 * The side length of plane helper.
+		 *
+		 * @type {number}
+		 * @default 1
+		 */
+		this.size = size;
+
+		const positions2 = [ 1, 1, 0, -1, 1, 0, -1, -1, 0, 1, 1, 0, -1, -1, 0, 1, -1, 0 ];
+
+		const geometry2 = new BufferGeometry();
+		geometry2.setAttribute( 'position', new Float32BufferAttribute( positions2, 3 ) );
+		geometry2.computeBoundingSphere();
+
+		this.add( new Mesh( geometry2, new MeshBasicMaterial( { color: color, opacity: 0.2, transparent: true, depthWrite: false, toneMapped: false } ) ) );
+
+	}
+
+	updateMatrixWorld( force ) {
+
+		this.position.set( 0, 0, 0 );
+
+		this.scale.set( 0.5 * this.size, 0.5 * this.size, 1 );
+
+		this.lookAt( this.plane.normal );
+
+		this.translateZ( - this.plane.constant );
+
+		super.updateMatrixWorld( force );
+
+	}
+
+	/**
+	 * Updates the helper to match the position and direction of the
+	 * light being visualized.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		this.geometry.dispose();
+		this.material.dispose();
+		this.children[ 0 ].geometry.dispose();
+		this.children[ 0 ].material.dispose();
+
+	}
+
+}
+
+const _axis = /*@__PURE__*/ new Vector3();
+let _lineGeometry, _coneGeometry;
+
+/**
+ * An 3D arrow object for visualizing directions.
+ *
+ * ```js
+ * const dir = new THREE.Vector3( 1, 2, 0 );
+ *
+ * //normalize the direction vector (convert to vector of length 1)
+ * dir.normalize();
+ *
+ * const origin = new THREE.Vector3( 0, 0, 0 );
+ * const length = 1;
+ * const hex = 0xffff00;
+ *
+ * const arrowHelper = new THREE.ArrowHelper( dir, origin, length, hex );
+ * scene.add( arrowHelper );
+ * ```
+ *
+ * @augments Object3D
+ */
+class ArrowHelper extends Object3D {
+
+	/**
+	 * Constructs a new arrow helper.
+	 *
+	 * @param {Vector3} [dir=(0, 0, 1)] - The (normalized) direction vector.
+	 * @param {Vector3} [origin=(0, 0, 0)] - Point at which the arrow starts.
+	 * @param {number} [length=1] - Length of the arrow in world units.
+	 * @param {(number|Color|string)} [color=0xffff00] - Color of the arrow.
+	 * @param {number} [headLength=length*0.2] - The length of the head of the arrow.
+	 * @param {number} [headWidth=headLength*0.2] - The width of the head of the arrow.
+	 */
+	constructor( dir = new Vector3( 0, 0, 1 ), origin = new Vector3( 0, 0, 0 ), length = 1, color = 0xffff00, headLength = length * 0.2, headWidth = headLength * 0.2 ) {
+
+		super();
+
+		this.type = 'ArrowHelper';
+
+		if ( _lineGeometry === undefined ) {
+
+			_lineGeometry = new BufferGeometry();
+			_lineGeometry.setAttribute( 'position', new Float32BufferAttribute( [ 0, 0, 0, 0, 1, 0 ], 3 ) );
+
+			_coneGeometry = new ConeGeometry( 0.5, 1, 5, 1 );
+			_coneGeometry.translate( 0, -0.5, 0 );
+
+		}
+
+		this.position.copy( origin );
+
+		/**
+		 * The line part of the arrow helper.
+		 *
+		 * @type {Line}
+		 */
+		this.line = new Line( _lineGeometry, new LineBasicMaterial( { color: color, toneMapped: false } ) );
+		this.line.matrixAutoUpdate = false;
+		this.add( this.line );
+
+		/**
+		 * The cone part of the arrow helper.
+		 *
+		 * @type {Mesh}
+		 */
+		this.cone = new Mesh( _coneGeometry, new MeshBasicMaterial( { color: color, toneMapped: false } ) );
+		this.cone.matrixAutoUpdate = false;
+		this.add( this.cone );
+
+		this.setDirection( dir );
+		this.setLength( length, headLength, headWidth );
+
+	}
+
+	/**
+	 * Sets the direction of the helper.
+	 *
+	 * @param {Vector3} dir - The normalized direction vector.
+	 */
+	setDirection( dir ) {
+
+		// dir is assumed to be normalized
+
+		if ( dir.y > 0.99999 ) {
+
+			this.quaternion.set( 0, 0, 0, 1 );
+
+		} else if ( dir.y < -0.99999 ) {
+
+			this.quaternion.set( 1, 0, 0, 0 );
+
+		} else {
+
+			_axis.set( dir.z, 0, - dir.x ).normalize();
+
+			const radians = Math.acos( dir.y );
+
+			this.quaternion.setFromAxisAngle( _axis, radians );
+
+		}
+
+	}
+
+	/**
+	 * Sets the length of the helper.
+	 *
+	 * @param {number} length - Length of the arrow in world units.
+	 * @param {number} [headLength=length*0.2] - The length of the head of the arrow.
+	 * @param {number} [headWidth=headLength*0.2] - The width of the head of the arrow.
+	 */
+	setLength( length, headLength = length * 0.2, headWidth = headLength * 0.2 ) {
+
+		this.line.scale.set( 1, Math.max( 0.0001, length - headLength ), 1 ); // see #17458
+		this.line.updateMatrix();
+
+		this.cone.scale.set( headWidth, headLength, headWidth );
+		this.cone.position.y = length;
+		this.cone.updateMatrix();
+
+	}
+
+	/**
+	 * Sets the color of the helper.
+	 *
+	 * @param {number|Color|string} color - The color to set.
+	 */
+	setColor( color ) {
+
+		this.line.material.color.set( color );
+		this.cone.material.color.set( color );
+
+	}
+
+	copy( source ) {
+
+		super.copy( source, false );
+
+		this.line.copy( source.line );
+		this.cone.copy( source.cone );
+
+		return this;
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		this.line.geometry.dispose();
+		this.line.material.dispose();
+		this.cone.geometry.dispose();
+		this.cone.material.dispose();
+
+	}
+
+}
+
+/**
+ * An axis object to visualize the 3 axes in a simple way.
+ * The X axis is red. The Y axis is green. The Z axis is blue.
+ *
+ * ```js
+ * const axesHelper = new THREE.AxesHelper( 5 );
+ * scene.add( axesHelper );
+ * ```
+ *
+ * @augments LineSegments
+ */
+class AxesHelper extends LineSegments {
+
+	/**
+	 * Constructs a new axes helper.
+	 *
+	 * @param {number} [size=1] - Size of the lines representing the axes.
+	 */
+	constructor( size = 1 ) {
+
+		const vertices = [
+			0, 0, 0,	size, 0, 0,
+			0, 0, 0,	0, size, 0,
+			0, 0, 0,	0, 0, size
+		];
+
+		const colors = [
+			1, 0, 0,	1, 0.6, 0,
+			0, 1, 0,	0.6, 1, 0,
+			0, 0, 1,	0, 0.6, 1
+		];
+
+		const geometry = new BufferGeometry();
+		geometry.setAttribute( 'position', new Float32BufferAttribute( vertices, 3 ) );
+		geometry.setAttribute( 'color', new Float32BufferAttribute( colors, 3 ) );
+
+		const material = new LineBasicMaterial( { vertexColors: true, toneMapped: false } );
+
+		super( geometry, material );
+
+		this.type = 'AxesHelper';
+
+	}
+
+	/**
+	 * Defines the colors of the axes helper.
+	 *
+	 * @param {number|Color|string} xAxisColor - The color for the x axis.
+	 * @param {number|Color|string} yAxisColor - The color for the y axis.
+	 * @param {number|Color|string} zAxisColor - The color for the z axis.
+	 * @return {AxesHelper} A reference to this axes helper.
+	 */
+	setColors( xAxisColor, yAxisColor, zAxisColor ) {
+
+		const color = new Color();
+		const array = this.geometry.attributes.color.array;
+
+		color.set( xAxisColor );
+		color.toArray( array, 0 );
+		color.toArray( array, 3 );
+
+		color.set( yAxisColor );
+		color.toArray( array, 6 );
+		color.toArray( array, 9 );
+
+		color.set( zAxisColor );
+		color.toArray( array, 12 );
+		color.toArray( array, 15 );
+
+		this.geometry.attributes.color.needsUpdate = true;
+
+		return this;
+
+	}
+
+	/**
+	 * Frees the GPU-related resources allocated by this instance. Call this
+	 * method whenever this instance is no longer used in your app.
+	 */
+	dispose() {
+
+		super.dispose();
+
+		this.geometry.dispose();
+		this.material.dispose();
+
+	}
+
+}
+
+/**
+ * This class is used to convert a series of paths to an array of
+ * shapes. It is specifically used in context of fonts and SVG.
+ */
+class ShapePath {
+
+	/**
+	 * Constructs a new shape path.
+	 */
+	constructor() {
+
+		this.type = 'ShapePath';
+
+		/**
+		 * The color of the shape.
+		 *
+		 * @type {Color}
+		 */
+		this.color = new Color();
+
+		/**
+		 * The paths that have been generated for this shape.
+		 *
+		 * @type {Array<Path>}
+		 * @default null
+		 */
+		this.subPaths = [];
+
+		/**
+		 * The current path that is being generated.
+		 *
+		 * @type {?Path}
+		 * @default null
+		 */
+		this.currentPath = null;
+
+		/**
+		 * An object that can be used to store custom data about the shape path.
+		 * Mainly used by SVGLoader to store style information.
+		 *
+		 * @type {Object}
+		 */
+		this.userData = {};
+
+	}
+
+	/**
+	 * Creates a new path and moves it current point to the given one.
+	 *
+	 * @param {number} x - The x coordinate.
+	 * @param {number} y - The y coordinate.
+	 * @return {ShapePath} A reference to this shape path.
+	 */
+	moveTo( x, y ) {
+
+		this.currentPath = new Path();
+		this.subPaths.push( this.currentPath );
+		this.currentPath.moveTo( x, y );
+
+		return this;
+
+	}
+
+	/**
+	 * Adds an instance of {@link LineCurve} to the path by connecting
+	 * the current point with the given one.
+	 *
+	 * @param {number} x - The x coordinate of the end point.
+	 * @param {number} y - The y coordinate of the end point.
+	 * @return {ShapePath} A reference to this shape path.
+	 */
+	lineTo( x, y ) {
+
+		this.currentPath.lineTo( x, y );
+
+		return this;
+
+	}
+
+	/**
+	 * Adds an instance of {@link QuadraticBezierCurve} to the path by connecting
+	 * the current point with the given one.
+	 *
+	 * @param {number} aCPx - The x coordinate of the control point.
+	 * @param {number} aCPy - The y coordinate of the control point.
+	 * @param {number} aX - The x coordinate of the end point.
+	 * @param {number} aY - The y coordinate of the end point.
+	 * @return {ShapePath} A reference to this shape path.
+	 */
+	quadraticCurveTo( aCPx, aCPy, aX, aY ) {
+
+		this.currentPath.quadraticCurveTo( aCPx, aCPy, aX, aY );
+
+		return this;
+
+	}
+
+	/**
+	 * Adds an instance of {@link CubicBezierCurve} to the path by connecting
+	 * the current point with the given one.
+	 *
+	 * @param {number} aCP1x - The x coordinate of the first control point.
+	 * @param {number} aCP1y - The y coordinate of the first control point.
+	 * @param {number} aCP2x - The x coordinate of the second control point.
+	 * @param {number} aCP2y - The y coordinate of the second control point.
+	 * @param {number} aX - The x coordinate of the end point.
+	 * @param {number} aY - The y coordinate of the end point.
+	 * @return {ShapePath} A reference to this shape path.
+	 */
+	bezierCurveTo( aCP1x, aCP1y, aCP2x, aCP2y, aX, aY ) {
+
+		this.currentPath.bezierCurveTo( aCP1x, aCP1y, aCP2x, aCP2y, aX, aY );
+
+		return this;
+
+	}
+
+	/**
+	 * Adds an instance of {@link SplineCurve} to the path by connecting
+	 * the current point with the given list of points.
+	 *
+	 * @param {Array<Vector2>} pts - An array of points in 2D space.
+	 * @return {ShapePath} A reference to this shape path.
+	 */
+	splineThru( pts ) {
+
+		this.currentPath.splineThru( pts );
+
+		return this;
+
+	}
+
+	/**
+	 * Converts the paths into an array of shapes.
+	 *
+	 * @return {Array<Shape>} An array of shapes.
+	 */
+	toShapes() {
+
+		// Point-in-polygon test using the even-odd ray-casting rule. Valid for
+		// simple (non self-intersecting) polygons.
+		function pointInPolygon( p, polygon ) {
+
+			let inside = false;
+			const n = polygon.length;
+
+			for ( let i = 0, j = n - 1; i < n; j = i ++ ) {
+
+				const a = polygon[ i ];
+				const b = polygon[ j ];
+
+				if ( ( a.y > p.y ) !== ( b.y > p.y ) &&
+							p.x < ( b.x - a.x ) * ( p.y - a.y ) / ( b.y - a.y ) + a.x ) {
+
+					inside = ! inside;
+
+				}
+
+			}
+
+			return inside;
+
+		}
+
+		// Returns a point guaranteed to be strictly inside the given simple
+		// polygon. First tries the bounding-box center; if that falls outside
+		// the polygon, casts a horizontal ray at the center's y and picks the
+		// midpoint between the first two sorted intercepts.
+		//
+		// Port of paper.js' Path#getInteriorPoint()
+		// https://github.com/paperjs/paper.js/blob/develop/src/path/PathItem.Boolean.js
+		function getInteriorPoint( polygon, boundingBox ) {
+
+			const point = boundingBox.getCenter( new Vector2() );
+
+			if ( pointInPolygon( point, polygon ) ) return point;
+
+			const y = point.y;
+			const intercepts = [];
+			const n = polygon.length;
+
+			for ( let i = 0; i < n; i ++ ) {
+
+				const a = polygon[ i ];
+				const b = polygon[ ( i + 1 ) % n ];
+
+				// Half-open crossing rule — counts each vertex exactly once and
+				// skips horizontal edges.
+				if ( ( a.y > y ) !== ( b.y > y ) ) {
+
+					const x = a.x + ( y - a.y ) * ( b.x - a.x ) / ( b.y - a.y );
+					intercepts.push( x );
+
+				}
+
+			}
+
+			if ( intercepts.length > 1 ) {
+
+				intercepts.sort( ( a, b ) => a - b );
+				point.x = ( intercepts[ 0 ] + intercepts[ 1 ] ) / 2;
+
+			}
+
+			return point;
+
+		}
+
+		// Resolve fill-rule. Defaults to 'nonzero'.
+		let fillRule = ( this.userData.style && this.userData.style.fillRule ) || 'nonzero';
+
+		if ( fillRule !== 'nonzero' && fillRule !== 'evenodd' ) {
+
+			warn( 'Fill-rule "' + fillRule + '" is not supported, falling back to "nonzero".' );
+			fillRule = 'nonzero';
+
+		}
+
+		// Predicate that decides whether a winding number falls inside the fill
+		// region, per the SVG fill-rule spec. Works for negative windings too,
+		// because JavaScript's bitwise AND preserves odd/even under two's
+		// complement.
+		const isInside = fillRule === 'nonzero'
+			? ( w => w !== 0 )
+			: ( w => ( w & 1 ) !== 0 );
+
+		// Build an entry per usable subpath. Self-winding follows the standard
+		// convention used by ShapeUtils: counter-clockwise (signed area > 0)
+		// contributes +1 to the winding number at an interior point,
+		// clockwise contributes -1.
+		const entries = [];
+
+		for ( const subPath of this.subPaths ) {
+
+			const points = subPath.getPoints();
+			if ( points.length < 3 ) continue;
+
+			const area = ShapeUtils.area( points );
+			if ( area === 0 ) continue;
+
+			const boundingBox = new Box2();
+			for ( let i = 0; i < points.length; i ++ ) boundingBox.expandByPoint( points[ i ] );
+
+			entries.push( {
+				subPath: subPath,
+				points: points,
+				boundingBox: boundingBox,
+				interiorPoint: getInteriorPoint( points, boundingBox ),
+				absArea: Math.abs( area ),
+				winding: area < 0 ? -1 : 1,
+				container: null,
+				exclude: false,
+				role: null
+			} );
+
+		}
+
+		// Sort by area descending. This guarantees that any subpath that could
+		// contain `entries[i]` is located at a smaller index and has already
+		// been processed when it's entries[i]'s turn. Port of paper.js'
+		// reorientPaths() algorithm.
+		entries.sort( ( a, b ) => b.absArea - a.absArea );
+
+		// Walk already-processed entries from closest-in-size to largest,
+		// stopping at the innermost container. Accumulate the container's
+		// cumulative winding into this entry's winding so that the final value
+		// equals the winding number at this entry's interior point.
+		//
+		// A subpath only contributes to the fill boundary when crossing it
+		// actually flips the "insideness" per the fill rule; otherwise it's a
+		// redundant overlap and gets excluded to avoid double-counting.
+		for ( let i = 0; i < entries.length; i ++ ) {
+
+			const entry = entries[ i ];
+			let containerWinding = 0;
+
+			for ( let j = i - 1; j >= 0; j -- ) {
+
+				const candidate = entries[ j ];
+
+				if ( ! candidate.boundingBox.containsBox( entry.boundingBox ) ) continue;
+				if ( ! pointInPolygon( entry.interiorPoint, candidate.points ) ) continue;
+
+				entry.container = candidate.exclude ? candidate.container : candidate;
+				containerWinding = candidate.winding;
+				entry.winding += containerWinding;
+				break;
+
+			}
+
+			if ( isInside( entry.winding ) === isInside( containerWinding ) ) {
+
+				entry.exclude = true;
+
+			}
+
+		}
+
+		// Classify retained entries. An entry is an outer shape if it has no
+		// container or if its container is itself a hole (a solid nested inside
+		// a hole becomes a new top-level shape); otherwise it's a hole in its
+		// container. Entries were already sorted outermost-first, so each
+		// container's role is known by the time we look at it.
+		for ( const entry of entries ) {
+
+			if ( entry.exclude ) continue;
+			entry.role = ( entry.container === null || entry.container.role === 'hole' ) ? 'outer' : 'hole';
+
+		}
+
+		// Build Shapes for outers first, then attach holes to their container's
+		// Shape.
+		const shapes = [];
+		const shapeByEntry = new Map();
+
+		for ( const entry of entries ) {
+
+			if ( entry.exclude || entry.role !== 'outer' ) continue;
+
+			const shape = new Shape();
+			shape.curves = entry.subPath.curves;
+			shapes.push( shape );
+			shapeByEntry.set( entry, shape );
+
+		}
+
+		for ( const entry of entries ) {
+
+			if ( entry.exclude || entry.role !== 'hole' ) continue;
+
+			const shape = shapeByEntry.get( entry.container );
+			if ( ! shape ) continue;
+
+			const hole = new Path();
+			hole.curves = entry.subPath.curves;
+			shape.holes.push( hole );
+
+		}
+
+		return shapes;
+
+
+	}
+
+}
+
+/**
+ * Abstract base class for controls.
+ *
+ * @abstract
+ * @augments EventDispatcher
+ */
+class Controls extends EventDispatcher {
+
+	/**
+	 * Constructs a new controls instance.
+	 *
+	 * @param {Object3D} object - The object that is managed by the controls.
+	 * @param {?HTMLElement} domElement - The HTML element used for event listeners.
+	 */
+	constructor( object, domElement = null ) {
+
+		super();
+
+		/**
+		 * The object that is managed by the controls.
+		 *
+		 * @type {Object3D}
+		 */
+		this.object = object;
+
+		/**
+		 * The HTML element used for event listeners.
+		 *
+		 * @type {?HTMLElement}
+		 * @default null
+		 */
+		this.domElement = domElement;
+
+		/**
+		 * Whether the controls responds to user input or not.
+		 *
+		 * @type {boolean}
+		 * @default true
+		 */
+		this.enabled = true;
+
+		/**
+		 * The internal state of the controls.
+		 *
+		 * @type {number}
+		 * @default -1
+		 */
+		this.state = -1;
+
+		/**
+		 * This object defines the keyboard input of the controls.
+		 *
+		 * @type {Object}
+		 */
+		this.keys = {};
+
+		/**
+		 * This object defines what type of actions are assigned to the available mouse buttons.
+		 * It depends on the control implementation what kind of mouse buttons and actions are supported.
+		 *
+		 * @type {{LEFT: ?number, MIDDLE: ?number, RIGHT: ?number}}
+		 */
+		this.mouseButtons = { LEFT: null, MIDDLE: null, RIGHT: null };
+
+		/**
+		 * This object defines what type of actions are assigned to what kind of touch interaction.
+		 * It depends on the control implementation what kind of touch interaction and actions are supported.
+		 *
+		 * @type {{ONE: ?number, TWO: ?number}}
+		 */
+		this.touches = { ONE: null, TWO: null };
+
+	}
+
+	/**
+	 * Connects the controls to the DOM. This method has so called "side effects" since
+	 * it adds the module's event listeners to the DOM.
+	 *
+	 * @param {HTMLElement} element - The DOM element to connect to.
+	 */
+	connect( element ) {
+
+		if ( this.domElement !== null ) this.disconnect();
+
+		this.domElement = element;
+
+	}
+
+	/**
+	 * Disconnects the controls from the DOM.
+	 */
+	disconnect() {}
+
+	/**
+	 * Call this method if you no longer want use to the controls. It frees all internal
+	 * resources and removes all event listeners.
+	 */
+	dispose() {}
+
+	/**
+	 * Controls should implement this method if they have to update their internal state
+	 * per simulation step.
+	 *
+	 * @param {number} [delta] - The time delta in seconds.
+	 */
+	update( /* delta */ ) {}
+
+}
+
+/**
+ * Scales the texture as large as possible within its surface without cropping
+ * or stretching the texture. The method preserves the original aspect ratio of
+ * the texture. Akin to CSS `object-fit: contain`
+ *
+ * @param {Texture} texture - The texture.
+ * @param {number} aspect - The texture's aspect ratio.
+ * @return {Texture} The updated texture.
+ */
+function contain( texture, aspect ) {
+
+	const imageAspect = ( texture.image && texture.image.width ) ? texture.image.width / texture.image.height : 1;
+
+	if ( imageAspect > aspect ) {
+
+		texture.repeat.x = 1;
+		texture.repeat.y = imageAspect / aspect;
+
+		texture.offset.x = 0;
+		texture.offset.y = ( 1 - texture.repeat.y ) / 2;
+
+	} else {
+
+		texture.repeat.x = aspect / imageAspect;
+		texture.repeat.y = 1;
+
+		texture.offset.x = ( 1 - texture.repeat.x ) / 2;
+		texture.offset.y = 0;
+
+	}
+
+	return texture;
+
+}
+
+/**
+ * Scales the texture to the smallest possible size to fill the surface, leaving
+ * no empty space. The method preserves the original aspect ratio of the texture.
+ * Akin to CSS `object-fit: cover`.
+ *
+ * @param {Texture} texture - The texture.
+ * @param {number} aspect - The texture's aspect ratio.
+ * @return {Texture} The updated texture.
+ */
+function cover( texture, aspect ) {
+
+	const imageAspect = ( texture.image && texture.image.width ) ? texture.image.width / texture.image.height : 1;
+
+	if ( imageAspect > aspect ) {
+
+		texture.repeat.x = aspect / imageAspect;
+		texture.repeat.y = 1;
+
+		texture.offset.x = ( 1 - texture.repeat.x ) / 2;
+		texture.offset.y = 0;
+
+	} else {
+
+		texture.repeat.x = 1;
+		texture.repeat.y = imageAspect / aspect;
+
+		texture.offset.x = 0;
+		texture.offset.y = ( 1 - texture.repeat.y ) / 2;
+
+	}
+
+	return texture;
+
+}
+
+/**
+ * Configures the texture to the default transformation. Akin to CSS `object-fit: fill`.
+ *
+ * @param {Texture} texture - The texture.
+ * @return {Texture} The updated texture.
+ */
+function fill( texture ) {
+
+	texture.repeat.x = 1;
+	texture.repeat.y = 1;
+
+	texture.offset.x = 0;
+	texture.offset.y = 0;
+
+	return texture;
+
+}
+
+/**
+ * Determines how many bytes must be used to represent the texture.
+ *
+ * @param {number} width - The width of the texture.
+ * @param {number} height - The height of the texture.
+ * @param {number} format - The texture's format.
+ * @param {number} type - The texture's type.
+ * @return {number} The byte length.
+ */
+function getByteLength( width, height, format, type ) {
+
+	const typeByteLength = getTextureTypeByteLength( type );
+
+	switch ( format ) {
+
+		// https://registry.khronos.org/OpenGL-Refpages/es3.0/html/glTexImage2D.xhtml
+		case AlphaFormat:
+			return width * height;
+		case RedFormat:
+			return ( ( width * height ) / typeByteLength.components ) * typeByteLength.byteLength;
+		case RedIntegerFormat:
+			return ( ( width * height ) / typeByteLength.components ) * typeByteLength.byteLength;
+		case RGFormat:
+			return ( ( width * height * 2 ) / typeByteLength.components ) * typeByteLength.byteLength;
+		case RGIntegerFormat:
+			return ( ( width * height * 2 ) / typeByteLength.components ) * typeByteLength.byteLength;
+		case RGBFormat:
+			return ( ( width * height * 3 ) / typeByteLength.components ) * typeByteLength.byteLength;
+		case RGBAFormat:
+			return ( ( width * height * 4 ) / typeByteLength.components ) * typeByteLength.byteLength;
+		case RGBAIntegerFormat:
+			return ( ( width * height * 4 ) / typeByteLength.components ) * typeByteLength.byteLength;
+
+		// https://registry.khronos.org/webgl/extensions/WEBGL_compressed_texture_s3tc_srgb/
+		case RGB_S3TC_DXT1_Format:
+		case RGBA_S3TC_DXT1_Format:
+			return Math.floor( ( width + 3 ) / 4 ) * Math.floor( ( height + 3 ) / 4 ) * 8;
+		case RGBA_S3TC_DXT3_Format:
+		case RGBA_S3TC_DXT5_Format:
+			return Math.floor( ( width + 3 ) / 4 ) * Math.floor( ( height + 3 ) / 4 ) * 16;
+
+		// https://registry.khronos.org/webgl/extensions/WEBGL_compressed_texture_pvrtc/
+		case RGB_PVRTC_2BPPV1_Format:
+		case RGBA_PVRTC_2BPPV1_Format:
+			return ( Math.max( width, 16 ) * Math.max( height, 8 ) ) / 4;
+		case RGB_PVRTC_4BPPV1_Format:
+		case RGBA_PVRTC_4BPPV1_Format:
+			return ( Math.max( width, 8 ) * Math.max( height, 8 ) ) / 2;
+
+		// https://registry.khronos.org/webgl/extensions/WEBGL_compressed_texture_etc/
+		case RGB_ETC1_Format:
+		case RGB_ETC2_Format:
+		case R11_EAC_Format:
+		case SIGNED_R11_EAC_Format:
+			return Math.floor( ( width + 3 ) / 4 ) * Math.floor( ( height + 3 ) / 4 ) * 8;
+		case RGBA_ETC2_EAC_Format:
+		case RG11_EAC_Format:
+		case SIGNED_RG11_EAC_Format:
+			return Math.floor( ( width + 3 ) / 4 ) * Math.floor( ( height + 3 ) / 4 ) * 16;
+
+		// https://registry.khronos.org/webgl/extensions/WEBGL_compressed_texture_astc/
+		case RGBA_ASTC_4x4_Format:
+			return Math.floor( ( width + 3 ) / 4 ) * Math.floor( ( height + 3 ) / 4 ) * 16;
+		case RGBA_ASTC_5x4_Format:
+			return Math.floor( ( width + 4 ) / 5 ) * Math.floor( ( height + 3 ) / 4 ) * 16;
+		case RGBA_ASTC_5x5_Format:
+			return Math.floor( ( width + 4 ) / 5 ) * Math.floor( ( height + 4 ) / 5 ) * 16;
+		case RGBA_ASTC_6x5_Format:
+			return Math.floor( ( width + 5 ) / 6 ) * Math.floor( ( height + 4 ) / 5 ) * 16;
+		case RGBA_ASTC_6x6_Format:
+			return Math.floor( ( width + 5 ) / 6 ) * Math.floor( ( height + 5 ) / 6 ) * 16;
+		case RGBA_ASTC_8x5_Format:
+			return Math.floor( ( width + 7 ) / 8 ) * Math.floor( ( height + 4 ) / 5 ) * 16;
+		case RGBA_ASTC_8x6_Format:
+			return Math.floor( ( width + 7 ) / 8 ) * Math.floor( ( height + 5 ) / 6 ) * 16;
+		case RGBA_ASTC_8x8_Format:
+			return Math.floor( ( width + 7 ) / 8 ) * Math.floor( ( height + 7 ) / 8 ) * 16;
+		case RGBA_ASTC_10x5_Format:
+			return Math.floor( ( width + 9 ) / 10 ) * Math.floor( ( height + 4 ) / 5 ) * 16;
+		case RGBA_ASTC_10x6_Format:
+			return Math.floor( ( width + 9 ) / 10 ) * Math.floor( ( height + 5 ) / 6 ) * 16;
+		case RGBA_ASTC_10x8_Format:
+			return Math.floor( ( width + 9 ) / 10 ) * Math.floor( ( height + 7 ) / 8 ) * 16;
+		case RGBA_ASTC_10x10_Format:
+			return Math.floor( ( width + 9 ) / 10 ) * Math.floor( ( height + 9 ) / 10 ) * 16;
+		case RGBA_ASTC_12x10_Format:
+			return Math.floor( ( width + 11 ) / 12 ) * Math.floor( ( height + 9 ) / 10 ) * 16;
+		case RGBA_ASTC_12x12_Format:
+			return Math.floor( ( width + 11 ) / 12 ) * Math.floor( ( height + 11 ) / 12 ) * 16;
+
+		// https://registry.khronos.org/webgl/extensions/EXT_texture_compression_bptc/
+		case RGBA_BPTC_Format:
+		case RGB_BPTC_SIGNED_Format:
+		case RGB_BPTC_UNSIGNED_Format:
+			return Math.ceil( width / 4 ) * Math.ceil( height / 4 ) * 16;
+
+		// https://registry.khronos.org/webgl/extensions/EXT_texture_compression_rgtc/
+		case RED_RGTC1_Format:
+		case SIGNED_RED_RGTC1_Format:
+			return Math.ceil( width / 4 ) * Math.ceil( height / 4 ) * 8;
+		case RED_GREEN_RGTC2_Format:
+		case SIGNED_RED_GREEN_RGTC2_Format:
+			return Math.ceil( width / 4 ) * Math.ceil( height / 4 ) * 16;
+
+	}
+
+	throw new Error(
+		`Unable to determine texture byte length for ${format} format.`,
+	);
+
+}
+
+function getTextureTypeByteLength( type ) {
+
+	switch ( type ) {
+
+		case UnsignedByteType:
+		case ByteType:
+			return { byteLength: 1, components: 1 };
+		case UnsignedShortType:
+		case ShortType:
+		case HalfFloatType:
+			return { byteLength: 2, components: 1 };
+		case UnsignedShort4444Type:
+		case UnsignedShort5551Type:
+			return { byteLength: 2, components: 4 };
+		case UnsignedIntType:
+		case IntType:
+		case FloatType:
+			return { byteLength: 4, components: 1 };
+		case UnsignedInt5999Type:
+		case UnsignedInt101111Type:
+			return { byteLength: 4, components: 3 };
+
+	}
+
+	throw new Error( `THREE.TextureUtils: Unknown texture type ${type}.` );
+
+}
+
+/**
+ * A class containing utility functions for textures.
+ *
+ * @hideconstructor
+ */
+class TextureUtils {
+
+	/**
+	 * Scales the texture as large as possible within its surface without cropping
+	 * or stretching the texture. The method preserves the original aspect ratio of
+	 * the texture. Akin to CSS `object-fit: contain`
+	 *
+	 * @param {Texture} texture - The texture.
+	 * @param {number} aspect - The texture's aspect ratio.
+	 * @return {Texture} The updated texture.
+	 */
+	static contain( texture, aspect ) {
+
+		return contain( texture, aspect );
+
+	}
+
+	/**
+	 * Scales the texture to the smallest possible size to fill the surface, leaving
+	 * no empty space. The method preserves the original aspect ratio of the texture.
+	 * Akin to CSS `object-fit: cover`.
+	 *
+	 * @param {Texture} texture - The texture.
+	 * @param {number} aspect - The texture's aspect ratio.
+	 * @return {Texture} The updated texture.
+	 */
+	static cover( texture, aspect ) {
+
+		return cover( texture, aspect );
+
+	}
+
+	/**
+	 * Configures the texture to the default transformation. Akin to CSS `object-fit: fill`.
+	 *
+	 * @param {Texture} texture - The texture.
+	 * @return {Texture} The updated texture.
+	 */
+	static fill( texture ) {
+
+		return fill( texture );
+
+	}
+
+	/**
+	 * Determines how many bytes must be used to represent the texture.
+	 *
+	 * @param {number} width - The width of the texture.
+	 * @param {number} height - The height of the texture.
+	 * @param {number} format - The texture's format.
+	 * @param {number} type - The texture's type.
+	 * @return {number} The byte length.
+	 */
+	static getByteLength( width, height, format, type ) {
+
+		return getByteLength( width, height, format, type );
+
+	}
+
+}
+
+if ( typeof __THREE_DEVTOOLS__ !== 'undefined' ) {
+
+	__THREE_DEVTOOLS__.dispatchEvent( new CustomEvent( 'register', { detail: {
+		revision: REVISION,
+	} } ) );
+
+}
+
+if ( typeof window !== 'undefined' ) {
+
+	if ( window.__THREE__ ) {
+
+		warn( 'WARNING: Multiple instances of Three.js being imported.' );
+
+	} else {
+
+		window.__THREE__ = REVISION;
+
+	}
+
+}
+
+export { ACESFilmicToneMapping, AddEquation, AddOperation, AdditiveAnimationBlendMode, AdditiveBlending, AgXToneMapping, AlphaFormat, AlwaysCompare, AlwaysDepth, AlwaysStencilFunc, AmbientLight, AnimationAction, AnimationClip, AnimationLoader, AnimationMixer, AnimationObjectGroup, AnimationUtils, ArcCurve, ArrayCamera, ArrowHelper, AttachedBindMode, Audio, AudioAnalyser, AudioContext, AudioListener, AudioLoader, AxesHelper, BackSide, BasicDepthPacking, BasicShadowMap, BatchedMesh, BezierInterpolant, Bone, BooleanKeyframeTrack, Box2, Box3, Box3Helper, BoxGeometry, BoxHelper, BufferAttribute, BufferGeometry, BufferGeometryLoader, ByteType, Cache, Camera, CameraHelper, CanvasTexture, CapsuleGeometry, CatmullRomCurve3, CineonToneMapping, CircleGeometry, ClampToEdgeWrapping, Clock, Color, ColorKeyframeTrack, ColorManagement, Compatibility, CompressedArrayTexture, CompressedCubeTexture, CompressedTexture, CompressedTextureLoader, ConeGeometry, ConstantAlphaFactor, ConstantColorFactor, Controls, CubeCamera, CubeDepthTexture, CubeReflectionMapping, CubeRefractionMapping, CubeTexture, CubeTextureLoader, CubeUVReflectionMapping, CubicBezierCurve, CubicBezierCurve3, CubicInterpolant, CullFaceBack, CullFaceFront, CullFaceFrontBack, CullFaceNone, Curve, CurvePath, CustomBlending, CustomToneMapping, CylinderGeometry, Cylindrical, Data3DTexture, DataArrayTexture, DataTexture, DataTextureLoader, DataUtils, DecrementStencilOp, DecrementWrapStencilOp, DefaultLoadingManager, DepthFormat, DepthStencilFormat, DepthTexture, DetachedBindMode, DirectionalLight, DirectionalLightHelper, DiscreteInterpolant, DodecahedronGeometry, DoubleSide, DstAlphaFactor, DstColorFactor, DynamicCopyUsage, DynamicDrawUsage, DynamicReadUsage, EdgesGeometry, EllipseCurve, EqualCompare, EqualDepth, EqualStencilFunc, EquirectangularReflectionMapping, EquirectangularRefractionMapping, Euler, EventDispatcher, ExternalTexture, ExtrudeGeometry, FileLoader, Float16BufferAttribute, Float32BufferAttribute, FloatType, Fog, FogExp2, FramebufferTexture, FrontSide, Frustum, FrustumArray, GLBufferAttribute, GLSL1, GLSL3, GreaterCompare, GreaterDepth, GreaterEqualCompare, GreaterEqualDepth, GreaterEqualStencilFunc, GreaterStencilFunc, GridHelper, Group, HTMLTexture, HalfFloatType, HemisphereLight, HemisphereLightHelper, IcosahedronGeometry, ImageBitmapLoader, ImageLoader, ImageUtils, IncrementStencilOp, IncrementWrapStencilOp, InstancedBufferAttribute, InstancedBufferGeometry, InstancedInterleavedBuffer, InstancedMesh, Int16BufferAttribute, Int32BufferAttribute, Int8BufferAttribute, IntType, InterleavedBuffer, InterleavedBufferAttribute, Interpolant, InterpolateBezier, InterpolateDiscrete, InterpolateLinear, InterpolateSmooth, InterpolationSamplingMode, InterpolationSamplingType, InvertStencilOp, KeepStencilOp, KeyframeTrack, LOD, LatheGeometry, Layers, LessCompare, LessDepth, LessEqualCompare, LessEqualDepth, LessEqualStencilFunc, LessStencilFunc, Light, LightProbe, LightShadow, Line, Line3, LineBasicMaterial, LineCurve, LineCurve3, LineDashedMaterial, LineLoop, LineSegments, LinearFilter, LinearInterpolant, LinearMipMapLinearFilter, LinearMipMapNearestFilter, LinearMipmapLinearFilter, LinearMipmapNearestFilter, LinearSRGBColorSpace, LinearToneMapping, LinearTransfer, Loader, LoaderUtils, LoadingManager, LoopOnce, LoopPingPong, LoopRepeat, MOUSE, Material, MaterialBlending, MaterialLoader, MathUtils, Matrix2, Matrix3, Matrix4, MaxEquation, Mesh, MeshBasicMaterial, MeshDepthMaterial, MeshDistanceMaterial, MeshLambertMaterial, MeshMatcapMaterial, MeshNormalMaterial, MeshPhongMaterial, MeshPhysicalMaterial, MeshStandardMaterial, MeshToonMaterial, MinEquation, MirroredRepeatWrapping, MixOperation, MultiplyBlending, MultiplyOperation, NearestFilter, NearestMipMapLinearFilter, NearestMipMapNearestFilter, NearestMipmapLinearFilter, NearestMipmapNearestFilter, NeutralToneMapping, NeverCompare, NeverDepth, NeverStencilFunc, NoBlending, NoColorSpace, NoNormalPacking, NoToneMapping, NormalAnimationBlendMode, NormalBlending, NormalGAPacking, NormalRGPacking, NotEqualCompare, NotEqualDepth, NotEqualStencilFunc, NumberKeyframeTrack, Object3D, ObjectLoader, ObjectSpaceNormalMap, OctahedronGeometry, OneFactor, OneMinusConstantAlphaFactor, OneMinusConstantColorFactor, OneMinusDstAlphaFactor, OneMinusDstColorFactor, OneMinusSrcAlphaFactor, OneMinusSrcColorFactor, OrthographicCamera, PCFShadowMap, PCFSoftShadowMap, Path, PerspectiveCamera, Plane, PlaneGeometry, PlaneHelper, PointLight, PointLightHelper, Points, PointsMaterial, PolarGridHelper, PolyhedronGeometry, PositionalAudio, PropertyBinding, PropertyMixer, QuadraticBezierCurve, QuadraticBezierCurve3, Quaternion, QuaternionKeyframeTrack, QuaternionLinearInterpolant, R11_EAC_Format, RAD2DEG, RED_GREEN_RGTC2_Format, RED_RGTC1_Format, REVISION, RG11_EAC_Format, RGBADepthPacking, RGBAFormat, RGBAIntegerFormat, RGBA_ASTC_10x10_Format, RGBA_ASTC_10x5_Format, RGBA_ASTC_10x6_Format, RGBA_ASTC_10x8_Format, RGBA_ASTC_12x10_Format, RGBA_ASTC_12x12_Format, RGBA_ASTC_4x4_Format, RGBA_ASTC_5x4_Format, RGBA_ASTC_5x5_Format, RGBA_ASTC_6x5_Format, RGBA_ASTC_6x6_Format, RGBA_ASTC_8x5_Format, RGBA_ASTC_8x6_Format, RGBA_ASTC_8x8_Format, RGBA_BPTC_Format, RGBA_ETC2_EAC_Format, RGBA_PVRTC_2BPPV1_Format, RGBA_PVRTC_4BPPV1_Format, RGBA_S3TC_DXT1_Format, RGBA_S3TC_DXT3_Format, RGBA_S3TC_DXT5_Format, RGBDepthPacking, RGBFormat, RGBIntegerFormat, RGB_BPTC_SIGNED_Format, RGB_BPTC_UNSIGNED_Format, RGB_ETC1_Format, RGB_ETC2_Format, RGB_PVRTC_2BPPV1_Format, RGB_PVRTC_4BPPV1_Format, RGB_S3TC_DXT1_Format, RGDepthPacking, RGFormat, RGIntegerFormat, RawShaderMaterial, Ray, Raycaster, RectAreaLight, RedFormat, RedIntegerFormat, ReinhardToneMapping, RenderObjectRefreshType, RenderTarget, RenderTarget3D, RepeatWrapping, ReplaceStencilOp, ReverseSubtractEquation, ReversedDepthFuncs, RingGeometry, SIGNED_R11_EAC_Format, SIGNED_RED_GREEN_RGTC2_Format, SIGNED_RED_RGTC1_Format, SIGNED_RG11_EAC_Format, SRGBColorSpace, SRGBTransfer, Scene, ShaderMaterial, ShadowMaterial, Shape, ShapeGeometry, ShapePath, ShapeUtils, ShortType, Skeleton, SkeletonHelper, SkinnedMesh, Source, Sphere, SphereGeometry, Spherical, SphericalHarmonics3, SplineCurve, SpotLight, SpotLightHelper, Sprite, SpriteMaterial, SrcAlphaFactor, SrcAlphaSaturateFactor, SrcColorFactor, StaticCopyUsage, StaticDrawUsage, StaticReadUsage, StereoCamera, StreamCopyUsage, StreamDrawUsage, StreamReadUsage, StringKeyframeTrack, SubtractEquation, SubtractiveBlending, TOUCH, TangentSpaceNormalMap, TetrahedronGeometry, Texture, TextureLoader, TextureSource, TextureUtils, Timer, TimestampQuery, TorusGeometry, TorusKnotGeometry, Triangle, TriangleFanDrawMode, TriangleStripDrawMode, TrianglesDrawMode, TubeGeometry, UVMapping, Uint16BufferAttribute, Uint32BufferAttribute, Uint8BufferAttribute, Uint8ClampedBufferAttribute, Uniform, UniformsGroup, UniformsUtils, UnsignedByteType, UnsignedInt101111Type, UnsignedInt248Type, UnsignedInt5999Type, UnsignedIntType, UnsignedShort4444Type, UnsignedShort5551Type, UnsignedShortType, VSMShadowMap, Vector2, Vector3, Vector4, VectorKeyframeTrack, VideoFrameTexture, VideoTexture, WebGL3DRenderTarget, WebGLArrayRenderTarget, WebGLCoordinateSystem, WebGLRenderTarget, WebGPUCoordinateSystem, WebXRController, WireframeGeometry, WrapAroundEnding, ZeroCurvatureEnding, ZeroFactor, ZeroSlopeEnding, ZeroStencilOp, cloneUniforms, createCanvasElement, createElementNS, error, getByteLength, getConsoleFunction, getUnlitUniformColorSpace, isTypedArray, log, mergeUniforms, probeAsync, setConsoleFunction, warn, warnOnce, yieldToMain };
diff --git a/config/_default/config.toml b/config/_default/config.toml
index bea15ca4dee..64f88582228 100644
--- a/config/_default/config.toml
+++ b/config/_default/config.toml
@@ -14,7 +14,7 @@ baseurl = "https://forrt.org/"
 
 # Enter a copyright notice to display in the site footer.
 # To display a copyright symbol, type `&copy;`. For current year, type `{year}`.
-copyright = "&copy; {year} - FORRT > Framework for Open and Reproducible Research Training"
+copyright = "&copy; {year} FORRT – Framework for Open and Reproducible Research Training"
 
 ############################
 ## Advanced options below ##
@@ -39,7 +39,7 @@ summaryLength = 50  # Listing summary length in words. Also, see `abstract_lengt
 paginate = 10  # Number of items per page in paginated lists.
 enableEmoji = true
 footnotereturnlinkcontents = "<sup>^</sup>"
-ignoreFiles = ["\\.ipynb$", ".ipynb_checkpoints$", "\\.Rmd$", "\\.Rmarkdown$", "_files$", "_cache$"]
+ignoreFiles = ["\\.ipynb$", ".ipynb_checkpoints$", "\\.Rmd$", "\\.Rmarkdown$", "_files$", "_cache$", "\\.py$", "\\.mdOUT$"]
 
 # Workaround Hugo publishing taxonomy URLs as plurals - consistently use singular across Academic.
 [permalinks]
diff --git a/config/_default/menus.toml b/config/_default/menus.toml
index f9a783c5be9..0383c85a3cf 100644
--- a/config/_default/menus.toml
+++ b/config/_default/menus.toml
@@ -1,398 +1,619 @@
-# Navigation Links
-#   To link a homepage widget, specify the URL as a hash `#` followed by the filename of the
-#   desired widget in your `content/home/` folder.
-#   The weight parameter defines the order that the links will appear in.
-
-#[[main]]
-#  pre = "<i class='fa fa-home'></i>  "
-#  name = "Home"
-#  url = "/#1-hero"
-#  weight = 10
+# Main and footer menus, drawn by layouts/partials/doors/header.html and footer.html.
+# `group` sets the column in the opened menu; columns keep the order of their first entry.
+# An entry with no group goes in a final "More" column, so nothing can drop out of the menu.
+# Menu labels are unchanged from the previous site for now.
+# URLs have no leading slash, so that Hugo resolves them against the base URL.
 
 [[main]]
-  name = "About FORRT"  # A link title for your page.
-  url = ""  # The URL of your page.
-  weight = 10  # The position of your page in the menu.
+  name = "About FORRT"
+  url = ""
+  weight = 10
   identifier = "about"
 
 [[main]]
-  name = "About FORRT"  # A link title for your page.
-  url = "/about/us"  # The URL of your page.
-  weight = 11  # The position of your page in the menu.
+  name = "About FORRT"
+  url = "about/us"
+  weight = 11
   parent = "about"
+  [main.params]
+    group = "Who we are"
 
 [[main]]
-  name = "Awards"  # A link title for your page.
-  url = "/awards"  # The URL of your page.
-  weight = 12  # The position of your page in the menu.
+  name = "Mission & Advocacy"
+  url = "about/mission/"
+  weight = 12
   parent = "about"
+  [main.params]
+    group = "Who we are"
 
 [[main]]
-  name = "Calendar"  # A link title for your page.
-  url = "/about/get-involved/#calendar"  # The URL of your page.
-  weight = 13  # The position of your page in the menu.
+  name = "Principles"
+  url = "about/principles/"
+  weight = 13
   parent = "about"
+  [main.params]
+    group = "Who we are"
 
 [[main]]
-  name = "Charity"  # A link title for your page.
-  url = "about/charity/"  # The URL of your page.
-  weight = 14  # The position of your page in the menu.
+  name = "Steering Committee"
+  url = "about/steering-committee/"
+  weight = 14
   parent = "about"
+  [main.params]
+    group = "Who we are"
 
 [[main]]
-  name = "Cite us"  # A link title for your page.
-  url = "about/cite_us/"  # The URL of your page.
-  weight = 15  # The position of your page in the menu.
+  name = "Teams"
+  url = "about/teams/"
+  weight = 15
   parent = "about"
+  [main.params]
+    group = "Who we are"
 
 [[main]]
-  name = "Code of Conduct"  # A link title for your page.
-  url = "/coc"  # The URL of your page.
-  weight = 16  # The position of your page in the menu.
+  name = "Contributors"
+  url = "contributors"
+  weight = 16
   parent = "about"
+  [main.params]
+    group = "Who we are"
 
 [[main]]
-  name = "Community"  # A link title for your page.
-  url = "/about/community"  # The URL of your page.
-  weight = 17  # The position of your page in the menu.
+  name = "Testimonials"
+  url = "testimonials/"
+  weight = 17
   parent = "about"
+  [main.params]
+    group = "Who we are"
 
 [[main]]
-  name = "Community Map"  # A link title for your page.
-  url = "/community-map"  # The URL of your page.
-  weight = 18  # The position of your page in the menu.
+  name = "Community"
+  url = "about/community"
+  weight = 18
   parent = "about"
+  [main.params]
+    group = "Who we are"
 
 [[main]]
-  name = "Confidential Advisor & Ombuds"  # A link title for your page.
-  url = "/about/confidential-advisor-ombuds/"  # The URL of your page.
-  weight = 18.5  # The position of your page in the menu.
+  name = "Partners"
+  url = "about/partnerships/"
+  weight = 19
   parent = "about"
+  [main.params]
+    group = "Who we are"
 
 [[main]]
-  name = "Contributors"  # A link title for your page.
-  url = "/contributors"  # The URL of your page.
-  weight = 19  # The position of your page in the menu.
+  name = "Get Involved"
+  url = "about/get-involved"
+  weight = 20
   parent = "about"
+  [main.params]
+    group = "Who we are"
 
 [[main]]
-  name = "Curriculum Vitae"  # A link title for your page.
-  url = "/cv"  # The URL of your page.
-  weight = 20  # The position of your page in the menu.
+  name = "Charity"
+  url = "about/charity/"
+  weight = 21
   parent = "about"
+  [main.params]
+    group = "Governance"
 
 [[main]]
-  name = "Feedback"  # A link title for your page.
-  url = "/feedback"  # The URL of your page.
-  weight = 21  # The position of your page in the menu.
+  name = "Code of Conduct"
+  url = "coc"
+  weight = 22
   parent = "about"
+  [main.params]
+    group = "Governance"
 
 [[main]]
-  name = "FORRT Booklet"  # A link title for your page.
-  url = "https://forrt.org/booklet/"  # The URL of your page.
-  weight = 22  # The position of your page in the menu.
+  name = "Confidential Advisor & Ombuds"
+  url = "about/confidential-advisor-ombuds/"
+  weight = 23
   parent = "about"
+  [main.params]
+    group = "Governance"
 
 [[main]]
-  name = "Get Involved"  # A link title for your page.
-  url = "/about/get-involved"  # The URL of your page.
-  weight = 23  # The position of your page in the menu.
+  name = "Awards"
+  url = "awards"
+  weight = 24
   parent = "about"
+  [main.params]
+    group = "Governance"
 
 [[main]]
-  name = "Mission & Advocacy"  # A link title for your page.
-  url = "about/mission/"  # The URL of your page.
-  weight = 24  # The position of your page in the menu.
+  name = "Cite us"
+  url = "about/cite_us/"
+  weight = 25
   parent = "about"
+  [main.params]
+    group = "Governance"
 
 [[main]]
-  name = "Newsletters"  # A link title for your page.
-  url = "/newsletters"  # The URL of your page.
-  weight = 25  # The position of your page in the menu.
+  name = "CV template"
+  url = "cv"
+  weight = 26
   parent = "about"
+  [main.params]
+    group = "Governance"
 
 [[main]]
-  name = "Partners"  # A link title for your page.
-  url = "about/partnerships/"  # The URL of your page.
-  weight = 26  # The position of your page in the menu.
+  name = "Newsletters"
+  url = "newsletters"
+  weight = 27
   parent = "about"
+  [main.params]
+    group = "Stay in touch"
 
 [[main]]
-  name = "Principles"  # A link title for your page.
-  url = "/about/principles/"  # The URL of your page.
-  weight = 27  # The position of your page in the menu.
+  name = "Community Map"
+  url = "community-map"
+  weight = 28
   parent = "about"
+  [main.params]
+    group = "Stay in touch"
 
 [[main]]
-  name = "Steering Committee"  # A link title for your page.
-  url = "/about/steering-committee/"  # The URL of your page.
-  weight = 28  # The position of your page in the menu.
+  name = "Visitors"
+  url = "about/visitors"
+  weight = 29
   parent = "about"
+  [main.params]
+    group = "Stay in touch"
 
 [[main]]
-  name = "Teams"  # A link title for your page.
-  url = "about/teams/"  # The URL of your page.
-  weight = 29  # The position of your page in the menu.
+  name = "Feedback"
+  url = "feedback"
+  weight = 30
   parent = "about"
+  [main.params]
+    group = "Stay in touch"
 
 [[main]]
-  name = "Testimonials"  # A link title for your page.
-  url = "/testimonials/"  # The URL of your page.
-  weight = 30  # The position of your page in the menu.
+  name = "FORRT Booklet"
+  url = "booklet/"
+  weight = 31
   parent = "about"
+  [main.params]
+    group = "Stay in touch"
 
 [[main]]
-  name = "Visitors"  # A link title for your page.
-  url = "/about/visitors"  # The URL of your page.
-  weight = 31  # The position of your page in the menu.
+  name = "Calendar"
+  url = "about/get-involved/#calendar"
+  weight = 32
   parent = "about"
-
+  [main.params]
+    group = "Stay in touch"
 
 [[main]]
-  name = "Educational NEXUS"
-  url = "/nexus"
+  name = "Educational Nexus"
+  url = "nexus"
   weight = 30
   identifier = "nexus"
 
-  [[main]]
-    name = "About Educational Nexus"
-    url = "/nexus"
-    weight = 31
-    parent = "nexus"
-
-  [[main]]
-    name = "Adopting Principled Education"
-    url = "/adopting"
-    weight = 32
-    parent = "nexus"
-
-  [[main]]
-    name = "Best-Practice Guidelines for Psychology"
-    url = "https://forrt.org/best-practices-psychology/"
-    weight = 32.5
-    parent = "nexus"
-
-  [[main]]
-    name = "Citation Politics"
-    url = "/citation-politics"
-    weight = 33
-    parent = "nexus"
-
-  [[main]]
-    name = "Clusters"
-    url = "/clusters"
-    weight = 34
-    parent = "nexus"
-
-  [[main]]
-    name = "Disciplines"
-    url = "/disciplines"
-    weight = 34.5
-    parent = "nexus"
-
-  [[main]]
-    name = "Curated Resources"
-    url = "/resources"
-    weight = 35
-    parent = "nexus"
-
-  [[main]]
-    name = "Developing Countries & OS"
-    url = "/os-developing-world"
-    weight = 36
-    parent = "nexus"
-
-  [[main]]
-    name = "Educators' Corner"
-    url = "/educators-corner"
-    weight = 37
-    parent = "nexus"
-
-  [[main]]
-    name = "Equity in Open Science"
-    url = "/equityinos"
-    weight = 38
-    parent = "nexus"
-
-  [[main]]
-    name = "Games Portal"
-    url = "/games"
-  # url = "https://forrt.org/apps/open_research_games_portal.html"
-    weight = 39
-    parent = "nexus"
-
-  [[main]]
-    name = "Glossary"
-    url = "/glossary"
-    weight = 40
-    parent = "nexus"
-
-  [[main]]
-    name = "Impact of OS on students"
-    url = "/impact"
-    weight = 41
-    parent = "nexus"
-
-  [[main]]
-    name = "JUST-OS Chatbot"
-    url = "/just_os_chatbot"
-    weight = 41.5
-    parent = "nexus"
-
-  [[main]]
-    name = "Lesson Plans"
-    url = "/lesson-plans/"
-    weight = 42
-    parent = "nexus"
-
-  [[main]]
-    name = "Mapping OS Communities"
-    url = "/mapping_os"
-    weight = 43
-    parent = "nexus"
-
-  [[main]]
-    name = "Neurodiversity Team"
-    url = "/neurodiversity"
-    weight = 44
-    parent = "nexus"
-
-  [[main]]
-    name = "Nowhere Lab"
-    url = "/nowherelab/"
-    weight = 44.5
-    parent = "nexus"
-
-  [[main]]
-    name = "Pedagogies"
-    url = "/pedagogies"
-    weight = 45
-    parent = "nexus"
-
-  [[main]]
-    name = "Social Justice Initiatives"
-    url = "/dei"
-    weight = 47
-    parent = "nexus"
-
-  [[main]]
-    name = "Summaries"
-    url = "/summaries"
-    weight = 48
-    parent = "nexus"
-
-  [[main]]
-    name = "Syllabi Collection"
-    url = "/syllabus"
-    weight = 49
-    parent = "nexus"
-
-  [[main]]
-    name = "Teaching OS"
-    url = "/teaching_os"
-    weight = 50
-    parent = "nexus"
-
-  [[main]]
-    name = "Wheel of Privilege"
-    url = "/awop"
-    weight = 51
-    parent = "nexus"
+[[main]]
+  name = "About Educational Nexus"
+  url = "nexus"
+  weight = 31
+  parent = "nexus"
+  [main.params]
+    group = "Teach"
+
+[[main]]
+  name = "Lesson Plans"
+  url = "lesson-plans/"
+  weight = 32
+  parent = "nexus"
+  [main.params]
+    group = "Teach"
+
+[[main]]
+  name = "Syllabi Collection"
+  url = "syllabus"
+  weight = 33
+  parent = "nexus"
+  [main.params]
+    group = "Teach"
+
+[[main]]
+  name = "Pedagogies"
+  url = "pedagogies"
+  weight = 34
+  parent = "nexus"
+  [main.params]
+    group = "Teach"
+
+[[main]]
+  name = "Teaching Open Science"
+  url = "teaching_os"
+  weight = 35
+  parent = "nexus"
+  [main.params]
+    group = "Teach"
+
+[[main]]
+  name = "Adopting Principled Education"
+  url = "adopting"
+  weight = 36
+  parent = "nexus"
+  [main.params]
+    group = "Teach"
+
+[[main]]
+  name = "Educators' Corner"
+  url = "educators-corner"
+  weight = 37
+  parent = "nexus"
+  [main.params]
+    group = "Teach"
+
+[[main]]
+  name = "Best-Practice Guidelines for Psychology"
+  url = "https://forrt.org/best-practices-psychology/"
+  weight = 38
+  parent = "nexus"
+  [main.params]
+    group = "Teach"
+
+[[main]]
+  name = "Curated Resources"
+  url = "resources"
+  weight = 39
+  parent = "nexus"
+  [main.params]
+    group = "Learn"
+
+[[main]]
+  name = "Glossary"
+  url = "glossary"
+  weight = 40
+  parent = "nexus"
+  [main.params]
+    group = "Learn"
+
+[[main]]
+  name = "Summaries"
+  url = "summaries"
+  weight = 41
+  parent = "nexus"
+  [main.params]
+    group = "Learn"
+
+[[main]]
+  name = "Clusters"
+  url = "clusters"
+  weight = 42
+  parent = "nexus"
+  [main.params]
+    group = "Learn"
+
+[[main]]
+  name = "Disciplines"
+  url = "disciplines"
+  weight = 43
+  parent = "nexus"
+  [main.params]
+    group = "Learn"
+
+[[main]]
+  name = "Impact of Open Science on students"
+  url = "impact"
+  weight = 44
+  parent = "nexus"
+  [main.params]
+    group = "Learn"
+
+[[main]]
+  name = "Games Portal"
+  url = "games"
+  weight = 45
+  parent = "nexus"
+  [main.params]
+    group = "Learn"
+
+[[main]]
+  name = "JUST-OS Chatbot"
+  url = "just_os_chatbot"
+  weight = 46
+  parent = "nexus"
+  [main.params]
+    group = "Learn"
+
+[[main]]
+  name = "Social Justice Initiatives"
+  url = "dei"
+  weight = 47
+  parent = "nexus"
+  [main.params]
+    group = "Justice & Equity"
+
+[[main]]
+  name = "Equity in Open Scholarship"
+  url = "equityinos"
+  weight = 48
+  parent = "nexus"
+  [main.params]
+    group = "Justice & Equity"
+
+[[main]]
+  name = "Developing Countries & Open Science"
+  url = "os-developing-world"
+  weight = 49
+  parent = "nexus"
+  [main.params]
+    group = "Justice & Equity"
+
+[[main]]
+  name = "Team Neurodiversity"
+  url = "neurodiversity"
+  weight = 50
+  parent = "nexus"
+  [main.params]
+    group = "Justice & Equity"
+
+[[main]]
+  name = "Citation Politics"
+  url = "citation-politics"
+  weight = 51
+  parent = "nexus"
+  [main.params]
+    group = "Justice & Equity"
+
+[[main]]
+  name = "Wheel of Privilege"
+  url = "awop"
+  weight = 52
+  parent = "nexus"
+  [main.params]
+    group = "Justice & Equity"
+
+[[main]]
+  name = "Mapping Open Science Communities"
+  url = "mapping_os"
+  weight = 53
+  parent = "nexus"
+  [main.params]
+    group = "Justice & Equity"
 
+[[main]]
+  name = "Nowhere Lab"
+  url = "nowherelab/"
+  weight = 54
+  parent = "nexus"
+  [main.params]
+    group = "Justice & Equity"
 
 [[main]]
   name = "Replication Hub"
-  url = "/replication-hub"
+  url = "replication-hub"
   weight = 60
   identifier = "replications"
 
 [[main]]
   name = "About Replication Hub"
-  url = "/replication-hub"
+  url = "replication-hub"
   weight = 61
   parent = "replications"
+  [main.params]
+    group = "Track"
 
 [[main]]
-  name = "Replication Atlas"
-  url = "https://forrt.org/flora-replication-atlas/"
+  name = "Submit a replication to FLoRA"
+  url = "replication-hub/submit"
   weight = 62
   parent = "replications"
+  [main.params]
+    group = "Track"
 
 [[main]]
-  name = "Zotero Replication Checker"
-  url = "https://forrt.org/flora-zotero/"
-  weight = 63
-  parent = "replications"
-
-[[main]]
-  name = "FORRT ORE browser extension"
-  url = "https://forrt.org/chromium-extension/"
+  name = "Replication Atlas"
+  url = "https://forrt.org/flora-replication-atlas/"
   weight = 63
   parent = "replications"
+  [main.params]
+    group = "Explore"
 
 [[main]]
   name = "FReD Explorer"
-  url = "https://forrt.org/explorer"
+  url = "explorer/"
   weight = 64
   parent = "replications"
+  [main.params]
+    group = "Explore"
 
 [[main]]
   name = "FReD R-Package"
   url = "https://forrt.org/fred/index.html"
   weight = 65
   parent = "replications"
+  [main.params]
+    group = "Explore"
 
 [[main]]
-  name = "Handbook for Reproductions and Replications"
-  url = "https://forrt.org/replication-handbook/"
+  name = "Zotero Replication Checker"
+  url = "https://forrt.org/flora-zotero/"
   weight = 66
   parent = "replications"
+  [main.params]
+    group = "Explore"
 
 [[main]]
-  name = "Large-Scale Replication Projects"
-  url = "/replication-hub/large-scale-replication-projects"
+  name = "FORRT ORE browser extension"
+  url = "https://forrt.org/chromium-extension/"
   weight = 67
   parent = "replications"
-
-#[[main]]
-#  name = "Open Social Psychology by Rima-Maria Rahal"
-#  url = "https://forrt.org/open-social-psychology/"
-#  weight = 67
-#  parent = "replications"
+  [main.params]
+    group = "Explore"
 
 [[main]]
-  name = "Positive Changes from the Replication Crisis"
-  url = "/positive-changes-replication-crisis"
+  name = "Handbook for Reproductions and Replications"
+  url = "https://forrt.org/replication-handbook/"
   weight = 68
   parent = "replications"
+  [main.params]
+    group = "Conduct"
 
 [[main]]
-  name = "Replications & Reversals"
-  url = "/reversals"
+  name = "Replication Manuscript Templates"
+  url = "https://osf.io/brxtd/"
   weight = 69
   parent = "replications"
+  [main.params]
+    group = "Conduct"
 
 [[main]]
-  name = "Replication Research Journal"
-  url = "https://replicationresearch.org"
+  name = "Large-Scale Replication Projects"
+  url = "replication-hub/large-scale-replication-projects"
   weight = 70
   parent = "replications"
+  [main.params]
+    group = "Conduct"
 
 [[main]]
-  name = "Replication Manuscript Templates"
-  url = "https://osf.io/brxtd/"
+  name = "Replication Research Journal"
+  url = "https://replicationresearch.org"
   weight = 71
   parent = "replications"
+  [main.params]
+    group = "Disseminate"
 
 [[main]]
-  name = "Submit a replication to FLoRA"
-  url = "/replication-hub/submit"
+  name = "Replications & Reversals"
+  url = "reversals"
   weight = 72
   parent = "replications"
+  [main.params]
+    group = "Disseminate"
 
+[[main]]
+  name = "Positive Changes from the Replication Crisis"
+  url = "positive-changes-replication-crisis"
+  weight = 73
+  parent = "replications"
+  [main.params]
+    group = "Disseminate"
 
 [[main]]
   name = "Publications"
-  url = "/publications/"
+  url = "publications/"
   weight = 80
   identifier = "publications"
+
+# Footer columns. Labels and groupings follow the Doors design.
+[[footer]]
+  name = "Discover FORRT"
+  identifier = "discover"
+  weight = 1
+[[footer]]
+  name = "Explore"
+  identifier = "explore"
+  weight = 2
+[[footer]]
+  name = "Take part"
+  identifier = "take-part"
+  weight = 3
+
+[[footer]]
+  name = "Mission & principles"
+  url = "about/mission/"
+  weight = 1
+  parent = "discover"
+
+[[footer]]
+  name = "Teams & contributors"
+  url = "about/teams/"
+  weight = 2
+  parent = "discover"
+
+[[footer]]
+  name = "Charity & governance"
+  url = "about/charity/"
+  weight = 3
+  parent = "discover"
+
+[[footer]]
+  name = "Code of conduct"
+  url = "coc/"
+  weight = 4
+  parent = "discover"
+
+[[footer]]
+  name = "Educational Nexus"
+  url = "nexus/"
+  weight = 1
+  parent = "explore"
+
+[[footer]]
+  name = "Replication Hub"
+  url = "replication-hub/"
+  weight = 2
+  parent = "explore"
+
+[[footer]]
+  name = "Publications"
+  url = "publications/"
+  weight = 3
+  parent = "explore"
+
+[[footer]]
+  name = "News & announcements"
+  url = "post/"
+  weight = 4
+  parent = "explore"
+
+[[footer]]
+  name = "Join the discussion on Slack"
+  url = "https://join.slack.com/t/forrt/shared_invite/zt-alobr3z7-NOR0mTBfD1vKXn9qlOKqaQ"
+  weight = 1
+  parent = "take-part"
+
+[[footer]]
+  name = "Join a team"
+  url = "about/teams/"
+  weight = 2
+  parent = "take-part"
+
+[[footer]]
+  name = "Become a partner"
+  url = "about/partnerships/"
+  weight = 3
+  parent = "take-part"
+
+[[footer]]
+  name = "Ways to support FORRT"
+  url = "about/get-involved/"
+  weight = 4
+  parent = "take-part"
+
+# Social links in the footer.
+
+[[social]]
+  name = "Bluesky"
+  url = "https://bsky.app/profile/forrt.bsky.social"
+  weight = 1
+
+[[social]]
+  name = "Mastodon"
+  url = "https://mastodon.social/@FORRT"
+  weight = 2
+
+[[social]]
+  name = "LinkedIn"
+  url = "https://uk.linkedin.com/company/forrt"
+  weight = 3
+
+[[social]]
+  name = "GitHub"
+  url = "https://github.com/forrtproject"
+  weight = 4
+
+[[social]]
+  name = "OSF"
+  url = "https://osf.io/bnh7p"
+  weight = 5
+
+[[social]]
+  name = "YouTube"
+  url = "https://www.youtube.com/@forrtproject9995"
+  weight = 6
diff --git a/config/_default/params.toml b/config/_default/params.toml
index a3ebf0327be..6f1e166cb14 100644
--- a/config/_default/params.toml
+++ b/config/_default/params.toml
@@ -13,7 +13,7 @@
 #   Latest themes (may require updating): https://sourcethemes.com/academic/themes/
 #   Browse built-in themes in `themes/academic/data/themes/`
 #   Browse user installed themes in `data/themes/`
-theme = "forrt"
+theme = "doors"
 logo = "FORRT.svg"
 # Enable users to switch between day and night mode?
 day_night = false
@@ -22,11 +22,11 @@ day_night = false
 #   Latest font sets (may require updating): https://sourcethemes.com/academic/themes/
 #   Browse built-in font sets in `themes/academic/data/fonts/`
 #   Browse user installed font sets in `data/fonts/`
-font = "forrt"
+font = "doors"
 
 # Choose a font size.
 # Sizes: XS (extra small), S (small), M (medium), L (large - DEFAULT), XL (extra large)
-font_size = "L"
+font_size = "M"
 
 ############################
 ## Basic Info
@@ -332,3 +332,25 @@ plugins_js  = []
 [marketing]
   google_analytics = "G-2BTFVS6SPM"
   google_tag_manager = "G-2BTFVS6SPM"
+
+############################
+## Doors redesign
+############################
+[doors]
+  # The 3D castle on the home page. Set to false to show only the still image.
+  castle = true
+  # Pages whose tables, maps, cards or lists need the full width: their paragraphs stay at reading width.
+  wide_pages = ["/about/get-involved", "/about/visitors", "/replication-hub/large-scale-replication-projects", "/citation-politics/toolkit", "/publications", "/about/partnerships", "/contributors", "/about/community", "/about/teams", "/cv", "/manuscript", "/about/booklet", "/just_os_chatbot", "/community-map", "/lesson-plans", "/neurodiversity-lessonbank/implicit_bias", "/neurodiversity-lessonbank/masterstools", "/neurodiversity-lessonbank/diversity-and-research", "/neurodiversity-lessonbank/community-psychology-diversity", "/neurodiversity-lessonbank/generalizability", "/ai-metascience", "/syllabus", "/neurodiversity-lessonbank"]
+  # Direct actions under a tool page's title (layouts/partials/doors/page_actions.html); the first is the main one.
+  [[doors.page_actions]]
+    path = "/awop"
+    links = [{label = "Open the AWoP web app", url = "/awop_app/"}, {label = "Read the paper", url = "https://doi.org/10.31222/osf.io/af4nk_v2"}]
+  [[doors.page_actions]]
+    path = "/citation-politics"
+    links = [{label = "Open the toolkit", url = "/citation-politics/toolkit/"}, {label = "Read the paper", url = "https://doi.org/10.31222/osf.io/qjecy_v2"}]
+  [[doors.page_actions]]
+    path = "/replication-hub/flora"
+    links = [{label = "Explore FLoRA", url = "https://forrt.org/flora-explorer/"}, {label = "Look up a study", url = "https://forrt.org/flora-replication-atlas/"}, {label = "Submit a replication", url = "/replication-hub/submit/"}]
+  [[doors.page_actions]]
+    path = "/nowherelab"
+    links = [{label = "Join Nowhere Lab by email", url = "mailto:priyasilverstein@gmail.com"}, {label = "Open the Slack channel", url = "https://forrt.slack.com/archives/C0B0FKG3GH2"}]
diff --git a/content/OS-developing-world/OS-developing-world.md b/content/OS-developing-world/OS-developing-world.md
index 4a7f07bdae8..d55b2e802e2 100644
--- a/content/OS-developing-world/OS-developing-world.md
+++ b/content/OS-developing-world/OS-developing-world.md
@@ -8,7 +8,7 @@ headless = true  # This file represents a page section.
 active = true  # Activate this widget? true/false
 weight = 10  # Order that this section will appear.
 
-title = "Open Science in Developing Countries"
+title = "Open Science in the Developing World"
 subtitle = "A Collection of Practical Guides"
 
 [design]
@@ -119,11 +119,11 @@ This structure explicitly rejects a “one-size-fits-all” model of open scienc
 **Fig. 2.** Practical guide for engaging in and contributing to open science as researchers from developing countries. Researchers start with using open resources and building a solid foundation, gradually grow and adopt recommended practices according to their own pace and context, contribute to the community in various ways, and finally, become leaders in the open-science movement.
 
 
-![A conceptual illustration showing how researchers can move from individual open science practices toward community contribution and leadership, supported by shared infrastructure, collaboration, training, and grassroots networks across diverse regional and institutional contexts.](The_hidden_costs_of_best_open-science_practices.webp)
+![A circular diagram of six research steps around the FORRT and COSN logos, each listing a recommended open-science practice and its hidden costs for researchers in developing countries.](The_hidden_costs_of_best_open-science_practices.webp)
 
 **Fig. 3.** The hidden costs of “best open-science practices” for researchers in developing countries. FORRT = the Framework for Open and Reproducible Research Training; COSN = the Chinese Open Science Network; APC = article-processing cost; OA = open access.
 
-This figure synthesizes how individual actions scale into collective impact through community-led open science initiatives. It highlights the role of grassroots networks, shared infrastructure, and inclusive governance in transforming open science from a set of technical practices into a sustainable research culture. The figure reinforces the paper’s central argument that leadership in open science can emerge from diverse global contexts when supported by accessible tools and communities.
+This figure follows the steps of a research project, from generating hypotheses and designing the study to collecting and analysing data, interpreting results and publishing. For each step it names the practice usually recommended, such as preregistration, large samples, big-team science, open access and open data, and the hidden costs these practices carry for researchers in developing countries, including research topics geared to developed countries, an unconventional front-loaded workflow, extra training and time, resources for large samples, lack of standard equipment and proprietary software, unequal collaboration, article-processing charges and regional discrimination.
 
 
 ### Educational & Practical Resources
@@ -165,6 +165,7 @@ Importantly, these organizations differ in scale, disciplinary focus, governance
 
 #### Inclusion-Focused and Transnational Initiatives
 
+- **ABRIR**  
   An international consortium addressing barriers faced by researchers from developing countries in big-team and open-science collaborations. ABRIR foregrounds issues of representation, onboarding, credit, and leadership in large-scale research.
 
 - **FORRT**  
@@ -199,7 +200,7 @@ The paper also directly informs FORRT’s ongoing work on:
 
 ****Contributors****
 
-- 49 contributors will cover Open Science related topic from perspective of 12 developing countries.
+- 49 contributors covered Open Science-related topics from the perspective of 12 developing countries.
 
 <center>
 
@@ -250,7 +251,7 @@ The paper also directly informs FORRT’s ongoing work on:
 
 The open access **<font style="color:#0e2a38">publication</font>** can be found [here](https://doi.org/10.1177/25152459251357565), and the **<font style="color:#0e2a38">postprint</font>** can [be found here (osf.io/7ubk2)](http://osf.io/7ubk2). Download the supplementary material [here](https://doi.org/10.1177/25152459251357565).
 
-> Hu, C.-P., Xu, Z., Lazić, A., Bhattacharya, P., Seda, L., Hossain, S., Jeftić, A., Özdoğru, A. A., Amaral, O. B., Miljković, N., Ilchovska, Z. G., Lazarevic, L. B., Wu, H., Bao, S., Ghodke, N., Moreau, D., Elsherif, M., C., C., Ghai, S., ... Azevedo, F. (2025). **Open Science in the Developing World: A Collection of Practical Guides for Researchers in Developing Countries.** *Advances in Methods and Practices in Psychological Science*, *8*(3), 25152459251357565. [https://doi.org/10.1177/25152459251357565](https://doi.org/10.1177/25152459251357565) 
+> Hu, C.-P., Xu, Z., Lazić, A., Bhattacharya, P., Seda, L., Hossain, S., Jeftić, A., Özdoğru, A. A., Amaral, O. B., Miljković, N., Ilchovska, Z. G., Lazarevic, L. B., Bao, H. W. S., Ghodke, N., Moreau, D., Elsherif, M., C., C., Ghai, S., Carneiro, C. F. D., ... Azevedo, F. (2025). **Open Science in the Developing World: A Collection of Practical Guides for Researchers in Developing Countries.** *Advances in Methods and Practices in Psychological Science*, *8*(3), 25152459251357565. [https://doi.org/10.1177/25152459251357565](https://doi.org/10.1177/25152459251357565) 
 
 
 ### Learn more & get involved
diff --git a/content/about/_index.md b/content/about/_index.md
index 683576dce8b..3499834e47e 100644
--- a/content/about/_index.md
+++ b/content/about/_index.md
@@ -1,8 +1,9 @@
 ---
 title: "About FORRT"
+# No page of its own: /about/ redirects to /about/us/ through the alias on content/about/about/index.md.
+build:
+  render: never
+  list: always
+# Breadcrumb data still names this section; the address serves the redirect (structured-data/breadcrumbs.html).
+breadcrumb_url: "about/"
 ---
-
-<meta http-equiv="refresh" content="0; url=/about/us/">
-<script>window.location.replace("/about/us/");</script>
-
-If you are not redirected automatically, please click [here](/about/us/).
diff --git a/content/about/about/about.md b/content/about/about/about.md
index f9cc004059e..21122ffaaf6 100644
--- a/content/about/about/about.md
+++ b/content/about/about/about.md
@@ -59,7 +59,7 @@ In a nutshell, FORRT is a ***F***ramework for ***O***pen and ***R***eproducible
 
 FORRT provides a pedagogical infrastructure and open educational resources designed to support the teaching and mentoring of open and reproducible science. FORRT strives to (a) raise awareness of the pedagogical implications of open and reproducible science and its associated challenges (i.e., curricular reform, epistemological uncertainty, methods of education); (b) respond to calls to consider open scholarship as inclusive scholarship; (c) advocate for the opening and formal recognition of teaching and mentoring materials to facilitate access, discovery, and learning to those who otherwise would be educationally disenfranchised.
 
-***Here's a 5 minutes introduction to FORRT***
+***Here's a 5-minute introduction to FORRT***
 
 <br>
 
@@ -75,9 +75,9 @@ FORRT provides a pedagogical infrastructure and open educational resources desig
 
 <br>
 
-Learn more about FORRT in the interactive flipbook <a href="https://forrt.org/booklet/" class="btn btn-primary btn-lg btn-block" style="line-height:1;border-radius:6px; font-size:1.5rem;">
-  FORRT Booklet
-</a>
+Learn more about FORRT in the interactive flipbook:
+
+<a href="/booklet/" class="btn btn-primary">FORRT Booklet</a>
 
 ***Want to learn more about us?***
 
@@ -87,7 +87,7 @@ If you’re looking for **open educational resources**, please take a look at ou
 
 For more information about our **goals and values**, read our [Mission Statement](/about/mission), [Code of Conduct](/coc), and our quest towards [Principled Teaching and Mentoring](/about/principles).
 
-If you’re looking for information about who we are or our **organizational structure**, take a look the [teams that compose FORRT](/about/teams), the institutions and initiatives with which [we are partners](/about/partnerships), and [our community members](/about/community).
+If you’re looking for information about who we are or our **organizational structure**, take a look at the [teams that compose FORRT](/about/teams), the institutions and initiatives with which [we are partners](/about/partnerships), and [our community members](/about/community).
 
 Would you like to **get involved** more with FORRT? Check out our [getting involved page](/about/get-involved)!
 
@@ -102,7 +102,7 @@ Would you like to help us be or do better? Give us (anonymous) feedback in our [
 
 ### The problem
 
-* Recently, the scientific community took steps to reflect a widespread awareness of, and call for, improved practices ushering in the “credibility revolution” including higher standards of evidence, preregistration, direct replication, transparency, and openness.
+* Since the 2010s, the scientific community has taken steps to reflect a widespread awareness of, and call for, improved practices ushering in the “credibility revolution” including higher standards of evidence, preregistration, direct replication, transparency, and openness.
 * Structurally, three pillars were proposed to carry social sciences towards academic utopia:  opening scientific communication, restructuring incentives and practices, and collaborative and crowdsourced science. 
 
 However, ongoing attempts have neglected an essential aspect of the academic machinery: students. And indeed, current norms for the teaching and mentoring in higher education are rooted in the obsolete practices of bygone eras. Improving transparency and rigor of science is the responsibility of all who engage in it.
@@ -126,7 +126,7 @@ FORRT supports this endeavor through a three-pronged approach:
   <i class="fas fa-arrow-alt-circle-right text-danger fa-1.5x"></i> [FORRT’s Educational Nexus](/nexus/)  
   <i class="fas fa-arrow-alt-circle-right text-danger fa-1.5x"></i> [FORRT’s Pedagogies](/pedagogies/)
 
-3. Modifying the academic incentive structure regarding teaching and mentoring through recognition and commendations of excellent teaching and mentoring; foster social justice through the opening and democratization of scientific-educational resources to those who otherwise would be educationally disenfranchised; and building a community with existing educational initiatives and strengthening our missions, identify and reduce redundancies, and streamline the advancement of open educational practices.  
+3. Modifying the academic incentive structure regarding teaching and mentoring through recognition and commendations of excellent teaching and mentoring; fostering social justice through the opening and democratization of scientific-educational resources to those who otherwise would be educationally disenfranchised; and building a community with existing educational initiatives, strengthening our missions, identifying and reducing redundancies, and streamlining the advancement of open educational practices.  
   
   <i class="fas fa-arrow-alt-circle-right text-danger fa-1.5x"></i> [FORRT’s Toward Social Justice in Academia initiatives](/dei/)   
   <i class="fas fa-arrow-alt-circle-right text-danger fa-1.5x"></i> [FORRT's Neurodiversity Team](/neurodiversity/)   
diff --git a/content/about/about/history.md b/content/about/about/history.md
index 5c0e70edbdf..4f42e519116 100644
--- a/content/about/about/history.md
+++ b/content/about/about/history.md
@@ -86,4 +86,4 @@ date_format = "Jan 02, 2006"
  css_class = ""  
 +++
 
-This project was initiated at the [2018 meeting](https://osf.io/xa4gb/) of the [Society for the Improvement of Psychological Science](https://improvingpsych.org/) in the [“Teaching replicable and reproducible science”](https://osf.io/x7d45/) hackathon led by Kristen Lane and Heather Urry. The initial framework was developed in a subsequent working group consisting of: Flávio Azevedo, Sam Parsons, Carl Michael Galang, Kristin Lane, Lisa DeBruine, Benjamin Le, Donald Tellinghuisen, and Madeline Harms (we apologise if we have missed anybody - please let us know). If you are interested in learning about how FORRT developed and matured, [our first website is still online](https://forrt.netlify.app/). Fun fact, FORRT was 'born' in Grand Rapids, Michigan, on Sunday, June 24th, 2018, at approximately 4pm local time.
\ No newline at end of file
+This project was initiated at the [2018 meeting](https://osf.io/xa4gb/) of the [Society for the Improvement of Psychological Science](https://improvingpsych.org/) in the [“Teaching replicable and reproducible science”](https://osf.io/x7d45/) hackathon led by Kristin Lane and Heather Urry. The initial framework was developed in a subsequent working group consisting of: Flávio Azevedo, Sam Parsons, Carl Michael Galang, Kristin Lane, Lisa DeBruine, Benjamin Le, Donald Tellinghuisen, and Madeline Harms (we apologise if we have missed anybody - please let us know). If you are interested in learning about how FORRT developed and matured, [our first website is still online](https://forrt.netlify.app/). Fun fact, FORRT was 'born' in Grand Rapids, Michigan, on Sunday, June 24th, 2018, at approximately 4pm local time.
\ No newline at end of file
diff --git a/content/about/about/index.md b/content/about/about/index.md
index 069eb668260..10a26bf7380 100644
--- a/content/about/about/index.md
+++ b/content/about/about/index.md
@@ -4,4 +4,5 @@ type = "widget_page"
 headless = false  # Homepage is headless, other widget pages are not.
 title = "About us"
 url = "/about/us"
+aliases = ["/about/"]
 +++
diff --git a/content/about/booklet/_index.md b/content/about/booklet/_index.md
index a1ac6e9b029..6a50ffad404 100644
--- a/content/about/booklet/_index.md
+++ b/content/about/booklet/_index.md
@@ -3,12 +3,11 @@ title = "FORRT Booklet"
 type = "widget_page"
 headless = false
 url = "/booklet"
+summary = "Learn more about FORRT in the interactive flipbook below: If you prefer, you can also download the PDF directly."
 +++
 
 Learn more about FORRT in the interactive flipbook below:
 
 {{< dearflip id="forrt-booklet" pdf="/files/FORRT_Booklet(A5).pdf" >}}
 
-If you prefer, you can also [download the PDF directly](/files/FORRT_Booklet(A5).pdf).
-
 ---
diff --git a/content/about/charity/index.md b/content/about/charity/index.md
index 9fdfd6a05aa..3f1fc46fb96 100644
--- a/content/about/charity/index.md
+++ b/content/about/charity/index.md
@@ -4,4 +4,5 @@ type = "widget_page"
 headless = false  # Homepage is headless, other widget pages are not.
 title="FORRT Germany e.V."
 url = "/about/charity"
+aliases = ["/about/charity/gep/"]
 +++
diff --git a/content/about/confidential-advisor-ombuds/confidential-advisor-ombuds.md b/content/about/confidential-advisor-ombuds/confidential-advisor-ombuds.md
index 47ed1e9c32d..43de2c3a6d9 100644
--- a/content/about/confidential-advisor-ombuds/confidential-advisor-ombuds.md
+++ b/content/about/confidential-advisor-ombuds/confidential-advisor-ombuds.md
@@ -71,7 +71,7 @@ FORRT community members can contact the Confidential Advisor via email at: [conf
 ## Ombuds
 
 <div style="display:flex;align-items:center;gap:1rem;margin-bottom:1.5rem;">
-  <img src="/authors/thomasrhysevans/avatar.webp" alt="Thomas Rhys Evans" class="avatar-circle" style="width:80px;height:80px;object-fit:cover;flex-shrink:0;">
+  <img src="/authors/thomas-rhys-evans/avatar.webp" alt="Thomas Rhys Evans" class="avatar-circle" style="width:80px;height:80px;object-fit:cover;flex-shrink:0;">
   <div style="text-align:left;">
     <strong>Thomas Rhys Evans</strong><br>
     <a href="mailto:ombuds@forrt.org">ombuds@forrt.org</a>
diff --git a/content/about/get-involved/about.md b/content/about/get-involved/about.md
index 164cda946a6..29eed864568 100644
--- a/content/about/get-involved/about.md
+++ b/content/about/get-involved/about.md
@@ -5,10 +5,10 @@
 widget = "blank"  # See https://sourcethemes.com/academic/docs/page-builder/
 headless = true  # This file represents a page section.
 active = true  # Activate this widget? true/false
-weight = 20  # Order that this section will appear.
+weight = 12  # Order that this section will appear.
 
-title = "In-depth introduction to FORRT"
-subtitle = "*In pursuit of the best conceivable educational practices in higher education*"
+title = "About FORRT"
+subtitle = ""
 classtitle = ""
 
 [design]
@@ -53,16 +53,16 @@ classtitle = ""
 
 +++
 
-If you are looking to a deep dive into FORRT, there are two main ways to learn about us. If you are interested in learning about what we do, check out our [**Publications page**](/publications). If you want to learn about the intricacies of the FORRT organization, beyond what you can learn from the several pages in our *About FORRT* pages, and before [joining our Slack](https://join.slack.com/t/forrt/shared_invite/zt-alobr3z7-NOR0mTBfD1vKXn9qlOKqaQ), we prepared a document for you: [**Getting Started with FORRT**](https://docs.google.com/document/d/17ECRs6J8spO3CU6siheGL8weQ-TzdyAUpXIiIE8cUeI). It is organized in terms of involvement with the FORRT organization. 
+FORRT is a community of researchers and educators who develop, share and teach open scholarship, and who work to make science more rigorous, more transparent and more just. Most of its work happens in teams and projects that coordinate on [Slack](https://join.slack.com/t/forrt/shared_invite/zt-alobr3z7-NOR0mTBfD1vKXn9qlOKqaQ).
 
-* In part (1), we briefly describe general information about FORRT, its Slack channels and community, and provide links to resources; 
-* In part (2), we describe in more detail the current initiatives at FORRT, which would benefit from your help and contribution (with authorship opportunities but no required involvement with the organization per se;
-* In part (3), we describe the FORRT’s organization, structure, and how to take part in it.
+{{% callout title="Getting Started with FORRT" %}}
 
-Check it out! 
+Before you join, read our guide, [**Getting Started with FORRT**](https://docs.google.com/document/d/e/2PACX-1vR_OKOxDlrbPcXn6SZLYlq19139ofcYDInBu9E392jWG5yzbp2VjF7E1_fwtzTz4Wxo9i4ddHZTbHfT/pub). It is organised by how involved you want to be:
 
-{{% alert note %}}
+1. General information about FORRT, its Slack channels and community, with links to resources.
+2. The current initiatives that would benefit from your help, with authorship opportunities and no required involvement in the organisation.
+3. How FORRT is organised, and how to take part in running it.
 
-[***"Getting Started with FORRT"***](https://docs.google.com/document/d/e/2PACX-1vR_OKOxDlrbPcXn6SZLYlq19139ofcYDInBu9E392jWG5yzbp2VjF7E1_fwtzTz4Wxo9i4ddHZTbHfT/pub)
+{{% /callout %}}
 
-{{% /alert %}}
+To see what FORRT does, browse the [publications](/publications/). Its aims are on [Mission & advocacy](/about/mission/) and [Principles](/about/principles/), and the people behind it on [Teams](/about/teams/) and [Steering Committee](/about/steering-committee/).
diff --git a/content/about/get-involved/calendar.md b/content/about/get-involved/calendar.md
index d102fad2ceb..1b79ca607b7 100644
--- a/content/about/get-involved/calendar.md
+++ b/content/about/get-involved/calendar.md
@@ -7,7 +7,7 @@ headless = true  # This file represents a page section.
 active = true  # Activate this widget? true/false
 weight = 50  # Order that this section will appear.
 
-title = "Community calendar <br><br>"
+title = "Community calendar"
 subtitle = ""
 classtitle = "text-center"
 
@@ -53,4 +53,4 @@ classtitle = "text-center"
 
 +++
 
-{{< click_to_load src="https://calendar.google.com/calendar/embed?src=forrtproject%40gmail.com&ctz=Europe%2FBerlin" provider="Google Calendar" label="This calendar" style="border: 0" width="100%" height="600" >}}
\ No newline at end of file
+{{< click_to_load src="https://calendar.google.com/calendar/embed?src=forrtproject%40gmail.com&ctz=Europe%2FBerlin&mode=AGENDA" provider="Google Calendar" label="This calendar" title="FORRT community calendar" style="border: 0" width="100%" height="600" >}}
\ No newline at end of file
diff --git a/content/about/get-involved/get-involved.md b/content/about/get-involved/get-involved.md
index 7616406b517..dbacdeff45d 100644
--- a/content/about/get-involved/get-involved.md
+++ b/content/about/get-involved/get-involved.md
@@ -2,12 +2,10 @@
 widget = "blank"  # See https://sourcethemes.com/academic/docs/page-builder/
 headless = true  # This file represents a page section.
 active = true  # Activate this widget? true/false
-weight = 20  # Order that this section will appear.
+weight = 15  # Order that this section will appear.
 
 title = "Ongoing Projects"
-subtitle = """*Join the movement for better education*
----
-"""
+subtitle = ""
 
 [design]
   columns = "1"
diff --git a/content/about/get-involved/index.md b/content/about/get-involved/index.md
index ca70956d17d..49a686819c6 100644
--- a/content/about/get-involved/index.md
+++ b/content/about/get-involved/index.md
@@ -3,5 +3,7 @@
 type = "widget_page"
 headless = false  # Homepage is headless, other widget pages are not.
 title = "Get Involved"
+# The meta description; the page body opens with link cards, which would run together.
+summary = "Join FORRT's Slack, where most of FORRT's work and conversation happens, find a project looking for collaborators, or get the newsletter. We use Slack to keep everyone up to date, share resources, coordinate teams and projects, and discuss FORRT's organisation and mission."
 # url = "/get-involved"
 +++
diff --git a/content/about/get-involved/intro.md b/content/about/get-involved/intro.md
index f54104d483d..c39989c3233 100644
--- a/content/about/get-involved/intro.md
+++ b/content/about/get-involved/intro.md
@@ -53,6 +53,11 @@ classtitle = ""
 
 +++
 
-The majority of FORRT's operations are done via our [Slack channel](https://join.slack.com/t/forrt/shared_invite/zt-alobr3z7-NOR0mTBfD1vKXn9qlOKqaQ). We use Slack to keep everyone up-to-date, to share interesting resources, coordinate FORRT teams, announce FORRT projects, build community, and to provide a platform for ongoing discussions on our projects, organization, and mission. [***You can join FORRT's Slack here***.](https://join.slack.com/t/forrt/shared_invite/zt-alobr3z7-NOR0mTBfD1vKXn9qlOKqaQ)
+{{< action_cards area="com" >}}
+Join our Slack | Where most of FORRT's work and conversation happens | https://join.slack.com/t/forrt/shared_invite/zt-alobr3z7-NOR0mTBfD1vKXn9qlOKqaQ
+Find a project | Initiatives looking for collaborators right now | #get-involved
+Get the newsletter | News, events and opportunities, in your inbox | #newsletter
+{{< /action_cards >}}
 
----
\ No newline at end of file
+
+We use Slack to keep everyone up to date, share resources, coordinate teams and projects, and discuss FORRT's organisation and mission.
diff --git a/content/about/mission/about.md b/content/about/mission/about.md
index bc0bec439d7..f7a82906991 100644
--- a/content/about/mission/about.md
+++ b/content/about/mission/about.md
@@ -70,14 +70,14 @@ classtitle = ""
 * Create and maintain a space for educators to provide and receive support around best practices in teaching and mentorship
 * Support scholars in their efforts to stay up-to-date on best practices regarding open and reproducible research
 * Advocate for greater support and institutional recognition of the value in teaching and mentoring
-* Facilitating conversations about the ethics and social impact of teaching substantive topics with due regard to scientific openness, epistemic uncertainty and the credibility revolution.  
+* Facilitate conversations about the ethics and social impact of teaching substantive topics with due regard to scientific openness, epistemic uncertainty and the credibility revolution.  
 * Foster social justice through the democratization of scientific educational resources and pedagogies.
 
 <br>
 <br>
 
 
-## FORRT’s Advocacy include:
+## FORRT’s Advocacy includes:
 
 * The elevation and legitimization of educators’ roles throughout institutions and professional organizations; 
 * Dismantling hierarchies surrounding research, teaching, and service; 
diff --git a/content/about/partnerships/partnerships.md b/content/about/partnerships/partnerships.md
index 4d6aad2fab0..5e76296aff4 100644
--- a/content/about/partnerships/partnerships.md
+++ b/content/about/partnerships/partnerships.md
@@ -9,7 +9,7 @@ active = true  # Activate this widget? true/false
 weight = 20  # Order that this section will appear.
 
 title = "Institutional Partnerships"
-subtitle = "<br>*FORRT is indebted to many organizations which lent their support to our organization. We list below our formal partners, which not only are sources of inspiration but share our mission to help promote systemic change towards integration open and reproducible science into higher education.*"
+subtitle = "<br>*FORRT is indebted to many organizations which lent their support to our organization. We list below our formal partners, which not only are sources of inspiration but share our mission to help promote systemic change towards integration of open and reproducible science into higher education.*"
 
 classtitle = "text-center"
 
@@ -98,4 +98,4 @@ __*Meta-psychology special issue*__
 
 __*Center for Open Science - OSKB & COSGN*__
 
-&nbsp;&nbsp;&nbsp;&nbsp; We are partnering up with [OSKB](https://cos.io/oskb) ([Open Science Knowledge Base](https://cos.io/oskb)) to coordinate the alignment of our meta-data on educational materials so that we share our resources and community. To that end, FORRT will have a community in OSKB's home ([OER Commons](https://www.oercommons.org/)) and enrich data and reduced redundant work. FORRT also joined COS network-of-networks or [Community of Open Scholarship Grassroots Networks](https://groups.google.com/a/cos.io/forum/#!topic/network-of-open-science-grassroots-networks/1OWtx9VDSwo) ([COSGN](https://groups.google.com/a/cos.io/forum/#!topic/network-of-open-science-grassroots-networks/1OWtx9VDSwo)). These partnerships aim to help build a community of existing educational initiatives, strengthening our missions, and streamline the advancement of open and reproducible educational practices.
+&nbsp;&nbsp;&nbsp;&nbsp; We are partnering up with [OSKB](https://cos.io/oskb) ([Open Science Knowledge Base](https://cos.io/oskb)) to coordinate the alignment of our meta-data on educational materials so that we share our resources and community. To that end, FORRT will have a community in OSKB's home ([OER Commons](https://www.oercommons.org/)) and enrich data and reduce redundant work. FORRT also joined COS network-of-networks or [Community of Open Scholarship Grassroots Networks](https://groups.google.com/a/cos.io/forum/#!topic/network-of-open-science-grassroots-networks/1OWtx9VDSwo) ([COSGN](https://groups.google.com/a/cos.io/forum/#!topic/network-of-open-science-grassroots-networks/1OWtx9VDSwo)). These partnerships aim to help build a community of existing educational initiatives, strengthen our missions, and streamline the advancement of open and reproducible educational practices.
diff --git a/content/about/principles/principles.md b/content/about/principles/principles.md
index 9e13d4cbe60..3ea664fee94 100644
--- a/content/about/principles/principles.md
+++ b/content/about/principles/principles.md
@@ -77,10 +77,10 @@ We believe it is of utmost importance to communicate the facts of science relati
  
 Central to the academic ethos, the relationship between mentor and mentee is one of scientific genesis, incremental contributions, and personal and professional development. This academic experience is optimized when students feel they can contribute to the supervisor’s research and the product of this contribution is valued. One way to achieve this is to expose students to  the intricacies and procedures of science making, including the flaws and merits of any given research approach. Open and reproducible tenets serve an important role in mentorship pedagogy.
 
-**Advantages of principle mentoring**:
+**Advantages of principled mentoring**:
 
 * it enables students to see their work and efforts serve a meaningful practical purpose: to aggregate and positively impact the scientific community
 * it breeds an atmosphere of constructive curiosity and problem-solving; 
-* it endows students with the ability to discover on their own the myriad of ways their skill set and ability can be integrated into the research * process. 
+* it endows students with the ability to discover on their own the myriad of ways their skill set and ability can be integrated into the research process. 
 * it helps shatter the academic glass ceiling and promote engagement with the academic profession.
 * it galvanizes and accelerates the dissemination of reliable, rigorous, replicable, open, reproducible science to a previously uninformed population: undergraduate and graduate students.
\ No newline at end of file
diff --git a/content/about/teams/teams.md b/content/about/teams/teams.md
index 4746de9d6fc..27562376ee2 100644
--- a/content/about/teams/teams.md
+++ b/content/about/teams/teams.md
@@ -68,6 +68,16 @@ subtitle = "---"
   description = "Responsible for curating FORRT resources, enriching its quality and metadata, interconnecting FORRT initiatives, and gathering and collecting resources, all focusing on teaching materials and informing curriculum."
   color = "#395855" # Background color under the image
 
+[[featurealt]]
+  img = "team/pedagogies.svg" #icon OR img that you should put in 
+  imgalttext = "Presenter pointing at a board in front of a seated audience" # Describe the image in words for screen-reader users. 
+  imgside = "left" # image will appear left or right
+  buttonurl = "https://forrt.slack.com/archives/C06J82GU6JH"
+  buttondescr = "Join Us"
+  name = "Team Curriculum" # Title
+  description = "Develops open and reproducible lecture materials and supports the integration of principled education into university curricula."
+  color = "#395855" # Background color under the image
+
 [[featurealt]]
   # icon = "slack"
   # icon_pack = "fab"
@@ -94,19 +104,6 @@ subtitle = "---"
   description = "Oversight of FORRT projects to facilitate working across groups and consistency across projects. Enhance connection between FORRT teams and initiatives."
   color = "#395855" # Background color under the image
 
-[[featurealt]]
-  # icon = "slack"
-  # icon_pack = "fab"
-  # iconalttext = "Slack"
-  img = "team/database.svg" #icon OR img that you should put in 
-  imgalttext = "Stacked database cylinders" # Describe the image in words for screen-reader users. 
-  imgside = "left" # image will appear left or right
-  buttonurl = "https://forrt.slack.com/archives/C0190S42M1N"
-  buttondescr = "Join Us"
-  name = "Team Database" # Title
-  description = "Team responsible for any and all issues related to the FORRT curated list of resources, enriching the meta-data of existing resources, gathering and collecting resources, with a focus on teaching materials."
-  color = "#395855" # Background color under the image
-
 [[featurealt]]
   # icon = "slack"
   # icon_pack = "fab"
@@ -207,7 +204,7 @@ subtitle = "---"
   imgside = "left" # image will appear left or right
   buttonurl = "https://join.slack.com/t/forrt/shared_invite/zt-alobr3z7-NOR0mTBfD1vKXn9qlOKqaQ"
   buttondescr = "Join Us"
-  name = "Team Mapping Open Science Organizations" # Title
+  name = "Team Mapping Open Science Communities" # Title
   description = "Aims to systematically identify, map, and connect Open Science (OS) organizations across disciplines and regions."
   color = "#395855" # Background color under the image
 
@@ -221,7 +218,7 @@ subtitle = "---"
   buttonurl = "https://join.slack.com/t/forrt/shared_invite/zt-alobr3z7-NOR0mTBfD1vKXn9qlOKqaQ"
   buttondescr = "Join Us"
   name = "Team Open Science in Developing Countries" # Title
-  description = "Will develop a paper that discusses the practical and methodological barriers, opportunities, and potential pitfalls of Open Science in developing countries."
+  description = "Developed a paper, [published in *Advances in Methods and Practices in Psychological Science*](https://doi.org/10.1177/25152459251357565), that discusses the practical and methodological barriers, opportunities, and potential pitfalls of Open Science in developing countries."
   color = "#395855" # Background color under the image
 
 
@@ -261,9 +258,9 @@ subtitle = "---"
   imgalttext = "Document page with lines of text" # Describe the image in words for screen-reader users. 
   imgside = "left" # image will appear left or right
   buttonurl = "" # leave empty/commentout if you don't want a button or comment it out
-  buttondescr = "Join Us" # leave empty if you don't want a button
+  buttondescr = "" # leave empty if you don't want a button
   name = "Team Manuscript" # Title
-  description = "Develop and update the FORRT preprint into a manuscript ready for submission (FORRT's next top priority)."
+  description = "Develop and update the FORRT preprint into a manuscript ready for submission."
   color = "#395855" # Background color under the image
 
 
@@ -330,7 +327,7 @@ subtitle = "---"
   img = "team/website.svg" #icon OR img that you should put in 
   imgalttext = "Laptop screen showing a globe" # Describe the image in words for screen-reader users. 
   imgside = "left" # image will appear left or right
-  buttonurl = "https://forrt.slack.com/archives/C017W8Y9C87"
+  buttonurl = "https://forrt.slack.com/archives/C080N39QRJ9"
   buttondescr = "Join Us"
   name = "Team Website" # Title
   description = "Team responsible for any and all issues related to the website (e.g., maintenance, add/change content, ideas about pages or blogs, inclusion of recently produced content, correction of typos, etc.)."
@@ -382,4 +379,4 @@ subtitle = "---"
 
 +++
 
-Teams serve three key purposes: (a) advancing the adoption of open and reproducible science tenets in higher-education via the training of educators in their capacity as teachers and mentors; (b) increase of community engagement within our internal and external communities and resource gathering; (c) and providing community members with hands-on experiences of the challenges and rewards of peer-to-peer collaboration in the context of busy professional lives. Below you find the team organized alphabetically as it is the same order as in Slack.
+Teams serve three key purposes: (a) advancing the adoption of open and reproducible science tenets in higher-education via the training of educators in their capacity as teachers and mentors; (b) increasing community engagement within our internal and external communities and resource gathering; (c) providing community members with hands-on experiences of the challenges and rewards of peer-to-peer collaboration in the context of busy professional lives. Below you find our teams.
diff --git a/content/about/visitors/index.md b/content/about/visitors/index.md
index 1fe894ece02..74f404dfbf8 100644
--- a/content/about/visitors/index.md
+++ b/content/about/visitors/index.md
@@ -1,5 +1,6 @@
 ---
 title: "Visitors"
+summary: "Where forrt.org's visitors come from and which pages they read, over the past 30 days and the past year."
 type: "page"
 ---
 
diff --git a/content/adopting/adopting.md b/content/adopting/adopting.md
index b27e0e2fdbb..7bccc5089c2 100644
--- a/content/adopting/adopting.md
+++ b/content/adopting/adopting.md
@@ -54,7 +54,7 @@ classtitle = "text-center"
 
 ---
 
-> In this page, we describe easy ways to adopt principled teaching and mentoring practices. That is, (a) integrating open and reproducible science tenets into your teaching workflow; (b) striving to teach science (or scholarship) as a process of knowledge acquisition rather than a collection of scientific evidence, as doing so does not yield scientific literacy; (c) share publicly your teaching and mentoring (and Lab) materials so that other educators can make use of your excellent work, which also foster social justice through the democratization of scientific educational resources and pedagogies; (d) recognize that Higher Education is a profoundly unequal, non-inclusive and non-diverse environment due to a plethora of societal constraints, which also shapes academia itself, and which we as educators should try to address in class (whatever the subject taught) by integrating course content with topics of representation, diversity, equity, and inclusion. See below for 7 ways FORRT tips.
+> In this page, we describe easy ways to adopt principled teaching and mentoring practices. That is, (a) integrating open and reproducible science tenets into your teaching workflow; (b) striving to teach science (or scholarship) as a process of knowledge acquisition rather than a collection of scientific evidence, as doing so does not yield scientific literacy; (c) share publicly your teaching and mentoring (and Lab) materials so that other educators can make use of your excellent work, which also foster social justice through the democratization of scientific educational resources and pedagogies; (d) recognize that Higher Education is a profoundly unequal, non-inclusive and non-diverse environment due to a plethora of societal constraints, which also shapes academia itself, and which we as educators should try to address in class (whatever the subject taught) by integrating course content with topics of representation, diversity, equity, and inclusion. See below for 8 FORRT tips.
 
 
 ## What is **Principled Education**?
@@ -87,7 +87,7 @@ classtitle = "text-center"
 
 </center>
 
-| *Please note, the following materials are offered only as examples of freely accessible educational materials; they are suggestions rather than endorsements, and in many cases there is no affiliation or relationship with the creators. Inclusion here does not imply methodological endorsement, organizational affiliation, or vetting for pedagogical quality.lease evaluate the fit, accessibility, and licensing of each resource according to your needs.* |
+| *Please note, the following materials are offered only as examples of freely accessible educational materials; they are suggestions rather than endorsements, and in many cases there is no affiliation or relationship with the creators. Inclusion here does not imply methodological endorsement, organizational affiliation, or vetting for pedagogical quality. Please evaluate the fit, accessibility, and licensing of each resource according to your needs.* |
 | :---- |
 
 ## **1. Evaluate your current teaching and mentorship practices**
@@ -95,7 +95,7 @@ classtitle = "text-center"
 A great first step is to reflect on your own current teaching and mentoring practices, and the extent to which they communicate the basic tenets of open and reproducible science.
 
 <details>
-<summary><FONT COLOR="#A9A9A9">How ?</FONT></summary>
+<summary>How?</summary>
 
 * FORRT has developed the [FORRT’s Clusters Page](https://docs.google.com/document/d/1_TRh7z3Bv_tdxGqjdWMm4kfQerTYvYw3e4wvQLNpTDQ/edit?tab=t.0#heading=h.9uywlkccaw1) that provides a framework that can be used to help educators make sense of the different key themes of open and reproducible science for independent evaluation of one’s own practices.
 
@@ -106,14 +106,14 @@ A great first step is to reflect on your own current teaching and mentoring prac
 Including sources in your syllabus that discuss open and transparent research can enrich students’ education by helping them think about research more critically. This can be a great addition to research methods courses or any other course that requires students to evaluate or synthesize knowledge.
 
 <details>
-<summary><FONT COLOR="#A9A9A9">How ?</FONT></summary>
+<summary>How?</summary>
 
 * Find suitable reading materials for your course syllabus:  
   * [FORRT’s Lesson Plans](https://forrt.org/lesson-plans) provide community-built open educational resources that can be integrated into taught courses ‘out of the box’.   
-  * [FORRT’s curated summary](https://www.google.com/url?q=https://forrt.org/summaries&sa=D&source=docs&ust=1749590843446497&usg=AOvVaw0iLok4YeafcuTUgXkpkB6b)[ies](https://forrt.org/summaries) of [100+ articles from the open and reproducible scholarship literature](https://forrt.org/summaries).   
+  * [FORRT’s curated summaries](https://forrt.org/summaries) of [100+ articles from the open and reproducible scholarship literature](https://forrt.org/summaries).   
   * FORRT’s [Open & Reproducible Science Syllabus](https://forrt.org/syllabus) provides examples that you can adapt to your course syllabus.  
   * [FORRT’s Clusters](https://forrt.org/clusters/) provide curated lists of open-scholarship literature which organize key themes into clusters and sub-clusters with recommended readings.  
-  * [ReproducibiliTea’s Reading Li](https://rpt-rl.netlify.app/)st including additional explanatory videos.   
+  * [ReproducibiliTea’s Reading List](https://rpt-rl.netlify.app/) including additional explanatory videos.   
   * [The UK Reproducibility Network (UKRN) Primers](https://www.ukrn.org/primers/) series designed to introduce important topics in open and reproducible scholarship to a broad audience which can be re-used into your course syllabus.  
 * Add activities and/or assignments where students can do things such as:  
   * Write their own pre-registration or compare a pre-registration with the published manuscript.  
@@ -121,7 +121,7 @@ Including sources in your syllabus that discuss open and transparent research ca
   * Learn more about the value of [preprints](https://journals.plos.org/plosbiology/article?id=10.1371/journal.pbio.3000151).  
   * Learn about the importance of statistical power and use [online tutorial](https://journalofcognition.org/articles/10.5334/joc.72)s to work this out for studies.   
   * Learn about the process of science and how these are used to produce knowledge by taking the free online [Science Literacy course](https://www.coursera.org/learn/science-literacy) (by Dr. Claire Scavuzzo & Dr. Rachel Buertl at Alberta University).  
-  * Share outcomes from journal club/reproducibiliTea discussions via blogs, PubPeer, or other avenues. [PubBeer](https://www.pubpeer.com) is a post publication peer review platform where researchers can anonymously share thoughts on research articles. If in a journal club you notice certain shortcomings or inconsistencies, this may be the place to publish them.  
+  * Share outcomes from journal club/reproducibiliTea discussions via blogs, PubPeer, or other avenues. [PubPeer](https://www.pubpeer.com) is a post publication peer review platform where researchers can anonymously share thoughts on research articles. If in a journal club you notice certain shortcomings or inconsistencies, this may be the place to publish them.  
   * Run a published article or preprint through [MetaCheck](https://www.scienceverse.org/metacheck/) to assess basic scientific criteria (e.g., whether retracted studies were cited, whether results are reproducible, whether OSF links are working) with the goal of evaluating the credibility, transparency, and reproducibility of the research  
   * Do a reproduction or a replication of a study  
   * Learn more about p-hacking for students using [Schönbrodt’s p-hacker](http://shinyapps.org/apps/p-hacker/).  
@@ -159,12 +159,12 @@ Including sources in your syllabus that discuss open and transparent research ca
 Open educational resources allow community members to make contributions and continuously improve the materials. For example, they can enhance their documentation, add media (transcripts, voice, video), translate materials, improve accessibility, and much more. Educators can then reuse and adapt these materials for their own courses, thus reducing the need to produce high-quality materials on their own and saving time better used for teaching and mentoring. 
 
 <details>
-<summary><FONT COLOR="#A9A9A9">How ?</FONT></summary>
+<summary>How?</summary>
 
 * Explore existing instances of principled education:   
   * [FORRT Pedagogies](https://forrt.org/pedagogies) aims to collect and catalogue exemplary instances of principled education \- i.e., successful instances of teaching or mentoring of open and reproducible principles, and detailed examples of the processes by which ideals in teaching, mentoring, and openness of these materials come to materialize.  
 * Explore existing open educational resources, and [submit your own resources](https://docs.google.com/forms/d/e/1FAIpQLSfPceN5opEeauCBSvapoB-ADpH0IoT24XOLfQGaVEF0EJGFOA/viewform) so that others can adopt them easily into their teaching.  
-  * FORRT hosts approximately [800+ curated educational resources](https://forrt.org/resources) on Open and Reproducible topics on their database.   
+  * FORRT hosts over [1,400 curated educational resources](https://forrt.org/resources) on Open and Reproducible topics on their database.   
   * The [OSKB](https://www.oercommons.org/hubs/OSKB) shares open scholarship resources created and curated by the community.  
   * Jaclyn Siegel’s document compiles a curated list of [accessible and affordable resources](https://docs.google.com/document/d/1IFbHIN5OOAO0qz-VfCU9nEx4-x6CfArj1-d8ylA2vsU/edit?tab=t.0#heading=h.q1enyigqn74f) tailored for graduate students.  
   * [ARIADNE](https://igor-biodgps.github.io/ARIADNE/) is a resource navigator with many (open-access) resources needed throughout the whole research cycle. 
@@ -206,7 +206,7 @@ Open educational resources allow community members to make contributions and con
 Educators and mentors can actively support students in exploring open and reproducible science through curated resources, experiential learning, and community engagement. This means not only sharing accessible introductory materials, but also encouraging participation in clubs, workshops, or mentorship initiatives. 
 
 <details>
-<summary><FONT COLOR="#A9A9A9">How ?</FONT></summary>
+<summary>How?</summary>
 
 * Use one of the following pedagogical resources:   
   * [‘The 4-Step Robustness Check’](https://www.metascience2019.org/presentations/michele-nuijten/) breaks down concepts of reproducibility and replicability exceedingly well:  
@@ -241,7 +241,7 @@ Educators and mentors can actively support students in exploring open and reprod
 Involving students in open science projects is an effective way to deepen their understanding of transparent and collaborative research practices. These experiences can also help them connect with like-minded researchers, gain mentorship, and build valuable skills—especially early in their academic journey.
 
 <details>
-<summary><FONT COLOR="#A9A9A9">How ?</FONT></summary>
+<summary>How?</summary>
 
 * Join Established Collaborative Projects  
   * The [Collaborative Replications and Education Project in Psychology](https://osf.io/wfc6u/wiki) supports student-led replication studies in psychology, often for dissertations, in collaboration with other universities.   
@@ -252,7 +252,7 @@ Involving students in open science projects is an effective way to deepen their
   * Helpful resources for classroom replication projects include:  
     * [ReplicationWiki – Economics and social sciences](https://blog.repec.org/2020/08/04/a-replication-database-for-economics-and-social-sciences-the-replicationwiki/): A collaborative database documenting replication attempts, methods, and outcomes in economics and social science.  
     * [Political Science Replication](https://politicalsciencereplication.wordpress.com/about/): A directory of replication studies focused on political science, promoting methodological transparency.  
-    * [Project Tier’s Learning Course Materials](https://www.projecttier.org/tier-classroom/course-materials/): Course materials on topics such as open science, data analysis and replication in empirical.  
+    * [Project Tier’s Learning Course Materials](https://www.projecttier.org/tier-classroom/course-materials/): Course materials on topics such as open science, data analysis and replication in empirical research.  
     * [FORRT workshop: Teaching the why and how of replication studies](https://forrt.org/educators-corner/004-teaching-why-how-replication/).  
     * [Brian Dillon’s Linguistics class](https://people.umass.edu/bwdillon/project/linguist-609-2020/): A graduate-level course focusing on statistical methods for analyzing linguistic and experimental data.  
     * [Replication Reports Templates](https://osf.io/8dkxc/): A collection of academic paper templates which integrate open science and replication concepts in disciplines such as Economics, Politics and Psychology.  
@@ -281,7 +281,7 @@ Involving students in open science projects is an effective way to deepen their
 Sharing your research openly helps others learn from your work. Educators can use open data and materials in their teaching—for example, in hands-on classroom activities like data analysis or mini-replication projects. This makes your work more impactful and supports student learning at both undergraduate and graduate levels.
 
 <details>
-<summary><FONT COLOR="#A9A9A9">How ?</FONT></summary>
+<summary>How?</summary>
 
 * [Open Science Framework](https://osf.io/): A popular platform where research data and materials can be easily shared and indexed.  
 * [Zenodo](http://zenodo.org/): Another trusted platform for uploading and sharing research outputs. Supports a range of file types and provides DOIs.  
@@ -303,7 +303,7 @@ Common structural barriers and how to address them:
 * Neurodiversity → predictable structure, multiple submission formats, low-sensory options.
 
 <details>
-<summary><FONT COLOR="#A9A9A9">How ?</FONT></summary>
+<summary>How?</summary>
 
 * Foster an inclusive classroom culture:  
   * Check out [Stanford’s Inclusive Teaching Guide](https://teachingcommons.stanford.edu/teaching-guides/inclusive-teaching-guide) for tips on creating equitable learning environments, supporting diverse student needs, and embedding inclusion into everyday teaching practices.  
@@ -314,14 +314,14 @@ Common structural barriers and how to address them:
   * Present scenarios in which two researchers from different backgrounds collaborate, and assign students to small groups to discuss how factors such as privilege and marginalization might influence recognition and credit. Encourage them to consider how systemic advantages can shape decisions around authorship order, funding opportunities, and collaborative dynamics. Follow with a plenary discussion to surface these insights and make visible the often-invisible ways privilege operates in academic settings.  
 * Diversify your syllabus.  
   * Use one of [FORRT’s lesson plans](https://forrt.org/neurodiversity-lessonbank/) that aim to promote Neurodiversity and Open Scholarship in Academia.   
-  * Use resources such as the [BIPOC-authored Psychology Papers spreadsheet](https://docs.google.com/spreadsheets/d/1i7Eacoyv9VVg2lBbCV-KJZg4nSGvR_VZFOysOyOGG8g/edit?fbclid=IwAR1zlaZHcY1HMYYnaa5M96aC577qDagmphf_R7EH2YXBl_P1ihJcPu9zUPM&gid=666010790#gid=666010790%20), intended for use by instructors of undergraduate/ graduate-level psychology courses to help diversify their syllabi, or [the Diversity Reading list](https://www.google.com/url?q=https://diversityreadinglist.org/about/&sa=D&source=docs&ust=1749130331285358&usg=AOvVaw1xfd6fPDUWRJ2pzNFMxdf7) offering quality texts in philosophy by authors from underrepresented groups, or [FORRT’S annotated reading list](https://forrt.org/curated_resources/point-of-view-an-annotated-introductory/) supporting readers in understanding some of the key ideas and topics within neurodiversity.  
+  * Use resources such as the [BIPOC-authored Psychology Papers spreadsheet](https://docs.google.com/spreadsheets/d/1i7Eacoyv9VVg2lBbCV-KJZg4nSGvR_VZFOysOyOGG8g/edit?fbclid=IwAR1zlaZHcY1HMYYnaa5M96aC577qDagmphf_R7EH2YXBl_P1ihJcPu9zUPM&gid=666010790#gid=666010790%20), intended for use by instructors of undergraduate/ graduate-level psychology courses to help diversify their syllabi, or [the Diversity Reading list](https://www.google.com/url?q=https://diversityreadinglist.org/about/&sa=D&source=docs&ust=1749130331285358&usg=AOvVaw1xfd6fPDUWRJ2pzNFMxdf7) offering quality texts in philosophy by authors from underrepresented groups, or [FORRT’s annotated reading list](https://forrt.org/curated_resources/point-of-view-an-annotated-introductory/) supporting readers in understanding some of the key ideas and topics within neurodiversity.  
 * Use inclusive citation practices.  
   * Consider adding a [Citation Diversity Statement](https://doi.org/10.1016/j.tics.2020.06.009) in your course materials or assignments, to acknowledge and intentionally include scholarship from diverse voices and underrepresented groups.  
   * Use [McGill’s Citation Justice Guide](https://libraryguides.mcgill.ca/citation_justice/how_to) to help students audit their citation practices and intentionally seek out diverse voices in their research. The guide offers practical tools for analyzing whose work is being cited, identifying gaps, and finding resources to include scholars from marginalized communities.   
-  * Read [FORRTs Manuscript](https://forrt.org/citation-politics/) on The Citational Justice Toolkit which offers practical guidance and tools to help researchers make more equitable and conscientious citation choices throughout the research process.  
+  * Read [FORRT’s Manuscript](https://forrt.org/citation-politics/) on The Citational Justice Toolkit which offers practical guidance and tools to help researchers make more equitable and conscientious citation choices throughout the research process.  
 * Engage with *Towards Social Justice In Academia Initiatives:*  
   * [FORRT’s remote mentorship program](https://forrt.org/dei) aims to facilitate and encourage adherence to open and reproducible research practices for (a) students from underprivileged and underrepresented backgrounds; (b) non-WEIRD; and (c) when there are no local open science friendly institutions or personnel.  
-  * [FORRT’s supporting underprivileged and underrepresented early-career researchers initiative](https://forrt.org/dei) serves as a link between willing mentors and mentees in their engagement with academia, its several duties (e.g., application materials, grant/funding proposals, academic writing, research development, statistical analyses, etc.), as well as open and reproducible science practices. It is FORRT’s goal to chip away at the barriers that exist and to promote a more inclusive environment for all (Roberson, 2020).
+  * [FORRT’s supporting underprivileged and underrepresented early-career researchers initiative](https://forrt.org/dei) serves as a link between willing mentors and mentees in their engagement with academia, its several duties (e.g., application materials, grant/funding proposals, academic writing, research development, statistical analyses, etc.), as well as open and reproducible science practices. It is FORRT’s goal to chip away at the barriers that exist and to promote a more inclusive environment for all ([Roberson, 2020](https://doi.org/10.1038/s41562-020-0926-6)).
 
 </details>
 
@@ -331,7 +331,7 @@ Common structural barriers and how to address them:
 A great way to adopt the values of principled education is to advocate in your own institution for incorporating the values of open science and transparent research into teaching.
 
 <details>
-<summary><FONT COLOR="#A9A9A9">How ?</FONT></summary>
+<summary>How?</summary>
 
 * Within your institution:  
   * If you're part of a teaching committee, suggest adding open science topics to course content, as simple as adding a slide or a real-world example.  
@@ -354,7 +354,7 @@ A great way to adopt the values of principled education is to advocate in your o
   * [The repliCATS project](https://replicats.research.unimelb.edu.au/): A collaborative initiative that engages researchers in systematically assessing reproducibility and credibility in published research, fostering methodological reflection and community learning.  
   * [Quala Lab](https://qualalab.org/): Collaborative working group finding connections between the open science movement and qualitative and mixed methods research.  
   * [Reproducibility Network](https://www.ukrn.org/global-networks/): National peer led consortium of researchers aiming to promote and ensure rigorous research practices.    
-  * [ReproducibiliTea:](https://soundcloud.com/reproducibilitea) A podcast highlighting the great work of early career researchers.
+  * [ReproducibiliTea](https://reproducibilitea.org/): A global journal club initiative that encourages students and staff to read and discuss journal articles related to open science.
 
 </details>
 
@@ -375,6 +375,6 @@ You can also submit a short contribution to FORRT’s curated database or direct
 
 * a case study
 
-Submissions can be made via the form below. Please note that contributors can get credit. We are committed to transparent and meaningful attribution. Contributors are credited using our formal crediting mechanism (Tenzing / CRediT taxonomy). When submitting via the form, you will be invited to add your details so that you can be properly credited for your contribution. We value community knowledge and aim to recognise all contributions appropriately.
+Please submit them through our [resource submission form](https://docs.google.com/forms/d/e/1FAIpQLSfPceN5opEeauCBSvapoB-ADpH0IoT24XOLfQGaVEF0EJGFOA/viewform). Please note that contributors can get credit. We are committed to transparent and meaningful attribution. Contributors are credited using our formal crediting mechanism (Tenzing / CRediT taxonomy). List yourself under Provider/Creators in the form so that you can be properly credited for your contribution. We value community knowledge and aim to recognise all contributions appropriately.
 
 {{< adopting_feedback_form >}}
diff --git a/content/ai-metascience/index.md b/content/ai-metascience/index.md
index fc75d605696..4ae904131ca 100644
--- a/content/ai-metascience/index.md
+++ b/content/ai-metascience/index.md
@@ -1,12 +1,16 @@
 ---
 title: "FORRT AI in Metascience Online Conference"
+crumb_parent: "About FORRT"
 type: plain_page
 url: "/ai-metascience/"
-hide_title: true
+subtitle: "Programme and recordings of three days of talks and workshops, held online on 28–30 September 2026."
 hide_date: true
 summary: "Programme and recordings of the FORRT AI in Metascience Online Conference, 28–30 September 2026: 35+ talks and workshops over 3 days, most of them on YouTube."
 sharing_description: "Watch the talks from the FORRT AI in Metascience Online Conference, 28–30 September 2026."
 sharing_image_alt: "FORRT AI in Metascience Conference — online, 28–30 September 2026"
+# The banner beside the title (layouts/partials/doors/page_hero.html).
+hero_image: "featured.png"
+hero_image_alt: "FORRT AI in Metascience Conference — online, 28–30 September 2026"
 image:
   placement: 1
   alt_text: "FORRT AI in Metascience Conference — online, 28–30 September 2026"
@@ -14,9 +18,28 @@ image:
 ---
 
 <style>
+.am-actions { display: grid; grid-template-columns: repeat(3, minmax(0, 1fr)); gap: 10px; margin: 18px 0 6px; max-width: 620px; }
+.article-layout .article-style .am-playlist { display: flex; flex-direction: column; gap: 2px; padding: 12px 14px; border: 2px solid var(--am-deep) !important; border-radius: 12px; background: var(--am-tint, #eef5f3); color: var(--am-ink); text-decoration: none !important; font-size: 15px; line-height: 1.3; }
+.article-layout .article-style .am-playlist strong { color: var(--am-deep); font-size: 17px; }
+.article-layout .article-style .am-playlist:hover { background: var(--am-tint); }
+.am-playlist strong::before { content: "\25B6\00A0"; }
+/* Each playlist takes its day's colours, as the programme does. */
+.am-playlist:nth-of-type(1) { --am-deep: var(--am-mon-deep); --am-tint: var(--am-mon-tint); }
+.am-playlist:nth-of-type(2) { --am-deep: var(--am-tue-deep); --am-tint: var(--am-tue-tint); }
+.am-playlist:nth-of-type(3) { --am-deep: var(--am-wed-deep); --am-tint: var(--am-wed-tint); }
+@media (max-width: 599px) { .am-actions { grid-template-columns: 1fr; } }
+.am-actions-label { grid-column: 1 / -1; font-weight: 600; }
+/* The title and the banner open the page (page_hero). On a wide screen the facts sit under the banner, beside the introduction and the playlists, so the programme starts sooner. */
+@media (min-width: 1001px) {
+  .reading:has(.am-facts) > .article-style { display: grid; grid-template-columns: minmax(0, 1fr) minmax(0, 520px); column-gap: 56px; align-content: start; }
+  .reading:has(.am-facts) > .article-style > * { grid-column: 1 / -1; }
+  .reading:has(.am-facts) > .article-style > p:first-of-type { grid-column: 1; grid-row: 1; }
+  .reading:has(.am-facts) > .article-style > .am-actions { grid-column: 1; grid-row: 2; }
+  .reading:has(.am-facts) > .article-style > .am-facts { grid-column: 2; grid-row: 1 / span 2; align-self: start; grid-template-columns: 1fr 1fr; margin-top: 20px; }
+}
 /* Palette, drawn from the banner mosaic. Each day sets --am-accent (rules and
    borders), --am-deep (text and filled pills, 4.5:1 or better on white and on
-   the day tint) and --am-tint (card and hover backgrounds). */
+   the day tint) and --am-tint (selected tab and hover backgrounds). */
 :root {
   --am-ink: #313131;
   --am-muted: #5d6b70;
@@ -49,10 +72,12 @@ image:
   --am-tint: var(--am-wed-tint);
 }
 
+
 .am-facts {
   display: grid;
   grid-template-columns: 1.2fr 0.85fr 0.5fr 1.45fr;
   gap: 0 1.1rem;
+  max-width: 580px;
   margin: 1.5rem 0;
   padding: 0.8rem 1.1rem;
   border: 1px solid var(--am-rule);
@@ -62,231 +87,197 @@ image:
 .am-fact { padding: 0.4rem 0; }
 .am-fact-label {
   display: block;
-  color: var(--am-muted);
-  font-size: 0.72rem;
+  color: var(--am-ink);
+  font-size: 15px;
   font-weight: 700;
-  letter-spacing: 0.09em;
-  text-transform: uppercase;
 }
 .am-fact-value {
   display: block;
   margin-top: 0.25rem;
   color: var(--am-ink);
-  font-size: 1rem;
+  font-size: 17px;
   line-height: 1.35;
 }
 @media (max-width: 640px) { .am-facts { grid-template-columns: 1fr 1fr; } }
-@media (max-width: 400px) { .am-facts { grid-template-columns: 1fr; } }
-
-.am-watch {
-  display: grid;
-  grid-template-columns: repeat(3, 1fr);
-  gap: 0.6rem;
-  margin: 1.6rem 0;
-}
-.am-watch a {
-  display: block;
-  padding: 0.75rem 0.9rem;
-  border-radius: 6px;
-  background: var(--am-deep);
-  color: #fff;
-  font-weight: 700;
-  text-align: center;
-}
-.am-watch a::before { content: "\25B6\00A0"; font-size: 0.8em; }
-.am-watch a:hover { color: #fff; text-decoration: underline; }
-@media (max-width: 560px) { .am-watch { grid-template-columns: 1fr; } }
-
-.am-days {
-  display: grid;
-  grid-template-columns: repeat(3, 1fr);
-  gap: 0.8rem;
-  margin: 1.8rem 0 2.2rem;
-}
-.am-day-card {
-  display: flex;
-  flex-direction: column;
-  padding: 1rem;
-  border-top: 4px solid var(--am-accent);
-  border-radius: 8px;
-  background: var(--am-tint);
-  color: var(--am-ink);
-  text-decoration: none;
-  transition: transform 150ms ease, box-shadow 150ms ease;
-}
-.am-day-card:focus { color: var(--am-ink); text-decoration: none; }
-.am-day-card:hover {
-  color: var(--am-ink);
-  text-decoration: none;
-  transform: translateY(-2px);
-  box-shadow: 0 4px 12px rgba(49, 49, 49, 0.14);
-}
-.am-day-card:focus-visible {
-  outline: 2px solid var(--am-accent);
-  outline-offset: 2px;
-}
-.am-day-name { font-size: 1.05rem; font-weight: 700; line-height: 1.2; }
-.am-day-date { color: var(--am-muted); font-size: 0.85rem; }
-.am-day-theme {
-  margin-top: 0.45rem;
-  color: var(--am-deep);
-  font-size: 1rem;
-  font-weight: 700;
-  line-height: 1.3;
-}
-.am-day-blurb {
-  margin-top: 0.35rem;
-  font-size: 0.9rem;
-  line-height: 1.45;
-}
-.am-day-go {
-  margin-top: auto;
-  padding-top: 0.8rem;
-  align-self: flex-end;
-  color: var(--am-deep);
-  font-size: 0.85rem;
-}
-@media (max-width: 640px) { .am-days { grid-template-columns: 1fr; } }
 
+/* Days. Without JavaScript these are links to the three days, all shown in
+   turn; the script below turns them into tabs that show one day at a time. */
 .am-switch {
-  position: sticky;
-  top: 70px;
-  z-index: 5;
   display: flex;
-  gap: 0.5rem;
-  margin: 0 0 1.4rem;
-  padding: 0.6rem 0;
+  gap: 8px;
+  margin: 0 0 20px;
   border-bottom: 1px solid var(--am-rule);
-  background: var(--am-paper);
 }
-.am-pill {
-  flex: 0 0 auto;
-  padding: 0.3rem 0.85rem;
+.am-tab {
+  flex: 1 1 0;
+  min-width: 0;
+  padding: 10px 16px 9px;
   border: 1px solid var(--am-rule);
-  border-radius: 999px;
+  border-bottom: 0;
+  border-top: 4px solid var(--am-accent);
+  border-radius: 14px 14px 0 0;
   background: var(--am-card);
   color: var(--am-ink);
-  font-size: 0.88rem;
-  text-decoration: none;
-  white-space: nowrap;
-  transition: background-color 150ms ease, color 150ms ease;
-}
-.am-pill:hover, .am-pill:focus {
-  color: var(--am-ink);
+  line-height: 1.3;
   text-decoration: none;
-  border-color: var(--am-accent);
-}
-.am-pill:focus-visible {
-  outline: 2px solid var(--am-accent);
-  outline-offset: 2px;
+  transition: background-color 150ms ease;
 }
-.am-pill-on, .am-pill-on:hover, .am-pill-on:focus {
-  border-color: var(--am-deep);
-  background: var(--am-deep);
-  color: #fff;
+.am-tab:hover, .am-tab:focus { color: var(--am-ink); text-decoration: none; background: var(--am-tint); }
+.am-tab:focus-visible { outline: 2px solid var(--am-deep); outline-offset: 2px; }
+.am-tab-day { display: block; font-size: 17px; font-weight: 700; }
+.am-tab-theme { display: block; color: var(--am-deep); font-size: 15px; }
+.am-tab[aria-selected="true"] {
+  position: relative;
+  margin-bottom: -1px;
+  padding-bottom: 10px;
+  background: var(--am-tint);
 }
-/* The navbar is shorter once it collapses to a burger. */
-@media (max-width: 767px) { .am-switch { top: 50px; } }
-@media (max-width: 480px) {
-  .am-switch { gap: 0.35rem; }
-  .am-pill { padding: 0.28rem 0.55rem; font-size: 0.8rem; }
+.am-tab[aria-selected="true"] .am-tab-day { color: var(--am-deep); }
+@media (max-width: 599px) {
+  .am-switch { gap: 4px; }
+  .am-tab { padding: 8px 6px 7px; text-align: center; }
+  .am-tab-day { font-size: 16px; }
+  .am-tab-theme { display: none; }
 }
 
-/* Programme: the markup between the PROGRAMME markers is generated. The
-   generator emits the day class (am-day-mon and friends) that carries the
-   day's colour into every rule below. */
-.am-prog-day {
-  margin: 0 0 2.5rem;
-  scroll-margin-top: 155px;
-}
-.am-prog-date {
-  margin: 0 0 0.6rem;
-  padding-left: 0.8rem;
+/* Programme. The markup between the PROGRAMME markers was generated (see the
+   note there); the day class (am-day-mon and friends) carries the day's
+   colour into every rule below. */
+.am-prog-day { margin: 0 0 40px; }
+/* A link to a day keeps the tabs above it in view. */
+.am-prog-tabbed .am-prog-day { scroll-margin-top: 100px; }
+.am-prog-dayhead {
+  display: grid;
+  grid-template-columns: minmax(0, 30em) auto;
+  justify-content: space-between;
+  align-items: start;
+  gap: 4px 32px;
+  margin: 0 0 8px;
+}
+.am-prog-dayhead > * { grid-column: 1; }
+.article-layout .article-style .am-prog-date {
+  margin: 0;
+  padding-left: 12px;
   border-left: 6px solid var(--am-accent);
-  font-size: 1.5rem;
+  font-size: 26px;
   line-height: 1.25;
 }
 .am-prog-date span {
   display: block;
-  margin-top: 0.15rem;
+  margin-top: 2px;
   color: var(--am-deep);
-  font-size: 1rem;
+  font-size: 18px;
   font-weight: 400;
 }
-.am-prog-half {
+.article-layout .article-style .am-prog-daytext {
+  max-width: 30em;
+  margin: 0;
+  font-size: 17px;
+  line-height: 1.5;
+}
+.article-layout .article-style .am-prog-playlist {
+  grid-column: 2;
+  grid-row: 1 / span 2;
+  margin: 0;
+}
+.article-layout .article-style .am-prog-playlist a {
+  display: inline-block;
+  padding: 10px 22px;
+  border-radius: 999px;
+  background: var(--am-deep);
+  color: #fff;
+  font-size: 16px;
+  font-weight: 700;
+  line-height: 1.3;
+  white-space: nowrap;
+}
+.am-prog-playlist a::before { content: "\25B6\00A0"; font-size: 15px; }
+.article-layout .article-style .am-prog-playlist a { text-decoration: none; }
+.article-layout .article-style .am-prog-playlist a:hover,
+.article-layout .article-style .am-prog-playlist a:focus { color: #fff; text-decoration: underline; }
+.am-prog-playlist a:focus-visible { outline: 2px solid var(--am-deep); outline-offset: 2px; }
+/* With tabs on, the selected tab names the day, so its heading is left to screen readers. */
+@media (min-width: 600px) {
+  .am-prog-tabbed .am-prog-date {
+    position: absolute;
+    width: 1px;
+    height: 1px;
+    overflow: hidden;
+    clip-path: inset(50%);
+    white-space: nowrap;
+  }
+}
+@media (max-width: 760px) {
+  .am-prog-dayhead { grid-template-columns: minmax(0, 1fr); }
+  .article-layout .article-style .am-prog-playlist { grid-column: 1; grid-row: auto; margin-top: 6px; }
+}
+
+/* Morning and afternoon run side by side once there is room for two columns. */
+.am-prog-halves { display: grid; gap: 0 36px; max-width: 34rem; }
+@media (min-width: 1100px) {
+  .am-prog-halves { grid-template-columns: repeat(2, minmax(0, 1fr)); max-width: none; }
+}
+.article-layout .article-style .am-prog-half {
   display: flex;
   align-items: center;
-  gap: 0.6rem;
-  margin: 1.6rem 0 0.6rem;
-  font-size: 0.8rem;
+  gap: 10px;
+  max-width: none;
+  margin: 14px 0 8px;
+  color: var(--am-ink);
+  font-size: 16px;
   font-weight: 700;
   letter-spacing: 0.08em;
+  line-height: 1.3;
   text-transform: uppercase;
-  color: var(--am-muted);
-}
-.am-prog-half::after {
-  content: "";
-  flex: 1;
-  height: 1px;
-  background: var(--am-rule);
 }
+.am-prog-half::after { content: ""; flex: 1; height: 1px; background: var(--am-rule); }
 .am-prog-session {
-  margin: 0 0 1rem;
-  padding: 1rem 1.1rem;
+  margin: 0 0 10px;
+  padding: 8px 12px 4px;
   border: 1px solid var(--am-rule);
   border-left: 4px solid var(--am-accent);
   border-radius: 8px;
   background: var(--am-card);
 }
-.am-prog-session h4 {
-  margin: 0 0 0.25rem;
-  font-size: 1.05rem;
+.am-prog-session-solo { padding-top: 4px; }
+.article-layout .article-style .am-prog-session h4 {
+  margin: 0 0 2px;
+  font-size: 18px;
   line-height: 1.3;
 }
-.am-prog-blurb {
-  margin: 0 0 0.5rem;
+.am-prog-start {
+  margin-right: 8px;
+  color: var(--am-deep);
+  font-variant-numeric: tabular-nums;
+}
+.article-layout .article-style .am-prog-blurb {
+  max-width: 30em;
+  margin: 0 0 4px;
   color: var(--am-muted);
-  font-size: 0.9rem;
+  font-size: 15px;
+  line-height: 1.45;
 }
-.am-prog-talks { list-style: none; margin: 0; padding: 0; }
-.am-prog-talks li {
-  display: flex;
-  align-items: center;
-  gap: 0.5rem;
+.article-layout .article-style .am-prog-talks { list-style: none; margin: 0; padding: 0; }
+.article-layout .article-style .am-prog-talks li {
+  display: grid;
+  grid-template-columns: minmax(0, 1fr) auto;
+  align-items: end;
+  gap: 0 8px;
+  max-width: none;
+  margin: 0;
   padding: 0;
   border-top: 1px solid var(--am-rule);
+  font-size: 16px;
+  line-height: 1.35;
 }
-.am-prog-watch {
-  display: flex;
-  flex-wrap: wrap;
-  justify-content: flex-end;
-  gap: 0.3rem;
-  flex: 0 0 auto;
-  max-width: 11rem;
-}
-.am-prog-watch a,
-.am-prog-playlist a {
-  padding: 0.15rem 0.55rem;
-  border: 1px solid var(--am-accent);
-  border-radius: 999px;
-  color: var(--am-deep);
-  font-size: 0.76rem;
-  white-space: nowrap;
-}
-.am-prog-watch a::before,
-.am-prog-playlist a::before { content: "\25B6\00A0"; font-size: 0.65rem; }
-.am-prog-watch a:hover,
-.am-prog-playlist a:hover { background: var(--am-tint); text-decoration: none; }
-.am-prog-playlist { margin: -0.4rem 0 0.9rem; }
-.am-prog-playlist a { font-size: 0.86rem; }
-.am-prog-talks li:first-child { border-top: 0; }
+.article-layout .article-style .am-prog-talks li:first-child { border-top: 0; }
 .am-prog-item {
-  display: flex;
-  align-items: center;
-  justify-content: space-between;
-  gap: 0.9rem;
+  display: grid;
+  grid-template-columns: 3.6em minmax(0, 1fr) auto;
+  align-items: end;
+  gap: 0 8px;
   width: 100%;
-  padding: 0.5rem 0.4rem;
+  padding: 6px 4px;
   border: 0;
   border-radius: 4px;
   background: none;
@@ -296,82 +287,78 @@ image:
   cursor: pointer;
   transition: background-color 150ms ease;
 }
-.am-prog-text { flex: 1 1 auto; }
+.am-prog-time {
+  align-self: start;
+  padding-top: 1px;
+  color: var(--am-deep);
+  font-size: 15px;
+  font-weight: 700;
+  font-variant-numeric: tabular-nums;
+}
+.am-prog-text { min-width: 0; max-width: 26em; }
 .am-prog-title {
   display: block;
   color: var(--am-ink);
-  font-size: 1rem;
-  font-weight: 400;
-  line-height: 1.35;
-}
-.am-prog-session-solo .am-prog-title { font-size: 1.05rem; font-weight: 700; }
-.am-prog-who {
-  display: block;
-  color: var(--am-muted);
-  font-size: 0.86rem;
-}
-.am-prog-meta {
-  display: flex;
-  align-items: center;
-  gap: 0.55rem;
-  flex: 0 0 auto;
-}
-.am-prog-more {
-  color: var(--am-deep);
-  font-size: 0.76rem;
-  white-space: nowrap;
+  font-size: 17px;
+  line-height: 1.3;
 }
+.am-prog-session-solo .am-prog-title { font-weight: 700; }
+.am-prog-who { display: block; color: var(--am-muted); font-size: 15px; }
+.am-prog-more { color: var(--am-deep); font-size: 15px; white-space: nowrap; }
 .am-prog-more::after { content: " \203A"; }
 .am-prog-item:not(.am-prog-item-plain):hover,
-.am-prog-item:not(.am-prog-item-plain):focus-visible {
-  background: var(--am-tint);
-}
+.am-prog-item:not(.am-prog-item-plain):focus-visible { background: var(--am-tint); }
 .am-prog-item:not(.am-prog-item-plain):hover .am-prog-title,
-.am-prog-item:not(.am-prog-item-plain):focus-visible .am-prog-title {
-  text-decoration: underline;
-}
-.am-prog-item:focus-visible {
-  outline: 2px solid var(--am-accent);
-  outline-offset: 2px;
-}
+.am-prog-item:not(.am-prog-item-plain):focus-visible .am-prog-title { text-decoration: underline; }
+.am-prog-item:focus-visible { outline: 2px solid var(--am-deep); outline-offset: 0; }
 .am-prog-item-plain { cursor: default; }
 .am-prog-item-plain .am-prog-more { display: none; }
-.am-prog-time {
-  flex: 0 0 5.6rem;
-  align-self: flex-start;
-  padding-top: 0.08rem;
+.am-prog-watch {
+  display: flex;
+  flex-wrap: wrap;
+  justify-content: flex-end;
+  gap: 4px;
+  max-width: 10.5rem;
+  padding: 6px 0;
+}
+.article-layout .article-style .am-prog-watch a {
+  padding: 1px 9px;
+  border: 1px solid var(--am-accent);
+  border-radius: 999px;
   color: var(--am-deep);
-  font-size: 0.9rem;
-  font-weight: 700;
-  font-variant-numeric: tabular-nums;
+  font-size: 15px;
   white-space: nowrap;
 }
-.am-prog-tbc-tag {
-  display: inline-block;
-  margin-left: 0.3rem;
-  padding: 0 0.3rem;
-  border: 1px solid #d8c98a;
-  border-radius: 3px;
-  background: #fdf6e0;
-  color: #6e5a1d;
-  font-size: 0.66rem;
-  font-weight: 700;
-  letter-spacing: 0.04em;
-  text-transform: uppercase;
-  vertical-align: 0.1rem;
+.am-prog-watch a::before { content: "\25B6\00A0"; font-size: 15px; }
+.article-layout .article-style .am-prog-watch a { text-decoration: none; }
+.article-layout .article-style .am-prog-watch a:hover { background: var(--am-tint); color: var(--am-deep); text-decoration: underline; }
+.am-prog-watch a:focus-visible { outline: 2px solid var(--am-deep); outline-offset: 1px; }
+/* On a phone the time leads, then the talk, and Abstract and Watch share the last line:
+   Abstract on the left inside the talk's button, Watch on the right beside it. */
+@media (max-width: 599px) {
+  .article-layout .article-style .am-prog-talks li { grid-template-columns: minmax(0, 1fr); position: relative; }
+  .am-prog-item { grid-template-columns: minmax(0, 1fr); }
+  .am-prog-time { grid-column: 1; grid-row: 1; }
+  .am-prog-text { grid-column: 1; grid-row: 2; }
+  .am-prog-meta { grid-column: 1; grid-row: 3; align-self: center; min-height: 34px; display: flex; align-items: center; }
+  .am-prog-watch { position: absolute; right: 4px; bottom: 8px; padding: 0; max-width: none; }
 }
-.am-prog-start {
-  margin-right: 0.45rem;
+
+.am-prog-next {
+  display: inline-block;
+  margin-top: 6px;
+  padding: 6px 14px;
+  border: 1px solid var(--am-accent);
+  border-radius: 6px;
+  background: var(--am-card);
   color: var(--am-deep);
-  font-variant-numeric: tabular-nums;
-}
-@media (max-width: 560px) {
-  .am-prog-item { flex-wrap: wrap; gap: 0.3rem; }
-  .am-prog-time { flex: 0 0 100%; }
-  .am-prog-text { flex: 1 1 100%; }
-  .am-prog-talks li { flex-wrap: wrap; }
-  .am-prog-watch { flex: 1 1 100%; max-width: none; justify-content: flex-start; padding: 0 0.4rem 0.5rem; }
+  font: inherit;
+  font-size: 16px;
+  font-weight: 700;
+  cursor: pointer;
 }
+.am-prog-next:hover { background: var(--am-tint); }
+.am-prog-next:focus-visible { outline: 2px solid var(--am-deep); outline-offset: 2px; }
 
 .am-prog-dialog {
   position: relative;
@@ -391,13 +378,13 @@ image:
   position: absolute;
   top: 1rem;
   right: 1rem;
-  width: 36px;
-  height: 36px;
+  width: 44px;
+  height: 44px;
   padding: 0;
-  border: 1px solid var(--am-rule);
+  border: 1.5px solid var(--am-ink);
   border-radius: 50%;
   background: var(--am-card);
-  color: var(--am-muted);
+  color: var(--am-ink);
   font-size: 1.4rem;
   line-height: 1;
   cursor: pointer;
@@ -435,28 +422,19 @@ image:
 @media (max-width: 480px) {
   .am-prog-dialog { padding: 1.2rem 1rem 1.2rem; }
 }
-.am-prog-tbc {
-  display: inline-block;
-  float: right;
-  margin: 0.15rem 0 0.3rem 0.6rem;
-  padding: 0.12rem 0.55rem;
-  border: 1px solid #c8a951;
-  border-radius: 999px;
-  background: transparent;
-  color: #6e5a1d;
-  font-size: 0.7rem;
-  font-weight: 700;
-  letter-spacing: 0.05em;
-  text-transform: uppercase;
+@media print {
+  .am-prog-day[hidden] { display: block !important; }
+  .am-switch, .am-prog-next { display: none; }
 }
 @media (prefers-reduced-motion: reduce) {
-  .am-day-card, .am-pill, .am-prog-item { transition: none; }
-  .am-day-card:hover, .am-day-card:focus { transform: none; }
+  .am-tab, .am-prog-item { transition: none; }
 }
 </style>
 
 How is AI changing the way research is done, checked and understood? The **FORRT AI in Metascience Online Conference** spent three days on that question, with 35+ talks and workshops from people who are studying it or building with it. Most talks are now on the [FORRT YouTube channel](https://youtube.com/@forrtproject9995), one playlist per day.
 
+<p class="am-actions"><span class="am-actions-label">Watch the recordings:</span> <a class="am-playlist" href="https://www.youtube.com/playlist?list=PLS3VdaYKcrew"><strong>Monday</strong><span>AI in the research pipeline</span></a> <a class="am-playlist" href="https://www.youtube.com/playlist?list=PLSItTTcc91ac"><strong>Tuesday</strong><span>Replications and reproductions</span></a> <a class="am-playlist" href="https://www.youtube.com/playlist?list=PLZYxy57rykQU"><strong>Wednesday</strong><span>Workshops and analyst variability</span></a></p>
+
 <div class="am-facts">
 <div class="am-fact"><span class="am-fact-label">When</span><span class="am-fact-value">28–30 September 2026</span></div>
 <div class="am-fact"><span class="am-fact-label">Where</span><span class="am-fact-value">Online</span></div>
@@ -464,53 +442,30 @@ How is AI changing the way research is done, checked and understood? The **FORRT
 <div class="am-fact"><span class="am-fact-label">Recordings</span><span class="am-fact-value">32 talks on YouTube</span></div>
 </div>
 
-<div class="am-watch">
-<a class="am-day-mon" href="https://www.youtube.com/playlist?list=PLS3VdaYKcrew" target="_blank" rel="noopener">Monday talks</a>
-<a class="am-day-tue" href="https://www.youtube.com/playlist?list=PLSItTTcc91ac" target="_blank" rel="noopener">Tuesday talks</a>
-<a class="am-day-wed" href="https://www.youtube.com/playlist?list=PLZYxy57rykQU" target="_blank" rel="noopener">Wednesday talks</a>
-</div>
-
-<div class="am-days">
-<a class="am-day-card am-day-mon" href="#am-day-mon">
-<span class="am-day-name">Monday</span>
-<span class="am-day-date">28 September</span>
-<span class="am-day-theme">AI in the research pipeline</span>
-<span class="am-day-blurb">What AI is already doing to the literature, whether it can carry out evidence synthesis, how it can inform research evaluation, and what legitimate, ethical adoption looks like.</span>
-<span class="am-day-go">Programme and recordings ↓</span>
-</a>
-<a class="am-day-card am-day-tue" href="#am-day-tue">
-<span class="am-day-name">Tuesday</span>
-<span class="am-day-date">29 September</span>
-<span class="am-day-theme">Replications and reproductions</span>
-<span class="am-day-blurb">Replications and reproductions are key to credible science, yet hard to do and hard to find. Can AI help with both, and what are the risks of handing the work to machines?</span>
-<span class="am-day-go">Programme and recordings ↓</span>
-</a>
-<a class="am-day-card am-day-wed" href="#am-day-wed">
-<span class="am-day-name">Wednesday</span>
-<span class="am-day-date">30 September</span>
-<span class="am-day-theme">Workshops, and analyst variability</span>
-<span class="am-day-blurb">Three 90-minute hands-on sessions on AI for knowledge management, evidence synthesis and pre-registration review, plus talks on whether a finding survives another analyst.</span>
-<span class="am-day-go">Programme and recordings ↓</span>
-</a>
-</div>
-
 ## Programme
 
-Here are the sessions and the talks in each, in the order they ran. **Click any talk to read its abstract**, and use **Watch** to open its recording. All times are CEST (UTC+2).
+Pick a day to see its sessions and talks in the order they ran. **Click any talk to read its abstract**, and use **Watch** to open its recording. All times are CEST (UTC+2).
 
-<nav class="am-switch" aria-label="Jump to a day">
-<a class="am-pill am-day-mon" href="#am-day-mon">Mon 28</a>
-<a class="am-pill am-day-tue" href="#am-day-tue">Tue 29</a>
-<a class="am-pill am-day-wed" href="#am-day-wed">Wed 30</a>
+<nav class="am-switch" aria-label="Conference days">
+<a class="am-tab am-day-mon" href="#am-day-mon"><span class="am-tab-day">Mon 28 Sep</span><span class="am-tab-theme">AI in the research pipeline</span></a>
+<a class="am-tab am-day-tue" href="#am-day-tue"><span class="am-tab-day">Tue 29 Sep</span><span class="am-tab-theme">Replications and reproductions</span></a>
+<a class="am-tab am-day-wed" href="#am-day-wed"><span class="am-tab-day">Wed 30 Sep</span><span class="am-tab-theme">Workshops, and analyst variability</span></a>
 </nav>
 
 <!-- PROGRAMME:START -->
-<!-- built by build/public_programme.py in the submission-review repo -->
+<!-- built by build/public_programme.py in the submission-review repo, then edited by hand:
+     the day heads (am-prog-dayhead, with the day blurbs) and the half-day wrappers
+     (am-prog-halves, am-prog-halfblock) are not in the generator's output. -->
 
 <div class="am-prog">
 <section class="am-prog-day am-day-mon" id="am-day-mon">
+<div class="am-prog-dayhead">
 <h3 class="am-prog-date">Monday 28 September<span>AI in the research pipeline</span></h3>
+<p class="am-prog-daytext">What AI is already doing to the literature, whether it can carry out evidence synthesis, how it can inform research evaluation, and what legitimate, ethical adoption looks like.</p>
 <p class="am-prog-playlist"><a href="https://www.youtube.com/playlist?list=PLS3VdaYKcrew" target="_blank" rel="noopener">All Monday recordings on YouTube</a></p>
+</div>
+<div class="am-prog-halves">
+<div class="am-prog-halfblock">
 <p class="am-prog-half">Morning</p>
 <div class="am-prog-session am-prog-session-solo"><ul class="am-prog-talks"><li><div class="am-prog-item am-prog-item-plain"><span class="am-prog-time">09:30</span><span class="am-prog-text"><span class="am-prog-title">Welcome and framing</span><span class="am-prog-who">The organisers</span></span></div></li></ul></div>
 <div class="am-prog-session">
@@ -530,6 +485,8 @@ Here are the sessions and the talks in each, in the order they ran. **Click any
 <li><button type="button" class="am-prog-item" data-talk="c3984e9c" data-session="Evidence synthesis: capability, comparison, assurance" data-day="Monday 28 September"><span class="am-prog-time">11:30</span><span class="am-prog-text"><span class="am-prog-title">Fast, but incomplete and inaccurate? Performance of AI-powered tools for systematic literature reviews</span><span class="am-prog-who">Rene Bekkers (VU Amsterdam)</span></span><span class="am-prog-meta"><span class="am-prog-more" aria-hidden="true">Abstract</span></span></button><span class="am-prog-watch"><a href="https://youtu.be/z30hdcI8lsE" target="_blank" rel="noopener" aria-label="Watch: Fast, but incomplete and inaccurate? Performance of AI-powered tools for systematic literature reviews">Watch</a></span></li>
 <li><button type="button" class="am-prog-item" data-talk="e6453c60" data-session="Evidence synthesis: capability, comparison, assurance" data-day="Monday 28 September"><span class="am-prog-time">11:50</span><span class="am-prog-text"><span class="am-prog-title">ReviewAid: confidence-scored, locally runnable LLM screening and extraction</span><span class="am-prog-who">Vihaan Sahu (Georgian National University SEU)</span></span><span class="am-prog-meta"><span class="am-prog-more" aria-hidden="true">Abstract</span></span></button><span class="am-prog-watch"><a href="https://youtu.be/-xQ6o3WwXeM" target="_blank" rel="noopener" aria-label="Watch: ReviewAid: confidence-scored, locally runnable LLM screening and extraction">Watch</a></span></li>
 </ul></div>
+</div>
+<div class="am-prog-halfblock">
 <p class="am-prog-half">Afternoon</p>
 <div class="am-prog-session">
 <h4><span class="am-prog-start">13:15</span>Evaluating science, and its evaluators</h4>
@@ -555,10 +512,17 @@ Here are the sessions and the talks in each, in the order they ran. **Click any
 <ul class="am-prog-talks">
 <li><button type="button" class="am-prog-item" data-talk="f60b8d27" data-session="Closing provocation" data-day="Monday 28 September"><span class="am-prog-time">17:10</span><span class="am-prog-text"><span class="am-prog-title">Rethinking how AI is approached to address wicked problems and global challenges in a polycrisis world</span><span class="am-prog-who">Batool Almarzouq (University of Edinburgh)</span></span><span class="am-prog-meta"><span class="am-prog-more" aria-hidden="true">Abstract</span></span></button></li>
 </ul></div>
+</div>
+</div>
 </section>
 <section class="am-prog-day am-day-tue" id="am-day-tue">
+<div class="am-prog-dayhead">
 <h3 class="am-prog-date">Tuesday 29 September<span>Replications and reproductions</span></h3>
+<p class="am-prog-daytext">Replications and reproductions are key to credible science, yet hard to do and hard to find. Can AI help with both, and what are the risks of handing the work to machines?</p>
 <p class="am-prog-playlist"><a href="https://www.youtube.com/playlist?list=PLSItTTcc91ac" target="_blank" rel="noopener">All Tuesday recordings on YouTube</a></p>
+</div>
+<div class="am-prog-halves">
+<div class="am-prog-halfblock">
 <p class="am-prog-half">Morning</p>
 <div class="am-prog-session">
 <h4><span class="am-prog-start">09:30</span>Symposium: Can AI Help Us Understand How Findings Move from Animal Studies to Human Studies?</h4>
@@ -574,6 +538,8 @@ Here are the sessions and the talks in each, in the order they ran. **Click any
 <li><button type="button" class="am-prog-item" data-talk="30acb82a" data-session="Reproducing the record" data-day="Tuesday 29 September"><span class="am-prog-time">11:35</span><span class="am-prog-text"><span class="am-prog-title">A local, open-weights pipeline for semi-automated replication checklists</span><span class="am-prog-who">Johannes Breuer (CAIS Bochum &amp; University of Duisburg-Essen), Mario Haim &amp; Philipp Knöpfle (LMU Munich), Xinyue Zhao (CAIS Bochum)</span></span><span class="am-prog-meta"><span class="am-prog-more" aria-hidden="true">Abstract</span></span></button><span class="am-prog-watch"><a href="https://youtu.be/daD3XnHdFU0" target="_blank" rel="noopener" aria-label="Watch: A local, open-weights pipeline for semi-automated replication checklists">Watch</a></span></li>
 <li><button type="button" class="am-prog-item" data-talk="b51b5bcc" data-session="Reproducing the record" data-day="Tuesday 29 September"><span class="am-prog-time">11:55</span><span class="am-prog-text"><span class="am-prog-title">Do failed replications make their way into public knowledge?</span><span class="am-prog-who">Youyou Wu (University College London)</span></span><span class="am-prog-meta"><span class="am-prog-more" aria-hidden="true">Abstract</span></span></button><span class="am-prog-watch"><a href="https://youtu.be/2aAW67PfNnQ" target="_blank" rel="noopener" aria-label="Watch: Do failed replications make their way into public knowledge?">Watch</a></span></li>
 </ul></div>
+</div>
+<div class="am-prog-halfblock">
 <p class="am-prog-half">Afternoon</p>
 <div class="am-prog-session">
 <h4><span class="am-prog-start">13:20</span>Getting our hands dirty: experimenting with agentic reproductions and robustness checks</h4>
@@ -599,15 +565,24 @@ Here are the sessions and the talks in each, in the order they ran. **Click any
 <li><button type="button" class="am-prog-item" data-talk="5a69fddc" data-session="Machines that build and test the replication record" data-day="Tuesday 29 September"><span class="am-prog-time">16:55</span><span class="am-prog-text"><span class="am-prog-title">The Metascience Observatory: an AI-built replication database and experiments with AI for forensic metascience</span><span class="am-prog-who">Dan Elton (The Metascience Observatory)</span></span><span class="am-prog-meta"><span class="am-prog-more" aria-hidden="true">Abstract</span></span></button><span class="am-prog-watch"><a href="https://youtu.be/fLAnLOP2HpE" target="_blank" rel="noopener" aria-label="Watch: The Metascience Observatory: an AI-built replication database and experiments with AI for forensic metascience">Watch</a></span></li>
 <li><button type="button" class="am-prog-item" data-talk="47468cdd" data-session="Machines that build and test the replication record" data-day="Tuesday 29 September"><span class="am-prog-time">17:15</span><span class="am-prog-text"><span class="am-prog-title">Can an agentic LLM run computational reproducibility checks at human quality?</span><span class="am-prog-who">Yoel Inbar (University of British Columbia)</span></span><span class="am-prog-meta"><span class="am-prog-more" aria-hidden="true">Abstract</span></span></button><span class="am-prog-watch"><a href="https://youtu.be/vW3UQ0AVavw" target="_blank" rel="noopener" aria-label="Watch: Can an agentic LLM run computational reproducibility checks at human quality?">Watch</a></span></li>
 </ul></div>
+</div>
+</div>
 </section>
 <section class="am-prog-day am-day-wed" id="am-day-wed">
+<div class="am-prog-dayhead">
 <h3 class="am-prog-date">Wednesday 30 September<span>Workshops, and analyst variability</span></h3>
+<p class="am-prog-daytext">Three 90-minute hands-on sessions on AI for knowledge management, evidence synthesis and pre-registration review, plus talks on whether a finding survives another analyst.</p>
 <p class="am-prog-playlist"><a href="https://www.youtube.com/playlist?list=PLZYxy57rykQU" target="_blank" rel="noopener">All Wednesday recordings on YouTube</a></p>
+</div>
+<div class="am-prog-halves">
+<div class="am-prog-halfblock">
 <p class="am-prog-half">Morning</p>
 <div class="am-prog-session am-prog-session-solo">
 <ul class="am-prog-talks">
 <li><button type="button" class="am-prog-item" data-talk="9787bae8" data-session="" data-day="Wednesday 30 September"><span class="am-prog-time">10:00–11:30</span><span class="am-prog-text"><span class="am-prog-title">How to use PreCheck: An AI-Assisted Tool and Evaluation Framework for Preregistration Quality</span><span class="am-prog-who">Bence Palfi (Goldsmiths, London)</span></span><span class="am-prog-meta"><span class="am-prog-more" aria-hidden="true">Abstract</span></span></button></li>
 </ul></div>
+</div>
+<div class="am-prog-halfblock">
 <p class="am-prog-half">Afternoon</p>
 <div class="am-prog-session am-prog-session-solo">
 <ul class="am-prog-talks">
@@ -625,6 +600,8 @@ Here are the sessions and the talks in each, in the order they ran. **Click any
 <ul class="am-prog-talks">
 <li><button type="button" class="am-prog-item" data-talk="3e76d367" data-session="" data-day="Wednesday 30 September"><span class="am-prog-time">16:00–17:30</span><span class="am-prog-text"><span class="am-prog-title">HubMeta: an AI-assisted workflow for systematic review and meta-analysis</span><span class="am-prog-who">Piers Steel (University of Calgary), Hadi Fariborzi (Mount Royal University)</span></span><span class="am-prog-meta"><span class="am-prog-more" aria-hidden="true">Abstract</span></span></button><span class="am-prog-watch"><a href="https://youtu.be/CKhL16pOdI4" target="_blank" rel="noopener" aria-label="Watch: HubMeta: an AI-assisted workflow for systematic review and meta-analysis">Watch</a></span></li>
 </ul></div>
+</div>
+</div>
 </section>
 </div>
 <dialog class="am-prog-dialog" id="am-prog-dialog">
@@ -645,6 +622,10 @@ Here are the sessions and the talks in each, in the order they ran. **Click any
   var who = dialog.querySelector(".am-prog-dialog-who");
   var eyebrow = dialog.querySelector(".am-prog-dialog-eyebrow");
   var body = dialog.querySelector(".am-prog-dialog-abstract");
+  var opener = null;
+  dialog.addEventListener("close", function () {
+    if (opener) opener.focus();
+  });
   document.querySelectorAll(".am-prog-item").forEach(function (button) {
     var talk = data[button.dataset.talk];
     if (!talk || !talk.abstract) {
@@ -652,6 +633,7 @@ Here are the sessions and the talks in each, in the order they ran. **Click any
       return;
     }
     button.addEventListener("click", function () {
+      opener = button;
       var day = button.dataset.day || "";
       var session = button.dataset.session || "";
       eyebrow.textContent = session ? day + " \u00b7 " + session : day;
@@ -678,54 +660,78 @@ Here are the sessions and the talks in each, in the order they ran. **Click any
 <!-- PROGRAMME:END -->
 
 <script>
-// Jumps to a day, and fills the pill for whichever day is at the top of the
-// viewport. The site's own anchor handler offsets by the navbar alone, which
-// leaves the day header under the sticky pills, so these links scroll
-// themselves and let scroll-margin-top place the header.
+// Turns the day links into tabs that show one day at a time. Without
+// JavaScript every day shows, one after another, and the links jump to them.
 (function () {
-  var pills = document.querySelectorAll(".am-pill");
-  var days = document.querySelectorAll(".am-prog-day");
-  var bar = document.querySelector(".am-switch");
+  var nav = document.querySelector(".am-switch");
+  var prog = document.querySelector(".am-prog");
+  if (!nav || !prog) return;
+  var tabs = Array.prototype.slice.call(nav.querySelectorAll(".am-tab"));
+  var panels = tabs.map(function (tab) {
+    return document.getElementById(tab.getAttribute("href").slice(1));
+  });
+  if (panels.indexOf(null) !== -1) return;
   var navbar = document.getElementById("navbar-main");
-  // The fixed navbar is one row on a wide window and two on a narrow one, so
-  // the pills are parked and the day headers offset by its measured height.
-  var clear = 155;
-  function place() {
-    if (!bar || !navbar) return;
-    var under = Math.max(0, Math.round(
-      navbar.getBoundingClientRect().bottom));
-    bar.style.top = under + "px";
-    clear = under + bar.offsetHeight + 8;
-    days.forEach(function (day) {
-      day.style.scrollMarginTop = clear + "px";
+  nav.setAttribute("role", "tablist");
+  tabs.forEach(function (tab, i) {
+    tab.setAttribute("role", "tab");
+    tab.id = "am-tab-" + panels[i].id.replace("am-day-", "");
+    tab.setAttribute("aria-controls", panels[i].id);
+    panels[i].setAttribute("role", "tabpanel");
+    panels[i].setAttribute("aria-labelledby", tab.id);
+    var next = tabs[i + 1];
+    if (next) {
+      var button = document.createElement("button");
+      button.type = "button";
+      button.className = "am-prog-next";
+      button.textContent = "Next day: " + next.querySelector(".am-tab-day").textContent + " →";
+      button.addEventListener("click", function () {
+        select(i + 1, true);
+        var top = nav.getBoundingClientRect().top;
+        var under = navbar && getComputedStyle(navbar).position === "fixed" ? navbar.getBoundingClientRect().bottom : 0;
+        if (top < under) window.scrollBy(0, top - under - 12);
+      });
+      panels[i].appendChild(button);
+    }
+  });
+  prog.classList.add("am-prog-tabbed");
+  function select(index, focus) {
+    tabs.forEach(function (tab, i) {
+      var on = i === index;
+      tab.setAttribute("aria-selected", on ? "true" : "false");
+      tab.tabIndex = on ? 0 : -1;
+      panels[i].hidden = !on;
     });
+    if (focus) tabs[index].focus();
   }
-  place();
-  window.addEventListener("resize", place);
-  document.querySelectorAll(".am-pill, .am-day-card").forEach(function (link) {
-    link.addEventListener("click", function (event) {
-      var target = document.querySelector(link.getAttribute("href"));
-      if (!target) return;
+  function fromHash() {
+    var target = location.hash && document.getElementById(location.hash.slice(1));
+    for (var i = 0; target && i < panels.length; i++) {
+      if (panels[i].contains(target)) return i;
+    }
+    return -1;
+  }
+  tabs.forEach(function (tab, i) {
+    tab.addEventListener("click", function (event) {
       event.preventDefault();
       event.stopImmediatePropagation();
-      place();
-      target.scrollIntoView();
-      history.replaceState(null, "", link.getAttribute("href"));
+      select(i, false);
+      history.replaceState(null, "", tab.getAttribute("href"));
     }, true);
-  });
-  if (!pills.length || !days.length || !window.IntersectionObserver) return;
-  function light(id) {
-    pills.forEach(function (pill) {
-      pill.classList.toggle(
-        "am-pill-on", pill.getAttribute("href") === "#" + id);
-    });
-  }
-  var observer = new IntersectionObserver(function (entries) {
-    entries.forEach(function (entry) {
-      if (entry.isIntersecting) light(entry.target.id);
+    tab.addEventListener("keydown", function (event) {
+      var to = { ArrowRight: i + 1, ArrowLeft: i - 1, Home: 0, End: tabs.length - 1 }[event.key];
+      if (event.key === " ") { event.preventDefault(); tab.click(); return; }
+      if (to === undefined) return;
+      event.preventDefault();
+      select((to + tabs.length) % tabs.length, true);
     });
-  }, { rootMargin: "-" + clear + "px 0px -60% 0px" });
-  days.forEach(function (day) { observer.observe(day); });
+  });
+  var start = fromHash();
+  select(start < 0 ? 0 : start, false);
+  window.addEventListener("hashchange", function () {
+    var i = fromHash();
+    if (i >= 0) select(i, false);
+  });
 })();
 </script>
 
diff --git a/content/authors/forrt/_index.md b/content/authors/forrt/_index.md
index 1bb12b70d17..0bc1d70ea51 100644
--- a/content/authors/forrt/_index.md
+++ b/content/authors/forrt/_index.md
@@ -67,7 +67,7 @@ In a nutshell, FORRT is a ***F***ramework for ***O***pen and ***R***eproducible
 
 ### The problem
 
-* Recently, the scientific community took steps to reflect a widespread awareness of, and call for, improved practices ushering in the “credibility revolution” including higher standards of evidence, preregistration, direct replication, transparency, and openness.
+* Since the 2010s, the scientific community has taken steps to reflect a widespread awareness of, and call for, improved practices ushering in the “credibility revolution” including higher standards of evidence, preregistration, direct replication, transparency, and openness.
 * Structurally, three pillars were proposed to carry social sciences towards academic utopia:  opening scientific communication, restructuring incentives and practices, and collaborative and crowdsourced science. 
 
 However, ongoing attempts have neglected an essential aspect of the academic machinery: students. And indeed, current norms for the teaching and mentoring in higher-education are rooted in obsolete practices of bygone eras. Improving transparency and rigor of science is the responsibility of all who engage in it.
diff --git a/content/awards/awards.md b/content/awards/awards.md
index 78975d1e28d..a4decd9a147 100644
--- a/content/awards/awards.md
+++ b/content/awards/awards.md
@@ -72,7 +72,9 @@ subtitle = ""
   window.addEventListener("load", () => {
     const jsConfetti = new JSConfetti();
     
-    // Function to trigger confetti
+    // Once, and only for visitors who have not asked for reduced motion.
+    if (matchMedia('(prefers-reduced-motion: reduce)').matches) return;
+
     const triggerConfetti = () => {
         jsConfetti.addConfetti({
         emojis: ['🎉', '🥳', '👏', '✨', '⭐','🏆'],
@@ -83,9 +85,6 @@ subtitle = ""
 
     // Trigger immediately on load
     triggerConfetti();
-
-    // Trigger every 60 seconds (60000 ms)
-    setInterval(triggerConfetti, 60000);
   });
 </script>
 
@@ -208,7 +207,7 @@ Thanks to our amazing community, FORRT has become an ***award-winning*** grassro
 
 <br style="clear: both;" />
 
-In 2021, FORRT has received a ***Kellogg School of Management Consultancy on “Leading & Managing Teams”***.
+In 2021, FORRT has received a ***consultancy on “Leading & Managing Teams”*** from the Kellogg School of Management.
 
 <br style="clear: both;" />
 
diff --git a/content/awop/awop.md b/content/awop/awop.md
index 84d8d7e7128..87a56521014 100644
--- a/content/awop/awop.md
+++ b/content/awop/awop.md
@@ -60,53 +60,108 @@ The AWoP transcends traditional frameworks by integrating accessibility, inclusi
 
 The Academic Wheel of Privilege aims to reform authorship practices and inspire a broader transformation towards fairness and inclusiveness in the academic landscape. We invite you to explore the AWoP toolkit and join us in promoting equity and justice in academia.
 
-<center>
-
-![The Academic Wheel of Privilege showing the 24 socio-cultural identities. The 24 socio-cultural identity types span six sectors: health and wellbeing, society, culture and communication, gender and sexuality, education and career, living arrangements and lastly childhood and development. These identity types are shown as circles connected to three concentric rings (outer, middle and inner) of “identity” circles with increasing privilege as you go towards the centre.](AWOP.webp)
-
-</center>
-
 ## Toolkit 
 ---
 
 We provide a comprehensive suite of resources within the AWoP toolkit:
 
-- **Manuscript**: [https://doi.org/10.31222/osf.io/af4nk_v2](https://doi.org/10.31222/osf.io/af4nk_v2)
+{{< action_cards area="jus" >}}
+Web App | Generate weighted indicators of privilege for your team | /awop_app/
+Manuscript | The preprint describing the AWoP | https://doi.org/10.31222/osf.io/af4nk_v2
+OSF page | Supplementary files | https://osf.io/pfxqb/overview
+{{< /action_cards >}}
 
-- **Web App**: [Access the AWoP Web App](/awop_app/)
+The App is a dynamic tool that allows users to generate customized weighted indicators of privilege across key socio-economic and cultural identity categories. It helps users actively identify and consider privilege in authorship decisions, facilitating equitable and transparent authorship order determination.
 
-- **OSF page with supplementary files**: [https://osf.io/pfxqb/overview](https://osf.io/pfxqb/overview)
+### Supplemental materials
 
-- The App is a dynamic tool that allows users to generate customized weighted indicators of privilege across key socio-economic and cultural identity categories. It helps users actively identify and consider privilege in authorship decisions, facilitating equitable and transparent authorship order determination.
+All five are in the [OSF project](https://osf.io/pfxqb/overview).
 
-### **Supplemental Materials**:
-     
-* **Reflection Questions (S5)**: These questions are designed to guide both individual and collective introspection within authorship teams. They help users recognize and understand the dynamics of privilege and how these might influence authorship decisions. The questions can be used as a starting point for discussions about fairness and equity in academic contributions.
+<div class="awop-material">
 
-  > **Example Question**: “Do the people I collaborate with hold similar levels of privilege to me?”
-  
-* **Case Study on First-Generation Academics (S6)**: This case study on first-generation academics—those whose parents did not progress beyond high school education can affect an individual's expectations, opportunities, or resources, leading to disparities in contributions and authorship. The experiences of first-generation academics highlight multiple dimensions represented within the Academic Wheel of Privilege (AWoP), ranging from socio-cultural capital and household wealth in childhood, through networking opportunities and mentorship, to factors like ethnicity and culture.
+**Reflection Questions (S5)**
+
+These questions are designed to guide both individual and collective introspection within authorship teams.
+
+[Open on OSF](https://osf.io/pfxqb/overview)
+
+{{< spoiler text="More, with an example" >}}
+They help users recognize and understand the dynamics of privilege and how these might influence authorship decisions. The questions can be used as a starting point for discussions about fairness and equity in academic contributions.
+
+> **Example Question**: “Do the people I collaborate with hold similar levels of privilege to me?”
+{{< /spoiler >}}
+
+</div>
+
+<div class="awop-material">
+
+**Case Study on First-Generation Academics (S6)**
+
+This case study explores how being a first-generation academic—someone whose parents did not progress beyond high school education—can affect an individual's expectations, opportunities, or resources, leading to disparities in contributions and authorship.
+
+[Open on OSF](https://osf.io/pfxqb/overview)
+
+{{< spoiler text="More, with an example" >}}
+The experiences of first-generation academics highlight multiple dimensions represented within the Academic Wheel of Privilege (AWoP), ranging from socio-cultural capital and household wealth in childhood, through networking opportunities and mentorship, to factors like ethnicity and culture.
+
+> **Example Insight**: “First-generation students often work more hours outside of academia to support their studies and have fewer interactions with faculty or mentors.”
+{{< /spoiler >}}
+
+</div>
 
-  > **Example Insight**: “First-generation students often work more hours outside of academia to support their studies and have fewer interactions with faculty or mentors.”
+<div class="awop-material">
 
-* **Illustrated Examples of Academic Privilege/Disadvantage (S7)**: These visuals serve as a relatable way to comprehend complex concepts of privilege and disadvantage. They depict the varied experiences of individuals within academic spaces. It brings attention to how privilege or disadvantage from early childhood influences an individual's academic opportunities and career trajectory. 
+**Illustrated Examples of Academic Privilege/Disadvantage (S7)**
 
-  > **Example Scenario**: “A scholar from a less privileged background might face significant barriers in networking and accessing funding compared to their more privileged counterparts.”
+These visuals serve as a relatable way to comprehend complex concepts of privilege and disadvantage.
 
-* **Detailed Bibliography on Socio-Cultural Identities (S8)**: This extensive resource provides in-depth understanding and research on the 24 identity categories we present in the Academic Wheel of Privilege. It supports users in exploring the intersectionality of different identities and their impact on academic careers.
+[Open on OSF](https://osf.io/pfxqb/overview)
 
-  > **Example Topic**: How caring duties demand extra responsibilities, time, money and resources, regardless of the age and support needs of the person(s) who requires care. Greater time and frequency spent on caring duties will have a greater impact on the academic opportunities of the caregiver (e.g. reduced work hours, ability to network/attend conferences). Those who spend less time caring for another person have greater privilege.
+{{< spoiler text="More, with an example" >}}
+They depict the varied experiences of individuals within academic spaces. It brings attention to how privilege or disadvantage from early childhood influences an individual's academic opportunities and career trajectory.
 
-* **Syllabus for Learning on Equity, Justice, and Accessibility (S9)**: This curated syllabus covering 14 topics is designed to support users at different stages of their journey towards equity and justice in academia. It includes structured learning paths, suggested activities and resources tailored to varying levels of familiarity and expertise.
+> **Example Scenario**: “A scholar from a less privileged background might face significant barriers in networking and accessing funding compared to their more privileged counterparts.”
+{{< /spoiler >}}
 
-  > **Example Topic**: Academic futures: Exploring grassroots initiatives to improve academia. 
+</div>
+
+<div class="awop-material">
+
+**Detailed Bibliography on Socio-Cultural Identities (S8)**
+
+This extensive resource provides in-depth understanding and research on the 24 identity categories we present in the Academic Wheel of Privilege.
+
+[Open on OSF](https://osf.io/pfxqb/overview)
+
+{{< spoiler text="More, with an example" >}}
+It supports users in exploring the intersectionality of different identities and their impact on academic careers.
+
+> **Example Topic**: How caring duties demand extra responsibilities, time, money and resources, regardless of the age and support needs of the person(s) who requires care. Greater time and frequency spent on caring duties will have a greater impact on the academic opportunities of the caregiver (e.g. reduced work hours, ability to network/attend conferences). Those who spend less time caring for another person have greater privilege.
+{{< /spoiler >}}
+
+</div>
+
+<div class="awop-material">
+
+**Syllabus for Learning on Equity, Justice, and Accessibility (S9)**
+
+This curated syllabus covering 14 topics is designed to support users at different stages of their journey towards equity and justice in academia.
+
+[Open on OSF](https://osf.io/pfxqb/overview)
+
+{{< spoiler text="More, with an example" >}}
+It includes structured learning paths, suggested activities and resources tailored to varying levels of familiarity and expertise.
+
+> **Example Topic**: Academic futures: Exploring grassroots initiatives to improve academia.
+{{< /spoiler >}}
+
+</div>
 
 ## AWoP in Use 
 ---
 
 The AWoP is already being recognized and implemented in various settings, including:
 - [UK Research Integrity Office (UKRIO)](https://ukrio.org/ukrio-resources/equality-diversity-and-inclusion/academic-wheel-of-privilege/)
-- Other publications and web pages (add more links as they become available)
 
 ## Contact Us
 ---
@@ -115,7 +170,10 @@ For more information, please contact us: awop@forrt.org.
 
 ## How to cite us
 ---
-> Middleton, S. L., Sulik, J., Iley, B., Elsherif, M. M., & Azevedo, F. (2026). The Academic Wheel of Privilege: An equity-based tool for authorship order. [Preprint] https://osf.io/preprints/metaarxiv/af4nk.
+
+{{< citation-card >}}
+Middleton, S. L., Sulik, J., Iley, B., Elsherif, M. M., & Azevedo, F. (2026). The Academic Wheel of Privilege: An equity-based tool for authorship order. [Preprint] https://osf.io/preprints/metaarxiv/af4nk.
+{{< /citation-card >}}
 
 ---
 
diff --git a/content/awop/index.md b/content/awop/index.md
index a06734106a0..9e1f4aea3a9 100644
--- a/content/awop/index.md
+++ b/content/awop/index.md
@@ -3,7 +3,13 @@
 type = "widget_page"
 headless = false  # Homepage is headless, other widget pages are not.
 title = "Academic Wheel of Privilege (AWoP)"
+# The meta description, written out so that it does not depend on how the page body opens.
+summary = "Who goes first? Authorship order shapes research impact and careers, yet decisions about it often overlook equity and favour privileged researchers. The Academic Wheel of Privilege (AWoP) is a toolkit, an app with educational materials, that helps teams decide authorship order equitably, especially where contributions are hard to compare or bias may play a part."
 # url = "/awop"
 sharing_image_resource = "AWOP.webp"
+# The wheel beside the title (layouts/partials/doors/page_hero.html).
+hero_image = "AWOP.webp"
+hero_image_alt = "The Academic Wheel of Privilege: 24 socio-cultural identities around the edge, grouped into six sectors, each with three rings of circles inside it that show privilege increasing towards the centre."
+hero_image_link = "Open the full-size wheel"
 sharing_image_alt = "The Academic Wheel of Privilege — a tool for authorship order decisions"
 +++
diff --git a/content/citation-politics/_index.md b/content/citation-politics/_index.md
index a74d00ed78b..341acb4e027 100644
--- a/content/citation-politics/_index.md
+++ b/content/citation-politics/_index.md
@@ -1,18 +1,18 @@
 ---
 summary: "Citations can be thought of as a currency in the academy, where more citations equals more prestige. While the system assumes a meritocracy—where higher citation counts supposedly indicate higher quality because a work is deemed valuable and legitimate by peers—this perspective ignores inherent biases and systemic inequalities."
 type: citation_politics
+heading_title: "Towards Citational Justice"
+subtitle: "A toolkit to encourage thoughtful citation"
 url: "/citation-politics/"
 sharing_image: "img/citation-politics-toolkit.webp"
 sharing_image_alt: "Towards Citational Justice Across the Whole Research Cycle — a wheel of citation politics tools and practices for planning, project, paper, and publication stages"
+# The wheel beside the title (layouts/partials/doors/page_hero.html).
+# A copy of static/img/citation-politics-toolkit.webp beside the page, so the opening shows a resized version.
+hero_image: "wheel.webp"
+hero_image_alt: "Towards Citational Justice Across the Whole Research Cycle: a wheel of citation politics tools and practices for the planning, project, paper and publication stages"
+hero_image_link: "Open the full-size wheel"
 ---
 
-<div style="text-align: center; margin: 1rem 0;">
-  <h1>Towards Citational Justice</h1>
-  <p style="font-size: 1.25rem; color: #6c757d; margin-top: 0.5rem;">
-    A toolkit to encourage thoughtful citation
-  </p>
-</div>
-
 # Overview
 
 ---
@@ -59,14 +59,14 @@ This guide will walk you through using the Citational Justice Toolkit to conduct
 This material will help you spread the word about citational justice in your own teaching.
 
 ### Diversify Your Content Workshop
-This workshop will guide you through applying the Citational Justice Workshop to teaching content using focused questions to target changes. In development in English and Spanish.
+This workshop will guide you through applying the Citational Justice Toolkit to teaching content using focused questions to target changes. In development in English and Spanish.
 
 # Get involved!
 
 --- 
 
-This toolkit and accompanying manuscript are only the first piece of work produced by the FORRT Citational Politics Working Group.
-For **FORRT’s Citation Politics Team** [(#citation-politics)](https://forrt.slack.com/archives/C074E9LDES2), we devised a few action points we will be working on:
+This toolkit and accompanying manuscript are only the first piece of work produced by FORRT’s Team Citation Politics.
+For **FORRT’s Team Citation Politics** [(#citation-politics)](https://forrt.slack.com/archives/C074E9LDES2), we devised a few action points we will be working on:
 
 ### Toolkit Expansion and Infrastructure Building
 - Modularize the toolkit by audience: for authors, editors, instructors, students.
@@ -79,8 +79,8 @@ For **FORRT’s Citation Politics Team** [(#citation-politics)](https://forrt.sl
 - Conduct longitudinal citation audits by field or journal using gender, region, epistemology as categories.
 - Develop or refine methods for ethical demographic inference using community consultation and validation.
 - Benchmark (per field and per category) citational diversity.
-- Integrate and expand categories with Academic Wheel of Privilege’s. 
-- Study via Dimensions & Altimetric data to see whether citations across papers with low and high diversity rank higher or lower on Dimensions & Altimetric areas.
+- Integrate and expand categories with those of the Academic Wheel of Privilege. 
+- Study via Dimensions & Altmetric data to see whether citations across papers with low and high diversity rank higher or lower on Dimensions & Altmetric areas.
 
 
 ### Pedagogical Integration
@@ -107,7 +107,7 @@ For **FORRT’s Citation Politics Team** [(#citation-politics)](https://forrt.sl
 
 <br>
 
-If you see yourself in any of these plans or have any other ideas or suggestions for development of the toolkit, or other ways of engaging with citational practice or patterns (especially as it relates to open research), get in touch FORRT’s Slack[channel #citation-politics](https://forrt.slack.com/archives/C074E9LDES2), email the team at citation-politics@forrt.org, or DM either Team Co- Lead **Sarah Sauvé** or **Helena Gellersen** on [FORRT’s Slack](https://join.slack.com/t/forrt/shared_invite/enQtODMwODI0OTk4ODgzLTM0ZTQ3NDk5MzA1ZjBmNWJjYTVlN2Y2YTk0ZTJhYTY5NDliMDYzMjg2MWE0ZDRhOTY0ZDY3OTRlNDA4ODQ3NjQ). 
+If you see yourself in any of these plans or have any other ideas or suggestions for development of the toolkit, or other ways of engaging with citational practice or patterns (especially as it relates to open research), get in touch via the [#citation-politics channel on FORRT’s Slack](https://forrt.slack.com/archives/C074E9LDES2), email the team at citation-politics@forrt.org, or DM either Team Co-Lead **Sarah Sauvé** or **Helena Gellersen** on [FORRT’s Slack](https://join.slack.com/t/forrt/shared_invite/enQtODMwODI0OTk4ODgzLTM0ZTQ3NDk5MzA1ZjBmNWJjYTVlN2Y2YTk0ZTJhYTY5NDliMDYzMjg2MWE0ZDRhOTY0ZDY3OTRlNDA4ODQ3NjQ). 
 
 ***Cite as:***
 > Sauvé, S. A., Middleton, S. L., Gellersen, H., & Azevedo, F. (2025, July 31). In Pursuit of Citational Justice: A Toolkit for Equitable Scholarship. https://doi.org/10.31222/osf.io/qjecy_v2
diff --git a/content/citation-politics/toolkit/index.md b/content/citation-politics/toolkit/index.md
index 06efbcf755d..ebc31f76380 100644
--- a/content/citation-politics/toolkit/index.md
+++ b/content/citation-politics/toolkit/index.md
@@ -1,5 +1,6 @@
 ---
 type: citation_politics
+heading_title: "Citation Politics Toolkit"
 url: "/citation-politics/toolkit/"
 # Meta description: the page body is a shortcode whose HTML would otherwise
 # appear as text in the auto-generated summary.
@@ -9,9 +10,3 @@ sharing_image_alt: "Towards Citational Justice Across the Whole Research Cycle 
 ---
 
 {{< citation-politics-toolkit >}}
-
-
-{{< toolkit >}}
-
-***Cite as:***
-> Sauvé, S. A., Middleton, S. L., Gellersen, H., & Azevedo, F. (2025, July 31). In Pursuit of Citational Justice: A Toolkit for Equitable Scholarship. https://doi.org/10.31222/osf.io/qjecy_v2
diff --git a/content/citation-politics/wheel.webp b/content/citation-politics/wheel.webp
new file mode 100644
index 00000000000..2cf7fb4d016
Binary files /dev/null and b/content/citation-politics/wheel.webp differ
diff --git a/content/clusters/FORRT_Clusters.webp b/content/clusters/FORRT_Clusters.webp
index e1b5996a653..b31d755adac 100644
Binary files a/content/clusters/FORRT_Clusters.webp and b/content/clusters/FORRT_Clusters.webp differ
diff --git a/content/coc.md b/content/coc.md
index 53de236ea4e..94127e413e7 100644
--- a/content/coc.md
+++ b/content/coc.md
@@ -1,7 +1,6 @@
-
-
-
-# Code of Conduct
+---
+title: Code of Conduct
+---
 
 FORRT is committed to making participation in our community a harassment-free experience for everyone. We welcome people regardless of age, body size, disability (visible or invisible), ethnicity, sex characteristics, gender identity and expression, level of experience, education, socioeconomic status, nationality, personal appearance, race, religion, neurodiversity, or sexual identity and orientation.
 
@@ -20,7 +19,7 @@ The following are examples of behaviour that will not be tolerated in any FORRT
 
 **Where does the Code of Conduct apply?**
 
-The code of conduct applies to all FORRT spaces (e.g. Website and FORRT events), and in any situation where you are representing FORRT (e.g, online or in-person conferences, workshops, or events).By engaging with FORRT either via the Slack channel or by being a part of a project, you are agreeing to this code of conduct.
+The code of conduct applies to all FORRT spaces (e.g. Website and FORRT events), and in any situation where you are representing FORRT (e.g., online or in-person conferences, workshops, or events). By engaging with FORRT either via the Slack channel or by being a part of a project, you are agreeing to this code of conduct.
 
 
 **What are the consequences for violating the Code of Conduct?**
@@ -39,7 +38,8 @@ If possible, please report the following information:
 * Your account of what occurred, and if you believe the incident is ongoing. 
 * If there is a publicly available record (e.g. a Slack conversation), please include a link. 
 * Any additional information that may be helpful.
-* Who will deal with the report?
+
+**Who will deal with the report?**
 
 All reports will be passed along to the Ethics Committee, who will decide on appropriate action. After filing a report, a representative from the Ethics Committee will contact you personally, review the incident, follow up with any additional questions, and make a decision as to how to respond.
 
diff --git a/content/cv/cv.md b/content/cv/cv.md
index 7f484ddf19e..0c64e78a2e6 100644
--- a/content/cv/cv.md
+++ b/content/cv/cv.md
@@ -8,7 +8,7 @@ headless = true  # This file represents a page section.
 active = true  # Activate this widget? true/false
 weight = 10  # Order that this section will appear.
 
-title = "Curriculum Vitae of FORRT"
+title = "CV template: crediting your FORRT work"
 subtitle = ""
 
 [design]
@@ -56,7 +56,7 @@ subtitle = ""
 What we have accomplished at FORRT is only possible because of the work of so many scholars who dedicate their time and effort on a voluntary basis. We would like to help our members take credit for their work at FORRT. Team-science collaborations represent a new way to do science and often it is not clear (especially to ECRs) how to take credit for their contributions. With the CV provided below, we hope to give an example to FORRT’s members of how their contributions could be showcased in their personal CVs. The [LaTeX code](https://github.com/forrtproject/cv) is also open so that everyone can use it as a template for their own CVs as well. 
 <br>
 
-# {{< embed name="FORRT_cv.pdf" height=1000 >}}
+{{< embed name="FORRT_cv.pdf" height=1000 >}}
 
 
 
diff --git a/content/cv/index.md b/content/cv/index.md
index 469b5bee2db..cbfbaa36907 100644
--- a/content/cv/index.md
+++ b/content/cv/index.md
@@ -2,7 +2,7 @@
 # FORRT page
 type = "widget_page"
 headless = false  # Homepage is headless, other widget pages are not.
-title = "FORRT CV"
+title = "CV template"
 # url = "/forrt/cv"
 +++
 
diff --git a/content/dei/2-intro-text.md b/content/dei/2-intro-text.md
index 6763e225c64..4f70698f4db 100644
--- a/content/dei/2-intro-text.md
+++ b/content/dei/2-intro-text.md
@@ -57,14 +57,14 @@ The current model of scientific production and higher-education reproduces globa
 
 In addition, as open science principles begin to be more commonly accepted and valued in our research communities, there is a risk that these scientists will face structural barriers to participating in the communities where these tools are developed and taught. While open science practices have enormous potential to benefit *some* researchers, it is likely that scholars from currently underrepresented groups may not benefit—at least to the same extent—from open science practices. In other words, equity and inclusion are not guaranteed by open science practices without an active effort to achieve them.
 
-To mitigate the detrimental effects on the access to, learning about, and production of scientific content, it is paramount to create conditions for knowledge to become a public good - accessible to all members of society (Steltenpohl, Anderson, & Daniels, 2019). One way to achieve this goal is to integrate the teaching and mentoring of subject matters with open and reproducible research practices. Higher education institutions, and scholars therein, can then maximize every student’s likelihood of present and future engagement with resources, facilitating the acquisition of knowledge and bolstering opportunities that would otherwise be inaccessible to disadvantaged individuals. In leveling the playing field, abiding scholars and institutions would contribute towards greater diversity and democratization of science, and improved scientific literacy, consumption, and participation.
+To mitigate the detrimental effects on the access to, learning about, and production of scientific content, it is paramount to create conditions for knowledge to become a public good - accessible to all members of society (Steltenpohl, Anderson, & Daniels, 2019). One way to achieve this goal is to integrate the teaching and mentoring of subject matters with open and reproducible research practices. Higher education institutions, and scholars therein, can then maximize every student’s likelihood of present and future engagement with resources, facilitating the acquisition of knowledge and bolstering opportunities that would otherwise be inaccessible to disadvantaged individuals. In leveling the playing field, scholars and institutions that abide by these practices would contribute towards greater diversity and democratization of science, and improved scientific literacy, consumption, and participation.
 
 Hence, we at FORRT, have devised ***4 ways*** to be proactive in the outreach to the community.
 
 <br>
 
 * FORRT's ***Equity in Open Scholarship***
-   - Together with the <a href="https://www.sparksociety.org/">SPARK Society</a> and <a href="hhttps://improvingpsych.org/">SIPS</a>, we are aligning social justice & representation with open scholarship, rigor, & reproducible research*, where our aim is to focus our discussion on the needs and concerns of researchers from historically marginalized groups.
+   - Together with the <a href="https://www.sparksociety.org/">SPARK Society</a> and <a href="https://improvingpsych.org/">SIPS</a>, we are aligning social justice & representation with open scholarship, rigor, & reproducible research, where our aim is to focus our discussion on the needs and concerns of researchers from historically marginalized groups.
    - Please check our [web portal for advocacy, events, and collated resources](/equityinos).
 
 <br>
@@ -80,7 +80,7 @@ Hence, we at FORRT, have devised ***4 ways*** to be proactive in the outreach to
    - FORRT also aims to document this process and give proper commendation to those Mentors willing to give this a try so that our community is also supportive of researchers’ visibility, prestige, tenure and promotion reviews.
        - If you are interested in serving as a Bachelor's or Master's Mentor, [please fill in the G-form below "For mentors" (in Red-ish)](#form-mentor) where we ask you a few questions about your expertise and how you would like to volunteer. 
        - If you are interested in getting help as a Mentee, [please fill in the G-form below "For mentees" (in Green-ish)](#form-mentee).
-       - How does it work? For every person who fill in the Mentees form, FORRT community will try to find a volunteer Mentor with appropriate skills and fitting expertise. Provided that a match can be found, we will contact the Mentor for their approval, and then put mentor and menteee in contact with each other.
+       - How does it work? For every person who fills in the Mentees form, the FORRT community will try to find a volunteer Mentor with appropriate skills and fitting expertise. Provided that a match can be found, we will contact the Mentor for their approval, and then put mentor and mentee in contact with each other.
 
 <br>
 
@@ -88,7 +88,7 @@ Hence, we at FORRT, have devised ***4 ways*** to be proactive in the outreach to
    - Underprivileged and underrepresented minorities who are early-career researchers suffer racism, discrimination and significant barriers to their professional development, and as 'structural racism will not go away without intentional action from those who have historically wielded the most power' (Roberson, 2020, p. 773), we at FORRT would like to be pro-active and contribute positively to a fairer academia. FORRT aims to promote the thriving of underprivileged and underrepresented students, trainees and early career scholars by serving as a link between willing mentors and mentees in their engagement with academia, its several duties (e.g., application materials, grant/funding proposals, academic writing, research development, statistical analyses, etc.), as well as open and reproducible science practices. It is FORRT's goal to chip away at the barriers that exist and to promote a more inclusive environment for all (Roberson, 2020). 
        - If you are interested in serving as a Mentor (providing help), [please fill in the G-form below "For mentors" (in Red-ish)](#form-mentor) where we ask you a few questions about your expertise and how you want to volunteer. 
        - If you are interested in getting help as a Mentee, [please fill in the G-form below "For mentees" (in Green-ish)](#form-mentee).
-       - How does it work? For every person who fill in the Mentees form, FORRT community will try to find a volunteer Mentor with appropriate skills and fitting expertise. Provided that a match can be found, we will contact the Mentor for their approval, and then put mentor and menteee in contact with each other.
+       - How does it work? For every person who fills in the Mentees form, the FORRT community will try to find a volunteer Mentor with appropriate skills and fitting expertise. Provided that a match can be found, we will contact the Mentor for their approval, and then put mentor and mentee in contact with each other.
 
 
 <br>
@@ -97,6 +97,6 @@ Hence, we at FORRT, have devised ***4 ways*** to be proactive in the outreach to
 
 * Henrich, J., Heine, S. J., & Norenzayan, A. (2010). Most people are not WEIRD. Nature, 466(7302), 29-29.
 * Lee, J. J. (2016). Is science only for the rich?. Nature, 537(7621), 466-467.
-* Steltenpohl, C. N., Daniels, K. M., & Anderson, A. J. (2020). Giving Community Psychology Away: A case for open access publishing.
+* Steltenpohl, C. N., Anderson, A. J., & Daniels, K. M. (2019). Giving Community Psychology Away: A case for open access publishing. Global Journal of Community Psychology Practice, 10(3). https://doi.org/10.17161/gjcpp.v10i3.20693
 * Roberson, M. L. (2020). On supporting early-career Black scholars. Nature Human Behaviour, 4(8), 773-773. https://doi.org/10.1038/s41562-020-0926-6
 
diff --git a/content/dei/calendar-mentorship.md b/content/dei/calendar-mentorship.md
index a55f916b4ec..0ac048d02de 100644
--- a/content/dei/calendar-mentorship.md
+++ b/content/dei/calendar-mentorship.md
@@ -56,4 +56,4 @@ classtitle = "text-center"
 
 Below you find FORRT's community calendar containing scheduled events.
 
-{{< click_to_load src="https://calendar.google.com/calendar/embed?src=forrtproject%40gmail.com&ctz=Europe%2FBerlin" provider="Google Calendar" label="This calendar" style="border: 0" width="100%" height="600" >}}
\ No newline at end of file
+{{< click_to_load src="https://calendar.google.com/calendar/embed?src=forrtproject%40gmail.com&ctz=Europe%2FBerlin&mode=AGENDA" provider="Google Calendar" label="This calendar" title="FORRT community calendar" style="border: 0" width="100%" height="600" >}}
\ No newline at end of file
diff --git a/content/dei/form-mentee.md b/content/dei/form-mentee.md
index 1a3d684f069..265eb5d49ff 100644
--- a/content/dei/form-mentee.md
+++ b/content/dei/form-mentee.md
@@ -50,4 +50,4 @@ subtitle = "Fill out the form below or ***[open the Google form in a new window]
  css_class = "text-center"
 +++
 
-{{< gform src="1FAIpQLSfY6yQ2givfg1TBoCuh_55HrUE7YsEjKAIj0-4MidII_3LSEg" width="100%" height="500px" alt="Loading..." >}}
\ No newline at end of file
+{{< gform src="1FAIpQLSfY6yQ2givfg1TBoCuh_55HrUE7YsEjKAIj0-4MidII_3LSEg" width="100%" height="900px" alt="Loading..." >}}
\ No newline at end of file
diff --git a/content/dei/form-mentor.md b/content/dei/form-mentor.md
index 25b098361ab..c907413823f 100644
--- a/content/dei/form-mentor.md
+++ b/content/dei/form-mentor.md
@@ -52,4 +52,4 @@ subtitle = "Fill out the form below or ***[open the Google form in a new window]
 +++
 
 
-{{< gform src="1FAIpQLSfkbhb2qSxj_wj5qXYQAFZZ0WxkFyLChL0ZFYnWL0QVMaSw8w" width="100%" height="500px" alt="Loading..." >}}
\ No newline at end of file
+{{< gform src="1FAIpQLSfkbhb2qSxj_wj5qXYQAFZZ0WxkFyLChL0ZFYnWL0QVMaSw8w" width="100%" height="900px" alt="Loading..." >}}
\ No newline at end of file
diff --git a/content/educators-corner/001-Representation-HeatherUrry/index.md b/content/educators-corner/001-Representation-HeatherUrry/index.md
index 23ab6503f51..496f5eb60eb 100644
--- a/content/educators-corner/001-Representation-HeatherUrry/index.md
+++ b/content/educators-corner/001-Representation-HeatherUrry/index.md
@@ -93,5 +93,5 @@ Meanwhile, [here are some of my slides minus film clips and the email](https://o
 ---
 <br>
 
-*Editor's note: The present text is an adapted version of widely shared [Twitter thread](https://twitter.com/HeatherUrry/status/1312104732308115457?s=20) which resonated with so many of us. We thought it is of general interest and deserved to be immortalized, and hence we approached Heather to adapt the thread to post it here. Importantly, in addition to writing extremely current and relevant threads, Heather has also inspired the creation of FORRT. Indeed, FORRT was initiated at the 2018 meeting of the [Society for the Improvement of Psychological Science (SIPS)](https://improvingpsych.org/) in Heather's [“Teaching replicable and reproducible science”](https://osf.io/x7d45/) hackathon with Kristen Lane.*  
+*Editor's note: The present text is an adapted version of widely shared [Twitter thread](https://twitter.com/HeatherUrry/status/1312104732308115457?s=20) which resonated with so many of us. We thought it is of general interest and deserved to be immortalized, and hence we approached Heather to adapt the thread to post it here. Importantly, in addition to writing extremely current and relevant threads, Heather has also inspired the creation of FORRT. Indeed, FORRT was initiated at the 2018 meeting of the [Society for the Improvement of Psychological Science (SIPS)](https://improvingpsych.org/) in Heather's [“Teaching replicable and reproducible science”](https://osf.io/x7d45/) hackathon with Kristin Lane.*  
 
diff --git a/content/educators-corner/003-developing-tools/index.md b/content/educators-corner/003-developing-tools/index.md
index 4bd074749d5..efcd9b9896a 100644
--- a/content/educators-corner/003-developing-tools/index.md
+++ b/content/educators-corner/003-developing-tools/index.md
@@ -44,7 +44,7 @@ With around three hundred different software packages and tools that we knew wer
 
 As the list grew, we enlisted the help of a few master students, and started collecting more data: who built these tools, were they free or paid, what cluster of similar tools would they belong to, when were they built, based on the information available could we tell whether they were up to date, scaling, or failed, could we find papers that cited these tools, were the creators recommending a citation etc. 
 
-When we hit 400 software packages/tools, we knew we had to promote this list and share it in a way that researchers would actually stumble upon it and have the opportunity to reference it in a lecture or paper. So we wrote a [whitepaper summarizing the big trends on the development of tools and tech for social science research](https://uk.sagepub.com/en-gb/eur/technologies-for-social-science-research). We learned that both commercial and non-commercial tools are popular within the social sciences, but the ones that last longer and are more successful focus beyond the discipline and almost always have a person or teams of people dedicated to raising funds or expanding the community of users and contributors. 
+When we hit 400 software packages/tools, we knew we had to promote this list and share it in a way that researchers would actually stumble upon it and have the opportunity to reference it in a lecture or paper. So we wrote a [whitepaper summarizing the big trends on the development of tools and tech for social science research](https://www.sagepub.com/explore-our-content/white-papers/2024/10/18/the-ecosystem-of-technologies-for-social-science-research). We learned that both commercial and non-commercial tools are popular within the social sciences, but the ones that last longer and are more successful focus beyond the discipline and almost always have a person or teams of people dedicated to raising funds or expanding the community of users and contributors.
 
 At 400 software packages/tools, we were still not sure the list was big enough. We then focused on specific methods and researched all the tools available to carry out that method or task within the research process. We looked at the evolution of technologies for that method in particular, as well as how it fits within the development of the method itself. We call these ‘deep dives’. We’ve done deep dives on tools for annotation, or tools for transcription, surveying tools,  tools for studying social media data, and we kept finding more software applications within each of these areas. We concluded these deep dives to be quite useful, as they enabled sharing slightly more comprehensive sub-lists of tools that could be used in different modules. We have now 543 tools on the list, and the number keeps growing.
 
diff --git a/content/educators-corner/004-Teaching-why-how-replication/index.md b/content/educators-corner/004-Teaching-why-how-replication/index.md
index 987eff9fe59..b39db0d7711 100644
--- a/content/educators-corner/004-Teaching-why-how-replication/index.md
+++ b/content/educators-corner/004-Teaching-why-how-replication/index.md
@@ -91,7 +91,7 @@ In contrast, distant replications (where you vary some aspect of the method) are
 
 I also use this exercise to highlight the importance of minimizing sampling error and fully documenting procedures; both sampling error and undocumented differences in procedure (“hidden moderators”) provide possible explanations for why replication results differ from original results. This highlights a somewhat hidden side benefit of replications: they force you to very carefully document a particular procedure.
 
-To illustrate how to document the procedure behind a replication study, I introduce the students to the “replication recipe” ([Brandt et al., 2014](https://doi.org/10.1016/j.jesp.2013.10.005)). The replication recipe provides a structured set of questions to guide the process of creating a method section for a replication study. As [an exercise](https://osf.io/j3pna/), I ask students to fill out the first section of the replication recipe with an article that I assign (I pre-selected two articles that are short and have a relatively simple research design). After the exercise, we discuss the process of using the replication recipe and identify issues that came up – including the poor reporting standards of most (but not all) psychology articles.
+To illustrate how to document the procedure behind a replication study, I introduce the students to the “replication recipe” {{< cite "BrandtEtAl2014" >}}. The replication recipe provides a structured set of questions to guide the process of creating a method section for a replication study. As [an exercise](https://osf.io/j3pna/), I ask students to fill out the first section of the replication recipe with an article that I assign (I pre-selected two articles that are short and have a relatively simple research design). After the exercise, we discuss the process of using the replication recipe and identify issues that came up – including the poor reporting standards of most (but not all) psychology articles.
 
 In the last part of this module, we discuss a way to choose replication targets. I teach a somewhat informal version of a framework developed by [Isager and colleagues (2020)](https://osf.io/preprints/metaarxiv/2gurz/). As [an exercise](https://osf.io/zjwcg/), the students use the framework to rate the value, uncertainty, and cost of doing the replication study that I assigned them. 
 
@@ -130,7 +130,7 @@ One last issue that comes out of the simulations is the number of assumptions th
 
 _Learning goals: To preregister something, create an OSF project & put the replication recipe in the registry. There’s evidence this helps make research more credible_
 
-The bulk of this module is focused around completing a pre-registration for the article assigned to the students in the previous modules. Because the workshop participants have already completed the first part of the replication recipe ([Brandt et al., 2014](https://doi.org/10.1016/j.jesp.2013.10.005)) for this article, they are already familiar with the article’s purpose and materials. For the first part of this module, the students complete the remainder of the replication recipe (or at least, as much as they can) as part of [the last exercise](https://osf.io/w35fp/) of the workshop.
+The bulk of this module is focused around completing a pre-registration for the article assigned to the students in the previous modules. Because the workshop participants have already completed the first part of the replication recipe {{< cite "BrandtEtAl2014" >}} for this article, they are already familiar with the article’s purpose and materials. For the first part of this module, the students complete the remainder of the replication recipe (or at least, as much as they can) as part of [the last exercise](https://osf.io/w35fp/) of the workshop.
 
 The replication recipe in hand, the students can complete a replication recipe-based preregistration on the Open Science Framework ([OSF](https://osf.io)). I walk the students through this process and introduce them to the basics of uploading materials on an OSF page. But the students already completed hard parts of preregistration as part of the previous exercises. 
 
@@ -151,3 +151,5 @@ I also briefly cover Registered Reports, which circumvent publication bias throu
 Replications have played a critical, though I think sometimes misunderstood, role in spurring the credibility revolution: they are one way of investigating the credibility of a particular research finding. The primary way they do this, I think, is by serving as a tool to highlight previously unknown pieces of information, either during the process of documenting the procedure (so it can be successfully executed) or via the results themselves. This role deserves to be underscored in teaching materials. I also think replications can be a useful venue to highlight other parts of the research process, such as decisions about what to research and resource planning. The structure of my finished workshop reflects this general outlook.
 
 If you find my materials useful, please use them! The materials are freely available in [this repository](https://osf.io/m9bzh/). Let’s use our teaching to pass the lessons of the credibility revolution on to the next generation of behavioral scientists.
+
+{{< references >}}
diff --git a/content/educators-corner/006-qualitative-OS-practices/index.md b/content/educators-corner/006-qualitative-OS-practices/index.md
index 42594a9638f..c830892f9a0 100644
--- a/content/educators-corner/006-qualitative-OS-practices/index.md
+++ b/content/educators-corner/006-qualitative-OS-practices/index.md
@@ -39,7 +39,7 @@ We thus gathered people interested in qualitative open science research in educa
 
 ### Output
 
-1. We started the resource list with articles that focus on the **basics of open science qualitative research**. These articles (and Twitter threads) dive into some of the reasons why open science work is important, such as opening the ‘Black box’ of research or helping replication in later studies. And others  also touch upon some of the murky issues of doing this work, like the fact that _quant _and _qual _researchers often have different ways of viewing the world and what truth is or can be. This is a good starting point so that you know that there will likely not be consensus on how to do this work well. However, if you read those and still want to try to incorporate open science into your qualitative projects, you can try this in any or all of the following areas: transparency/rigor, open materials, open access, and ethics. 
+1. We started the resource list with articles that focus on the **basics of open science qualitative research**. These articles (and Twitter threads) dive into some of the reasons why open science work is important, such as opening the ‘Black box’ of research or helping replication in later studies. And others  also touch upon some of the murky issues of doing this work, like the fact that _quant_ and _qual_ researchers often have different ways of viewing the world and what truth is or can be. This is a good starting point so that you know that there will likely not be consensus on how to do this work well. However, if you read those and still want to try to incorporate open science into your qualitative projects, you can try this in any or all of the following areas: transparency/rigor, open materials, open access, and ethics. 
 
 2. **Transparency & Rigor**. For transparency and rigor in qual research, this revolves around having enough information in your research so that other researchers A) know about the researcher(s) and their positionality and B) could do a similar study in the future, also known as replicating the study. For example, in the [COREQ guidelines](https://academic.oup.com/view-large/27217733), there is an entire domain dedicated to transparency regarding the researchers and their backgrounds (see picture below). Researchers must also describe the context, questions, use of theory, sampling method, interview techniques, and analysis in a way that someone could imagine themselves performing those tasks. One open science practice that qualitative researchers could use to some degree before even conducting the study is preregistration. Essentially it’s like the dissertation proposal where you lay out your plan in advance. Preregistration (and registered reports, the preregistration done with a specific journal with a publication agreement) helps to ensure that a researcher does not change their stated methods after the study is completed. Explaining every detail of the study might be difficult if you are under space constraints (as with publication length requirements), which brings us to #3: open materials.
 
diff --git a/content/educators-corner/007-easy-steps-to-elevate-your-mentoring/index.md b/content/educators-corner/007-easy-steps-to-elevate-your-mentoring/index.md
index d718138daf6..1a334c1da55 100644
--- a/content/educators-corner/007-easy-steps-to-elevate-your-mentoring/index.md
+++ b/content/educators-corner/007-easy-steps-to-elevate-your-mentoring/index.md
@@ -46,7 +46,7 @@ To get a handle on how my students are doing, and if there are issues in the lab
 
 <br><br>
 
-If you would the direct link to the google forms, [please follow this link.](https://docs.google.com/forms/d/e/1FAIpQLScGCi7iACgmVBhFcE7G90oPwuTs-g9CQkrDmOUoQ4FvoT9CfA/viewform)
+If you would like the direct link to the Google Forms, [please follow this link.](https://docs.google.com/forms/d/e/1FAIpQLScGCi7iACgmVBhFcE7G90oPwuTs-g9CQkrDmOUoQ4FvoT9CfA/viewform)
 
 Over time, I forget which new students I’ve given ‘key advice’ and expectations. So I made a document that I give to all new students. There is a different document for undergraduate Honours Thesis, MSc, and Ph.D. students, since my advice and expectations for those students differ. The document has basic things such as how many weeks ahead to give me drafts and that all students are expected to attend group meetings, and life things like you will work long hours sometimes, but this should be the exception, not the rule.
 
diff --git a/content/educators-corner/010-Neurodiversity/index.md b/content/educators-corner/010-Neurodiversity/index.md
index c5cbc6d3907..4a67690cee5 100644
--- a/content/educators-corner/010-Neurodiversity/index.md
+++ b/content/educators-corner/010-Neurodiversity/index.md
@@ -34,7 +34,7 @@ projects: []
 
 ### Who we are and why is this important?
 
-In academia, there has been much discussion about how open scholarship can benefit marginalised voices (e.g. Robertson, 2020; Pownall et al., 2020). However, neurodivergent individuals (e.g. dyslexic, autistic, ADHD) have received little attention. According to the [Higher Education Statistics Agency](https://www.hesa.ac.uk/data-and-analysis), only 2.2% in 2003/04,  3.9% in 2012/13 to 5.5% in 2019/2020 of staff at universities in the UK disclosed having a physical or neurological disability. However, the true figures are likely to be higher. Despite increased coverage and interest regarding disability issues in academia, concerns regarding negative perceptions of disability disclosure remain. More open discussions are taking place about the lived experiences of disabilities and chronic illnesses, as people with disability are becoming less stigmatised, leading to more disclosures being discussed. However, there is still a question being asked: ‘where are the disabled academics?’ (We are here but you don’t see us!). 
+In academia, there has been much discussion about how open scholarship can benefit marginalised voices (e.g. Robertson, 2020; {{< cite key="Pownall2020" bare="true" >}}). However, neurodivergent individuals (e.g. dyslexic, autistic, ADHD) have received little attention. According to the [Higher Education Statistics Agency](https://www.hesa.ac.uk/data-and-analysis), only 2.2% in 2003/04,  3.9% in 2012/13 to 5.5% in 2019/2020 of staff at universities in the UK disclosed having a physical or neurological disability. However, the true figures are likely to be higher. Despite increased coverage and interest regarding disability issues in academia, concerns regarding negative perceptions of disability disclosure remain. More open discussions are taking place about the lived experiences of disabilities and chronic illnesses, as people with disability are becoming less stigmatised, leading to more disclosures being discussed. However, there is still a question being asked: ‘where are the disabled academics?’ (We are here but you don’t see us!). 
 
 <br>
 
@@ -60,7 +60,7 @@ Many gatekeepers determine whether an individual is neurodivergent and these pro
 
 Despite this, people of different neurodivergent conditions or families of the people with the conditions have begun meeting and talking to each other about their experiences and one common shared experience is a  history of misinterpretation and mistreatment by the dominant neurotypical cultures and its institutions such as academia. As a result of centuries of oppression of disabled people worldwide and a hyper-normalised environment, in addition to seeing the disproportionate impact of the coronavirus pandemic on disabled students (see this amazing [paper ](https://doi.org/10.1007/s10639-021-10559-3)by Dr Joanna Zawadka), many neurodivergent and disabled staff feel discouraged in an environment that should aim to support them. They do not feel like they belong, their differences are seen as an impairment and their voice does not seem to matter. They do not see themselves represented in psychological science, academia, business, teaching or elsewhere.
 
-We are a group of early-career neurotypical and neurodivergent researchers that are a part of the Framework of Open Reproducible Research and Training (FORRT) community, aiming to make academia and the open scholarship community more open to neurodiversity. Everyone, no matter what they identify with, is welcome in this group.  We aim to discuss how open scholarship can be intersected with the neurodiversity movement, and emphasise how differences should be highlighted and accepted, whilst supporting  the idea of accessibility. Our neurodiversity team is a group that currently consists of individuals that have autism, dyspraxia/DCD, speech-language differences, ADHD, dyslexia, or are neurotypical allies. If you have these or other neurominorities and wish to be part of the team, you are more than welcome to join! 
+We are a group of early-career neurotypical and neurodivergent researchers that are a part of the Framework for Open and Reproducible Research Training (FORRT) community, aiming to make academia and the open scholarship community more open to neurodiversity. Everyone, no matter what they identify with, is welcome in this group.  We aim to discuss how open scholarship can be intersected with the neurodiversity movement, and emphasise how differences should be highlighted and accepted, whilst supporting  the idea of accessibility. Our neurodiversity team is a group that currently consists of individuals that have autism, dyspraxia/DCD, speech-language differences, ADHD, dyslexia, or are neurotypical allies. If you have these or other neurominorities and wish to be part of the team, you are more than welcome to join! 
 
 
 ### What do we want?
@@ -71,11 +71,11 @@ According to Feminist Standpoint theory (Harding, 1992; Pohlhaus, 2002), it is i
 
 The power structure that dominates psychology and social sciences is from white, male and able-bodied people who treat neurodivergent people as an _object_ of the conversation, not the _subject_. As argued by Jackson  (1998, p.8), "Each person is at once a subject for himself or herself - a _who _- and an object for others - a _what_. And though individuals speak, act, and work toward belonging to a world of others, they simultaneously strive to experience themselves as world makers". Once we consider that scientists are human, and neurodivergent people can be included in this research, then we can co-create projects that allow us to discover the truth about diversity from different perspectives. This is more commonly discussed in qualitative research but rarely even considered in quantitative research. In addition, with different perspectives, there is an emphasis on moving away from the typical White, Educated, Industrial, Rich, Democratic (WEIRD) samples that account for 80% of study samples but only 12% of the world population, despite the fact that this movement does not acknowledge the neurodiversity movement or neurominorities (e.g. autistic, ADHD, dyslexic). In addition, there is a lack of patient involvement in how to make the research more likely to improve the quality of life of neurodivergent people. The need to address this issue and to ensure disabled and marginalised individuals are directly included in research and policy-making decisions that affect them can be expressed by the commonly used slogan “Nothing about us without us”. Emancipatory and/or participatory approaches such as participatory action research (e.g. Bertilsdotter-Rosqvist et al., 2019; Fletcher-Watson et al., 2018; Grant & Kara, 2021; Leadbitter et al., 2021; Strang et al., 2019; Strang et al., 2021) have considerable potential for facilitating this type of collective knowledge creation and driving social change that benefits neurodivergent people in areas that may contrast with many mainstream research approaches.
 
-A recent movement has become important in education: open scholarship. This reflects the idea that knowledge of all kinds should be openly shared, transparent, rigorous, reproducible, replicable, accumulative, and inclusive (allowing for all knowledge systems). Open scholarship includes all activities that are not solely limited to research such as teaching and pedagogy. One key foundation of open scholarship is accessibility, a key facet that also belongs to the neurodiverse movement (e.g. Brown & Leigh, 2018; Brown et al., 2018). Accessibility and inclusion is where your content, activities and all their components are accessible to all people with disabilities, learning differences, mental health conditions or other health conditions that may affect their learning or engagement with the materials and activities, research activities, clinical training, and teaching (Victor et al., 2021a). It highlights the importance of embracing diversity and making everyone feel welcome and valued (see [information sheet](http://www.bristol.ac.uk/digital-education/inclusion/neurodiversity/)). Discussions have been, however, scarce regarding not only how open scholarship can advance the neurodiverse movement, but also how it can benefit from it. It is thus a priority to build community to discuss how the neurodiversity movement can be included in open scholarship, as the lived experience of neurodivergent individuals (including encountered barriers) may help to enhance accessibility, allowing open scholarship to be truly open (Whitaker & Guest, 2020). This in turn may help to dismantle the harmful stereotypes about disabled individuals (Devendorf et al., 2021), providing more specific provisions for neurodivergent and/or disabled researchers (e.g. virtual conferences; see Levitis et al., 2021). Furthermore, including this population in academia will help promote work-life balance, by denormalising overwork and practices that lead to burnout.  
+A recent movement has become important in education: open scholarship. This reflects the idea that knowledge of all kinds should be openly shared, transparent, rigorous, reproducible, replicable, accumulative, and inclusive (allowing for all knowledge systems). Open scholarship includes all activities that are not solely limited to research such as teaching and pedagogy. One key foundation of open scholarship is accessibility, a key facet that also belongs to the neurodiverse movement (e.g. Brown & Leigh, 2018; {{< cite key="BrownThompsonLeigh2018" bare="true" >}}). Accessibility and inclusion is where your content, activities and all their components are accessible to all people with disabilities, learning differences, mental health conditions or other health conditions that may affect their learning or engagement with the materials and activities, research activities, clinical training, and teaching (Victor et al., 2021a). It highlights the importance of embracing diversity and making everyone feel welcome and valued (see [information sheet](http://www.bristol.ac.uk/digital-education/inclusion/neurodiversity/)). Discussions have been, however, scarce regarding not only how open scholarship can advance the neurodiverse movement, but also how it can benefit from it. It is thus a priority to build community to discuss how the neurodiversity movement can be included in open scholarship, as the lived experience of neurodivergent individuals (including encountered barriers) may help to enhance accessibility, allowing open scholarship to be truly open {{< cite "Whitaker2020" >}}. This in turn may help to dismantle the harmful stereotypes about disabled individuals (Devendorf et al., 2021), providing more specific provisions for neurodivergent and/or disabled researchers (e.g. virtual conferences; see Levitis et al., 2021). Furthermore, including this population in academia will help promote work-life balance, by denormalising overwork and practices that lead to burnout.  
 
 There has been a recent shift towards the use of Universal Design for Learning (UDL) (i.e., an approach to teaching highlighting that academics/tutors should be proactively, not reactively, inclusive by making adjustments to their teaching without students having to disclose their disability to student disability services) in higher education (Burgstahler & Cory, 2010). UDL has several benefits: by offering a more flexible and inclusive practice, there is no need to disclose one’s disability, irrespective of student status (Clouder et al., 2020). In addition, making the assumption about the student’s intention based on your interpretation of their behaviour can be damaging for neurodivergent students’ self-esteem. University staff should recognise the different manners in which students may communicate and contribute, whilst being open to collaborating with students to find suitable approaches. Put simply, it can be described as neurodiversity involvement for pedagogy. 
 
-In addition, UDL allows students to engage in the material that best suits their learning. Traditionally, university students are assessed through essays/ dissertations, group/individual presentations or examinations with very little discussion  but neurodivergent students may find these types of assignments challenging that otherwise may succeed. UDL encourages educators to examine the students’ strengths, as opposed to weaknesses and allows students to have more choice. Learners could do a recorded presentation, as opposed to presenting in a group or present the skills they have acquired on the course in a different form that may suit them better. This would benefit the students in terms of better preparation for employment, by focusing on the student’s ability and professional values, as opposed to the challenges. This approach is  also fully aligned with the UK Professional Standards Framework in Higher Education (UKPSF) as it facilitates educators' continuous development (A5), focuses on respecting individual learners and diverse learning communities (V1), promotes participation in higher education and equality of opportunity for learners (V2) and acknowledges the wider context in which higher education operates recognising the implications for recognising the implications for professional practice (V4). Another example is that attendance should not be used as a marker of class engagement, as there are several variables that predict class attendance (e.g. keeping pace with other students, attentional demands, and attendance being socially impossible). At the start of class, educators should signpost the expected outline and inform students before an activity is finished or changed. This lack of physical attendance and/or inability to follow attentional cues is not evidence of a lack of engagement but that students may engage in ways that are not expected and we should meet them where they are now, as opposed to where we expect them to be. 
+In addition, UDL allows students to engage in the material that best suits their learning. Traditionally, university students are assessed through essays/ dissertations, group/individual presentations or examinations with very little discussion  but neurodivergent students may find these types of assignments challenging, even though they might otherwise succeed. UDL encourages educators to examine the students’ strengths, as opposed to weaknesses and allows students to have more choice. Learners could do a recorded presentation, as opposed to presenting in a group or present the skills they have acquired on the course in a different form that may suit them better. This would benefit the students in terms of better preparation for employment, by focusing on the student’s ability and professional values, as opposed to the challenges. This approach is  also fully aligned with the UK Professional Standards Framework in Higher Education (UKPSF) as it facilitates educators' continuous development (A5), focuses on respecting individual learners and diverse learning communities (V1), promotes participation in higher education and equality of opportunity for learners (V2) and acknowledges the wider context in which higher education operates recognising the implications for professional practice (V4). Another example is that attendance should not be used as a marker of class engagement, as there are several variables that predict class attendance (e.g. keeping pace with other students, attentional demands, and attendance being socially impossible). At the start of class, educators should signpost the expected outline and inform students before an activity is finished or changed. This lack of physical attendance and/or inability to follow attentional cues is not evidence of a lack of engagement but that students may engage in ways that are not expected and we should meet them where they are now, as opposed to where we expect them to be. 
 
 An important core property of UDL is to provide choice to allow students to develop agency in their own learning. Lecturers may feel that academic standards will not be maintained or students will not learn the learning outcomes but this choice aims to remove structural barriers that are faced when perhaps making a specific activity unnecessarily difficult, as opposed to reducing the academic level. For instance, lecture capture allows the student to learn in an environment that suits them and to learn at their own pace. Over decades, lecturers have questioned the effectiveness of lecture capture (Nordmann et al., 2021), but students such as dyslexic students, who otherwise struggled, may engage with learning and develop at their own speed (Nightingale et al., 2019). Rather than develop concerns on whether students will continue to engage, UDL offers students an opportunity to develop agency in their learning, a goal that lecturers should encourage. And applied more broadly to the academic employees’ relationships, UDL can also improve the academic culture, providing academic workers with opportunities to engage in their trade in a way that fits their neurocognitive style. Last but not least, UDL promotes and facilitates social justice and equality.
 
@@ -102,11 +102,13 @@ We need to discuss the challenges faced by neurodivergent people, so they can fe
 
 ### History of Team-Neurodiversity
 
-This project began on the 24th June 2021 meeting of the Society for the Improvement of Psychological Science in a roundtable discussion, [“How can open scholarship support evidence-based learning in people with neurodiverse conditions?”](https://docs.google.com/document/d/e/2PACX-1vSGIkhtdNoTURaeCkpCWrVS64md_U2cCXNape5nAa1cZOuz1vKGg66wblntTSiH6JtuS6FXDiu9PFm0/pub#id.jjj4ixyqr7k) led by Dr. Tamara Kalandaze and Dr. Mahmoud Elsherif. During this roundtable discussion, Dr. Amélie Gourdon-Kanhukamwe attended this discussion. As a result of a fruitful discussion, an initial framework was developed that led to a discussion about how open scholarship and neurodiversity intersect, and on the 28th of June 2021, Team Neurodiversity was created.  However, Team Neurodiversity did not have a home to discuss open scholarship and neurodiversity topics. The Framework for Open and Reproducible Research Training (FORRT) kindly offered us a base so we could establish ourselves and become a tour de force in this area. Although it started with five members, it has grown to a smashing total of 56 members based in more than 8 countries and is still increasing! The team has finished working on a database on neurodivergent scholars; a blog about open scholarship and its intersection with neurodiversity, which has been expanded to a position statement manuscript; a manuscript accepted in the British Psychological Society Cognitive Psychology Bulletin and a manuscript accepted in Association in Psychological Science. Currently, we are developing a survey to assess masking and neurodivergence in academia and the convergence between open scholarship values and neurodivergent values. We have a rotating leadership team which changes every six months. To promote diverse and inclusive leadership, anyone can put themselves forward for this role, regardless of their experience. The current team leaders are Magdalena Grose-Hodge and Bethan Iley. Thank you to our previous team leaders: Amélie Gourdon-Kanhukamwe, Flávio Azevedo, and Mahmoud Elsherif.
+This project began on the 24th June 2021 meeting of the Society for the Improvement of Psychological Science in a roundtable discussion, [“How can open scholarship support evidence-based learning in people with neurodiverse conditions?”](https://docs.google.com/document/d/e/2PACX-1vSGIkhtdNoTURaeCkpCWrVS64md_U2cCXNape5nAa1cZOuz1vKGg66wblntTSiH6JtuS6FXDiu9PFm0/pub#id.jjj4ixyqr7k) led by Dr. Tamara Kalandadze and Dr. Mahmoud Elsherif. During this roundtable discussion, Dr. Amélie Gourdon-Kanhukamwe attended this discussion. As a result of a fruitful discussion, an initial framework was developed that led to a discussion about how open scholarship and neurodiversity intersect, and on the 28th of June 2021, Team Neurodiversity was created.  However, Team Neurodiversity did not have a home to discuss open scholarship and neurodiversity topics. The Framework for Open and Reproducible Research Training (FORRT) kindly offered us a base so we could establish ourselves and become a tour de force in this area. Although it started with five members, it has grown to a smashing total of 56 members based in more than 8 countries and is still increasing! The team has finished working on a database on neurodivergent scholars; a blog about open scholarship and its intersection with neurodiversity, which has been expanded to a position statement manuscript; a manuscript accepted in the British Psychological Society Cognitive Psychology Bulletin and a manuscript accepted in the Association for Psychological Science. Currently, we are developing a survey to assess masking and neurodivergence in academia and the convergence between open scholarship values and neurodivergent values. We have a rotating leadership team which changes every six months. To promote diverse and inclusive leadership, anyone can put themselves forward for this role, regardless of their experience. The current team leaders are Magdalena Grose-Hodge and Bethan Iley. Thank you to our previous team leaders: Amélie Gourdon-Kanhukamwe, Flávio Azevedo, and Mahmoud Elsherif.
 
 
 
-## References
+{{< references >}}
+
+### Other references
 
 Bertilsdotter Rosqvist, H., Kourti, M., Jackson-Perry, D., Brownlow, C., Fletcher, K., Bendelman, D., & O'Dell, L. (2019). Doing it differently: emancipatory autism studies within a neurodiverse academic space. Disability & Society, 34(7-8), 1082-1101. https://doi.org/10.1080/09687599.2019.1603102
 
@@ -114,7 +116,6 @@ Botha M. (2021). Academic, Activist, or Advocate? Angry, Entangled, and Emerging
 
 Brown, N., & Leigh, J. (2018). Ableism in academia: where are the disabled and ill academics?. Disability & Society, 33(6), 985-989.  https:/doi.org/10.1080/09687599.2018.1455627
 
-Brown, N., Thompson, P., & Leigh, J. S. (2018). Making academia more accessible. Journal of Perspectives in Applied Academic Practice, 6(2), 82-90. https://doi.org/10.14297/jpaap.v6i2.348
 
 Burns, K. E., Pattani, R., Lorens, E., Straus, S. E., & Hawker, G. A. (2021). The impact of organizational culture on professional fulfillment and burnout in an academic department of medicine. PloS one, 16(6), e0252778. https://doi.org/10.1371/journal.pone.0252778
 
diff --git a/content/educators-corner/011-intersectionality-open-science/index.md b/content/educators-corner/011-intersectionality-open-science/index.md
index 2697869d2d7..381ac5a5709 100644
--- a/content/educators-corner/011-intersectionality-open-science/index.md
+++ b/content/educators-corner/011-intersectionality-open-science/index.md
@@ -34,7 +34,7 @@ projects: []
 
 ### 1. Globalization and diversity
 
-Psychological science has been repeatedly described as WEIRD, meaning Western, Educated, Industrial, Rich, and Democratic. In particular, the persistent use of predominately White and North American college students to study human behaviour has raised concerns about the generalizability of our findings, as well as our legitimacy as a science (Arnett, 2008; Henrich, Heine, & Norenzayan, 2010; IJzerman et al., 2021; Thalmayer et al., 2021; Tindle, 2021). Others argue that we should get rid of the dichotomy altogether (Ghai, 2021). 
+Psychological science has been repeatedly described as WEIRD, meaning Western, Educated, Industrial, Rich, and Democratic. In particular, the persistent use of predominately White and North American college students to study human behaviour has raised concerns about the generalizability of our findings, as well as our legitimacy as a science (Arnett, 2008; Henrich, Heine, & Norenzayan, 2010; IJzerman et al., 2021; Thalmayer et al., 2021; Tindle, 2021). Others argue that we should get rid of the dichotomy altogether (Ghai, 2021).
 
 **Here’s what you can do to enhance globalization and diversity within psychological science:**
 
@@ -46,7 +46,7 @@ Psychological science has been repeatedly described as WEIRD, meaning Western, E
 
 ### 2. Research integrity and applicability
 
-Many of us have been warned about the replication crisis in psychology (also commonly referred to as the replicability or reproducibility crisis, as well as the credibility revolution). Not unique to psychology, the crisis highlights that the results of many peer-reviewed scientific studies are either difficult or impossible to replicate (Open Science Collaboration, 2015). However, the legitimacy of the concern with regards to replication remains hotly contested (Feest, 2019; Maxwell, et al., 2015). 
+Many of us have been warned about the replication crisis in psychology (also commonly referred to as the replicability or reproducibility crisis, as well as the credibility revolution). Not unique to psychology, the crisis highlights that the results of many peer-reviewed scientific studies are either difficult or impossible to replicate {{< cite "Open_Science_Collaboration2015" >}}. However, the legitimacy of the concern with regards to replication remains hotly contested (Feest, 2019; Maxwell, et al., 2015).
 
 **Here’s what you can do to promote research integrity and applicability within psychological science:**
 
@@ -89,4 +89,6 @@ It is possible that I am overoptimistic about the future of psychological scienc
 * Spearhead initiatives (e.g., write a post for the [Educators’ Corner](https://forrt.org/educators-corner/)) 
 * Spread the word about FORRT (e.g., share this post with your colleagues, tag us on Twitter) 
 
-**Contact information**: Annalisa Myer ([amyer@gradcenter.cuny.edu](mailto:amyer@gradcenter.cuny.edu)), Twitter [@MyerAnnalisa](https://twitter.com/MyerAnnalisa).
\ No newline at end of file
+**Contact information**: Annalisa Myer ([amyer@gradcenter.cuny.edu](mailto:amyer@gradcenter.cuny.edu)), Twitter [@MyerAnnalisa](https://twitter.com/MyerAnnalisa).
+
+{{< references >}}
diff --git a/content/educators-corner/014-Students-Guide-to-Open-Science/index.md b/content/educators-corner/014-Students-Guide-to-Open-Science/index.md
index a774f403ca4..fea5a83bfd6 100644
--- a/content/educators-corner/014-Students-Guide-to-Open-Science/index.md
+++ b/content/educators-corner/014-Students-Guide-to-Open-Science/index.md
@@ -38,7 +38,7 @@ I am a ‘child of the replication crisis’. I completed my PhD in 2016 on 'ste
 ## What is this book about and why is it needed?
 By now, many researchers have heard about the ‘replication crisis’ that has swept research disciplines, and the fast-paced improvements brought about by open research reform. However, there is still a gap in educational practices – in the teaching of the replication crisis – which FORRT and its members strive to overcome. Furthermore, when trying to learn about the replication crisis and open science, it can feel overwhelming and there are lots of different resources in many different places. With this in mind, I wrote a “*A Student’s Guide to Open Science*” as a way of pulling together all of these various pieces of information and useful resources that are currently out there. 
 
-The book walks students (and their educators) through a recent history of the replication crisis in psychology, the causes and drivers of crises (including academic incentive structures, questionable research practices, and cognitive biases), and open science reform, its benefits and associated challenges. Importantly, to ensure that students understand how to put these new practices into practice, it also includes a handy, digestible guide to implementing open science practices such as preprints, preregistration, Registered Reports, and open materials, data, and code. It is my hope that this book becomes an essential guide to navigating the replication crisis. 
+The book walks students (and their educators) through a recent history of the replication crisis in psychology, the causes and drivers of crises (including academic incentive structures, questionable research practices, and cognitive biases), and open science reform, its benefits and associated challenges. Importantly, to ensure that students understand how to put these new practices into practice, it also includes a handy, digestible guide to implementing open science practices such as preprints, {{< term "Preregistration" "preregistration" >}}, {{< term "Registered Report" "Registered Reports" >}}, and open materials, data, and code. It is my hope that this book becomes an essential guide to navigating the replication crisis. 
 
 ## Pedagogic resources within the book
 This book is primarily aimed at students studying psychology at both undergraduate and postgraduate level, but throughout I include useful pedagogic resources that educators can use to teach the replication crisis and open science reform. For example, there is an activity where students plan to replicate a study and can understand the various difficulties they may stumble upon in their quest. Here, they find their favourite article from the journal it was published and walk themselves through different questions to assess whether there is enough information to perform an exact replication – what is the aim of the study? Do the researchers specify their main hypotheses? What is the research design? Are the measures they used detailed enough to understand how they were scored? Do they report whether (and how) they screened or cleaned their data? (see Box 1).
@@ -53,11 +53,7 @@ This same pedagogic activity can then be expanded to teach about open science re
 
 ![This activity asks students to write a preregistration for a replication study, using the As Predicted dot org template. The learning outcomes for this are: To understand how to transparently plan a study. To demonstrate understanding of how open science practices can aid transparency, replication, and reproducibility. To interpret research articles and apply this learning to conducting independent research studies.](aspredicted-template.webp)
 
-In addition to these pedagogic resources, the book also contains top tips for implementing open science practices into student’s research training, including for preprints, preregistration, Registered Reports, and open materials, data, and code. Whilst the focus is mainly on quantitative research, it also provides links and resources to qualitative research. In addition, throughout it discusses the many different organisations and initiatives that have shaped my own learning of open science (see Box 3), thus providing a detailed overview of everything we have learnt so far from the advent of the replication crisis through to current open science reform.
-
-**Box 3. Key resources to get started with open science.**
-
-{{% alert note %}}
+{{% callout title="Box 3. Key resources to get started with open science" %}}
 
 **Charlotte's Key Open Science Resources**
 
@@ -70,13 +66,15 @@ In addition to these pedagogic resources, the book also contains top tips for im
 - The [Open Research Calendar](https://openresearchcalendar.org/)
 - New meta-research articles via [MetaArXiv](https://osf.io/preprints/metaarxiv/)
 
-{{% /alert %}}
+{{% /callout %}}
+
+In addition to these pedagogic resources, the book also contains top tips for implementing open science practices into student’s research training, including for preprints, preregistration, Registered Reports, and open materials, data, and code. Whilst the focus is mainly on quantitative research, it also provides links and resources to qualitative research. In addition, throughout it discusses the many different organisations and initiatives that have shaped my own learning of open science (see Box 3), thus providing a detailed overview of everything we have learnt so far from the advent of the replication crisis through to current open science reform.
 
 ## Become a student of open science!
 The replication crisis and open science reform is not currently embedded within the teaching of psychology. It is my hope that with all of these wonderful new and ever-evolving resources, today’s students become critical consumers of science and pave the way to creating a truly robust, transparent, replicable, reproducible and representative psychological science.
 
 ## Author Bio & Contact: 
-Dr Charlotte Pennington is a Lecturer in Psychology at Aston University, Birmingham, a Fellow of the Higher Education Academy, and a member of FORRT. Her book, “*A Student’s Guide to Open Science: Using the Replication Crisis to Reform Psychology*” is available in all good bookstores and inspection copies are available from [McGraw Hill](https://www.mheducation.com.au/a-student-s-guide-to-open-science-using-the-replication-crisis-to-reform-psychology-9780335251162-aus) for review. If you have trouble accessing it, please let Charlotte know via the contact details below and she will do her best to help. 
+Dr Charlotte Pennington is a Lecturer in Psychology at Aston University, Birmingham, a Fellow of the Higher Education Academy, and a member of FORRT. Her book, “*A Student’s Guide to Open Science: Using the Replication Crisis to Reform Psychology*” is available in all good bookstores and inspection copies are available from [McGraw Hill](https://www.mheducation.co.uk/a-student-s-guide-to-open-science-using-the-replication-crisis-to-reform-psychology-9780335251162-emea-group) for review. If you have trouble accessing it, please let Charlotte know via the contact details below and she will do her best to help.
 
 Email: [c.pennington@aston.ac.uk](mailto:c.pennington@aston.ac.uk)
 
diff --git a/content/educators-corner/017-teaching-os-to-undergraduates/index.md b/content/educators-corner/017-teaching-os-to-undergraduates/index.md
index 9a7caf1c4a1..d798d3e634c 100644
--- a/content/educators-corner/017-teaching-os-to-undergraduates/index.md
+++ b/content/educators-corner/017-teaching-os-to-undergraduates/index.md
@@ -32,7 +32,7 @@ projects: []
 
 ### Main Text
 
-The replication crisis has raised many questions for researchers, but it also poses unique challenges for those teaching about science and the scientific process.  We now know that many scientific studies cannot be accurately reproduced or their findings replicated, and this has raised concerns about the validity and reliability of scientific research, leading to calls for increased transparency and reproducibility in scientific inquiry. 
+The replication crisis has raised many questions for researchers, but it also poses unique challenges for those teaching about science and the scientific process.  We now know that many scientific studies cannot be accurately reproduced or their findings replicated, and this has raised concerns about the validity and reliability of scientific research, leading to calls for increased transparency and {{< term "Reproducibility" "reproducibility" >}} in scientific inquiry. 
 
 For those involved in teaching science, it is therefore not possible to simply continue as we have been, for example, accepting and presenting published scientific works as the “truth” or final word on any given phenomenon. Rather, we need to take a step back and teach students about the entirety of the research process, both in its idealised form, and addressing the complex reality of a scientific process that is impacted by cognitive biases, human behaviour, and incentive structures. 
 
@@ -47,7 +47,7 @@ In exposing students to open research and to questions of research integrity, th
 #### The Course Content 
 The content presented here was jointly developed with colleagues at Lancaster University (Dr. Marina Bazhydai, Dr. Sally Linkenauger, Dr. Neil McLatchie), as part of two undergraduate psychology modules, formally listed as Research Integrity and Open Science I (PSYC123) and Research Integrity and Open Science II (PSYC124). 
 
-Because the courses assume no knowledge of the research process, the course first focusses on the scientific method, thinking about experimental design, and questions of confounds, reliability, and validity. Once we have that under our belts we move on to contrasting “traditional” approaches to research vs an “open science” approach, and cover topics of study preregistration, replications, and sample size considerations. 
+Because the courses assume no knowledge of the research process, the course first focusses on the scientific method, thinking about experimental design, and questions of confounds, reliability, and validity. Once we have that under our belts we move on to contrasting “traditional” approaches to research vs an “open science” approach, and cover topics of study {{< term "Preregistration" "preregistration" >}}, replications, and sample size considerations. 
 
 We then turn to some of the thornier questions science and scientists have been faced with: How do we determine what is true in science? How do we know which theories are well supported by evidence and which ones are not? How can we tell if researchers are trying to pull the wool over our eyes? To start to think about these questions we look at learning how to spot and avoid questionable research practices, in favour of practices that are open, transparent and reproducible. In this way, we think about some of the problems faced by researchers, such as cognitive biases, researcher flexibility in reporting outcomes, and even fraud. We ask how we can assess research findings in the face of such problems?
 
diff --git a/content/educators-corner/018-accessible-feedback-in-research/index.md b/content/educators-corner/018-accessible-feedback-in-research/index.md
index 4fd54187752..3139b5ebf8d 100644
--- a/content/educators-corner/018-accessible-feedback-in-research/index.md
+++ b/content/educators-corner/018-accessible-feedback-in-research/index.md
@@ -4,7 +4,7 @@
 title: "Accessible Feedback in Research"
 subtitle: "Can you help us transform research with more inclusive feedback practices?"
 summary: "Systemic underrepresentation of marginalised groups plagues academia, with existing feedback mechanisms often reinforcing these disparities. Our Leverhulme Trust-funded project aims to tackle this issue by mapping out inclusive feedback opportunities at each stage of the research cycle. Partnering with FORRT, we hope to evaluate the emerging opportunities for feedback, including those driven by the open scholarship movement, and create a community-maintained e-book to help researchers identify opportunities to receive better feedback."
-authors: ['Dr Thomas Evans, Roksana Sobolak, Magda Skubera, FORRT']
+authors: ['Thomas Rhys Evans', 'Roksana Sobolak', 'Magda Skubera', 'FORRT']
 tags: []
 categories: []
 date: 2024-09-03T15:30:59-04:00
@@ -64,7 +64,7 @@ Want to get started? The easiest first step is to take part in our survey: [Onli
 
 ### Contact information:
 
-Project Lead: Dr Thomas Evans, thomas.evans@greenwich.ac.uk 
+Project Lead: Dr Thomas Rhys Evans, thomas.evans@greenwich.ac.uk 
 
 Research Fellow: Roksana Sobolak, r.a.sobolak@greenwich.ac.uk 
 
diff --git a/content/educators-corner/019-Being-a-Minoritized-Early-Career-Researcher-in-Political-Psychology/index.md b/content/educators-corner/019-Being-a-Minoritized-Early-Career-Researcher-in-Political-Psychology/index.md
index 0d5cfcfd200..719b35631fe 100644
--- a/content/educators-corner/019-Being-a-Minoritized-Early-Career-Researcher-in-Political-Psychology/index.md
+++ b/content/educators-corner/019-Being-a-Minoritized-Early-Career-Researcher-in-Political-Psychology/index.md
@@ -35,7 +35,7 @@ Growing up in economically and politically unstable environments or being margin
 
 Our journey into researching minoritized groups began with a belief in the importance of diversity. However, our perspective has evolved with our experiences as minoritized ECRs, leading us to understand that researching minoritized groups isn't just about diversity; it's about rethinking our approach to research itself. We must question our foundational assumptions and methods to ensure they don't inadvertently perpetuate existing power structures. Intersectional approaches are crucial in this rethinking process. By examining the intersections of various identities, we can systematically uncover and challenge the assumptions embedded in our discipline.
 
-As minoritized researchers, we often expected to excel in established, less contentious areas to gain the credibility needed to pursue innovative, community-focused research. Diversifying the academic pipeline and conducting what we call "water is wet" research—validating what minoritized communities already know and experience—are key motivations for our work. Empirical evidence is necessary to substantiate lived experiences and influence policy and decision-making effectively. Political psychology still holds significant gaps, particularly in addressing intersectional differences and the “unknown of wet water.” Many foundational concepts in political psychology remain underexplored across different groups (i.e., the majority of the world). Addressing these gaps is essential for building robust, inclusive scientific knowledge production.
+As minoritized researchers, we are often expected to excel in established, less contentious areas to gain the credibility needed to pursue innovative, community-focused research. Diversifying the academic pipeline and conducting what we call "water is wet" research—validating what minoritized communities already know and experience—are key motivations for our work. Empirical evidence is necessary to substantiate lived experiences and influence policy and decision-making effectively. Political psychology still holds significant gaps, particularly in addressing intersectional differences and the “unknown of wet water.” Many foundational concepts in political psychology remain underexplored across different groups (i.e., the majority of the world). Addressing these gaps is essential for building robust, inclusive scientific knowledge production.
 
 Living in a time where politics is forced upon you and your existence has also shaped our understanding of minoritized groups. Witnessing ongoing protests and social movements firsthand has highlighted the importance of recognizing the agency and knowledge within these communities. Rather than speaking for minoritized groups, we aim to amplify their voices and learn from their experiences. Researching minoritized groups requires constant ethical reflection. It's crucial to ensure that our work benefits these communities and does not reinforce existing injustices and power structures. It is essential to acknowledge that most research on inequality and minoritization has been conducted by beneficiaries of the systems that produce inequality and minoritization. Therefore, the political biases of researchers while conducting these studies should not be ignored but systematically examined and recognized. Addressing these biases is essential for fostering a more equitable and inclusive academic environment by deconstructing what is seen as neutral, scientific, or a priori and showing that power structures are embedded in knowledge production. Conducting research on minoritized groups in political psychology demands a critical, intersectional approach that challenges existing power structures and amplifies marginalised voices. It's about rethinking our methods, validating lived experiences, and ensuring our work contributes to social justice and equity.
 
diff --git a/content/educators-corner/020-Community-Augmented-Meta-Analyses-in-Education/index.md b/content/educators-corner/020-Community-Augmented-Meta-Analyses-in-Education/index.md
index d9dd4190a72..774395bc2c2 100644
--- a/content/educators-corner/020-Community-Augmented-Meta-Analyses-in-Education/index.md
+++ b/content/educators-corner/020-Community-Augmented-Meta-Analyses-in-Education/index.md
@@ -44,7 +44,7 @@ Box 1.
 
 ***Platform – and a template.***
 
-The community-augmented approach therefore extends beyond the content development. Like existing [CAMAs](https://github.com/metahag/ELD-CAMA_source) that encourage ***forking*** and reusing established code, we aim to help meta-researchers with similar needs in developing their own database and platform with the template code we share. The beauty of it lies in the flexibility of the components. Users can take some components (e.g., only the SQL database) and build upon them to add new variables, improve the entire platform (e.g., add additional features or dynamic markdowns), or simply reuse it as is to build a platform in a different scientific filed (e.g., medicine). This flexibility facilitates incremental knowledge and collaboration, which is what ELD CAMA and FORRT both strive for. Repository: https://github.com/metahag/ELD-CAMA_source.
+The community-augmented approach therefore extends beyond the content development. Like existing [CAMAs](https://github.com/metahag/ELD-CAMA_source) that encourage ***forking*** and reusing established code, we aim to help meta-researchers with similar needs in developing their own database and platform with the template code we share. The beauty of it lies in the flexibility of the components. Users can take some components (e.g., only the SQL database) and build upon them to add new variables, improve the entire platform (e.g., add additional features or dynamic markdowns), or simply reuse it as is to build a platform in a different scientific field (e.g., medicine). This flexibility facilitates incremental knowledge and collaboration, which is what ELD CAMA and FORRT both strive for. Repository: https://github.com/metahag/ELD-CAMA_source.
 
 <img src="ELD-CAMA.webp" align="center" alt="Diagram: ELD CAMA (Evidence in Learning and Didactics Community-Augmented Meta-Analysis) branches into two uses. Use the content: pedagogical tool, meta-research, evidence synthesis. Reuse the code: copy the SQL database, improve the Shiny apps, add new features to the platform." />
 
diff --git a/content/equityinos/2-intro-text.md b/content/equityinos/2-intro-text.md
index 1147ef26ad3..45483881c8b 100644
--- a/content/equityinos/2-intro-text.md
+++ b/content/equityinos/2-intro-text.md
@@ -54,7 +54,7 @@ subtitle = "Aligning social justice & representation with open scholarship, rigo
 ****
 
 <p style="text-align:right; color:#00203f;">
-<i>An initiative by the partnership between the <a href="https://www.sparksociety.org/">SPARK Society</a>, <a href="hhttps://improvingpsych.org/">SIPS</a>, & <a href="https://forrt.org">FORRT</a>.</i>
+<i>An initiative by the partnership between the <a href="https://www.sparksociety.org/">SPARK Society</a>, <a href="https://improvingpsych.org/">SIPS</a>, & <a href="https://forrt.org">FORRT</a>.</i>
 </p>
 
 <br>
@@ -63,15 +63,15 @@ subtitle = "Aligning social justice & representation with open scholarship, rigo
 
 > We are organizing a series of summit meetings on the topic of *Equity in Open Scholarship: aligning social justice & representation with open scholarship, rigor, & reproducible research*, where we aim to focus our discussion on the needs and concerns of researchers from historically marginalized groups.
 
-The term “Open Science” covers a variety of practices that aim to help individuals and communities of researchers share their work openly, often with the goals of improving reproducibility, expanding access to scientific findings, and making tools, materials, and data that can be reused by many researchers broadly available. These practices also provide opportunities to conduct and disseminate research that does not depend on access to elite institutions or tenured positions. Both <a href="https://improvingpsych.org/">SIPS</a> and <a href="https://forrt.org">FORRT</a> were created to provide spaces for researchers in the social sciences to collaborate and share open practices, and both strongly affirm inclusivity, diversity, and openness to critical perspectives as core values. At this year’s SIPS, <a href="https://as.tufts.edu/psychology/people/faculty/ayanna-thomas">Ayanna Thomas</a> and <a href="https://www.vanderbilt.edu/psychological_sciences/bio/duane-watson">Duane Watson</a>, founders of the <a href="https://www.sparksociety.org/">SPARK Society</a>, gave opening plenary calling attention to how open science movements may fail to benefit diverse communities of both researchers and research participants. This talk inspired several of us to discuss concrete opportunities to address this issue.
+The term “Open Science” covers a variety of practices that aim to help individuals and communities of researchers share their work openly, often with the goals of improving reproducibility, expanding access to scientific findings, and making tools, materials, and data that can be reused by many researchers broadly available. These practices also provide opportunities to conduct and disseminate research that does not depend on access to elite institutions or tenured positions. Both <a href="https://improvingpsych.org/">SIPS</a> and <a href="https://forrt.org">FORRT</a> were created to provide spaces for researchers in the social sciences to collaborate and share open practices, and both strongly affirm inclusivity, diversity, and openness to critical perspectives as core values. At SIPS 2022, <a href="https://as.tufts.edu/psychology/people/faculty/ayanna-thomas">Ayanna Thomas</a> and <a href="https://www.vanderbilt.edu/psychological_sciences/bio/duane-watson">Duane Watson</a>, founders of the <a href="https://www.sparksociety.org/">SPARK Society</a>, gave opening plenary calling attention to how open science movements may fail to benefit diverse communities of both researchers and research participants. This talk inspired several of us to discuss concrete opportunities to address this issue.
 
-**As a first step**, we hosted a summit on open scholarship specifically directed at historically excluded scholars of African American/Black, Latina/o/x American, and Native American heritage in the United States. This served two purposes: 
+**As a first step**, in December 2022 we hosted a summit on open scholarship specifically directed at historically excluded scholars of African American/Black, Latina/o/x American, and Native American heritage in the United States. This served two purposes: 
 1. As open science principles begin to be more commonly accepted and valued in our research communities, there is a risk that these scientists will face structural barriers to participating in the communities where these tools are developed and taught. 
 2. We firmly believe that some open science practices have enormous potential to benefit some researchers, and we’d like to ensure that researchers from currently underrepresented groups are among those who benefit from open science practices.
 
 We invited stakeholders to engage in an open scholarship activity via sharing their thoughts on ➡️[an open manuscript](https://docs.google.com/document/d/1l_6McjYJncS2xC8MgSavmad4hvTvmzGrcwlJKueBt-s/edit?usp=sharing)⬅️ that details both the purpose of this meeting and some background on specific open science concepts and practices. [All attendees](https://docs.google.com/document/d/1mM4q88TGl9M6c-cscrRgAKCt2d-clZ9MnQl8bDTzUgA/edit) were encouraged to contribute in identifying those OS concepts that you are most interested in discussing, and where there is the most potential for either harm or benefit to historically excluded scholars.
 
-**We concluded** that Open Science practices can promote diversity, inclusion, and equity; however, equity and inclusion are not guaranteed by open science practices without an active effort to achieve them. *The also agreed that the goal of our group is to consider how open science practices can better consider the needs and concerns of historically excluded and otherwise marginalized scholars, educators, and consumers of research*. This is because while the adoption of open science practices is laudable and can eliminate some of the barriers to success that result from status (or resource-based gatekeeping), it does not obviate the need for careful consideration of equity and inclusion within these practices. Preregistration, making data and code open, and sharing preprints have hidden costs for many scholars—both where they require additional work from resource-strapped researchers, and where the academic system and practices present an unequal burden across different research institutions, methodologies, and contexts (e.g., [Nathan Matias et al., 2022](https://www.nature.com/articles/s41562-022-01495-4); [Zhang et al., 2022](https://www.science.org/doi/10.1126/sciadv.abq7056)). *Our priority is to eliminate those costs by removing barriers to entry and restructuring practices with equity at the center.* 
+**We concluded** that Open Science practices can promote diversity, inclusion, and equity; however, equity and inclusion are not guaranteed by open science practices without an active effort to achieve them. *They also agreed that the goal of our group is to consider how open science practices can better consider the needs and concerns of historically excluded and otherwise marginalized scholars, educators, and consumers of research*. This is because while the adoption of open science practices is laudable and can eliminate some of the barriers to success that result from status (or resource-based gatekeeping), it does not obviate the need for careful consideration of equity and inclusion within these practices. Preregistration, making data and code open, and sharing preprints have hidden costs for many scholars—both where they require additional work from resource-strapped researchers, and where the academic system and practices present an unequal burden across different research institutions, methodologies, and contexts (e.g., [Nathan Matias et al., 2022](https://www.nature.com/articles/s41562-022-01495-4); [Zhang et al., 2022](https://www.science.org/doi/10.1126/sciadv.abq7056)). *Our priority is to eliminate those costs by removing barriers to entry and restructuring practices with equity at the center.* 
 
 We also highlighted **the need to collect relevant resources**. FORRT, the Turing Way, and others [similarly aligned organizations](/about/partnerships/), already are excellent resource repositories. FORRT developed this as a space to collect relevant resources for this effort, as well as to promote the dissemination of information, share meeting notes ([1st summit](https://docs.google.com/document/d/1KVUqTPe9pnlfc2IWwX--NOLtLkBWyEF98RoUiEalPyA/edit)), events, and other products of this group. Everyone can contribute to the development of this resource page by adding information [here](/resources/#form). 
 
diff --git a/content/equityinos/index.md b/content/equityinos/index.md
index 2e060bb0e59..55d27a1ca11 100644
--- a/content/equityinos/index.md
+++ b/content/equityinos/index.md
@@ -2,7 +2,7 @@
 # FORRT page
 type = "widget_page"
 headless = false  # Homepage is headless, other widget pages are not.
-title = "Equity in Open Science"
+title = "Equity in Open Scholarship"
 +++
 
 ****
diff --git a/content/feedback/form-feedback.md b/content/feedback/form-feedback.md
index 82e49ae26ab..2352511e21d 100644
--- a/content/feedback/form-feedback.md
+++ b/content/feedback/form-feedback.md
@@ -50,4 +50,4 @@ subtitle = "Fill out the form below or ***[open the Google form in a new window]
  css_class = "text-center"
 +++
 
-{{< gform src="1FAIpQLSebwqYgFmH3QJIMtPFUhuKeU1Rdbz5WqwP8iXd2cUPgZvUHRg" width="100%" height="500px" alt="Loading..." >}}
\ No newline at end of file
+{{< gform src="1FAIpQLSebwqYgFmH3QJIMtPFUhuKeU1Rdbz5WqwP8iXd2cUPgZvUHRg" width="100%" height="760px" alt="Loading..." >}}
\ No newline at end of file
diff --git a/content/games/_index.md b/content/games/_index.md
index 953785cb5f5..ca890e3d074 100644
--- a/content/games/_index.md
+++ b/content/games/_index.md
@@ -4,9 +4,7 @@ type: plain_page
 ---
 FORRT is excited to launch the Open Research Games Portal – a crowdsourced, pedagogically informed database of games and interactive activities for teaching open and reproducible research practices. This initiative recognizes the power of game-based learning to make complex topics more accessible, memorable, and engaging for learners – from students and early-career researchers to educators and professionals. Whether you're looking for a lighthearted icebreaker or a serious, learning-focused game to integrate into your curriculum, the Portal helps you find what you need.
 
-<a href="/open-research-games-portal/" class="btn btn-primary btn-lg btn-block" style="line-height:1;border-radius:6px; font-size:1.5rem; ">
-  Open Research Games Portal
-</a>
+<a href="/open-research-games-portal/" class="btn btn-primary">Open Research Games Portal</a>
 
 <br>
 
diff --git a/content/home/1-hero.md b/content/home/1-hero.md
index 83ac3932c48..dc7f6182e23 100644
--- a/content/home/1-hero.md
+++ b/content/home/1-hero.md
@@ -1,33 +1,29 @@
 +++
-# Rotating-quote hero (see layouts/partials/widgets/hero_quotes.html).
-widget = "hero_quotes"
-headless = true  # This file represents a page section.
-active = true  # Activate this widget? true/false
-weight = 10  # Order that this section will appear.
+# The home page's sections are drawn by layouts/partials/doors/home/, in order of weight. Each
+# file here holds one section's wording and links. A link with a `url` and no `label` takes its
+# label from the main menu, so renaming a menu entry renames it here too.
+section = "hero"
+headless = true
+weight = 10
 
-# Key statements to cycle through. Wrap the part to highlight in
-# <span class="accent">…</span>. Drawn from FORRT's vision and mission.
-[[quote]]
-  text = 'Care is not a distraction from the work. <span class="accent">It is the work.</span>'
-[[quote]]
-  text = 'Scientific excellence and social justice, <span class="accent">inseparable.</span>'
-[[quote]]
-  text = 'From a culture of competition <span class="accent">to one of community.</span>'
-[[quote]]
-  text = 'Teaching and community building, <span class="accent">on equal footing with discovery.</span>'
+heading = "Better science.<br>Built together."
+lede = "FORRT is a community of researchers and educators who develop, share and teach open scholarship, and who work to make science more rigorous, more transparent and more just."
 
-[primary_cta]
-  label = "Get involved"
-  url = "/about/get-involved/"
-
-[secondary_cta]
-  label = "About FORRT"
-  url = "#3-what-is-forrt"
-
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  padding = ["40px", "0", "44px", "0"]
-
-[design.background]
-  text_color_light = false
+# Three main actions under the intro, then a quieter line on wide screens (`more`), hidden on phones,
+# where the header's "Get involved" button and the Take part section cover joining.
+[[quick]]
+  label = "Teach with open materials"
+  url = "resources/"
+[[quick]]
+  label = "Learn about open scholarship"
+  url = "clusters/"
+[[quick]]
+  label = "Explore replications"
+  url = "replication-hub/"
+[[more]]
+  label = "Join FORRT"
+  url = "#take-part"
+[[more]]
+  label = "Submit a resource"
+  url = "submit/"
 +++
diff --git a/content/home/2-areas.md b/content/home/2-areas.md
new file mode 100644
index 00000000000..506918c9ca7
--- /dev/null
+++ b/content/home/2-areas.md
@@ -0,0 +1,61 @@
++++
+section = "areas"
+headless = true
+weight = 20
+
+[[area]]
+  key = "edu"
+  title = "Education & Pedagogy"
+  blurb = "Find, access and reuse teaching and mentoring materials."
+  image = "area-education"
+  alt = "A brick pencil standing on an open green book."
+  links = [
+    { url = "resources/" },
+    { url = "lesson-plans/" },
+    { url = "syllabus/" },
+    { url = "glossary/" },
+    { url = "educators-corner/" },
+  ]
+
+[[area]]
+  key = "res"
+  title = "Meta-Science & Research"
+  blurb = "Track, explore, conduct and share reproduction and replication studies."
+  image = "area-research"
+  alt = "Two near-identical brick towers, one with a single orange brick, seen through a magnifying glass."
+  links = [
+    { url = "replication-hub/" },
+    { url = "https://forrt.org/flora-replication-atlas/" },
+    { url = "explorer/" },
+    { url = "https://forrt.org/replication-handbook/" },
+    { url = "publications/", label = "FORRT publications" },
+  ]
+
+[[area]]
+  key = "jus"
+  title = "Social Justice & DEIA"
+  blurb = "Scientific excellence and social justice, inseparable."
+  image = "area-justice"
+  alt = "The FORRT tower with its upper courses built in Pride colours."
+  links = [
+    { url = "dei/" },
+    { url = "equityinos/" },
+    { url = "neurodiversity/" },
+    { url = "citation-politics/" },
+    { url = "awop/" },
+  ]
+
+[[area]]
+  key = "com"
+  title = "Community & Sustainability"
+  blurb = "From a culture of competition to one of community."
+  image = "area-community"
+  alt = "Brick figures in many colours standing in a circle, with a gap and one more figure arriving."
+  links = [
+    { url = "about/teams/" },
+    { url = "contributors/" },
+    { url = "nowherelab/" },
+    { url = "community-map/" },
+    { url = "about/charity/" },
+  ]
++++
diff --git a/content/home/2-popup.md b/content/home/2-popup.md
deleted file mode 100644
index bd2fd0e5bf8..00000000000
--- a/content/home/2-popup.md
+++ /dev/null
@@ -1,57 +0,0 @@
-+++
-# A Demo section created with the Blank widget.
-# Any elements can be added in the body: https://sourcethemes.com/academic/docs/writing-markdown-latex/
-# Add more sections by duplicating this file and customizing to your requirements.
-
-widget = "blank"  # See https://sourcethemes.com/academic/docs/page-builder/
-headless = true  # This file represents a page section.
-active = false  # Activate this widget? true/false
-weight = 20  # Order that this section will appear.
-
-title = ""
-subtitle = ""
-
-[design]
-  # Choose how many columns the section has. Valid values: 1 or 2.
-  columns = "1"
-
-[design.background]
-  # Apply a background color, gradient, or image.
-  #   Uncomment (by removing `#`) an option to apply it.
-  #   Choose a light or dark text color by setting `text_color_light`.
-  #   Any HTML color name or Hex value is valid.
-
-  # Background color.
-  # color = "#fefdf6"
-  # color = "#69b3a2" # greenish
-  
-  # Background gradient.
-  # gradient_start = "DeepSkyBlue"
-  # gradient_end = "SkyBlue"
-  
-  # Background image.
-  # image = "headers/bubbles-wide.webp"  # Name of image in `static/img/`.
-  # image_darken = 0.6  # Darken the image? Range 0-1 where 0 is transparent and 1 is opaque.
-  # image_size = "cover"  #  Options are `cover` (default), `contain`, or `actual` size.
-  # image_position = "center"  # Options include `left`, `center` (default), or `right`.
-  # image_parallax = true  # Use a fun parallax-like fixed background effect? true/false
-
-  # Text color (true=light or false=dark).
-  text_color_light = false
-
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  padding = ["60px", "0", "60px", "0"]
-
-[advanced]
- # Custom CSS. 
- css_style = "font-size: 1.25rem;"
- 
- # CSS class.
- css_class = "text-center"
-+++
-
-<div class="alert alert-info alert-dismissible">
-  <button type="button" class="close" data-dismiss="alert">&times;</button>
-  <strong>Hi!</strong> If you encounter any bugs or find some pieces missing, please feel free to let us know by <a href="#8-contact" class="alert-link">contacting us</a>. 
-</div>
\ No newline at end of file
diff --git a/content/home/2-welcome.md b/content/home/2-welcome.md
deleted file mode 100644
index 467c054110c..00000000000
--- a/content/home/2-welcome.md
+++ /dev/null
@@ -1,52 +0,0 @@
-+++
-# A Demo section created with the Blank widget.
-# Any elements can be added in the body: https://sourcethemes.com/academic/docs/writing-markdown-latex/
-# Add more sections by duplicating this file and customizing to your requirements.
-
-widget = "blank"  # See https://sourcethemes.com/academic/docs/page-builder/
-headless = true  # This file represents a page section.
-active = false  # Disabled: redundant with the hero. Its tagline now lives in the hero lead (1-hero.md).
-weight = 20  # Order that this section will appear.
-
-title = "**Welcome to FORRT**<br>------<br>"
-subtitle = "*Integrating open and reproducible science into higher education*"
-
-[design]
-  # Choose how many columns the section has. Valid values: 1 or 2.
-  columns = "1"
-
-[design.background]
-  # Apply a background color, gradient, or image.
-  #   Uncomment (by removing `#`) an option to apply it.
-  #   Choose a light or dark text color by setting `text_color_light`.
-  #   Any HTML color name or Hex value is valid.
-
-  # Background color.
-  # color = "#fefdf6"
-  # color = "#69b3a2" # greenish
-  
-  # Background gradient.
-  # gradient_start = "DeepSkyBlue"
-  # gradient_end = "SkyBlue"
-  
-  # Background image.
-  # image = "headers/bubbles-wide.webp"  # Name of image in `static/img/`.
-  # image_darken = 0.6  # Darken the image? Range 0-1 where 0 is transparent and 1 is opaque.
-  # image_size = "cover"  #  Options are `cover` (default), `contain`, or `actual` size.
-  # image_position = "center"  # Options include `left`, `center` (default), or `right`.
-  # image_parallax = true  # Use a fun parallax-like fixed background effect? true/false
-
-  # Text color (true=light or false=dark).
-  text_color_light = false
-
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  padding = ["0px", "0", "0px", "0"]
-
-[advanced]
- # Custom CSS. 
- css_style = "font-size: 1.25rem;"
- 
- # CSS class.
- css_class = "text-center"
-+++
\ No newline at end of file
diff --git a/content/home/3-topics.md b/content/home/3-topics.md
new file mode 100644
index 00000000000..7388f3af687
--- /dev/null
+++ b/content/home/3-topics.md
@@ -0,0 +1,45 @@
++++
+section = "topics"
+headless = true
+weight = 30
+
+heading = "Teaching resources by topic"
+# %s is the number of curated resources, counted at build time.
+note = "A curated collection of %s open scholarship resources."
+
+# Each topic opens the resources directory with one cluster chosen. `cluster` is the filter's
+# name in the address, from the cluster names in content/resources/_index.md.
+[[topic]]
+  label = "Replication crisis and credibility"
+  cluster = "replication-crisis-and-credibility-revolution"
+[[topic]]
+  label = "Concepts and statistics"
+  cluster = "conceptual-and-statistical-knowledge"
+[[topic]]
+  label = "Reproducible computation"
+  cluster = "transparency-and-reproducibility-in-computation-and-analysis"
+[[topic]]
+  label = "Pre-analysis planning"
+  cluster = "pre-analysis-planning"
+[[topic]]
+  label = "Ways of working"
+  cluster = "ways-of-working"
+[[topic]]
+  label = "Academic structures"
+  cluster = "academic-structures-and-institutions"
+[[topic]]
+  label = "Replication and meta-research"
+  cluster = "replication-and-meta-research"
+[[topic]]
+  label = "Publication sharing"
+  cluster = "publication-sharing"
+[[topic]]
+  label = "FAIR data and materials"
+  cluster = "fair-data-and-materials"
+[[topic]]
+  label = "Qualitative research"
+  cluster = "qualitative-research"
+[[topic]]
+  label = "Research integrity"
+  cluster = "research-integrity"
++++
diff --git a/content/home/3-what-is-forrt.md b/content/home/3-what-is-forrt.md
deleted file mode 100644
index 7b665496359..00000000000
--- a/content/home/3-what-is-forrt.md
+++ /dev/null
@@ -1,24 +0,0 @@
-+++
-# About widget.
-widget = "about_welcome"  # See https://sourcethemes.com/academic/docs/page-builder/
-headless = true  # This file represents a page section.
-active = true  # Activate this widget? true/false
-weight = 35  # Order that this section will appear in.
-
-title = "What is FORRT?"
-
-# Choose the user profile to display
-# This should be the username of a profile in your `content/authors/` folder.
-# See https://sourcethemes.com/academic/docs/get-started/#introduce-yourself
-author = "forrt"
-
-# YouTube video shown (as a click-to-play lightbox) in the left media column.
-video_id = "XlL54egjSoA"
-
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  padding = ["24px", "0", "24px", "0"]
-  
-+++
-
----
\ No newline at end of file
diff --git a/content/home/3b-announcements.md b/content/home/3b-announcements.md
deleted file mode 100644
index b24030138e1..00000000000
--- a/content/home/3b-announcements.md
+++ /dev/null
@@ -1,19 +0,0 @@
-+++
-# Announcements section (custom card widget).
-widget = "announcements"  # See layouts/partials/widgets/announcements.html
-headless = true  # This file represents a page section.
-active = true  # Activate this widget? true/false
-weight = 30  # Order that this section will appear (before "What is FORRT?").
-
-title = "News & Announcements"
-# Divider under the header comes from the shared .home-section heading rule (custom.scss).
-
-# Number of recent announcements to show.
-count = 3
-
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  # Tighter bottom padding: the newsletter band (4-newsletter.md, weight 31)
-  # sits directly below and should read as part of this block.
-  padding = ["20px", "0", "24px", "0"]
-+++
diff --git a/content/home/4-board.md b/content/home/4-board.md
new file mode 100644
index 00000000000..314fbcc38b1
--- /dev/null
+++ b/content/home/4-board.md
@@ -0,0 +1,32 @@
++++
+section = "board"
+headless = true
+weight = 40
+
+notices_heading = "From the community"
+notices_count = 3
+newsletter_heading = "Get the newsletter"
+newsletter_text = "News, events and opportunities from FORRT, in your inbox."
+take_part_heading = "Take part"
+
+[[take_part]]
+  label = "Join the discussion"
+  text = "Talk about open scholarship with the community on Slack."
+  url = "https://join.slack.com/t/forrt/shared_invite/zt-alobr3z7-NOR0mTBfD1vKXn9qlOKqaQ"
+[[take_part]]
+  label = "Join a team"
+  text = "Teams develop, share and teach FORRT’s materials."
+  url = "about/teams/"
+[[take_part]]
+  label = "Become a partner"
+  text = "Work with FORRT as a partner organisation."
+  url = "about/partnerships/"
+[[take_part]]
+  label = "Submit a replication"
+  text = "Help others find and use replication evidence."
+  url = "replication-hub/submit/"
+[[take_part]]
+  label = "Support FORRT"
+  text = "FORRT Germany e.V. is a registered charity closely affiliated with FORRT."
+  url = "about/get-involved/"
++++
diff --git a/content/home/4-newsletter.md b/content/home/4-newsletter.md
deleted file mode 100644
index 57c35f4792c..00000000000
--- a/content/home/4-newsletter.md
+++ /dev/null
@@ -1,21 +0,0 @@
-+++
-# Compact subscribe band, placed right after News & Announcements (weight 30)
-# so it reads as part of that block rather than its own separate section.
-
-widget = "blank"  # See https://sourcethemes.com/academic/docs/page-builder/
-headless = true  # This file represents a page section.
-active = true  # Activate this widget? true/false
-weight = 31  # Order that this section will appear.
-
-[design]
-  columns = "1"
-
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  padding = ["0px", "0", "44px", "0"]
-+++
-
-<div class="nl-band">
-  <p class="nl-band-label">Subscribe to our newsletter to get the latest news about FORRT's initiatives, events, and opportunities.</p>
-  {{< subscribe >}}
-</div>
diff --git a/content/home/4-products.md b/content/home/4-products.md
deleted file mode 100644
index 4a51caa5b47..00000000000
--- a/content/home/4-products.md
+++ /dev/null
@@ -1,71 +0,0 @@
-+++
-# A Skills section created with the Featurette widget.
-widget = "featurette_alternative"  # See https://sourcethemes.com/academic/docs/page-builder/
-headless = true  # This file represents a page section.
-active = true  # Activate this widget? true/false
-weight = 40  # Order that this section will appear.
-
-title = "Open Educational Resources &<br>Metascientific Works"
-# Showcase personal skills or business features.
-# 
-
-# Add/remove as many `[[feature]]` blocks below as you like.
-# 
-# For available icons, see: https://sourcethemes.com/academic/docs/widgets/#icons
-# Refer to https://axesslab.com/alt-texts/ for stellar examples of alt texts.
-
-[[featurealt]]
-  # icon = "users"
-  # icon_pack = "fas"
-  # iconalttext = "Users"
-  img = "book_dipl.webp"
-  imgalttext = "A graduation hat next to a diploma on top of a thesis book. Illustration." 
-  imgside = "left"
-  buttonurl = "nexus/"
-  buttondescr = "View our educational nexus"
-  name = "Educational Nexus"
-  description = "The educational NEXUS is an e-learning platform for educators teachers to Find, Access, Interoperate, and Reuse (FAIR) teaching and mentoring resources & materials. The pedagogical content of all resources is maximized to facilitate adaptation and reuse. We welcome new contributions to help build diversity in the collated resources (check out [how to get involved](/about/get-involved)). FORRT strongly advocates for these resources being used, cited and recognized. We have produced the following resources [About Educational Nexus](/nexus), [Adopting Principled Teaching & Mentoring Practices](/adopting), [Citation Politics](/citation-politics), [Pedagogical Clusters of OS literature](/clusters), [Curated OS Resources](/resources), [Developing Countries & OS](/os-developing-world), [Equity in Open Science](/equityinos),  [Educator's Corner](/educators-corner), [Games Portal](/games), [Glossary of OS terminology](/glossary), [Literature Review on the impact of Open Scholarship on students](/impact),  [Initiatives Towards Social Justice in Academia](/dei), [Lesson Plans](/lesson-plans), [Mapping OS Communities](/mapping_os), [Neurodiversity resources](/neurodiversity/), [Pedagogies](/pedagogies), [Summaries of OS literature](/summaries), [OS Syllabus](https://forrt.org/syllabus), [Teaching OS](/teaching_os), and the [Academic Wheel of Privilege (AWoP)](/awop) ."
-  
-  
-  [[featurealt]]
-  # icon = "slack"
-  # icon_pack = "fab"
-  # iconalttext = "Slack"
-  img = "compose.webp" #icon OR img
-  imgalttext = "Big pencil above a sheet of paper. Illustration." 
-  imgside = "right"
-  buttonurl = "publications/"
-  buttondescr = "Read our publications"
-  name = "Publications, Manuscripts, and Policy"
-  description = "FORRT has published meta-scientific works, and has 'soon-to-be-published' manuscripts advocating and explaining why open and reproducible tenets should be incorporated in the teaching and mentoring of prototypical subject matters. In line with principles enshrined in FORRT, all manuscripts and ongoing projects are open (online) contributorship projects. The work of all contributors are valued and are formally recognized hoping expand the scope and diversity of FORRT’s mission and its team."
-  
-
-[[featurealt]]
-  # icon = "handshake"
-  # icon_pack = "fas"
-  # iconalttext = "Handshake"
-  img = "teacher_emc2.webp" # I would put another image, much stereotypical (e=mc2+man with mustache)
-  imgalttext = "Scientist pointing at the E=MC squared on the board. Illustration." 
-  imgside = "left"
-  buttonurl = "pedagogies/"
-  buttondescr = "Discover our pedagogies"
-  name = "Pedagogies"
-  description = "FORRT creates, collects and catalogues examples of successful pedagogical approaches in teaching and mentoring as well as the openness of these resources. Interested parties – i.e., scholars, instructors, and educational institutions – can use FORRT’s pedagogies as a template towards the creation of their own teaching strategies. FORRT pedagogies strives to support teachers and mentors to integrate field-specific education with open and reproducible science tenets."
-
-
-    [[featurealt]]
-  # icon = "slack"
-  # icon_pack = "fab"
-  # iconalttext = "Slack"
-  img = "colorwheel.webp" #icon OR img
-  imgalttext = "Dynamic Projects" 
-  imgside = "right"
-  buttonurl = "about/get-involved"
-  buttondescr = "Get involved"
-  name = "Ongoing Projects"
-  description = "At any given time, FORRT has several ongoing, dynamic projects. These range from developing educational resources, to metascience research, to highlighting the perspectives of marginalized groups.  Our philosophy is rooted in community science and open contributorship: anyone willing to help can contribute to FORRT projects, including you!"
-  
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  padding = ["50px", "0", "50px", "0"]
-+++
\ No newline at end of file
diff --git a/content/home/5-about.md b/content/home/5-about.md
new file mode 100644
index 00000000000..1cb7986a1f1
--- /dev/null
+++ b/content/home/5-about.md
@@ -0,0 +1,35 @@
++++
+section = "about"
+headless = true
+weight = 50
+
+# Shown one at a time. Wrap the part to highlight in <span class="accent">…</span>. Drawn from
+# FORRT's vision and mission.
+quotes = [
+  'Care is not a distraction from the work. <span class="accent">It is the work.</span>',
+  'Scientific excellence and social justice, <span class="accent">inseparable.</span>',
+  'From a culture of competition <span class="accent">to one of community.</span>',
+  'Teaching and community building, <span class="accent">on equal footing with discovery.</span>',
+]
+statement = "FORRT is a Framework for Open and Reproducible Research Training: an interdisciplinary community that integrates open and reproducible science into higher education, and puts teaching and community building on equal footing with discovery."
+statement_link = { label = "Read our mission", url = "about/mission/" }
+
+[forward]
+  title = "FORWARD: a UNESCO Decade of Science Programme"
+  text = "FORRT is one of the few initiatives worldwide formally endorsed as a Programme of the International Decade of Sciences for Sustainable Development (2024–2033), led by UNESCO and the United Nations."
+  links = [
+    { label = "Read about FORWARD", url = "educators-corner/023-forward-a-unesco-decade-of-science-programme/" },
+    { label = "See the UN Decade listing", url = "https://www.un-sciences-decade.org/en/endorsed-activities/forward-forrt-world-development-fostering-open-research-reproducibility-worldwide-accessible?hub=63" },
+  ]
+
+# Every figure names its source and links to it. Contributors and partners are counted at build
+# time. Add a figure only with a source someone can check: Slack members and newsletter
+# subscribers are left out because the site holds no record of them.
+[facts]
+  projects_figure = "100+"
+  projects_label = "projects and support teams"
+  projects_url = "contributor-analysis/"  # States 109 projects and support teams as of 10 June 2026.
+  awards_figure = "2026"
+  awards_label = "Leo Waaijers Open Science Award, among other recognition"
+  awards_url = "awards/"
++++
diff --git a/content/home/5-achievements.md b/content/home/5-achievements.md
deleted file mode 100644
index 1bf7ec9e1aa..00000000000
--- a/content/home/5-achievements.md
+++ /dev/null
@@ -1,89 +0,0 @@
-+++
-# Combined Achievements & Awards section (two columns).
-widget = "blank"  # See https://sourcethemes.com/academic/docs/page-builder/
-headless = true  # This file represents a page section.
-active = true  # Activate this widget? true/false
-weight = 50  # Order that this section will appear.
-
-title = "Achievements &amp; Awards"
-[design]
-  # Choose how many columns the section has. Valid values: 1 or 2.
-  columns = "1"
-
-[design.background]
-  color = "#fefdf6"
-  text_color_light = false
-
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  padding = ["40px", "0", "40px", "0"]
-+++
-
----
-
-### [FORWARD: A UNESCO Decade of Science Programme](../educators-corner/023-forward-a-unesco-decade-of-science-programme/)
-
-<img src="../awards/unesco_recognition.webp" width="200" height="207" align="left" style="margin-right: 10px;" alt="FORWARD: A UNESCO Decade of Science Programme"> 
-
-**FORRT** is one of the few initiatives worldwide to be formally endorsed as a **Programme** of the [International Decade of Sciences for Sustainable Development (IDSSD, 2024–2033)](https://www.un-sciences-decade.org/en/endorsed-activities/forward-forrt-world-development-fostering-open-research-reproducibility-worldwide-accessible?hub=63) , led by UNESCO and the United Nations (UN). This endorsement reflects the highest level of UN policy recognition and positions FORRT’s work in Education & Pedagogy (Curriculum Hub), Metascience & Research (Replication Hub) and Social Justice & DEIA as an **essential contribution to the UN’s strategy for achieving the Sustainable Development Goals (SDGs)**.
-
-<a href="https://www.un-sciences-decade.org/en/endorsed-activities/forward-forrt-world-development-fostering-open-research-reproducibility-worldwide-accessible?hub=63" style="font-size:0.7rem;">
-  Read the Official Announcement of the endorsement of FORWARD by the UNESCO Science Decade
-</a>
-
-<br>
-
-{{< forward_unesco_sdgs_card >}}
-
-<br>
-
-<div class="aa-grid">
-  <div class="aa-col aa-achievements">
-
-<div class="ms-card">
-  <h3 class="ms-title">Milestones</h3>
-  <ul class="ms-list">
-    <li class="ms-row">
-      <span class="ms-icon ms-icon--pair"><i class="fab fa-bluesky"></i><i class="fab fa-linkedin"></i></span>
-      <span class="ms-text"><strong>Over 2,000</strong> followers on Bluesky, and <strong>over 1,000</strong> followers on LinkedIn</span>
-    </li>
-    <li class="ms-row">
-      <span class="ms-icon"><i class="fas fa-puzzle-piece"></i></span>
-      <span class="ms-text"><strong>More than 100</strong> active or completed projects and support teams, with more on the way</span>
-    </li>
-    <li class="ms-row">
-      <span class="ms-icon"><i class="fab fa-slack"></i></span>
-      <span class="ms-text"><strong>Over 1,500</strong> of FORRT's members are on Slack</span>
-    </li>
-    <li class="ms-row">
-      <span class="ms-icon"><i class="fas fa-book"></i></span>
-      <span class="ms-text"><strong>10</strong> journal articles, <strong>5</strong> op-eds/other media, <strong>4</strong> preprints, <strong>&gt;600</strong> citations, <strong>3</strong> policy briefings, and <strong>14</strong> awards &amp; commendations (and counting)</span>
-    </li>
-    <li class="ms-row">
-      <span class="ms-icon"><i class="fas fa-envelope-open-text"></i></span>
-      <span class="ms-text"><strong>1,200+</strong> subscribers to the FORRT newsletter</span>
-    </li>
-    <li class="ms-row">
-      <span class="ms-icon"><i class="fas fa-users"></i></span>
-      <span class="ms-text"><strong>647 individuals</strong> have contributed to FORRT projects</span>
-    </li>
-    <li class="ms-row">
-      <span class="ms-icon"><i class="fas fa-handshake"></i></span>
-      <span class="ms-text"><strong>12</strong> formal institutional partnerships</span>
-    </li>
-  </ul>
-</div>
-
-  </div>
-  <div class="aa-col aa-awards">
-
-FORRT has won a series of awards and commendations for our work, including:
-
-- The UK Reproducibility Network's Dorothy Bishop Prize
-- Open Science Community Amsterdam's OSC Award in the Open Educational Resources / Open Education / Open Online Courses category
-- An Open Scholarship Prize (1st Place) award from the Atlantic Technological University and the Open Science Community Galway
-
-To find out more about these and more, read [FORRT's awards page](/awards).
-
-  </div>
-</div>
diff --git a/content/home/5-awards.md b/content/home/5-awards.md
deleted file mode 100644
index 7fe1a490070..00000000000
--- a/content/home/5-awards.md
+++ /dev/null
@@ -1,102 +0,0 @@
-+++
-# A Demo section created with the Blank widget.
-# Any elements can be added in the body: https://sourcethemes.com/academic/docs/writing-markdown-latex/
-# Add more sections by duplicating this file and customizing to your requirements.
-
-widget = "blank"  # See https://sourcethemes.com/academic/docs/page-builder/
-headless = true  # This file represents a page section.
-active = false  # Disabled: merged into 5-achievements.md as a two-column "Achievements & Awards" section.
-weight = 50  # Order that this section will appear.
-
-title = "Awards"
-subtitle = "---"
-
-[design]
-  # Choose how many columns the section has. Valid values: 1 or 2.
-  columns = "1"
-
-[design.background]
-  # Apply a background color, gradient, or image.
-  #   Uncomment (by removing `#`) an option to apply it.
-  #   Choose a light or dark text color by setting `text_color_light`.
-  #   Any HTML color name or Hex value is valid.
-
-  # Background color.
-   color = "#fefdf6"
-  
-  # Background gradient.
-  # gradient_start = "DeepSkyBlue"
-  # gradient_end = "SkyBlue"
-  
-  # Background image.
-  # image = "headers/bubbles-wide.webp"  # Name of image in `static/img/`.
-  # image_darken = 0.6  # Darken the image? Range 0-1 where 0 is transparent and 1 is opaque.
-  # image_size = "cover"  #  Options are `cover` (default), `contain`, or `actual` size.
-  # image_position = "center"  # Options include `left`, `center` (default), or `right`.
-  # image_parallax = true  # Use a fun parallax-like fixed background effect? true/false
-
-  # Text color (true=light or false=dark).
-  text_color_light = false
-
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  padding = ["60px", "0", "60px", "0"]
-
-[advanced]
- # Custom CSS. 
- css_style = ""
- 
- # CSS class.
- css_class = ""
-+++
-
-<br>
-
-
-<style>
-
-.row {
-  display: flex;
-}
-
-/* Create two equal columns that sits next to each other */
-.column {
-  flex: 50%;
-  padding: 10px;
-}
-</style>
-
-<br>
-
-<div class="row">
-  <div class="column">
-
-FORRT has won a series of awards and commendations for our work, including:
-
-- The UK Reproducibility Network's Dorothy Bishop Prize
-- Open Science Community Amsterdam's OSC Award in the Open Educational Resources / Open Education / Open Online Courses category
-- An Open Scholarship Prize (1st Place) award from the Atlantic Technological University and the Open Science Community Galway
-
-To find out more about these and more, read [FORRT's awards page](/awards).
-
-<br>
-
-
-  </div>
-  <div class="column">
-
-<center>
-
-<div style="width:400px">
-
-<br>
-
-![FORRT Awards](/img/Awards.webp)
-
-</div>
-
-</center>
-
-
-  </div>
-</div>
\ No newline at end of file
diff --git a/content/home/5-get-involved.md b/content/home/5-get-involved.md
deleted file mode 100644
index 9ddbc65920a..00000000000
--- a/content/home/5-get-involved.md
+++ /dev/null
@@ -1,78 +0,0 @@
-+++
-# A Skills section created with the Featurette widget.
-widget = "featurette_welcome"  # See https://sourcethemes.com/academic/docs/page-builder/
-headless = true  # This file represents a page section.
-active = true  # Activate this widget? true/false
-weight = 60  # Order that this section will appear.
-
-title = "How can you help?"
-# Add/remove as many `[[feature]]` blocks below as you like.
-# 
-# For available icons, see: https://sourcethemes.com/academic/docs/widgets/#icons
-# Refer to https://axesslab.com/alt-texts/ for stellar examples of alt texts.
-
-[[feature]]
-  #icon = "slack"
-  #icon_pack = "fab"
-  img = "megaphone.webp"
-  imgalttext = "Image of a megaphone"
-  name = "Spread the Word"
-  description = "Better education is for everyone. Help us spread the word by sharing FORRT content via [Bluesky](https://bsky.app/profile/forrt.bsky.social), [YouTube](https://www.youtube.com/channel/UCBQDUYmxMxeWjrCfB2qjA0A/playlists), [Facebook](https://www.facebook.com/forrt.forrt.5), your professional listservs, and other social media."
-  
-[[feature]]
-#  icon = "users"
-#  icon_pack = "fas"
-  img = "teamwork.webp"
-  imgalttext = "Three people standing together. Illustration."
-  name = "Join Our Teams"
-  description = "Everything we develop and produce is in the open and open to anyone willing to help. Check out our [several teams here](/about/teams) and our [get-involved page](/about/get-involved) too."
-
-[[feature]]
-  # icon = "handshake"
-  # icon_pack = "fas"
-  # iconalttext = "Handshake"
-  img = "partner.webp"
-  imgalttext = "6 arms holding each others' wrist. Illustration."
-  name = "Become a Partner"
-  description = "We partner up with other meta-scientific and educational institutions and initiatives to help us to further develop and improve the principles enshrined in FORRT. If your organization or initiative is considering discussing becoming a partner, [email us](mailto:info@forrt.org)."
-
-[[feature]]
-#  icon = "scroll"
-#  icon_pack = "fas"
-#  iconalttext = "scroll"
-  img = "document.webp"
-  imgalttext = "Document. Illustration."
-  name = "Learning about FORRT"
-  description = "We published meta-scientific papers and we also have some ongoing manuscripts. You can read it [on our Publications page](/publications) or on [Open Science Framework](https://osf.io/bnh7p)."
-
-[[feature]]
-#  icon = "slack"
-#  icon_pack = "fab"
-#  iconalttext = "Slack icon"
-  img = "chat.webp"
-  imgalttext = "2 people discussing. Illustration."
-  name = "Join the Discussion"
-  description = "The majority of FORRT's operations go through our Slack channel. We use Slack to keep everyone up-to-date, coordinate teams, and provide a platform for ongoing discussions on our projects. [You can join us here.](https://join.slack.com/t/forrt/shared_invite/zt-alobr3z7-NOR0mTBfD1vKXn9qlOKqaQ)"
-
-# Call to action links (optional).
-#   Display link(s) by specifying a URL and label below. Icon is optional for `[cta]`.
-#   Remove a link/note by deleting a cta/note block.
- [cta]
-   url = "/about/get-involved/"
-   label = ":rocket: Learn about how to get involved!"
-   # icon_pack = "fas"
-   # icon = "info"
-  
-# [cta_alt]
-#  url = "/about/get-involved/"
-#  label = "or view how you can help"
-
-# Note. An optional note to show underneath the links.
-# [cta_note]
-#   label = ''
-
-
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  padding = ["60px", "0", "60px", "0"]
-+++
diff --git a/content/home/6-partnerships.md b/content/home/6-partnerships.md
deleted file mode 100644
index 9a8d352f657..00000000000
--- a/content/home/6-partnerships.md
+++ /dev/null
@@ -1,65 +0,0 @@
-+++
-# A Demo section created with the Blank widget.
-# Any elements can be added in the body: https://sourcethemes.com/academic/docs/writing-markdown-latex/
-# Add more sections by duplicating this file and customizing to your requirements.
-
-widget = "blank"  # See https://sourcethemes.com/academic/docs/page-builder/
-headless = true  # This file represents a page section.
-active = false  # Activate this widget? true/false
-weight = 60  # Order that this section will appear.
-
-title = "Institutional Partnerships"
-subtitle = "---"
-
-[design]
-  # Choose how many columns the section has. Valid values: 1 or 2.
-  columns = "1"
-
-[design.background]
-  # Apply a background color, gradient, or image.
-  #   Uncomment (by removing `#`) an option to apply it.
-  #   Choose a light or dark text color by setting `text_color_light`.
-  #   Any HTML color name or Hex value is valid.
-
-  # Background color.
-   color = "#fefdf6"
-  
-  # Background gradient.
-  # gradient_start = "DeepSkyBlue"
-  # gradient_end = "SkyBlue"
-  
-  # Background image.
-  # image = "headers/bubbles-wide.webp"  # Name of image in `static/img/`.
-  # image_darken = 0.6  # Darken the image? Range 0-1 where 0 is transparent and 1 is opaque.
-  # image_size = "cover"  #  Options are `cover` (default), `contain`, or `actual` size.
-  # image_position = "center"  # Options include `left`, `center` (default), or `right`.
-  # image_parallax = true  # Use a fun parallax-like fixed background effect? true/false
-
-  # Text color (true=light or false=dark).
-  text_color_light = false
-
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  padding = ["60px", "0", "60px", "0"]
-
-[advanced]
- # Custom CSS. 
- css_style = ""
- 
- # CSS class.
- css_class = ""
-+++
-
-<br>
-
-![V2](img/Partnerships.webp)
-
-__*Meta-psychology special issue*__
-
-&nbsp;&nbsp;&nbsp;&nbsp; We have partnered with the journal [Meta-Psychology](https://open.lnu.se/index.php/metapsychology) and the [Psychological Science Accelerator](https://psysciacc.org/) to work on a recurring special issue. The call will request teaching materials, including pedagogical considerations, for the Educational NEXUS. This also sets the stage for our vision of academia in which the creation and maintenance of teaching resources are more valued - changing the publication’s structure to include these excellent and open resources.
-
-__*Center for Open Science - OSKB & COSGN*__
-
-&nbsp;&nbsp;&nbsp;&nbsp; We are partnering up with [OSKB](https://cos.io/oskb) ([Open Science Knowledge Base](https://cos.io/oskb)) to coordinate the alignment of our meta-data on educational materials so that we share our resources and community. To that end, FORRT will have a community in OSKB’s home ([OER Commons](https://www.oercommons.org/)) and enrich data and reduced redundant work. FORRT also joined COS network-of-networks or [Community of Open Scholarship Grassroots Networks](https://groups.google.com/a/cos.io/forum/#!topic/network-of-open-science-grassroots-networks/1OWtx9VDSwo) ([COSGN](https://groups.google.com/a/cos.io/forum/#!topic/network-of-open-science-grassroots-networks/1OWtx9VDSwo)). These partnerships aim to help build a community of existing educational initiatives, strengthening our missions, and streamline the advancement of open and reproducible educational practices.  
-
-<a rel="me" href="https://mastodon.social/@FORRT">Mastodon</a>
\ No newline at end of file
diff --git a/content/home/7-newsletter.md.old b/content/home/7-newsletter.md.old
deleted file mode 100644
index 2532a778249..00000000000
--- a/content/home/7-newsletter.md.old
+++ /dev/null
@@ -1,17 +0,0 @@
-+++
-# A Skills section created with the Featurette widget.
-
-weight = 70  # Order that this section will appear.
-
-title = "Stay Updated"
-subtitle = "Subscribe to our newsletter to get the latest news about FORRT's initiatives, events, and opportunities."
-[design]
-  columns = "1"
-
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  padding = ["0px", "0", "44px", "0"]
-
-+++
-
-{{< subscribe >}}
diff --git a/content/home/8-contact.md b/content/home/8-contact.md
deleted file mode 100644
index 06d11020e0b..00000000000
--- a/content/home/8-contact.md
+++ /dev/null
@@ -1,101 +0,0 @@
-+++
-# A Skills section created with the Featurette widget.
-widget = "featurette_welcome"  # See https://sourcethemes.com/academic/docs/page-builder/
-headless = true  # This file represents a page section.
-active = true  # Activate this widget? true/false
-weight = 80  # Order that this section will appear.
-
-title = "Get in touch"
-subtitle = "Whether you have questions getting started or you want to know how to best integrate FORRT features into your teaching, we’re here to help you."
-
-[[feature]]
-  icon = "envelope"
-  icon_pack = "fas"
-  #img = "megaphone.webp"
-  name = "Email"
-  description = " [info@forrt.org](mailto:info@forrt.org)"
-
-[[feature]]
-  icon = "slack"
-  icon_pack = "fab"
-  # img = "teamwork.webp"
-  name = "Slack"
-  description = "[Join our open Slack channel](https://join.slack.com/t/forrt/shared_invite/enQtODMwODI0OTk4ODgzLTM0ZTQ3NDk5MzA1ZjBmNWJjYTVlN2Y2YTk0ZTJhYTY5NDliMDYzMjg2MWE0ZDRhOTY0ZDY3OTRlNDA4ODQ3NjQ)" 
-  
-  [[feature]]
-  icon = "bluesky"
-  icon_pack = "fab"
-  name = "Bluesky"
-  description = "[Connect with us on Bluesky](https://bsky.app/profile/forrt.bsky.social)"
-
-[[feature]]
-  icon = "mastodon"
-  icon_pack = "fab"
-  name = "Mastodon"
-  description = "[Follow us on Mastodon](https://mastodon.social/@FORRT)"
-
-[[feature]]
-  icon = "instagram"
-  icon_pack = "fab"
-  name = "Instagram"
-  description = "[Check out our Instagram](https://www.instagram.com/forrtproject/#)"
-
-[[feature]]
-  icon = "facebook"
-  icon_pack = "fab"
-  name = "Facebook"
-  description = "[Find us on Facebook](https://www.facebook.com/profile.php?id=100079008639536)"
-
-[[feature]]
-  icon = "osf"
-  icon_pack = "ai"
-  name = "OSF"
-  description = "[Visit our OSF page](https://osf.io/mb46h/)"
-
-[[feature]]
-  icon = "linkedin"
-  icon_pack = "fab"
-  name = "LinkedIn"
-  description = "[Follow us on LinkedIn](https://uk.linkedin.com/company/forrt)"
-
-[[feature]]
-  icon = "youtube"
-  icon_pack = "fab"
-  name = "YouTube"
-  description = "[Subscribe to our YouTube channel](https://www.youtube.com/@forrtproject9995)"
-  
-# [[feature]]
-#   icon = "github"
-#   icon_pack = "fab"
-#   # img = "partner.webp"
-#   name = "GitHub"
-#   description = "[Join our team on GitHub](https://github.com/flavioazevedo/FORRT)"
-
-# Call to action links (optional).
-#   Display link(s) by specifying a URL and label below. Icon is optional for `[cta]`.
-#   Remove a link/note by deleting a cta/note block.
-#  [cta]
-#    url = "/getinvolved"
-#    label = ":rocket: Get involved now!"
-#    # icon_pack = "fas"
-#    # icon = "info"
-#   
-#  [cta_alt]
-#   url = "/getinvolved"
-#   label = "or view how you can help"
-# 
-# # Note. An optional note to show underneath the links.
-# # [cta_note]
-# #   label = '<a class="js-github-release" href="https://sourcethemes.com/academic/updates" data-repo="gcushen/hugo-academic">Latest release<!-- V --></a>'
-
-# Add/remove as many `[[feature]]` blocks below as you like.
-# 
-# For available icons, see: https://sourcethemes.com/academic/docs/widgets/#icons
-
-
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  padding = ["60px", "0", "60px", "0"]
-+++
-
-----------------------------------------------------------------------------------------------------------------------------
diff --git a/content/home/projects.md b/content/home/projects.md
deleted file mode 100644
index 964c31c1160..00000000000
--- a/content/home/projects.md
+++ /dev/null
@@ -1,77 +0,0 @@
-+++
-# A Projects section created with the Portfolio widget.
-widget = "portfolio"  # See https://sourcethemes.com/academic/docs/page-builder/
-headless = true  # This file represents a page section.
-active = false  # Activate this widget? true/false
-weight = 110  # Order that this section will appear.
-
-title = "Projects"
-subtitle = ""
-
-[content]
-  # Page type to display. E.g. project.
-  page_type = "project"
-  
-  # Filter toolbar (optional).
-  # Add or remove as many filters (`[[content.filter_button]]` instances) as you like.
-  # To show all items, set `tag` to "*".
-  # To filter by a specific tag, set `tag` to an existing tag name.
-  # To remove toolbar, delete/comment all instances of `[[content.filter_button]]` below.
-  
-  # Default filter index (e.g. 0 corresponds to the first `[[filter_button]]` instance below).
-  filter_default = 0
-  
-  [[content.filter_button]]
-    name = "All"
-    tag = "*"
-  
-  [[content.filter_button]]
-    name = "Deep Learning"
-    tag = "Deep Learning"
-  
-  [[content.filter_button]]
-    name = "Other"
-    tag = "Demo"
-
-[design]
-  # Choose how many columns the section has. Valid values: 1 or 2.
-  columns = "2"
-
-  # Toggle between the various page layout types.
-  #   1 = List
-  #   2 = Compact
-  #   3 = Card
-  #   5 = Showcase
-  view = 5
-
-  # For Showcase view, flip alternate rows?
-  flip_alt_rows = true
-
-[design.background]
-  # Apply a background color, gradient, or image.
-  #   Uncomment (by removing `#`) an option to apply it.
-  #   Choose a light or dark text color by setting `text_color_light`.
-  #   Any HTML color name or Hex value is valid.
-  
-  # Background color.
-  # color = "navy"
-  
-  # Background gradient.
-  # gradient_start = "DeepSkyBlue"
-  # gradient_end = "SkyBlue"
-  
-  # Background image.
-  # image = "background.webp"  # Name of image in `static/img/`.
-  # image_darken = 0.6  # Darken the image? Range 0-1 where 0 is transparent and 1 is opaque.
-
-  # Text color (true=light or false=dark).
-  # text_color_light = true  
-  
-[advanced]
- # Custom CSS. 
- css_style = ""
- 
- # CSS class.
- css_class = ""
-+++
-
diff --git a/content/impact/impact.md b/content/impact/impact.md
index 5d3e724cc62..8d8af836d3e 100644
--- a/content/impact/impact.md
+++ b/content/impact/impact.md
@@ -56,7 +56,7 @@ subtitle = ""
 ## **Motivation**
 ---------------------
 
-Recently, the scientific community took steps to reflect a widespread awareness of, and call for, improved practices ushering in the “credibility revolution,” including higher standards of evidence, preregistration, direct replication, transparency, and openness. The accelerating adoption of open science practices has been perhaps the most significant change in how social scientists work in the last decade. 
+The scientific community has taken steps to reflect a widespread awareness of, and call for, improved practices ushering in the “credibility revolution,” including higher standards of evidence, preregistration, direct replication, transparency, and openness. The accelerating adoption of open science practices has been perhaps the most significant change in how social scientists work in the last decade. 
 
 *However*, while there are still issues standing in the way of widespread adoption by academics, the integration of these new and improved principles into researchers’ educational pipeline lags behind (to the detriment of students and the quality of higher education). In an effort to raise awareness of the educational benefits of open and reproducible scholarship to students, **we review** the extant literature on the topic, to tease out why academics should integrate these principles in their teaching and mentoring, and provide recommendations.
 
@@ -79,7 +79,7 @@ To review and synthesize the evidence that investigates whether embedding open a
 
 Our review of the evidence is summarized in a manuscript entitled *Teaching open and reproducible scholarship: a critical review of the evidence base for current pedagogical methods and their outcomes*. This describes the available (empirical) evidence of the impact and importance of integrating open scholarship into higher education, its benefits and challenges within three areas: students’ (a) scientific literacy; (b) engagement with science; and (c) attitudes towards science.
 
-Our manuscript has been **published**!. Cite as:
+Our manuscript has been **published**! Cite as:
 
 > Pownall, M., Azevedo, F., König, L. M., Slack, H. R., Evans, T. R., Flack, Z., ... & FORRT. (2023). Teaching open and reproducible scholarship: a critical review of the evidence base for current pedagogical methods and their outcomes. *Royal Society Open Science*, *10*(5), Article 221255. https://doi.org/10.1098/rsos.221255
 
@@ -94,11 +94,11 @@ The manuscript was an international effort! Contributors were located across mul
 <br>
 
 
-### Lecture & Slides
+### Lecture
 
 <br>
 
-Dr. Madeleine Pownall presents a summary of the article in this lecture. You can find the slides here.
+Dr. Madeleine Pownall presents a summary of the article in this lecture.
 
 {{< youtube qYejqrtquzc >}}
  
@@ -106,4 +106,4 @@ Dr. Madeleine Pownall presents a summary of the article in this lecture. You can
 
 ### Get in touch
 
-If you know of relevant papers, please reach out by email at [info@forrt.org](mailto:info@forrt.org), or [join the project's Slack channel](https://join.slack.com/t/forrt/shared_invite/enQtODMwODI0OTk4ODgzLTM0ZTQ3NDk5MzA1ZjBmNWJjYTVlN2Y2YTk0ZTJhYTY5NDliMDYzMjg2MWE0ZDRhOTY0ZDY3OTRlNDA4ODQ3NjQ). If you want to learn more about the project, [see this announcement on social media](https://twitter.com/FORRTproject/status/1453325222367698947), [join the project's Slack channel](https://join.slack.com/t/forrt/shared_invite/enQtODMwODI0OTk4ODgzLTM0ZTQ3NDk5MzA1ZjBmNWJjYTVlN2Y2YTk0ZTJhYTY5NDliMDYzMjg2MWE0ZDRhOTY0ZDY3OTRlNDA4ODQ3NjQ).
\ No newline at end of file
+If you know of relevant papers, please reach out by email at [info@forrt.org](mailto:info@forrt.org), or [join the project's Slack channel](https://join.slack.com/t/forrt/shared_invite/enQtODMwODI0OTk4ODgzLTM0ZTQ3NDk5MzA1ZjBmNWJjYTVlN2Y2YTk0ZTJhYTY5NDliMDYzMjg2MWE0ZDRhOTY0ZDY3OTRlNDA4ODQ3NjQ).
\ No newline at end of file
diff --git a/content/just_os_chatbot/intro.md b/content/just_os_chatbot/intro.md
index fd2d9263c84..01e1211e205 100644
--- a/content/just_os_chatbot/intro.md
+++ b/content/just_os_chatbot/intro.md
@@ -39,7 +39,7 @@ JUST-OS writes its answers with [OpenScholar](https://huggingface.co/OpenSciLM/L
 
 If you use or write about JUST-OS, please also cite OpenScholar:
 
-> Asai, A., He, J., Shao, R., et al. (2026). Synthesizing scientific literature with retrieval-augmented language models. *Nature*, *650*(8103), 857–863. [https://doi.org/10.1038/s41586-025-10072-4](https://doi.org/10.1038/s41586-025-10072-4)
+{{< citation-card key="Asai2026OpenScholar" />}}
 
 
 --- 
diff --git a/content/lesson-plans/nd-lessons-plans.md b/content/lesson-plans/nd-lessons-plans.md
index c588695c8c6..9bc1797dbcd 100644
--- a/content/lesson-plans/nd-lessons-plans.md
+++ b/content/lesson-plans/nd-lessons-plans.md
@@ -55,7 +55,7 @@ subtitle = ""
 ### Motivation
 ---------------------
 
-Developing educational resources is essential to facilitate engagement with, adherence to, and learning of research transparency, replicability, openness, and reproducibility. Despite the growing awareness of the benefits of training reproducible methods within undergraduate and postgraduate curricula, there remains a lack of systematic incorporation of open scholarship practices in taught courses across Higher Education. While many pedagogical resources are regularly developed for this purpose, they are not often openly and actively shared with the wider community. While the potential reasons for this are diverse, one reason may be the dearth of available ready-to-use educational resources. 
+Developing educational resources is essential to facilitate engagement with, adherence to, and learning of research transparency, {{< term "Replicability" "replicability" >}}, openness, and {{< term "Reproducibility" "reproducibility" >}}. Despite the growing awareness of the benefits of training reproducible methods within undergraduate and postgraduate curricula, there remains a lack of systematic incorporation of open scholarship practices in taught courses across Higher Education. While many pedagogical resources are regularly developed for this purpose, they are not often openly and actively shared with the wider community. While the potential reasons for this are diverse, one reason may be the dearth of available ready-to-use educational resources. 
 
 To support instructors aiming to bridge that gap, FORRT's community built open educational resources that can be integrated into taught courses ‘out of the box’. As creating or changing course content can be onerous and time-consuming, we aimed to make evidence-based, high-quality lesson plans and activities available to teaching faculty, thus reducing the labour required to develop and implement open scholarship content.
 
@@ -73,7 +73,7 @@ We compiled lesson plans and activities, and categorized them based on their the
 
 You can find *all lesson plans* [in this OSF repository](https://osf.io/th254/), and here's one example about [Interpreting effect sizes and confidence intervals](LessonPlans1.pdf) and another on [Prediction Markets](LessonPlans2.pdf). 
 
-Each has suitable context: (e.g., entry-level/undergraduate/postgraduate), total time: (e.g., 1 hour, 2 hours, 1 day, etc.), pre-requisites, related resources (e.g. slides, assignment materials, lecture recordings, etc), learning outcomes, brokendown per activity length (10min, 30min, etc.). Here's all the topics that we prepared Lesson Plans far:
+Each has suitable context: (e.g., entry-level/undergraduate/postgraduate), total time: (e.g., 1 hour, 2 hours, 1 day, etc.), pre-requisites, related resources (e.g. slides, assignment materials, lecture recordings, etc), learning outcomes, broken down per activity length (10min, 30min, etc.). Here are all the topics for which we have prepared Lesson Plans so far:
 
 1. [Interpreting effect sizes and confidence intervals](https://osf.io/8jmbu/)
 1. [Registered Replication Report](https://osf.io/2znr4/)
@@ -90,8 +90,8 @@ Each has suitable context: (e.g., entry-level/undergraduate/postgraduate), total
 1. [Diversity and research](../neurodiversity-lessonbank/diversity-and-research/)
 1. [Oppression and Power](../neurodiversity-lessonbank/masterstools/)
 1. [Generalizability Crisis](../neurodiversity-lessonbank/generalizability/)
-1. The myth of the normality How neurodiversity dismantles the generalisability crisis[Text 1](https://journalofethics.ama-assn.org/article/myth-normal-brain-embracing-neurodiversity/2015-04) [Text 2](https://www.cambridge.org/core/journals/behavioral-and-brain-sciences/article/abs/generalizability-crisis/AD386115BA539A759ACB3093760F4824)
-1. [The myth of the normality How neurodiversity dismantles the generalisability crisis - Lesson Plan](../neurodiversity-lessonbank/Lesson_Plans/The_myth_of_the_normality_How_neurodiversity_dismantles_the_generalisability_crisis.pdf)
+1. The myth of the normality: How neurodiversity dismantles the generalisability crisis [Text 1](https://journalofethics.ama-assn.org/article/myth-normal-brain-embracing-neurodiversity/2015-04) [Text 2](https://www.cambridge.org/core/journals/behavioral-and-brain-sciences/article/abs/generalizability-crisis/AD386115BA539A759ACB3093760F4824)
+1. [The myth of the normality: How neurodiversity dismantles the generalisability crisis - Lesson Plan](../neurodiversity-lessonbank/Lesson_Plans/The_myth_of_the_normality_How_neurodiversity_dismantles_the_generalisability_crisis.pdf)
 1. [Neurodiversity Culture and Teaching - text](http://web.archive.org/web/20240802211120/https://www.rapidintellect.com/AEQweb/ed-5971.pdf) Lesson Plan Pdf[Neurodiversity Culture and Teaching - Lesson Plan](../neurodiversity-lessonbank/Lesson_Plans/Neuro_para.pdf)
 1. [Avoiding ableist language to diversify OS - text](https://www.liebertpub.com/doi/10.1089/aut.2020.0014)Lesson Plan pdf[Avoiding ableist language to diversify OS](../neurodiversity-lessonbank/Lesson_Plans/Avoiding_ableist%20language_to_diversify_open_scholarship.pdf)
 1. How can Open Scholarship address structural ableism and racism? [Text 1](https://www.apa.org/science/about/psa/2019/02/open-science) [Text 2](https://doi.org/10.1080/09638288.2023.2173315) LessonPlan Pdf[How can Open Scholarship address structural ableism and racism?](../neurodiversity-lessonbank/Lesson_Plans/How_can_we_Open%20Scholarship_to_address_the%20structural_ableism_and_racism_in_our_society.pdf)
@@ -100,7 +100,7 @@ Each has suitable context: (e.g., entry-level/undergraduate/postgraduate), total
 
 We hope to keep producing more Lesson Plans, so please check this space. Our community is working on this ["Table of Activities"](https://docs.google.com/spreadsheets/d/1LGdBFlOCFqyfV7NUx11oUjkqR-aVZpWVGCn8RTiQQuk/edit#gid=0) to which you can add your own ideas (see how to contribute below) and help us empower educators and stakeholders with high quality and accessible lesson plans (and educational materials) to accelerate institutional change towards the integration of open and reproducible science into Higher Education curricula!
 
-Lastly, accompanying the Lesson Plans, FORRT’s team wrote a short manuscript entitled ["Embedding open and reproducible teaching into undergraduate training"](https://psyarxiv.com/fgv79) [(OA Postprint)](https://doi.org/10.31234/osf.io/fgv79) which is now published in the APA's [Scholarship of Teaching and Learning in Psychology](https://doi.org/10.1037/stl0000307), where we describe and openly share a bank of teaching resources and lesson plans on the broad topics of open scholarship, open science, replication, and reproducibility that can be readily integrated into taught courses.
+Lastly, accompanying the Lesson Plans, FORRT’s team wrote a short manuscript entitled ["Embedding open and reproducible teaching into undergraduate training"](https://psyarxiv.com/fgv79) [(OA Postprint)](https://doi.org/10.31234/osf.io/fgv79) which was published in the APA's [Scholarship of Teaching and Learning in Psychology](https://doi.org/10.1037/stl0000307), where we describe and openly share a bank of teaching resources and lesson plans on the broad topics of open scholarship, open science, replication, and reproducibility that can be readily integrated into taught courses.
 
 <br>
 
@@ -144,7 +144,9 @@ You can still contribute to the collection of Lesson Plans by adding your ideas
 
 ### Pedagogical Activities
 
-{{< click_to_load src="https://docs.google.com/spreadsheets/d/e/2PACX-1vRxqwa1rfgn-mB2hdCd3DzQHYMV7bOpQw6hRwXQodSnKjL1QvV4r5Aaf0kr-AVKc9zk60ejgDhZ-FLV/pubhtml?widget=true&headers=false" provider="Google" label="This document" style="border:0px; width:100%; height:100%;" >}}
+[Open the full table](https://docs.google.com/spreadsheets/d/e/2PACX-1vRxqwa1rfgn-mB2hdCd3DzQHYMV7bOpQw6hRwXQodSnKjL1QvV4r5Aaf0kr-AVKc9zk60ejgDhZ-FLV/pubhtml) in Google Sheets. On a narrow screen, the table below scrolls sideways.
+
+{{< click_to_load src="https://docs.google.com/spreadsheets/d/e/2PACX-1vRxqwa1rfgn-mB2hdCd3DzQHYMV7bOpQw6hRwXQodSnKjL1QvV4r5Aaf0kr-AVKc9zk60ejgDhZ-FLV/pubhtml?widget=true&headers=false" provider="Google" label="This document" title="Table of lesson plans" height="700" style="border:0px; width:100%;" >}}
 
 <br>
 
@@ -154,6 +156,6 @@ These resources were created as part of the Society for Improving Psychological
 
 #### Contributorship 
 
-In line with principles enshrined in FORRT, this google-sheet is an open online contributorship project. The work of all contributors are valued and are formally recognized. With this, we hope to expand the scope and diversity of FORRT’s mission and its team.
+In line with principles enshrined in FORRT, this google-sheet is an open online contributorship project. The work of all contributors is valued and formally recognized. With this, we hope to expand the scope and diversity of FORRT’s mission and its team.
 
 <br>
diff --git a/content/manuscript/index.md b/content/manuscript/index.md
index 3f4017f850a..f7a97366a5b 100644
--- a/content/manuscript/index.md
+++ b/content/manuscript/index.md
@@ -3,9 +3,6 @@
 type = "widget_page"
 headless = false  # Homepage is headless, other widget pages are not.
 title = "Manuscript"
-# The code block sits in the headless section file `manuscript.md`, which is not part of
-# this page's `.Content`, so Highlight.js has to be requested explicitly.
-highlight = true
 # url = "/forrt/manuscript"
 +++
 
diff --git a/content/manuscript/manuscript.md b/content/manuscript/manuscript.md
index aebc3c794db..d53fd645ada 100644
--- a/content/manuscript/manuscript.md
+++ b/content/manuscript/manuscript.md
@@ -85,7 +85,7 @@ FORRT is an evolving, community-driven framework comprised of educators from mul
 
 {{< expand "Read FORRT's manuscript (.pdf)" >}}
 
-# {{< embed name="forrt_v1.pdf" height=1000 >}}
+{{< embed name="forrt_v1.pdf" height=1000 >}}
 
 {{< /expand >}}
 
@@ -111,8 +111,8 @@ In line with principles enshrined in FORRT, this manuscript is an open online co
 
 <br>
 
-***Small note on FORRT's manuscript and authorship***
+***Small note on FORRT's manuscript and authorship (written in October 2020)***
 
-After the 'official' launch of FORRT's website, the FORRT manuscript becomes FORRT's top priority (along with FORRT pedagogies). As per *FORRT's #3 Communiqué*, the FORRT manuscript goes from ‘FORRT’ as the sole author to the standard ‘normal’ authorship procedure, with a CrediT/Tenzing statement indicating each individual contribution, and now FORRT becomes the as the last 'senior' author of any/all FORRT manuscripts. This change is made so any/all work -and ensuing credit- is recognized, which is a demand given the current incentive structure of academia. So, despite the fact that FORRT had envisioned a different path (see current version of Live Manuscript), it was brought to our attention the need and importance to support those working in FORRT, above all because most of the work done in FORRT is done by ERCs and graduate students who wish to have a chance at becoming academics one day. We believe it makes sense to make this change as a means to (a) give those concerned with a participation incentive; (b) give ERCs and graduate students an academic publication with which they can leverage their chances in moving up the academic ladder; (c) be able to reciprocate in academia’s currency the labor and dedication of so many important actors that made FORRT possible; (d) incentivize adherence and participation in FORRT’s community and initiatives. We will recontact everyone who in some way or another has contributed to FORRT to renew their commitment, as well as contact folks whose contributions are valued by our community. 
+After the 'official' launch of FORRT's website, the FORRT manuscript becomes FORRT's top priority (along with FORRT pedagogies). As per *FORRT's #3 Communiqué*, the FORRT manuscript goes from ‘FORRT’ as the sole author to the standard ‘normal’ authorship procedure, with a CrediT/Tenzing statement indicating each individual contribution, and now FORRT becomes the last 'senior' author of any/all FORRT manuscripts. This change is made so any/all work -and ensuing credit- is recognized, which is a demand given the current incentive structure of academia. So, despite the fact that FORRT had envisioned a different path (see current version of Live Manuscript), it was brought to our attention the need and importance to support those working in FORRT, above all because most of the work done in FORRT is done by ERCs and graduate students who wish to have a chance at becoming academics one day. We believe it makes sense to make this change as a means to (a) give those concerned with a participation incentive; (b) give ERCs and graduate students an academic publication with which they can leverage their chances in moving up the academic ladder; (c) be able to reciprocate in academia’s currency the labor and dedication of so many important actors that made FORRT possible; (d) incentivize adherence and participation in FORRT’s community and initiatives. We will recontact everyone who in some way or another has contributed to FORRT to renew their commitment, as well as contact folks whose contributions are valued by our community. 
 
 <br>
diff --git a/content/mapping_os/mapping_os.md b/content/mapping_os/mapping_os.md
index 85000266eb2..d886d8a0df7 100644
--- a/content/mapping_os/mapping_os.md
+++ b/content/mapping_os/mapping_os.md
@@ -46,7 +46,7 @@ THIS PAGE IS IN CONSTRUCTION. PLEASE COME BACK SOON!
 <!-- <br> -->
 <!-- <br> -->
 
-Welcome to the FORRT Open Science Communities Mapping Initiative, a global effort to systematically identify, map, and connect Open Science (OS) organizations across disciplines and regions.
+Welcome to the FORRT Mapping Open Science Communities Initiative, a global effort to systematically identify, map, and connect Open Science (OS) organizations across disciplines and regions.
 
 > Our goal is to build an interactive, crowdsourced, and living map of grassroots Open Science networks, along with their procedural tools and structural changes, providing researchers, educators, and policymakers with a detailed landscape of the resources, opportunities, collaborations, and initiatives within these communities.
 
@@ -62,7 +62,7 @@ This initiative builds upon the successful mapping of Open Science initiatives i
 
 The Mapping Open Science Communities Initiative aims to systematically catalog and map Open Science (OS) organizations worldwide. By identifying grassroots networks, institutional initiatives, training resources, data repositories, and more, we hope to provide a comprehensive and accessible resource for the global research community.
 
-This project is guided by FORRT’s core mission of promoting research transparency, inclusivity, and rigorous scientific practices. Through an interactive map, researchers, educators, and the public will be able to explore resources sorted by research discipline, geographic region, language, or specific Open Science principles. The map is designed not just to showcase existing initiatives but also to encourage cross-disciplinary collaboration and increase the visibility of often under-represented regions and languages in the global OS movement.
+This project is guided by FORRT’s core mission of promoting research transparency, inclusivity, and rigorous scientific practices. Through an interactive map, which we are currently revising and will relaunch with verified entries, researchers, educators, and the public will be able to explore resources sorted by research discipline, geographic region, language, or specific Open Science principles. The map is designed not just to showcase existing initiatives but also to encourage cross-disciplinary collaboration and increase the visibility of often under-represented regions and languages in the global OS movement.
 
 <br>
 
@@ -91,7 +91,7 @@ By creating a "network of OS communities", the map will enable organizations tha
 * ***Addressing Fragmentation***: Many Open Science efforts are siloed, limiting their potential for broader collaboration and impact.
 * ***Promoting Inclusivity***: Many regions and languages are underrepresented in the global OS conversation. This initiative seeks to highlight OS organizations beyond the UK, US, and Europe, embracing the global scientific community.
 * ***Supporting Early-Career Researchers***: Grassroots networks often rely heavily on early-career researchers. This initiative will ensure they are supported with resources, opportunities, and recognition.
-* ***Bottom-up Culture Change***: Like COSGN, we believe that grassroots efforts are essential to complement top-down policy changes. Bottom-up networks can drive culture change more organically within research communities by offering peer-led training, resource-sharing, and collaboration.
+* ***Bottom-up Culture Change***: Like the Community of Open Scholarship Grassroots Networks (COSGN), we believe that grassroots efforts are essential to complement top-down policy changes. Bottom-up networks can drive culture change more organically within research communities by offering peer-led training, resource-sharing, and collaboration.
 
 ***Driving Culture Change and Innovation***
 
diff --git a/content/neurodiversity-lessonbank/_index.md b/content/neurodiversity-lessonbank/_index.md
index 951679ce265..9ddcc3fbd4c 100644
--- a/content/neurodiversity-lessonbank/_index.md
+++ b/content/neurodiversity-lessonbank/_index.md
@@ -3,66 +3,28 @@ title: FORRT Neurodiversity and Open Scholarship Lesson Bank
 type: plain_page
 ---	
 
-![FORRT logo](./images/logo.webp)
+This lesson bank has been developed by FORRT (Framework for Open and Reproducible Research) in order to promote {{< term "Open Scholarship" >}} and Neurodiversity in academia. The materials raise awareness of some of the most recent debates relating to science and invite students engage in epistemological discussions and to reflect on the core values of {{< term "Open Science" >}}.
 
----
-
-This lesson bank has been developed by FORRT (Framework for Open and Reproducible Research) in order to promote Open Scholarship and Neurodiversity in academia. The materials raise awareness of some of the most recent debates relating to science and invite students engage in epistemological discussions and to reflect on the core values of Open Science.
-
----
-
-Resources presented at a workshop titled "**Neurodiversify your curriculum** delivered by Lorna Hamilton, Magdalena Grose-Hodge, Mahmoud Elsherif & the FORRT group at the Unconference 2023: Open Scholarship Practices in Education Research. If you would like to provide feedback, please contact Magdalena Grose-Hodge (m.s.grose-hodge@bham.ac.uk)
-
-<a href="https://ray.yorksj.ac.uk/id/eprint/7606/" target="_blank">Read about the project</a>
-
-### Resources
-
-Click on the lesson materials to open a new window.
-
-Lesson 1&amp;2: <a href="./implicit_bias/"><u>Implicit bias</u></a>
-
-   <a href="./Lesson_Plans/implicit_bias_lesson_plan.pdf" target="_blank"><u>Implicit bias - Lesson Plan part 1</u></a>
-
-   <a href="./Lesson_Plans/Implicit_Bias_part_2.pdf" target="_blank"><u>Implicit bias - Lesson Plan part 2</u></a>
-
-Lesson 3: <a href="./community-psychology-diversity/"><u>Diversity as one of the core values of Open Science</u></a>
+## Lessons
 
-   <a href="./Lesson_Plans/Diversity_as_a_corevalue_of_Open%20Science.pdf" target="_blank"><u>Diversity as one of the core values of Open Science - Lesson Plan</u></a>
+A lesson title that is a link opens the lesson's own page. Lesson plans and texts open in a new window.
 
-Lesson 4: <a href="./diversity-and-research/"><u>Diversity and research</u></a>
+<ol class="lesson-grid">
+<li class="lesson-card"><p class="lesson-num">Lessons 1 and 2</p><h3><a href="./implicit_bias/">Implicit bias</a></h3><ul class="lesson-materials"><li><a href="./Lesson_Plans/implicit_bias_lesson_plan.pdf" target="_blank" rel="noopener">Lesson plan, part 1</a></li><li><a href="./Lesson_Plans/Implicit_Bias_part_2.pdf" target="_blank" rel="noopener">Lesson plan, part 2</a></li></ul></li>
+<li class="lesson-card"><p class="lesson-num">Lesson 3</p><h3><a href="./community-psychology-diversity/">Diversity as one of the core values of Open Science</a></h3><ul class="lesson-materials"><li><a href="./Lesson_Plans/Diversity_as_a_corevalue_of_Open%20Science.pdf" target="_blank" rel="noopener">Lesson plan</a></li></ul></li>
+<li class="lesson-card"><p class="lesson-num">Lesson 4</p><h3><a href="./diversity-and-research/">Diversity and research</a></h3><ul class="lesson-materials"><li><a href="./Lesson_Plans/Diversity_and_Research.pdf" target="_blank" rel="noopener">Lesson plan</a></li></ul></li>
+<li class="lesson-card"><p class="lesson-num">Lesson 5</p><h3><a href="./masterstools/">Oppression and Power</a></h3><p class="lesson-note">Materials on the lesson page.</p></li>
+<li class="lesson-card"><p class="lesson-num">Lesson 6</p><h3><a href="./generalizability/">Generalizability Crisis</a></h3><ul class="lesson-materials"><li><a href="./Lesson_Plans/generalizability.pdf" target="_blank" rel="noopener">Lesson plan</a></li></ul></li>
+<li class="lesson-card"><p class="lesson-num">Lesson 7</p><h3>The myth of the normality: How neurodiversity dismantles the generalisability crisis</h3><ul class="lesson-materials"><li><a href="https://journalofethics.ama-assn.org/article/myth-normal-brain-embracing-neurodiversity/2015-04" target="_blank" rel="noopener">Text 1</a></li><li><a href="https://www.cambridge.org/core/journals/behavioral-and-brain-sciences/article/abs/generalizability-crisis/AD386115BA539A759ACB3093760F4824" target="_blank" rel="noopener">Text 2</a></li><li><a href="./Lesson_Plans/The_myth_of_the_normality_How_neurodiversity_dismantles_the_generalisability_crisis.pdf" target="_blank" rel="noopener">Lesson plan</a></li></ul></li>
+<li class="lesson-card"><p class="lesson-num">Lesson 8</p><h3>Neurodiversity Culture and Teaching</h3><ul class="lesson-materials"><li><a href="http://web.archive.org/web/20240802211120/https://www.rapidintellect.com/AEQweb/ed-5971.pdf" target="_blank" rel="noopener">Text</a></li><li><a href="./Lesson_Plans/Neuro_para.pdf" target="_blank" rel="noopener">Lesson plan</a></li></ul></li>
+<li class="lesson-card"><p class="lesson-num">Lesson 9</p><h3>Avoiding ableist language to diversify OS</h3><ul class="lesson-materials"><li><a href="https://www.liebertpub.com/doi/10.1089/aut.2020.0014" target="_blank" rel="noopener">Text</a></li><li><a href="./Lesson_Plans/Avoiding_ableist%20language_to_diversify_open_scholarship.pdf" target="_blank" rel="noopener">Lesson plan</a></li></ul></li>
+<li class="lesson-card"><p class="lesson-num">Lesson 10</p><h3>How can Open Scholarship address structural ableism and racism?</h3><ul class="lesson-materials"><li><a href="https://www.apa.org/science/about/psa/2019/02/open-science" target="_blank" rel="noopener">Text 1</a></li><li><a href="https://doi.org/10.1080/09638288.2023.2173315" target="_blank" rel="noopener">Text 2</a></li><li><a href="./Lesson_Plans/How_can_we_Open%20Scholarship_to_address_the%20structural_ableism_and_racism_in_our_society.pdf" target="_blank" rel="noopener">Lesson plan</a></li></ul></li>
+</ol>
 
-   <a href="./Lesson_Plans/Diversity_and_Research.pdf" target="_blank"><u>Diversity and research - Lesson Plan</u></a>
+## About the workshop
 
-Lesson 5: <a href="./masterstools/"><u>Oppression and Power</u></a>
+Resources presented at a workshop titled "**Neurodiversify your curriculum**", delivered by Lorna Hamilton, Magdalena Grose-Hodge, Mahmoud Elsherif & the FORRT group at the Unconference 2023: Open Scholarship Practices in Education Research. If you would like to provide feedback, please contact Magdalena Grose-Hodge (m.s.grose-hodge@bham.ac.uk).
 
-Lesson 6: <a href="./generalizability/"><u>Generalizability Crisis</u></a>
-
-   <a href="./Lesson_Plans/generalizability.pdf" target="_blank"><u>Generalizability Crisis - Lesson Plan</u></a>
-
-Lesson 7: The myth of the normality: How neurodiversity dismantles the generalisability crisis  
-   <a href="https://journalofethics.ama-assn.org/article/myth-normal-brain-embracing-neurodiversity/2015-04" target="_blank"><u>Text 1</u></a>  
-   <a href="https://www.cambridge.org/core/journals/behavioral-and-brain-sciences/article/abs/generalizability-crisis/AD386115BA539A759ACB3093760F4824" target="_blank"><u>Text 2</u></a>  
-   <a href="./Lesson_Plans/The_myth_of_the_normality_How_neurodiversity_dismantles_the_generalisability_crisis.pdf" target="_blank"><u>The myth of the normality How neurodiversity dismantles the generalisability crisis - Lesson Plan</u></a>
-
-Lesson 8: <a href="http://web.archive.org/web/20240802211120/https://www.rapidintellect.com/AEQweb/ed-5971.pdf" target="_blank"><u>Neurodiversity Culture and Teaching - text</u></a>
-
-   <a href="./Lesson_Plans/Neuro_para.pdf" target="_blank"><u>Neurodiversity Culture and Teaching - Lesson Plan</u></a>
-
-Lesson 9: <a href="https://www.liebertpub.com/doi/10.1089/aut.2020.0014" target="_blank"><u>Avoiding ableist language to diversify OS - text</u></a>
-
-   <a href="./Lesson_Plans/Avoiding_ableist%20language_to_diversify_open_scholarship.pdf" target="_blank"><u>Avoiding ableist language to diversify OS - Lesson Plan</u></a>
-
-Lesson 10: How can Open Scholarship address structural ableism and racism?  
-   <a href="https://www.apa.org/science/about/psa/2019/02/open-science" target="_blank"><u>Text 1</u></a>  
-   <a href="https://doi.org/10.1080/09638288.2023.2173315" target="_blank"><u>Text 2</u></a>  
-   <a href="./Lesson_Plans/How_can_we_Open%20Scholarship_to_address_the%20structural_ableism_and_racism_in_our_society.pdf" target="_blank"><u>Lesson Plan</u></a>
+<a href="https://ray.yorksj.ac.uk/id/eprint/7606/" target="_blank">Read about the project</a>
 
 {{< youtube oMkF8DiAolQ >}}
-
-<a href="https://msgrose-hodge.github.io/ND/h5p-standalone-1.3.x/demo/lhquestions.html" target="_blank">admin</a>
-
-<a href="https://msgrose-hodge.github.io/ND/h5p-standalone-1.3.x/demo/content-example-2.html" target="_blank">admin 2</a>
-
----
-
-<br>
diff --git a/content/neurodiversity-lessonbank/community-psychology-diversity/index.md b/content/neurodiversity-lessonbank/community-psychology-diversity/index.md
index 33f0f423917..50bcdc37d0a 100644
--- a/content/neurodiversity-lessonbank/community-psychology-diversity/index.md
+++ b/content/neurodiversity-lessonbank/community-psychology-diversity/index.md
@@ -101,7 +101,7 @@ Reflect on how you see or identify yourself in relation to these dimensions. Whi
 
 **Reading:**
 
-(to be be done before or after the lesson)
+(to be done before or after the lesson)
 
 Jason, Leonard A.; Glantsman, Olya; O'Brien, Jack F.; and Ramian, Kaitlyn N., "Introduction to Community Psychology: Becoming an Agent of Change" (2019). College of Science and Health Full Text Publications. 1. https://via.library.depaul.edu/cshtextbooks/1
 
diff --git a/content/neurodiversity-lessonbank/generalizability/index.md b/content/neurodiversity-lessonbank/generalizability/index.md
index 4b6c18d8641..300cad46a7f 100644
--- a/content/neurodiversity-lessonbank/generalizability/index.md
+++ b/content/neurodiversity-lessonbank/generalizability/index.md
@@ -10,7 +10,7 @@ Duration: 60 minutes
 
 Learning Objectives:
 
-- Understand the concept of generalizability in research
+- Understand the concept of {{< term "Generalizability" "generalizability" >}} in research
 - Recognize the factors that contribute to the generalizability crisis
 - Discuss the implications of the generalizability crisis in various fields
 
diff --git a/content/neurodiversity-lessonbank/implicit_bias/index.md b/content/neurodiversity-lessonbank/implicit_bias/index.md
index 6af363d3ea6..c74577738fa 100644
--- a/content/neurodiversity-lessonbank/implicit_bias/index.md
+++ b/content/neurodiversity-lessonbank/implicit_bias/index.md
@@ -156,7 +156,7 @@ Posts are moderated so they may not appear immediately.
 
 **Reading:**
 
-(to be be done before or after the lesson)
+(to be done before or after the lesson)
 
 Bottema-Beutel, K., Kapp, S. K., Lester, J. N., Sasson, N. J., & Hand, B. N. (2021). Avoiding Ableist Language: Suggestions for Autism Researchers. Autism in adulthood : challenges and management, 3(1), 18–29. https://doi.org/10.1089/aut.2020.0014
 
diff --git a/content/neurodiversity-lessonbank/masterstools/index.md b/content/neurodiversity-lessonbank/masterstools/index.md
index 9b9fad416b2..9921c3e26a3 100644
--- a/content/neurodiversity-lessonbank/masterstools/index.md
+++ b/content/neurodiversity-lessonbank/masterstools/index.md
@@ -22,9 +22,7 @@ Jason, Leonard A.; Glantsman, Olya; O'Brien, Jack F.; and Ramian, Kaitlyn N., "I
 
 <br>
 
-<div style="position: relative; padding-bottom: 120%; height: 0; overflow: hidden; margin: 20px 0; min-height: 400px;">
-{{< click_to_load src="https://press.rebus.community/introductiontocommunitypsychology/chapter/oppression-and-power/" provider="Rebus Press" label="This content" style="position: absolute; top: 0; left: 0; width: 100%; height: 100%;" title="Oppression and Power" >}}
-</div>
+[Read "Oppression and Power" on Rebus Press](https://press.rebus.community/introductiontocommunitypsychology/chapter/oppression-and-power/)
 
 <br>
 
diff --git a/content/neurodiversity/neurodiversity.md b/content/neurodiversity/neurodiversity.md
index 6ecedfa558e..17fa635c795 100644
--- a/content/neurodiversity/neurodiversity.md
+++ b/content/neurodiversity/neurodiversity.md
@@ -78,7 +78,7 @@ Although originally written about autistic people, we believe that this quote su
 - There is a community of people who research or teach for a living. They are known as academics and they often work in universities. There is a special culture associated with academics and their students, known as academia. 
 - Academics are expected to work very hard. How hard they work is measured by how many times they write or talk about their research. Academics sometimes compete with each other over who writes and talks the most, which makes them work even harder.
 - Neurodivergent people in academia face a lot of extra challenges. For example, they might behave in ways that neurotypicals do not expect. This can mean that the neurotypicals do not listen to them when they talk about their research.
-- We think that the neurodiversity movement can help to make academia better for everyone, by promoting acceptance, inclusion and support for anyone that needs it. - We are doing our best to advertise the benefits of the neurodiversity movement.
+- We think that the neurodiversity movement can help to make academia better for everyone, by promoting acceptance, inclusion and support for anyone that needs it. We are doing our best to advertise the benefits of the neurodiversity movement.
 
 ### How can I learn more?
 We are developing a lot of resources about neurodiversity in academia. Right now, these are mostly aimed at academics, so they can be a bit complicated or written using technical terms. You are welcome to read them and share them regardless!
@@ -251,7 +251,7 @@ Our work has been featured in:
 
 ## History & Management
 
-Team Neurodiversity was founded in 2021 by Mahmoud Elsherif, Tamara Kalandaze and Amélie Gourdon-Kanhukamwe. Please see [our blog post for FORRT’s Educators’ Corner](https://forrt.org/educators-corner/010-neurodiversity/) for more information about how Team Neurodiversity was formed, why it is needed, and our plans for future work. At the moment, the group channel has over 100 members who come from Europe, North America and Asia.
+Team Neurodiversity was founded in 2021 by Mahmoud Elsherif, Tamara Kalandadze and Amélie Gourdon-Kanhukamwe. Please see [our blog post for FORRT’s Educators’ Corner](https://forrt.org/educators-corner/010-neurodiversity/) for more information about how Team Neurodiversity was formed, why it is needed, and our plans for future work. At the moment, the group channel has over 100 members who come from Europe, North America and Asia.
 
 We have a rotating leadership team which changes every six months. To promote diverse and inclusive leadership, anyone can put themselves forward for this role, regardless of their experience.
 
diff --git a/content/nexus/intro-nexus.md b/content/nexus/intro-nexus.md
index bdf86c829ec..fc0a9d4c4f8 100644
--- a/content/nexus/intro-nexus.md
+++ b/content/nexus/intro-nexus.md
@@ -66,22 +66,22 @@ FORRT's e-learning platform (or Nexus) is a hub for community-driven initiatives
 * [Citation Politics](/citation-politics)
 * [Clusters](/clusters)
 * [Curated Resources](/resources)
-* [Developing Countries & OS](/os-developing-world)
-* [Educational NEXUS](/nexus)
+* [Developing Countries & Open Science](/os-developing-world)
+* [Educational Nexus](/nexus)
 * [Educators' Corner](/educators-corner)
-* [Equity in Open Science](/equityinos)
+* [Equity in Open Scholarship](/equityinos)
 * [Games Portal](/games)
 * [Glossary](/glossary)
-* [Impact of OS on students](/impact)
+* [Impact of Open Science on students](/impact)
 * [JUST-OS Chatbot](/just_os_chatbot)
 * [Lesson Plans](/lesson-plans/)
-* [Mapping OS Communities](/mapping_os)
-* [Neurodiversity Team](/neurodiversity)
+* [Mapping Open Science Communities](/mapping_os)
 * [Pedagogies](/pedagogies)
 * [Social Justice Initiatives](/dei)
 * [Summaries](/summaries)
 * [Syllabi Collection](/syllabus)
-* [Teaching OS](/teaching_os)
+* [Teaching Open Science](/teaching_os)
+* [Team Neurodiversity](/neurodiversity)
 * [Academic Wheel of Privilege (AWoP)](/awop)
 
 
@@ -89,9 +89,9 @@ FORRT's e-learning platform (or Nexus) is a hub for community-driven initiatives
 
 * Provide educators a comprehensive but straightforward framework to teach and mentor open and reproducible science (i.e., [FORRT Clusters](/clusters)<!-- -->) as well as qualify and quantify the degree of open and reproducible research practices in their teaching and mentoring (i.e., [FORRT's Lesson Plans](/lesson-plans) where teachers can find ready-to-use pedagogical activities with OS content; [FORRT's Glossary](/glossary) where educators find consensus-based crowd-sourced definitions of Open Science terminology), and [FORRT's Reversals](/reversals), where educators can find a curated collection of replications and reversals across social sciences to galvanize adoption of replications as a pedagogical tool in the classroom.
 * Curate and enrich available open educational resources and build an easy-to-use, searchable and FAIR platform to facilitate the integration of open and reproducible science into educators' teaching and mentoring (i.e., [FORRT's Curated Resources](/resources).)
-* Offer a platform for educators of all stripes to share their stories, experiences, successes and hardships in teaching and mentoring (i.e., [FORRT's Educational Corner](/educators-corner).)
+* Offer a platform for educators of all stripes to share their stories, experiences, successes and hardships in teaching and mentoring (i.e., [FORRT's Educators' Corner](/educators-corner).)
 * Foster social justice through the opening and democratization of scientific-educational resources to those who otherwise would be educationally disenfranchised (i.e., [FORRT's Initiatives Towards Social Justice in Academia](/dei), [FORRT's Equity in Open Scholarship Initiative](/equityinos), [FORRT's Neurodiversity Resources](/neurodiversity), [FORRT's Open Science Summaries](/summaries), [FORRT's Glossary](/glossary), [FORRT's Reversals](/reversals), & [FORRT's Curated list of Resources](/resources).)
-* Equipping scholars with high quality pedagogical tools on open and reproducible research practices - instructors can then adapt successful and implemented pedagogies to help ease the transition and reduce the instructor’s burden (e.g., [FORRT's 7 ways to adopt principled teaching and mentoring practices](/adopting/), [FORRT's Glossary](/glossary), [FORRT's Lesson Plans](/lesson-plans), [FORRT's Open & Reproducible Science Syllabus](https://forrt.org/syllabus), and [FORRT's Pedagogies](/pedagogies/).
+* Equipping scholars with high quality pedagogical tools on open and reproducible research practices - instructors can then adapt successful and implemented pedagogies to help ease the transition and reduce the instructor’s burden (e.g., [FORRT's 8 ways to adopt principled teaching and mentoring practices](/adopting/), [FORRT's Glossary](/glossary), [FORRT's Lesson Plans](/lesson-plans), [FORRT's Open & Reproducible Science Syllabus](https://forrt.org/syllabus), and [FORRT's Pedagogies](/pedagogies/)).
 
 FORRT's community conceptualized the Educational Nexus as integrating diverse components into one infrastructure serving those wishing to learn, adopt, and disseminate open and reproducible science tenets, as well as those teaching and mentoring these concepts, and raising awareness of its pedagogical implications and its associated challenges (e.g., curricular reform, epistemological uncertainty, methods of education, academic *Mertonian* norms in the classroom). 
 
diff --git a/content/nowherelab/_index.md b/content/nowherelab/_index.md
index 973caf0caa4..277f8ebd6eb 100644
--- a/content/nowherelab/_index.md
+++ b/content/nowherelab/_index.md
@@ -3,6 +3,7 @@ title: Nowhere Lab
 subtitle: An online lab community for those without a lab
 date: 2026-04-28
 sharing_image: "img/nowherelab-logo.png"
+header_logo: "img/nowherelab-logo.png"
 sharing_image_alt: "Nowhere Lab logo"
 ---
 
@@ -32,7 +33,7 @@ You can read more about Nowhere Lab in this [Educator's Corner post for FORRT](/
 
 ## Weekly meetings
 
-We hold weekly meetings that change time every 3 months to attempt to accommodate members in different time zones. From November 2025 onwards, *meetings are held Tuesdays at 9am (UK) and Thursdays at 4pm (UK)* and will be catch-up and co-work only, lasting approximately 1 hour. Members can set up other activities, such as practising a talk, by reaching out to our community on Slack.
+We hold two meetings a week, at different times to accommodate members in different time zones. *Meetings are currently held Tuesdays at 9am (UK) and Thursdays at 4pm (UK)* and are catch-up and co-work only, lasting approximately 1 hour. Members can set up other activities, such as practising a talk, by reaching out to our community on Slack.
 
 ## Slack channel
 
diff --git a/content/pedagogies/001-Julia-Strand/index.md b/content/pedagogies/001-Julia-Strand/index.md
index bccc1255447..d028c8f9adc 100644
--- a/content/pedagogies/001-Julia-Strand/index.md
+++ b/content/pedagogies/001-Julia-Strand/index.md
@@ -3,7 +3,7 @@
 
 title: "Open and Reproducible Science walks into a classroom"
 subtitle: "Insights from teaching a course on Psychology’s Credibility Revolution"
-summary: "Julia Strand shares her *know-how*, didactics, and teaching materials for her course on Psychology’s Credibility Revolution."
+summary: "Julia Strand shares her know-how, didactics, and teaching materials for her course on Psychology’s Credibility Revolution."
 authors: ['Julia Strand']
 tags: []
 categories: []
diff --git a/content/pedagogies/002-Gilad-Feldman/index.md b/content/pedagogies/002-Gilad-Feldman/index.md
index 5f8dc1ecf3c..69104a15fdc 100644
--- a/content/pedagogies/002-Gilad-Feldman/index.md
+++ b/content/pedagogies/002-Gilad-Feldman/index.md
@@ -3,7 +3,7 @@
 
 title: "Developing principled pedagogies - An Open Science journey"
 subtitle: "Insights from incorporating Open Science into teaching and mentoring."
-summary: "Gilad Feldman shares his outstanding *know-how* on how to integrate open scholarship in higher education."
+summary: "Gilad Feldman shares his outstanding know-how on how to integrate open scholarship in higher education."
 authors: ['Gilad Feldman']
 tags: []
 categories: []
diff --git a/content/pedagogies/004-Thomas-Rhys-Evans/index.md b/content/pedagogies/004-Thomas-Rhys-Evans/index.md
index e03e209c6ca..065e660aa18 100644
--- a/content/pedagogies/004-Thomas-Rhys-Evans/index.md
+++ b/content/pedagogies/004-Thomas-Rhys-Evans/index.md
@@ -3,7 +3,7 @@
 
 title: "From mental-health breakfast interventions to evidence-based practice"
 subtitle: "Teaching students how to critically engage with science."
-summary: "In this Pedagogies, Dr. Thomas Rhys Evan discusses how he developed and taught a 12-week module about evidence-based practice, focusing on incorporating Open Science principles with an eye on critical thinking skills and professional experience."
+summary: "Dr. Thomas Rhys Evans discusses how he developed and taught a 12-week module about evidence-based practice, focusing on incorporating Open Science principles with an eye on critical thinking skills and professional experience."
 authors: ['Dr. Thomas Rhys Evans']
 tags: []
 categories: []
diff --git a/content/pedagogies/_index.md b/content/pedagogies/_index.md
index 1def6fdc64f..6e748f99462 100644
--- a/content/pedagogies/_index.md
+++ b/content/pedagogies/_index.md
@@ -19,7 +19,7 @@ FORRT pedagogies might encompass reflections on increasing the dissemination, re
 
 It is our hope that scholars, instructors, educational institutions aiming to develop or reform degree programs and courses can use FORRT’s pedagogies as an initial template towards the creation of their personalized pedagogies. In this sense, the idea is to reduce the initial costs of integrating field-specific education with open and reproducible scholarship principles.
 
-We also hope that in the long term, this initiative can contribute to foster social justice through the opening and democratization of scientific educational resources and encourage changes in the academic incentive structures towards greater recognition of teaching and mentoring. 
+We also hope that in the long term, this initiative can contribute to fostering social justice through the opening and democratization of scientific educational resources and encourage changes in the academic incentive structures towards greater recognition of teaching and mentoring. 
 
 <br>
 <br>
\ No newline at end of file
diff --git a/content/positive-changes-replication-crisis/positive-changes-replication-crisis.md b/content/positive-changes-replication-crisis/positive-changes-replication-crisis.md
index eac4216e030..cdf514e276f 100644
--- a/content/positive-changes-replication-crisis/positive-changes-replication-crisis.md
+++ b/content/positive-changes-replication-crisis/positive-changes-replication-crisis.md
@@ -127,7 +127,7 @@ Our educational toolkit is designed to support educators, researchers, and stude
 * **Big Team Science:** Collaborative efforts involving large teams of researchers from multiple institutions and countries have become more common. This approach enhances the diversity and generalizability of findings. 
 * **Adversarial Collaborations:** Researchers with differing viewpoints collaborate to critically evaluate each other's work, helping to identify and correct biases before publication. 
 * **Open Science Communities:** Formation of communities and networks dedicated to open science, such as ReproducibiliTea journal clubs and the RIOT Science Club (and FORRT :wink:). These communities facilitate the sharing of best practices, resources, and support for implementing open science principles. They provide platforms for discussion, training, and collaboration, fostering a culture of openness and transparency within the scientific community. 
-* **Public Engagement and Outreach:** Increased efforts to engage with the public and other stakeholders about the importance of replicable and transparent research. This includes public lectures, workshops, and the use of social media to disseminate knowledge about open science practices. By involving the broader community, these initiatives aim to build trust and understanding between scientists and the public, highlighting the value of robust and reliable research findings.”
+* **Public Engagement and Outreach:** Increased efforts to engage with the public and other stakeholders about the importance of replicable and transparent research. This includes public lectures, workshops, and the use of social media to disseminate knowledge about open science practices. By involving the broader community, these initiatives aim to build trust and understanding between scientists and the public, highlighting the value of robust and reliable research findings.
 
 <br>
 
diff --git a/content/publications/publications.md b/content/publications/publications.md
index 0ee0985d214..57a68f9ef2f 100644
--- a/content/publications/publications.md
+++ b/content/publications/publications.md
@@ -57,7 +57,7 @@ subtitle = "Peer-reviewed research, tools, data, teaching materials, and policy
 <div class="pub-intro">
 
 <figure class="citation-container">
-  <img src="citation_chart.webp" alt="Citation Chart">
+  <img src="citation_chart.webp" alt="Bar chart of citations to FORRT's work per year, with its total citations, h-index and i10-index, from Google Scholar">
   <figcaption><a href="https://scholar.google.com/citations?user=JrBcgGMAAAAJ&hl=en&authuser=1" target="_blank">Details on Google Scholar</a></figcaption>
 </figure>
 
diff --git a/content/replication-hub/_index.md b/content/replication-hub/_index.md
index bbc7d8c6e1c..3ba5324b778 100644
--- a/content/replication-hub/_index.md
+++ b/content/replication-hub/_index.md
@@ -1,6 +1,6 @@
 ---
 title: "FORRT Replication Hub — Transforming Research"
-heading_title: "FORRT's Replication Hub"
+heading_title: "Replication Hub"
 description: "Support for every level of replication and reproduction — tracking, exploring, conducting, and disseminating replication studies across all research disciplines."
 type: replication_hub
 image: "replication_hub.webp"
@@ -8,83 +8,107 @@ image_alt: "FORRT Replication Hub diagram showing four areas: Track, Explore, Co
 sharing_image_resource: "replication_hub.webp"
 sharing_image_alt: "FORRT Replication Hub diagram showing four areas: Track, Explore, Conduct, Disseminate"
 
-intro: >
-  With the FORRT Replication Hub, our mission is to support reproduction and
-  replication studies across all stages of the research process as well as all
-  research disciplines. It consists of a comprehensive collection of resources
-  and tools designed to assist researchers in the *tracking*, *finding &
-  exploring*, *conducting*, and *publishing & dissemination* of reproduction and
-  replication studies.
+lede: "Evidence worth building on. Tools and guidance for reproduction and replication studies, at every stage and in every discipline."
 
+# A link with no `label` takes its name from the main menu, so renaming a menu entry renames it here.
+# Four common starting points, shown under the introduction, in the order of the stages (hub.css colours them).
+start:
+  - title: "Submit a replication"
+    text: "Add your study to FLoRA"
+    url: "replication-hub/submit/"
+  - title: "Check a paper"
+    text: "Find replications of the studies a paper cites"
+    url: "annotator/"
+  - title: "Plan a replication"
+    text: "The handbook for reproductions and replications"
+    url: "https://forrt.org/replication-handbook/"
+  - title: "Publish a replication"
+    text: "In Replication Research (R2), a diamond open access journal"
+    url: "https://replicationresearch.org"
 cards:
   - key: track
     title: Track
-    description: >
-      Reproductions and replications are often published in preprints, as part
-      of meta-papers that can include over one hundred studies, and in different
-      journals than the respective target studies. At the FORRT Replication Hub,
-      we track them in multiple ways by linking original and target studies.
+    summary: Catalogue replication attempts.
     links:
-      - text: "FORRT Library of Reproduction and Replication Attempts (FLoRA)"
-        url: "/replication-hub/flora/"
-      - text: "FLoRA Submission Form"
-        url: "/replication-hub/submit/"
-      - text: "Positive Changes from the Replication Crisis"
-        url: "https://doi.org/10.1038/s44271-023-00003-2"
+      - url: "replication-hub/flora/"
+        format: "Database"
+        label: "FLoRA"
+        note: "FORRT's library of reproduction and replication attempts."
+      - url: "replication-hub/submit/"
+        format: "Form"
+        label: "Submit a replication"
+        note: "Help the community find and use replication evidence."
 
   - key: explore
     title: Explore
-    description: >
-      *Gotta catch 'em all!* Researchers who are looking to incorporate hundreds
-      of replication attempts into their research and teaching can make use of
-      our free and open-source tools. These are mostly based on FLoRA and FReD.
+    summary: Discover and explore replications.
     links:
-      - text: "FLoRA Annotator"
-        url: "/annotator"
-      - text: "FLoRA Explorer"
-        url: "/flora-explorer/"
-      - text: "FReD Explorer"
-        url: "/explorer"
-      - text: "FReD R Package"
-        url: "/fred"
-      - text: "Replication Atlas"
-        url: "/flora-replication-atlas/"
-      - text: "Zotero Replication Checker"
-        url: "/flora-zotero/"
-      - text: "FORRT ORE browser extension"
-        url: "/chromium-extension/"
+      - url: "https://forrt.org/flora-replication-atlas/"
+        format: "Web app"
+        note: "Look up any study and see every replication and reproduction attempt on record."
+      - url: "https://forrt.org/flora-explorer/"
+        format: "Web app"
+        label: "FLoRA Explorer"
+        note: "Browse FLoRA by study, year, discipline and citation impact."
+      - url: "annotator/"
+        format: "Web app"
+        label: "FLoRA Annotator"
+        note: "Look up replication and reproduction attempts for any reference."
+      - url: "explorer/"
+        format: "Web app"
+        note: "Find replication evidence in the FORRT Replication Database."
+      - url: "https://forrt.org/fred/index.html"
+        format: "R package"
+        note: "Work with replication data in your own analyses."
+      - url: "https://forrt.org/flora-zotero/"
+        format: "Zotero plug-in"
+        note: "Check your references for replication evidence."
+      - url: "https://forrt.org/chromium-extension/"
+        format: "Browser extension"
+        note: "See replication evidence, retractions, PubPeer comments and open-access copies for the papers you read."
 
   - key: conduct
     title: Conduct
-    description: >
-      Since failures to replicate a large proportion of seminal findings across
-      many disciplines, interest in reproduction and replication has surged and
-      given rise to new techniques and methods. Our resources help students,
-      ECRs, and experienced researchers to take up newly developed methods and
-      conduct high-quality replication research.
+    summary: Run high-quality replications.
     links:
-      - text: "Handbook for Reproduction and Replication Studies (WIP)"
-        url: "/replication-handbook"
-      - text: "Manuscript Templates"
-        url: "https://osf.io/brxtd/"
-      - text: "Love Replications Week"
-        url: "/love-replications-week"
-      - text: "ReplicateThis Nomination Portal (demo!)"
-        url: "/replicatethis"
+      - url: "https://forrt.org/replication-handbook/"
+        format: "Guide"
+        note: "Find guidance for planning and conducting your study."
+      - url: "https://osf.io/brxtd/"
+        format: "Templates"
+        note: "Start writing with resources designed for replication research."
+      - url: "replication-hub/large-scale-replication-projects"
+        format: "List"
+        note: "Explore collaborative reproduction and replication work."
+      - url: "https://forrt.org/love-replications-week/"
+        format: "Event"
+        label: "Love Replications Week"
+        note: "A week of best practices, contact with experts and open community."
+      - url: "https://forrt.org/replicatethis/"
+        format: "Prototype"
+        label: "ReplicateThis Nomination Portal (demo)"
+        note: "An early prototype of a community registry for scientific verification."
 
   - key: disseminate
     title: Disseminate
-    description: >
-      Research is meant to be shared. While many areas of academic culture value
-      innovation for the sake of robustness and repetition, we strive for
-      equality. With a dedicated and community-owned diamond open access journal
-      led by a group of experts, FORRT supports all researchers in publishing
-      high-quality repetitions.
+    summary: Get replications to the people who need them.
     links:
-      - text: "Replication Research (R2) Diamond Open Access Journal"
-        url: "http://replicationresearch.org"
-      - text: "R2 Mentorship Program"
-        url: "https://ejournals.uni-muenster.de/replicationresearch/mentorshipprogram"
-      - text: "Replication Journal Federation"
-        url: "/rjf"
+      - url: "https://replicationresearch.org"
+        format: "Journal"
+        label: "Replication Research (R2)"
+        note: "Publish and read reproduction and replication research in a diamond open access journal."
+      - url: "https://ejournals.uni-muenster.de/replicationresearch/mentorshipprogram"
+        format: "Programme"
+        label: "R2 Mentorship Program"
+        note: "The journal's mentorship programme."
+      - url: "https://forrt.org/rjf/"
+        format: "Network"
+        label: "Replication Journal Federation"
+        note: "Free to publish, free to read and free from commercial interests."
+      - url: "reversals"
+        format: "Archive"
+        note: "Follow research that examines what holds up."
+      - url: "positive-changes-replication-crisis"
+        format: "Collection"
+        note: "See how research practice has changed in response."
 ---
diff --git a/content/replication-hub/submit/index.md b/content/replication-hub/submit/index.md
index 5009d897a6d..66880e89f2c 100644
--- a/content/replication-hub/submit/index.md
+++ b/content/replication-hub/submit/index.md
@@ -12,6 +12,6 @@ please submit it using the form below.
 
 If you want to check if a replication study is already included in the database, 
 the easiest way is to use the 
-<a href="/annotator" target="_blank">References Annotator</a>
+<a href="/annotator" target="_blank">FLoRA References Annotator</a>
 
-{{< click_to_load src="https://docs.google.com/forms/d/e/1FAIpQLSeMCwdtP0TPgL55stniuyyTxnNwyC34mO4VUuLcQwYrLI89sQ/viewform" provider="Google" label="This document" width="100%" height="800px" >}}
+{{< click_to_load src="https://docs.google.com/forms/d/e/1FAIpQLSeMCwdtP0TPgL55stniuyyTxnNwyC34mO4VUuLcQwYrLI89sQ/viewform" provider="Google" label="This document" title="Form to submit a replication" width="100%" height="800px" >}}
diff --git a/content/resources/_index.md b/content/resources/_index.md
new file mode 100644
index 00000000000..286215ff129
--- /dev/null
+++ b/content/resources/_index.md
@@ -0,0 +1,88 @@
++++
+# The curated resources directory: layouts/resources/list.html. Each resource's own page comes
+# from the FORRT Database 2.0 sheet through resource.py, in this folder.
+title = "Resources"
+type = "resources"
+outputs = ["HTML"]  # No feed: the section gained no RSS when it became a list page.
+
+heading = "Teaching resources"
+lede = "Open up your teaching. Find, access and reuse materials from a curated collection of %s open scholarship resources."
+form_url = "https://docs.google.com/forms/d/e/1FAIpQLSfPceN5opEeauCBSvapoB-ADpH0IoT24XOLfQGaVEF0EJGFOA/viewform"
+
+# Clusters come from `forrt_clusters_new`, comma-separated. A new one not named here still gets
+# a filter, under its own spelling, after these.
+clusters = [
+  "Replication Crisis and Credibility Revolution",
+  "Conceptual and Statistical Knowledge",
+  "Transparency and Reproducibility in Computation and Analysis",
+  "Pre-analysis Planning",
+  "Ways of Working",
+  "Research Integrity",
+  "Academic Structures and Institutions",
+  "Replication and Meta-Research",
+  "Publication Sharing",
+  "FAIR Data and Materials",
+  "Qualitative Research",
+]
+
+# How the sheet's free-text values become the directory's filters. Values are compared in lower
+# case. A material type listed nowhere shows as "Other", so a new value cannot lose a resource.
+[[type_groups]]
+  label = "Reading"
+  values = ["reading", "paper", "primary source", "article", "blog", "chapter", "textbook", "book", "online book", "primer", "summaries", "glossary", "handbook"]
+[[type_groups]]
+  label = "Student guide"
+  values = ["student guide", "library guide", "guide", "tutorial", "data repository guide"]
+[[type_groups]]
+  label = "Teaching strategy"
+  values = ["teaching/learning strategy", "teaching guide"]
+[[type_groups]]
+  label = "Syllabus"
+  values = ["syllabus", "syllabi"]
+[[type_groups]]
+  label = "Full course"
+  values = ["full course", "unit of study"]
+[[type_groups]]
+  label = "Module"
+  values = ["module", "collection of training modules", "training"]
+[[type_groups]]
+  label = "Lesson"
+  values = ["lesson", "lesson plan"]
+[[type_groups]]
+  label = "Lecture"
+  values = ["lecture", "lecture notes", "lecture slides", "slides", "presentation slides"]
+[[type_groups]]
+  label = "Video"
+  values = ["video", "videos", "seminar recording", "interview"]
+[[type_groups]]
+  label = "Podcast"
+  values = ["podcast", "podcast and transcript", "podcast episodes"]
+[[type_groups]]
+  label = "Activity"
+  values = ["activity/lab", "homework/assignment", "assessment", "case study", "game", "workshop", "workshop guide"]
+[[type_groups]]
+  label = "Interactive"
+  values = ["interactive", "simulation"]
+[[type_groups]]
+  label = "R code"
+  values = ["r code"]
+[[type_groups]]
+  label = "Data or tool"
+  values = ["data set", "public data file", "website", "tool", "github repository", "resource navigator", "infrastructure resource navigator", "search engine/resource navigation tool", "ai-search engine"]
+
+[[level_groups]]
+  label = "Undergraduate"
+  values = ["college / upper division (undergraduates)", "college/ upper division", "college / upper division", "community college / lower division"]
+[[level_groups]]
+  label = "Graduate / Professional"
+  values = ["graduate / professional", "graduate/professional"]
+[[level_groups]]
+  label = "Career / Technical"
+  values = ["career / technical", "career /technical"]
+[[level_groups]]
+  label = "Adult education"
+  values = ["adult education", "adult-education"]
+
++++
+
+FORRT's curated resources database now hosts over 1,400 open science materials, thanks to key partnerships. Initially boosted by over 60% by the [Open Science Knowledge Base](https://www.cos.io/communities/stem-education-hub) ([see also OSKB's OER commons page](https://oercommons.org/hubs/OSKB))—[a Center for Open Science (COS)](http://cos.io/) initiative. Later, our collection grew by about a quarter through contributions from [JUST-OS](https://www.just-os.org), increasing resources from 1,140 to 1,402. OSKB's work involved almost 300 hours (valued at €10,000) and JUST-OS’s work involved 150 hours (valued around €5,000), reflecting significant effort and dedication. COS, OSKB, JUST-OS and FORRT forged partnerships to promote open and reproducible research practices, enabling the scientific community to build upon each other’s work and advance knowledge collaboratively. Learn more about it FORRT’s and OSKB’s partnership [in the COS’s announcement](https://www.cos.io/blog/forrt-and-cos-join-forces-to-foster-open-and-reproducible-research-training).
diff --git a/content/resources/form.md b/content/resources/form.md
deleted file mode 100644
index 1f302558b94..00000000000
--- a/content/resources/form.md
+++ /dev/null
@@ -1,55 +0,0 @@
-+++
-# A Demo section created with the Blank widget.
-# Any elements can be added in the body: https://sourcethemes.com/academic/docs/writing-markdown-latex/
-# Add more sections by duplicating this file and customizing to your requirements.
-
-widget = "blank"  # See https://sourcethemes.com/academic/docs/page-builder/
-headless = true  # This file represents a page section.
-active = true  # Activate this widget? true/false
-weight = 20  # Order that this section will appear.
-
-title = "Missing a resource?"
-subtitle = "Fill out the form below or here is [the direct link](https://docs.google.com/forms/d/e/1FAIpQLSfPceN5opEeauCBSvapoB-ADpH0IoT24XOLfQGaVEF0EJGFOA/viewform) to open the Google form in a new window"
-
-[design]
-  # Choose how many columns the section has. Valid values: 1 or 2.
-  columns = "1"
-
-[design.background]
-  # Apply a background color, gradient, or image.
-  #   Uncomment (by removing `#`) an option to apply it.
-  #   Choose a light or dark text color by setting `text_color_light`.
-  #   Any HTML color name or Hex value is valid.
-
-  # Background color.
-  color = "#fff"
-  # color = "#69b3a2" # greenish
-  
-  # Background gradient.
-  # gradient_start = "DeepSkyBlue"
-  # gradient_end = "SkyBlue"
-  
-  # Background image.
-  # image = "headers/bubbles-wide.webp"  # Name of image in `static/img/`.
-  # image_darken = 0.6  # Darken the image? Range 0-1 where 0 is transparent and 1 is opaque.
-  # image_size = "cover"  #  Options are `cover` (default), `contain`, or `actual` size.
-  # image_position = "center"  # Options include `left`, `center` (default), or `right`.
-  # image_parallax = true  # Use a fun parallax-like fixed background effect? true/false
-
-  # Text color (true=light or false=dark).
-  text_color_light = false
-
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  padding = ["60px", "0", "60px", "0"]
-
-[advanced]
- # Custom CSS. 
- css_style = "font-size: 1.25rem;"
- 
- # CSS class.
- css_class = "text-center"
-+++
-
-
-{{< gform src="1FAIpQLSfPceN5opEeauCBSvapoB-ADpH0IoT24XOLfQGaVEF0EJGFOA" width="100%" height="1600px" alt="Loading..." >}}
\ No newline at end of file
diff --git a/content/resources/index.md b/content/resources/index.md
deleted file mode 100644
index 9c08dc4899b..00000000000
--- a/content/resources/index.md
+++ /dev/null
@@ -1,7 +0,0 @@
-+++
-# FORRT page
-type = "widget_page"
-headless = false  # Homepage is headless, other widget pages are not.
-title = "Resources"
-
-+++
diff --git a/content/resources/resources.md b/content/resources/resources.md
deleted file mode 100644
index 17622476bc6..00000000000
--- a/content/resources/resources.md
+++ /dev/null
@@ -1,48 +0,0 @@
----
-widget: resource
-headless: true
-active: true
-weight: 20
-title: Curated resources
-subtitle: ""
-content:
-  page_type: curated_resources
-  filter_default: 0
-  filter_button:
-    - name: All
-      FORRT_clusters: "*"
-    - name: Reproducible Analyses
-      FORRT_clusters: reproducible-analyses
-    - name: Open Data and Materials
-      FORRT_clusters: open-data-and-materials
-    - name: Reproducibility and Replicability Knowledge
-      FORRT_clusters: reproducibility-and-replicability-knowledge
-    - name: Replication Research
-      FORRT_clusters: replication-research
-    - name: Conceptual and Statistical Knowledge
-      FORRT_clusters: conceptual-and-statistical-knowledge
-    - name: Preregistration
-      FORRT_clusters: preregistration
-design:
-  columns: "1"
-  view: 3
-  flip_alt_rows: true
-  background: {}
-advanced:
-  css_style: ""
-  css_class: ""
----
-
-FORRT's curated resources database now hosts over ***1,400*** open science materials below, thanks to key partnerships. Initially boosted by over 60% by the [Open Science Knowledge Base](https://www.cos.io/communities/stem-education-hub) ([see also OSKB's OER commons page](https://oercommons.org/hubs/OSKB))—[a Center for Open Science (COS)](http://cos.io/) initiative. Recently, our collection recently grew by 30% through contributions from [JUST-OS](https://www.just-os.org), increasing resources from 1,140 to 1,402. OSKB's work involved almost 300 hours (valued at €10,000) and JUST-OS’s work involved 150 hours (valued around €5,000), reflecting significant effort and dedication. COS, OSKB, JUST-OS and FORRT forged partnerships to promote open and reproducible research practices, enabling the scientific community to build upon each other’s work and advance knowledge collaboratively. Learn more about it FORRT’s and OSKB’s partnership [in the COS’s announcement](https://www.cos.io/blog/forrt-and-cos-join-forces-to-foster-open-and-reproducible-research-training).
-
-### ***Contribute***
-
-If you notice there is an educational resource, research article or pedagogical tool missing in our database, please consider adding it [below in our on submission form](https://forrt.org/resources/#form) or directly into [a separate g-forms](https://docs.google.com/forms/d/e/1FAIpQLSfPceN5opEeauCBSvapoB-ADpH0IoT24XOLfQGaVEF0EJGFOA/viewform).
-
-## FORRT's Curated Resources 
-
-<br>
-
-***
-
-{{< staticsearch >}}
diff --git a/content/reversals/reversals.md b/content/reversals/reversals.md
index e302c753b10..100a861d1a1 100644
--- a/content/reversals/reversals.md
+++ b/content/reversals/reversals.md
@@ -51,29 +51,34 @@ subtitle = ""
  css_class = ""
 +++
 
-<br>
+{{% alert note %}}
+
+**This project has concluded.** Its work continues in the [FORRT Replication Hub](/replication-hub/), and its outcomes are described in the preprint [Tracking and Mainstreaming Replications in the Social, Cognitive, and Behavioral Sciences](https://osf.io/preprints/metaarxiv/ad2w6_v1). The effects below were crowdsourced and not consistently validated, so check specific claims before relying on them, and please [report errors](https://github.com/forrtproject/forrtproject.github.io/issues/612).
+
+<a class="btn btn-primary" href="/annotator/">Find more replications in FLoRA</a>
+
+{{% /alert %}}
 
 ## **Summary**
 
 <br>
 
-Replications of previous scientific work are at the core of the Open Scholarship movement. However, as replication efforts become more widespread, it can be challenging to scholars and educators to keep themselves up to date with which effects in their field replicate and which do not. FORRT’s replications and reversals aims to collate replications and specifically so-called reversal effects in social science. Reversals are—in the context of a replication—effects that have their original direction flipped. The extent of such reversals and non-replicated effects is already apparent in the social science literature, with even replicated effects being only half of the originally reported effect (Ioannidis, 2005; Open Science Collaboration, 2015). Although such failures to replicate are far less costly to society than for example medical ones (Prasad & Cifu, 2011), they broadly hinder science's goal of accumulating knowledge and contribute to waste of scarce resources. This resource aims to be a “living”, freely available, crowd-sourced, and community-driven collection of effects that have either not been replicated or even reversed through empirical research across social sciences. Scholars from varied backgrounds and areas of social science are invited to contribute with prevalent effects in their respective fields.
+FORRT's Replications and Reversals project collected replications of effects in the social sciences, especially reversals: effects whose direction flipped when they were replicated. It was a crowd-sourced, community-driven collection to help scholars and educators keep up with which effects in their field replicate and which do not.
+
 
 <br>
 
-{{% alert note %}}
+### **How to cite**
 
-Data for this project were crowdsourced and not yet consistently validated. Researchers who contributed to this project did so voluntarily and are listed at <a href="http://forrt.org/contributors">forrt.org/contributors</a>. This page can give a good orientation regarding the state of evidence regarding various claims, but you should check specific claims before you rely on them.
+Please cite this source as Hartmann H, Azevedo F, Röseler L, Wallrich L, Aldoh A, Elsherif MM, et al. Tracking and mainstreaming replications in the social, cognitive, and behavioral sciences. MetaArXiv. https://doi.org/10.31222/osf.io/ad2w6_v1. Contributors are listed at [forrt.org/contributors](/contributors/).
 
-Please report errors you spot <a href="https://github.com/forrtproject/forrtproject.github.io/issues/612">here</a>. If you need validated data on replications, we would encourage you to use the FORRT Replication Database (<a href="https://forrt.org/explorer">FReD</a>, with effect sizes) or the more comprehensive FORRT Library of Reproduction and Replication Attempts (<a href="https://forrt.org/annotator">FLoRA</a>).
+<br>
 
-Please cite this source as Hartmann H, Azevedo F, Röseler L, Wallrich L, Aldoh A, Elsherif MM, et al. Tracking and mainstreaming replications in the social, cognitive, and behavioral sciences. MetaArXiv. https://doi.org/10.31222/osf.io/ad2w6_v1
+{{< spoiler text="About this project: motivation, history and how to contribute" >}}
 
-{{% /alert %}}
 
-<br>
 
-## **Motivation**
+### **Motivation**
 
 The purpose of collating these reversal effects in social science is to encourage educators to incorporate replications of these effects into their students' project (e.g., third-year, thesis, course work) to provide them the opportunity to experience the research process directly, assess their ability to perform and report scientific research, and to help evaluate the robustness of the original study, thereby also helping them become good consumers of research. The below crowdsourced and community-curated resource aims to satisfy three of [FORRT’s Goals](https://forrt.org/about/mission/):
 
@@ -90,9 +95,7 @@ and four of [FORRT’s Mission](https://forrt.org/about/mission/):
 
 <br>
 
-## **Current Status**
-
-**This project has now concluded** and has been succeeded by multiple projects within the [FORRT Replication Hub](https://forrt.org/replication-hub/). The outcomes and framework of this initiative are discussed in our recent preprint: [Tracking and Mainstreaming Replications in the Social, Cognitive, and Behavioral Sciences](https://osf.io/preprints/metaarxiv/ad2w6_v1).
+### **Current Status**
 
 The original project was organized in five stages: 
 
@@ -106,69 +109,29 @@ The original project was organized in five stages:
 
 - [x] **Update Phases** (dynamically adding new effects). Now continued through the Replication Hub projects.
 
-{{% alert example %}}
+### **Recognition**
 
- {{< hl >}}We were shortlisted for the **Einstein Foundations Award or Promoting Quality in Research 2023** in the category Early Career Award! Check out our project "Tracking and Mainstreaming Replications across the Social, Behavioral and Cognitive Sciences" [here](https://web.archive.org/web/20231204000615/https://www.einsteinfoundation.de/en/award/events/meet-the-finalists/)!{{< /hl >}}
-
- {{% /alert %}}
-
-{{% alert example %}}
-
- {{< hl >}}We received the **Open Science Fund 2023** from the Dutch Research Foundation (NWO)! Check out our project "Tracking and Mainstreaming Replications across the Social, Behavioral and Cognitive Sciences" [here](https://www.nwo.nl/en/researchprogrammes/open-science/open-science-fund/open-science-fund-2023-awarded-grants)!{{< /hl >}}
-
- {{% /alert %}}
-
- {{% alert example %}}
-
- {{< hl >}}We got a **SIPS 2023 commendation** from the Society for the Improvement of Psychological Science! Check out the [awards page](https://improvingpsych.org/mission/awards/) for the other commendations!{{< /hl >}}
-
- {{% /alert %}}
+- Shortlisted for the **Einstein Foundation Award for Promoting Quality in Research 2023**, Early Career Award ([finalists](https://web.archive.org/web/20231204000615/https://www.einsteinfoundation.de/en/award/events/meet-the-finalists/))
+- **Open Science Fund 2023** from the Dutch Research Council, NWO ([awarded grants](https://www.nwo.nl/en/researchprogrammes/open-science/open-science-fund/open-science-fund-2023-awarded-grants))
+- **SIPS 2023 commendation** from the Society for the Improvement of Psychological Science ([awards page](https://improvingpsych.org/mission/awards/))
 
 <br>
 
-## **How to contribute?**
+### **How to contribute?**
 
-This specific reversals project has concluded, and its work has been integrated into the broader [FORRT Replication Hub](https://forrt.org/replication-hub/). To contribute replication data, please submit new entries to the [FORRT Replication Database (FReD)](https://forrt.org/replication-hub/fred/) or contact Lukas Röseler at lukas.roeseler@uni-muenster.de for any questions.
+This specific reversals project has concluded, and its work has been integrated into the broader [FORRT Replication Hub](https://forrt.org/replication-hub/). To contribute replication data, please submit new entries through the [Replication Hub](/replication-hub/submit/) or contact Lukas Röseler at lukas.roeseler@uni-muenster.de for any questions.
 
 All **past or current project contributors** are listed at the [bottom of this page](#contributors).
 
 <br><br>
 
----------------
-# **All Effects** (*sorted by discipline*)
----------------
+{{< /spoiler >}}
 
-You can find a list of all effects we are working on [here](https://docs.google.com/spreadsheets/d/1IY56xdDmoU9VasdE0sry2xvsGFkWPrqbKXAs1Rw-9LA/edit#gid=0). To search whether an effect already exists in our collection, use Ctrl-F or the search function together with a keyword in relation to the effect (e.g. "Macbeth" or "Priming"). Please note that not all effects in the spreadsheet are listed below, as this is a work in progress (last site update: 13th of July 2023)
+---------------
 
-<br>
+{{< list_filter label="Search the effects" placeholder="e.g. priming, Bargh, ego depletion" noun="effects" >}}
 
-## **Table of Contents**
-
-<!-- MarkdownTOC depth=4 -->
-
-- [Social Psychology](#social-psychology)
-- [Positive Psychology](#positive-psychology)
-- [Cognitive Psychology](#cognitive-psychology)
-- [Developmental Psychology](#developmental-psychology)
-- [Differential Psychology](#differential-psychology)
-- [Judgment and Decision Making / Behavioral Economics](#judgment-and-decision-making)
-- [Marketing](#marketing)
-- [Neuroscience (humans)](#neuroscience-humans)
-- [Psychiatry / Mental Health](#psychiatry)
-- [Parapsychology](#parapsychology)
-- [Evolutionary Psychology](#evolutionary-psychology)
-- [Psychophysiology](#psychophysiology)<!-- - - [Behavioral Genetics](#behavioral-genetics)-->
-- [Applied Linguistics](#applied-linguistics)
-- [Educational Psychology](#educational-psychology)
-- [Health Psychology](#health-psychology)
-- [Political Psychology](#political-psychology) <!-- - [Comparative Psychology](#comparative-psychology)-->
-- [Evolutionary Linguistics](#evolutionary-linguistics)
-- [Speech Language Therapy](#speech-language-therapy)
-- [Experimental Philosophy](#experimental-philosophy)
-- [Further Literature](#further-literature)
-- [Contributors](#contributors)
-
-<!-- /MarkdownTOC -->
+The full list of effects is in [this spreadsheet](https://docs.google.com/spreadsheets/d/1IY56xdDmoU9VasdE0sry2xvsGFkWPrqbKXAs1Rw-9LA/edit#gid=0); not all of them are shown below (last updated 13 July 2023).
 
 <br>
 
@@ -250,7 +213,7 @@ You can find a list of all effects we are working on [here](https://docs.google.
 {{< spoiler text="Statistics" >}}    
 * Status: not replicated
 * Original paper: '[Mere exposure to money increases endorsement of free-market systems and social inequality](https://www.ncbi.nlm.nih.gov/pubmed/22774789)', Caruso 2013; experimental design, n between 30 and 168 [(citations~161 (GS, November 2021)].
-* Critiques: [Rohrer 2015](http://uweb.cas.usf.edu/~drohrer/pdfs/Rohrer_et_al_2015JEPG.pdf) [n=136, citations = 82 (GS, November 2021)]. Meta-analysis: [Lodder 2019](https://osf.io/3sh5a/) [_k_=246, citations = 64 (GS, November 2021)].
+* Critiques: [Rohrer 2015](https://doi.org/10.1037/xge0000058) [n=136, citations = 82 (GS, November 2021)]. Meta-analysis: [Lodder 2019](https://osf.io/3sh5a/) [_k_=246, citations = 64 (GS, November 2021)].
 * Original effect size: system justification _d _= 0.8, just world _d _= 0.44, dominance _d _= 0.51, fair market ideology: not reported, _d_ = 0.70 [obtained from Rohrer's 2015 Experiment 4 results section].
 * Replication effect size: Rohrer et al. (Experiment 1): _d_ = 0.07 [0.41, 0.27] for system justification, _d_ = 0.06 [-0.14, 0.25] for belief in a just world, _d_  = -0.06 for social dominance, social dominance: _d_ = 0.06 [0.37, 0.26], fair market ideology, _d_ = 0.14 [-0.23, 0.50]. For 47 preregistered experiments in Lodder: _g_ = 0.01 [-0.03, 0.05] for system justification, _g_ = 0.11 [-0.08, 0.3] for belief in a just world, _g_ = 0.07 [-0.02, 0.15] for fair market ideology.
 {{< /spoiler >}}
@@ -426,7 +389,7 @@ You can find a list of all effects we are working on [here](https://docs.google.
 * Replication effect size: Various sources (Burger, Perry, Branningan, Griggs, Caspar): Experiment included many** **researcher degrees of freedom, going off-script, implausible agreement between very different treatments, and “only half of the people who undertook the experiment fully believed it was real and of those, 66% disobeyed the experimenter.”. Doliński et al.: comparable effects to Milgram. Burger: similar levels of compliance to Milgram, but the level didn't scale with the strength of the experimenter prods. Blass: average compliance of 63%, but suffer from the usual publication bias and tiny samples. (Selection was by a student of Milgram.) The most you can say is that there's weak evidence for compliance, rather than obedience. ("Milgram's interpretation of his findings has been largely rejected.").
 {{< /spoiler >}}
 
-* **Robbers Cave Study**. Utilized arbitrary groupings to demonstrate that tribalism between groups arises spontaneously, and depending on the context, it can result in group competition (e.g., in case of scarce resources) or group cooperation (e.g., in case of superordinate goals and common obstacles)**. **
+* **Robbers Cave Study**. Utilized arbitrary groupings to demonstrate that tribalism between groups arises spontaneously, and depending on the context, it can result in group competition (e.g., in case of scarce resources) or group cooperation (e.g., in case of superordinate goals and common obstacles).
 {{< spoiler text="Statistics" >}}
 * Status: NA
 * Original paper: '[Superordinate Goals in the Reduction of Intergroup Conflict](https://doi.org/10.1086/222258)', Sherif 1958; field experiment, n=22. [citations= 1,010(GS, February, 2022)]. In addition to the original paper, some related books from the author(s) are also highly cited including: '[Groups in harmony and tension](https://psycnet.apa.org/record/1954-02446-000)', Sherif & Sherif 1958 [citations=2,280 (GS, February, 2022)] and ‘[Intergroup Conflict and Co-operation](https://books.google.co.uk/books?hl=en&lr=&id=24TwCQAAQBAJ&oi=fnd&pg=PP1&dq=Group+Conflict+and+Co-operation+&ots=ufwdngs5bi&sig=qxT2o26vEi7KdeJxWNqfSYHdaSM&redir_esc=y#v=onepage&q=Group%20Conflict%20and%20Co-operation&f=false)', Sherif et al. 1961 [citations= 253, (GS, February, 2022)]. Overall, the effect accounts to more than 4000 total citations including the [SciAm piece](https://doi.org/10.1038/scientificamerican1156-54).
@@ -1995,7 +1958,7 @@ You can find a list of all effects we are working on [here](https://docs.google.
 {{< spoiler text="Statistics" >}}
 * Status: replicated 
 * Original paper: ‘[You that read wrong again! A transposed-word effect in grammaticality judgments](https://doi.org/10.1177/0956797618806296)’, Mirault et al. 2018; two experiments, laboratory: n = 57, online: n = 94. [citation=47(GS, November 2022)]​.
-* Critiques:  [Huang and Staub 2022](https://doi.org/10.3758/s13423-022-02150-9) [Experiment 1: n = 49, Experiment 2: n = 51, citations=0(GS, November 2022)]. [Liu et al. 2020 ](https://doi.org/10.3758/s13414-020-02114-y)[Experiment 1: n = 63, Experiment 2: n = 69,  Experiment 3: n = 63, citations=5(GS, November 2022)]. [Liu et al. 2021 ](https://doi.org/10.1016/j.actpsy.2021.103272)[Experiment 1: n = 60, Experiment 2: n = 32, citations=4(GS, November 2022)].[ Liu et al. 2022](https://doi.org/10.1016/j.cognition.2021.104922) [n = 112, citations=2(GS, November 2022)]. [Mirault et al. 2020 ](https://doi.org/10.1016/j.metip.2020.100029)[n = 112, citations=13(GS, November 2022)]. [Mirault et al. 2022](https://doi.org/10.3758/s13414-021-02421-y) [Experiment 1: n = 60, Experiment 2: n = 32, citations=4(GS, November 2022)]. [Pegado and Grainger 2019a ](https://doi.org/10.1016/j.actpsy.2019.102943)[n = 28, citations=11(GS, November 2022)]. [Pegado and Grainger 2019b](https://psycnet.apa.org/fulltext/2019-68134-001.pdf) [Experiment 1: n = 28, Experiment 2: n = 28, citations=13(GS, November 2022)]. [Pegado and Grainger 2021](https://doi.org/10.3758/s13423-020-01819-3) [n = 28, citations=6(GS, November 2022)]. [Pegado et al. 2021](https://www.researchgate.net/publication/346130946_On_the_noisy_spatiotopic_encoding_of_word_positions_during_reading_Evidence_from_the_change-detection_task) [n = 31, citations=2(GS, November 2022)]. [Snell and Grainger 2019](https://hal.archives-ouvertes.fr/hal-02448204/document) [n = 24, citations=21(GS, November 2022)]. [Wen et al. 2021a ](https://doi.org/10.1080/23273798.2021.1880608)[n = 40, citations=3(GS, November 2022)]. [Wen et al. 2021b ](https://www.researchgate.net/publication/338782241_Fast_Syntax_in_the_Brain_Electrophysiological_Evidence_from_the_Rapid_Parallel_Visual_Presentation_Paradigm_RPVP)[experiment 2: n = 26, citations=10(GS, November 2022)][. Wen et al. 2022](https://doi.org/10.1080/23273798.2021.1880608) [n = 124, citations=0(GS, November 2022)].
+* Critiques:  [Huang and Staub 2022](https://doi.org/10.3758/s13423-022-02150-9) [Experiment 1: n = 49, Experiment 2: n = 51, citations=0(GS, November 2022)]. [Liu et al. 2020 ](https://doi.org/10.3758/s13414-020-02114-y)[Experiment 1: n = 63, Experiment 2: n = 69,  Experiment 3: n = 63, citations=5(GS, November 2022)]. [Liu et al. 2021 ](https://doi.org/10.1016/j.actpsy.2021.103272)[Experiment 1: n = 60, Experiment 2: n = 32, citations=4(GS, November 2022)].[ Liu et al. 2022](https://doi.org/10.1016/j.cognition.2021.104922) [n = 112, citations=2(GS, November 2022)]. [Mirault et al. 2020 ](https://doi.org/10.1016/j.metip.2020.100029)[n = 112, citations=13(GS, November 2022)]. [Mirault et al. 2022](https://doi.org/10.3758/s13414-021-02421-y) [Experiment 1: n = 60, Experiment 2: n = 32, citations=4(GS, November 2022)]. [Pegado and Grainger 2019a ](https://doi.org/10.1016/j.actpsy.2019.102943)[n = 28, citations=11(GS, November 2022)]. [Pegado and Grainger 2019b](https://doi.org/10.1037/xlm0000776) [Experiment 1: n = 28, Experiment 2: n = 28, citations=13(GS, November 2022)]. [Pegado and Grainger 2021](https://doi.org/10.3758/s13423-020-01819-3) [n = 28, citations=6(GS, November 2022)]. [Pegado et al. 2021](https://www.researchgate.net/publication/346130946_On_the_noisy_spatiotopic_encoding_of_word_positions_during_reading_Evidence_from_the_change-detection_task) [n = 31, citations=2(GS, November 2022)]. [Snell and Grainger 2019](https://hal.archives-ouvertes.fr/hal-02448204/document) [n = 24, citations=21(GS, November 2022)]. [Wen et al. 2021a ](https://doi.org/10.1080/23273798.2021.1880608)[n = 40, citations=3(GS, November 2022)]. [Wen et al. 2021b ](https://www.researchgate.net/publication/338782241_Fast_Syntax_in_the_Brain_Electrophysiological_Evidence_from_the_Rapid_Parallel_Visual_Presentation_Paradigm_RPVP)[experiment 2: n = 26, citations=10(GS, November 2022)][. Wen et al. 2022](https://doi.org/10.1080/23273798.2021.1880608) [n = 124, citations=0(GS, November 2022)].
 * Original effect size: laboratory: _d_ = 1.86, online: _d_ = 1.58.
 * Replication effect size: Huang and Staub: Experiment 1: _d_ = 1.27  [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared), Experiment 2: _d_ = 0.97 [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared). Liu et al.: Experiment 1: _d_ = 1.37 [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared), Experiment 2: _d_ = 1.37 [calculated using this conversion from t to Cohen’s d,](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared) Experiment 3: _d_ = 1.26 [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared). Liu et al.: Experiment 1: _d_= 2.40 [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared), Experiment 2: _d_ = 1.69 [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared). Liu et al.: serial visual presentation: _d_ = 1.02 [calculated using this conversion from t to Cohen’s d,](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared)parallel visual presentation: _d_ = ​2.00 [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared). Mirault et al.: _d_ = 0.52 [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared). Mirault et al.: Experiment 1: _d_ = 0.40 [calculated using this conversion from t to Cohen’s d; ](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared)Experiment 2: _d_ = 0.88. Pegado and Grainger: _d_ = 0.73 [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared). Pegado and Grainger: Experiment 1: _d_ = 2.97 [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared), Experiment 2: _d_ = 0.78 [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared). Pegado and Grainger: _d_ =1.40. Pegado et al.: _d_ = 2.08 [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared). Snell and Grainger: _d_ = 1.58 [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared). Wen et al.: _d_ = 0.64 [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared). Wen et al.: Experiment 2: _d_ = 1.62 [calculated using this conversion from t to Cohen’s d. ](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared)Wen et al.: _d_ = 0.32 [calculated using this conversion from t to Cohen’s d](https://haiyangjin.github.io/2020/05/eta2d/#conversion-between-cohens-d-and-partial-eta-squared).
 {{< /spoiler >}}
diff --git a/content/submit/index.md b/content/submit/index.md
new file mode 100644
index 00000000000..cf09602978d
--- /dev/null
+++ b/content/submit/index.md
@@ -0,0 +1,20 @@
+---
+title: "Submit to FORRT"
+crumb_parent: "About FORRT"
+type: plain_page
+url: "/submit/"
+subtitle: "Add your work to FORRT's collections. Each kind of submission has its own form."
+summary: "Ways to add your work to FORRT: teaching resources, replication studies, games, discipline resources and glossary suggestions, each with its own form."
+hide_date: true
+---
+
+{{< action_cards >}}
+A teaching resource | A reading, lesson, course, video or tool for the curated resources | https://docs.google.com/forms/d/e/1FAIpQLSfPceN5opEeauCBSvapoB-ADpH0IoT24XOLfQGaVEF0EJGFOA/viewform
+A replication | A replication or reproduction study for FLoRA, the FORRT Library of Reproduction and Replication Attempts | /replication-hub/submit/
+A game | An open-science game the Games Portal is missing | https://forms.gle/PXYBrRhXGiZyi8M99
+Discipline resources | Resources for a discipline's open-scholarship page, or a correction | https://docs.google.com/forms/d/e/1FAIpQLSfs-BCYWGet5QNZAWQ8IQVZ05TAUUwvD4mkc31Ehrm5tK8q3Q/viewform
+A glossary suggestion | Use "Suggest an improvement" at the foot of any glossary term | /glossary/
+Anything else | Feedback, ideas or corrections for the website | /feedback/
+{{< /action_cards >}}
+
+To help with FORRT's projects rather than submit a single item, see [Get Involved](/about/get-involved/).
diff --git a/content/summaries/_index.md b/content/summaries/_index.md
index 5b76ec090f7..db76556dc6d 100644
--- a/content/summaries/_index.md
+++ b/content/summaries/_index.md
@@ -21,21 +21,19 @@ menu:
     weight: 1
 ---
 
-# *100+ Summaries of Open and Reproducible Science Literature*
-
 ## Overview
 
 The FORRT community has prepared 100+ summaries of Open and Reproducible Science literature. The purpose of these summaries is to reduce some of the burden on educators looking to incorporate open and reproducible research principles into their teaching as well as facilitate the edification of anyone wishing to learn or disseminate open and reproducible science tenets.
 
 ***These summaries are very much a work in progress***. We would love to receive your [criticism, areas for improvement, ideas, and help](https://docs.google.com/spreadsheets/d/1W12WpzI70Ja1FiVeflXNW8VFPzqFFvu_mL2YkNQ_cHk/edit?usp=sharing). 
 
-You can find the summaries via the menu in the left. We made a distinction between "[Open and Reproducible Science](/summaries/open-reproducible/)" summaries and "[Diversity, Equity, & Inclusion](/dei)" summaries to highlight that the topics of social injustices and DEI (diversity, equity and inclusion) are often neglected in academia, and in open and reproducible science literature. If you are an educator, you may also be interested in our [FORRT Syllabus on Open and Reproducible Science (.pdf & G-doc)](https://forrt.org/syllabus), which is based on [FORRT Clusters.](/clusters/)
+We made a distinction between "[Open and Reproducible Science](/summaries/open-reproducible/)" summaries and "[Diversity, Equity, & Inclusion](/dei)" summaries to highlight that the topics of social injustices and DEI (diversity, equity and inclusion) are often neglected in academia, and in open and reproducible science literature. If you are an educator, you may also be interested in our [FORRT Syllabus on Open and Reproducible Science (.pdf & G-doc)](https://forrt.org/syllabus), which is based on [FORRT Clusters.](/clusters/)
 
 ### Why make these summaries?
 
-The FORRT's summaries is community-curated resource aims to satisfy three of [FORRT’s Goals](/about/mission/): 
+FORRT’s summaries are a community-curated resource that aims to satisfy three of [FORRT’s Goals](/about/mission/): 
 *   Support scholars in their efforts to learn and stay up-to-date on best practices regarding open and reproducible research;
-*   Facilitating conversations about the ethics and social impact of teaching substantive topics with due regard to scientific openness, epistemic uncertainty and the credibility revolution;
+*   Facilitating conversations about the ethics and social impact of teaching substantive topics with due regard to scientific openness, epistemic uncertainty and the {{< term "Credibility revolution" "credibility revolution" >}};
 *   Foster social justice through the democratization of scientific educational resources and its pedagogies.
 
 and four of [FORRT’s Mission](/about/mission/):
@@ -47,9 +45,9 @@ and four of [FORRT’s Mission](/about/mission/):
 
 ### Future plans
 
-Our community will continue to curate and expand on these summaries. Our goal is to keep integrating community feedback and its multitude of perspectives hoping to produce ever more useful summaries. We also would like community feedback on how to best classify the summaries into useful and didactic categories and distill its knowledge (at this stage, we also intend to making the methodology used transparent). 
+Our community will continue to curate and expand on these summaries. Our goal is to keep integrating community feedback and its multitude of perspectives hoping to produce ever more useful summaries. We also would like community feedback on how to best classify the summaries into useful and didactic categories and distill its knowledge (at this stage, we also intend to make the methodology used transparent). 
 
-One idea to achieve these goals would be to plan a hackaton to make these summaries better to the community. Perhaps Open and Reproducible Science organizations (e.g., [International Network of Open Science & Scholarship Communities (INOSC)](https://osf.io/vz2sy/): OSCU, OSCNL, OSCA, OSCN, OSCR, OSC/e, OSCT, OSCG but also national organizations UKRN and NOSI) could help us in this process.
+One idea to achieve these goals would be to plan a hackathon to make these summaries more useful to the community. Perhaps Open and Reproducible Science organizations (e.g., [International Network of Open Science & Scholarship Communities (INOSC)](https://osf.io/vz2sy/): OSCU, OSCNL, OSCA, OSCN, OSCR, OSC/e, OSCT, OSCG but also national organizations UKRN and NOSI) could help us in this process.
 
 We also aim to further integrate this initiative with other FORRT initiatives. First, we want to make sure that all open and reproducible sources cited in the [FORRT’s Manuscript](https://forrt.org/manuscript/) have an associated summary to facilitate the reading of FORRT’s manifesto. Finally, we also hope to include each summary as a resource in [FORRT’s curated list of resources](https://forrt.org/resources/), as well include [FORRT Clusters’](/clusters/) tags for each summary. Not yet at a 'plans' stage, but we are considering formalizing this initiative with the drafting of a manuscript, summarizing lessons we learned and hopefully making it a more useful resource to the community.
 
diff --git a/content/syllabus/form-syllabus.md b/content/syllabus/form-syllabus.md
deleted file mode 100644
index e58907fdb2e..00000000000
--- a/content/syllabus/form-syllabus.md
+++ /dev/null
@@ -1,56 +0,0 @@
-+++
-# A Demo section created with the Blank widget.
-# Any elements can be added in the body: https://sourcethemes.com/academic/docs/writing-markdown-latex/
-# Add more sections by duplicating this file and customizing to your requirements.
-
-widget = "blank"  # See https://sourcethemes.com/academic/docs/page-builder/
-headless = true  # This file represents a page section.
-active = true  # Activate this widget? true/false
-weight = 60  # Order that this section will appear.
-
-title = "Add Open Scholarship Syllabi to FORRT's Collection"
-subtitle = "Fill out the form below or ***[open the Google form in a new window](https://docs.google.com/forms/d/e/1FAIpQLScEfLk9TWc_Wc8lQSuJcqWlmWVzLVmXzq8I2f2QTjhA3t12qw/viewform).***"
-
-[design]
-  # Choose how many columns the section has. Valid values: 1 or 2.
-  columns = "1"
-
-[design.background]
-  # Apply a background color, gradient, or image.
-  #   Uncomment (by removing `#`) an option to apply it.
-  #   Choose a light or dark text color by setting `text_color_light`.
-  #   Any HTML color name or Hex value is valid.
-
-  # Background color.
-  color = "#90add6"
-  # color = "#69b3a2" # greenish
-  
-  # Background gradient.
-  # gradient_start = "DeepSkyBlue"
-  # gradient_end = "SkyBlue"
-  
-  # Background image.
-  # image = "headers/bubbles-wide.webp"  # Name of image in `static/img/`.
-  # image_darken = 0.6  # Darken the image? Range 0-1 where 0 is transparent and 1 is opaque.
-  # image_size = "cover"  #  Options are `cover` (default), `contain`, or `actual` size.
-  # image_position = "center"  # Options include `left`, `center` (default), or `right`.
-  # image_parallax = true  # Use a fun parallax-like fixed background effect? true/false
-
-  # Text color (true=light or false=dark).
-  text_color_light = false
-
-[design.spacing]
-  # Customize the section spacing. Order is top, right, bottom, left.
-  padding = ["60px", "0", "60px", "0"]
-
-[advanced]
- # Custom CSS. 
- css_style = "font-size: 1.25rem;"
- 
- # CSS class.
- css_class = "text-center"
-+++
-
-
-{{< gform src="1FAIpQLScEfLk9TWc_Wc8lQSuJcqWlmWVzLVmXzq8I2f2QTjhA3t12qw" width="100%" height="500px" alt="Loading..." >}}
-
diff --git a/content/syllabus/syllabus.md b/content/syllabus/syllabus.md
index fc5e1cff40c..d6de5a27650 100644
--- a/content/syllabus/syllabus.md
+++ b/content/syllabus/syllabus.md
@@ -51,126 +51,138 @@ subtitle = ""
  css_class = ""
 +++
 
-<br>
-
 ## Motivation
----------------------
 
 To provide educators with an example of how they can draw resources from FORRT’s educational nexus to integrate open scholarship into their teaching, FORRT has developed an Open and Reproducible Science 101 syllabus. 
 
 FORRT’s syllabus was developed as a seminar series covering 9 weeks of teaching. In an attempt to be comprehensive of the open scholarship literature, the syllabus builds on [FORRT’s cluster framework](https://forrt.org/clusters). As such, the proposed topic for each week is one of FORRT’s clusters and its related literature. For each week, there are suggestions of core and additional readings. The syllabus is comprised of a series of assignments and proposed activities for students. 
 
-Importantly, this syllabus is not intended to be a “one size fits all” approach. While educators are welcomed to use this syllabus in its current format, they can also adapt it to meet their current courses and needs. We hope it can serve as starting point for your class.
+Importantly, this syllabus is not intended to be a “one size fits all” approach. While educators are welcome to use this syllabus in its current format, they can also adapt it to meet their current courses and needs. We hope it can serve as a starting point for your class.
 
-> ### ***FORRT's Open and Reproducible Science Syllabus***. 
-> * [editable G-doc/Word](https://docs.google.com/document/d/1pfFro5MbwBHzzXTeM_lE1gjFuq7AnnKWSDWkVwOBAtE/edit#)
+> ### FORRT's Open and Reproducible Science Syllabus
+> * [Open the syllabus (editable Google Doc or Word)](https://docs.google.com/document/d/1pfFro5MbwBHzzXTeM_lE1gjFuq7AnnKWSDWkVwOBAtE/edit#)
 
+## List of Open Science Syllabi
 
-<br>
+To further facilitate the creation, the updating, improvement, and maintenance of Open Science syllabi, we also curate a list of (possibly) useful other syllabi.
 
-### List of Open Science Syllabi
----------------------
+To suggest a syllabus for this list, email us at [info@forrt.org](mailto:info@forrt.org).
 
-To further facilitate the creation, the updating, improvement, and maintenance of Open Science syllabi, we also curate a list of (possibly) useful other syllabi.
+<div class="catalogue">
+
+<div class="catalogue-group">
+
+### Courses on open and reproducible science
 
-* [FORRT's Open and Reproducible Science Syllabus](https://forrt.org/syllabus)
-* [Diversifying Research Methods Syllabi](https://osf.io/y5gr9/)
 * [Overcoming the Knowledge Barrier in Open Science](https://osf.io/bk6r7/)
-* [Error Tight: Exercises for Lab Groups to Prevent Research Mistakes (for labs but also applicable for teaching/mentoring)](https://www.carleton.edu/perception-lab/open-science/error-tight/)
 * [Research Integrity and Open Science I (PSYC123)](https://osf.io/km34v/wiki/PSYC123-Research%20Integrity%20and%20Open%20Science%201/)
-* [Good Science, Bad Science](http://www.ejwagenmakers.com/GSBS/GSBS.html)
 * [Methods for Reliable, Transparent, and Open Science](https://github.com/rouderj/transparent-science-course)
 * [Research Transparency and Reproducibility: A Complementary Module for All](https://osf.io/qw52b/)
-* [Teaching Replication in Psychology: A Guide for Teachers and Students](https://osf.io/28r6g/)
 * [Credible Science Course](https://osf.io/78bhv/)
-* [Teaching and Mentoring Open Science Syllabus Module & Assignment Ideas](https://osf.io/3dp52) and [Mentoring Statement](https://osf.io/gqpc9)
-* [Teaching materials from the 4th Oxford|Berlin Summer School 2021](https://osf.io/8q59y)
-* [Statistical Methods in Psychological Research (PSYC 3400) at Crump's Lab](https://www.crumplab.com/psyc3400/Syllabus.html)
 * [Open Science Teaching by Sanjay Srivastava](https://osf.io/er7xk/)
-* [Project Tier](https://www.projecttier.org/tier-classroom/course-materials/#modal354)
-* [Teaching Replication in Social Sciences](https://osf.io/g3k5t/)
-* [Psychology as a Robust Science](https://osf.io/sxrkn/)
 * [Introduction to Open Science principles and practices (in Health Economics by Xavier Pouwels)](https://zenodo.org/record/8214973)
-* [Data Management Syllabus](https://docs.google.com/document/d/1z15bL9cP84re6d4zdkO60q06lnknnN3xEktN7GnLFFQ/edit)
-* [Improving your statistical inference](https://www.coursera.org/learn/statistical-inferences#syllabus)
-* [SIPS Teaching and Mentoring Open Science Syllabus](https://osf.io/3dp52/)
 * [Campbell Open and Reproducible Science Syllabus](https://osf.io/qbm89/)
 * [Open Science & Inclusive Psychology by Benjamin Le](https://docs.google.com/document/d/1ChsXW5XM1ySU7gG0CBXmRUL-TosWEK_T74QhaTGEH_I/edit)
 * [Open Science Capstone: Advanced General by Katie Corker](https://osf.io/24ws6)
-* [History and Methods of Psychology (PSY 8960-003) by Moin Syed](https://docs.google.com/document/d/1wLClx6QHbzh4LCjxM4RRWhLQMbjEtyA7vbGCRPpFuQQ/edit)
-* [Open Science Workshop Materials of the LMU Open Science Center](https://osf.io/zjrhu/)
 * [Open Science and Methodological Improvement](https://osf.io/jvsbg/)
-* [Contemporary Research in Personality | PSYC 5601 (emphasis on OS)](https://osf.io/3e2pg/)
-* [Winter 2020 Replicability syllabus](https://osf.io/xs89g/)
-* [Replicability syllabus](https://osf.io/staze/)
-* [Fall 2018 Replicability syllabus](https://osf.io/yj36v/)
 * [Course Syllabi for Open and Reproducible Methods by Simine Vazire (Winter 2015)](https://osf.io/rah35/)
-* [Course on Open Science and Research Data Management (Slides/Recordings by Elli Papadopoulou)](https://www.openaire.eu/component/zoo/item/chist-era-course-on-open-science-and-research-data-management)
 * [Rigorous & Reproducible Research Practices](https://osf.io/8bxau/)
 * [Open and reproducible science](https://osf.io/swcv2/)
+* [Open for Insight](https://osf.io/qstmv/)
+* [Improving (Our) Science](https://osf.io/rifzn/)
+* [Improving Science: Reproducibility, Reporting, and Openness](https://osf.io/bcdpv/)
+* [Economics 270D: Research Transparency Methods in the Social Sciences](https://osf.io/bt6j2/)
+* [Open Science & Inclusive Psychology](https://osf.io/sg9ej/)
+* [Open and Reproducible Science](https://osf.io/fuds5/)
+* [Open and Reproducible Research in Psychology (PSYC 726)](https://osf.io/zvfu4/)
+* [Key practices for language scientists](https://drive.google.com/file/d/1BxfgOabAq2QGZzWFhj9CcsNH8BYex0SV/view)
+* [Course Syllabi for Open and Reproducible Methods](https://osf.io/vkhbt/)
+* [Open Science Education Syllabus by Neasa Boyle, Eduarda Centeno, Jens Dierkes, Rachel Heyard, Joyce Kao, Harini Lakshminarayanan, Franz Pöschel and Heidi Seibold](https://sites.google.com/openscienceeducation.org/ose)
+* [UNESCO Recommendation on Open Science Syllabus by Jennifer Miller](https://en.m.wikiversity.org/wiki/UNESCO_Recommendation_on_Open_Science)
+* [Evaluating What Works by Dorothy Bishop and Paul Thompson](https://bookdown.org/dorothy_bishop/Evaluating_What_Works/)
+* [Open Science and Reproducible Research (Karolinska Institutet) by Gustav Nilsonne](https://osf.io/6q3dz/)
+
+</div>
+
+<div class="catalogue-group">
+
+### Replication and the credibility revolution
+
+* [Good Science, Bad Science](http://www.ejwagenmakers.com/GSBS/GSBS.html)
+* [Teaching Replication in Psychology: A Guide for Teachers and Students](https://osf.io/28r6g/)
+* [Teaching Replication in Social Sciences](https://osf.io/g3k5t/)
+* [Psychology as a Robust Science](https://osf.io/sxrkn/)
+* [Winter 2020 Replicability syllabus](https://osf.io/xs89g/)
+* [Replicability syllabus](https://osf.io/staze/)
+* [Fall 2018 Replicability syllabus](https://osf.io/yj36v/)
 * [Social Sciences Research Methods Centre Replication Workshop](https://osf.io/t2q78/)
-* [PSY 8960-006: History and Methods of Psychology](https://osf.io/r4w2q/)
 * [Psychology’s Credibility Revolution](https://osf.io/9v2sy/)
 * [Psych 593: Reproducibility in Psychology](https://osf.io/xpe6c/)
-* [Methodological Advances in Behavioral Research: Crowdsourcing Science](https://osf.io/78s5c/)
-* [How to do credible research with a high informational value (and how not to do it)](https://osf.io/9cd7h/)
-* [Procedimentos para investigação científica](https://osf.io/4gwd2/)
 * [When is science (un)reliable?](https://osf.io/9hytb/)
-* [Open for Insight](https://osf.io/qstmv/)
-* [Graduate Research Methods](https://osf.io/26c7f/)
-* [Improving (Our) Science](https://osf.io/rifzn/)
-* [Improving Science: Reproducibility, Reporting, and Openness](https://osf.io/bcdpv/)
 * [ReproducibiliTea 'Open Science' Introductory Reading List](https://osf.io/qxbcs)
-* [Economics 270D: Research Transparency Methods in the Social Sciences](https://osf.io/bt6j2/)
 * ["Collaborative book: Taking stock of the credibility revolution: Scientific reform 2011-2019"](https://docs.google.com/document/d/1DU4S9tliDXMlonSWpm_wnssZR8lSNIabM01kfeQM98k/edit)
-* [Open Science Talks and Workshops by Gilad Feldman (for reuse of Slides/Materials)](https://osf.io/df9tj/) and [Resources](https://mgto.org/open-science/)
+* [Reproducibility in the Psychological Sciences](https://osf.io/c6ve4/)
+* ["Repligate": Reliability and Reproducibility in Psychology](https://osf.io/ms7ix/)
+* [Teaching Replicable and Reproducible Science](https://osf.io/x7d45/)
+* [A reading list for the Replicability Crisis](http://crystalprisonzone.blogspot.com/2016/03/a-reading-list-for-replicability-crisis.html)
+* [Special Issue: Replication of Crises: Interdisciplinary Reflections on the Phenomenon of the Replication Crisis in Psychology](https://journals.sagepub.com/toc/RGP/current)
+* [Critical Metascience Articles by Mark Rubin](https://sites.google.com/site/markrubinsocialpsychresearch/replication-crisis/list-of-critical-metascience-articles)
+
+</div>
+
+<div class="catalogue-group">
+
+### Research methods and statistics courses
+
+* [Diversifying Research Methods Syllabi](https://osf.io/y5gr9/)
+* [Statistical Methods in Psychological Research (PSYC 3400) at Crump's Lab](https://www.crumplab.com/psyc3400/Syllabus.html)
+* [Improving your statistical inference](https://www.coursera.org/learn/statistical-inferences#syllabus)
+* [History and Methods of Psychology (PSY 8960-003) by Moin Syed](https://docs.google.com/document/d/1wLClx6QHbzh4LCjxM4RRWhLQMbjEtyA7vbGCRPpFuQQ/edit)
+* [Contemporary Research in Personality | PSYC 5601 (emphasis on OS)](https://osf.io/3e2pg/)
+* [PSY 8960-006: History and Methods of Psychology](https://osf.io/r4w2q/)
+* [Methodological Advances in Behavioral Research: Crowdsourcing Science](https://osf.io/78s5c/)
+* [How to do credible research with a high informational value (and how not to do it)](https://osf.io/9cd7h/)
+* [Graduate Research Methods](https://osf.io/26c7f/)
 * [Topics in Social Psychology and Personality](https://osf.io/8ecbz/)
 * [History and Philosophy of Psychology](https://osf.io/73zyu/)
-* [Open Science & Inclusive Psychology](https://osf.io/sg9ej/)
 * [Research Methods in Psychology 2020](https://osf.io/au735/)
 * [Research Methods in Psychology 2019](https://osf.io/3967b/)
 * [Quantitative Emerging Practices and Methods in Psychology](https://osf.io/k7bfc/)
 * [Perspectives on Improving Methods in Psychological Science](https://osf.io/87t4g/)
-* [Reproducibility in the Psychological Sciences](https://osf.io/c6ve4/)
-* ["Repligate": Reliability and Reproducibility in Psychology](https://osf.io/ms7ix/)
-* [(PT) Ciência aberta e reprodutível](https://osf.io/wmakh/)
-* [(PT) Boas práticas em ciência](https://osf.io/dwf3z/)
-* [(PT) Tópicos Especiais em Biotecnologia: Planejamento e Otimização de Experimentos](https://osf.io/qc2w4/)
 * [Emerging Scientific Research Practices](https://osf.io/m2uh7/)
-* [Capstone: Advanced General](https://osf.io/24ws6/)
 * [Research Methods in Social Psychology Winter 2019](https://osf.io/uv9x6/)
-* [Open and Reproducible Science](https://osf.io/fuds5/)
 * [Open Source Research Methods for the Social Sciences](https://canvas.pitt.edu/courses/124970)
 * [Research Methods in Social Psychology Fall 2015](https://osf.io/nxytf/)
-* [Open and Reproducible Research in Psychology (PSYC 726)](https://osf.io/zvfu4/)
 * [Economic Statistics with Calculus](https://osf.io/hurgd/)
 * [The General Linear Model: Semester 2](https://osf.io/gbfh7/)
-* [Key practices for language scientists](https://drive.google.com/file/d/1BxfgOabAq2QGZzWFhj9CcsNH8BYex0SV/view)
 * [Research Methods](https://online225.psych.wisc.edu/wp-content/uploads/225-Master/225-CourseMaterials/PSY-225_Gernsbacher_Syllabus_SU2021.pdf)
-* [Teaching Replicable and Reproducible Science](https://osf.io/x7d45/)
-* [Course Syllabi for Open and Reproducible Methods](https://osf.io/vkhbt/)
-* [Overcoming the Knowledge Barrier in Open Science](https://osf.io/bk6r7/)
-* [A reading list for the Replicability Crisis](http://crystalprisonzone.blogspot.com/2016/03/a-reading-list-for-replicability-crisis.html)
-* [Special Issue: Replication of Crises: Interdisciplinary Reflections on the Phenomenon of the Replication Crisis in Psychology](https://journals.sagepub.com/toc/RGP/current)
-* [Critical Metascience Articles by Mark Rubin](https://sites.google.com/site/markrubinsocialpsychresearch/replication-crisis/list-of-critical-metascience-articles)
-* [Open Science Education Syllabus by Neasa Boyle, Eduarda Centeno, Jens Dierkes, Rachel Heyard, Joyce Kao, Harini Lakshminarayanan, Franz Pöschel and Heidi Seibold](https://sites.google.com/openscienceeducation.org/ose)
-* [UNESCO Recommendation on Open Science Syllabus by Jennifer Miller](https://en.m.wikiversity.org/wiki/UNESCO_Recommendation_on_Open_Science)
-* [Evaluating What Works by Dorothy Bishop and Paul Thompson](https://bookdown.org/dorothy_bishop/Evaluating_What_Works/)
-* [Open Science and Reproducible Research (Karolinska Institutet) by Gustav Nilsonne](https://osf.io/6q3dz/)
 
-<br>
+</div>
 
-----
+<div class="catalogue-group">
 
-<br>
+### Modules, workshops and teaching materials
 
+* [Error Tight: Exercises for Lab Groups to Prevent Research Mistakes (for labs but also applicable for teaching/mentoring)](https://www.carleton.edu/perception-lab/open-science/error-tight/)
+* [SIPS Teaching and Mentoring Open Science Syllabus Module & Assignment Ideas](https://osf.io/3dp52) and [Mentoring Statement](https://osf.io/gqpc9)
+* [Teaching materials from the 4th Oxford|Berlin Summer School 2021](https://osf.io/8q59y)
+* [Project Tier](https://www.projecttier.org/tier-classroom/course-materials/#modal354)
+* [Data Management Syllabus](https://docs.google.com/document/d/1z15bL9cP84re6d4zdkO60q06lnknnN3xEktN7GnLFFQ/edit)
+* [Open Science Workshop Materials of the LMU Open Science Center](https://osf.io/zjrhu/)
+* [Course on Open Science and Research Data Management (Slides/Recordings by Elli Papadopoulou)](https://www.openaire.eu/component/zoo/item/chist-era-course-on-open-science-and-research-data-management)
+* [Open Science Talks and Workshops by Gilad Feldman (for reuse of Slides/Materials)](https://osf.io/df9tj/) and [Resources](https://mgto.org/open-science/)
+
+</div>
 
-{{% alert note %}}
+<div class="catalogue-group">
 
-If you know of other syllabi not included in this collection, please consider adding it to our collections so that others can benefit from it too! 
+### In Portuguese
 
-[***Click here to add an Open Scholarship Syllabi to FORRT's Collection***](https://docs.google.com/forms/d/e/1FAIpQLScEfLk9TWc_Wc8lQSuJcqWlmWVzLVmXzq8I2f2QTjhA3t12qw/viewform)
+* [Procedimentos para investigação científica](https://osf.io/4gwd2/)
+* [(PT) Ciência aberta e reprodutível](https://osf.io/wmakh/)
+* [(PT) Boas práticas em ciência](https://osf.io/dwf3z/)
+* [(PT) Tópicos Especiais em Biotecnologia: Planejamento e Otimização de Experimentos](https://osf.io/qc2w4/)
 
-{{% /alert %}}
+</div>
 
-<br>
\ No newline at end of file
+</div>
diff --git a/content/tags/_index.md b/content/tags/_index.md
index acf83f05b10..260ccf31066 100644
--- a/content/tags/_index.md
+++ b/content/tags/_index.md
@@ -1,6 +1,6 @@
 +++
 title = "Tags"
-description = "Every tag used across the website, with the number of pages carrying it."
+description = "Tags link pages and resources across the site on the same topic."
 
 # JSON carries the page list the browser filters; see layouts/tags/list.json.
 outputs = ["HTML", "JSON"]
diff --git a/content/teaching_os/postEdu.md b/content/teaching_os/postEdu.md
index b30b4ad7af3..0f8e734ad88 100644
--- a/content/teaching_os/postEdu.md
+++ b/content/teaching_os/postEdu.md
@@ -28,7 +28,7 @@ title = "POSTEdu: Promoting Open Science Teaching: A Positive, Inclusive and Par
 <!-- ![PostEdu Logo](PostEdu1.webp) -->
 
 <div style="display: flex; align-items: center;">
-  <img src="PostEdu1.webp" alt="PostEdu Logo" style="margin:auto; padding: auto;">
+  <img src="PostEdu1.webp" alt="PostEdu Logo" width="320" style="margin:auto; padding: auto;">
 </div>
 
 ### Summary
@@ -52,7 +52,7 @@ You can watch the recording of a part of one of the launch events, where the pro
 <h3 style="color:#38673F"> 🚨 <strong> Phase 2 (October 2024 - April 2025): Module Development
  </strong> </h3>
 
-Using insights from the launch events and following FORRT’s comprehensive clusters (https://forrt.org/clusters/), we will develop content for a self-guided program targeting educators interested in incorporating Open Science into their teaching/mentoring. We will develop three modules, each including active reflections on incorporating the ethos of Open Science and utilising existing open educational resources within different disciplines.
+Using insights from the launch events and following FORRT’s comprehensive [clusters](/clusters/), we will develop content for a self-guided program targeting educators interested in incorporating Open Science into their teaching/mentoring. We will develop three modules, each including active reflections on incorporating the ethos of Open Science and utilising existing open educational resources within different disciplines.
 
 - **Module 1 - “A positive lens”** (Module coordinator: Dr. Thomas Rhys Evans) <br>
 The ethos of Open Science in a teaching context (importance of meta-science, transparency and reproducibility, proposed improved initiatives, and ethical consideration for improved practices). 
@@ -74,4 +74,4 @@ Disseminate the program, elicit user feedback and engage in sustainable revision
 
 <strong>Development teams</strong>: Educators interested in actively helping to develop the modules of the self-guided course (~2-3 per module). Contributors will be included in the self-guided course in line with CRediT taxonomy. 
 
-The spots for these roles are limited and members will be selected by the core team. For more information, feel free to reach out to Team Curriculum (Leticia Micheli, Madeleine Pownall, Helena Hartmann, Thomas Rhys Evans, Karen Matvienko-Sikar & Flavio Azevedo).
+Recruitment for these roles has closed. For more information, feel free to reach out to Team Curriculum (Leticia Micheli, Madeleine Pownall, Helena Hartmann, Thomas Rhys Evans, Karen Matvienko-Sikar & Flavio Azevedo).
diff --git a/content/testimonials/testimonial4.md b/content/testimonials/testimonial4.md
index 160e7ad0309..278be49f254 100644
--- a/content/testimonials/testimonial4.md
+++ b/content/testimonials/testimonial4.md
@@ -68,6 +68,6 @@ But FORRT has offered me so much more than just web-development experience. Thro
 
 FORRT’s commitment to pedagogical reform and inclusive open scholarship is truly inspiring. I’m grateful for the amazing people behind this initiative and for every opportunity to grow alongside them.
 
-**To anyone considering joining FORRT: jump in! You’ll learn more, contribute more, and have far more fun than you ever imagined. Cheers!”**
+**To anyone considering joining FORRT: jump in! You’ll learn more, contribute more, and have far more fun than you ever imagined. Cheers!**
 
 ### **---Richard Dushime**
diff --git a/content/testimonials/testimonial6.md b/content/testimonials/testimonial6.md
index 398bde4e6ea..ce72cc6b5d5 100644
--- a/content/testimonials/testimonial6.md
+++ b/content/testimonials/testimonial6.md
@@ -40,7 +40,7 @@ subtitle = ""
 <div style="float: right; margin: 0 1rem 1rem 0; text-align: center;">
   <div style="width: 320px; height: 320px; border-radius: 50%; overflow: hidden;">
     <img
-      src="../authors/adiradaniel/avatar.webp"
+      src="/authors/adira-daniel/avatar.webp"
       alt=" Adira Daniel Portrait"
       style="width: 100%; height: 100%; object-fit: cover;"
     >
diff --git a/content/welcome/index.md b/content/welcome/index.md
index 6cd37d1bc60..a85290c0390 100644
--- a/content/welcome/index.md
+++ b/content/welcome/index.md
@@ -10,13 +10,13 @@ type: welcome
     step="1"
     title="Learn About FORRT"
     description="Start by understanding our mission and the three-pronged approach we use to support open science education."
-    url="/about/about"
+    url="/about/us/"
 >}}
 
 {{< welcome 
     step="2"
     title="Explore FORRT Clusters"
-    description="Familiarize yourself with our 7-cluster framework that provides a comprehensive structure for teaching open science."
+    description="Familiarize yourself with our 11-cluster framework that provides a comprehensive structure for teaching open science."
     url="/clusters"
 >}}
 
@@ -38,10 +38,10 @@ type: welcome
 
 {{< welcome 
     title="Explore Our Teams"
-    description="Explore projects, Slack channels and teams and join any of your preferences. Here is a list of all our current projects: Ambassador Program, Cohesion, Database, Ethics, Glossary, Lesson Plans, Literature Landscape, Neurodiversity, Outreach, Pedagogies, Reversals, Summaries, and Website teams."
+    description="Explore projects, Slack channels and teams and join any that match your interests. The Teams page lists all our current teams."
     url="/about/teams"
+    button="Explore the Teams page"
     icon="fas fa-users"
-    count="13 teams"
 >}}
 
 {{< social-media >}}
@@ -53,7 +53,6 @@ type: welcome
     description="Our comprehensive e-learning platform with community-driven initiatives and resources for open science education."
     url="/nexus"
     icon="fas fa-graduation-cap"
-    count="12"
 >}}
 
 {{< welcome 
@@ -61,7 +60,6 @@ type: welcome
     description="Teaching methodologies and approaches specifically designed for integrating open science into educational practices."
     url="/pedagogies"
     icon="fas fa-lightbulb"
-    count="25"
 >}}
 
 {{< welcome 
@@ -69,7 +67,6 @@ type: welcome
     description="Resources focused on equity in open scholarship and supporting neurodiversity in academic settings."
     url="/dei"
     icon="fas fa-heart"
-    count="8"
 >}}
 
 {{< welcome 
@@ -77,7 +74,6 @@ type: welcome
     description="Studies, publications, and evidence about the impact of open and reproducible research on students and education."
     url="/impact"
     icon="fas fa-chart-line"
-    count="15"
 >}}
 
 {{< welcome 
@@ -85,7 +81,6 @@ type: welcome
     description="Curated collection of replications and reversals across social sciences for educational use."
     url="/replication-hub"
     icon="fas fa-redo"
-    count="6"
 >}}
 
 {{< welcome 
@@ -93,5 +88,4 @@ type: welcome
     description="Specialized lesson plans and materials for promoting neurodiversity awareness in open science education."
     url="/neurodiversity"
     icon="fas fa-brain"
-    count="42"
 >}}
\ No newline at end of file
diff --git a/data/fonts/doors.toml b/data/fonts/doors.toml
new file mode 100644
index 00000000000..dd50dbef449
--- /dev/null
+++ b/data/fonts/doors.toml
@@ -0,0 +1,7 @@
+# Self-hosted fonts, declared in assets/css/doors/fonts.css. No google_fonts entry, so
+# site_head.html requests nothing from Google.
+name = "doors"
+heading_font = "Newsreader"
+body_font = "'Source Sans 3'"
+nav_font = "'Source Sans 3'"
+mono_font = "ui-monospace"
diff --git a/data/fonts/forrt.toml b/data/fonts/forrt.toml
deleted file mode 100644
index 6cea02dd4c1..00000000000
--- a/data/fonts/forrt.toml
+++ /dev/null
@@ -1,10 +0,0 @@
-# Font style metadata
-name = "forrt"
-
-# Usual FORRT font is Century Schoolbook. Domine is served from static/fonts (see static/css/fonts.css).
-
-# Use Domine everywhere
-heading_font = "Domine"
-body_font    = "Domine"
-nav_font     = "Domine"
-mono_font    = "Domine"
diff --git a/data/partners.json b/data/partners.json
index 3cf93227e85..9581d44d72b 100644
--- a/data/partners.json
+++ b/data/partners.json
@@ -328,7 +328,7 @@
     "logo": "Utrecht-University.webp",
     "url": "https://www.uu.nl/en/organisation/interdisciplinary-social-science",
     "cluster": "Higher Education Partners",
-    "description": "In 2024, FORRT entered a long-term framework agreement with Utrecht University’s Department of Interdisciplinary Social Sciences to formalize and expand our shared commitment to advancing open and reproducible research. This partnership enables co-created research, joint initiatives, and mutual support through a structured governance model. In 2026 the Rector of the Faculty of Social and Behavioral Sciences has endorsed FORRT for the Leo Waaijers OS Award.",
+    "description": "In 2024, FORRT entered a long-term framework agreement with Utrecht University’s Department of Interdisciplinary Social Sciences to formalize and expand our shared commitment to advancing open and reproducible research. This partnership enables co-created research, joint initiatives, and mutual support through a structured governance model. In 2026 the Dean of the Faculty of Social and Behavioural Sciences endorsed FORRT for the Leo Waaijers OS Award.",
     "additional_link":"pdf/nominatie_FORRT.pdf",
     "additional_link_text": "Read more"
   }
diff --git a/data/publications.yaml b/data/publications.yaml
index de244654c5d..c921480305c 100644
--- a/data/publications.yaml
+++ b/data/publications.yaml
@@ -15,7 +15,7 @@
   focus_area: "Meta-Research & Scientific Reform"
 
 # 2
-- title: "Mapping Open Science Communities in Psychology: A Systematic Narrative Review"
+- title: "International Initiatives to Enhance Awareness and Uptake of Open Research in Psychology: A Systematic Mapping Review"
   type: "journal"
   year: "2025"
   status: "Published"
@@ -106,7 +106,7 @@
   focus_area: "Education & Pedagogy"
 
 # 8
-- title: "Improvements since the Replication Crisis: The Structural, Procedural, and Community Changes"
+- title: "The Replication Crisis Has Led to Positive Structural, Procedural, and Community Changes"
   type: "journal"
   year: "2023"
   status: "Published"
@@ -156,12 +156,12 @@
 # 11
 - title: "The Role of Pedagogical Communities"
   type: "journal"
-  year: "2021"
+  year: "2022"
   status: "Published"
   journal_name: "BMC Research Notes"
   authors: "Azevedo, F., Liu, M., Pennington, C. R., Pownall, M., Evans, T. R., Parsons, S., Elsherif, M. M., Micheli, L., ... & FORRT"
   abstract: "We have written a manuscript entitled *Towards a culture of open scholarship: The role of pedagogical communities* describing the need to integrate open scholarship principles into research training within higher education."
-  citation: "Azevedo, F., Liu, M., Pennington, C. R., Pownall, M., Evans, T. R., Parsons, S., Elsherif, M. M., Micheli, L., ... & FORRT (2021). <strong>Towards a culture of open scholarship: The role of pedagogical communities.</strong> <em>BMC Research Notes</em>, 15(1), 1-5. https://doi.org/10.1186/s13104-022-05944-1"
+  citation: "Azevedo, F., Liu, M., Pennington, C. R., Pownall, M., Evans, T. R., Parsons, S., Elsherif, M. M., Micheli, L., ... & FORRT (2022). <strong>Towards a culture of open scholarship: The role of pedagogical communities.</strong> <em>BMC Research Notes</em>, 15(1), 1-5. https://doi.org/10.1186/s13104-022-05944-1"
   links:
     doi: "https://doi.org/10.1186/s13104-022-05944-1"
   altmetric_doi: "10.1186/s13104-022-05944-1"
@@ -266,7 +266,7 @@
   year: "2026"
   status: "preprint"
   journal_name: "OSF Preprints"
-  authors: "Elif Bastan,Ege Emek,Merve Öztürk,Neslihan Özhan,Nihan Selin Soylu Konak,Flavio Azevedo"
+  authors: "Elif Bastan, Ege Emek, Merve Öztürk, Neslihan Özhan, Nihan Selin Soylu Konak, Flavio Azevedo"
   abstract: "In response to the replication crisis, a significant number of structural and procedural changes have been made in how scientific research is conducted. Of these changes, open science practices, in particular, have been seen as a panacea for improving transparency, reproducibility, and accessibility in research. However, engaging in such reforms is not equally possible for everyone in academia, partly due to dominant resources being available in the English language. This situation results in a linguistic power asymmetry that creates and perpetuates structural barriers for researchers, educators, and students working in non-English contexts, overall limiting their efforts to take part in global scientific discourse. Using the frameworks of open science, linguistics, and epistemic justice as an organizing point, this article reports and reflects on translating the Open Science Glossary of the Framework for Open and Reproducible Research Training (FORRT) into Turkish, conducted as part of a multilingual initiative. Our team of five researchers carried out a collaborative translation process and translated approximately 250 open science terms. Translation decisions, particularly for terms without established Turkish equivalents, were debated collectively, and final decisions were made by considering the principles of clarity, accuracy, accessibility, and adaptation. We argue that translating terminology is an act of epistemic inclusion that supports capacity building, teaching, and research reform, rather than simply being a technical necessity. By localising open science concepts in the Turkish language, our work contributes to more inclusive and globally representative open science efforts."
   citation: "Bastan, E., Emek, E., Öztürk, M., Özhan, N., Soylu Konak, N. S., & Azevedo, F. (2026). <strong>Making open science multilingual: Lessons from the Turkish adaptation of FORRT’s Open Science Glossary.</strong> <em>OSF Preprints</em>. https://doi.org/10.31234/osf.io/c4jqr_v1"
   links:
diff --git a/data/themes/doors.toml b/data/themes/doors.toml
new file mode 100644
index 00000000000..3117fd7a6b2
--- /dev/null
+++ b/data/themes/doors.toml
@@ -0,0 +1,16 @@
+# Doors theme metadata for the Academic theme's Sass variables. The design's own colours
+# are the CSS variables in assets/css/doors/tokens.css; these repeat the few it needs so
+# Bootstrap-based pages match until they are redesigned. Values from the identity guide.
+name = "doors"
+light = true
+
+primary = "#005a87"
+menu_primary = "#fefdf6"
+menu_text = "#262d35"
+menu_text_active = "#005a87"
+menu_title = "#262d35"
+home_section_odd = "#fefdf6"
+home_section_even = "#fefdf6"
+background = "#fefdf6"
+link = "#005a87"
+link_hover = "#262d35"
diff --git a/data/themes/forrt.toml b/data/themes/forrt.toml
deleted file mode 100644
index f6ac4747c57..00000000000
--- a/data/themes/forrt.toml
+++ /dev/null
@@ -1,26 +0,0 @@
-# Theme metadata
-name = "forrt"
-
-# Is theme light or dark?
-light = true
-
-# Primary
-primary = "#004055"
-secondary = "#b8336a"
-
-
-# Menu
-menu_primary = "#3e3e3e"
-menu_text = "white"
-menu_text_active = "#b8336a"
-
-#menu_title = "#888"
-menu_title = "#69b3a2"
-
-# Home sections
-home_section_odd = "#fefdf6"
-home_section_even = "#fefdf6"
-background = "#fefdf6"
-
-link = "#8e0000"
-link_hover = "#ff6bbc"
diff --git a/i18n/ar.yaml b/i18n/ar.yaml
new file mode 100644
index 00000000000..9d7165b351b
--- /dev/null
+++ b/i18n/ar.yaml
@@ -0,0 +1,3 @@
+# Overrides the theme's Arabic strings (themes/academic/i18n/ar.yaml).
+- id: last_updated
+  translation: "آخر تحديث:"
diff --git a/layouts/404.html b/layouts/404.html
index e4ba9f08bf0..861bca5b502 100644
--- a/layouts/404.html
+++ b/layouts/404.html
@@ -1,44 +1,65 @@
 {{- define "main" -}}
 
-{{ $css := resources.Get "css/404.css" | minify | fingerprint }}
-<link rel="stylesheet" href="{{ $css.RelPermalink }}" integrity="{{ $css.Data.Integrity }}">
-
 <script>
 (function() {
+  // The empty string in production; a preview in a subfolder redirects within itself.
+  var base = '{{ strings.TrimSuffix "/" (urls.Parse site.BaseURL).Path }}';
   var path = window.location.pathname;
+  if (base && path.indexOf(base + '/') === 0) path = path.slice(base.length);
 
   // Special case: /glossary/vbeta/term → try /glossary/english/term, fallback to /glossary/english/
   var vbetaMatch = path.match(/^\/glossary\/vbeta\/(.+)/);
   if (vbetaMatch) {
-    var termPath = '/glossary/english/' + vbetaMatch[1];
+    var termPath = base + '/glossary/english/' + vbetaMatch[1];
     fetch(termPath, { method: 'HEAD' }).then(function(res) {
-      window.location.replace(res.ok ? termPath : '/glossary/english/');
+      window.location.replace(res.ok ? termPath : base + '/glossary/english/');
     }).catch(function() {
-      window.location.replace('/glossary/english/');
+      window.location.replace(base + '/glossary/english/');
     });
     return;
   }
   // /glossary/vbeta with no term
   if (/^\/glossary\/vbeta\/?$/.test(path)) {
-    window.location.replace('/glossary/english/');
+    window.location.replace(base + '/glossary/english/');
     return;
   }
 
   // Old taxonomy index URL (resource tag list root) → main clusters taxonomy page
   if (/^\/forrt_clusters\/?$/i.test(path)) {
-    window.location.replace('/clusters/');
+    window.location.replace(base + '/clusters/');
+    return;
+  }
+
+  // Retired paginated list pages (decision D17): back to the cluster's page. /curated_resources/ is below.
+  var clusterPage = path.match(/^\/forrt_clusters\/([^/]+)\/page\/\d+\/?$/i);
+  if (clusterPage) {
+    window.location.replace(base + '/forrt_clusters/' + clusterPage[1] + '/');
+    return;
+  }
+
+  // Former tag pages, which the tag browser reads by slug as well as by term.
+  var tagPage = path.match(/^\/tag\/(.+?)\/?$/);
+  if (tagPage) {
+    var term = tagPage[1];
+    try { term = decodeURIComponent(term); } catch (error) { /* a malformed address keeps its form */ }
+    window.location.replace(base + '/tags/?tag=' + encodeURIComponent(term));
+    return;
+  }
+  if (/^\/tag\/?$/.test(path)) {
+    window.location.replace(base + '/tags/');
     return;
   }
 
   var redirects = [
-    { pattern: /^\/curated_resources(\/|$)/, target: '/resources/' },
-    { pattern: /^\/glossary\/([^/]+)\/.+/, target: '/glossary/$1/' },
-    { pattern: /^\/author(\/|$)/, target: '/contributors/' },
-    { pattern: /^\/summaries(\/|$)/, target: '/' },
-    { pattern: /^\/reversals(\/|$)/, target: '/' },
-    { pattern: /^\/re-searchterms\/?$/, target: '/apps/re-searchterms.html' },
+    { pattern: /^\/curated_resources\/.+/, target: base + '/resources/' },
+    { pattern: /^\/glossary\/([^/]+)\/.+/, target: base + '/glossary/$1/' },
+    { pattern: /^\/author(\/|$)/, target: base + '/contributors/' },
+    { pattern: /^\/summaries(\/|$)/, target: base + '/' },
+    { pattern: /^\/reversals(\/|$)/, target: base + '/' },
+    { pattern: /^\/re-searchterms\/?$/, target: base + '/apps/re-searchterms.html' },
 
-    // Repo rename redirects (kebab-case migration). Order: longer prefixes first.
+    // Repo rename redirects (kebab-case migration). These sites live at the domain root,
+    // so they take no base. Order: longer prefixes first.
     { pattern: /^\/FReD-apps(\/.*)?$/,                      target: '/fred-apps$1' },
     { pattern: /^\/FReD(\/.*)?$/,                           target: '/fred$1' },
     { pattern: /^\/flora_zotero(\/.*)?$/,                   target: '/flora-zotero$1' },
@@ -58,43 +79,33 @@
         // append the literal string "undefined" to the target.
         target = target.replace('$' + j, match[j] || '');
       }
-      window.location.replace(target);
+      window.location.replace(target + window.location.search + window.location.hash);
       return;
     }
   }
 })();
 </script>
 
-<div class="universal-wrapper pt-3">
-
-  <h1>Whoops! Page not found</h1>
-
-  {{/* Show search box if Academic's search engine is enabled. */}}
-  {{ if eq site.Params.search.engine 1 }}
-  <form class="d-flex align-items-center mb-3">
-    <input name="q" type="search" class="form-control" placeholder="{{ i18n "search_placeholder" }}" autocomplete="off">
-  </form>
-  {{ end }}
-
-  <div class="not-found-content">
-    <p>That page can't be found. <strong>Please help us improve!</strong> If you reached this page through a broken link, let us know at <a href="mailto:info@forrt.org">info@forrt.org</a> or contact Lukas Wallrich on the <a href="https://forrt.slack.com/" target="_blank" rel="noopener">FORRT Slack</a>.</p>
-
-    <div class="not-found-links">
-      <h3>Here are some useful links:</h3>
-      <ul>
-        <li><a href="{{ .Site.BaseURL }}about/us">About FORRT</a></li>
-        <li><a href="{{ .Site.BaseURL }}about/get-involved/">Get Involved</a></li>
-        <li><a href="{{ .Site.BaseURL }}resources/">Curated Resources</a></li>
-        <li><a href="{{ .Site.BaseURL }}glossary/">Glossary</a></li>
-        <li><a href="{{ .Site.BaseURL }}replication-hub/">Replication Hub</a></li>
-        <li><a href="{{ .Site.BaseURL }}lesson-plans/">Lesson Plans</a></li>
-        <li><a href="{{ .Site.BaseURL }}publications/">Publications</a></li>
-        <li><a href="{{ .Site.BaseURL }}clusters/"> FORRT's Clusters</a></li>
-      </ul>
-    </div>
-
-    <p>Return <a href="{{ .Site.BaseURL }}">Home</a>.</p>
+<div class="wrap">
+  <div class="article-layout article-layout-single">
+    <article class="reading">
+      <header class="article-head"><h1>Page not found</h1></header>
+      <div class="article-style">
+        <p>That page can't be found. If you reached it through a broken link, tell us at <a href="mailto:info@forrt.org">info@forrt.org</a> or contact Lukas Wallrich on the <a href="https://forrt.slack.com/" target="_blank" rel="noopener">FORRT Slack</a>.</p>
+        <h2>Useful pages</h2>
+        <ul>
+          <li><a href="{{ "about/us/" | relLangURL }}">About FORRT</a></li>
+          <li><a href="{{ "about/get-involved/" | relLangURL }}">Get involved</a></li>
+          <li><a href="{{ "resources/" | relLangURL }}">Teaching resources</a></li>
+          <li><a href="{{ "glossary/english/" | relLangURL }}">Glossary</a></li>
+          <li><a href="{{ "replication-hub/" | relLangURL }}">Replication Hub</a></li>
+          <li><a href="{{ "lesson-plans/" | relLangURL }}">Lesson plans</a></li>
+          <li><a href="{{ "publications/" | relLangURL }}">Publications</a></li>
+          <li><a href="{{ "clusters/" | relLangURL }}">FORRT's clusters</a></li>
+        </ul>
+        <p>Or go back to the <a href="{{ "" | relLangURL }}">home page</a>.</p>
+      </div>
+    </article>
   </div>
-
 </div>
 {{- end -}}
diff --git a/layouts/_default/baseof.html b/layouts/_default/baseof.html
index 456d9f505c8..8d3c0c88c90 100644
--- a/layouts/_default/baseof.html
+++ b/layouts/_default/baseof.html
@@ -6,39 +6,25 @@
 
 {{ partial "site_head" . }}
 
-{{ $show_navbar := site.Params.main_menu.enable | default true }}
-{{- $highlight_active_link := site.Params.main_menu.highlight_active_link | default true -}}
-<body id="top" data-spy="scroll" {{ if $show_navbar }}data-offset="70"{{end}} data-target="{{ if or .IsHome (eq .Type "widget_page") | and $highlight_active_link }}#navbar-main{{else}}#TableOfContents{{end}}" class="{{ if not (.Scratch.Get "light") }}dark{{end}} {{ if not $show_navbar }}no-navbar{{end}}">
-
-  {{/* Load day/night theme. */}}
-  {{/* Initialise default theme. */}}
-  {{ if site.Params.day_night }}
-    <script>window.staDarkLightChooser = true;</script>
-  {{ end }}
-  {{ if eq (.Scratch.Get "light") true }}
-    <script>const isSiteThemeDark = false;</script>
-  {{ else }}
-    <script>const isSiteThemeDark = true;</script>
+<body id="top"{{ if strings.HasSuffix .RelPermalink "/glossary/references/" }} class="references-page"{{ end }}>
+  <a class="skip" href="#main">Skip to content</a>
+
+  {{ if partial "doors/on_theme" . }}
+  {{/* The theme's script still expects these on the pages that load it. */}}
+  <script>const isSiteThemeDark = false;</script>
   {{ end }}
-  {{ $load_theme := resources.Get "js/load-theme.js" }}
-  <script src="{{ $load_theme.RelPermalink }}"></script>
 
   {{ partial "search" . }}
 
-  {{ partial "navbar" . }}
+  {{ partial "doors/header" . }}
 
+  <main id="main" tabindex="-1">
   {{ block "main" . }}{{ end }}
+  </main>
 
-  {{ partial "site_js" . }}
-
-  {{/* Docs and Updates layouts include the site footer in a different location. */}}
-  {{ if not (in (slice "book" "docs" "updates") .Type) }}
-  <div class="container">
-    {{ partial "site_footer" . }}
-  </div>
-  {{ end }}
+  {{ partial "site_footer" . }}
 
-  {{ partial "citation" . }}
+  {{ partial "site_js" . }}
 
   {{ partial "chatbot" . }}
 
diff --git a/layouts/_default/index.json b/layouts/_default/index.json
index 511a90d13aa..f3fc7b13319 100644
--- a/layouts/_default/index.json
+++ b/layouts/_default/index.json
@@ -3,6 +3,8 @@
        authors, content, tags, categories — plus relpermalink and section,
        which the result template needs to link to and label each hit. */ -}}
 {{- $index := slice -}}
+{{- /* A shortened author list (citations/authors) keeps every author; leave out its "et al." and button. */ -}}
+{{- $author_ui := `<span class="?ref-etal"?>[^<]*</span>|<button[^>]*ref-authors-toggle[^>]*>[^<]*</button>` -}}
 {{- $pages := site.RegularPages -}}
 {{- /* A docs/book section's root page (its `_index.md`) is `Kind: section`,
        which `.Site.RegularPages` excludes — add those roots back so the
@@ -78,7 +80,7 @@
       {{- end -}}
     {{- end -}}
 
-    {{- $index = $index | append (dict "objectID" .File.UniqueID "date" .Date.UTC.Unix "publishdate" .PublishDate "lastmod" .Lastmod.UTC.Unix "expirydate" .ExpiryDate.UTC.Unix "lang" .Lang "permalink" $permalink "relpermalink" $rel_permalink "title" $title "summary" (plainify $desc) "content" .Plain "authors" $authors "kind" .Kind "type" .Type "section" .Section "tags" (partial "functions/page_tags.html" .) "categories" .Params.Categories "image" .Params.image) -}}
+    {{- $index = $index | append (dict "objectID" .File.UniqueID "date" .Date.UTC.Unix "publishdate" .PublishDate "lastmod" .Lastmod.UTC.Unix "expirydate" .ExpiryDate.UTC.Unix "lang" .Lang "permalink" $permalink "relpermalink" $rel_permalink "title" $title "summary" (plainify (replaceRE $author_ui "" (string $desc))) "content" (plainify (replaceRE $author_ui "" (string .Content))) "authors" $authors "kind" .Kind "type" .Type "section" .Section "tags" (partial "functions/page_tags.html" .) "categories" .Params.Categories "image" .Params.image) -}}
 
   {{- end -}}
 {{- end -}}
diff --git a/layouts/_default/list.html b/layouts/_default/list.html
new file mode 100644
index 00000000000..4597f46f06b
--- /dev/null
+++ b/layouts/_default/list.html
@@ -0,0 +1,37 @@
+{{- define "main" -}}
+{{/* The simple list page, for categories, clusters' resource lists and sections with no template of
+     their own. A section with no children is just its text. Paginated lists keep their numbered
+     pages, except the curated_resources and forrt_clusters ones (decision D17), which the 404 page
+     sends on. */}}
+{{ if not .Data.Pages }}
+  {{ $_ := .Paginate .Data.Pages }}
+  {{ partial "doors/reading" . }}
+{{ else }}
+<div class="wrap">
+  <div class="article-layout article-layout-wide">
+    <article class="reading">
+      <header class="article-head">
+        {{ partial "doors/crumbs" (dict "page" .) }}
+        <h1>{{ .Title }}</h1>
+        {{ with .Params.subtitle }}<p class="standfirst">{{ . | markdownify | emojify }}</p>{{ end }}
+      </header>
+      {{ with .Content }}<div class="article-style">{{ partial "doors/content" . }}</div>{{ end }}
+      {{ if eq (.Type | lower) "curated_resources" }}
+        <p class="list-count">All {{ len .Data.Pages }} teaching resources are in the directory, where you can search and filter them.</p>
+        <p><a class="btn btn-primary" href="{{ relref . "/resources" }}">Open the resources directory</a></p>
+      {{ else if and (eq (.Type | lower) "forrt_clusters") (ne .Kind "taxonomy") }}
+        <p class="list-count">{{ len .Data.Pages }} resources. Search and filter them all in the <a href="{{ relref . "/resources" }}">resources directory</a>.</p>
+        {{/* Alphabetical rows that read across, each with its type, rather than a wall of bare links. */}}
+        <ul class="cluster-resources">
+          {{ range sort .Data.Pages "Title" }}<li><a href="{{ .RelPermalink }}">{{ .Title }}</a>{{ with .Params.material_type }}<span>{{ delimit . ", " }}</span>{{ end }}</li>{{ end }}
+        </ul>
+      {{ else }}
+        {{ $pager := .Paginate .Data.Pages }}
+        <div class="list-items">{{ range $pager.Pages }}{{ partial "doors/list_item" . }}{{ end }}</div>
+        {{ partial "doors/pager" $pager }}
+      {{ end }}
+    </article>
+  </div>
+</div>
+{{ end }}
+{{- end -}}
diff --git a/layouts/_default/single.html b/layouts/_default/single.html
index 480cf89559e..c2c3e8bd487 100644
--- a/layouts/_default/single.html
+++ b/layouts/_default/single.html
@@ -1,21 +1,22 @@
+{{/* Articles and plain content: posts, Educators' Corner, pedagogies, the lesson bank and short
+     standalone pages. Calm and readable, in one narrow column, with a side card when there is
+     something to put in it. */}}
 {{- define "main" -}}
-
-<article class="article">
-
-  {{/* Allow pages to opt out of the default header (e.g., custom full-width layouts) */}}
-  {{ if not .Params.hide_page_header }}
-    {{ partial "page_header" . }}
-  {{ end }}
-
-  <div class="article-container">
-
-    <div class="article-style">
-      {{ .Content }}
-    </div>
-
-    {{ partial "page_footer" . }}
-
-  </div>
-</article>
-
+{{ if eq .Path "/about/steering-committee" }}
+{{/* Generated with its own stylesheet, heading and Google Fonts link; scripts/generate_sc_profiles.py is the source. */}}
+<div class="wrap sc-page">
+  <header class="article-head">
+    {{ partial "doors/crumbs" (dict "page" .) }}
+    <h1>{{ .Title }}</h1>
+  </header>
+  {{ $body := partial "doors/content" .Content }}
+  {{ $body = replaceRE `<link href="https://fonts\.googleapis[^>]*>` "" $body }}
+  {{ $body = replaceRE `(?s)<h2 class="sc-page-title">.*?</h2>` "" $body }}
+  {{ replaceRE `(</?)main>` "${1}div>" $body | safeHTML }}
+</div>
+{{ $steering := resources.Get "js/doors/steering.js" | js.Build (dict "minify" true "format" "iife" "target" "es2019") | fingerprint "md5" }}
+<script src="{{ $steering.RelPermalink }}" defer></script>
+{{ else }}
+{{ partial "doors/reading" . }}
+{{ end }}
 {{- end -}}
diff --git a/layouts/authors/list.html b/layouts/authors/list.html
index c73a0121178..04abb036dd5 100644
--- a/layouts/authors/list.html
+++ b/layouts/authors/list.html
@@ -27,50 +27,35 @@
   {{- end -}}
   {{- $posts = sort $posts "Date" "desc" -}}
 
-<section id="profile-page" class="pt-5">
-  <div class="container">
-    <div class="row">
-
-      <div class="col-12 col-lg-4">
-        <div id="profile">
-          {{ with $avatar }}
-            {{ $img := .Fill "270x270 Center" }}
-            <img class="avatar {{ if eq $avatar_shape "square" }}avatar-square{{ else }}avatar-circle{{ end }}" src="{{ $img.RelPermalink }}" width="270" height="270" alt="{{ $name }}" loading="lazy">
-          {{ end }}
-          <div class="portrait-title">
-            <h1>{{ $name }}</h1>
-            {{ with $page.Params.role }}<h3>{{ . | markdownify | emojify }}</h3>{{ end }}
-            {{ range $page.Params.organizations }}
-            <h3>
-              {{ with .url }}<a href="{{ . }}" target="_blank" rel="noopener">{{ end }}
-              <span>{{ .name }}</span>
-              {{ if .url }}</a>{{ end }}
-            </h3>
-            {{ end }}
+<div class="wrap">
+  <div class="article-layout">
+    <section class="article-card profile-card" aria-label="About {{ $name }}">
+      {{ with $avatar }}{{ $img := .Fill "270x270 Center webp" }}<img class="profile-photo{{ if eq $avatar_shape "square" }} avatar-square{{ end }}" src="{{ $img.RelPermalink }}" width="135" height="135" alt="Portrait of {{ $name }}">{{ end }}
+      {{ with $page.Params.role }}<p class="profile-role">{{ . | markdownify | emojify }}</p>{{ end }}
+      {{/* Most profiles keep the template's empty organisation, which would leave an empty paragraph. */}}
+      {{ range $page.Params.organizations }}{{ if .name }}
+        <p class="profile-org">{{ with .url }}<a href="{{ if (urls.Parse .).Scheme }}{{ . }}{{ else }}https://{{ . }}{{ end }}" target="_blank" rel="noopener">{{ end }}{{ .name }}{{ if .url }}</a>{{ end }}</p>
+      {{ end }}{{ end }}
+      {{ partial "social_links" $page }}
+    </section>
+    <article class="reading">
+      <header class="article-head">
+        <nav class="crumbs" aria-label="Breadcrumb"><a href="{{ "" | relLangURL }}">Home</a> <span aria-hidden="true">/</span> <a href="{{ relref . "/authors" }}">People</a></nav>
+        <h1>{{ $name }}</h1>
+        {{/* On a narrow screen the side card would follow the whole biography, so its essentials sit
+             under the name instead; the card is hidden there (article.css), so each shows once. */}}
+        <div class="profile-head">
+          {{ with $avatar }}{{ $img := .Fill "144x144 Center webp" }}<img class="profile-photo{{ if eq $avatar_shape "square" }} avatar-square{{ end }}" src="{{ $img.RelPermalink }}" width="72" height="72" alt="Portrait of {{ $name }}">{{ end }}
+          <div>
+            {{ with $page.Params.role }}<p class="profile-role">{{ . | markdownify | emojify }}</p>{{ end }}
+            {{ range $page.Params.organizations }}{{ if .name }}<p class="profile-org">{{ with .url }}<a href="{{ if (urls.Parse .).Scheme }}{{ . }}{{ else }}https://{{ . }}{{ end }}" target="_blank" rel="noopener">{{ end }}{{ .name }}{{ if .url }}</a>{{ end }}</p>{{ end }}{{ end }}
+            {{ partial "social_links" $page }}
           </div>
-
-          <ul class="network-icon" aria-hidden="true">
-            {{ range $page.Params.social }}
-              {{ $pack := or .icon_pack "fas" }}
-              {{ $pack_prefix := $pack }}
-              {{ if in (slice "fab" "fas" "far" "fal") $pack }}{{ $pack_prefix = "fa" }}{{ end }}
-              {{ $link := .link }}
-              {{ $scheme := (urls.Parse $link).Scheme }}
-              {{ $target := "" }}
-              {{ if not $scheme }}{{ $link = .link | relLangURL }}{{ else if in (slice "http" "https") $scheme }}{{ $target = "target=\"_blank\" rel=\"noopener\"" }}{{ end }}
-              <li>
-                <a href="{{ $link | safeURL }}" {{ $target | safeHTMLAttr }}>
-                  <i class="{{ $pack }} {{ $pack_prefix }}-{{ .icon }} big-icon"></i>
-                </a>
-              </li>
-            {{ end }}
-          </ul>
         </div>
-      </div>
-
-      <div class="col-12 col-lg-8">
-        {{ with $page.Params.bio }}{{ . | markdownify | emojify }}{{ end }}
-        {{ $page.Content }}
+      </header>
+      <div class="article-style">
+        {{ with $page.Params.bio }}<p>{{ . | markdownify | emojify }}</p>{{ end }}
+        {{ partial "doors/content" $page.Content }}
 
         {{/* Interests, dropping the Wowchemy template placeholders ("Interest 1"). */}}
         {{ $interests := slice }}
@@ -78,40 +63,38 @@ <h3>
           {{ if not (findRE `(?i)^interest \d+$` .) }}{{ $interests = $interests | append . }}{{ end }}
         {{ end }}
         {{ with $interests }}
-        <h3>{{ i18n "interests" | default "Interests" | markdownify }}</h3>
-        <ul class="ul-interests">
-          {{ range . }}<li>{{ . | markdownify | emojify }}</li>{{ end }}
-        </ul>
+        <h2>{{ i18n "interests" | default "Interests" | markdownify }}</h2>
+        <ul>{{ range . }}<li>{{ . | markdownify | emojify }}</li>{{ end }}</ul>
         {{ end }}
 
         {{ with $posts }}
-        <div class="article-widget content-widget-hr">
-          <h3>{{ i18n "user_profile_latest" | default "Latest" }}</h3>
-          <ul>
-            {{ range . }}<li><a href="{{ .RelPermalink }}">{{ .Title }}</a></li>{{ end }}
-          </ul>
-        </div>
+        <h2>{{ i18n "user_profile_latest" | default "Latest" }}</h2>
+        <ul>{{ range . }}<li><a href="{{ .RelPermalink }}">{{ .Title }}</a></li>{{ end }}</ul>
         {{ end }}
       </div>
-
-    </div>
+    </article>
   </div>
-</section>
+</div>
 
 {{- else -}}
 {{/* =========================================================================
      Authors index  (/authors/) — lists every author who has a profile page.
      ========================================================================= */}}
-<section class="pt-5">
-  <div class="universal-wrapper">
-    <h1>{{ $page.Title | default "Authors" }}</h1>
-    {{ $page.Content }}
-    <ul class="authors-index">
-      {{ range $page.Pages.ByParam "name" }}
-        <li><a href="{{ .RelPermalink }}">{{ .Params.name | default .Title }}</a></li>
-      {{ end }}
-    </ul>
+<div class="wrap">
+  <div class="article-layout article-layout-single">
+    <article class="reading">
+      <header class="article-head">
+        {{ partial "doors/crumbs" (dict "page" $page) }}
+        <h1>{{ $page.Title | default "Authors" }}</h1>
+      </header>
+      {{ with $page.Content }}<div class="article-style">{{ partial "doors/content" . }}</div>{{ end }}
+      <ul class="plain-list authors-index">
+        {{ range $page.Pages.ByParam "name" }}
+          <li><a href="{{ .RelPermalink }}">{{ .Params.name | default .Title }}</a></li>
+        {{ end }}
+      </ul>
+    </article>
   </div>
-</section>
+</div>
 {{- end -}}
 {{- end -}}
diff --git a/layouts/citation_politics/list.html b/layouts/citation_politics/list.html
index 5ae01d389c3..62f0ac53bc2 100644
--- a/layouts/citation_politics/list.html
+++ b/layouts/citation_politics/list.html
@@ -1,25 +1,5 @@
 {{- define "main" -}}
-<style>
-      /* Full-width toolkit container */
-    .toolkit-full-width {
-      max-width: 100% !important;
-      padding: 15px !important;
-      margin: 15px !important;
-    }
-
-    /* Remove container constraints */
-    .toolkit-full-width .container {
-      max-width: 100% !important;
-      padding: 15px !important;
-      margin: 15px !important;
-    }
-</style>
-<div class="universal-wrapper">
-  {{ with .Content }}
-  <div class="article-style">{{ . }}</div>
-  {{ end }}
-</div>
-
-{{ partial "pagination" . }}
-
+{{/* Its numbered list pages stay at their addresses, though this layout does not list them. */}}
+{{ $_ := .Paginate .Data.Pages }}
+{{ partial "doors/reading" . }}
 {{- end -}}
diff --git a/layouts/citation_politics/single.html b/layouts/citation_politics/single.html
index f7f829d8871..2b2aac2f545 100644
--- a/layouts/citation_politics/single.html
+++ b/layouts/citation_politics/single.html
@@ -1,35 +1,3 @@
 {{- define "main" -}}
-<style>
-      /* Full-width toolkit container */
-    .toolkit-full-width {
-      max-width: 100% !important;
-      padding: 15px !important;
-      margin: 15px !important;
-    }
-
-    /* Remove container constraints */
-    .toolkit-full-width .container {
-      max-width: 100% !important;
-      padding: 15px !important;
-      margin: 15px !important;
-    }
-</style>
-
-<article class="article">
-
-  {{/* Special layout for toolkit page */}}
-  {{ if eq .RelPermalink "/citation-politics/toolkit/" }}
-    <div class="toolkit-full-width">
-      {{ .Content }}
-    </div>
-  {{ else }}
-    <div class="article-container">
-      <div class="article-style pt-3">
-        {{ .Content }}
-      </div>
-    </div>
-  {{ end }}
-</article>
-
+{{ partial "doors/reading" . }}
 {{- end -}}
-
diff --git a/layouts/clusters/cluster.html b/layouts/clusters/cluster.html
index da2e3fd01d5..3c7b18f565b 100644
--- a/layouts/clusters/cluster.html
+++ b/layouts/clusters/cluster.html
@@ -27,26 +27,17 @@
 {{ end }}
 
 {{ if not $cluster }}
-  <div class="universal-wrapper pt-3 pb-3">
-    <div class="container">
+  <div class="wrap">
+    <div>
       <p class="alert alert-warning">Cluster data not found. <a href="{{ "/clusters/" | relURL }}">Back to all clusters</a>.</p>
     </div>
   </div>
 {{ else }}
   {{ partial "clusters/cluster_seo_jsonld.html" (dict "page" . "cluster" $cluster) }}
 
-  {{/* Breadcrumb header — narrow width like main page title */}}
-  <div class="universal-wrapper pt-3 pb-2">
-    <div class="container">
-      <div class="article-container pt-3">
-        {{ $heading := .Params.heading_title | default .Title }}
-        <nav aria-label="breadcrumb" class="clusters-heading-row__crumbs mb-1">
-          <a href="{{ "/clusters/" | relURL }}" class="clusters-heading-row__parent">FORRT Clusters</a>
-          <span class="clusters-heading-row__sep" aria-hidden="true">/</span>
-          <h1 class="clusters-heading-row__title clusters-site-heading" itemprop="headline">{{ $heading }}</h1>
-        </nav>
-      </div>
-    </div>
+  <div class="wrap clusters-head">
+    <nav class="crumbs" aria-label="Breadcrumb"><a href="{{ "" | relLangURL }}">Home</a> <span aria-hidden="true">/</span> <a href="{{ "nexus/" | relLangURL }}">Educational Nexus</a> <span aria-hidden="true">/</span> <a href="{{ "clusters/" | relLangURL }}">Clusters</a> <span aria-hidden="true">/</span> <span aria-current="page">{{ .Params.heading_title | default .Title }}</span></nav>
+    <h1 class="clusters-site-heading" itemprop="headline">{{ .Params.heading_title | default .Title }}</h1>
   </div>
 
   {{ $palette := partial "clusters/colors.html" }}
@@ -56,7 +47,7 @@ <h1 class="clusters-heading-row__title clusters-site-heading" itemprop="headline
 
   {{/* Main content section — same structure as hub page */}}
   <section class="cluster-full-width clusters-display-section">
-    <div class="container">
+    <div class="wrap">
       <div class="clusters-layout">
 
         {{ partial "clusters/clusters_controls.html" . }}
@@ -64,14 +55,14 @@ <h1 class="clusters-heading-row__title clusters-site-heading" itemprop="headline
         <div class="row">
           {{ partial "clusters/sidebar_nav.html" (dict "data" $data "arrowColors" $arrowColors "link_mode" "subpath" "active_cluster_number" $n) }}
 
-          <main class="col-12 col-lg-8 col-xl-9 clusters-content">
+          <div class="col-12 col-lg-8 col-xl-9 clusters-content">
             {{ with .Content }}
             <div class="article-container pt-2 pb-2">
               <div class="article-style clusters-cluster-lead">{{ . }}</div>
             </div>
             {{ end }}
             {{ partial "clusters/cluster_section.html" (dict "cluster" $cluster "ci" $ci "colors" $colors) }}
-          </main>
+          </div>
         </div>
       </div>
 
diff --git a/layouts/clusters/single.html b/layouts/clusters/single.html
index 4ab2ccaab7e..6b4a814e6d6 100644
--- a/layouts/clusters/single.html
+++ b/layouts/clusters/single.html
@@ -2,54 +2,22 @@
 {{ define "main" }}
 
   {{ partial "clusters/seo_jsonld.html" . }}
-  <div class="universal-wrapper pt-3 pb-3">
-    <div class="container">
-
-      {{/* Clusters page header */}}
-      {{ if .Params.image }}
-      <div class="article-header d-print-none">
-        <img src="{{ .Params.image }}" alt="{{ .Params.heading_title | default .Title }}" class="article-banner" loading="lazy">
-      </div>
-      {{ end }}
-
-      <div class="article-container pt-3">
-        {{/* Hub /clusters/ only: larger H1 (cluster subpages use layout cluster, not this template) */}}
-        <h1 class="clusters-site-heading{{ if and .IsNode (eq .Section "clusters") }} clusters-hub-page__title{{ end }}" itemprop="headline">{{ .Params.heading_title | default .Title }}</h1>
-
-        {{/* Subtitle if present */}}
-        {{ if .Params.subtitle }}
-        <p class="page-subtitle">{{ .Params.subtitle | markdownify }}</p>
-        {{ end }}
-
-        {{/* Page description/metadata */}}
-        <div class="article-metadata">
-          {{ if .Params.authors }}
-            <span class="article-author-list">
-              {{ with .Params.authors }}
-                {{ delimit . ", " }}
-              {{ end }}
-            </span>
-          {{ end }}
-          {{ if .PublishDate }}
-            <span class="article-date">
-              {{ .PublishDate.Format "January 2, 2006" }}
-            </span>
-          {{ end }}
-        </div>
-      </div>
-    </div>
+  <div class="wrap clusters-head">
+    {{ partial "doors/crumbs" (dict "page" .) }}
+    <h1 class="clusters-site-heading" itemprop="headline">{{ .Params.heading_title | default .Title }}</h1>
+    {{ with .Params.subtitle }}<p class="standfirst">{{ . | markdownify }}</p>{{ end }}
   </div>
 
   {{/* CLUSTERS INTRO SECTION */}}
   <section class="clusters-intro-section">
-    <div class="container">
+    <div class="wrap">
       {{ partial "clusters/intro.html" . }}
     </div>
   </section>
 
   {{/* CLUSTERS DISPLAY SECTION - The main clusters content */}}
   <section class="cluster-full-width clusters-display-section">
-    <div class="container">
+    <div class="wrap">
       {{ partial "clusters/all_clusters.html" . }}
     </div>
   </section>
diff --git a/layouts/community-map/single.html b/layouts/community-map/single.html
new file mode 100644
index 00000000000..2b2aac2f545
--- /dev/null
+++ b/layouts/community-map/single.html
@@ -0,0 +1,3 @@
+{{- define "main" -}}
+{{ partial "doors/reading" . }}
+{{- end -}}
diff --git a/layouts/contributors_analysis/list.html b/layouts/contributors_analysis/list.html
index 0881920e4a9..2b2aac2f545 100644
--- a/layouts/contributors_analysis/list.html
+++ b/layouts/contributors_analysis/list.html
@@ -1,14 +1,3 @@
 {{- define "main" -}}
-<div style="max-width: 100%; padding: 15px; margin: 15px; font-size: 1.5rem;">
-
-{{ partial "page_header.html" . }}
-
-<div class="universal-wrapper">
-  {{ with .Content }}
-  <div class="article-style">{{ . }}</div>
-  {{ end }}
-</div>
-
-{{ partial "pagination" . }}
-</div>
+{{ partial "doors/reading" . }}
 {{- end -}}
diff --git a/layouts/contributors_analysis/single.html b/layouts/contributors_analysis/single.html
index ecaa5ed8aae..b43e0a3f7f0 100644
--- a/layouts/contributors_analysis/single.html
+++ b/layouts/contributors_analysis/single.html
@@ -1,73 +1,88 @@
 {{- define "main" -}}
-<style>
-  .universal-wrapper img {
-    display: block;
-    margin: 0 auto;
-  }
-</style>
-<div style="max-width: 100%; padding: 15px; margin: 15px;">
-
-{{ partial "page_header" . }}
-
-<article class="article">
-
-
-  <div class="universal-wrapper">
-
-        {{ .Content }}
-
-  </div>
-</article>
-
-<div class="universal-wrapper" style="margin-top: 60px;">
-  <iframe id="network-graph" src="/partials/network-graph.html" width="100%" style="border: none; overflow: hidden;" scrolling="no"></iframe>
-</div>
-
-<script>
-  (function() {
-    var iframe = document.getElementById('network-graph');
-    if (!iframe) {
-      return;
-    }
+{{/* The numbers and the network come from the two Rmd files in content/contributor-analysis.
+     Until a data run has produced the comment below, index.md only has its text and images, so
+     the page shows those in place of the charts. */}}
+{{- $data := dict -}}
+{{- with findRESubmatch `<!-- contributor-analysis-data (\{.*?\}) -->` .RawContent 1 -}}
+  {{- $data = index . 0 1 | transform.Unmarshal -}}
+{{- end -}}
+{{- $network := partial "doors/analysis/network_data.html" . -}}
+{{- $contributors := relref . "/contributors" -}}
+{{- $join := relref . "/about/get-involved" -}}
+<div class="wrap analysis-page">
+  <header class="analysis-head">
+    {{ partial "doors/crumbs" (dict "page" .) }}
+    <h1>{{ .Title }}</h1>
+    <p class="analysis-standfirst">How many people contribute to FORRT, where they work and what they do, and how shared projects connect them.</p>
+  </header>
+  {{ if $data }}
+  {{ $asOf := time.Format "2 January 2006" (time.AsTime $data.as_of) }}
+  {{ $single := index $data.projects_per_person 0 }}
+  {{ $many := index $data.projects_per_person (sub (len $data.projects_per_person) 1) }}
+  {{ $top := index $data.per_project 0 }}
+  {{ $topRole := index $data.roles 0 }}
+  <dl class="stats">
+    <div class="stat"><dt>Contributors</dt><dd>{{ lang.FormatNumberCustom 0 $data.contributors }}</dd></div>
+    <div class="stat"><dt>Projects and support teams</dt><dd>{{ $data.projects }}</dd></div>
+    <div class="stat"><dt>Mean contributions per person</dt><dd>{{ $data.mean_contributions }}</dd></div>
+    <div class="stat"><dt>Mean contributors per project</dt><dd>{{ $data.mean_contributors }}</dd></div>
+  </dl>
+  <p class="analysis-note">As of {{ $asOf }}, for completed and ongoing work. <a href="{{ $contributors }}">See every contributor and what they did</a>.</p>
 
-    function resizeIframe() {
-      if (!iframe.contentWindow) {
-        return;
-      }
-      var doc = iframe.contentDocument || iframe.contentWindow.document;
-      if (!doc || !doc.documentElement) {
-        return;
-      }
-      var newHeight = doc.documentElement.scrollHeight;
-      if (!newHeight) {
-        return;
-      }
-      var targetHeight = newHeight + 'px';
-      if (iframe.style.height !== targetHeight) {
-        iframe.style.height = targetHeight;
-      }
-    }
+  <section class="analysis-section" aria-labelledby="analysis-involvement">
+    <div class="analysis-intro">
+      <h2 id="analysis-involvement">How many projects people join</h2>
+      <p>{{ $single.percent }}% of contributors have worked on one project, and {{ $many.percent }}% on five or more.</p>
+    </div>
+    <div class="analysis-chart">
+      <div class="share-bar" aria-hidden="true">
+        {{ range $i, $part := $data.projects_per_person }}<span class="share-part share-{{ $i }}" style="flex-grow:{{ $part.n }}"></span>{{ end }}
+      </div>
+      <ul class="share-list">
+        {{ range $i, $part := $data.projects_per_person }}
+        <li><span class="share-swatch share-{{ $i }}" aria-hidden="true"></span><span class="share-label">{{ $part.label }}</span><span class="share-number">{{ $part.percent }}%</span><span class="share-people">{{ $part.n }} people</span></li>
+        {{ end }}
+      </ul>
+    </div>
+  </section>
 
-    iframe.addEventListener('load', function() {
-      resizeIframe();
+  <section class="analysis-section" aria-labelledby="analysis-projects">
+    <div class="analysis-intro">
+      <h2 id="analysis-projects">Where the most people work</h2>
+      <p>{{ $top.name }} has the most contributors, with {{ $top.n }}. The mean across all {{ $data.projects }} projects and teams is {{ $data.mean_contributors }}.</p>
+    </div>
+    <div class="analysis-chart">
+      {{ partial "doors/analysis/bars.html" (dict "rows" (first 10 $data.per_project) "max" $top.n) }}
+      <details class="analysis-more">
+        <summary>All {{ $data.projects }} projects and teams</summary>
+        {{ partial "doors/analysis/bars.html" (dict "rows" (after 10 $data.per_project) "max" $top.n) }}
+      </details>
+    </div>
+  </section>
 
-      if (!iframe._autoResizeInterval) {
-        iframe._autoResizeInterval = setInterval(function() {
-          if (!document.body.contains(iframe)) {
-            clearInterval(iframe._autoResizeInterval);
-            iframe._autoResizeInterval = null;
-            return;
-          }
-          resizeIframe();
-        }, 500);
-      }
-    });
+  <section class="analysis-section" aria-labelledby="analysis-roles">
+    <div class="analysis-intro">
+      <h2 id="analysis-roles">What contributors do</h2>
+      <p>{{ $topRole.name }} is the most common role, with {{ $topRole.n }} entries. One person can hold several roles, on one project or across many, so these add up to more than the number of contributors.</p>
+    </div>
+    <div class="analysis-chart">
+      {{ partial "doors/analysis/bars.html" (dict "rows" $data.roles "max" $topRole.n) }}
+    </div>
+  </section>
+  {{ else }}
+  <div class="analysis-summary">{{ partial "doors/content" .Content }}</div>
+  {{ end }}
 
-    window.addEventListener('resize', resizeIframe);
-  })();
-</script>
+  {{ if $network.people }}
+  {{ partial "doors/analysis/network.html" (dict "network" $network "counts" $data) }}
+  {{ else }}
+  {{ warnf "contributor-analysis: no network data in static/partials/network-graph.html" }}
+  {{ end }}
 
+  <section class="analysis-foot" aria-labelledby="analysis-method">
+    <h2 id="analysis-method">Where these numbers come from</h2>
+    <p>They come from FORRT's contributor records and are refreshed each month. People are matched by first name and surname, so one person listed under two spellings counts twice.</p>
+    <p><a href="{{ $contributors }}">See every contributor</a>, or <a href="{{ $join }}">find out how to get involved</a>.</p>
+  </section>
 </div>
-
 {{- end -}}
-      
\ No newline at end of file
diff --git a/layouts/curated_resources/single.html b/layouts/curated_resources/single.html
index 7c7e25d331d..14752a88500 100644
--- a/layouts/curated_resources/single.html
+++ b/layouts/curated_resources/single.html
@@ -1,44 +1,80 @@
 {{- define "main" -}}
-
-<article class="article">
-
-    {{ partial "resource_page_header" . }}
-
-    <div class="article-container">
-        <div class="article-container">
-
-            <!-- {{ partial "page_edit" . }} (not meaningful as mds are auto-generated)-->
-            {{ partial "tags" . }}
-            {{ if .Params.abstract }}
-            <h3>{{ i18n "abstract" }}</h3>
-            <p class="pub-abstract border-bottom">{{ .Params.abstract | markdownify }}</p>
-            {{ end }}
-            <div class="article-style">
-                {{ .Content }}
-                {{with .Params.link_to_resource }} <a href="{{ . }}">
-                    <p class="mb-1 pr-2 badge badge-light">Link to resource: {{.}}</p>
-                </a>{{end}}
-            {{ with .Params.material_type }}<p class=" mb-1 pr-2"><strong>Type of resources: </strong>{{ delimit . ", " }}</p>{{ end }}
-            {{ with .Params.education_level }}<p class=" mb-1 pr-2"><strong>Education level(s): </strong>{{ delimit . ", " }}</p>{{ end }}
-            {{ with .Params.primary_user }}<p class=" mb-1 pr-2"><strong>Primary user(s): </strong>{{ delimit . ", " }}</p>{{ end }}
-            {{ with .Params.subject_areas }}<p class=" mb-1 pr-2"><strong>Subject area(s): </strong>{{ delimit . ", " }}</p>{{ end }}
-            {{ with .Params.language }}<p class=" mb-1 pr-2"><strong>Language(s): </strong>{{ delimit . ", " }}</p>{{ end }}
-            </div>
-
-            {{ partial "share" . }}
-            {{/*  {{ partial "page_author" . }}  */}}
-            {{ partial "comments" . }}
-
-            {{ if site.Params.section_pager }}
-            <div class="article-widget">
-                {{ partial "section_pager" . }}
-            </div>
-            {{ end }}
-
-            {{ partial "page_related" . }}
-
-
-        </div>
-</article>
-
+{{/* A curated resource, on the reading layout: what it is first, then its details, then Previous and Next.
+     On a desktop the grid puts the details card in the left column; on a phone it follows the entry.
+     Pages are generated from the FORRT database sheet, so any list field can be missing. */}}
+{{ $clean := dict }}
+{{ range slice "material_type" "education_level" "primary_user" "subject_areas" "language" "creators" }}
+  {{ $values := slice }}
+  {{ range index $.Params . }}{{ if . }}{{ $values = $values | append . }}{{ end }}{{ end }}
+  {{ $clean = merge $clean (dict . $values) }}
+{{ end }}
+{{/* The type also shows above the title, so on a phone its row in the card is left out. */}}
+{{ $details := slice
+  (dict "label" "Type of resources" "values" $clean.material_type "class" "resource-type")
+  (dict "label" "Education level(s)" "values" $clean.education_level)
+  (dict "label" "Primary user(s)" "values" $clean.primary_user)
+  (dict "label" "Subject area(s)" "values" $clean.subject_areas)
+  (dict "label" "Language(s)" "values" $clean.language)
+}}
+{{/* Cluster pages by name, matched in lower case, so a cluster in the card can link to its page. */}}
+{{ $clusterPages := dict }}
+{{ range $c := site.Data.clusters_v4.clusters }}
+  {{ with site.GetPage (printf "/clusters/cluster-%d" (int $c.number)) }}{{ $clusterPages = merge $clusterPages (dict (lower $c.name) .RelPermalink) }}{{ end }}
+{{ end }}
+{{ $url := partial "doors/resource_url" . }}
+{{/* Where the button goes: the link's host without "www.", and doi.org for any DOI resolver. */}}
+{{ $host := "" }}
+{{ with $url }}
+  {{ $host = lower (urls.Parse .).Hostname | strings.TrimPrefix "www." }}
+  {{ if eq $host "dx.doi.org" }}{{ $host = "doi.org" }}{{ end }}
+{{ end }}
+{{/* Long creator lists show the first six names and keep the rest behind a disclosure, so the button stays in view. */}}
+{{ $shown := 6 }}
+<div class="wrap">
+  <div class="article-layout article-layout-resource">
+    <article class="reading">
+      <header class="article-head">
+        <nav class="crumbs" aria-label="Breadcrumb"><a href="{{ "" | relLangURL }}">Home</a> <span aria-hidden="true">/</span> <a href="{{ relref . "/resources" }}">Resources</a> <span aria-hidden="true">/</span> <span aria-current="page">{{ .Title }}</span></nav>
+        {{ with $clean.material_type }}<p class="resource-kind">{{ delimit . ", " }}</p>{{ end }}
+        <h1>{{ .Title }}</h1>
+        {{ with .Params.subtitle }}<p class="standfirst">{{ . | markdownify | emojify }}</p>{{ end }}
+        {{ with $clean.creators }}
+        <div class="byline"><div class="byline-authors">
+          {{- if gt (len .) (add $shown 1) -}}
+          By {{ delimit (first $shown .) ", " }}
+          <details class="byline-more"><summary>and {{ sub (len .) $shown }} more</summary><p>{{ delimit (after $shown .) ", " }}</p></details>
+          {{- else -}}
+          By {{ delimit . ", " }}
+          {{- end -}}
+        </div></div>
+        {{ end }}
+      </header>
+      {{ with $url }}
+      <p class="resource-open"><a class="btn btn-primary" href="{{ . }}"{{ with $host }} aria-describedby="resource-host"{{ end }}>Open this resource{{ if and $host (ne $host "forrt.org") }} <i class="fas fa-external-link-alt" aria-hidden="true"></i>{{ end }}</a>{{ with $host }} <span class="resource-host" id="resource-host">{{ . }}</span>{{ end }}</p>
+      {{ end }}
+      <div class="article-style">
+        {{ with .Params.abstract }}<h2>{{ i18n "abstract" }}</h2>{{ $.RenderString (dict "display" "block") . }}{{ end }}
+        {{ partial "doors/content" .Content }}
+      </div>
+      {{ partial "doors/resource_keywords" . }}
+    </article>
+    <section class="article-card" aria-label="About this resource">
+      <h2>About this resource</h2>
+      <dl>
+        {{ range $details }}{{ if .values }}<dt{{ with .class }} class="{{ . }}"{{ end }}>{{ .label }}</dt><dd{{ with .class }} class="{{ . }}"{{ end }}>{{ delimit .values ", " }}</dd>{{ end }}{{ end }}
+        {{/* The clusters the directory filters by, from forrt_clusters_new; none when that is empty. */}}
+        {{ with index (partialCached "doors/resource_index" (site.GetPage "/resources") "resources").items .RelPermalink }}{{ with .clusters }}
+          {{ $names := slice }}
+          {{ range $name := . }}{{ with index $clusterPages (lower $name) }}{{ $names = $names | append (printf `<a href="%s">%s</a>` . ($name | htmlEscape)) }}{{ else }}{{ $names = $names | append ($name | htmlEscape) }}{{ end }}{{ end }}
+          <dt>Cluster</dt><dd>{{ delimit $names ", " | safeHTML }}</dd>
+        {{ end }}{{ end }}
+        <dt>Last updated</dt><dd>{{ .Lastmod.Format "2 January 2006" }}</dd>
+      </dl>
+    </section>
+    <div class="article-foot">
+      {{ if site.Params.section_pager }}<div class="article-widget">{{ partial "section_pager" . }}</div>{{ end }}
+      {{ partial "page_related" . }}
+    </div>
+  </div>
+</div>
 {{- end -}}
diff --git a/layouts/disciplines/single.html b/layouts/disciplines/single.html
index 92b5aa09055..4598f23c877 100644
--- a/layouts/disciplines/single.html
+++ b/layouts/disciplines/single.html
@@ -2,36 +2,22 @@
 {{ define "main" }}
 
   {{ partial "disciplines/seo_jsonld.html" . }}
-  <div class="universal-wrapper pt-3 pb-3">
-    <div class="container">
-
-      {{/* Page header */}}
-      {{ if .Params.image }}
-      <div class="article-header d-print-none">
-        <img src="{{ .Params.image }}" alt="{{ .Params.heading_title | default .Title }}" class="article-banner" loading="lazy">
-      </div>
-      {{ end }}
-
-      <div class="article-container pt-3">
-        <h1 class="clusters-site-heading clusters-hub-page__title" itemprop="headline">{{ .Params.heading_title | default .Title }}</h1>
-
-        {{ if .Params.subtitle }}
-        <p class="page-subtitle">{{ .Params.subtitle | markdownify }}</p>
-        {{ end }}
-      </div>
-    </div>
+  <div class="wrap clusters-head">
+    {{ partial "doors/crumbs" (dict "page" .) }}
+    <h1 class="clusters-site-heading" itemprop="headline">{{ .Params.heading_title | default .Title }}</h1>
+    {{ with .Params.subtitle }}<p class="standfirst">{{ . | markdownify }}</p>{{ end }}
   </div>
 
   {{/* INTRO SECTION */}}
   <section class="clusters-intro-section">
-    <div class="container">
+    <div class="wrap">
       {{ partial "disciplines/intro.html" . }}
     </div>
   </section>
 
   {{/* DISCIPLINES DISPLAY SECTION */}}
   <section class="cluster-full-width clusters-display-section">
-    <div class="container">
+    <div class="wrap">
       {{ partial "disciplines/all_fields.html" . }}
       {{ partial "disciplines/citation.html" . }}
     </div>
diff --git a/layouts/glossary/list.html b/layouts/glossary/list.html
index 2d3080c526f..30dc1c9b910 100644
--- a/layouts/glossary/list.html
+++ b/layouts/glossary/list.html
@@ -1,80 +1,86 @@
 {{- define "main" -}}
-
-<style>
-  .glossary-toc {
-    order: 99;
-  }
-  @media (min-width: 1200px) {
-    .glossary-toc {
-      order: -1;
-    }
-  }
-</style>
-
-<script>
-  document.addEventListener("DOMContentLoaded", function() {
-    const searchInput = document.getElementById('glossary-search');
-    if (searchInput) {
-      searchInput.addEventListener('input', function() {
-        const query = this.value.toLowerCase();
-        document.querySelectorAll('#TableOfContents .nav-item').forEach(function(item) {
-          const link = item.querySelector('.nav-link');
-          const text = link ? link.textContent.toLowerCase() : '';
-          item.style.display = text.includes(query) ? '' : 'none';
-        });
-      });
-    }
-  });
-</script>
-
-<div class="container-fluid docs">
-  <div class="row flex-xl-nowrap">
-    <div class="col-12 col-xl-3 docs-toc glossary-toc">
-      <ul class="nav toc-top">
-        <li><a href="#" id="back_to_top" class="docs-toc-title">List of terms</a></li>
-      </ul>
-
-      <input type="text" id="glossary-search" class="form-control form-control-sm mb-2"
-             placeholder="Filter terms..."
-             aria-label="Filter terms">
-
-      <nav id="TableOfContents" class="nav flex-column">
-        <ul>
-          {{ $currentSection := .File.Dir }}
-          {{ $glossaryPages := where .Site.RegularPages "Type" "glossary" }}
-          {{ $filteredPages := where $glossaryPages "File.Dir" $currentSection }}
-          {{ $sortedPages := sort $filteredPages "Params.sort_key" }}
-          {{ range $index, $page := $sortedPages }}
-          <li class="nav-item">
-            <a href="{{ .Permalink }}" class="nav-link">{{ .Title }}</a>
-          </li>
-          {{ end }}
-        </ul>
+{{/* A glossary's hub, one per language: the terms are the page. Languages and a search come first, then every
+     term with the start of its definition, A to Z, and the project's history and citation in a disclosure.
+     site.js filters the terms as the search is typed. */}}
+{{ $lang := .Params.language | default "english" }}
+{{ $labels := dict
+  "english" (dict "view" "View" "cards" "Cards" "list" "List" "language" "Language" "clear" "Clear" "lede" "Community-written definitions of open scholarship terms, described in Nature Human Behaviour (Parsons et al., 2022). [How to cite the glossary](#about-the-glossary)." "search" "Search %d terms" "placeholder" "Type a term, e.g. replication" "about" "About the glossary project, and how to cite it" "letters" "Terms by letter" "none" "No term matches.")
+  "german" (dict "view" "Ansicht" "cards" "Karten" "list" "Liste" "language" "Sprache" "clear" "Löschen" "search" "%d Begriffe durchsuchen" "placeholder" "Begriff eingeben, z. B. Replikation" "about" "Über das Glossar und wie man es zitiert" "letters" "Begriffe nach Buchstaben" "none" "Kein Begriff passt.")
+  "arabic" (dict "view" "العرض" "cards" "بطاقات" "list" "قائمة" "language" "اللغة" "clear" "مسح" "search" "ابحث في %d مصطلحًا" "placeholder" "اكتب مصطلحًا" "about" "عن المسرد وكيفية الاستشهاد به" "letters" "المصطلحات حسب الحرف" "updated" "آخر تحديث:" "none" "لا يوجد مصطلح مطابق.")
+  "turkish" (dict "view" "Görünüm" "cards" "Kartlar" "list" "Liste" "language" "Dil" "clear" "Temizle" "search" "%d terimde ara" "placeholder" "Bir terim yazın" "about" "Sözlük hakkında ve nasıl atıf yapılır" "letters" "Harfe göre terimler" "none" "Eşleşen terim yok.")
+  "chinese" (dict "view" "显示方式" "cards" "卡片" "list" "列表" "language" "语言" "clear" "清除" "search" "搜索 %d 个术语" "placeholder" "输入术语" "about" "关于本术语表及引用方式" "letters" "按字母排列的术语" "none" "没有匹配的术语。") }}
+{{ $l := index $labels $lang | default (index $labels "english") }}
+{{ $pages := sort (where (where site.RegularPages "Type" "glossary") "File.Dir" .File.Dir) "Params.sort_key" }}
+{{/* Hugo's sort already collates Ä with A. German also files them under one letter (DIN 5007); other languages keep
+     their own letters: in Turkish, Ç, Ö and Ü are letters of their own. */}}
+{{ $groups := slice }}{{ $current := "" }}{{ $items := slice }}
+{{ range $pages }}
+  {{ $first := upper (substr (strings.TrimLeft "\"“”'*[(_ " (.Params.sort_key | default .Title)) 0 1) }}
+  {{ if eq $lang "german" }}{{ $first = $first | replaceRE "Ä" "A" | replaceRE "Ö" "O" | replaceRE "Ü" "U" }}{{ end }}
+  {{ if not (findRE `^\p{L}$` $first) }}{{ $first = "#" }}{{ end }}
+  {{ if ne $first $current }}
+    {{ if $items }}{{ $groups = $groups | append (dict "letter" $current "pages" $items) }}{{ end }}
+    {{ $current = $first }}{{ $items = slice }}
+  {{ end }}
+  {{ $items = $items | append . }}
+{{ end }}
+{{ if $items }}{{ $groups = $groups | append (dict "letter" $current "pages" $items) }}{{ end }}
+<div class="wrap">
+  <div class="article-layout article-layout-single article-layout-wide glossary-layout glossary-hub">
+    <article class="reading">
+      <header class="article-head">
+        {{ partial "doors/crumbs" (dict "page" .) }}
+        <h1>{{ .Title }}</h1>
+        {{/* The lede lives here, not in the _index.md pages: data-processing.yml ships content/glossary/ from main,
+             so an edit there would not reach the site. */}}
+        {{ with $l.lede }}<p class="standfirst">{{ . | markdownify }}</p>{{ end }}
+        {{/* On a phone a menu replaces the row of languages, which would not fit. */}}
+        <label class="glossary-language-select">{{ $l.language }}
+          <select onchange="location.assign(this.value)">
+            {{ range hugo.Data.glossary_languages }}<option value="{{ printf "/glossary/%s/" .slug | relLangURL }}"{{ if eq .slug $lang }} selected{{ end }}>{{ trim .label " " }}</option>{{ end }}
+          </select>
+        </label>
+        <nav class="glossary-languages" aria-label="Languages">
+          {{ range hugo.Data.glossary_languages }}<a href="{{ printf "/glossary/%s/" .slug | relLangURL }}"{{ if eq .slug $lang }} aria-current="page"{{ end }}>{{ trim .label " " }}</a>{{ end }}
+        </nav>
+      </header>
+      {{/* The project's introduction, history and citation, closed under the heading so the terms come soon. */}}
+      <details class="glossary-about" id="about-the-glossary">
+        <summary>{{ $l.about }}</summary>
+        <div class="article-style">{{ partial "doors/content" .Content }}</div>
+      </details>
+      {{/* The search, its count and the letters stay at the top while the terms scroll by. */}}
+      <div class="glossary-tools">
+      <div class="glossary-find">
+        <label for="glossary-search">{{ printf $l.search (len $pages) }}</label>
+        <div class="glossary-search-row"><input type="search" id="glossary-search" placeholder="{{ $l.placeholder }}" autocomplete="off"><button type="button" class="glossary-clear" hidden>{{ $l.clear }}</button><span class="glossary-view" role="group" aria-label="{{ $l.view }}" hidden><button type="button" data-view="cards" aria-pressed="true">{{ $l.cards }}</button><button type="button" data-view="list" aria-pressed="false">{{ $l.list }}</button></span></div>
+        <p class="glossary-none" hidden>{{ $l.none }}</p>
+        <p class="glossary-count" aria-live="polite"></p>
+      </div>
+      <nav class="glossary-letters" aria-label="{{ $l.letters }}">
+        {{ range $groups }}<a href="#letter-{{ .letter | urlize | default "other" }}">{{ .letter }}</a>{{ end }}
       </nav>
-    </div>
-
-    <main class="col-12 col-xl-8 pl-md-5 docs-content" role="main">
-      <article class="article">
-        <div class="docs-article-container mx-auto">
-          <h1>{{ .Title }}</h1>
-          <div class="article-style">
-            {{ .Content }}
-          </div>
-          {{ partial "tags.html" . }}
-          {{ if site.Params.docs_section_pager }}
-          <div class="article-widget">
-            {{ partial "section_pager" . }}
-          </div>
-          {{ end }}
-        </div>
-        <div class="body-footer">
-          <p>{{ i18n "last_updated" }} {{ $.Lastmod.Format site.Params.date_format }}</p>
-          {{ partial "page_edit" . }}
-        </div>
-      </article>
-
-    </main>
+      </div>
+      <div class="term-grid">
+        {{ range $groups }}
+        <section class="term-group" id="letter-{{ .letter | urlize | default "other" }}">
+          <h2>{{ .letter }}</h2>
+          <ul>
+            {{ range .pages }}
+            <li data-term="{{ .Title | plainify | lower }}">
+              <a href="{{ .RelPermalink }}">{{ partial "doors/term_title" .Title }}</a>
+              {{ with .Params.definition }}<p>{{ . | markdownify | plainify | htmlUnescape | replaceRE `\*\*|__` "" | truncate 150 }}</p>{{ end }}
+            </li>
+            {{ end }}
+          </ul>
+        </section>
+        {{ end }}
+      </div>
+      <div class="article-foot">
+        {{/* An Arabic page gives the date in digits, isolated, so no English month name sits in the Arabic line. */}}
+        <p>{{ with $l.updated }}{{ . }} <bdi>{{ $.Lastmod.Format "2006-01-02" }}</bdi>{{ else }}{{ i18n "last_updated" }} {{ $.Lastmod.Format site.Params.date_format }}{{ end }}</p>
+      </div>
+    </article>
   </div>
 </div>
-
 {{- end -}}
diff --git a/layouts/glossary/single.html b/layouts/glossary/single.html
index 71149dbd8c8..596bb726d36 100644
--- a/layouts/glossary/single.html
+++ b/layouts/glossary/single.html
@@ -1,6 +1,7 @@
 {{- define "main" -}}
 
 {{ $lang := .Params.language | default "english" }}
+{{ $references_url := relref . "/glossary/references" }}
 {{ $dictionary := dict
     "english" (dict
         "list_of_terms" "List of terms"
@@ -13,7 +14,7 @@
         "reviewed_by" "Reviewed by"
         "translated_by" "Translated by"
         "translation_reviewed_by" "Translation reviewed by"
-        "note" "We are currently working to link the references directly. For now, the complete reference list can be viewed <a href='https://forrt.org/glossary/references'>here</a>."
+        "note" (printf "We are currently working to link the references directly. For now, the complete reference list can be viewed <a href='%s'>here</a>." $references_url)
         "reference" "Reference"
         "references" "References"
     )
@@ -28,7 +29,7 @@
         "reviewed_by" "Überprüft von"
         "translated_by" "Übersetzt von"
         "translation_reviewed_by" "Übersetzung überprüft von"
-        "note" "Wir arbeiten momentan daran, die Referenzen direkt zu verlinken. Momentan kann hier die <a href = 'https://forrt.org/glossary/references'>vollständige Referenzliste</a> eingesehen werden."
+        "note" (printf "Wir arbeiten momentan daran, die Referenzen direkt zu verlinken. Momentan kann hier die <a href = '%s'>vollständige Referenzliste</a> eingesehen werden." $references_url)
         "reference" "Referenz"
         "references" "Referenzen"
     )
@@ -43,9 +44,15 @@
         "reviewed_by" "راجعه"
         "translated_by" "ترجمه"
         "translation_reviewed_by" "راجع ترجمته"
-        "note" "نحن نعمل حاليًا على آلية تلقائية لربط المراجع المذكورة أعلاه بنسختها الكاملة التي يمكن العثور عليها في <a href='https://forrt.org/glossary/references'>قائمة المراجع الكاملة</a>."
+        "note" (printf "نحن نعمل حاليًا على آلية تلقائية لربط المراجع المذكورة أعلاه بنسختها الكاملة التي يمكن العثور عليها في <a href='%s'>قائمة المراجع الكاملة</a>." $references_url)
         "reference" "مرجع"
         "references" "مراجع"
+        "home" "الرئيسية"
+        "breadcrumb" "مسار التنقل"
+        "glossary" "المسرد"
+        "also_available_in" "اللغات الأخرى"
+        "languages" (dict "arabic" "العربية" "chinese" "الصينية" "english" "الإنجليزية" "german" "الألمانية" "turkish" "التركية")
+        "separator" "، "
     )
     "turkish" (dict
         "list_of_terms" "Terimler listesi"
@@ -58,7 +65,7 @@
         "reviewed_by" "Gözden geçirenler"
         "translated_by" "Çevirenler"
         "translation_reviewed_by" "Çeviriyi gözden geçirenler"
-        "note" "Kaynakları doğrudan ilişkilendirmek için çalışmalarımız devam etmektedir. Şimdilik kaynakların tam listesine <a href='https://forrt.org/glossary/references'>buraya tıklayarak</a> ulaşabilirsiniz."
+        "note" (printf "Kaynakları doğrudan ilişkilendirmek için çalışmalarımız devam etmektedir. Şimdilik kaynakların tam listesine <a href='%s'>buraya tıklayarak</a> ulaşabilirsiniz." $references_url)
         "reference" "Kaynak"
         "references" "Kaynakça"
     )
@@ -73,116 +80,23 @@
         "reviewed_by" "审阅者"
         "translated_by" "翻译者"
         "translation_reviewed_by" "译稿审阅者"
-        "note" "我们正在努力将参考文献直接链接起来。目前，完整的参考文献列表可在<a href='https://forrt.org/glossary/references'>此处</a>查看。"
+        "note" (printf "我们正在努力将参考文献直接链接起来。目前，完整的参考文献列表可在<a href='%s'>此处</a>查看。" $references_url)
         "reference" "参考文献"
         "references" "参考文献"
     )
 }}
 
-<style>
-  .nav-link.active {
-    font-weight: bold;
-    color: #007bff;
-  }
-
-  .language-switcher {
-    margin-top: 20px;
-  }
-
-  .language-switcher ul {
-    list-style: disc;
-    margin-left: 20px;
-    padding-left: 0;
-  }
-
-  .language-switcher li {
-    margin-bottom: 5px;
-  }
-
-  .language-switcher a {
-    text-decoration: none;
-    color: #007bff;
-    font-weight: bold;
-  }
-
-  .language-switcher a:hover {
-    text-decoration: underline;
-  }
-
-  .glossary-toc {
-    order: 99;
-  }
-
-  @media (min-width: 1200px) {
-    .glossary-toc {
-      order: -1;
-    }
-  }
-
-</style>
-
-
-<script>
-  document.addEventListener("DOMContentLoaded", function() {
-    const tocLinks = document.querySelectorAll("#TableOfContents .nav-link");
-    const currentUrl = window.location.href;
-
-    tocLinks.forEach(link => {
-      if (link.href === currentUrl) {
-        link.classList.add("active");
-        if (window.innerWidth >= 1200) {
-          link.scrollIntoView({ behavior: 'auto', block: 'start' });
-          window.scrollBy(0, -document.querySelector('.docs-toc').offsetHeight);
-        }
-      }
-    });
-
-    const searchInput = document.getElementById('glossary-search');
-    if (searchInput) {
-      searchInput.addEventListener('input', function() {
-        const query = this.value.toLowerCase();
-        document.querySelectorAll('#TableOfContents .nav-item').forEach(function(item) {
-          const link = item.querySelector('.nav-link');
-          const text = link ? link.textContent.toLowerCase() : '';
-          item.style.display = text.includes(query) ? '' : 'none';
-        });
-      });
-    }
-  });
-</script>
-
-
-<div class="container-fluid docs">
-  <div class="row flex-xl-nowrap">
-    <div class="col-12 col-xl-3 docs-toc glossary-toc">
-      <ul class="nav toc-top">
-        <li><a href="#" id="back_to_top" class="docs-toc-title">{{ index (index $dictionary $lang) "list_of_terms" }}</a></li>
-      </ul>
-
-      <input type="text" id="glossary-search" class="form-control form-control-sm mb-2"
-             placeholder="{{ index (index $dictionary $lang) "filter_terms" }}"
-             aria-label="{{ index (index $dictionary $lang) "filter_terms" }}">
-
-      <nav id="TableOfContents" class="nav flex-column">
-        <ul>
-          {{ $currentSection := .File.Dir }}
-          {{ $glossaryPages := where .Site.RegularPages "Type" "glossary" }}
-          {{ $filteredPages := where $glossaryPages "File.Dir" $currentSection }}
-          {{ $withDefinition := where $filteredPages "Params.definition" "!=" nil }}
-          {{ $sortedPages := sort $withDefinition "Params.sort_key" }}
-          {{ range $index, $page := $sortedPages }}
-          <li class="nav-item">
-            <a href="{{ .Permalink }}" class="nav-link">{{ .Title }}</a>
-          </li>
-          {{ end }}
-        </ul>
-      </nav>
-    </div>
-
-    <main class="col-12 col-xl-8 pl-md-5 docs-content" role="main">
-      <article class="article"{{ if eq $lang "arabic" }} dir="rtl" style="text-align: right;"{{ end }}>
-        <div class="docs-article-container mx-auto">
-          {{ partial "resource_page_header" . }}
+{{ $dict := index $dictionary $lang }}
+{{ $sep := $dict.separator | default ", " }}
+<div class="wrap">
+  {{ $hasTerms := where (where (where site.RegularPages "Type" "glossary") "File.Dir" .File.Dir) "Params.definition" "!=" nil }}
+  <div class="article-layout glossary-layout{{ if not $hasTerms }} article-layout-single{{ end }}">
+    {{ if $hasTerms }}{{ partial "doors/glossary_terms" (dict "page" . "labels" $dict "defined_only" true) }}{{ end }}
+    <article class="reading">
+      <header class="article-head">
+        <nav class="crumbs" aria-label="{{ $dict.breadcrumb | default "Breadcrumb" }}"><a href="{{ "" | relLangURL }}">{{ $dict.home | default "Home" }}</a> <span aria-hidden="true">/</span> {{ with .Parent }}<a href="{{ .RelPermalink | default (printf "/%s/" (strings.Trim .Path "/") | relLangURL) }}">{{ $dict.glossary | default .Title }}</a> <span aria-hidden="true">/</span> {{ end }}<span aria-current="page">{{ partial "doors/term_title" .Title }}</span></nav>
+        <h1{{ if gt (strings.RuneCount .Title) 60 }} class="long-title"{{ end }}>{{ partial "doors/term_title" .Title }}</h1>
+      </header>
 
 <div class="language-switcher">
   {{ $currentLang := .Params.language | default "english" }}
@@ -241,55 +155,69 @@
   {{ end }}
 
   {{ if gt (len $availableLanguages) 0 }}
-    <strong>Also available in: </strong>
+    <strong>{{ $dict.also_available_in | default "Also available in" }}:</strong>
     {{ range $index, $item := $availableLanguages }}
-      <a href="{{ $item.page.RelPermalink }}">{{ $item.lang | title }}</a>{{ if lt $index (sub (len $availableLanguages) 1) }} | {{ end }}
+      <a href="{{ $item.page.RelPermalink }}">{{ with $dict.languages }}{{ index . $item.lang }}{{ else }}{{ $item.lang | title }}{{ end }}</a>
     {{ end }}
-    <br /> &nbsp;
   {{ end }}
+  {{/* On a phone the list of terms follows the whole entry, so the top of the page links to it. */}}
+  {{ if $hasTerms }}<a class="term-list-jump" href="#glossary-terms">{{ $dict.list_of_terms }} ↓</a>{{ end }}
 </div>
 
 
-          {{ with .Params.definition }}
-          <p class="pub-abstract border-bottom pb-1"><b>{{ index (index $dictionary $lang) "definition" }}: </b>{{ . | markdownify }}</p>
-          {{ end }}
+      <div class="article-style">
+        {{ with .Params.definition }}
+        <div class="term-definition"><p class="term-definition-label">{{ index $dict "definition" }}</p><p>{{ . | markdownify }}</p></div>
+        {{ end }}
 
-          <div class="article-style">
-            {{ .Content }}
+            {{ partial "doors/content" .Content }}
             {{ with .Params.alt_definition }}
-            <p class="mb-1 pr-2"><b>{{ index (index $dictionary $lang) "alt_definition" }}: </b>{{ . | markdownify }}</p>
+            <p class="term-line term-alt-definition"><b>{{ index (index $dictionary $lang) "alt_definition" }}: </b>{{ . | markdownify }}</p>
             {{ end }}
 
             {{ with .Params.related_terms }}
-            {{ $related_links := slice }}
-            {{ range $index, $term := . }}
-            {{ $term_str := printf "%s" $term }} <!-- Ensure $term is treated as a string -->
-            {{ $term_clean := replace $term_str "\u00a0" " " }} <!-- Replace non-breaking space with space -->
-            {{ $term_clean = replaceRE "\\s*\\(.*\\)" "" $term_clean }} <!-- Remove text in parentheses -->
-            {{ $term_clean = replace $term_clean " " "_" }} <!-- Replace spaces with underscores -->
-            {{ $term_clean = replaceRE "[^a-zA-Z0-9_]" "_" $term_clean }} <!-- Replace all non-alphanumeric characters with underscores -->
-            {{ $term_clean = lower $term_clean }} <!-- Convert to lowercase -->
-            {{ $term_clean = trim $term_clean "_" }} <!-- Trim leading and trailing underscores -->
-            {{ $term_page := site.GetPage (printf "/glossary/%s/%s" $lang $term_clean) }}
-            {{ if not $term_page }}
-              {{ $term_page = site.GetPage (printf "/glossary/english/%s" $term_clean) }}
+            {{/* Related terms link to their pages, found by title: this language's terms first, then English;
+                 a translated term is also found by the English name in its brackets. A name is matched in full first, so
+                 "Model (philosophy)" and "Model (statistical)" stay apart, then without its bracketed qualifier. */}}
+            {{ $index := dict }}{{ $exact := dict }}
+            {{ range slice "english" $lang }}
+              {{ range where (where site.RegularPages "Type" "glossary") "File.Dir" (printf "glossary/%s/" .) }}
+                {{ $page := . }}
+                {{ $names := slice .Title }}
+                {{ with findRESubmatch `\[(.*)\]\s*$` .Title 1 }}{{ $names = $names | append (index (index . 0) 1) }}{{ end }}
+                {{ range $names }}
+                  {{ $key := . | replaceRE `[*\\]` "" | replaceRE `\s*\(.*?\)` "" | replaceRE `\s*\[.*\]\s*$` "" | lower | replaceRE `[^\p{L}\p{N}]+` "" }}
+                  {{ if $key }}{{ $index = merge $index (dict $key $page) }}{{ end }}
+                  {{ $full := . | replaceRE `[*\\]` "" | replaceRE `\s*\[.*\]\s*$` "" | lower | replaceRE `[^\p{L}\p{N}]+` "" }}
+                  {{ if $full }}{{ $exact = merge $exact (dict $full $page) }}{{ end }}
+                {{ end }}
+              {{ end }}
             {{ end }}
-            {{ if $term_page }}
-            {{ $term_url := $term_page.RelPermalink }}
-            {{ $related_links = $related_links | append (printf "<a href='%s'>%s</a>" $term_url $term) }}
+            {{ $related_links := slice }}
+            {{ range . }}
+            {{ $term_str := printf "%s" . }}
+            {{ $key := $term_str | replaceRE "\u00a0" " " | replaceRE `[*\\]` "" | replaceRE `\s*\(.*?\)` "" | lower | replaceRE `[^\p{L}\p{N}]+` "" }}
+            {{ $full := $term_str | replaceRE "\u00a0" " " | replaceRE `[*\\]` "" | lower | replaceRE `[^\p{L}\p{N}]+` "" }}
+            {{ with or (index $exact $full) (index $index $key) }}
+            {{/* A term found in this language is named as its page is, without the English name in brackets. */}}
+            {{ $name := $term_str }}
+            {{ if and (ne $lang "english") (eq .Params.language $lang) }}{{ $name = replaceRE `\s*\[.*\]\s*$` "" .Title }}{{ end }}
+            {{ $related_links = $related_links | append (printf "<a href='%s'>%s</a>" .RelPermalink ($name | htmlEscape | markdownify)) }}
             {{ else }}
-            {{ $related_links = $related_links | append $term }}
+            {{/* No page of its own yet: a plain chip. */}}
+            {{ $related_links = $related_links | append (printf "<span class='term-unlinked'>%s</span>" ($term_str | htmlEscape | markdownify | string)) }}
             {{ end }}
             {{ end }}
-            {{ $related_links_string := delimit $related_links ", " | safeHTML }}
-            <p class="mb-1 pr-2"><strong>{{ if gt (len $related_links) 1 }}{{ index (index $dictionary $lang) "related_terms" }}{{ else }}{{ index (index $dictionary $lang) "related_term" }}{{ end }}: </strong>{{ $related_links_string }}</p>
+            {{/* A plain list in the page's own separator: the page already has enough pill shapes. */}}
+            {{ $related_links_string := delimit $related_links $sep | safeHTML }}
+            <p class="term-line term-related"><strong>{{ if gt (len $related_links) 1 }}{{ index (index $dictionary $lang) "related_terms" }}{{ else }}{{ index (index $dictionary $lang) "related_term" }}{{ end }}: </strong>{{ $related_links_string }}</p>
             {{ end }}
 
             {{ if .Params.alt_related_terms }}
             {{ $alt_related_terms := delimit .Params.alt_related_terms ", " | len }}
             {{ if ne $alt_related_terms 0 }}
             {{ with .Params.alt_related_terms }}
-            <p class="mb-1 pr-2"><strong>{{ if gt (len .) 1 }}{{ index (index $dictionary $lang) "related_terms" }}{{ else }}{{ index (index $dictionary $lang) "related_term" }}{{ end }} to alternative definition: </strong>
+            <p class="term-line"><strong>{{ if gt (len .) 1 }}{{ index (index $dictionary $lang) "related_terms" }}{{ else }}{{ index (index $dictionary $lang) "related_term" }}{{ end }} to alternative definition: </strong>
               {{ delimit (apply (apply (sort .) "partial" "glossary_link" ".") "chomp" ".") ", " }}
             </p>
             {{- end -}}
@@ -299,10 +227,12 @@
             {{ if .Params.references }}
               {{ $references := delimit .Params.references ", " | len }}
               {{ if ne $references 0 }}
-                <p class="mb-1 pr-2"><b>{{ if gt (len .Params.references) 1 }}{{ index (index $dictionary $lang) "references" }}{{ else }}{{ index (index $dictionary $lang) "reference" }}{{ end }}: </b></p>
+                <p class="term-line"><b>{{ if gt (len .Params.references) 1 }}{{ index (index $dictionary $lang) "references" }}{{ else }}{{ index (index $dictionary $lang) "reference" }}{{ end }}: </b></p>
                 <ul class="references-list">
+                  {{ $keys := partialCached "citations/keys" . "bibliography-keys" }}
                   {{ range .Params.references }}
-                    <li>{{ . | markdownify }}</li>
+                    {{ $key := index $keys . | default (printf "local-%s" (md5 .)) }}
+                    {{ partial "citations/entry" (dict "key" $key "apa" .) }}
                   {{ end }}
                 </ul>
               {{ end }}
@@ -311,45 +241,38 @@
             {{ if .Params.drafted_by }}
             {{ $drafted_by := delimit .Params.drafted_by ", " | len }}
             {{ if ne $drafted_by 0 }}
-            <p class="mb-1 pr-2"><b>{{ index (index $dictionary $lang) "originally_drafted_by" }}: </b>{{ delimit .Params.drafted_by ", " }}</p>
+            <p class="term-line term-credit"><b>{{ index (index $dictionary $lang) "originally_drafted_by" }}: </b>{{ partial "doors/name_list" (dict "names" .Params.drafted_by "sep" $sep) }}</p>
             {{ end }}
             {{ end }}
 
             {{ if .Params.reviewed_by }}
             {{ $reviewed_by := delimit .Params.reviewed_by ", " | len }}
             {{ if ne $reviewed_by 0 }}
-            <p class="mb-1 pr-2"><b>{{ index (index $dictionary $lang) "reviewed_by" }}: </b>{{ delimit .Params.reviewed_by ", " | markdownify }}</p>
+            <p class="term-line term-credit"><b>{{ index (index $dictionary $lang) "reviewed_by" }}: </b>{{ partial "doors/name_list" (dict "names" .Params.reviewed_by "sep" $sep) }}</p>
             {{ end }}
             {{ end }}
 
             {{ if .Params.translated_by }}
             {{ $translated_by := delimit .Params.translated_by ", " | len }}
             {{ if ne $translated_by 0 }}
-            <p class="mb-1 pr-2"><b>{{ index (index $dictionary $lang) "translated_by" }}: </b>{{ delimit .Params.translated_by ", " }}</p>
+            <p class="term-line term-credit"><b>{{ index (index $dictionary $lang) "translated_by" }}: </b>{{ partial "doors/name_list" (dict "names" .Params.translated_by "sep" $sep) }}</p>
             {{ end }}
             {{ end }}
 
             {{ if .Params.translation_reviewed_by }}
             {{ $translation_reviewed_by := delimit .Params.translation_reviewed_by ", " | len }}
             {{ if ne $translation_reviewed_by 0 }}
-            <p class="mb-1 pr-2"><b>{{ index (index $dictionary $lang) "translation_reviewed_by" }}: </b>{{ delimit .Params.translation_reviewed_by ", " }}</p>
+            <p class="term-line term-credit"><b>{{ index (index $dictionary $lang) "translation_reviewed_by" }}: </b>{{ partial "doors/name_list" (dict "names" .Params.translation_reviewed_by "sep" $sep) }}</p>
             {{ end }}
             {{ end }}
 
             {{ partial "glossary_feedback_form" . }}
 
-            {{ if ne .Params.docs_section_pager false }}
-            {{ if site.Params.docs_section_pager }}
-            <div class="article-widget">
-              {{ partial "section_pager" . }}
-            </div>
-            {{ end }}
-            {{ end }}
-          </div>
-        </div>
-      </article>
-
-    </main>
+      </div>
+      <div class="article-foot">
+        {{ if and site.Params.docs_section_pager (ne .Params.docs_section_pager false) }}{{ partial "section_pager" . }}{{ end }}
+      </div>
+    </article>
   </div>
 </div>
 
diff --git a/layouts/index.html b/layouts/index.html
new file mode 100644
index 00000000000..86753f10002
--- /dev/null
+++ b/layouts/index.html
@@ -0,0 +1,8 @@
+{{- define "main" -}}
+{{/* The home page's sections come from the files in content/home/, in order of weight. */}}
+{{ $home := site.GetPage "/home/index.md" }}
+{{ range sort (where ($home.Resources.ByType "page") ".Params.active" "!=" false) "Params.weight" }}
+  {{ partial (printf "doors/home/%s" .Params.section) . }}
+{{ end }}
+{{ partial "doors/home/scripts" . }}
+{{- end -}}
diff --git a/layouts/newsletters/single.html b/layouts/newsletters/single.html
index a4a2d390bbc..39c695ccba6 100644
--- a/layouts/newsletters/single.html
+++ b/layouts/newsletters/single.html
@@ -42,18 +42,21 @@
   {{- end -}}
 {{- end }}
 
-<article class="article nla-page">
-  {{ partial "page_header" . }}
-
-  <div class="article-container nla-container">
+<div class="wrap">
+<article class="nla-page">
+  <header class="article-head">
+    {{ partial "doors/crumbs" (dict "page" .) }}
+    <h1>{{ .Title }}</h1>
+  </header>
+  <div class="nla-container">
 
     <div class="nla-subscribe-band">
       <p class="nla-subscribe-label">Subscribe to the FORRT newsletter to receive the latest news, initiatives, events, and opportunities straight to your inbox.</p>
-      {{ partial "newsletter_form.html" . }}
+      {{ partial "doors/newsletter" . }}
     </div>
 
     <div class="nla-archive-header">
-      <h3 class="nla-archive-title">Archive</h3>
+      <h2 class="nla-archive-title">Archive</h2>
       <div class="nla-year-tabs" role="tablist" aria-label="Filter by year">
         <button class="nla-year-tab active" data-year="all" role="tab" aria-selected="true">All</button>
         {{ range $newsletters }}
@@ -96,6 +99,7 @@ <h3 class="nla-archive-title">Archive</h3>
 
   </div>
 </article>
+</div>
 
 <script>
 (function () {
diff --git a/layouts/partials/announcement_card.html b/layouts/partials/announcement_card.html
index ead2b6f0327..901d034f217 100644
--- a/layouts/partials/announcement_card.html
+++ b/layouts/partials/announcement_card.html
@@ -4,7 +4,7 @@
      invalid HTML — the browser closes the outer anchor early and ejects the
      body out of the card. Instead the title is a "stretched link" whose
      ::after overlay makes the whole card navigate to the post (see
-     custom.scss); links inside the summary still display, but the card
+     lists.css); links inside the summary still display, but the card
      overlay catches the click, so the whole card leads to the post. */}}
 {{ $post := . }}
 {{ $img := ($post.Resources.ByType "image").GetMatch "*featured*" }}
@@ -12,7 +12,7 @@
 <article class="announcement-card{{ if not $img }} no-image{{ end }}">
   {{ with $img }}
   <div class="ac-thumb">
-    <img loading="lazy" src="{{ (.Fill "640x360 Center").RelPermalink }}" width="640" height="360" alt="{{ with $post.Params.image.alt_text }}{{ . }}{{ else }}Featured image for {{ $post.Title }}{{ end }}">
+    <img loading="lazy" src="{{ (.Fill "640x360 Center webp q75").RelPermalink }}" width="640" height="360" alt="{{ with $post.Params.image.alt_text }}{{ . }}{{ else }}Featured image for {{ $post.Title }}{{ end }}">
   </div>
   {{ end }}
   <div class="ac-body">
@@ -20,10 +20,9 @@
       {{ with $cat }}<span class="ac-cat {{ lower . }}">{{ . }}</span>{{ end }}
       <span class="ac-date">{{ $post.Date.Format "Jan 2006" }}</span>
     </div>
-    <h3><a class="ac-link" href="{{ $post.RelPermalink }}">{{ $post.Title }}</a></h3>
+    <h2><a class="ac-link" href="{{ $post.RelPermalink }}">{{ $post.Title }}</a></h2>
     {{/* Render the rendered-markdown summary as HTML so formatting (bold, links)
          and typographic entities (’, —) display correctly; CSS clamps the height. */}}
     <div class="ac-summary">{{ $post.Summary }}</div>
-    <span class="ac-more">Read more ›</span>
-  </div>
+      </div>
 </article>
diff --git a/layouts/partials/chatbot.html b/layouts/partials/chatbot.html
index b6d0f131607..8ae73bed731 100644
--- a/layouts/partials/chatbot.html
+++ b/layouts/partials/chatbot.html
@@ -1,3 +1,6 @@
+{{/* The JUST-OS launcher on every page but the chatbot's own. Only the button and invitation are here:
+     assets/js/doors/site.js loads the chat's styles, window and script on the first click. */}}
+{{ $icon := (resources.Get "images/doors/just-os-icon.webp").Resize "116x webp" }}
 {{ $active := true }}
 {{ $shortMsg := "Chatbot offline" }}
 {{ if isset site.Params "justos_chatbot" }}
@@ -6,961 +9,42 @@
     {{ $shortMsg = site.Params.justos_chatbot.short_message }}
   {{ end }}
 {{ end }}
-
-<style>
-  #just-os-widget {
-    position: fixed;
-    top: 100px;
-    right: 20px;
-    bottom: auto;
-    left: auto;
-    z-index: 9999;
-    display: flex;
-    flex-direction: column;
-    align-items: flex-end;
-    font-family: "Inter", "Open Sans", "Lexend", "Segoe UI", Roboto, "Helvetica Neue", Arial, sans-serif;
-  }
-
-  /* Standalone full-page chat: positioning context + Inter font */
-  .just-os-fullpage {
-    position: relative;
-    font-family: "Inter", "Open Sans", "Lexend", "Segoe UI", Roboto, "Helvetica Neue", Arial, sans-serif;
-  }
-
-  #just-os-btn {
-    background: none;
-    border: none;
-    cursor: pointer;
-    padding: 0;
-    transition: transform 0.3s ease;
-    position: relative;
-    outline: none;
-    z-index: 2;
-    display: inline-block;
-    text-decoration: none;
-  }
-
-  #just-os-dismiss {
-    position: absolute;
-    top: -6px;
-    right: -6px;
-    width: 20px;
-    height: 20px;
-    border-radius: 50%;
-    border: 1px solid #ccc;
-    background: white;
-    color: #999;
-    font-size: 14px;
-    line-height: 18px;
-    text-align: center;
-    cursor: pointer;
-    z-index: 3;
-    opacity: 0;
-    transition: opacity 0.2s ease;
-    padding: 0;
-  }
-
-  #just-os-widget:hover #just-os-dismiss {
-    opacity: 1;
-  }
-
-  #just-os-dismiss:hover {
-    background: #eee;
-    color: #333;
-  }
-
-  #just-os-btn:hover {
-    transform: scale(1.05);
-  }
-
-  #just-os-img {
-    width: 80px;
-    height: auto;
-    display: block;
-    filter: drop-shadow(0 4px 6px rgba(0, 0, 0, 0.1));
-  }
-
-  /* Offline state */
-  #just-os-widget.is-offline #just-os-img {
-    filter: grayscale(0.85) opacity(0.7) drop-shadow(0 4px 6px rgba(0, 0, 0, 0.1));
-  }
-
-  #just-os-offline-badge {
-    position: absolute;
-    bottom: -4px;
-    right: -6px;
-    width: 32px;
-    height: 32px;
-    border-radius: 50%;
-    background: #fff;
-    border: 2px solid #c0392b;
-    box-shadow: 0 2px 6px rgba(0, 0, 0, 0.15);
-    display: flex;
-    align-items: center;
-    justify-content: center;
-    color: #c0392b;
-    z-index: 4;
-    pointer-events: none;
-  }
-
-  #just-os-offline-badge svg {
-    width: 18px;
-    height: 18px;
-    display: block;
-  }
-
-  #just-os-bubble {
-    position: absolute;
-    right: 90px;
-    left: auto;
-    top: 20px;
-    background: white;
-    color: #333;
-    padding: 8px 12px;
-    border-radius: 20px;
-    border: 2px solid #333;
-    white-space: nowrap;
-    font-size: 0.9rem;
-    font-weight: bold;
-    box-shadow: 0 4px 10px rgba(0, 0, 0, 0.1);
-    opacity: 0;
-    transform: translateX(-10px);
-    transition: all 0.3s ease;
-    pointer-events: none;
-  }
-
-  #just-os-widget.is-offline #just-os-bubble {
-    border-color: #bbb;
-    color: #555;
-    font-weight: 500;
-    font-size: 0.8rem;
-    padding: 6px 12px;
-    box-shadow: 0 2px 6px rgba(0, 0, 0, 0.08);
-    white-space: normal;
-    width: 220px;
-    text-align: left;
-    line-height: 1.35;
-    top: 18px;
-    right: 95px;
-  }
-
-  #just-os-btn:hover #just-os-bubble {
-    opacity: 1;
-    transform: translateX(0);
-  }
-
-  .bubble-visible {
-    opacity: 1 !important;
-    transform: translateX(0) !important;
-  }
-
-  /* The chat window — default: docked right panel */
-  #just-os-window {
-    display: none;
-    position: fixed;
-    top: 0;
-    right: 0;
-    bottom: 0;
-    left: auto;
-    width: 33vw;
-    min-width: 320px;
-    background: white;
-    border-left: 2px solid #333;
-    box-shadow: -4px 0 20px rgba(0, 0, 0, 0.15);
-    overflow: hidden;
-    flex-direction: column;
-    z-index: 10000;
-  }
-
-  /* Floating mode — centered, resizable */
-  #just-os-window.floating {
-    top: 5vh;
-    right: auto;
-    bottom: auto;
-    left: 50%;
-    transform: translateX(-50%);
-    width: 60vw;
-    height: 80vh;
-    min-height: 300px;
-    border: 2px solid #333;
-    border-radius: 12px;
-    box-shadow: 0 8px 30px rgba(0, 0, 0, 0.25);
-  }
-
-  /* Custom resize handle (bottom-left corner, floating only) */
-  .just-os-resize-handle {
-    display: none;
-    position: absolute;
-    bottom: 0;
-    left: 0;
-    width: 18px;
-    height: 18px;
-    cursor: nesw-resize;
-    z-index: 10;
-  }
-
-  #just-os-window.floating .just-os-resize-handle {
-    display: block;
-  }
-
-  .just-os-resize-handle::after {
-    content: '';
-    position: absolute;
-    bottom: 3px;
-    left: 3px;
-    width: 10px;
-    height: 10px;
-    border-left: 2px solid #bbb;
-    border-bottom: 2px solid #bbb;
-  }
-
-  .just-os-resize-handle:hover::after {
-    border-color: #888;
-  }
-
-  .chat-header {
-    background: #f8f9fa;
-    padding: 10px 15px;
-    display: flex;
-    justify-content: space-between;
-    align-items: center;
-    border-bottom: 1px solid #eee;
-    gap: 8px;
-  }
-
-  .chat-header span {
-    font-weight: bold;
-    color: #0d3c74;
-  }
-
-  .close-btn {
-    background: none;
-    border: none;
-    font-size: 1.5rem;
-    line-height: 1;
-    cursor: pointer;
-    color: #666;
-  }
-
-  .close-btn:hover {
-    color: #000;
-  }
-
-  /* ---- Chat UI styles ---- */
-  .just-os-messages {
-    flex: 1;
-    overflow-y: auto;
-    padding: 12px;
-    display: flex;
-    flex-direction: column;
-    gap: 10px;
-    min-height: 0;
-  }
-
-  .just-os-msg {
-    max-width: 85%;
-    position: relative;
-  }
-
-  .just-os-msg.user {
-    align-self: flex-end;
-  }
-
-  .just-os-msg.bot {
-    align-self: flex-start;
-  }
-
-  .just-os-bubble-content {
-    padding: 8px 12px;
-    border-radius: 12px;
-    line-height: 1.45;
-    font-size: 0.9rem;
-    word-wrap: break-word;
-    overflow-wrap: break-word;
-  }
-
-  .just-os-msg.user .just-os-bubble-content {
-    background: #0d3c74;
-    color: white;
-    border-bottom-right-radius: 4px;
-  }
-
-  .just-os-msg.bot .just-os-bubble-content {
-    background: #f0f2f5;
-    color: #1a1a1a;
-    border-bottom-left-radius: 4px;
-  }
-
-  .just-os-msg.bot .just-os-bubble-content p {
-    margin: 0 0 8px;
-  }
-
-  .just-os-msg.bot .just-os-bubble-content p:last-child {
-    margin-bottom: 0;
-  }
-
-  .just-os-msg.bot .just-os-bubble-content a {
-    color: #0d3c74;
-    text-decoration: underline;
-  }
-
-  /* Inline citation links open the supporting retrieved chunk */
-  .just-os-msg.bot .just-os-bubble-content a.reference-link {
-    color: #0d3c74;
-    text-decoration: none;
-    cursor: pointer;
-    font-size: 0.85em;
-    font-weight: 600;
-  }
-
-  .just-os-msg.bot .just-os-bubble-content a.reference-link:hover {
-    text-decoration: underline;
-  }
-
-  .just-os-reference-tooltip {
-    position: fixed;
-    width: min(500px, calc(100vw - 24px));
-    max-height: min(420px, calc(100vh - 24px));
-    overflow-y: auto;
-    padding: 14px;
-    background: white;
-    border: 1px solid #d9dde3;
-    border-radius: 8px;
-    box-shadow: 0 4px 18px rgba(0, 0, 0, 0.18);
-    color: #1a1a1a;
-    font-size: 0.85rem;
-    line-height: 1.45;
-    z-index: 10001;
-  }
-
-  .just-os-reference-tooltip .title {
-    font-weight: 700;
-    margin-bottom: 4px;
-  }
-
-  .just-os-reference-tooltip .metadata {
-    color: #666;
-    font-size: 0.8rem;
-    margin-bottom: 10px;
-  }
-
-  .just-os-reference-tooltip .content {
-    padding: 10px;
-    background: #f8f9fb;
-    border-radius: 6px;
-  }
-
-  /* Rendered markdown inside the supporting chunk — keep it compact so a
-     chunk heading doesn't dwarf the tooltip. */
-  .just-os-reference-tooltip .content > :first-child {
-    margin-top: 0;
-  }
-
-  .just-os-reference-tooltip .content > :last-child {
-    margin-bottom: 0;
-  }
-
-  .just-os-reference-tooltip .content p {
-    margin: 0 0 8px;
-  }
-
-  .just-os-reference-tooltip .content h1,
-  .just-os-reference-tooltip .content h2,
-  .just-os-reference-tooltip .content h3,
-  .just-os-reference-tooltip .content h4,
-  .just-os-reference-tooltip .content h5,
-  .just-os-reference-tooltip .content h6 {
-    margin: 10px 0 6px;
-    font-size: 0.95rem;
-    font-weight: 700;
-    line-height: 1.3;
-  }
-
-  .just-os-reference-tooltip .content ul,
-  .just-os-reference-tooltip .content ol {
-    margin: 0 0 8px;
-    padding-left: 20px;
-  }
-
-  .just-os-reference-tooltip .content li {
-    margin-bottom: 2px;
-  }
-
-  .just-os-reference-tooltip .content a {
-    color: #0d3c74;
-    text-decoration: underline;
-  }
-
-  .just-os-reference-tooltip .content code {
-    background: #eceff3;
-    border-radius: 3px;
-    padding: 1px 4px;
-    font-size: 0.85em;
-  }
-
-  .just-os-reference-tooltip .source-link {
-    display: inline-block;
-    margin-top: 10px;
-    color: #0d3c74;
-    font-weight: 600;
-  }
-
-  .just-os-copy-btn {
-    display: block;
-    margin-top: 4px;
-    margin-left: auto;
-    background: none;
-    border: none;
-    cursor: pointer;
-    font-size: 0.85rem;
-    padding: 2px 4px;
-    color: #aaa;
-    border-radius: 4px;
-    opacity: 0;
-    transition: opacity 0.2s;
-    line-height: 1;
-  }
-
-  .just-os-msg.bot:hover .just-os-copy-btn {
-    opacity: 1;
-  }
-
-  .just-os-copy-btn:hover {
-    color: #555;
-  }
-
-  .just-os-copy-btn svg {
-    width: 15px;
-    height: 15px;
-    display: block;
-  }
-
-  /* Feedback — always-visible row beneath bot message */
-  .rating-bar {
-    display: flex;
-    align-items: center;
-    gap: 6px;
-    margin-top: 8px;
-  }
-
-  .rating-bar .rating-btn {
-    background: none;
-    border: 1px solid #0d3c74;
-    color: #0d3c74;
-    cursor: pointer;
-    font-size: 0.72rem;
-    padding: 2px 8px;
-    line-height: 1.4;
-    border-radius: 12px;
-    font-weight: 500;
-    transition: background 0.15s, color 0.15s;
-  }
-
-  .rating-bar .rating-btn:hover {
-    background: #0d3c74;
-    color: #fff;
-  }
-
-  /* Info (i) — subtle disclosure of what feedback is stored, with instant tooltip */
-  .rating-bar .rating-info {
-    position: relative;
-    display: inline-flex;
-    align-items: center;
-    color: #bbb;
-    cursor: help;
-    margin-left: 3px;
-  }
-
-  .rating-bar .rating-info svg {
-    width: 14px;
-    height: 14px;
-    display: block;
-  }
-
-  .rating-bar .rating-info:hover,
-  .rating-bar .rating-info:focus {
-    color: #0d3c74;
-    outline: none;
-  }
-
-  .rating-bar .rating-tip {
-    position: absolute;
-    bottom: calc(100% + 7px);
-    /* Centre the tip over the (i) icon, which sits near the panel centre, so the
-       full text stays inside the narrow docked chat panel (its overflow clips). */
-    left: 50%;
-    transform: translateX(-50%) translateY(3px);
-    width: max-content;
-    max-width: 230px;
-    background: #0d3c74;
-    color: #fff;
-    font-size: 0.7rem;
-    font-style: normal;
-    font-weight: 400;
-    line-height: 1.4;
-    text-align: left;
-    padding: 7px 9px;
-    border-radius: 6px;
-    box-shadow: 0 2px 10px rgba(0, 0, 0, 0.2);
-    opacity: 0;
-    visibility: hidden;
-    transition: opacity 0.1s ease, transform 0.1s ease;
-    pointer-events: none;
-    white-space: normal;
-    z-index: 10;
-  }
-
-  /* small arrow pointing down to the icon */
-  .rating-bar .rating-tip::after {
-    content: "";
-    position: absolute;
-    top: 100%;
-    left: 50%;
-    transform: translateX(-50%);
-    border: 5px solid transparent;
-    border-top-color: #0d3c74;
-  }
-
-  .rating-bar .rating-info:hover .rating-tip,
-  .rating-bar .rating-info:focus .rating-tip,
-  .rating-bar .rating-info:focus-within .rating-tip {
-    opacity: 1;
-    visibility: visible;
-    transform: translateX(-50%) translateY(0);
-  }
-
-  .rating-thanks {
-    font-size: 0.75rem;
-    color: #4caf50;
-    font-style: italic;
-  }
-
-  /* Comment box — appears after "Bad" rating */
-  .comment-box {
-    margin-top: 5px;
-  }
-
-  .comment-box-inner {
-    display: flex;
-    align-items: center;
-    gap: 6px;
-  }
-
-  .comment-box-inner input[type="text"] {
-    flex: 1;
-    min-width: 0;
-    border: none;
-    border-bottom: 1px solid #ddd;
-    padding: 2px 4px;
-    font-size: 0.75rem;
-    font-family: inherit;
-    background: transparent;
-    outline: none;
-    color: #444;
-  }
-
-  .comment-box-inner input[type="text"]:focus {
-    border-bottom-color: #0d3c74;
-  }
-
-  .comment-submit {
-    background: none;
-    border: none;
-    color: #0d3c74;
-    font-size: 0.72rem;
-    cursor: pointer;
-    padding: 0;
-    white-space: nowrap;
-    font-weight: 500;
-    opacity: 0.8;
-  }
-
-  .comment-submit:hover {
-    opacity: 1;
-    text-decoration: underline;
-  }
-
-  /* References list below bot message */
-  .just-os-references {
-    margin-top: 8px;
-    padding: 8px 10px;
-    background: #f8f9fb;
-    border-radius: 8px;
-    border: 1px solid #e8eaed;
-    font-size: 0.8rem;
-    line-height: 1.4;
-  }
-
-  .just-os-references summary {
-    cursor: pointer;
-    font-weight: 600;
-    color: #555;
-    font-size: 0.8rem;
-    user-select: none;
-  }
-
-  .just-os-references ol {
-    margin: 6px 0 0;
-    padding-left: 18px;
-  }
-
-  .just-os-references li {
-    margin-bottom: 4px;
-    color: #555;
-  }
-
-  .just-os-references li a {
-    color: #0d3c74;
-    text-decoration: none;
-  }
-
-  .just-os-references li a:hover {
-    text-decoration: underline;
-  }
-
-  .just-os-typing {
-    display: none;
-    padding: 6px 12px;
-    color: #888;
-    font-size: 0.85rem;
-    font-style: italic;
-  }
-
-  .just-os-error {
-    color: #c0392b;
-    font-style: italic;
-  }
-
-  .just-os-input-area {
-    display: flex;
-    align-items: flex-end;
-    gap: 8px;
-    padding: 10px 12px;
-    border-top: 1px solid #eee;
-    background: #fafafa;
-  }
-
-  .just-os-input {
-    flex: 1;
-    border: 1px solid #ccc;
-    border-radius: 8px;
-    padding: 8px 10px;
-    font-size: 0.9rem;
-    resize: none;
-    max-height: 120px;
-    font-family: inherit;
-    line-height: 1.4;
-  }
-
-  .just-os-input:focus {
-    outline: none;
-    border-color: #0d3c74;
-  }
-
-  .just-os-send-btn {
-    background: #0d3c74;
-    color: white;
-    border: none;
-    border-radius: 8px;
-    padding: 8px 14px;
-    cursor: pointer;
-    font-size: 0.9rem;
-    white-space: nowrap;
-    flex-shrink: 0;
-  }
-
-  .just-os-send-btn:hover {
-    background: #0a2f5c;
-  }
-
-  .just-os-send-btn:disabled {
-    opacity: 0.5;
-    cursor: not-allowed;
-  }
-
-  /* New Chat / History buttons */
-  .just-os-new-chat-btn,
-  .just-os-history-btn {
-    background: none;
-    border: none;
-    cursor: pointer;
-    font-size: 0.8rem;
-    color: #666;
-    padding: 4px 8px;
-    border-radius: 4px;
-  }
-
-  .just-os-new-chat-btn:hover,
-  .just-os-history-btn:hover {
-    background: #eee;
-    color: #333;
-  }
-
-  /* History button pushed to the right in the widget header */
-  .chat-header .just-os-history-btn {
-    margin-left: auto;
-  }
-
-  /* History panel — overlays the chat area */
-  .just-os-history-panel {
-    position: absolute;
-    inset: 0;
-    background: #fff;
-    z-index: 20;
-    flex-direction: column;
-    overflow: hidden;
-  }
-
-  .just-os-history-header {
-    display: flex;
-    align-items: center;
-    gap: 10px;
-    padding: 10px 15px;
-    border-bottom: 1px solid #eee;
-    background: #f8f9fa;
-    flex-shrink: 0;
-  }
-
-  .just-os-history-header span {
-    font-weight: bold;
-    color: #0d3c74;
-  }
-
-  .just-os-history-back {
-    background: none;
-    border: none;
-    cursor: pointer;
-    font-size: 0.9rem;
-    color: #0d3c74;
-    padding: 4px 6px;
-    border-radius: 4px;
-  }
-
-  .just-os-history-back:hover {
-    background: #eee;
-  }
-
-  .just-os-history-list {
-    flex: 1;
-    overflow-y: auto;
-    padding: 8px;
-    min-height: 0;
-  }
-
-  .just-os-history-empty {
-    color: #888;
-    font-size: 0.85rem;
-    text-align: center;
-    margin: 24px 0;
-  }
-
-  .just-os-history-item {
-    display: flex;
-    align-items: stretch;
-    border-radius: 8px;
-    margin-bottom: 4px;
-  }
-
-  .just-os-history-item:hover {
-    background: #f0f2f5;
-  }
-
-  .just-os-history-item.active {
-    background: #e8eef6;
-  }
-
-  .just-os-history-open {
-    flex: 1;
-    display: flex;
-    flex-direction: column;
-    align-items: flex-start;
-    gap: 2px;
-    background: none;
-    border: none;
-    cursor: pointer;
-    text-align: left;
-    padding: 8px 10px;
-    min-width: 0;
-  }
-
-  .just-os-history-title {
-    font-size: 0.88rem;
-    color: #1a1a1a;
-    white-space: nowrap;
-    overflow: hidden;
-    text-overflow: ellipsis;
-    max-width: 100%;
-  }
-
-  .just-os-history-meta {
-    font-size: 0.72rem;
-    color: #999;
-  }
-
-  .just-os-history-delete {
-    background: none;
-    border: none;
-    cursor: pointer;
-    color: #bbb;
-    font-size: 0.9rem;
-    padding: 0 10px;
-    border-radius: 8px;
-    flex-shrink: 0;
-  }
-
-  .just-os-history-delete:hover {
-    color: #c0392b;
-  }
-
-  /* Standalone page offline notice */
-  .just-os-offline-page {
-    width: 100%;
-    max-width: 1200px;
-    margin: 0 auto;
-    padding: 48px 32px;
-    border: 1px solid #f1d6d2;
-    border-radius: 12px;
-    background: #fdf5f4;
-    box-shadow: 0 4px 12px rgba(0, 0, 0, 0.05);
-    display: flex;
-    flex-direction: column;
-    align-items: center;
-    text-align: center;
-    color: #4a1f1a;
-  }
-
-  .just-os-offline-page__icon {
-    width: 64px;
-    height: 64px;
-    color: #c0392b;
-    margin-bottom: 16px;
-  }
-
-  .just-os-offline-page__title {
-    font-size: 1.4rem;
-    font-weight: 700;
-    margin: 0 0 8px;
-    color: #c0392b;
-  }
-
-  .just-os-offline-page__body {
-    font-size: 1rem;
-    line-height: 1.5;
-    max-width: 640px;
-    margin: 0;
-  }
-
-  /* Responsive */
-  @media (max-width: 1100px) {
-    #just-os-widget {
-      top: 150px;
-    }
-  }
-
-  @media (max-width: 768px) {
-    #just-os-widget {
-      top: 80px;
-    }
-
-    /* On mobile there's no room to the left of the seal, so drop the
-       "How can I help you?" bubble below it instead. */
-    #just-os-bubble,
-    #just-os-widget.is-offline #just-os-bubble {
-      top: 92px;
-      right: 0;
-      left: auto;
-      transform: translateY(-8px);
-    }
-    #just-os-btn:hover #just-os-bubble,
-    .bubble-visible {
-      transform: translateY(0) !important;
-    }
-
-    #just-os-window {
-      width: 100vw;
-    }
-
-    #just-os-window.floating {
-      width: 95vw;
-      height: 80vh;
-      top: 5vh;
-    }
-  }
-</style>
-
-{{ if ne .RelPermalink "/just_os_chatbot/" }}
-<div id="just-os-widget"{{ if not $active }} class="is-offline"{{ end }}>
-
-  <!-- Dismiss Button -->
-  <button id="just-os-dismiss" onclick="dismissJustOS()" aria-label="Dismiss chatbot" title="Dismiss">&times;</button>
-
+{{ if ne .Path "/just_os_chatbot" }}
+{{ $css := resources.Get "css/doors/chatbot.css" | minify | fingerprint "md5" }}
+<div id="just-os-widget" lang="en" dir="ltr"{{ if not $active }} class="is-offline"{{ end }} data-css="{{ $css.RelPermalink }}" data-js="{{ "js/just-os-chat.js" | relURL }}">
+  <button id="just-os-dismiss" type="button" aria-label="Dismiss chatbot" title="Dismiss">&times;</button>
   {{ if $active }}
-  <!-- Toggle Button -->
-  <button id="just-os-btn" onclick="toggleJustOS()" aria-label="Open Chatbot">
-    <img id="just-os-img" src="/img/just_os_icon.webp" {{ partial "functions/static_img_dims" "just_os_icon.webp" }} alt="Chat with us">
-    <div id="just-os-bubble">
-      How can I help you?
-    </div>
+  <button id="just-os-btn" type="button" aria-label="Open the JUST-OS chatbot" aria-expanded="false">
+    <img id="just-os-img" src="{{ $icon.RelPermalink }}" width="58" height="58" alt="">
+    <span id="just-os-bubble">How can I help you?</span>
   </button>
-
-  <!-- Chat Window -->
+  {{ else }}
+  <a id="just-os-btn" href="{{ relref . "/just_os_chatbot" }}" aria-label="JUST-OS chatbot is offline: open its status page">
+    <img id="just-os-img" src="{{ $icon.RelPermalink }}" width="58" height="58" alt="">
+    <span id="just-os-offline-badge" aria-hidden="true" title="Chatbot offline">
+      <svg viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2.2" stroke-linecap="round" stroke-linejoin="round"><path d="M9 2v4"/><path d="M15 2v4"/><path d="M7 6h10v5a5 5 0 0 1-5 5 5 5 0 0 1-5-5V6z"/><path d="M12 16v6"/><line x1="3" y1="3" x2="21" y2="21"/></svg>
+    </span>
+    <span id="just-os-bubble">{{ $shortMsg }}</span>
+  </a>
+  {{ end }}
+</div>
+{{ if $active }}
+<template id="just-os-template">
   <div id="just-os-window">
     <div class="chat-header">
       <span>JUST-OS</span>
-
       <button type="button" class="just-os-history-btn" onclick="toggleJustOSHistory()" title="Chat history">History</button>
-
       <button type="button" class="just-os-new-chat-btn" onclick="newJustOSChat()" title="New Chat">New Chat</button>
-
-      <button type="button" id="just-os-float-btn" class="close-btn" style="margin-left: auto; font-size: 1.1rem;"
-        onclick="toggleJustOSFloat()" aria-label="Pop out" title="Pop out">⤢</button>
-
-      <button class="close-btn" onclick="toggleJustOS()" aria-label="Close">&times;</button>
+      <button type="button" id="just-os-float-btn" class="close-btn" style="margin-inline-start:auto;font-size:1.1rem" onclick="toggleJustOSFloat()" aria-label="Pop out" title="Pop out">⤢</button>
+      <button type="button" class="close-btn" onclick="toggleJustOS()" aria-label="Close">&times;</button>
     </div>
-
-    <div class="just-os-messages"></div>
-
+    <div class="just-os-messages" lang=""></div>
     <div class="just-os-input-area">
-      <textarea class="just-os-input" rows="1" placeholder="Ask a question…" aria-label="Chat message"></textarea>
+      <textarea class="just-os-input" dir="auto" lang="" rows="1" placeholder="Ask a question…" aria-label="Chat message"></textarea>
       <button class="just-os-send-btn" type="button">Send</button>
     </div>
     <div class="just-os-resize-handle"></div>
   </div>
-  {{ else }}
-  <!-- Inactive state: icon links to the standalone page where the full offline notice lives -->
-  <a id="just-os-btn" href="/just_os_chatbot/" aria-label="JUST-OS chatbot is offline — open status page">
-    <img id="just-os-img" src="/img/just_os_icon.webp" {{ partial "functions/static_img_dims" "just_os_icon.webp" }} alt="JUST-OS chatbot (offline)">
-    <span id="just-os-offline-badge" aria-hidden="true" title="Chatbot offline">
-      <!-- Unplugged plug icon -->
-      <svg viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2.2" stroke-linecap="round" stroke-linejoin="round">
-        <path d="M9 2v4"/>
-        <path d="M15 2v4"/>
-        <path d="M7 6h10v5a5 5 0 0 1-5 5 5 5 0 0 1-5-5V6z"/>
-        <path d="M12 16v6"/>
-        <line x1="3" y1="3" x2="21" y2="21"/>
-      </svg>
-    </span>
-    <div id="just-os-bubble">{{ $shortMsg }}</div>
-  </a>
-  {{ end }}
-
-</div>
+</template>
 {{ end }}
-
-{{ if $active }}
-<script src="/js/just-os-chat.js"></script>
-{{ else }}
-<script>
-  (function () {
-    if (sessionStorage.getItem('just-os-dismissed')) {
-      var widget = document.getElementById('just-os-widget');
-      if (widget) widget.style.display = 'none';
-    }
-    window.dismissJustOS = function () {
-      var widget = document.getElementById('just-os-widget');
-      if (widget) widget.style.display = 'none';
-      sessionStorage.setItem('just-os-dismissed', '1');
-    };
-  })();
-</script>
 {{ end }}
diff --git a/layouts/partials/citations/author-label.html b/layouts/partials/citations/author-label.html
new file mode 100644
index 00000000000..efa66fc1baa
--- /dev/null
+++ b/layouts/partials/citations/author-label.html
@@ -0,0 +1,3 @@
+{{/* Compare narrative/parenthetical author lists without punctuation or conjunction style. */}}
+{{- $label := lower . | replaceRE `\b(and)\b|[,&.]` " " -}}
+{{- return (strings.TrimSpace (replaceRE `\s+` " " $label)) -}}
diff --git a/layouts/partials/citations/authors.html b/layouts/partials/citations/authors.html
new file mode 100644
index 00000000000..85745367c2d
--- /dev/null
+++ b/layouts/partials/citations/authors.html
@@ -0,0 +1,27 @@
+{{/* Shortens a long author list in a full reference to its first three authors and "et al.", with a
+     button that shows the rest in place (assets/js/doors/references.js). Takes a reference as rendered
+     HTML. A reference with five authors or fewer, or whose authors aren't followed by a "(year" date,
+     comes back unchanged. The hidden authors stay in the page, so copying gives the full APA text,
+     and without JavaScript they show (layouts/partials/doors/assets.html). */}}
+{{- $html := trim (string .) " \n\r\t" -}}
+{{/* A surname and initials, with "Jr." or a particle where the bibliography generator puts them:
+     "Lewis, Jr., N. A.", "Elm, E. von". */}}
+{{- $name := `(?:[^,&…<>()]|&[a-z]+;|&#[0-9]+;)+?(?:,\s*[JS]r\.)?,\s*\p{Lu}\p{Ll}?\.(?:[\s-]*\p{Lu}\p{Ll}?\.)*(?:\s+(?:von|van|de|der|den|du|da|di|del|dos|das|la|le|ter|ten)\b)*\*?` -}}
+{{- $out := $html -}}
+{{- with findRESubmatch `^([^<(]*?)\s*\((?:[0-9]{4}|n\.d\.)` $html 1 -}}
+  {{- $authors := index (index . 0) 1 -}}
+  {{- $after := strings.TrimPrefix $authors $html -}}
+  {{- $plain := htmlUnescape $authors -}}
+  {{/* Bibliography entries can end in "& others" or "et al.": then, as after an ellipsis, the
+       list is incomplete and the button doesn't give a number. */}}
+  {{- $complete := not (findRE `…|\.\s?\.\s?\.|\bothers\b|\bet al\b` $plain) -}}
+  {{- $marked := replaceRE `\bet al\.?|\bothers\b` "" (replaceRE $name "§" $plain) -}}
+  {{/* Corporate authors such as "FORRT" are whatever is left between the separators. */}}
+  {{- $count := add (len (findRE `§` $marked)) (len (findRE `[^\s,&…§.][^,&…§]*` $marked)) -}}
+  {{- with and (gt $count 5) (findRE (printf `^(?:%s\s*,\s*(?:&(?:amp;)?\s*)?){2}%s` $name $name) $authors 1) -}}
+    {{- $first := index . 0 -}}
+    {{- $more := cond $complete (printf "Show all %d authors" $count) "Show more authors" -}}
+    {{- $out = printf `<span class="ref-authors">%s<span class="ref-more" hidden>%s</span><span class="ref-etal">, et al.</span> <button type="button" class="ref-authors-toggle" aria-expanded="false" data-more="%s" data-less="Show fewer authors">%s</button></span>%s` $first (strings.TrimPrefix $first $authors) $more $more $after -}}
+  {{- end -}}
+{{- end -}}
+{{- $out | safeHTML -}}
diff --git a/layouts/partials/citations/bibliography.html b/layouts/partials/citations/bibliography.html
new file mode 100644
index 00000000000..ac591b2df21
--- /dev/null
+++ b/layouts/partials/citations/bibliography.html
@@ -0,0 +1,3 @@
+{{/* Reads the generated apa_lookup.json. Edit its Glossary BibTeX source to change entries.
+     Call through partialCached with the "bibliography" variant to read once per build. */}}
+{{ return (os.ReadFile "content/glossary/apa_lookup.json" | transform.Unmarshal) }}
diff --git a/layouts/partials/citations/entry.html b/layouts/partials/citations/entry.html
new file mode 100644
index 00000000000..665e08eda5e
--- /dev/null
+++ b/layouts/partials/citations/entry.html
@@ -0,0 +1,2 @@
+{{- $meta := partialCached "citations/metadata" .apa .apa -}}
+<li id="ref-{{ .key }}" data-reference="{{ .key }}" data-first-author="{{ $meta.first }}" data-authors="{{ $meta.names | jsonify }}" data-etal="{{ $meta.etal }}" data-year="{{ $meta.year }}"{{ with $meta.url }} data-source="{{ . }}"{{ end }}>{{ partial "citations/authors" (.apa | markdownify) }}</li>
diff --git a/layouts/partials/citations/keys.html b/layouts/partials/citations/keys.html
new file mode 100644
index 00000000000..43c4533661f
--- /dev/null
+++ b/layouts/partials/citations/keys.html
@@ -0,0 +1,6 @@
+{{/* Reverse lookup for generated glossary pages, whose references are already expanded. */}}
+{{- $keys := dict -}}
+{{- range $key, $apa := partialCached "citations/bibliography" . "bibliography" -}}
+  {{- $keys = merge $keys (dict $apa $key) -}}
+{{- end -}}
+{{- return $keys -}}
diff --git a/layouts/partials/citations/metadata.html b/layouts/partials/citations/metadata.html
new file mode 100644
index 00000000000..867ea3cb7ec
--- /dev/null
+++ b/layouts/partials/citations/metadata.html
@@ -0,0 +1,40 @@
+{{/* Pure APA-string -> metadata partial; no page state. Keep initials out of short citations.
+     Corporate authors have no surname/initials pairs and retain their full name. */}}
+{{- $plain := . | plainify | htmlUnescape -}}
+{{- $date := "" -}}
+{{- with findRE `\((?:[0-9]{4}[a-z]?(?:[–-][0-9]{4})?|n\.d\.)\)` $plain 1 -}}{{- $date = index . 0 -}}{{- end -}}
+{{- $year := strings.Trim $date "()" -}}
+{{- $authors := $plain -}}
+{{- with $date -}}{{- $authors = strings.TrimSpace (index (split $plain .) 0) -}}{{- end -}}
+{{- $names := slice -}}
+{{- range findRE `(?:^|,\s*(?:&\s*)?)([^,]+),\s*(?:[\p{L}]\.\s*)+` $authors -}}
+  {{- $name := replaceRE `^,\s*(?:&\s*)?` "" . -}}
+  {{- $names = $names | append (strings.TrimSpace (index (split $name ",") 0)) -}}
+{{- end -}}
+{{/* Citation.js also emits corporate author lists ending in "& others" without initials. */}}
+{{- if and (not $names) (findRE `(?:,\s*|\s+)&\s*others\.?$` $authors) -}}
+  {{- $corporate := replaceRE `(?:,\s*|\s+)&\s*others\.?$` "" $authors -}}
+  {{- range split $corporate "," -}}{{- $names = $names | append (strings.TrimSpace .) -}}{{- end -}}
+{{- end -}}
+{{- $short := strings.TrimSuffix "." $authors -}}
+{{- $first := $short -}}
+{{- $etal := false -}}
+{{- with $names -}}
+  {{- $first = index . 0 -}}
+  {{- $short = $first -}}
+  {{- if or (ge (len .) 3) (findRE `\bothers\b` $authors) (in $authors "...") (in $authors "…") -}}
+    {{- $short = printf "%s et al." $first -}}
+    {{- $etal = true -}}
+  {{- else if eq (len .) 2 -}}
+    {{- $short = printf "%s & %s" $first (index . 1) -}}
+  {{- end -}}
+{{- end -}}
+{{- if not $names -}}{{- $names = slice $first -}}{{- end -}}
+{{- $url := "" -}}
+{{- $urls := findRE `https?://[^\s<>]+` $plain -}}
+{{- with $urls -}}{{- $url = index . 0 -}}{{- end -}}
+{{- range $urls -}}{{- if findRE `https?://(?:dx\.)?doi\.org/` . -}}{{- $url = . -}}{{- break -}}{{- end -}}{{- end -}}
+{{- if not $url -}}
+  {{- with findRE `10\.[0-9]{4,9}/[^\s<>]+` $plain 1 -}}{{- $url = printf "https://doi.org/%s" (index . 0) -}}{{- end -}}
+{{- end -}}
+{{- return (dict "author" $short "names" $names "etal" $etal "first" $first "year" $year "url" (strings.TrimRight ".,;" $url) "plain" $plain) -}}
diff --git a/layouts/partials/clusters/all_clusters.html b/layouts/partials/clusters/all_clusters.html
index 8605f3941d8..1bdc0408a58 100644
--- a/layouts/partials/clusters/all_clusters.html
+++ b/layouts/partials/clusters/all_clusters.html
@@ -18,11 +18,11 @@
   <div class="row">
     {{ partial "clusters/sidebar_nav.html" (dict "data" $data "arrowColors" $arrowColors "link_mode" "anchor") }}
 
-    <main class="col-12 col-lg-8 col-xl-9 clusters-content">
+    <div class="col-12 col-lg-8 col-xl-9 clusters-content">
       {{ range $ci, $cluster := $data.clusters }}
         {{ partial "clusters/cluster_section.html" (dict "cluster" $cluster "ci" $ci "colors" $colors) }}
       {{ end }}
-    </main>
+    </div>
   </div>
 </div>
 
diff --git a/layouts/partials/clusters/cluster_section.html b/layouts/partials/clusters/cluster_section.html
index dbeb5eb956a..16b907b55a1 100644
--- a/layouts/partials/clusters/cluster_section.html
+++ b/layouts/partials/clusters/cluster_section.html
@@ -19,7 +19,7 @@
 {{ end }}
 {{ $hasFeatured := and $featuredEnabled $featuredData }}
 
-<section id="{{ $cid }}" class="cluster-section" style="background-color: {{ $color }};">
+<section id="{{ $cid }}" class="cluster-section" style="background-color: {{ $color | safeCSS }};">
   <div class="cluster-header">
     <h2 class="cluster-title">
       <span class="cluster-number">{{ (int $cluster.number) }}</span>
@@ -40,10 +40,10 @@ <h2 class="cluster-title">
     {{ if $hasFeatured }}
     {{ $fid := printf "c%d-featured" (int $cluster.number) }}
     <div class="acc-section" id="{{ $fid }}">
-      <div class="acc-header acc-header--rec" role="button" tabindex="0">
-        <span class="acc-chevron acc-open">&#9656;</span>
-        <span class="acc-label">Recommended</span>
-        <span class="acc-count"><span class="acc-count-match">{{ len $featuredData }}</span> / {{ len $featuredData }}</span>
+      <div class="acc-header acc-header--rec">
+        <span class="acc-chevron acc-open" aria-hidden="true">&#9656;</span>
+        <span class="acc-label"><button type="button" class="acc-trigger" aria-expanded="true">Recommended</button></span>
+        <span class="acc-count" title="References shown with the current filters, of all in this group"><span class="acc-count-match">{{ len $featuredData }}</span> of {{ len $featuredData }}</span>
       </div>
       <div class="acc-body">
         {{ partial "clusters/featured_cards.html" (dict "resources" $featuredData "cluster_number" (int $cluster.number)) }}
@@ -56,10 +56,10 @@ <h2 class="cluster-title">
     {{ $slug := $sc.name | lower | replaceRE "[^a-z0-9]+" "-" | replaceRE "^-+|-+$" "" }}
     {{ $scid := printf "c%d-%s" (int $cluster.number) $slug }}
     <div class="acc-section" id="{{ $scid }}">
-      <div class="acc-header" role="button" tabindex="0">
-        <span class="acc-chevron">&#9656;</span>
-        <h3 class="acc-label">{{ $sc.name }}</h3>
-        <span class="acc-count"><span class="acc-count-match">{{ len $sc.publications }}</span> / {{ len $sc.publications }}</span>
+      <div class="acc-header">
+        <span class="acc-chevron" aria-hidden="true">&#9656;</span>
+        <h3 class="acc-label"><button type="button" class="acc-trigger" aria-expanded="false">{{ $sc.name }}</button></h3>
+        <span class="acc-count" title="References shown with the current filters, of all in this sub-cluster"><span class="acc-count-match">{{ len $sc.publications }}</span> of {{ len $sc.publications }}</span>
         <button type="button" class="acc-copy-link" data-anchor="{{ $scid }}" aria-label="Copy link to this sub-cluster" title="Copy link to this sub-cluster">
           <svg viewBox="0 0 16 16" fill="none" stroke="currentColor" stroke-width="1.4" aria-hidden="true"><path d="M6.5 9.5l3-3M7 4.5l1-1a3 3 0 014.25 4.25l-1 1M9 11.5l-1 1a3 3 0 01-4.25-4.25l1-1"/></svg>
         </button>
@@ -91,7 +91,7 @@ <h3 class="acc-label">{{ $sc.name }}</h3>
                 {{ with $card.focus }}<span class="tag tag-focus">{{ . }}</span>{{ end }}
                 {{ with $card.resource_type }}<span class="tag tag-type">{{ . }}</span>{{ end }}
               </div>
-              <div class="fr-title">{{ $card.title }}</div>
+              <div class="fr-title">{{ partial "clusters/rich_text.html" $card.title }}</div>
               {{ with $card.summary }}<div class="fr-summary">{{ . }}</div>{{ end }}
               <div class="fr-actions">
                 <button class="fr-ref-trigger" data-doi="{{ .doi }}">
@@ -152,7 +152,7 @@ <h3 class="acc-label">{{ $sc.name }}</h3>
                   {{ with $card.focus }}<span class="tag tag-focus">{{ . }}</span>{{ end }}
                   {{ with $card.resource_type }}<span class="tag tag-type">{{ . }}</span>{{ end }}
                 </div>
-                <div class="fc-title">{{ $card.title }}</div>
+                <div class="fc-title">{{ partial "clusters/rich_text.html" $card.title }}</div>
               </div>
               {{ with $card.summary }}
               <div class="fc-summary">{{ . }}</div>
diff --git a/layouts/partials/clusters/colors.html b/layouts/partials/clusters/colors.html
index 8e1f9499114..42e21c10c73 100644
--- a/layouts/partials/clusters/colors.html
+++ b/layouts/partials/clusters/colors.html
@@ -1,4 +1,4 @@
 {{/* Shared cluster color palettes — used by all_clusters.html and cluster.html */}}
-{{ $colors := slice "#cacfdc" "#eadce6" "#d4e4d9" "#BDC5CA" "#dce4ea" "#e8ddd4" "#c9dbcb" "#d9cfe0" "#cddde3" "#e0d8cc" "#d4dce8" }}
-{{ $arrowColors := slice "#6070a0" "#a05080" "#408060" "#607080" "#5080a0" "#a08060" "#509060" "#8060a0" "#5090a0" "#907050" "#6070a0" }}
+{{ $colors := slice "var(--res-bg)" "var(--jus-bg)" "var(--edu-bg)" "var(--com-bg)" "var(--surface)" }}
+{{ $arrowColors := slice "var(--res)" "var(--jus)" "var(--edu)" "var(--com)" "var(--soft)" }}
 {{ return dict "colors" $colors "arrowColors" $arrowColors }}
diff --git a/layouts/partials/clusters/featured_cards.html b/layouts/partials/clusters/featured_cards.html
index 6abb75d26a6..6734505d63c 100644
--- a/layouts/partials/clusters/featured_cards.html
+++ b/layouts/partials/clusters/featured_cards.html
@@ -24,7 +24,7 @@
           {{ if .focus }}<span class="tag tag-focus">{{ .focus }}</span>{{ end }}
           {{ if .resource_type }}<span class="tag tag-type">{{ .resource_type }}</span>{{ end }}
         </div>
-        <div class="fr-title">{{ .title }}</div>
+        <div class="fr-title">{{ partial "clusters/rich_text.html" .title }}</div>
         <div class="fr-summary">{{ .summary }}</div>
         <div class="fr-actions">
           <button class="fr-ref-trigger" data-doi="{{ .doi }}">
@@ -94,7 +94,7 @@
             {{ if .focus }}<span class="tag tag-focus">{{ .focus }}</span>{{ end }}
             {{ if .resource_type }}<span class="tag tag-type">{{ .resource_type }}</span>{{ end }}
           </div>
-          <div class="fc-title">{{ .title }}</div>
+          <div class="fc-title">{{ partial "clusters/rich_text.html" .title }}</div>
         </div>
         {{ if .summary }}
         <div class="fc-summary">{{ .summary }}</div>
diff --git a/layouts/partials/clusters/featured_global.html b/layouts/partials/clusters/featured_global.html
index 792ff87854f..54930fe3e3c 100644
--- a/layouts/partials/clusters/featured_global.html
+++ b/layouts/partials/clusters/featured_global.html
@@ -50,9 +50,11 @@
 {{ if $featured }}
 <script>window.FORRT_FEATURED = {{ $featured | jsonify | safeJS }};</script>
 {{ end }}
-{{ $pubCards := hugo.Data.pub_cards }}
-{{ if $pubCards }}
-<script>window.FORRT_PUB_CARDS = {{ $pubCards | jsonify | safeJS }};</script>
+{{/* The publication cards are about 2 MB, so they are a separate file that
+     featured-resources.js fetches only when a reference or the reading list needs one. */}}
+{{ with hugo.Data.pub_cards }}
+{{ $pubCards := resources.FromString "data/pub_cards.json" (jsonify .) | fingerprint }}
+<script>window.FORRT_PUB_CARDS_URL = {{ $pubCards.RelPermalink }};</script>
 {{ end }}
 {{ $filterTags := hugo.Data.filter_tags }}
 {{ if $filterTags }}
diff --git a/layouts/partials/clusters/intro.html b/layouts/partials/clusters/intro.html
index 41ebf144439..c6f6d9c2d32 100644
--- a/layouts/partials/clusters/intro.html
+++ b/layouts/partials/clusters/intro.html
@@ -1,50 +1,7 @@
-{{/* intro.html - Concise intro with text left, lightbox image right */}}
+{{/* intro.html - Intro text, then the clusters map (drawn from data/clusters_v4.json) */}}
 <div class="clusters-intro">
-
-  <div class="intro-hero">
-    {{/* Left column: text */}}
-    <div class="intro-hero-text">
-      <p class="intro-paragraph">
-        Teaching Open and Reproducible Science shouldn't require educators to spend months sifting through a decade of literature. FORRT simplifies this process by providing a curated, expert-backed framework. Developed by over 100 scholars, our taxonomy organizes open scholarship into 11 distinct clusters, offering a clear pathway for integrating these tenets into your teaching and mentoring, regardless of your field or level of expertise.
-      </p>
-    </div>
-
-    {{/* Right column: lightbox image */}}
-    <div class="intro-hero-image">
-      <a href="FORRT_Clusters.webp" class="lightbox-trigger" aria-label="View full-size FORRT Clusters diagram">
-        <div class="intro-thumbnail-wrapper">
-          <img src="FORRT_Clusters.webp" alt="FORRT's Clusters hierarchy diagram" class="intro-thumbnail" loading="lazy">
-          <span class="update-pending-badge">Update pending</span>
-        </div>
-        <span class="lightbox-hint">
-          <svg xmlns="http://www.w3.org/2000/svg" width="16" height="16" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><circle cx="11" cy="11" r="8"/><line x1="21" y1="21" x2="16.65" y2="16.65"/><line x1="11" y1="8" x2="11" y2="14"/><line x1="8" y1="11" x2="14" y2="11"/></svg>
-          Click to enlarge
-        </span>
-      </a>
-    </div>
-  </div>
-
-  {{/* Lightbox overlay */}}
-  <div class="lightbox-overlay" id="clusters-lightbox" role="dialog" aria-modal="true" aria-label="FORRT Clusters diagram">
-    <button class="lightbox-close" aria-label="Close">&times;</button>
-    <img src="FORRT_Clusters.webp" alt="FORRT's Clusters hierarchy diagram" class="lightbox-image">
-  </div>
-
-  <script>
-  (function() {
-    var trigger = document.querySelector('.lightbox-trigger');
-    var overlay = document.getElementById('clusters-lightbox');
-    var closeBtn = overlay.querySelector('.lightbox-close');
-
-    function open(e) { e.preventDefault(); overlay.classList.add('active'); }
-    function close() { overlay.classList.remove('active'); }
-
-    trigger.addEventListener('click', open);
-    closeBtn.addEventListener('click', close);
-    overlay.addEventListener('click', function(e) { if (e.target === overlay) close(); });
-    document.addEventListener('keydown', function(e) { if (e.key === 'Escape') close(); });
-  })();
-  </script>
-
-
+  <p class="intro-paragraph">
+    Teaching Open and Reproducible Science shouldn't require educators to spend months sifting through a decade of literature. FORRT simplifies this process by providing a curated, expert-backed framework. Developed by over 100 scholars, our taxonomy organizes open scholarship into {{ with hugo.Data.clusters_v4 }}{{ len .clusters }}{{ else }}11{{ end }} distinct clusters, offering a clear pathway for integrating these tenets into your teaching and mentoring, regardless of your field or level of expertise.
+  </p>
+  {{ partial "clusters/map.html" (dict "link_mode" "anchor") }}
 </div>
diff --git a/layouts/partials/clusters/map.html b/layouts/partials/clusters/map.html
new file mode 100644
index 00000000000..97150e890b5
--- /dev/null
+++ b/layouts/partials/clusters/map.html
@@ -0,0 +1,246 @@
+{{/* Clusters map: a mind map with the FORRT badge in a ring of cluster icons, a line from each
+     segment to its cluster's label, and the sub-clusters as pills fanning out from the label.
+     Drawn from data/clusters_v4.json at build time, so it always matches the list below it.
+     Expects dict: link_mode ("anchor" for #cluster-N on /clusters/, else /clusters/cluster-N/).
+
+     Layout: the clusters run clockwise, the first ones left to right above the hub and the rest
+     right to left below it. Labels sit on an arc round the hub, their pills stack away from it,
+     and a cluster whose pills would stand taller than $colMax splits them into columns. Text is
+     wrapped with the font's measured widths (clusters/map_wrap.html). On the page the drawing
+     scales to the column; "Open full size" shows it larger.
+
+     The /clusters/ share image (content/clusters/FORRT_Clusters.webp) is a render of this map.
+     After changing the map or the clusters, build the site and run
+     scripts/render_clusters_share_image.py <build-dir>. */}}
+{{ with hugo.Data.clusters_v4 }}{{ with .clusters }}
+{{ $clusters := . }}
+{{ $palette := (partial "clusters/colors.html").arrowColors }}
+{{ $icons := partialCached "clusters/map_icons.html" "icons" }}
+{{ $n := len $clusters }}
+
+{{/* Sizes, in drawing units (one unit is one CSS pixel at full size). */}}
+{{ $fs := 17.0 }}{{ $lh := 21.0 }}{{ $padX := 14.0 }}{{ $padY := 8.0 }}{{ $pillMax := 272.0 }}{{ $pillGap := 7.0 }}
+{{ $colGap := 12.0 }}{{ $colMax := 520.0 }}{{ $stackGap := 26.0 }}
+{{ $lfs := 20.0 }}{{ $llh := 24.0 }}{{ $lpadX := 16.0 }}{{ $lpadY := 11.0 }}{{ $labelMin := 230.0 }}{{ $labelMax := 300.0 }}{{ $labelGap := 14.0 }}
+{{ $Ro := 165.0 }}{{ $Ri := 104.0 }}{{ $disc := 94.0 }}{{ $dMin := 26.0 }}{{ $dMax := 205.0 }}{{ $margin := 24.0 }}
+
+{{/* 1. Each cluster: its pills, their columns and its label. */}}
+{{ $stacks := slice }}
+{{ range $i, $c := $clusters }}
+  {{ $num := int $c.number }}
+  {{ $base := cond (eq $.link_mode "anchor") "" ((printf "/clusters/cluster-%d/" $num) | relURL) }}
+  {{ $pills := slice }}{{ $natW := 0.0 }}{{ $total := 0.0 }}
+  {{ range $c.sub_clusters }}
+    {{/* Same slug as cluster_section.html and sidebar_nav.html, from the full name. */}}
+    {{ $slug := .name | lower | replaceRE "[^a-z0-9]+" "-" | replaceRE "^-+|-+$" "" }}
+    {{/* Shown text: the name without a closing parenthetical aside or full stop, in at most 3 lines. */}}
+    {{ $short := .name | strings.TrimSpace | replaceRE `\.$` "" }}
+    {{ with replaceRE `\s*\([^()]*\)$` "" $short }}{{ $short = . }}{{ end }}
+    {{ $wrap := partial "clusters/map_wrap.html" (dict "text" $short "width" (sub $pillMax (mul 2 $padX)) "size" $fs "weight" "400" "max_lines" 3) }}
+    {{ $h := add (mul 2 $padY) (mul (len $wrap.lines) $lh) }}
+    {{ $natW = math.Max $natW (add $wrap.widest (mul 2 $padX)) }}
+    {{ $pills = $pills | append (dict "lines" $wrap.lines "h" $h "title" .name "href" (printf "%s#c%d-%s" $base $num $slug)) }}
+    {{ $total = add $total $h $pillGap }}
+  {{ end }}
+  {{ $colW := math.Ceil (math.Min $pillMax (math.Max $natW 150.0)) }}
+  {{ $cols := int (math.Max 1 (math.Ceil (div $total $colMax))) }}
+  {{/* Fill the columns in reading order, starting a new one at each equal share of the height. */}}
+  {{ $share := div $total $cols }}{{ $acc := 0.0 }}{{ $col := 0 }}{{ $colH := dict }}{{ $placed := slice }}
+  {{ range seq $cols }}{{ $colH = merge $colH (dict (string (sub . 1)) 0.0) }}{{ end }}
+  {{ range $pills }}
+    {{ if and (lt $col (sub $cols 1)) (gt (add $acc (div .h 2)) (mul $share (add $col 1))) (gt (index $colH (string $col)) 0.0) }}{{ $col = add $col 1 }}{{ end }}
+    {{ $y := index $colH (string $col) }}
+    {{ $placed = $placed | append (merge . (dict "col" $col "y" $y)) }}
+    {{ $colH = merge $colH (dict (string $col) (add $y .h $pillGap)) }}
+    {{ $acc = add $acc .h $pillGap }}
+  {{ end }}
+  {{ $tallest := 0.0 }}{{ range $colH }}{{ $tallest = math.Max $tallest . }}{{ end }}
+  {{ $blockW := add (mul $cols $colW) (mul (sub $cols 1) $colGap) }}
+  {{ $lw := math.Min $labelMax (math.Max $labelMin $blockW) }}
+  {{/* A name that needs more than 3 lines at the column's width widens, up to $labelMax, before it is cut. */}}
+  {{ if gt (len (partial "clusters/map_wrap.html" (dict "text" $c.name "width" (sub $lw (mul 2 $lpadX)) "size" $lfs "weight" "700")).lines) 3 }}{{ $lw = $labelMax }}{{ end }}
+  {{ $label := partial "clusters/map_wrap.html" (dict "text" $c.name "width" (sub $lw (mul 2 $lpadX)) "size" $lfs "weight" "700" "max_lines" 3) }}
+  {{ $icon := index $icons.by_cluster (string $num) | default $icons.fallback }}
+  {{ $stacks = $stacks | append (dict
+      "num" $num "name" $c.name "i" $i
+      "href" (cond (eq $.link_mode "anchor") (printf "#cluster-%d" $num) $base)
+      "color" (index $palette (mod $i (len $palette)))
+      "icon" (index $icons.paths $icon)
+      "pills" $placed "cols" $cols "colW" $colW "blockW" $blockW
+      "colH" $colH "pillsH" (sub $tallest $pillGap)
+      "lw" $lw "lines" $label.lines "lh" (add (mul 2 $lpadY) (mul (len $label.lines) $llh))
+      "w" (math.Max $blockW $lw)) }}
+{{ end }}
+
+{{/* 2. Split the clusters between the row above the hub and the row below, as evenly as the widths allow. */}}
+{{ $best := 1 }}{{ $bestW := add (index $stacks 0).w $stackGap }}
+{{ if gt $n 1 }}{{ $bestW = 1e9 }}{{ range $k := seq (sub $n 1) }}
+  {{ $top := 0.0 }}{{ $bottom := 0.0 }}
+  {{ range $j, $s := $stacks }}{{ if lt $j $k }}{{ $top = add $top $s.w $stackGap }}{{ else }}{{ $bottom = add $bottom $s.w $stackGap }}{{ end }}{{ end }}
+  {{ $wide := math.Max $top $bottom }}
+  {{ if lt $wide $bestW }}{{ $best = $k }}{{ $bestW = $wide }}{{ end }}
+{{ end }}{{ end }}
+{{ $half := div (sub $bestW $stackGap) 2 }}
+{{ $W := math.Ceil (add (mul 2 $margin) (math.Max (mul 2 $half) (mul 2 (add $Ro 40)))) }}
+{{ $cx := div $W 2 }}
+
+{{/* 3. Place each label on an arc: near the hub in the middle, level with it at the ends. */}}
+{{ $top := slice }}{{ $bottom := slice }}
+{{ range $j, $s := $stacks }}{{ if lt $j $best }}{{ $top = $top | append $s }}{{ else }}{{ $bottom = $bottom | append $s }}{{ end }}{{ end }}
+{{ $rows := slice (dict "up" true "stacks" $top) (dict "up" false "stacks" ($bottom | collections.Reverse)) }}
+{{ $laid := slice }}{{ $reachUp := add $Ro 20 }}{{ $reachDown := add $Ro 20 }}
+{{ range $rows }}
+  {{ $up := .up }}
+  {{ $width := 0.0 }}{{ range .stacks }}{{ $width = add $width .w $stackGap }}{{ end }}
+  {{ $x := sub $cx (div (sub $width $stackGap) 2) }}
+  {{ range .stacks }}
+    {{ $mid := add $x (div .w 2) }}
+    {{ $u := div (sub $mid $cx) (math.Max $half 1.0) }}
+    {{ $d := add $dMin (mul (sub $dMax $dMin) (sub 1 (mul $u $u))) }}
+    {{/* Keep labels clear of the ring. */}}
+    {{ $dx := math.Max 0.0 (sub (math.Abs (sub $mid $cx)) (div .lw 2)) }}
+    {{ $clear := add $Ro 34 }}
+    {{ if lt $dx $clear }}{{ $d = math.Max $d (math.Sqrt (sub (mul $clear $clear) (mul $dx $dx))) }}{{ end }}
+    {{ $reach := add $d .lh $labelGap .pillsH }}
+    {{ if $up }}{{ $reachUp = math.Max $reachUp $reach }}{{ else }}{{ $reachDown = math.Max $reachDown $reach }}{{ end }}
+    {{ $laid = $laid | append (merge . (dict "up" $up "mid" $mid "d" $d)) }}
+    {{ $x = add $x .w $stackGap }}
+  {{ end }}
+{{ end }}
+{{ $H := math.Ceil (add $reachUp $reachDown (mul 2 $margin)) }}
+{{ $cy := add $margin $reachUp }}
+
+{{/* 4. Ring segments: equal shares, turned so each points as nearly as possible at its label. */}}
+{{ $step := div (mul 2 math.Pi) $n }}
+{{ $sumS := 0.0 }}{{ $sumC := 0.0 }}
+{{ range $laid }}
+  {{ $ly := cond .up (sub $cy (add .d (div .lh 2))) (add $cy .d (div .lh 2)) }}
+  {{ $off := sub (math.Atan2 (sub $ly $cy) (sub .mid $cx)) (mul (add .i 0.5) $step) }}
+  {{ $sumS = add $sumS (math.Sin $off) }}{{ $sumC = add $sumC (math.Cos $off) }}
+{{ end }}
+{{ $turn := math.Atan2 $sumS $sumC }}
+{{ $gap := 0.012 }}{{/* radians left blank between segments */}}
+{{ $ring := dict }}
+{{ range $laid }}
+  {{ $a0 := add $turn (mul .i $step) $gap }}{{ $a1 := sub (add $turn (mul (add .i 1) $step)) $gap }}{{ $am := add $turn (mul (add .i 0.5) $step) }}
+  {{ $ir := div (add $Ro $Ri) 2 }}{{ $k := div 34.0 (math.Max .icon.w .icon.h) }}
+  {{ $ring = merge $ring (dict (string .num) (dict
+      "seg" (printf "M%.1f %.1fA%.0f %.0f 0 0 1 %.1f %.1fL%.1f %.1fA%.0f %.0f 0 0 0 %.1f %.1fZ"
+        (add $cx (mul $Ro (math.Cos $a0))) (add $cy (mul $Ro (math.Sin $a0))) $Ro $Ro
+        (add $cx (mul $Ro (math.Cos $a1))) (add $cy (mul $Ro (math.Sin $a1)))
+        (add $cx (mul $Ri (math.Cos $a1))) (add $cy (mul $Ri (math.Sin $a1))) $Ri $Ri
+        (add $cx (mul $Ri (math.Cos $a0))) (add $cy (mul $Ri (math.Sin $a0))))
+      "icon" (printf "translate(%.1f %.1f) scale(%.4f)"
+        (sub (add $cx (mul $ir (math.Cos $am))) (div (mul .icon.w $k) 2))
+        (sub (add $cy (mul $ir (math.Sin $am))) (div (mul .icon.h $k) 2)) $k)
+      "from" (printf "%.1f %.1f" (add $cx (mul (add $Ro 2) (math.Cos $am))) (add $cy (mul (add $Ro 2) (math.Sin $am)))))) }}
+{{ end }}
+
+{{ $hub := printf `<circle class="clusters-map__disc" cx="%.1f" cy="%.1f" r="%.0f"></circle><image href="%s" x="%.1f" y="%.1f" width="124" height="130"></image>` $cx $cy $disc ("img/FORRT%20Badge%20-%20Color%20-%20v4.webp" | relURL) (sub $cx 62) (sub $cy 65) | safeHTML }}
+<figure class="clusters-map" data-clusters-map>
+  {{/* The drawing is for pointers and eyes: it is hidden from assistive technology and none of its
+       links is a tab stop. The list below carries the same links for everyone. */}}
+  <div class="clusters-map__frame">
+  <svg class="clusters-map__art" viewBox="0 0 {{ $W }} {{ $H }}" width="{{ $W }}" height="{{ $H }}" aria-hidden="true" focusable="false">
+    {{ range sort $laid "i" }}
+    {{ $seg := index $ring (string .num) }}
+    {{ $lx := sub .mid (div .lw 2) }}
+    {{ $ly := cond .up (sub $cy .d .lh) (add $cy .d) }}
+    <g class="clusters-map__cluster" data-cluster="{{ .num }}" style="--c: {{ .color | safeCSS }}">
+      <path class="clusters-map__line" d="M{{ $seg.from }}L{{ printf "%.1f %.1f" .mid (add $ly (div .lh 2)) }}"></path>
+      <a href="{{ .href }}" tabindex="-1" class="clusters-map__seg">
+        <title>{{ .name }}</title>
+        <path d="{{ $seg.seg }}"></path>
+        <path class="clusters-map__icon" transform="{{ $seg.icon }}" d="{{ .icon.d }}"></path>
+      </a>
+      <a href="{{ .href }}" tabindex="-1" class="clusters-map__label">
+        <title>{{ .name }}</title>
+        <rect x="{{ printf "%.1f" $lx }}" y="{{ printf "%.1f" $ly }}" width="{{ .lw }}" height="{{ .lh }}" rx="12"></rect>
+        {{ $lmid := .mid }}<text>{{ range $li, $t := .lines }}<tspan x="{{ printf "%.1f" $lmid }}" y="{{ printf "%.1f" (add $ly $lpadY (mul $llh (add $li 0.5))) }}" dy=".35em">{{ $t }}</tspan>{{ end }}</text>
+      </a>
+      {{ $s := . }}
+      {{ $x0 := sub .mid (div .blockW 2) }}
+      {{ range .pills }}
+        {{ $px := add $x0 (mul .col (add $s.colW $colGap)) }}
+        {{ $py := cond $s.up (sub $ly $labelGap (sub (index $s.colH (string .col)) $pillGap)) (add $ly $s.lh $labelGap) }}
+        {{ $py = add $py .y }}
+      <a href="{{ .href }}" tabindex="-1" class="clusters-map__pill">
+        <title>{{ .title }}</title>
+        <rect x="{{ printf "%.1f" $px }}" y="{{ printf "%.1f" $py }}" width="{{ $s.colW }}" height="{{ .h }}" rx="{{ cond (gt (len .lines) 1) 16 (div .h 2) }}"></rect>
+        <text>{{ $tx := add $px (div $s.colW 2) }}{{ range $li, $t := .lines }}<tspan x="{{ printf "%.1f" $tx }}" y="{{ printf "%.1f" (add $py $padY (mul $lh (add $li 0.5))) }}" dy=".35em">{{ $t }}</tspan>{{ end }}</text>
+      </a>
+      {{ end }}
+    </g>
+    {{ end }}
+    {{ $hub }}
+  </svg>
+  </div>
+  {{/* Phones get the hub and the cluster labels; the pills are in the list and the full-size view. */}}
+  <div class="clusters-map__compact">
+    <svg class="clusters-map__hub" viewBox="{{ printf "%.1f %.1f %.1f %.1f" (sub $cx $Ro 4) (sub $cy $Ro 4) (add (mul 2 $Ro) 8) (add (mul 2 $Ro) 8) }}" aria-hidden="true" focusable="false">
+      {{ range sort $laid "i" }}{{ $seg := index $ring (string .num) }}
+      <g style="--c: {{ .color | safeCSS }}"><path class="clusters-map__segment" d="{{ $seg.seg }}"></path><path class="clusters-map__icon" transform="{{ $seg.icon }}" d="{{ .icon.d }}"></path></g>
+      {{ end }}
+      {{ $hub }}
+    </svg>
+    <ol class="clusters-map__chips">
+      {{ range sort $laid "i" }}
+      <li><a href="{{ .href }}" style="--c: {{ .color | safeCSS }}"><svg viewBox="0 0 {{ .icon.w }} {{ .icon.h }}" aria-hidden="true" focusable="false"><path d="{{ .icon.d }}"></path></svg><span>{{ .name }} <small>{{ len .pills }} sub-clusters</small></span></a></li>
+      {{ end }}
+    </ol>
+  </div>
+  <figcaption class="clusters-map__caption">
+    <button type="button" class="clusters-map__enlarge" hidden>Open full size</button>
+    <details class="clusters-map__list">
+      <summary>The {{ $n }} clusters and their sub-clusters as a list</summary>
+      <ol>
+        {{ range sort $laid "i" }}
+        <li><a href="{{ .href }}">{{ .name }}</a>
+          <ul>{{ range .pills }}<li><a href="{{ .href }}">{{ .title }}</a></li>{{ end }}</ul>
+        </li>
+        {{ end }}
+      </ol>
+    </details>
+  </figcaption>
+</figure>
+<script>
+(function () {
+  /* Hovering a cluster lights it up; "Open full size" shows the drawing in a dialog at its full size. */
+  var map = document.currentScript.previousElementSibling;
+  var art = map.querySelector('.clusters-map__art');
+  function point(svg) {
+    svg.querySelectorAll('.clusters-map__cluster').forEach(function (g) {
+      g.addEventListener('mouseenter', function () { svg.classList.add('is-pointing'); g.classList.add('is-active'); });
+      g.addEventListener('mouseleave', function () { svg.classList.remove('is-pointing'); g.classList.remove('is-active'); });
+    });
+  }
+  point(art);
+  var open = map.querySelector('.clusters-map__enlarge');
+  if (typeof HTMLDialogElement !== 'function') return;
+  var dialog = document.createElement('dialog');
+  dialog.className = 'clusters-map__dialog';
+  dialog.setAttribute('aria-label', 'Clusters map, full size');
+  dialog.innerHTML = '<button type="button" class="clusters-map__close">Close</button><div class="clusters-map__scroll"></div>';
+  var big = art.cloneNode(true);
+  dialog.querySelector('.clusters-map__scroll').append(big);
+  point(big);
+  document.body.append(dialog);
+  open.hidden = false;
+  var scroller = dialog.querySelector('.clusters-map__scroll');
+  var leaving = false;
+  open.addEventListener('click', function () {
+    leaving = false;
+    dialog.showModal();
+    /* Start with the hub in view. */
+    scroller.scrollLeft = (scroller.scrollWidth - scroller.clientWidth) / 2;
+    scroller.scrollTop = (scroller.scrollHeight - scroller.clientHeight) / 2;
+  });
+  dialog.querySelector('.clusters-map__close').addEventListener('click', function () { dialog.close(); });
+  dialog.addEventListener('click', function (event) {
+    if (event.target === dialog) { dialog.close(); return; }
+    if (event.target.closest('a')) { leaving = true; dialog.close(); } /* then the link takes the reader to its section */
+  });
+  dialog.addEventListener('close', function () { if (!leaving) open.focus({ preventScroll: true }); });
+})();
+</script>
+{{ end }}{{ end }}
diff --git a/layouts/partials/clusters/map_icons.html b/layouts/partials/clusters/map_icons.html
new file mode 100644
index 00000000000..c0790336ddb
--- /dev/null
+++ b/layouts/partials/clusters/map_icons.html
@@ -0,0 +1,5 @@
+{{/* Icons for the clusters map hub, keyed by cluster number. A cluster missing here gets the
+     fallback. Paths are Font Awesome Free 6.7.2 solid icons, the set the Doors pages use (icons
+     CC BY 4.0, https://fontawesome.com/license/free), from
+     @fortawesome/fontawesome-free@6.7.2/svgs/solid/<name>.svg. */}}
+{{ return (`{"by_cluster":{"1":"book-open","2":"laptop-code","3":"people-group","4":"clipboard-list","5":"chart-column","6":"cloud-arrow-up","7":"lock-open","8":"microscope","9":"building-columns","10":"comments","11":"scale-balanced"},"fallback":"circle-nodes","paths":{"book-open":{"w":576,"h":512,"d":"M249.6 471.5c10.8 3.8 22.4-4.1 22.4-15.5l0-377.4c0-4.2-1.6-8.4-5-11C247.4 52 202.4 32 144 32C93.5 32 46.3 45.3 18.1 56.1C6.8 60.5 0 71.7 0 83.8L0 454.1c0 11.9 12.8 20.2 24.1 16.5C55.6 460.1 105.5 448 144 448c33.9 0 79 14 105.6 23.5zm76.8 0C353 462 398.1 448 432 448c38.5 0 88.4 12.1 119.9 22.6c11.3 3.8 24.1-4.6 24.1-16.5l0-370.3c0-12.1-6.8-23.3-18.1-27.6C529.7 45.3 482.5 32 432 32c-58.4 0-103.4 20-123 35.6c-3.3 2.6-5 6.8-5 11L304 456c0 11.4 11.7 19.3 22.4 15.5z"},"laptop-code":{"w":640,"h":512,"d":"M64 96c0-35.3 28.7-64 64-64l384 0c35.3 0 64 28.7 64 64l0 256-64 0 0-256L128 96l0 256-64 0L64 96zM0 403.2C0 392.6 8.6 384 19.2 384l601.6 0c10.6 0 19.2 8.6 19.2 19.2c0 42.4-34.4 76.8-76.8 76.8L76.8 480C34.4 480 0 445.6 0 403.2zM281 209l-31 31 31 31c9.4 9.4 9.4 24.6 0 33.9s-24.6 9.4-33.9 0l-48-48c-9.4-9.4-9.4-24.6 0-33.9l48-48c9.4-9.4 24.6-9.4 33.9 0s9.4 24.6 0 33.9zM393 175l48 48c9.4 9.4 9.4 24.6 0 33.9l-48 48c-9.4 9.4-24.6 9.4-33.9 0s-9.4-24.6 0-33.9l31-31-31-31c-9.4-9.4-9.4-24.6 0-33.9s24.6-9.4 33.9 0z"},"people-group":{"w":640,"h":512,"d":"M72 88a56 56 0 1 1 112 0A56 56 0 1 1 72 88zM64 245.7C54 256.9 48 271.8 48 288s6 31.1 16 42.3l0-84.7zm144.4-49.3C178.7 222.7 160 261.2 160 304c0 34.3 12 65.8 32 90.5l0 21.5c0 17.7-14.3 32-32 32l-64 0c-17.7 0-32-14.3-32-32l0-26.8C26.2 371.2 0 332.7 0 288c0-61.9 50.1-112 112-112l32 0c24 0 46.2 7.5 64.4 20.3zM448 416l0-21.5c20-24.7 32-56.2 32-90.5c0-42.8-18.7-81.3-48.4-107.7C449.8 183.5 472 176 496 176l32 0c61.9 0 112 50.1 112 112c0 44.7-26.2 83.2-64 101.2l0 26.8c0 17.7-14.3 32-32 32l-64 0c-17.7 0-32-14.3-32-32zm8-328a56 56 0 1 1 112 0A56 56 0 1 1 456 88zM576 245.7l0 84.7c10-11.3 16-26.1 16-42.3s-6-31.1-16-42.3zM320 32a64 64 0 1 1 0 128 64 64 0 1 1 0-128zM240 304c0 16.2 6 31 16 42.3l0-84.7c-10 11.3-16 26.1-16 42.3zm144-42.3l0 84.7c10-11.3 16-26.1 16-42.3s-6-31.1-16-42.3zM448 304c0 44.7-26.2 83.2-64 101.2l0 42.8c0 17.7-14.3 32-32 32l-64 0c-17.7 0-32-14.3-32-32l0-42.8c-37.8-18-64-56.5-64-101.2c0-61.9 50.1-112 112-112l32 0c61.9 0 112 50.1 112 112z"},"clipboard-list":{"w":384,"h":512,"d":"M192 0c-41.8 0-77.4 26.7-90.5 64L64 64C28.7 64 0 92.7 0 128L0 448c0 35.3 28.7 64 64 64l256 0c35.3 0 64-28.7 64-64l0-320c0-35.3-28.7-64-64-64l-37.5 0C269.4 26.7 233.8 0 192 0zm0 64a32 32 0 1 1 0 64 32 32 0 1 1 0-64zM72 272a24 24 0 1 1 48 0 24 24 0 1 1 -48 0zm104-16l128 0c8.8 0 16 7.2 16 16s-7.2 16-16 16l-128 0c-8.8 0-16-7.2-16-16s7.2-16 16-16zM72 368a24 24 0 1 1 48 0 24 24 0 1 1 -48 0zm88 0c0-8.8 7.2-16 16-16l128 0c8.8 0 16 7.2 16 16s-7.2 16-16 16l-128 0c-8.8 0-16-7.2-16-16z"},"chart-column":{"w":512,"h":512,"d":"M32 32c17.7 0 32 14.3 32 32l0 336c0 8.8 7.2 16 16 16l400 0c17.7 0 32 14.3 32 32s-14.3 32-32 32L80 480c-44.2 0-80-35.8-80-80L0 64C0 46.3 14.3 32 32 32zM160 224c17.7 0 32 14.3 32 32l0 64c0 17.7-14.3 32-32 32s-32-14.3-32-32l0-64c0-17.7 14.3-32 32-32zm128-64l0 160c0 17.7-14.3 32-32 32s-32-14.3-32-32l0-160c0-17.7 14.3-32 32-32s32 14.3 32 32zm64 32c17.7 0 32 14.3 32 32l0 96c0 17.7-14.3 32-32 32s-32-14.3-32-32l0-96c0-17.7 14.3-32 32-32zM480 96l0 224c0 17.7-14.3 32-32 32s-32-14.3-32-32l0-224c0-17.7 14.3-32 32-32s32 14.3 32 32z"},"cloud-arrow-up":{"w":640,"h":512,"d":"M144 480C64.5 480 0 415.5 0 336c0-62.8 40.2-116.2 96.2-135.9c-.1-2.7-.2-5.4-.2-8.1c0-88.4 71.6-160 160-160c59.3 0 111 32.2 138.7 80.2C409.9 102 428.3 96 448 96c53 0 96 43 96 96c0 12.2-2.3 23.8-6.4 34.6C596 238.4 640 290.1 640 352c0 70.7-57.3 128-128 128l-368 0zm79-217c-9.4 9.4-9.4 24.6 0 33.9s24.6 9.4 33.9 0l39-39L296 392c0 13.3 10.7 24 24 24s24-10.7 24-24l0-134.1 39 39c9.4 9.4 24.6 9.4 33.9 0s9.4-24.6 0-33.9l-80-80c-9.4-9.4-24.6-9.4-33.9 0l-80 80z"},"lock-open":{"w":576,"h":512,"d":"M352 144c0-44.2 35.8-80 80-80s80 35.8 80 80l0 48c0 17.7 14.3 32 32 32s32-14.3 32-32l0-48C576 64.5 511.5 0 432 0S288 64.5 288 144l0 48L64 192c-35.3 0-64 28.7-64 64L0 448c0 35.3 28.7 64 64 64l320 0c35.3 0 64-28.7 64-64l0-192c0-35.3-28.7-64-64-64l-32 0 0-48z"},"microscope":{"w":512,"h":512,"d":"M160 32c0-17.7 14.3-32 32-32l32 0c17.7 0 32 14.3 32 32c17.7 0 32 14.3 32 32l0 224c0 17.7-14.3 32-32 32c0 17.7-14.3 32-32 32l-32 0c-17.7 0-32-14.3-32-32c-17.7 0-32-14.3-32-32l0-224c0-17.7 14.3-32 32-32zM32 448l288 0c70.7 0 128-57.3 128-128s-57.3-128-128-128l0-64c106 0 192 86 192 192c0 49.2-18.5 94-48.9 128l16.9 0c17.7 0 32 14.3 32 32s-14.3 32-32 32l-160 0L32 512c-17.7 0-32-14.3-32-32s14.3-32 32-32zm80-64l192 0c8.8 0 16 7.2 16 16s-7.2 16-16 16l-192 0c-8.8 0-16-7.2-16-16s7.2-16 16-16z"},"building-columns":{"w":512,"h":512,"d":"M243.4 2.6l-224 96c-14 6-21.8 21-18.7 35.8S16.8 160 32 160l0 8c0 13.3 10.7 24 24 24l400 0c13.3 0 24-10.7 24-24l0-8c15.2 0 28.3-10.7 31.3-25.6s-4.8-29.9-18.7-35.8l-224-96c-8-3.4-17.2-3.4-25.2 0zM128 224l-64 0 0 196.3c-.6 .3-1.2 .7-1.8 1.1l-48 32c-11.7 7.8-17 22.4-12.9 35.9S17.9 512 32 512l448 0c14.1 0 26.5-9.2 30.6-22.7s-1.1-28.1-12.9-35.9l-48-32c-.6-.4-1.2-.7-1.8-1.1L448 224l-64 0 0 192-40 0 0-192-64 0 0 192-48 0 0-192-64 0 0 192-40 0 0-192zM256 64a32 32 0 1 1 0 64 32 32 0 1 1 0-64z"},"comments":{"w":640,"h":512,"d":"M208 352c114.9 0 208-78.8 208-176S322.9 0 208 0S0 78.8 0 176c0 38.6 14.7 74.3 39.6 103.4c-3.5 9.4-8.7 17.7-14.2 24.7c-4.8 6.2-9.7 11-13.3 14.3c-1.8 1.6-3.3 2.9-4.3 3.7c-.5 .4-.9 .7-1.1 .8l-.2 .2s0 0 0 0s0 0 0 0C1 327.2-1.4 334.4 .8 340.9S9.1 352 16 352c21.8 0 43.8-5.6 62.1-12.5c9.2-3.5 17.8-7.4 25.2-11.4C134.1 343.3 169.8 352 208 352zM448 176c0 112.3-99.1 196.9-216.5 207C255.8 457.4 336.4 512 432 512c38.2 0 73.9-8.7 104.7-23.9c7.5 4 16 7.9 25.2 11.4c18.3 6.9 40.3 12.5 62.1 12.5c6.9 0 13.1-4.5 15.2-11.1c2.1-6.6-.2-13.8-5.8-17.9c0 0 0 0 0 0s0 0 0 0l-.2-.2c-.2-.2-.6-.4-1.1-.8c-1-.8-2.5-2-4.3-3.7c-3.6-3.3-8.5-8.1-13.3-14.3c-5.5-7-10.7-15.4-14.2-24.7c24.9-29 39.6-64.7 39.6-103.4c0-92.8-84.9-168.9-192.6-175.5c.4 5.1 .6 10.3 .6 15.5z"},"scale-balanced":{"w":640,"h":512,"d":"M384 32l128 0c17.7 0 32 14.3 32 32s-14.3 32-32 32L398.4 96c-5.2 25.8-22.9 47.1-46.4 57.3L352 448l160 0c17.7 0 32 14.3 32 32s-14.3 32-32 32l-192 0-192 0c-17.7 0-32-14.3-32-32s14.3-32 32-32l160 0 0-294.7c-23.5-10.3-41.2-31.6-46.4-57.3L128 96c-17.7 0-32-14.3-32-32s14.3-32 32-32l128 0c14.6-19.4 37.8-32 64-32s49.4 12.6 64 32zm55.6 288l144.9 0L512 195.8 439.6 320zM512 416c-62.9 0-115.2-34-126-78.9c-2.6-11 1-22.3 6.7-32.1l95.2-163.2c5-8.6 14.2-13.8 24.1-13.8s19.1 5.3 24.1 13.8l95.2 163.2c5.7 9.8 9.3 21.1 6.7 32.1C627.2 382 574.9 416 512 416zM126.8 195.8L54.4 320l144.9 0L126.8 195.8zM.9 337.1c-2.6-11 1-22.3 6.7-32.1l95.2-163.2c5-8.6 14.2-13.8 24.1-13.8s19.1 5.3 24.1 13.8l95.2 163.2c5.7 9.8 9.3 21.1 6.7 32.1C242 382 189.7 416 126.8 416S11.7 382 .9 337.1z"},"circle-nodes":{"w":512,"h":512,"d":"M418.4 157.9c35.3-8.3 61.6-40 61.6-77.9c0-44.2-35.8-80-80-80c-43.4 0-78.7 34.5-80 77.5L136.2 151.1C121.7 136.8 101.9 128 80 128c-44.2 0-80 35.8-80 80s35.8 80 80 80c12.2 0 23.8-2.7 34.1-7.6L259.7 407.8c-2.4 7.6-3.7 15.8-3.7 24.2c0 44.2 35.8 80 80 80s80-35.8 80-80c0-27.7-14-52.1-35.4-66.4l37.8-207.7zM156.3 232.2c2.2-6.9 3.5-14.2 3.7-21.7l183.8-73.5c3.6 3.5 7.4 6.7 11.6 9.5L317.6 354.1c-5.5 1.3-10.8 3.1-15.8 5.5L156.3 232.2z"}}}` | transform.Unmarshal) }}
diff --git a/layouts/partials/clusters/map_metrics.html b/layouts/partials/clusters/map_metrics.html
new file mode 100644
index 00000000000..dd77fe5f3c3
--- /dev/null
+++ b/layouts/partials/clusters/map_metrics.html
@@ -0,0 +1,4 @@
+{{/* Advance widths (units per 1000 em) of Source Sans 3 at weights 400 and 700, read from
+     static/fonts/doors/source-sans-3-var.woff2 with fontTools. map.html wraps the pill and label
+     text with them at build time. Characters not listed count as 560. */}}
+{{ return (`{"400":{" ":200,"!":289,"\"":426,"#":497,"$":497,"%":824,"&":609,"'":249,"(":303,")":303,"*":418,"+":497,",":249,"-":311,".":249,"/":350,"0":497,"1":497,"2":497,"3":497,"4":497,"5":497,"6":497,"7":497,"8":497,"9":497,":":249,";":249,"<":497,"=":497,">":497,"?":425,"@":847,"A":543,"B":588,"C":571,"D":615,"E":527,"F":494,"G":617,"H":652,"I":263,"J":479,"K":579,"L":486,"M":727,"N":647,"O":664,"P":566,"Q":664,"R":569,"S":534,"T":536,"U":645,"V":515,"W":786,"X":513,"Y":476,"Z":539,"[":303,"\\":350,"]":303,"^":497,"_":500,"a":504,"b":553,"c":456,"d":555,"e":496,"f":292,"g":504,"h":544,"i":246,"j":247,"k":495,"l":255,"m":829,"n":547,"o":542,"p":555,"q":555,"r":347,"s":419,"t":338,"u":544,"v":467,"w":719,"x":446,"y":467,"z":425,"{":303,"|":241,"}":303,"~":497,"‘":249,"’":249,"“":426,"”":426,"–":480,"—":800,"é":496},"700":{" ":200,"!":340,"\"":537,"#":528,"$":528,"%":857,"&":667,"'":300,"(":344,")":344,"*":457,"+":528,",":300,"-":332,".":300,"/":338,"0":528,"1":528,"2":528,"3":528,"4":528,"5":528,"6":528,"7":528,"8":528,"9":528,":":300,";":300,"<":528,"=":528,">":528,"?":463,"@":902,"A":572,"B":605,"C":582,"D":635,"E":548,"F":524,"G":638,"H":674,"I":301,"J":508,"K":615,"L":518,"M":763,"N":665,"O":684,"P":596,"Q":684,"R":613,"S":556,"T":556,"U":665,"V":556,"W":814,"X":567,"Y":525,"Z":541,"[":344,"\\":338,"]":344,"^":528,"_":500,"a":527,"b":572,"c":468,"d":573,"e":518,"f":341,"g":534,"h":571,"i":276,"j":278,"k":548,"l":286,"m":857,"n":573,"o":555,"p":573,"q":573,"r":398,"s":443,"t":383,"u":568,"v":523,"w":777,"x":513,"y":521,"z":461,"{":344,"|":267,"}":344,"~":528,"‘":300,"’":300,"“":537,"”":537,"–":480,"—":800,"é":518}}` | transform.Unmarshal) }}
diff --git a/layouts/partials/clusters/map_wrap.html b/layouts/partials/clusters/map_wrap.html
new file mode 100644
index 00000000000..147af0490ab
--- /dev/null
+++ b/layouts/partials/clusters/map_wrap.html
@@ -0,0 +1,35 @@
+{{/* Wrap text into lines no wider than .width at font .size and .weight ("400" or "700"),
+     using Source Sans 3's advance widths. Returns dict: lines (slice), widest (number).
+     With .max_lines, a longer text keeps that many lines and ends the last one with "…". */}}
+{{ $tab := index (partialCached "clusters/map_metrics.html" "metrics") .weight }}
+{{/* 4% headroom: browsers set text up to a few per cent wider than the advance widths
+     (Chromium on Linux overflowed pills that fitted on macOS with under 1 px to spare). */}}
+{{ $scale := mul (div (float .size) 1000) 1.04 }}
+{{ $space := mul (index $tab " ") $scale }}
+{{ $lines := slice }}{{ $widths := slice }}
+{{ $cur := "" }}{{ $curW := 0.0 }}
+{{ range split .text " " }}
+  {{ if . }}
+    {{ $w := 0.0 }}
+    {{ range split . "" }}{{ $w = add $w (or (index $tab .) 560) }}{{ end }}
+    {{ $w = mul $w $scale }}
+    {{ if eq $cur "" }}
+      {{ $cur = . }}{{ $curW = $w }}
+    {{ else if gt (add $curW $space $w) $.width }}
+      {{ $lines = $lines | append $cur }}{{ $widths = $widths | append $curW }}
+      {{ $cur = . }}{{ $curW = $w }}
+    {{ else }}
+      {{ $cur = printf "%s %s" $cur . }}{{ $curW = add $curW $space $w }}
+    {{ end }}
+  {{ end }}
+{{ end }}
+{{ if ne $cur "" }}{{ $lines = $lines | append $cur }}{{ $widths = $widths | append $curW }}{{ end }}
+{{ with .max_lines }}{{ if gt (len $lines) . }}
+  {{ $keep := first . $lines }}
+  {{ $last := index $keep (sub . 1) }}
+  {{/* Drop the last word (it is at least as wide as the ellipsis) and mark the cut. */}}
+  {{ $last = replaceRE `[\s,;:&–-]*\S+$` "" $last }}
+  {{ $lines = (first (sub . 1) $keep) | append (printf "%s…" $last) }}
+  {{ $widths = first . $widths }}
+{{ end }}{{ end }}
+{{ return dict "lines" $lines "widest" (math.Max 0.0 $widths) }}
diff --git a/layouts/partials/clusters/rich_text.html b/layouts/partials/clusters/rich_text.html
new file mode 100644
index 00000000000..84f8922fca2
--- /dev/null
+++ b/layouts/partials/clusters/rich_text.html
@@ -0,0 +1,8 @@
+{{- /* Publication titles from Crossref: plain text plus <i>, <em> and <scp> markup, sometimes
+       with HTML entities. Escape everything, then restore only those tags (scp as small caps).
+       static/js/featured-resources.js has the same rule (richText). */ -}}
+{{- $s := . | default "" | htmlUnescape | replaceRE `\s+` " " | strings.TrimSpace | htmlEscape -}}
+{{- $s = replaceRE `&lt;i&gt;(.*?)&lt;/i&gt;` "<i>$1</i>" $s -}}
+{{- $s = replaceRE `&lt;em&gt;(.*?)&lt;/em&gt;` "<i>$1</i>" $s -}}
+{{- $s = replaceRE `&lt;scp&gt;(.*?)&lt;/scp&gt;` `<span class="scp">$1</span>` $s -}}
+{{- return ($s | safeHTML) -}}
diff --git a/layouts/partials/clusters/sidebar_nav.html b/layouts/partials/clusters/sidebar_nav.html
index c39c0cef17c..bd01ed17eaa 100644
--- a/layouts/partials/clusters/sidebar_nav.html
+++ b/layouts/partials/clusters/sidebar_nav.html
@@ -6,7 +6,7 @@
 
 <div class="col-lg-4 col-xl-3 clusters-sidebar" id="clusters-sidebar">
   <div class="clusters-sidebar-inner">
-    <div class="sidebar-header">Clusters &amp; Sub-clusters</div>
+    <div class="sidebar-header">Clusters &amp; Sub-clusters<button type="button" class="sidebar-close d-lg-none">Close</button></div>
     <nav id="cluster-nav">
       {{ range $ci, $cluster := $data.clusters }}
       {{ $cid := printf "cluster-%d" (int $cluster.number) }}
@@ -16,7 +16,7 @@
       <div class="cluster-nav-group" data-cluster="{{ $cid }}">
         <a href="{{ $clusterHref }}" class="cluster-nav-heading"{{ if $isActive }} aria-current="page"{{ end }}>
           {{ $arrowColor := index $arrowColors (mod $ci (len $arrowColors)) }}
-          <span class="cluster-nav-toggle" style="color:{{ $arrowColor }};">{{ if $isActive }}&#9662;{{ else }}&#9656;{{ end }}</span>
+          <span class="cluster-nav-toggle" style="color:{{ $arrowColor | safeCSS }};">{{ if $isActive }}&#9662;{{ else }}&#9656;{{ end }}</span>
           {{ $cluster.name }}
         </a>
         <ul class="cluster-nav-subs" style="display:{{ if $isActive }}block{{ else }}none{{ end }};">
diff --git a/layouts/partials/cookie_consent.html b/layouts/partials/cookie_consent.html
index ef4c8f32ab7..1a52bfe9fa2 100644
--- a/layouts/partials/cookie_consent.html
+++ b/layouts/partials/cookie_consent.html
@@ -1,12 +1,12 @@
+{{/* Ask before starting analytics. Colours are in assets/css/doors/inner.css, not the plug-in's palette. */}}
 {{ if site.Params.privacy_pack }}
-  {{ $scr := .Scratch }}
   {{ $ga := "" }}
   {{ if in (slice (getenv "HUGO_ENV") hugo.Environment) "production" }}
     {{ $ga = site.Params.marketing.google_tag_manager }}
   {{ end }}
   <link rel="stylesheet" href="{{ "vendor/cookieconsent/cookieconsent.min.css" | relURL }}">
   <style>.cc-revoke { display: none !important; } .cc-compliance .cc-btn { min-width: 140px; }</style>
-  <script src="{{ "vendor/cookieconsent/cookieconsent.min.js" | relURL }}"></script>
+  <script src="{{ "vendor/cookieconsent/cookieconsent.min.js" | relURL }}" defer></script>
   <script>
   (function () {
     var gaId = {{ $ga }};
@@ -53,10 +53,6 @@
       window.cookieconsent.initialise({
         type: "opt-in",
         cookie: { name: "forrt_analytics_choice", expiryDays: 365, secure: location.protocol === "https:" },
-        palette: {
-          popup: { background: "{{ $scr.Get "primary" }}", text: "{{ $scr.Get "background" }}" },
-          button: { background: "{{ $scr.Get "background" }}", text: "{{ $scr.Get "primary" }}" }
-        },
         theme: "classic",
         compliance: { "opt-in": '<div class="cc-compliance">{{ "{{deny}}{{allow}}" | safeJS }}</div>' },
         {{/* The plug-in's own buttons are links with no address, which Enter cannot press, and its labels don't match what they say. */}}
diff --git a/layouts/partials/disciplines/all_fields.html b/layouts/partials/disciplines/all_fields.html
index c52634dac88..9da1256d7c3 100644
--- a/layouts/partials/disciplines/all_fields.html
+++ b/layouts/partials/disciplines/all_fields.html
@@ -19,11 +19,11 @@
   <div class="row">
     {{ partial "disciplines/sidebar_nav.html" (dict "data" $data "arrowColors" $arrowColors "link_mode" "anchor") }}
 
-    <main class="col-12 col-lg-8 col-xl-9 clusters-content">
+    <div class="col-12 col-lg-8 col-xl-9 clusters-content">
       {{ range $fi, $field := $data.fields }}
         {{ partial "disciplines/field_section.html" (dict "field" $field "fi" $fi "colors" $colors "show_leads" $showLeads) }}
       {{ end }}
-    </main>
+    </div>
   </div>
 </div>
 
diff --git a/layouts/partials/disciplines/citation.html b/layouts/partials/disciplines/citation.html
index c591b635e46..f8f11702876 100644
--- a/layouts/partials/disciplines/citation.html
+++ b/layouts/partials/disciplines/citation.html
@@ -1,5 +1,5 @@
 {{/* Collapsed citation guidance for the disciplines page. */}}
-{{ $preprintCitation := "Farran, E. K., Silverstein, P., Ameen, A. A., Misheva, I., & Gilmore, C. (2020, December 15). Open Research: Examples of good practice, and resources across disciplines (2026 edition). https://doi.org/10.31219/osf.io/3r8hb" }}
+{{ $preprintCitation := "Farran, E. K., Silverstein, P., Ameen, A. A., Misheva, I., & Gilmore, C. (2025, October 27). Open Research: Examples of good practice, and resources across disciplines (2026 edition). https://doi.org/10.31219/osf.io/3r8hb" }}
 {{ $webCitation := "" }}
 {{ $webCitationHTML := "" }}
 {{ with site.Data.disciplines_citation }}
@@ -12,9 +12,7 @@
 
   <div class="cite-us-item">
     <div class="cite-us-text">
-      <span class="disciplines-cite-lead">The preprint:</span>
-      Farran, E. K., Silverstein, P., Ameen, A. A., Misheva, I., &amp; Gilmore, C. (2020, December 15). Open Research: Examples of good practice, and resources across disciplines (2026 edition).
-      <a href="https://doi.org/10.31219/osf.io/3r8hb" target="_blank" rel="noopener" class="doi-link">https://doi.org/10.31219/osf.io/3r8hb</a>
+      <p><span class="disciplines-cite-lead">The preprint:</span> Farran, E. K., Silverstein, P., Ameen, A. A., Misheva, I., &amp; Gilmore, C. (2025, October 27). Open Research: Examples of good practice, and resources across disciplines (2026 edition). <a href="https://doi.org/10.31219/osf.io/3r8hb" target="_blank" rel="noopener" class="doi-link">https://doi.org/10.31219/osf.io/3r8hb</a></p>
     </div>
     <button class="copy-button" onclick="copyDisciplinesCitation(this, 'preprint')">
       <svg class="copy-icon" fill="none" stroke="currentColor" viewBox="0 0 24 24">
@@ -27,8 +25,7 @@
   {{ if $webCitationHTML }}
   <div class="cite-us-item">
     <div class="cite-us-text">
-      <span class="disciplines-cite-lead">This web resource:</span>
-      {{ $webCitationHTML | safeHTML }}
+      <p><span class="disciplines-cite-lead">This web resource:</span> {{ partial "citations/authors" $webCitationHTML }}</p>
     </div>
     <button class="copy-button" onclick="copyDisciplinesCitation(this, 'web')">
       <svg class="copy-icon" fill="none" stroke="currentColor" viewBox="0 0 24 24">
diff --git a/layouts/partials/disciplines/colors.html b/layouts/partials/disciplines/colors.html
index cb505a5ca78..1ecd11cbe31 100644
--- a/layouts/partials/disciplines/colors.html
+++ b/layouts/partials/disciplines/colors.html
@@ -1,4 +1,4 @@
 {{/* Shared color palettes for disciplines page — 11 fields */}}
-{{ $colors := slice "#cacfdc" "#eadce6" "#d4e4d9" "#BDC5CA" "#dce4ea" "#e8ddd4" "#c9dbcb" "#d9cfe0" "#cddde3" "#e0d8cc" "#d4dce8" }}
-{{ $arrowColors := slice "#6070a0" "#a05080" "#408060" "#607080" "#5080a0" "#a08060" "#509060" "#8060a0" "#5090a0" "#907050" "#6070a0" }}
+{{ $colors := slice "var(--res-bg)" "var(--jus-bg)" "var(--edu-bg)" "var(--com-bg)" "var(--surface)" }}
+{{ $arrowColors := slice "var(--res)" "var(--jus)" "var(--edu)" "var(--com)" "var(--soft)" }}
 {{ return dict "colors" $colors "arrowColors" $arrowColors }}
diff --git a/layouts/partials/disciplines/field_section.html b/layouts/partials/disciplines/field_section.html
index 5b4d482ce89..4fc0255fde8 100644
--- a/layouts/partials/disciplines/field_section.html
+++ b/layouts/partials/disciplines/field_section.html
@@ -8,9 +8,9 @@
 {{ $totalRes := 0 }}{{ range $field.disciplines }}{{ $totalRes = add $totalRes (len .resources) }}{{ end }}
 
 {{/* Category badge colors */}}
-{{ $catColors := dict "General" "#6c757d" "Open Data" "#17a2b8" "Open Methods" "#28a745" "Open Outputs" "#fd7e14" "Open Education" "#6f42c1" }}
+{{ $catColors := dict "General" "var(--soft)" "Open Data" "var(--res)" "Open Methods" "var(--edu)" "Open Outputs" "var(--com)" "Open Education" "var(--jus)" }}
 
-<section id="{{ $fid }}" class="cluster-section" style="background-color: {{ $color }};">
+<section id="{{ $fid }}" class="cluster-section" style="background-color: {{ $color | safeCSS }};">
   <div class="cluster-header">
     <h2 class="cluster-title">
       <span class="cluster-number">{{ (int $field.number) }}</span>
@@ -41,9 +41,9 @@ <h2 class="cluster-title">
     {{ $slug := $disc.name | lower | replaceRE "[^a-z0-9]+" "-" | replaceRE "^-+|-+$" "" }}
     {{ $did := $slug }}
     <div class="acc-section" id="{{ $did }}">
-      <div class="acc-header" role="button" tabindex="0">
-        <span class="acc-chevron">&#9656;</span>
-        <h3 class="acc-label">{{ $disc.name }}</h3>
+      <div class="acc-header">
+        <span class="acc-chevron" aria-hidden="true">&#9656;</span>
+        <h3 class="acc-label"><button type="button" class="acc-trigger" aria-expanded="false">{{ $disc.name }}</button></h3>
         {{ if $showLeads }}
         {{ with $disc.leads }}
         <span class="acc-leads">
@@ -69,7 +69,7 @@ <h3 class="acc-label">{{ $disc.name }}</h3>
         <ul class="publication-list disciplines-resource-list">
           {{ range $disc.resources }}
           <li class="publication-item disciplines-resource-item">
-            {{ $badgeColor := index $catColors .category | default "#6c757d" }}
+            {{ $badgeColor := index $catColors .category | default "var(--soft)" | safeCSS }}
             <span class="badge disciplines-category-badge" style="background:{{ $badgeColor }};color:#fff;">{{ .category }}</span>
             {{ if .link }}
               <a href="{{ .link }}" target="_blank" rel="noopener">{{ .title }}</a>
diff --git a/layouts/partials/disciplines/intro.html b/layouts/partials/disciplines/intro.html
index c10091af977..5c3b52e16ba 100644
--- a/layouts/partials/disciplines/intro.html
+++ b/layouts/partials/disciplines/intro.html
@@ -29,9 +29,7 @@
 
         <div class="cite-us-item">
           <div class="cite-us-text">
-            <span class="disciplines-cite-lead">The preprint:</span>
-            Farran, E. K., Silverstein, P., Ameen, A. A., Misheva, I., &amp; Gilmore, C. (2020, December 15). Open Research: Examples of good practice, and resources across disciplines (2026 edition).
-            <a href="https://doi.org/10.31219/osf.io/3r8hb" target="_blank" rel="noopener" class="doi-link">https://doi.org/10.31219/osf.io/3r8hb</a>
+            <p><span class="disciplines-cite-lead">The preprint:</span> Farran, E. K., Silverstein, P., Ameen, A. A., Misheva, I., &amp; Gilmore, C. (2025, October 27). Open Research: Examples of good practice, and resources across disciplines (2026 edition). <a href="https://doi.org/10.31219/osf.io/3r8hb" target="_blank" rel="noopener" class="doi-link">https://doi.org/10.31219/osf.io/3r8hb</a></p>
           </div>
           <button class="copy-button" onclick="copyDisciplinesCitation(this, 'preprint')">
             <svg class="copy-icon" fill="none" stroke="currentColor" viewBox="0 0 24 24">
@@ -44,8 +42,7 @@
         {{ if $webCitationHTML }}
         <div class="cite-us-item">
           <div class="cite-us-text">
-            <span class="disciplines-cite-lead">This web resource:</span>
-            {{ $webCitationHTML | safeHTML }}
+            <p><span class="disciplines-cite-lead">This web resource:</span> {{ partial "citations/authors" $webCitationHTML }}</p>
           </div>
           <button class="copy-button" onclick="copyDisciplinesCitation(this, 'web')">
             <svg class="copy-icon" fill="none" stroke="currentColor" viewBox="0 0 24 24">
@@ -58,8 +55,15 @@
       </details>
 
       <p class="intro-paragraph">
-        Use the sidebar to jump to your overarching field and specific discipline. Resources are categorised into five areas: <span class="badge" style="background:#6c757d;color:#fff;">General</span> <span class="badge" style="background:#17a2b8;color:#fff;">Open Data</span> <span class="badge" style="background:#28a745;color:#fff;">Open Methods</span> <span class="badge" style="background:#fd7e14;color:#fff;">Open Outputs</span> <span class="badge" style="background:#6f42c1;color:#fff;">Open Education</span>.
+        Jump to your field and discipline from the list of fields. Resources are grouped into five areas:
       </p>
+      <ul class="disciplines-areas">
+        <li><span class="badge" style="background:var(--soft);color:#fff;">General</span></li>
+        <li><span class="badge" style="background:var(--res);color:#fff;">Open Data</span></li>
+        <li><span class="badge" style="background:var(--edu);color:#fff;">Open Methods</span></li>
+        <li><span class="badge" style="background:var(--com);color:#fff;">Open Outputs</span></li>
+        <li><span class="badge" style="background:var(--jus);color:#fff;">Open Education</span></li>
+      </ul>
       <p class="intro-paragraph">
         If you have resources or disciplines to add, or spot errors, please <a href="https://docs.google.com/forms/d/e/1FAIpQLSfs-BCYWGet5QNZAWQ8IQVZ05TAUUwvD4mkc31Ehrm5tK8q3Q/viewform" target="_blank" rel="noopener">fill out this form</a>.
       </p>
@@ -76,7 +80,7 @@
 
 <script>
   var disciplinesCitations = {
-    preprint: {{ "Farran, E. K., Silverstein, P., Ameen, A. A., Misheva, I., & Gilmore, C. (2020, December 15). Open Research: Examples of good practice, and resources across disciplines (2026 edition). https://doi.org/10.31219/osf.io/3r8hb" | jsonify | safeJS }},
+    preprint: {{ "Farran, E. K., Silverstein, P., Ameen, A. A., Misheva, I., & Gilmore, C. (2025, October 27). Open Research: Examples of good practice, and resources across disciplines (2026 edition). https://doi.org/10.31219/osf.io/3r8hb" | jsonify | safeJS }},
     web: {{ with site.Data.disciplines_citation }}{{ .web | default "" | jsonify | safeJS }}{{ else }}""{{ end }}
   };
 
diff --git a/layouts/partials/disciplines/sidebar_nav.html b/layouts/partials/disciplines/sidebar_nav.html
index b774a203b98..7b2228631b0 100644
--- a/layouts/partials/disciplines/sidebar_nav.html
+++ b/layouts/partials/disciplines/sidebar_nav.html
@@ -5,7 +5,7 @@
 
 <div class="col-lg-4 col-xl-3 clusters-sidebar" id="clusters-sidebar">
   <div class="clusters-sidebar-inner">
-    <div class="sidebar-header">Fields &amp; Disciplines</div>
+    <div class="sidebar-header">Fields &amp; Disciplines<button type="button" class="sidebar-close d-lg-none">Close</button></div>
     <nav id="cluster-nav">
       {{ range $fi, $field := $data.fields }}
       {{ $fid := printf "field-%d" (int $field.number) }}
@@ -13,7 +13,7 @@
       <div class="cluster-nav-group" data-cluster="{{ $fid }}">
         <a href="{{ $fieldHref }}" class="cluster-nav-heading">
           {{ $arrowColor := index $arrowColors (mod $fi (len $arrowColors)) }}
-          <span class="cluster-nav-toggle" style="color:{{ $arrowColor }};">&#9656;</span>
+          <span class="cluster-nav-toggle" style="color:{{ $arrowColor | safeCSS }};">&#9656;</span>
           {{ $field.name }}
         </a>
         <ul class="cluster-nav-subs" style="display:none;">
diff --git a/layouts/partials/docs_layout.html b/layouts/partials/docs_layout.html
index cd54cf09537..3e29d70418e 100644
--- a/layouts/partials/docs_layout.html
+++ b/layouts/partials/docs_layout.html
@@ -1,58 +1,2 @@
-{{ $current_page := . }}
-
-<div class="container-fluid docs">
-  <div class="row flex-xl-nowrap">
-    <div class="col-12 col-md-3 col-xl-2 docs-sidebar">
-      {{ partial "docs_sidebar" . }}
-    </div>
-    
-    {{ if .Params.toc }}
-    <div class="d-none d-xl-block col-xl-3 docs-toc">
-      <ul class="nav toc-top">
-        <li><a href="#" id="back_to_top" class="docs-toc-title">{{ i18n "on_this_page" }}</a></li>
-      </ul>
-      
-      {{ if eq .Title "Diversity, Equity, & Inclusion"}}
-      {{ partial "toc_dei" . }}
-      {{ partial "docs_toc_foot" . }}
-      {{ else}}
-      {{ partial "toc" . }}
-      {{ partial "docs_toc_foot" . }}
-      {{end}}
-    </div>
-    {{ end }}
-
-    <main class="col-12 col-md-9 col-xl-8 py-md-3 pl-md-5 docs-content" role="main">
-
-      <article class="article">
-
-        <div class="docs-article-container mx-auto">
-          <h1>{{ .Title }}</h1>
-
-          <div class="article-style">
-            {{ .Content }}
-          </div>
-
-          {{ partial "tags.html" . }}
-
-          {{ if site.Params.docs_section_pager }}
-          <div class="article-widget">
-            {{ partial "section_pager" . }}
-          </div>
-          {{ end }}
-        </div>
-
-        <div class="body-footer">
-          <p>{{ i18n "last_updated" }} {{ $.Lastmod.Format site.Params.date_format }}</p>
-
-          {{ partial "page_edit" . }}
-
-          {{ partial "comments" . }}
-        </div>
-
-      </article>
-      {{ partial "site_footer" . }}
-
-    </main>
-  </div>
-</div>
+{{/* A summaries page, on the reading layout with its contents in the side card. */}}
+{{ partial "doors/reading" . }}
diff --git a/layouts/partials/doors/analysis/bars.html b/layouts/partials/doors/analysis/bars.html
new file mode 100644
index 00000000000..f2fd1706902
--- /dev/null
+++ b/layouts/partials/doors/analysis/bars.html
@@ -0,0 +1,8 @@
+{{/* Ranked bars with their numbers in text, so the list is its own alternative. Input: dict with
+     `rows` (each with `name` and `n`) and `max`, the value of a full-width bar. */}}
+{{ $max := .max }}
+<ol class="bars">
+  {{ range .rows }}
+  <li class="bar"><span class="bar-name">{{ .name }}</span><span class="bar-value">{{ .n }}</span><span class="bar-track" aria-hidden="true"><span class="bar-fill" style="--share:{{ div (mul 100.0 .n) $max }}%"></span></span></li>
+  {{ end }}
+</ol>
diff --git a/layouts/partials/doors/analysis/network.html b/layouts/partials/doors/analysis/network.html
new file mode 100644
index 00000000000..37a6ba47d94
--- /dev/null
+++ b/layouts/partials/doors/analysis/network.html
@@ -0,0 +1,79 @@
+{{/* The contributor network: a drawing with assets/js/doors/network.js behind it, and the same
+     connections as a list of projects, which is what readers get without scripts. Input: dict with
+     `network` (see network_data.html) and `counts`, the page's totals or an empty dict. */}}
+{{ $network := .network }}
+{{ $members := dict }}
+{{ range $network.people }}
+  {{ $name := printf "%s (%v)" (index . 0) (index . 1) }}
+  {{ range index . 4 }}
+    {{ $key := string . }}
+    {{ $members = merge $members (dict $key ((index $members $key | default slice) | append $name)) }}
+  {{ end }}
+{{ end }}
+{{ $list := slice }}
+{{ range $i, $project := $network.projects }}
+  {{ $names := index $members (string $i) | default slice }}
+  {{ $list = $list | append (dict "name" (index $project 0) "people" $names "n" (len $names)) }}
+{{ end }}
+{{ $people := len $network.people }}
+{{ $projects := len $network.projects }}
+{{ $summary := printf "%d people and the %d projects they worked on." $people $projects }}
+{{ with $network.largest_group }}{{ $summary = printf "%s %d of those people are connected to one another through shared projects, directly or through others." $summary (int .) }}{{ end }}
+<section class="analysis-network" aria-labelledby="analysis-network-title" data-analysis-network>
+  <div class="network-intro">
+    <h2 id="analysis-network-title">Who has worked with whom</h2>
+    <p>This network shows {{ $summary }} Two people are connected when they share a project{{ with $network.pairs }}, which gives {{ lang.FormatNumberCustom 0 . }} connected pairs{{ end }}.</p>
+    <p class="analysis-note">It uses contribution roles only. The totals above also count project-leadership records and entries with no role listed, so they are higher.</p>
+  </div>
+  <div class="network-panel" data-network-panel hidden>
+    <div class="network-controls">
+      <div class="network-field">
+        <label for="network-person">Find a person</label>
+        <div class="network-combo">
+          <input id="network-person" class="network-input" type="text" role="combobox" aria-expanded="false" aria-controls="network-person-list" aria-autocomplete="list" autocomplete="off" spellcheck="false" placeholder="Type a name">
+          <ul id="network-person-list" class="network-options" role="listbox" aria-label="People" hidden></ul>
+        </div>
+      </div>
+      <div class="network-field">
+        <label for="network-project">Show projects</label>
+        <div class="network-combo">
+          <input id="network-project" class="network-input" type="text" role="combobox" aria-expanded="false" aria-controls="network-project-list" aria-autocomplete="list" autocomplete="off" spellcheck="false" placeholder="Choose or type a project">
+          <ul id="network-project-list" class="network-options" role="listbox" aria-label="Projects" hidden></ul>
+        </div>
+        <ul class="network-chips" data-network-chips aria-label="Projects shown" hidden></ul>
+      </div>
+      <p class="network-status" role="status" data-network-status>Nothing selected. Showing everyone.</p>
+      <div class="network-detail" data-network-detail hidden></div>
+      <div class="network-guide" data-network-guide>
+        <h3>How to read it</h3>
+        <ul class="network-legend">
+          <li><span class="legend-person" aria-hidden="true"></span>A person. Larger dots have more roles on record.</li>
+          <li><span class="legend-project" aria-hidden="true"></span>A project. Larger squares have more people.</li>
+          <li><span class="legend-line" aria-hidden="true"></span>A person worked on that project.</li>
+        </ul>
+        <p class="network-hint" id="network-hint">Point at a dot or square for its name, and click it for its connections. Drag to move around. Use the buttons to zoom, or the arrow, plus and minus keys when the drawing has focus.</p>
+      </div>
+    </div>
+    <div class="network-stage" data-network-stage>
+      <canvas class="network-canvas" role="img" aria-label="Network drawing of {{ $summary }} People sit close to the projects they share. The list of projects after this drawing gives the same connections in text." aria-describedby="network-hint" data-network-canvas></canvas>
+      <div class="network-tools" data-network-tools>
+        <button type="button" class="network-tool" data-network-zoom="in" aria-label="Zoom in"><span aria-hidden="true">+</span></button>
+        <button type="button" class="network-tool" data-network-zoom="out" aria-label="Zoom out"><span aria-hidden="true">−</span></button>
+        <button type="button" class="network-tool network-tool-wide" data-network-zoom="fit">Show all</button>
+      </div>
+      <div class="network-tip" data-network-tip hidden></div>
+    </div>
+  </div>
+  <details class="analysis-more network-list">
+    <summary>The network as a list of {{ $projects }} projects and their people</summary>
+    <p class="analysis-note">The number after each name is that person's roles on record across all projects.</p>
+    <ul class="network-projects">
+      {{ range sort $list "n" "desc" }}
+      <li><details><summary>{{ .name }} <span class="network-count">{{ .n }} {{ if eq .n 1 }}person{{ else }}people{{ end }}</span></summary><p>{{ delimit .people ", " }}</p></details></li>
+      {{ end }}
+    </ul>
+  </details>
+  <script type="application/json" id="network-data">{{ dict "projects" $network.projects "people" $network.people | jsonify | safeJS }}</script>
+  {{ $js := resources.Get "js/doors/network.js" | js.Build (dict "minify" true "format" "iife" "target" "es2019") | fingerprint "md5" }}
+  <script src="{{ $js.RelPermalink }}" defer></script>
+</section>
diff --git a/layouts/partials/doors/analysis/network_data.html b/layouts/partials/doors/analysis/network_data.html
new file mode 100644
index 00000000000..8196bd09bba
--- /dev/null
+++ b/layouts/partials/doors/analysis/network_data.html
@@ -0,0 +1,40 @@
+{{/* The contributor network, read from the file content/contributor-analysis/network-graph.Rmd
+     generates. Returns a dict with `projects` ([name, x, y]) and `people` ([name, roles, x, y,
+     [project indexes]]), and from the newer form also `pairs` (people who share a project) and
+     `largest_group` (people in the largest connected group). Empty when the file holds neither form.
+
+     The Rmd on main writes this data in a script tag of its own. Until the next data run there
+     is only the older widget's data, which has no project positions and separates a person's
+     projects by commas, so that branch can go once a run has produced the new tag. */}}
+{{ $file := "static/partials/network-graph.html" }}
+{{ $result := dict }}
+{{ if fileExists $file }}
+  {{ $html := os.ReadFile $file }}
+  {{ with findRESubmatch `<script type="application/json" id="contributor-network">(.*?)</script>` $html 1 }}
+    {{ $result = index . 0 1 | transform.Unmarshal }}
+  {{ else }}
+    {{ with findRESubmatch `<script type="application/json" data-for="htmlwidget-[0-9a-f]+">(.*?)</script>` $html 1 }}
+      {{ $nodes := (index . 0 1 | transform.Unmarshal).x.nodes }}
+      {{ $indexes := dict }}
+      {{ $projects := slice }}
+      {{ $people := slice }}
+      {{ range $i, $name := $nodes.id }}
+        {{ $joined := slice }}
+        {{ range split (index $nodes.projects $i) "," }}
+          {{/* merge lowers its keys, and index and isset then need the same form. */}}
+          {{ $key := lower . }}
+          {{ if not (isset $indexes $key) }}
+            {{ $indexes = merge $indexes (dict $key (len $projects)) }}
+            {{ $projects = $projects | append (slice . | jsonify) }}
+          {{ end }}
+          {{ $joined = $joined | append (index $indexes $key) }}
+        {{ end }}
+        {{ $x := math.Round (mul 1000 (index $nodes.x $i)) }}
+        {{ $y := math.Round (mul 1000 (index $nodes.y $i)) }}
+        {{ $people = $people | append (printf "[%s,%v,%v,%v,%s]" (jsonify $name) (index $nodes.value $i) $x $y (jsonify $joined)) }}
+      {{ end }}
+      {{ $result = printf `{"projects":[%s],"people":[%s]}` (delimit $projects ",") (delimit $people ",") | transform.Unmarshal }}
+    {{ end }}
+  {{ end }}
+{{ end }}
+{{ return $result }}
diff --git a/layouts/partials/doors/article_header.html b/layouts/partials/doors/article_header.html
new file mode 100644
index 00000000000..67516c2be63
--- /dev/null
+++ b/layouts/partials/doors/article_header.html
@@ -0,0 +1,56 @@
+{{/* An article's heading block, in place of the theme's page_header on these pages only: trail,
+     categories, title, subtitle, byline, then any banner or featured image. */}}
+{{ $page := . }}
+{{ $featured := (.Resources.ByType "image").GetMatch "*featured*" }}
+<header class="article-head">
+  <nav class="crumbs" aria-label="Breadcrumb">
+    <a href="{{ "" | relLangURL }}">Home</a>
+    {{ with .Parent }}{{ if not .IsHome }}
+    {{ $label := index (partialCached "doors/menu_labels" . "menu-labels") (strings.Trim .Path "/") | default .LinkTitle }}
+    <span aria-hidden="true">/</span> <a href="{{ .RelPermalink | default (printf "/%s/" (strings.Trim .Path "/") | relLangURL) }}">{{ $label }}</a>
+    {{ else }}
+    {{/* A page at the top of the site takes its section from the main menu, or from crumb_parent. */}}
+    {{ $here := strings.TrimSuffix "/" $page.RelPermalink }}
+    {{ $section := "" }}
+    {{ range site.Menus.main }}{{ $top := . }}{{ range .Children }}{{ if and (not $section) (eq (strings.TrimSuffix "/" (.URL | relLangURL)) $here) }}{{ $section = $top }}{{ end }}{{ end }}{{ end }}
+    {{ if not $section }}{{ with $page.Params.crumb_parent }}{{ $name := . }}{{ range site.Menus.main }}{{ if eq .Name $name }}{{ $section = . }}{{ end }}{{ end }}{{ end }}{{ end }}
+    {{ with $section }}<span aria-hidden="true">/</span> {{ if .URL }}<a href="{{ .URL | relLangURL }}">{{ .Name }}</a>{{ else }}{{ .Name }}{{ end }}{{ end }}
+    {{ end }}{{ end }}
+    {{/* The trail ends with the page itself, as on every other template (doors/crumbs.html). */}}
+    <span aria-hidden="true">/</span> <span aria-current="page">{{ $page.LinkTitle }}</span>
+  </nav>
+  {{ with .Params.categories }}<div class="article-meta">{{ range . }}<span>{{ . }}</span>{{ end }}</div>{{ end }}
+  {{ with .Params.header_logo }}<img class="article-logo" src="{{ . | relURL }}" alt="">{{ end }}
+  {{ $heading := .Params.heading_title | default .Title }}
+  {{ if .Params.hide_title }}<h1 class="sr-only">{{ $heading }}</h1>{{ else }}<h1>{{ $heading }}</h1>{{ end }}
+  {{ with .Params.subtitle }}<p class="standfirst">{{ . | markdownify | emojify }}</p>{{ end }}
+  <div class="byline">
+    {{ with .Params.authors }}<span class="byline-authors">{{ partial "page_metadata_authors" $page }}</span>{{ end }}
+    {{/* The side card carries the date on a wide screen; on a narrow one it would come after the article. */}}
+    {{ if and (in (slice "post" "educators-corner" "pedagogies") .Type) (not .Date.IsZero) }}<time class="byline-date" datetime="{{ .Date.Format "2006-01-02" }}">{{ .Date.Format "2 January 2006" }}</time>{{ end }}
+    {{ if eq .Type "post" }}<span class="byline-time">{{ .ReadingTime }} {{ i18n "minute_read" }}</span>{{ end }}
+  </div>
+  {{ partial "page_links_div.html" $page }}
+</header>
+{{/* With a hero image (doors/page_hero), that is the page's one picture at the top. */}}
+{{ if not .Params.hero_image }}
+{{ if and .Params.header.image (not (and $featured (not .Params.image.preview_only))) }}
+<figure class="article-image">
+  {{ $src := urls.Parse .Params.header.image }}
+  {{ $file := .Params.header.image }}
+  {{ if not $src.Scheme }}{{ $file = printf "%s/%s" ($.Scratch.Get "media_dir") .Params.header.image | relURL }}{{ end }}
+  <img src="{{ $file }}" alt="{{ with .Params.header.alt_text }}{{ . }}{{ else }}Header image for {{ $.Title }}{{ end }}">
+  {{ with .Params.header.caption }}<figcaption>{{ . | markdownify | emojify }}</figcaption>{{ end }}
+</figure>
+{{ end }}
+{{/* A short news post shows its image after the text (doors/reading), so the post's link comes first. */}}
+{{ $after := and (eq .Type "post") (le .ReadingTime 1) }}
+{{ if and $featured (not .Params.image.preview_only) (not $after) }}
+{{ $image := $featured }}
+{{ $image = $featured.Resize (printf "%dx webp q78" (cond (gt $featured.Width 720) 720 $featured.Width)) }}
+<figure class="article-image">
+  <img src="{{ $image.RelPermalink }}" width="{{ $image.Width }}" height="{{ $image.Height }}" alt="{{ with $.Params.image.alt_text }}{{ . }}{{ else }}Featured image for {{ $.Title }}{{ end }}">
+  {{ with $.Params.image.caption }}<figcaption>{{ . | markdownify | emojify }}</figcaption>{{ end }}
+</figure>
+{{ end }}
+{{ end }}
diff --git a/layouts/partials/doors/assets.html b/layouts/partials/doors/assets.html
new file mode 100644
index 00000000000..dd62f929e55
--- /dev/null
+++ b/layouts/partials/doors/assets.html
@@ -0,0 +1,37 @@
+{{/* The Doors stylesheet and shell script, loaded after the theme's CSS so it can override
+     it. Fonts are self-hosted; the two used on every page are preloaded, and the italic
+     downloads only where a reference list uses it. The designed screens each add a stylesheet
+     of their own, so the mock's short class names cannot reach pages still on the theme. */}}
+{{ $files := slice "tokens" "reset" "fonts" "icons" "base" "shell" "launcher" "search" "compat" "inner" "newsletter" "article" "popover" "citations" "glossary" }}
+{{ $parts := slice }}
+{{ range $files }}{{ $parts = $parts | append (resources.Get (printf "css/doors/%s.css" .)) }}{{ end }}
+{{ $css := $parts | resources.Concat "css/doors.css" | minify | fingerprint "md5" }}
+<link rel="preload" href="{{ "fonts/doors/source-sans-3-var.woff2" | relURL }}" as="font" type="font/woff2" crossorigin>
+{{/* Arabic and Chinese content sets its text in system fonts (decision D18). */}}
+{{ $language := partial "functions/page_language.html" . }}
+{{ if not (or (hasPrefix $language "ar") (hasPrefix $language "zh")) }}<link rel="preload" href="{{ "fonts/doors/newsreader-var.woff2" | relURL }}" as="font" type="font/woff2" crossorigin>{{ end }}
+<link rel="stylesheet" href="{{ $css.RelPermalink }}">
+{{ $screen := slice }}
+{{ if .IsHome }}{{ $screen = slice "home" }}{{ end }}
+{{ if eq .Type "resources" }}{{ $screen = slice "page" "resources" }}{{ end }}
+{{ if eq .Type "replication_hub" }}{{ $screen = slice "page" "hub" }}{{ end }}
+{{ if and .IsNode (not .IsHome) (not (in (slice "resources" "replication_hub" "glossary") .Type)) }}{{ $screen = slice "lists" }}{{ end }}
+{{ if or (eq .Type "tags") (eq .Path "/newsletters") }}{{ $screen = slice "lists" }}{{ end }}
+{{ if eq .Type "contributors_analysis" }}{{ $screen = slice "analysis" }}{{ end }}
+{{ if eq .Type "widget_page" }}{{ $screen = slice "sections" }}{{ end }}
+{{ if in (slice "clusters" "disciplines") .Section }}{{ $screen = slice "clusters" }}{{ end }}
+{{ if eq .Type "welcome" }}{{ $screen = slice "welcome" }}{{ end }}
+{{ with $screen }}
+  {{ $parts := slice }}
+  {{ range . }}{{ $parts = $parts | append (resources.Get (printf "css/doors/%s.css" .)) }}{{ end }}
+  {{ $page := $parts | resources.Concat (printf "css/doors-%s.css" (index . (sub (len .) 1))) | minify | fingerprint "md5" }}
+  <link rel="stylesheet" href="{{ $page.RelPermalink }}">
+{{ end }}
+{{ $js := resources.Get "js/doors/site.js" | js.Build (dict "minify" true "format" "iife" "target" "es2019") | fingerprint "md5" }}
+<script src="{{ $js.RelPermalink }}" defer></script>
+{{/* Without the script, long author lists show in full (layouts/partials/citations/authors.html). */}}
+<noscript><style>.ref-more[hidden]{display:inline!important}.ref-etal,.ref-authors-toggle{display:none}</style></noscript>
+{{/* Publish a fingerprinted lookup for the glossary feature to fetch on first use. */}}
+{{ $terms := partialCached "doors/glossary_index.html" site }}
+{{ $index := resources.FromString "data/glossary-terms.json" ($terms | jsonify) | fingerprint "md5" }}
+<meta name="glossary-index" content="{{ $index.RelPermalink }}">
diff --git a/layouts/partials/doors/content.html b/layouts/partials/doors/content.html
new file mode 100644
index 00000000000..3d832188869
--- /dev/null
+++ b/layouts/partials/doors/content.html
@@ -0,0 +1,10 @@
+{{/* Page content with its own Markdown top-level headings demoted, because the page already has its
+     h1 (issue #928). Input: the rendered HTML. */}}
+{{ $demoted := replaceRE `(?i)<(/?)h1\b` "<${1}h2" . }}
+{{/* Markdown task lists give their boxes no name. */}}
+{{ $named := replace $demoted `<input checked="" disabled="" type="checkbox">` `<input checked="" disabled="" type="checkbox" aria-label="Done">` }}
+{{ $named = replace $named `<input disabled="" type="checkbox">` `<input disabled="" type="checkbox" aria-label="Not done yet">` }}
+{{/* A Markdown link around a block gets wrapped in a paragraph, which browsers split, leaving an empty link. */}}
+{{ $named = replaceRE `(?s)<p>\s*(<a [^>]*>\s*<center>.*?</center>\s*</a>)\s*</p>` "$1" $named }}
+{{ $out := $named | safeHTML }}
+{{ return $out }}
diff --git a/layouts/partials/doors/crumbs.html b/layouts/partials/doors/crumbs.html
new file mode 100644
index 00000000000..33b0306310f
--- /dev/null
+++ b/layouts/partials/doors/crumbs.html
@@ -0,0 +1,23 @@
+{{/* Visible breadcrumbs, separate from the BreadcrumbList in structured-data/breadcrumbs.html.
+     A page's label and parent come from the main menu when it is there, so renaming a menu
+     entry renames the trail too. A page outside the menu can name its menu section in front matter
+     (crumb_parent = "Educational Nexus"). Input: dict with `page` and optional `label` for the last step. */}}
+{{ $page := .page }}
+{{ $label := .label | default $page.LinkTitle }}
+{{ $parent := "" }}
+{{ $here := strings.TrimSuffix "/" $page.RelPermalink }}
+{{ range site.Menus.main }}
+  {{ $top := . }}
+  {{ if eq (strings.TrimSuffix "/" (.URL | relLangURL)) $here }}
+    {{ $label = .Name }}
+  {{ else }}
+    {{ range .Children }}
+      {{ if eq (strings.TrimSuffix "/" (.URL | relLangURL)) $here }}
+        {{ $label = .Name }}
+        {{ $parent = $top }}
+      {{ end }}
+    {{ end }}
+  {{ end }}
+{{ end }}
+{{ if not $parent }}{{ with $page.Params.crumb_parent }}{{ $name := . }}{{ range site.Menus.main }}{{ if eq .Name $name }}{{ $parent = . }}{{ end }}{{ end }}{{ end }}{{ end }}
+<nav class="crumbs" aria-label="Breadcrumb"><a href="{{ "" | relLangURL }}">Home</a> <span aria-hidden="true">/</span> {{ with $parent }}{{ if ne .Name $label }}{{ if .URL }}<a href="{{ .URL | relLangURL }}">{{ .Name }}</a>{{ else }}{{ .Name }}{{ end }} <span aria-hidden="true">/</span> {{ end }}{{ end }}<span aria-current="page">{{ $label }}</span></nav>
diff --git a/layouts/partials/doors/featured_image.html b/layouts/partials/doors/featured_image.html
new file mode 100644
index 00000000000..9d4f1e97cd3
--- /dev/null
+++ b/layouts/partials/doors/featured_image.html
@@ -0,0 +1,9 @@
+{{/* A page's featured image as a figure, at most 720 px wide. */}}
+{{ $featured := (.Resources.ByType "image").GetMatch "*featured*" }}
+{{ with $featured }}
+{{ $image := .Resize (printf "%dx webp q78" (cond (gt .Width 720) 720 .Width)) }}
+<figure class="article-image">
+  <img src="{{ $image.RelPermalink }}" width="{{ $image.Width }}" height="{{ $image.Height }}" alt="{{ with $.Params.image.alt_text }}{{ . }}{{ else }}Featured image for {{ $.Title }}{{ end }}" loading="lazy">
+  {{ with $.Params.image.caption }}<figcaption>{{ . | markdownify | emojify }}</figcaption>{{ end }}
+</figure>
+{{ end }}
diff --git a/layouts/partials/doors/glossary_index.html b/layouts/partials/doors/glossary_index.html
new file mode 100644
index 00000000000..a8019f670e4
--- /dev/null
+++ b/layouts/partials/doors/glossary_index.html
@@ -0,0 +1,22 @@
+{{/* Build from front matter rather than .Content: shortcodes also use this lookup.
+     Cache once per build; nothing is written back to the generated glossary sources. */}}
+{{ $terms := dict }}
+{{ range where site.RegularPages "Section" "glossary" }}
+  {{ if hasPrefix .File.Dir "glossary/english/" }}
+    {{ $definition := .Params.definition | default "" | markdownify | plainify | htmlUnescape }}
+    {{/* Drop unbalanced bold markers that markdownify leaves behind, and hide the full stop
+         in common abbreviations so "(e.g." or "et al." does not end the summary. */}}
+    {{ $definition = replace $definition "**" "" | replaceRE `\s+` " " | strings.TrimSpace }}
+    {{ $definition = replaceRE `(?i)\b(e\.g|i\.e|et al|cf|vs|etc|ca|approx)\.` "${1}\uE000" $definition }}
+    {{ $sentences := findRE `(?s).+?(?:[.!?]["’”)]*(?:\s+|$)|$)` $definition 2 }}
+    {{ $summary := replace (delimit $sentences "") "\uE000" "." | strings.TrimSpace }}
+    {{ if gt (strings.RuneCount $summary) 300 }}
+      {{ $summary = printf "%s…" (substr $summary 0 299 | replaceRE `\s+\S*$` "" | strings.TrimSpace) }}
+    {{ end }}
+    {{ $entry := dict "title" .Title "url" .RelPermalink "summary" $summary }}
+    {{ range slice .Title (.Params.en_title | default .Title) }}
+      {{ $terms = merge $terms (dict (lower .) $entry) }}
+    {{ end }}
+  {{ end }}
+{{ end }}
+{{ return $terms }}
diff --git a/layouts/partials/doors/glossary_terms.html b/layouts/partials/doors/glossary_terms.html
new file mode 100644
index 00000000000..8877eb65c26
--- /dev/null
+++ b/layouts/partials/doors/glossary_terms.html
@@ -0,0 +1,17 @@
+{{/* The side card on glossary pages: every term in this language, with a filter. site.js runs the
+     filter and brings the current term into view inside the card. Input: dict with `page`, `labels`
+     (list_of_terms, filter_terms) and `defined_only`. */}}
+{{ $page := .page }}
+{{ $pages := where (where site.RegularPages "Type" "glossary") "File.Dir" $page.File.Dir }}
+{{ if .defined_only }}{{ $pages = where $pages "Params.definition" "!=" nil }}{{ end }}
+<section id="glossary-terms" class="article-card glossary-card" aria-label="{{ .labels.list_of_terms }}">
+  <h2>{{ .labels.list_of_terms }}</h2>
+  {{ $label := strings.TrimRight ".…" .labels.filter_terms }}
+  <label class="term-filter-label" for="glossary-search">{{ $label }}</label>
+  <input type="search" id="glossary-search" class="form-control" autocomplete="off">
+  <nav class="term-list" aria-label="{{ .labels.list_of_terms }}">
+    <ul>
+      {{ range sort $pages "Params.sort_key" }}<li><a href="{{ .RelPermalink }}"{{ if eq .RelPermalink $page.RelPermalink }} aria-current="page"{{ end }}>{{ partial "doors/term_title" .Title }}</a></li>{{ end }}
+    </ul>
+  </nav>
+</section>
diff --git a/layouts/partials/doors/header.html b/layouts/partials/doors/header.html
new file mode 100644
index 00000000000..f4c362ee1b8
--- /dev/null
+++ b/layouts/partials/doors/header.html
@@ -0,0 +1,58 @@
+{{/* Doors site header. Top-level entries with children open a mega menu; its columns come
+     from each child's `group` param in config/_default/menus.toml, and any entry with no
+     group lands in a final "More" column so nothing can drop out of the menu.
+
+     The id is still `navbar-main` because academic.js measures that element for its
+     anchor offset, and it runs on every page until the theme's script is removed. */}}
+{{ $page := . }}
+{{ $logo := resources.Get "images/doors/logo-row.webp" }}
+<header class="site-head" id="navbar-main" lang="en" dir="ltr">
+  <div class="wrap head-inner">
+    <a href="{{ "" | relLangURL }}" class="brand" aria-label="FORRT home"><img src="{{ $logo.RelPermalink }}" width="{{ $logo.Width }}" height="{{ $logo.Height }}" alt="FORRT"></a>
+    <button class="menu-toggle" type="button" aria-expanded="false" aria-controls="primaryNav">Menu</button>
+    <nav class="primary" id="primaryNav" aria-label="Main navigation">
+      {{ range site.Menus.main }}
+        {{ if .HasChildren }}
+          {{ $id := printf "menu-%s" .Identifier }}
+          {{ $groups := slice }}
+          {{ $ungrouped := false }}
+          {{ range .Children }}
+            {{ with .Params.group }}
+              {{ if not (in $groups .) }}{{ $groups = $groups | append . }}{{ end }}
+            {{ else }}
+              {{ $ungrouped = true }}
+            {{ end }}
+          {{ end }}
+          {{ if $ungrouped }}{{ $groups = $groups | append "More" }}{{ end }}
+          <button class="nav-button" type="button" aria-expanded="false" aria-controls="{{ $id }}">{{ .Name }}</button>
+          <div class="mega" id="{{ $id }}" hidden>
+            <div class="wrap mega-inner" style="--mega-columns:{{ len $groups }}">
+              {{ $children := .Children }}
+              {{ range $groups }}
+                {{ $group := . }}
+                <div>
+                  <p class="mega-title">{{ $group }}</p>
+                  {{ range $children }}
+                    {{ if eq (.Params.group | default "More") $group }}
+                      {{ partial "doors/menu_link" (dict "entry" . "page" $page) }}
+                    {{ end }}
+                  {{ end }}
+                </div>
+              {{ end }}
+            </div>
+          </div>
+        {{ else }}
+          {{ partial "doors/menu_link" (dict "entry" . "page" $page) }}
+        {{ end }}
+      {{ end }}
+    </nav>
+    {{ if site.Params.search.engine }}
+    <form class="search-nav" role="search" action="{{ $page.RelPermalink }}" method="get">
+      <input id="site-search" name="q" type="search" aria-label="Search this site" placeholder="Search" autocomplete="off">
+      <button type="submit" aria-label="Search this site">{{ partial "doors/search_icon" . }}</button>
+    </form>
+    <button class="search-open" type="button" aria-label="Search this site">{{ partial "doors/search_icon" . }}</button>
+    {{ end }}
+    <a href="{{ relref $page "/about/get-involved" }}" class="head-join">Get involved</a>
+  </div>
+</header>
diff --git a/layouts/partials/doors/home/about.html b/layouts/partials/doors/home/about.html
new file mode 100644
index 00000000000..74ab7ce3535
--- /dev/null
+++ b/layouts/partials/doors/home/about.html
@@ -0,0 +1,36 @@
+{{/* The band lower on the page: quotes that change one at a time, the statement, FORWARD and the
+     figures. All the quotes sit in one grid cell, so the height is set by the longest and nothing
+     moves when they change. Without JavaScript, or under reduced motion, the first stays.
+     quotes.js changes them, and they obey the same pause control as the castle.
+     Context: content/home/5-about.md. */}}
+{{ $contributors := len (findRE `class="contributor-group"` (readFile "content/contributors/tenzing.md")) }}
+{{ $partners := len hugo.Data.partners }}
+<section class="wrap about" aria-labelledby="about-h">
+  <div class="about-statement">
+    <h2 id="about-h" class="visually-hidden">What FORRT stands for</h2>
+    <figure class="quotes" data-motion-host>
+      <div class="quote-stage" aria-live="off">
+        {{ range $i, $quote := .Params.quotes }}
+        <p class="quote{{ if eq $i 0 }} is-active{{ end }}">{{ $quote | safeHTML }}</p>
+        {{ end }}
+      </div>
+      <figcaption class="quotes-bar"><button class="motion-toggle" type="button" hidden>Pause animation</button></figcaption>
+    </figure>
+    <p>{{ .Params.statement }}</p>
+    {{ with .Params.statement_link }}{{ $link := partial "doors/link" . }}<a class="more" href="{{ $link.href }}">{{ $link.label }}</a>{{ end }}
+  </div>
+  <div class="forward">
+    <h3>{{ .Params.forward.title }}</h3>
+    <p>{{ .Params.forward.text }}</p>
+    <p class="forward-links">
+      {{ range .Params.forward.links }}{{ $link := partial "doors/link" . }}<a class="more" href="{{ $link.href }}">{{ $link.label }}</a>{{ end }}
+    </p>
+  </div>
+  {{/* The figures as a strip: the number large, what it counts beneath. */}}
+  <ul class="ledger">
+    <li><a href="{{ relref . "/contributors" }}"><strong>{{ lang.FormatNumber 0 $contributors }}</strong><span>contributors to FORRT projects</span></a></li>
+    <li><a href="{{ .Params.facts.projects_url | relLangURL }}"><strong>{{ .Params.facts.projects_figure }}</strong><span>{{ .Params.facts.projects_label }}</span></a></li>
+    <li><a href="{{ relref . "/about/partnerships" }}"><strong>{{ $partners }}</strong><span>partner organisations</span></a></li>
+    <li><a href="{{ .Params.facts.awards_url | relLangURL }}"><strong>{{ .Params.facts.awards_figure }}</strong><span>{{ .Params.facts.awards_label }}</span></a></li>
+  </ul>
+</section>
diff --git a/layouts/partials/doors/home/areas.html b/layouts/partials/doors/home/areas.html
new file mode 100644
index 00000000000..f8e5d8a7772
--- /dev/null
+++ b/layouts/partials/doors/home/areas.html
@@ -0,0 +1,26 @@
+{{/* The four areas, each behind its arched door. Context: content/home/2-areas.md. */}}
+{{/* Set before the areas are parsed, so the phone layout collapses their links without a shift, and only when site.js can open them. */}}
+<script>document.documentElement.classList.add('js')</script>
+<section class="wrap areas-section" aria-labelledby="areas-h">
+  <h2 id="areas-h" class="visually-hidden">What FORRT does</h2>
+  <div class="areas">
+    {{ range .Params.area }}
+    {{ $image := resources.Get (printf "images/doors/%s.webp" .image) }}
+    <article class="area area-{{ .key }}" aria-labelledby="area-{{ .key }}-h">
+      <div class="area-plate"><img src="{{ $image.RelPermalink }}" alt="{{ .alt }}" width="{{ $image.Width }}" height="{{ $image.Height }}" loading="lazy"></div>
+      <div class="area-body">
+        <h3 id="area-{{ .key }}-h">{{ .title }}</h3>
+        <p>{{ .blurb }}</p>
+        <ul>
+          {{ range .links }}
+          {{ $link := partial "doors/link" . }}
+          <li><a href="{{ $link.href }}">{{ $link.label }}</a></li>
+          {{ end }}
+          {{/* Phones show two links; this shows the rest (site.js). */}}
+          {{ if gt (len .links) 2 }}<li class="area-more"><button type="button" aria-expanded="false">{{ sub (len .links) 2 }} more in {{ .title }}</button></li>{{ end }}
+        </ul>
+      </div>
+    </article>
+    {{ end }}
+  </div>
+</section>
diff --git a/layouts/partials/doors/home/board.html b/layouts/partials/doors/home/board.html
new file mode 100644
index 00000000000..08378088505
--- /dev/null
+++ b/layouts/partials/doors/home/board.html
@@ -0,0 +1,49 @@
+{{/* The noticeboard, from the newest announcements, and ways to take part, which stay useful with
+     no news, and the newsletter sign-up, which sits under "Take part" on wide screens and last when
+     the board is one column. Context: content/home/4-board.md. */}}
+{{ $posts := first (.Params.notices_count | default 3) (sort (where site.RegularPages "Type" "post") "Date" "desc") }}
+<section class="wrap board" aria-label="News and ways to take part">
+  <div class="notices">
+    <h2>{{ .Params.notices_heading }}</h2>
+    <div class="notice-card">
+    <ol class="notice-list">
+      {{ range $posts }}
+      <li>
+        {{/* A small crop of the post's featured image, or a tile in its category's tint with the
+             category's initial. Both are decoration: the title is the link text. */}}
+        {{ $kind := index (.Params.categories | default (slice "")) 0 }}
+        <a href="{{ .RelPermalink }}">
+          {{ with (.Resources.ByType "image").GetMatch "*featured*" }}
+          {{ $thumb := .Fill "176x132 Center webp q75" }}
+          <img class="notice-thumb" src="{{ $thumb.RelPermalink }}" width="88" height="66" alt="" loading="lazy">
+          {{ else }}
+          <span class="notice-thumb notice-tile notice-tile-{{ $kind | default "news" | urlize }}" aria-hidden="true">{{ substr ($kind | default "News") 0 1 }}</span>
+          {{ end }}
+          <span class="notice-meta">
+            <time datetime="{{ .Date.Format "2006-01-02" }}">{{ .Date.Format "2 January 2006" }}</time>
+            {{ with $kind }}<span class="notice-kind">{{ . }}</span>{{ end }}
+          </span>
+          <h3>{{ .Title }}</h3>
+          <p>{{ .Summary | plainify | htmlUnescape | truncate 150 }}</p>
+        </a>
+      </li>
+      {{ end }}
+    </ol>
+    <p class="board-foot"><a class="more" href="{{ relref . "/post" }}">All news and announcements</a></p>
+    </div>
+  </div>
+  <section class="standing" id="take-part" aria-labelledby="standing-h">
+    <h2 id="standing-h">{{ .Params.take_part_heading }}</h2>
+    <ul class="standing-list">
+      {{ range .Params.take_part }}
+      {{ $link := partial "doors/link" . }}
+      <li><a href="{{ $link.href }}"><strong>{{ $link.label }}</strong><span>{{ .text }}</span></a></li>
+      {{ end }}
+    </ul>
+  </section>
+  <section class="home-newsletter" aria-labelledby="newsletter-h">
+    <h3 id="newsletter-h">{{ .Params.newsletter_heading }}</h3>
+    <p>{{ .Params.newsletter_text }}</p>
+    {{ partial "doors/newsletter" . }}
+  </section>
+</section>
diff --git a/layouts/partials/doors/home/hero.html b/layouts/partials/doors/home/hero.html
new file mode 100644
index 00000000000..6e590d1c654
--- /dev/null
+++ b/layouts/partials/doors/home/hero.html
@@ -0,0 +1,31 @@
+{{/* Home page hero: the opening statement, direct routes, and the castle in its arched door.
+     The still image paints first. castle.js loads the 3D bundle after the page has painted,
+     and not at all under reduced motion, Save-Data or no WebGL. "Build it yourself" opens the tower
+     game, which loads on that press, and stays hidden without WebGL. Set `doors.castle = false`
+     in params.toml to show only the still, with no game. Context: content/home/1-hero.md. */}}
+{{ $still := resources.Get "images/doors/castle-still.webp" }}
+<section class="hero" aria-labelledby="home-title">
+  <div class="wrap hero-grid">
+    <div class="invite">
+      <h1 id="home-title">{{ .Params.heading | safeHTML }}</h1>
+      <p class="lede">{{ .Params.lede }}</p>
+      <nav class="quick" aria-label="Go straight to">
+        {{ range .Params.quick }}{{ $link := partial "doors/link" . }}<a href="{{ $link.href }}">{{ $link.label }}</a>{{ end }}
+      </nav>
+      {{/* A quieter second line of links on wide screens; hidden on phones (home.css). */}}
+      {{ with .Params.more }}<nav class="quick-more" aria-label="More ways in">{{ range . }}{{ $link := partial "doors/link" . }}<a href="{{ $link.href }}">{{ $link.label }}</a>{{ end }}</nav>{{ end }}
+    </div>
+    <figure class="tower" data-motion-host>
+      <div class="castle-stage" aria-hidden="true">
+        <img class="castle-fallback" src="{{ $still.RelPermalink }}" alt="" width="{{ $still.Width }}" height="{{ $still.Height }}" fetchpriority="high">
+        <canvas id="castle-canvas"></canvas>
+      </div>
+      <figcaption class="motion-bar">
+        <button class="motion-toggle" type="button">Pause animation</button>
+        {{- if ne site.Params.doors.castle false }}
+        <button class="tower-entry" type="button" aria-haspopup="dialog" data-game="{{ "js/tower/game.bundle.js" | relURL }}" hidden>Build it yourself</button>
+        {{- end }}
+      </figcaption>
+    </figure>
+  </div>
+</section>
diff --git a/layouts/partials/doors/home/scripts.html b/layouts/partials/doors/home/scripts.html
new file mode 100644
index 00000000000..2c15363c821
--- /dev/null
+++ b/layouts/partials/doors/home/scripts.html
@@ -0,0 +1,8 @@
+{{/* The home page's one script: quotes and castle playback, sharing a pause state. The 3D bundle
+     loads later, from castle.js, and only when `doors.castle` is on in params.toml. */}}
+{{ $home := resources.Get "js/doors/home.js" | js.Build (dict "minify" true "format" "iife" "target" "es2019" "targetPath" "js/doors/home.js") | fingerprint "md5" }}
+{{ $bundle := "" }}
+{{ if ne site.Params.doors.castle false }}
+  {{ $bundle = (resources.Get "js/castle/castle-scene.js" | js.Build (dict "minify" true "format" "iife" "target" "es2020" "targetPath" "js/castle.js") | fingerprint "md5").RelPermalink }}
+{{ end }}
+<script src="{{ $home.RelPermalink }}"{{ with $bundle }} data-castle-bundle="{{ . }}"{{ end }} defer></script>
diff --git a/layouts/partials/doors/home/topics.html b/layouts/partials/doors/home/topics.html
new file mode 100644
index 00000000000..68492ec8328
--- /dev/null
+++ b/layouts/partials/doors/home/topics.html
@@ -0,0 +1,12 @@
+{{/* Topic buttons, which open the resources directory filtered. Context: content/home/3-topics.md. */}}
+{{ $count := len (where site.RegularPages "Type" "curated_resources") }}
+{{ $directory := "resources/" | relLangURL }}
+<section class="wrap topics-section" aria-labelledby="topics-h">
+  <h2 id="topics-h">{{ .Params.heading }}</h2>
+  <p class="section-note">{{ printf .Params.note (lang.FormatNumber 0 $count) }}</p>
+  <ul class="topics">
+    {{ range .Params.topic }}
+    <li><a class="topic" href="{{ $directory }}?cluster={{ .cluster }}">{{ .label }}</a></li>
+    {{ end }}
+  </ul>
+</section>
diff --git a/layouts/partials/doors/link.html b/layouts/partials/doors/link.html
new file mode 100644
index 00000000000..f0875bd54ec
--- /dev/null
+++ b/layouts/partials/doors/link.html
@@ -0,0 +1,13 @@
+{{/* A link's address and label, from a front-matter entry with `url` and optional `label`. Without
+     a label it takes the name of the main-menu entry with that address, so renaming a menu entry
+     renames the link too. Returns a dict with `href` and `label`. */}}
+{{ $url := .url }}
+{{ $external := or (strings.HasPrefix $url "http") (strings.HasPrefix $url "#") (strings.HasPrefix $url "mailto:") }}
+{{ $href := $url }}
+{{ if not $external }}{{ $href = $url | relLangURL }}{{ end }}
+{{ $label := .label }}
+{{ if not $label }}
+  {{ $labels := partialCached "doors/menu_labels" . "menu-labels" }}
+  {{ $label = index $labels (strings.Trim $url "/") | default $url }}
+{{ end }}
+{{ return dict "href" $href "label" $label }}
diff --git a/layouts/partials/doors/list_item.html b/layouts/partials/doors/list_item.html
new file mode 100644
index 00000000000..b1fbad0fe65
--- /dev/null
+++ b/layouts/partials/doors/list_item.html
@@ -0,0 +1,14 @@
+{{/* One entry in a list page: title, date when it has one, summary and any image. */}}
+{{ $link := .RelPermalink }}
+{{ $target := "" }}
+{{ with .Params.external_link }}{{ $link = . }}{{ $target = `target="_blank" rel="noopener"` }}{{ end }}
+{{ $image := (.Resources.ByType "image").GetMatch "*featured*" }}
+<article class="list-item{{ if $image }} list-item-image{{ end }}">
+  <div>
+    <h2><a href="{{ $link }}" {{ $target | safeHTMLAttr }}>{{ .Title }}</a></h2>
+    <p class="list-meta">{{ with .Params.authors }}{{ partial "page_metadata_authors" $ }}{{ end }}{{ if and .Params.date .Params.authors }} · {{ end }}{{ if .Params.date }}{{ .Date.Format "January 2006" }}{{ end }}</p>
+    <p class="list-summary">{{ if .Params.summary }}{{ .Params.summary | plainify | emojify | truncate 220 }}{{ else if .Params.abstract }}{{ .Params.abstract | plainify | emojify | truncate 220 }}{{ else }}{{ .Summary | plainify | emojify | truncate 220 }}{{ end }}</p>
+    {{ if eq .Type "pedagogies" }}<div class="btn-links">{{ partial "page_links" (dict "page" . "is_list" 1) }}</div>{{ end }}
+  </div>
+  {{ with $image }}{{/* Fit, not Fill: the thumbnail is shown whole (lists.css), so it is not cropped here either. */}}{{ $thumb := .Fit "280x210 webp" }}<img src="{{ $thumb.RelPermalink }}" width="140" height="105" alt="{{ $.Params.image.alt_text }}" loading="lazy">{{ end }}
+</article>
diff --git a/layouts/partials/doors/menu_labels.html b/layouts/partials/doors/menu_labels.html
new file mode 100644
index 00000000000..2910979ef9c
--- /dev/null
+++ b/layouts/partials/doors/menu_labels.html
@@ -0,0 +1,12 @@
+{{/* Main-menu entries by address: a dict of address, without its outer slashes, to name.
+     A top-level entry wins over a child with the same address. */}}
+{{ $labels := dict }}
+{{ range site.Menus.main }}
+  {{ if .URL }}{{ $labels = merge (dict (strings.Trim .URL "/") .Name) $labels }}{{ end }}
+{{ end }}
+{{ range site.Menus.main }}
+  {{ range .Children }}
+    {{ if .URL }}{{ $labels = merge (dict (strings.Trim .URL "/") .Name) $labels }}{{ end }}
+  {{ end }}
+{{ end }}
+{{ return $labels }}
diff --git a/layouts/partials/doors/menu_link.html b/layouts/partials/doors/menu_link.html
new file mode 100644
index 00000000000..15a57900840
--- /dev/null
+++ b/layouts/partials/doors/menu_link.html
@@ -0,0 +1,6 @@
+{{/* One menu link. Sites outside this one open in a new tab, as they did before.
+     Input: dict with `entry` (menu entry) and `page` (current page). */}}
+{{ $url := .entry.URL | relLangURL }}
+{{ $external := or (strings.HasPrefix .entry.URL "http://") (strings.HasPrefix .entry.URL "https://") }}
+{{ $current := eq (strings.TrimSuffix "/" $url) (strings.TrimSuffix "/" .page.RelPermalink) }}
+<a href="{{ $url }}"{{ if $external }} target="_blank" rel="noopener"{{ end }}{{ if $current }} aria-current="page"{{ end }}>{{ .entry.Name }}</a>
diff --git a/layouts/partials/doors/name_list.html b/layouts/partials/doors/name_list.html
new file mode 100644
index 00000000000..49c0a034737
--- /dev/null
+++ b/layouts/partials/doors/name_list.html
@@ -0,0 +1,8 @@
+{{/* Contributor names in a glossary term's credits. Each name is isolated, so Latin names keep their own
+     order inside an Arabic sentence and the list runs in the page's direction. Input: dict with `names`
+     and `sep` (", " or the Arabic "، "). */}}
+{{ $out := slice }}
+{{/* Each name is escaped before Markdown, as in term_title, so only the list's own markup is trusted. A name stays
+     on one line; a long value (a list of links, say) may wrap. */}}
+{{ range .names }}{{ $text := . | htmlEscape | markdownify }}{{ $out = $out | append (printf "<bdi%s>%s</bdi>" (cond (lt (len (plainify $text)) 40) ` class="term-name"` "") $text) }}{{ end }}
+{{ return (delimit $out .sep | safeHTML) }}
diff --git a/layouts/partials/newsletter_form.html b/layouts/partials/doors/newsletter.html
similarity index 66%
rename from layouts/partials/newsletter_form.html
rename to layouts/partials/doors/newsletter.html
index 6e44c82932d..d6a276654b7 100644
--- a/layouts/partials/newsletter_form.html
+++ b/layouts/partials/doors/newsletter.html
@@ -1,15 +1,15 @@
-{{/* Newsletter sign-up, from the `subscribe` shortcode and the newsletters page.
+{{/* Newsletter sign-up, from the `subscribe` shortcode, the home board and the newsletters page.
      The form is ours and loads nothing from elsewhere. Pressing Subscribe loads Google reCAPTCHA,
      which EmailOctopus requires, and then posts the address to EmailOctopus's form endpoint
-     (static/js/newsletter.js). The IDs below come from the form's embed code in EmailOctopus;
+     (assets/js/doors/site.js). The IDs below come from the form's embed code in EmailOctopus;
      if that form is replaced, copy the new form ID, honeypot field name and reCAPTCHA site key
-     from https://eocampaign1.com/form/<id>.js. Styles: assets/scss/custom.scss (.newsletter-form). */}}
+     from https://eocampaign1.com/form/<id>.js. Styles: assets/css/doors/newsletter.css. */}}
 {{ $form := "5fb3cb44-8c81-11f0-9781-f7fc195374ed" }}
 <form class="newsletter-form" action="https://eocampaign1.com/form/{{ $form }}" method="post"
       data-newsletter-sitekey="6LdG8skrAAAAAHG0XCORv-FkbuhBc3caWlOFamMH">
   <div class="newsletter-row">
     <label class="newsletter-field">
-      <span class="sr-only">Email address</span>
+      <span class="visually-hidden">Email address</span>
       <input type="email" name="field_0" required autocomplete="email" placeholder="Your email address">
     </label>
     <button class="newsletter-submit" type="submit">Subscribe</button>
@@ -18,6 +18,6 @@
     <input type="text" name="hpc4b27b6e-eb38-11e9-be00-06b4694bee2a" tabindex="-1" autocomplete="off">
   </div>
   <p class="newsletter-status" role="status" tabindex="-1"></p>
-  <p class="newsletter-note">Uses EmailOctopus and Google reCAPTCHA (Google <a href="https://policies.google.com/privacy">Privacy</a> and <a href="https://policies.google.com/terms">Terms</a> apply). <a href="{{ "privacy/" | relURL }}#newsletter">See our privacy policy</a>.</p>
+  <p class="newsletter-note">Unsubscribe anytime. Uses EmailOctopus and Google reCAPTCHA (Google <a href="https://policies.google.com/privacy">Privacy</a> and <a href="https://policies.google.com/terms">Terms</a> apply). <a href="{{ "privacy/" | relURL }}#newsletter">See our privacy policy</a>.</p>
   <noscript><style>.newsletter-row,.newsletter-note{display:none}</style><p>Signing up needs JavaScript. You can also ask to join at <a href="mailto:info@forrt.org">info@forrt.org</a>.</p></noscript>
 </form>
diff --git a/layouts/partials/doors/on_theme.html b/layouts/partials/doors/on_theme.html
new file mode 100644
index 00000000000..6a3120a664e
--- /dev/null
+++ b/layouts/partials/doors/on_theme.html
@@ -0,0 +1,3 @@
+{{/* Whether a page still needs the theme's stylesheet, Bootstrap's script and jQuery. Every template
+     is now drawn on Doors alone, so the answer is no. Phase 6 removes the theme's files and this. */}}
+{{ return false }}
diff --git a/layouts/partials/doors/page_actions.html b/layouts/partials/doors/page_actions.html
new file mode 100644
index 00000000000..88ada62c273
--- /dev/null
+++ b/layouts/partials/doors/page_actions.html
@@ -0,0 +1,12 @@
+{{/* Direct actions under a tool page's title, from doors.page_actions in params.toml: the first is the
+     main one. A tool page leads with the tool rather than with its explanation. */}}
+{{ $path := .Path }}
+{{ range site.Params.doors.page_actions }}
+  {{ if eq .path $path }}
+  <p class="page-actions">
+    {{ range $i, $link := .links }}
+    <a class="btn{{ if eq $i 0 }} btn-primary{{ end }}" href="{{ if hasPrefix $link.url "/" }}{{ $link.url | relURL }}{{ else }}{{ $link.url }}{{ end }}">{{ $link.label }}</a>
+    {{ end }}
+  </p>
+  {{ end }}
+{{ end }}
diff --git a/layouts/partials/doors/page_head.html b/layouts/partials/doors/page_head.html
new file mode 100644
index 00000000000..2994eda93be
--- /dev/null
+++ b/layouts/partials/doors/page_head.html
@@ -0,0 +1,6 @@
+{{/* A section page's heading block (widget_page): trail, title and standfirst. Input: dict with `page`, `h1`, `lede`. */}}
+<header class="article-head">
+  {{ partial "doors/crumbs" (dict "page" .page) }}
+  <h1>{{ .h1 | markdownify | emojify }}</h1>
+  {{ with .lede }}<p class="standfirst">{{ . | markdownify | emojify }}</p>{{ end }}
+</header>
diff --git a/layouts/partials/doors/page_hero.html b/layouts/partials/doors/page_hero.html
new file mode 100644
index 00000000000..91fa9a57239
--- /dev/null
+++ b/layouts/partials/doors/page_hero.html
@@ -0,0 +1,33 @@
+{{/* A page's opening with its picture in view: the heading block and actions beside a large image, for pages
+     whose picture is the thing itself (a tool's wheel, an event's banner), not decoration. A page opts in with
+     front matter `hero_image` (a page resource, resized for the opening; a path under static/ is served as is, so
+     prefer a copy beside the page), `hero_image_alt` and, optionally,
+     `hero_image_link`, the text of a link to the full-size image. The image links to its full size. On a wide
+     screen the opening spans the layout above the side card and text; on a phone the image follows the actions.
+     Input: dict with `page` and `head`, the heading block already rendered (crumbs, title, standfirst). Used by
+     doors/reading and widget_page. */}}
+{{ $page := .page }}
+{{ $src := $page.Params.hero_image }}
+{{ $full := "" }}{{ $shown := "" }}{{ $w := 0 }}{{ $h := 0 }}
+{{ with $page.Resources.GetMatch $src }}
+  {{ $full = .RelPermalink }}
+  {{/* The opening shows it at most 400 px wide, so 900 px covers a 2x screen. */}}
+  {{ $img := . }}
+  {{ if gt .Width 900 }}{{ $img = .Resize "900x webp q80" }}{{ end }}
+  {{ $shown = $img.RelPermalink }}{{ $w = $img.Width }}{{ $h = $img.Height }}
+{{ else }}
+  {{ $path := strings.TrimPrefix "/" $src }}
+  {{ with images.Config (printf "static/%s" $path) }}{{ $w = .Width }}{{ $h = .Height }}{{ end }}
+  {{ $full = $path | relURL }}{{ $shown = $full }}
+{{ end }}
+{{/* A landscape picture (a banner) takes the full width on a phone; a square one (a wheel) stays smaller. */}}
+<div class="page-hero{{ if and $w (gt (mul $w 10) (mul $h 13)) }} page-hero-landscape{{ end }}">
+  <div class="page-hero-text">
+    {{ .head }}
+    {{ partial "doors/page_actions" $page }}
+  </div>
+  <div class="page-hero-media">
+    <a href="{{ $full }}"><img src="{{ $shown }}"{{ with $w }} width="{{ . }}" height="{{ $h }}"{{ end }} alt="{{ $page.Params.hero_image_alt }}" fetchpriority="high"></a>
+    {{ with $page.Params.hero_image_link }}<p><a href="{{ $full }}">{{ . }}</a></p>{{ end }}
+  </div>
+</div>
diff --git a/layouts/partials/doors/pager.html b/layouts/partials/doors/pager.html
new file mode 100644
index 00000000000..68cbb70ef00
--- /dev/null
+++ b/layouts/partials/doors/pager.html
@@ -0,0 +1,18 @@
+{{/* Links between a list's pages: first, last and the two either side of this one.
+     Crawlers follow these to reach every resource. Input: a Hugo paginator. */}}
+{{ $pager := . }}
+{{ if gt $pager.TotalPages 1 }}
+<nav class="pager" id="pager" aria-label="Pages">
+  {{ with $pager.Prev }}<a href="{{ .URL }}" rel="prev">Previous</a>{{ end }}
+  {{ $last := 0 }}
+  {{ range $pager.Pagers }}
+    {{ $near := and (ge .PageNumber (sub $pager.PageNumber 2)) (le .PageNumber (add $pager.PageNumber 2)) }}
+    {{ if or $near (eq .PageNumber 1) (eq .PageNumber $pager.TotalPages) }}
+      {{ if gt (sub .PageNumber $last) 1 }}<span class="pager-gap" aria-hidden="true">…</span>{{ end }}
+      {{ if eq .PageNumber $pager.PageNumber }}<span class="pager-current" aria-current="page">{{ .PageNumber }}</span>{{ else }}<a href="{{ .URL }}" aria-label="Page {{ .PageNumber }}">{{ .PageNumber }}</a>{{ end }}
+      {{ $last = .PageNumber }}
+    {{ end }}
+  {{ end }}
+  {{ with $pager.Next }}<a href="{{ .URL }}" rel="next">Next</a>{{ end }}
+</nav>
+{{ end }}
diff --git a/layouts/partials/doors/pager_top.html b/layouts/partials/doors/pager_top.html
new file mode 100644
index 00000000000..ab7caf6d484
--- /dev/null
+++ b/layouts/partials/doors/pager_top.html
@@ -0,0 +1,18 @@
+{{/* The same page links as doors/pager, for the top of a list; no id, as doors/pager has it.
+     Crawlers follow these to reach every resource. Input: a Hugo paginator. */}}
+{{ $pager := . }}
+{{ if gt $pager.TotalPages 1 }}
+<nav class="pager pager-top" aria-label="Pages, at the top">
+  {{ with $pager.Prev }}<a href="{{ .URL }}" rel="prev">Previous</a>{{ end }}
+  {{ $last := 0 }}
+  {{ range $pager.Pagers }}
+    {{ $near := and (ge .PageNumber (sub $pager.PageNumber 2)) (le .PageNumber (add $pager.PageNumber 2)) }}
+    {{ if or $near (eq .PageNumber 1) (eq .PageNumber $pager.TotalPages) }}
+      {{ if gt (sub .PageNumber $last) 1 }}<span class="pager-gap" aria-hidden="true">…</span>{{ end }}
+      {{ if eq .PageNumber $pager.PageNumber }}<span class="pager-current" aria-current="page">{{ .PageNumber }}</span>{{ else }}<a href="{{ .URL }}" aria-label="Page {{ .PageNumber }}">{{ .PageNumber }}</a>{{ end }}
+      {{ $last = .PageNumber }}
+    {{ end }}
+  {{ end }}
+  {{ with $pager.Next }}<a href="{{ .URL }}" rel="next">Next</a>{{ end }}
+</nav>
+{{ end }}
diff --git a/layouts/partials/doors/reading.html b/layouts/partials/doors/reading.html
new file mode 100644
index 00000000000..1db07cb17ab
--- /dev/null
+++ b/layouts/partials/doors/reading.html
@@ -0,0 +1,47 @@
+{{/* The reading layout: one narrow column, with a side card when there is something to put in it.
+     Articles and every plain page or section with its own text use it. */}}
+{{/* Hugo's contents, or the headings a shortcode wrote, as on the summaries. */}}
+{{ $body := partial "doors/content" .Content }}
+{{/* The summaries mark their DEI entries with ⌺, which few fonts have and which shows as an empty box. */}}
+{{ $body = replace $body "⌺" `<span class="dei-mark">DEI</span>` | safeHTML }}
+{{ $contents := cond (findRE `(?i)<h1\b` .Content 1 | len | lt 0) slice (findRE `<li` .TableOfContents 1) }}
+{{ $written := findRESubmatch `<h2[^>]*\bid="?([^"> ]+)"?[^>]*>([\s\S]*?)</h2>` $body }}
+{{/* A short page's real sections can sit a level down. */}}
+{{ if lt (len $written) 4 }}{{ $written = findRESubmatch `<h[23][^>]*\bid="?([^"> ]+)"?[^>]*>([\s\S]*?)</h[23]>` $body }}{{ end }}
+{{ $headings := cond (gt (len $contents) 0) (findRE `<h[23][ >]` .Content) $written }}
+{{ $hasDates := and .Params.date (not (in (slice "page") .Type)) }}
+{{ $wide := in site.Params.doors.wide_pages .Path }}
+{{ $hasCard := and (not $wide) (or $hasDates (gt (len $headings) 1)) }}
+{{ $hasCallouts := and (not $wide) (strings.Contains $body `<aside class="callout`) }}
+{{ $card := "" }}
+{{ if $hasCard }}{{ $card = partial "doors/reading_card" (dict "page" . "hasDates" $hasDates "headings" $headings "contents" $contents "written" $written) }}{{ end }}
+<div class="wrap">
+  <div class="article-layout{{ if $hasCallouts }} article-layout-callouts{{ else if not $hasCard }} article-layout-single{{ end }}{{ if $wide }} article-layout-wide{{ end }}">
+    {{/* A page whose picture is the thing itself opens with it beside the heading (doors/page_hero). */}}
+    {{ $hero := and .Params.hero_image (not .Params.hide_page_header) }}
+    {{ if $hero }}{{ partial "doors/page_hero" (dict "page" . "head" (partial "doors/article_header" .)) }}{{ end }}
+    {{/* First in the page, so keyboard order follows the layout: contents, then text. */}}
+    {{ $card }}
+    <article class="reading">
+      {{ if not $hero }}
+        {{ if not .Params.hide_page_header }}
+          {{ partial "doors/article_header" . }}
+        {{ end }}
+        {{ partial "doors/page_actions" . }}
+      {{ end }}
+      {{/* On phones the side card falls below the text, too late to help on a long page. */}}
+      {{ if and (or $hasCard $wide) (gt (len $headings) 1) }}
+      {{ partial "doors/toc_phone" (replace (partial "doors/reading_toc" (dict "page" . "contents" $contents "written" $written)) `id="TableOfContents"` `aria-label="On this page"`) }}
+      {{ end }}
+      <div class="article-style">
+        {{ $body }}
+      </div>
+      {{ if and (eq .Type "post") (le .ReadingTime 1) (not .Params.image.preview_only) (not .Params.hide_page_header) }}{{ partial "doors/featured_image" . }}{{ end }}
+      <div class="article-foot">
+        {{/* Only articles offer their link to copy; tools, policies and event pages do not. */}}
+        {{ if and .IsPage (in (slice "post" "educators-corner" "pedagogies" "summaries" "neurodiversity-lessonbank" "nowherelab") .Section) }}<p class="share-link"><button class="copy-link" type="button" data-copy-link="{{ .Permalink }}">Copy article link</button> <span role="status"></span></p>{{ end }}
+        {{ partial "page_footer" . }}
+      </div>
+    </article>
+  </div>
+</div>
diff --git a/layouts/partials/doors/reading_card.html b/layouts/partials/doors/reading_card.html
new file mode 100644
index 00000000000..50a8e91ab74
--- /dev/null
+++ b/layouts/partials/doors/reading_card.html
@@ -0,0 +1,16 @@
+{{/* The side card on the reading layout: dates, and contents when there are headings to jump to. */}}
+{{ $p := .page }}
+<section class="article-card" aria-label="About this article">
+  {{ if .hasDates }}
+  <dl>
+    <dt>Published</dt><dd>{{ $p.Date.Format "2 January 2006" }}</dd>
+    {{ if ne ($p.Lastmod.Format "2006-01-02") ($p.Date.Format "2006-01-02") }}<dt>Updated</dt><dd>{{ $p.Lastmod.Format "2 January 2006" }}</dd>{{ end }}
+  </dl>
+  {{ end }}
+  {{ if gt (len .headings) 1 }}
+  <h2>On this page</h2>
+  <div class="article-toc">
+    {{ partial "doors/reading_toc" . }}
+  </div>
+  {{ end }}
+</section>
diff --git a/layouts/partials/doors/reading_toc.html b/layouts/partials/doors/reading_toc.html
new file mode 100644
index 00000000000..20aee8cc72c
--- /dev/null
+++ b/layouts/partials/doors/reading_toc.html
@@ -0,0 +1,7 @@
+{{/* A reading page's contents: Hugo's own, or the headings a shortcode wrote. */}}
+{{ if .contents }}{{ .page.TableOfContents }}
+{{ else }}
+<nav id="TableOfContents"><ul>
+  {{ range .written }}<li><a href="#{{ index . 1 }}">{{ index . 2 | plainify }}</a></li>{{ end }}
+</ul></nav>
+{{ end }}
diff --git a/layouts/partials/doors/resource_card.html b/layouts/partials/doors/resource_card.html
new file mode 100644
index 00000000000..d9d7293d337
--- /dev/null
+++ b/layouts/partials/doors/resource_card.html
@@ -0,0 +1,8 @@
+{{/* One card in the resources directory. Rendered here for the page's own results, and once
+     empty inside a <template> for assets/js/doors/resources.js to fill in, so both look the same.
+     Input: dict with `title`, `url`, `types`, `levels`, `clusters`. */}}
+<article class="res">
+  <p class="res-format"><span class="res-type">{{ delimit .types ", " }}</span> {{/* Two levels at most, then a count, so rows keep an even rhythm; the full list is on the resource page. */}}<span class="res-level">{{ delimit (first 2 .levels) ", " }}{{ if gt (len .levels) 2 }} +{{ sub (len .levels) 2 }}{{ end }}</span></p>
+  <h2 class="res-title"><a href="{{ .url }}">{{ .title }}</a></h2>
+  <p class="res-tag">{{ delimit .clusters ", " }}</p>
+</article>
diff --git a/layouts/partials/doors/resource_data.html b/layouts/partials/doors/resource_data.html
new file mode 100644
index 00000000000..da6ace9a40f
--- /dev/null
+++ b/layouts/partials/doors/resource_data.html
@@ -0,0 +1,54 @@
+{{/* The two files resources.js loads: a small one for filtering, and one with every field for
+     searching, fetched on the first search. Built once. Input: dict with `index`. Each row's `d`
+     is the date added, from the form's `timestamp`, as "YYYY-MM-DDTHH:MM:SS" for sorting, or ""
+     when there is none. The sheet holds form times ("6/27/2023 14:45:33"), ISO times from the
+     2020 import, and a bare "01/01/2020" that stands in for an unknown date, so that counts as none. */}}
+{{ $index := .index }}
+{{ $facets := dict }}
+{{ $positions := dict }}
+{{ range $index.facets }}
+  {{ $facets = merge $facets (dict .key (apply .values "index" "." "slug")) }}
+  {{ $labels := dict }}
+  {{ range $i, $value := .values }}{{ $labels = merge $labels (dict (urlize $value.label) $i) }}{{ end }}
+  {{ $positions = merge $positions (dict .key $labels) }}
+{{ end }}
+{{ $rows := slice }}
+{{ $search := slice }}
+{{ range $index.pages }}
+  {{ $item := index $index.items .RelPermalink }}
+  {{ $t := slice }}{{ range $item.types }}{{ $t = $t | append (index $positions.type (urlize .)) }}{{ end }}
+  {{ $l := slice }}{{ range $item.levels }}{{ $l = $l | append (index $positions.level (urlize .)) }}{{ end }}
+  {{ $c := slice }}{{ range $item.clusters }}{{ $c = $c | append (index $positions.cluster (urlize .)) }}{{ end }}
+  {{ $stamp := trim (.Params.timestamp | default "" | string) " " }}
+  {{ $added := "" }}
+  {{ with findRESubmatch `^(\d{1,2})/(\d{1,2})/(\d{4}) (\d{1,2}):(\d{2}):(\d{2})$` $stamp 1 }}
+    {{ $p := index . 0 }}
+    {{/* Padded by length, as Hugo's int reads "08" as octal. */}}
+    {{ $pad := slice }}
+    {{ range slice (index $p 1) (index $p 2) (index $p 4) }}{{ $pad = $pad | append (cond (eq (len .) 1) (printf "0%s" .) .) }}{{ end }}
+    {{ $added = printf "%s-%s-%sT%s:%s:%s" (index $p 3) (index $pad 0) (index $pad 1) (index $pad 2) (index $p 5) (index $p 6) }}
+  {{ else }}
+    {{ if findRE `^\d{4}-\d{2}-\d{2}T\d{2}:\d{2}:\d{2}` $stamp 1 }}{{ $added = substr $stamp 0 19 }}{{ end }}
+  {{ end }}
+  {{ $rows = $rows | append (dict "t" $item.title "u" (path.Base (strings.TrimSuffix "/" .RelPermalink)) "y" $t "l" $l "c" $c "d" $added) }}
+  {{/* Every field, as the old page's search had (issue #286). */}}
+  {{ $tags := partial "functions/page_tags.html" . }}
+  {{ $search = $search | append (lower (delimit (slice
+    $item.title
+    (.Params.abstract | default "" | markdownify | plainify | htmlUnescape)
+    (delimit (.Params.creators | default slice) " ")
+    (delimit (.Params.material_type | default slice) " ")
+    (delimit (.Params.primary_user | default slice) " ")
+    (delimit (.Params.subject_areas | default slice) " ")
+    (delimit ($tags | default slice) " ")
+    (delimit (.Params.education_level | default slice) " ")
+    (delimit (.Params.language | default slice) " ")
+    (.Params.conditions_of_use | default "")
+    (.Params.forrt_clusters_new | default "")
+    (.Params.forrt_sub_clusters | default "")
+  ) " ")) }}
+{{ end }}
+{{ $base := path.Dir (strings.TrimSuffix "/" (index $index.pages 0).RelPermalink) }}
+{{ $directory := dict "base" (printf "%s/" $base) "facets" $facets "items" $rows | jsonify | resources.FromString "resources/directory.json" }}
+{{ $searchFile := $search | jsonify | resources.FromString "resources/search.json" }}
+{{ return dict "directory" $directory "search" $searchFile }}
diff --git a/layouts/partials/doors/resource_index.html b/layouts/partials/doors/resource_index.html
new file mode 100644
index 00000000000..ce59ba67e26
--- /dev/null
+++ b/layouts/partials/doors/resource_index.html
@@ -0,0 +1,71 @@
+{{/* Every curated resource, with its filters worked out from the sheet's free-text values.
+     Returns a dict: `pages` (A to Z), `items` keyed by RelPermalink, and `facets`, the filter
+     values in display order with their counts. Hugo caches it, as pager pages all need it.
+     Input: the /resources/ section page, whose front matter holds the groupings. */}}
+{{ $section := . }}
+{{/* By file name, which is the title without capitals, quotation marks or stray spaces. */}}
+{{ $pages := sort (where site.RegularPages "Type" "curated_resources") ".File.ContentBaseName" }}
+
+{{ $typeLabel := dict }}{{ $typeOrder := slice }}
+{{ range $section.Params.type_groups }}
+  {{ $label := .label }}{{ $typeOrder = $typeOrder | append $label }}
+  {{ range .values }}{{ $typeLabel = merge $typeLabel (dict (urlize .) $label) }}{{ end }}
+{{ end }}
+{{ $levelLabel := dict }}{{ $levelOrder := slice }}
+{{ range $section.Params.level_groups }}
+  {{ $label := .label }}{{ $levelOrder = $levelOrder | append $label }}
+  {{ range .values }}{{ $levelLabel = merge $levelLabel (dict (urlize .) $label) }}{{ end }}
+{{ end }}
+{{ $clusterLabel := dict }}{{ $clusterOrder := slice }}
+{{ range $section.Params.clusters }}
+  {{ $clusterOrder = $clusterOrder | append . }}
+  {{ $clusterLabel = merge $clusterLabel (dict (urlize .) .) }}
+{{ end }}
+
+{{ $items := dict }}
+{{ $typeCount := dict }}{{ $levelCount := dict }}{{ $clusterCount := dict }}
+{{ range $pages }}
+  {{ $types := slice }}
+  {{ range .Params.material_type }}
+    {{ $label := index $typeLabel (urlize .) | default "Other" }}
+    {{ if not (in $types $label) }}{{ $types = $types | append $label }}{{ end }}
+  {{ end }}
+  {{ $levels := slice }}
+  {{ range .Params.education_level }}
+    {{ $label := index $levelLabel (urlize .) | default "Other" }}
+    {{ if not (in $levels $label) }}{{ $levels = $levels | append $label }}{{ end }}
+  {{ end }}
+  {{ $clusters := slice }}
+  {{ range split (.Params.forrt_clusters_new | default "") "," }}
+    {{ $raw := trim . " " }}
+    {{ with $raw }}
+      {{ $label := index $clusterLabel (urlize .) }}
+      {{ if not $label }}
+        {{ $label = . }}
+        {{ $clusterLabel = merge $clusterLabel (dict (urlize .) .) }}
+        {{ $clusterOrder = $clusterOrder | append . }}
+      {{ end }}
+      {{ if not (in $clusters $label) }}{{ $clusters = $clusters | append $label }}{{ end }}
+    {{ end }}
+  {{ end }}
+  {{ range $types }}{{ $typeCount = merge $typeCount (dict (urlize .) (add 1 (index $typeCount (urlize .) | default 0))) }}{{ end }}
+  {{ range $levels }}{{ $levelCount = merge $levelCount (dict (urlize .) (add 1 (index $levelCount (urlize .) | default 0))) }}{{ end }}
+  {{ range $clusters }}{{ $clusterCount = merge $clusterCount (dict (urlize .) (add 1 (index $clusterCount (urlize .) | default 0))) }}{{ end }}
+  {{ $title := .Title | markdownify | plainify | htmlUnescape }}
+  {{ $items = merge $items (dict .RelPermalink (dict "title" $title "url" .RelPermalink "types" $types "levels" $levels "clusters" $clusters)) }}
+{{ end }}
+
+{{ $facets := slice }}
+{{ range slice
+  (dict "key" "type" "name" "Material type" "order" ($typeOrder | append "Other") "counts" $typeCount)
+  (dict "key" "level" "name" "Education level" "order" ($levelOrder | append "Other") "counts" $levelCount)
+  (dict "key" "cluster" "name" "Cluster" "order" $clusterOrder "counts" $clusterCount)
+}}
+  {{ $counts := .counts }}
+  {{ $values := slice }}
+  {{ range $label := .order }}
+    {{ with index $counts (urlize $label) }}{{ $values = $values | append (dict "label" $label "slug" ($label | lower | replaceRE "[^a-z0-9]+" "-") "count" .) }}{{ end }}
+  {{ end }}
+  {{ $facets = $facets | append (dict "key" .key "name" .name "values" $values) }}
+{{ end }}
+{{ return dict "pages" $pages "items" $items "facets" $facets }}
diff --git a/layouts/partials/doors/resource_keywords.html b/layouts/partials/doors/resource_keywords.html
new file mode 100644
index 00000000000..65d73d0410e
--- /dev/null
+++ b/layouts/partials/doors/resource_keywords.html
@@ -0,0 +1,16 @@
+{{/* A resource's tags as one line of keywords. On a resource they describe it, so every tag shows, rare ones
+     included: a tag on at least `min` pages (functions/tag_counts.html) links to its list on /tags/, and a rarer one,
+     whose list would hold a page or two, is plain text. Elsewhere `tags` shows only the common ones, as chips. */}}
+{{ $tc := partialCached "functions/tag_counts.html" . }}
+{{ $words := slice }}
+{{ range partial "functions/page_tags.html" . }}
+  {{ $n := int (index $tc.counts (lower .) | default 0) }}
+  {{/* A site-wide tag (on more than `max` pages) describes nothing here, so it is left out. */}}
+  {{ if gt $n $tc.max }}{{ continue }}{{ end }}
+  {{ if ge $n $tc.min }}
+    {{ $words = $words | append (printf `<a href="%s">%s</a>` (printf "tags/?tag=%s" (. | urlquery) | relURL) (. | htmlEscape)) }}
+  {{ else }}
+    {{ $words = $words | append (. | htmlEscape) }}
+  {{ end }}
+{{ end }}
+{{ with $words }}<p class="resource-keywords"><strong>Keywords</strong> {{ delimit . " · " | safeHTML }}</p>{{ end }}
diff --git a/layouts/partials/doors/resource_url.html b/layouts/partials/doors/resource_url.html
new file mode 100644
index 00000000000..5a1494c5de2
--- /dev/null
+++ b/layouts/partials/doors/resource_url.html
@@ -0,0 +1,6 @@
+{{/* A curated resource's link. The sheet holds a few bare DOIs and web addresses, which would resolve
+     against this site. Input: the resource's page. */}}
+{{ $url := strings.TrimSpace (.Params.link_to_resource | default "") }}
+{{ if hasPrefix $url "10." }}{{ $url = printf "https://doi.org/%s" $url }}
+{{ else if and $url (not (urls.Parse $url).Scheme) }}{{ $url = printf "https://%s" $url }}{{ end }}
+{{ return $url }}
diff --git a/layouts/partials/doors/search_icon.html b/layouts/partials/doors/search_icon.html
new file mode 100644
index 00000000000..5acbdc99a18
--- /dev/null
+++ b/layouts/partials/doors/search_icon.html
@@ -0,0 +1 @@
+<svg aria-hidden="true" width="18" height="18" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2.4" stroke-linecap="round"><circle cx="10.5" cy="10.5" r="6.5"/><path d="m15.5 15.5 5 5"/></svg>
diff --git a/layouts/partials/doors/term_title.html b/layouts/partials/doors/term_title.html
new file mode 100644
index 00000000000..cd441980ed6
--- /dev/null
+++ b/layouts/partials/doors/term_title.html
@@ -0,0 +1,6 @@
+{{/* A glossary term's title. Titles may carry inline Markdown, e.g. the italic p in "Research
+     Contribution Metric (*p*)"; the title is escaped first so it cannot inject HTML. Translated terms end
+     in the English title in square brackets, which must stay left to right inside an Arabic heading,
+     or its words change places. It shows as a second line (glossary.css), so it needs no brackets. */}}
+{{ $out := replaceRE `^(.*) \[(.*)\]$` `$1 <bdi class="term-en" dir="ltr" lang="en">$2</bdi>` (. | htmlEscape | markdownify | string) | safeHTML }}
+{{ return $out }}
diff --git a/layouts/partials/doors/toc_card.html b/layouts/partials/doors/toc_card.html
new file mode 100644
index 00000000000..bc01cee6c6d
--- /dev/null
+++ b/layouts/partials/doors/toc_card.html
@@ -0,0 +1,7 @@
+{{/* The side card on a section page: what to jump to. */}}
+<section class="article-card" aria-label="On this page">
+  <h2>On this page</h2>
+  <div class="article-toc"><nav id="TableOfContents"><ul>
+    {{ range . }}<li><a href="#{{ .id }}">{{ .title | markdownify | emojify | plainify }}</a></li>{{ end }}
+  </ul></nav></div>
+</section>
diff --git a/layouts/partials/doors/toc_phone.html b/layouts/partials/doors/toc_phone.html
new file mode 100644
index 00000000000..3b25ef7ab84
--- /dev/null
+++ b/layouts/partials/doors/toc_phone.html
@@ -0,0 +1,8 @@
+{{/* The contents on a phone, where the side card would fall below the text: an open list under a small "On this page"
+     label. site.js shortens a list of more than six sections to its first five, with a button that shows the rest;
+     without script the whole list shows. Input: the contents' rendered <nav> (a list of links). Used by
+     doors/reading and widget_page. */}}
+<div class="toc-phone">
+  <p class="toc-phone-label" aria-hidden="true">On this page</p>
+  <div class="article-toc">{{ . | safeHTML }}</div>
+</div>
diff --git a/layouts/partials/functions/page_description.html b/layouts/partials/functions/page_description.html
index e22c236b20c..2d4fa69f47b 100644
--- a/layouts/partials/functions/page_description.html
+++ b/layouts/partials/functions/page_description.html
@@ -14,6 +14,8 @@
 {{/* Closing block tags become spaces so paragraphs do not run together
      ("alone.The paper") once the markup is stripped. */}}
 {{- $block_end := `(<br\s*/?>|</(p|li|h[1-6]|div|td|blockquote)>)` -}}
+{{/* A shortened author list (citations/authors) keeps every author; drop its "et al." and button. */}}
+{{- $author_ui := `<span class="?ref-etal"?>[^<]*</span>|<button[^>]*ref-authors-toggle[^>]*>[^<]*</button>` -}}
 {{- $desc := "" -}}
 
 {{- if $page.IsHome -}}
@@ -56,7 +58,7 @@
   {{/* Front matter is raw Markdown (`**bold**`, links); `.Summary` is HTML.
        Render, strip the markup, then decode entities such as `&ldquo;` that
        Markdown typography produced. */}}
-  {{- $desc = trim ($page.RenderString (string $desc) | replaceRE $block_end "$1 " | plainify | htmlUnescape) $ws -}}
+  {{- $desc = trim ($page.RenderString (string $desc) | replaceRE $author_ui "" | replaceRE $block_end "$1 " | plainify | htmlUnescape) $ws -}}
 
   {{/* Curated resources whose abstract is a placeholder ("n.a.") or shared
        with other resources: lead with the resource's own title, type and
@@ -93,12 +95,12 @@
       {{- $desc = printf "Browse all %d %s used on FORRT: %s." (len $terms) (replace $page.Data.Plural "_" " ") (delimit $terms ", ") -}}
     {{- else if eq $page.Type "widget_page" -}}
       {{/* Widget pages render no body of their own: use the first widget,
-           in the order the page lays them out, that has text. `.Plain` includes
+           in the order the page lays them out, that has text. Its plain text includes
            whatever its shortcodes render, so a page whose first widget opens
            with interface text (filter buttons) needs a `summary` of its own. */}}
       {{- range where ($page.Resources.ByType "page") ".Params.active" "!=" false -}}
         {{- if not $desc -}}
-          {{- $desc = trim (.Plain | htmlUnescape) $ws -}}
+          {{- $desc = trim (.Content | replaceRE $author_ui "" | plainify | htmlUnescape) $ws -}}
         {{- end -}}
       {{- end -}}
     {{- end -}}
diff --git a/layouts/partials/functions/plain_title.html b/layouts/partials/functions/plain_title.html
new file mode 100644
index 00000000000..00bfece6cd1
--- /dev/null
+++ b/layouts/partials/functions/plain_title.html
@@ -0,0 +1,6 @@
+{{/* Plain text of a page's title (or link title) for <title>, og:title, breadcrumbs and JSON-LD.
+     Input: dict "page" and "text". Glossary titles may carry inline Markdown (an italic *p*),
+     which is rendered and then stripped; other pages' text passes through unchanged. */}}
+{{ $text := .text }}
+{{ if eq .page.Type "glossary" }}{{ $text = $text | htmlEscape | markdownify | plainify | htmlUnescape }}{{ end }}
+{{ return $text }}
diff --git a/layouts/partials/functions/resource_metadata.html b/layouts/partials/functions/resource_metadata.html
new file mode 100644
index 00000000000..2ff3bd37fbf
--- /dev/null
+++ b/layouts/partials/functions/resource_metadata.html
@@ -0,0 +1,26 @@
+{{/* Keep the resources pager identical in the head and body. Do not initialize
+     pagination on other lists: their templates choose their own collections. */}}
+{{ $description := partialCached "functions/page_description.html" . .RelPermalink }}
+{{ $metadata := dict "url" .Permalink "title" .Title "breadcrumb_title" (.LinkTitle | default .Title) "description" $description "pages" .Pages }}
+{{ if eq .Type "glossary" }}
+  {{ $metadata = merge $metadata (dict
+    "title" (partial "functions/plain_title.html" (dict "page" . "text" .Title))
+    "breadcrumb_title" (partial "functions/plain_title.html" (dict "page" . "text" (.LinkTitle | default .Title)))
+  ) }}
+{{ end }}
+{{ if and .IsSection (eq .Section "resources") }}
+  {{ $index := partialCached "doors/resource_index" . "resources" }}
+  {{ $pager := .Paginate $index.pages 24 }}
+  {{ $metadata = merge $metadata (dict "pages" $pager.Pages) }}
+  {{ if gt $pager.PageNumber 1 }}
+    {{ $start := add (mul (sub $pager.PageNumber 1) 24) 1 }}
+    {{ $end := add (sub $start 1) (len $pager.Pages) }}
+    {{ $metadata = merge $metadata (dict
+      "url" ($pager.URL | absURL)
+      "title" (printf "%s – Page %d" .Title $pager.PageNumber)
+      "breadcrumb_title" (printf "%s – Page %d" .Title $pager.PageNumber)
+      "description" (printf "%s, page %d of %d: resources %d–%d of %d. %s" .Title $pager.PageNumber $pager.TotalPages $start $end $pager.TotalNumberOfElements $metadata.description)
+    ) }}
+  {{ end }}
+{{ end }}
+{{ return $metadata }}
diff --git a/layouts/partials/functions/social_image.html b/layouts/partials/functions/social_image.html
new file mode 100644
index 00000000000..28b62f8fb17
--- /dev/null
+++ b/layouts/partials/functions/social_image.html
@@ -0,0 +1,12 @@
+{{/* Format conversion only: preserve the selected image, dimensions and alpha.
+     Keep an undecodable original rather than substituting a different image. */}}
+{{ $image := . }}
+{{ if not (in (slice "image/png" "image/jpeg") .MediaType.Type) }}
+  {{ $converted := try (.Process "png") }}
+  {{ if $converted.Err }}
+    {{ warnf "Cannot generate a PNG social image from %q; keeping the original image." .Name }}
+  {{ else }}
+    {{ $image = $converted.Value }}
+  {{ end }}
+{{ end }}
+{{ return $image }}
diff --git a/layouts/partials/functions/tag_counts.html b/layouts/partials/functions/tag_counts.html
index aa1e4ea3075..3bb4738d150 100644
--- a/layouts/partials/functions/tag_counts.html
+++ b/layouts/partials/functions/tag_counts.html
@@ -1,15 +1,18 @@
 {{/* Every tag in use, with the number of pages carrying it.
 
      `tags` is plain front matter rather than a taxonomy (see `[taxonomies]` in
-     config/_default/config.toml), so counts come from one walk over the pages. `Scratch.SetInMap` mutates one map in place; tallying with `merge`
-     instead would copy a ~1,650-key map on each of ~5,400 tags. The term order
-     is tracked alongside the tally because Hugo has no `keys` function.
+     config/_default/config.toml), so counts come from one walk over the pages.
+     `Scratch.SetInMap` mutates one map in place; tallying with `merge` instead
+     would copy a ~1,650-key map on each of ~5,400 tags. The term order is
+     tracked alongside the tally because Hugo has no `keys` function.
 
      Call through `partialCached` so the walk happens once per build.
 
      Inputs: none (uses `site`). Output: dict with `rows` (dicts of `tag` and
      `count`, most used first, one row per term regardless of spelling),
-     `pages` (pages carrying at least one tag) and `total` (tag applications).
+     `min` (the page count a tag needs to be shown), `max` (a quarter of the tagged
+     pages, above which a tag is too general to show), `common` (the rows from `min` to `max` pages), `counts` (lower-cased term to count), `pages` (pages
+     carrying at least one tag) and `total` (tag applications).
      `pages` is counted here rather than with a `where` on `Params.tags`, which
      would also match pages that declare an empty `tags: []`. */}}
 
@@ -53,4 +56,13 @@
   {{ $rows = $rows | append (dict "tag" (index $labels .) "count" (int (index $counts .))) }}
 {{ end }}
 
-{{ return (dict "rows" (sort $rows "count" "desc") "pages" $pages "total" $total) }}
+{{/* Tags on fewer than `min` pages are left out of the /tags/ list and off page badges: three quarters
+     of the vocabulary is used once, which made both read as clutter. Every tag still works in
+     `/tags/?tag=` (old /tag/<term>/ links arrive there) and in site search. */}}
+{{ $min := 5 }}
+{{/* A tag on more than a quarter of the tagged pages (today only "Open Science", on about 30%) says nothing on
+     a site about open science, so it is not shown as a tag. Its address under /tags/?tag= still works. */}}
+{{ $max := div $pages 4 }}
+{{ $common := where (where $rows "count" "ge" $min) "count" "le" $max }}
+
+{{ return (dict "rows" (sort $rows "count" "desc") "common" (sort $common "count" "desc") "counts" $counts "min" $min "max" $max "pages" $pages "total" $total) }}
diff --git a/layouts/partials/glossary_feedback_form.html b/layouts/partials/glossary_feedback_form.html
index c550d8353c6..e68f09c4cf8 100644
--- a/layouts/partials/glossary_feedback_form.html
+++ b/layouts/partials/glossary_feedback_form.html
@@ -148,20 +148,18 @@
 
 <style>
   .glossary-feedback {
-    margin: 2.5rem 0 1.5rem;
-    padding: 1.5rem 1.75rem;
-    border: 1px solid rgba(0, 0, 0, 0.08);
-    /* Logical property (not border-left) so the accent stripe flips to the
-       visual right automatically on the Arabic (dir="rtl") pages. */
-    border-inline-start: 4px solid #007bff;
-    border-radius: 8px;
-    background: rgba(0, 123, 255, 0.03);
+    margin: 1.5rem 0 1rem;
+    padding: 0;
+    border-top: 1px solid var(--line);
+    border-bottom: 1px solid var(--line);
   }
 
   .glossary-feedback-header {
     display: flex;
     align-items: center;
-    gap: 0.85rem;
+    gap: 0.5rem;
+    min-height: 48px;
+    padding: 8px 0;
     /* <summary> renders the header row; strip its native disclosure
        triangle so our own chevron is the only toggle affordance. */
     cursor: pointer;
@@ -181,25 +179,22 @@
     display: inline-flex;
     align-items: center;
     justify-content: center;
-    width: 2.25rem;
-    height: 2.25rem;
-    border-radius: 50%;
-    background: rgba(0, 123, 255, 0.12);
-    color: #007bff;
-    font-size: 1.1rem;
+    color: var(--link);
+    font-size: 17px;
   }
 
   .glossary-feedback-heading {
     margin: 0;
-    font-size: 1.05rem;
-    font-weight: 700;
+    font-size: 17px;
+    font-weight: 600;
+    color: var(--link);
     flex: 1 1 auto;
   }
 
   .glossary-feedback-chevron {
     flex: none;
-    color: #6c757d;
-    font-size: 0.8rem;
+    color: var(--soft);
+    font-size: 16px;
     transition: transform 0.2s ease;
   }
 
@@ -209,13 +204,14 @@
   }
 
   .glossary-feedback-body {
-    margin-top: 1.25rem;
+    margin: 0.5rem 0 1.25rem;
   }
 
-  .glossary-feedback-intro {
+  /* Specific enough to beat the article's paragraph rule (.article-layout .article-style p). */
+  .glossary-feedback .glossary-feedback-body p.glossary-feedback-intro {
     margin: 0 0 1rem;
-    color: #6c757d;
-    font-size: 0.9rem;
+    color: var(--soft);
+    font-size: 16px;
     line-height: 1.5;
   }
 
@@ -224,20 +220,19 @@
   }
 
   .glossary-feedback-form label {
-    font-size: 0.8rem;
+    font-size: 15px;
     font-weight: 600;
     margin-bottom: 0.35rem;
   }
 
-  /* Bootstrap's default .form-control font-size (1rem) reads oversized next
-     to this form's compact label/intro text — halved to match. */
+  /* Fields at 16 px, so phones do not zoom in on them and the text meets the site's 15 px minimum. */
   .glossary-feedback-form .form-control {
-    font-size: 0.7rem;
+    font-size: 16px;
   }
 
   .glossary-feedback-form .form-control:focus {
-    border-color: #007bff;
-    box-shadow: 0 0 0 0.15rem rgba(0, 123, 255, 0.2);
+    border-color: var(--link);
+    box-shadow: 0 0 0 0.15rem rgba(0, 90, 135, 0.2);
   }
 
   .glossary-feedback-row {
@@ -247,10 +242,6 @@
   }
 
   @media (max-width: 576px) {
-    .glossary-feedback {
-      padding: 1.25rem;
-    }
-
     .glossary-feedback-row {
       grid-template-columns: 1fr;
     }
@@ -265,12 +256,12 @@
   }
 
   .glossary-feedback-status {
-    font-size: 0.85rem;
-    color: #28a745;
+    font-size: 15px;
+    color: var(--edu);
   }
 
   .glossary-feedback-status.text-danger {
-    color: #dc3545 !important;
+    color: var(--urgent) !important;
   }
 
   /* Off-screen positioning (not display:none) keeps the field in the
@@ -278,14 +269,14 @@
      display:none fields outright but still auto-fill this kind of trap. */
   .glossary-feedback-hp {
     position: absolute;
-    left: -9999px;
     width: 1px;
     height: 1px;
     overflow: hidden;
+    clip-path: inset(50%);
   }
 
   .dark .glossary-feedback {
-    background: rgba(0, 123, 255, 0.07);
+    background: var(--res-bg);
     border-color: rgb(68, 71, 90);
   }
 
diff --git a/layouts/partials/jsonld/main.html b/layouts/partials/jsonld/main.html
index 78f14f46f83..ac59dd75124 100644
--- a/layouts/partials/jsonld/main.html
+++ b/layouts/partials/jsonld/main.html
@@ -13,6 +13,7 @@
 
 {{ $page := .page }}
 {{ $summary := .summary }}
+{{ $metadata := partial "functions/resource_metadata.html" $page }}
 {{ $site_type := site.Params.site_type | default "Person" }}
 
 {{- if $page.IsHome -}}
@@ -38,9 +39,9 @@
   {{ $collection := dict
     "@context" "https://schema.org"
     "@type" "CollectionPage"
-    "@id" (printf "%s#collection" $page.Permalink)
-    "url" $page.Permalink
-    "name" $page.Title
+    "@id" (printf "%s#collection" $metadata.url)
+    "url" $metadata.url
+    "name" $metadata.title
     "isPartOf" (dict "@type" "WebSite" "@id" site.BaseURL "name" site.Title)
     "inLanguage" (partial "functions/page_language.html" $page)
   }}
@@ -52,19 +53,19 @@
   {{/* Capped: these lists run to hundreds of entries, and the point is to
        describe what the page covers, not to mirror it. */}}
   {{ $elements := slice }}
-  {{ range $i, $item := first 25 $page.Pages }}
+  {{ range $i, $item := first 25 $metadata.pages }}
     {{ $elements = $elements | append (dict
       "@type" "ListItem"
       "position" (add $i 1)
       "url" $item.Permalink
-      "name" $item.LinkTitle
+      "name" (partial "functions/plain_title.html" (dict "page" $item "text" $item.LinkTitle))
     ) }}
   {{ end }}
 
   {{ if $elements }}
     {{ $collection = merge $collection (dict "mainEntity" (dict
       "@type" "ItemList"
-      "numberOfItems" (len $page.Pages)
+      "numberOfItems" (len $metadata.pages)
       "itemListElement" $elements
     )) }}
   {{ end }}
diff --git a/layouts/partials/page_author_card.html b/layouts/partials/page_author_card.html
new file mode 100644
index 00000000000..53e23e2c358
--- /dev/null
+++ b/layouts/partials/page_author_card.html
@@ -0,0 +1,33 @@
+{{/* Site override of the theme's author card: its name is an h2 and its role plain text, so that
+     headings stay in order under an article. */}}
+{{ $page := .page }}
+{{ $author_urlized := .username }}
+{{ $site_type := site.Params.site_type | default "Person" }}
+{{ $taxonomy := "authors" }}
+{{ $profile_page := site.GetPage (printf "/%s/%s" $taxonomy $author_urlized) }}
+{{ with $profile_page }}
+  {{ if isset .Params "superuser" }}{{/* Check an author profile exists. */}}
+    {{/* If it's a personal site and primary page author is superuser, link to the homepage rather than their profile page. */}}
+    {{ $profile_url := .RelPermalink }}
+    {{ if and (eq $site_type "Person") (eq .Params.superuser true) }}
+      {{ $profile_url = site.BaseURL }}
+    {{ end }}
+    {{ $avatar := (.Resources.ByType "image").GetMatch "*avatar*" }}
+    {{ $avatar_shape := site.Params.avatar.shape | default "circle" }}
+    <div class="media author-card content-widget-hr">
+      {{ if and site.Params.avatar.gravatar .Params.email }}
+        <img class="avatar mr-3 {{if eq $avatar_shape "square"}}avatar-square{{else}}avatar-circle{{end}}" src="https://s.gravatar.com/avatar/{{ md5 .Params.email }}?s=200" alt="{{.Title}}">
+      {{ else if $avatar }}
+        {{ $avatar_image := $avatar.Fill "270x270 Center" }}
+        <img class="avatar mr-3 {{if eq $avatar_shape "square"}}avatar-square{{else}}avatar-circle{{end}}" src="{{ $avatar_image.RelPermalink }}" alt="{{.Title}}">
+      {{ end }}
+
+      <div class="media-body">
+        <h2 class="card-title"><a href="{{$profile_url}}">{{.Title}}</a></h2>
+        {{ with .Params.role }}<p class="card-subtitle">{{. | markdownify | emojify}}</p>{{end}}
+        {{ with .Params.bio }}<p class="card-text">{{. | markdownify | emojify}}</p>{{end}}
+        {{ partial "social_links" . }}
+      </div>
+    </div>
+  {{end}}
+{{end}}{{/* Profile page block */}}
diff --git a/layouts/partials/replication-hub/cards.html b/layouts/partials/replication-hub/cards.html
deleted file mode 100644
index aa98f2b929a..00000000000
--- a/layouts/partials/replication-hub/cards.html
+++ /dev/null
@@ -1,25 +0,0 @@
-{{/* cards.html - Four area cards for the Replication Hub, driven by .Params.cards */}}
-<div class="rephub-cards">
-
-  {{ range .Params.cards }}
-  <div class="rephub-card rephub-card--{{ .key }}">
-    <div class="rephub-card__header">
-      <h2 class="rephub-card__title">{{ .title }}</h2>
-    </div>
-    <div class="rephub-card__body">
-      <p>{{ .description | markdownify }}</p>
-      {{ if .links }}
-      <h3 class="rephub-card__links-heading">Direct Links to Projects</h3>
-      <ul class="rephub-card__links">
-        {{ range .links }}
-        <li>
-          {{ if .url }}<a href="{{ .url }}">{{ .text }}</a>{{ else }}{{ .text }}{{ end }}
-        </li>
-        {{ end }}
-      </ul>
-      {{ end }}
-    </div>
-  </div>
-  {{ end }}
-
-</div>
diff --git a/layouts/partials/replication-hub/intro.html b/layouts/partials/replication-hub/intro.html
deleted file mode 100644
index 6f84088df08..00000000000
--- a/layouts/partials/replication-hub/intro.html
+++ /dev/null
@@ -1,52 +0,0 @@
-{{/* intro.html - Intro with text left, lightbox image right (replication hub) */}}
-<div class="clusters-intro">
-
-  <div class="intro-hero">
-    {{/* Left column: text */}}
-    <div class="intro-hero-text">
-      <p class="intro-paragraph">
-        {{ .Params.intro | markdownify }}
-      </p>
-    </div>
-
-    {{/* Right column: lightbox image */}}
-    {{ with .Params.image }}
-    <div class="intro-hero-image">
-      <a href="{{ . }}" class="lightbox-trigger" aria-label="View full-size Replication Hub diagram">
-        <div class="intro-thumbnail-wrapper">
-          <img src="{{ . }}" alt="{{ $.Params.image_alt | default "Replication Hub diagram" }}" class="intro-thumbnail" loading="lazy">
-        </div>
-        <span class="lightbox-hint">
-          <svg xmlns="http://www.w3.org/2000/svg" width="16" height="16" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><circle cx="11" cy="11" r="8"/><line x1="21" y1="21" x2="16.65" y2="16.65"/><line x1="11" y1="8" x2="11" y2="14"/><line x1="8" y1="11" x2="14" y2="11"/></svg>
-          Click to enlarge
-        </span>
-      </a>
-    </div>
-    {{ end }}
-  </div>
-
-  {{/* Lightbox overlay */}}
-  {{ with .Params.image }}
-  <div class="lightbox-overlay" id="rephub-lightbox" role="dialog" aria-modal="true" aria-label="Replication Hub diagram">
-    <button class="lightbox-close" aria-label="Close">&times;</button>
-    <img src="{{ . }}" alt="{{ $.Params.image_alt | default "Replication Hub diagram" }}" class="lightbox-image">
-  </div>
-
-  <script>
-  (function() {
-    var trigger = document.querySelector('#rephub-lightbox').closest('.clusters-intro').querySelector('.lightbox-trigger');
-    var overlay = document.getElementById('rephub-lightbox');
-    var closeBtn = overlay.querySelector('.lightbox-close');
-
-    function open(e) { e.preventDefault(); overlay.classList.add('active'); }
-    function close() { overlay.classList.remove('active'); }
-
-    trigger.addEventListener('click', open);
-    closeBtn.addEventListener('click', close);
-    overlay.addEventListener('click', function(e) { if (e.target === overlay) close(); });
-    document.addEventListener('keydown', function(e) { if (e.key === 'Escape') close(); });
-  })();
-  </script>
-  {{ end }}
-
-</div>
diff --git a/layouts/partials/search.html b/layouts/partials/search.html
index d84a547d705..3ae5d4cb860 100644
--- a/layouts/partials/search.html
+++ b/layouts/partials/search.html
@@ -1,33 +1,20 @@
-<aside class="search-results" id="search">
-  <div class="container">
-    <section class="search-header">
-
-      <div class="row no-gutters justify-content-between mb-3">
-        <div class="col-6">
-          <h2>{{ i18n "search" }}</h2>
-        </div>
-        <div class="col-6 col-search-close">
-          <a class="js-search" href="#"><i class="fas fa-times-circle text-muted" aria-hidden="true"></i></a>
-        </div>
-      </div>
-
-      <div id="search-box">
-        {{ if eq site.Params.search.engine 1 }}
-        <label for="search-query" class="sr-only">Search: </label>
-        <input name="q" id="search-query" placeholder="{{i18n "search_placeholder"}}" autocapitalize="off"
-        autocomplete="off" autocorrect="off" spellcheck="false" type="search">
-        {{ else }}
-        <!-- Search box will appear here -->
-        {{ end }}
-      </div>
-
-    </section>
-    <section class="section-search-results">
-
-      <div id="search-hits">
-        <!-- Search results will appear here -->
-      </div>
-
-    </section>
+{{/* Site search: a native dialog opened from the header. assets/js/doors/search.js and Fuse load
+     the first time a visitor searches, and the index only then. layouts/_default/index.json is the
+     theme's and stays as it is. */}}
+{{ $js := hugo.Data.assets.js }}
+{{ $search := resources.Get "js/doors/search.js" | js.Build (dict "minify" true "format" "iife" "target" "es2019") | fingerprint "md5" }}
+<dialog class="search-dialog" id="searchDialog" lang="en" aria-label="Search this site"
+  data-script="{{ $search.RelPermalink }}"
+  data-index="{{ "index.json" | relLangURL }}"
+  data-fuse="{{ printf $js.fuse.url $js.fuse.version }}"
+  data-fuse-sri="{{ $js.fuse.sri }}"
+  data-threshold="{{ site.Params.search.academic.threshold | default 0.3 }}"
+  data-min-length="{{ site.Params.search.academic.min_length | default 1 }}">
+  <div class="search-top" lang="en" dir="ltr">
+    <label><span class="visually-hidden">Search this site</span>
+      <input id="searchQuery" type="search" placeholder="Search" autocapitalize="off" autocomplete="off" autocorrect="off" spellcheck="false"></label>
+    <button class="search-close" type="button">Close</button>
   </div>
-</aside>
+  <p class="search-status" id="searchStatus" role="status" lang="en" dir="ltr"></p>
+  <ol class="search-hits" id="searchHits"></ol>
+</dialog>
diff --git a/layouts/partials/section_pager.html b/layouts/partials/section_pager.html
index c6734c42a4c..aac178ee1ec 100644
--- a/layouts/partials/section_pager.html
+++ b/layouts/partials/section_pager.html
@@ -1,18 +1,36 @@
-{{ $str := "" }}
-<div class="post-nav d-sm-flex justify-content-around">
-  {{if .NextInSection}}
-  {{/* For the Book layout, prev/next labels are reversed. */}}
-  {{ if in (slice "docs" "book" "glossary" "educators-corner") .Type }}{{ $str = "previous" }}{{else}}{{ $str = "next" }}{{end}}
-  <div class="post-nav-item d-inline ">
-    <a href="{{.NextInSection.RelPermalink}}" rel="next"><div class="meta-nav">{{ i18n $str }}</div>
-    <p class=""> {{.NextInSection.Title}}</p></a>
+{{/* Previous on the left and Next on the right on every page that has them. Hugo's NextInSection is the
+     earlier page in a book-like section (glossary, docs), so those sections swap the two. */}}
+{{ $prev := .PrevInSection }}
+{{ $next := .NextInSection }}
+{{ $glossary := eq .Type "glossary" }}
+{{/* Glossary pages carry their own language; the Arabic one labels its pager in Arabic. */}}
+{{ $prevLabel := i18n "previous" }}{{ $nextLabel := i18n "next" }}
+{{ if and $glossary (eq .Params.language "arabic") }}{{ $prevLabel = "السابق" }}{{ $nextLabel = "التالي" }}{{ end }}
+{{ if in (slice "docs" "book" "glossary" "educators-corner") .Type }}
+  {{ $prev = .NextInSection }}
+  {{ $next = .PrevInSection }}
+{{ end }}
+{{/* Glossary terms step through their language's A to Z, the order of the glossary hub. */}}
+{{ if $glossary }}
+  {{ $terms := sort (where (where site.RegularPages "Type" "glossary") "File.Dir" .File.Dir) "Params.sort_key" }}
+  {{ $prev = false }}{{ $next = false }}{{ $here := -1 }}
+  {{ range $i, $p := $terms }}{{ if eq $p.RelPermalink $.RelPermalink }}{{ $here = $i }}{{ end }}{{ end }}
+  {{ if gt $here 0 }}{{ $prev = index $terms (sub $here 1) }}{{ end }}
+  {{ if and (ge $here 0) (lt (add $here 1) (len $terms)) }}{{ $next = index $terms (add $here 1) }}{{ end }}
+{{ end }}
+{{ if or $prev $next }}
+<div class="post-nav">
+  {{ with $prev }}
+  <div class="post-nav-item post-nav-prev">
+    <a href="{{ .RelPermalink }}" rel="prev"><div class="meta-nav"><span aria-hidden="true">← </span>{{ $prevLabel }}</div>
+    <p>{{ if $glossary }}{{ partial "doors/term_title" .Title }}{{ else }}{{ .Title }}{{ end }}</p></a>
   </div>
-  {{end}}
-  {{if .PrevInSection}}
-  {{ if in (slice "docs" "book" "glossary" "educators-corner") .Type }}{{ $str = "next" }}{{else}}{{ $str = "previous" }}{{end}}
-  <div class="post-nav-item d-inline order-2 text-sm-right">
-    <a href="{{.PrevInSection.RelPermalink}}" rel="prev"><div class="meta-nav">{{ i18n $str }}</div>
-    <p class="">{{.PrevInSection.Title}}</p></a>
+  {{ end }}
+  {{ with $next }}
+  <div class="post-nav-item post-nav-next">
+    <a href="{{ .RelPermalink }}" rel="next"><div class="meta-nav">{{ $nextLabel }}<span aria-hidden="true"> →</span></div>
+    <p>{{ if $glossary }}{{ partial "doors/term_title" .Title }}{{ else }}{{ .Title }}{{ end }}</p></a>
   </div>
-  {{end}}
+  {{ end }}
 </div>
+{{ end }}
diff --git a/layouts/partials/site_footer.html b/layouts/partials/site_footer.html
index d1626481590..a216681c8c0 100644
--- a/layouts/partials/site_footer.html
+++ b/layouts/partials/site_footer.html
@@ -1,50 +1,39 @@
-<style>
-  /* Styles for the site footer */
-  footer {
-    margin: 0.5rem;
-    padding: 0.5rem;
-    float: left;
-  }
-</style>
-
-<footer class="site-footer">
-  {{ with site.GetPage "/imprint" }}
-  <p class="powered-by">
-    <a class="btn btn-primary" href="/about/cite_us/" role="button">Cite FORRT</a>
-    <span style="margin-left: 2rem;"></span>
-    <a href="{{ .RelPermalink }}">{{ .Title }}</a>
-    {{ with site.GetPage "privacy.md" }}
-      &middot; {{ printf "<a href=\"%s\">%s</a>" .RelPermalink .Title | safeHTML }}
-    {{ end }}
-    {{ with site.GetPage "terms.md" }}
-      &middot; {{ printf "<a href=\"%s\">%s</a>" .RelPermalink .Title | safeHTML }}
-    {{ end }}
-    &middot; <a href="#" data-cookie-settings>{{ i18n "cookie_settings" }}</a>
-  </p>
-  {{ end }}
-
-  <p class="powered-by">
-    {{ with site.Copyright }}{{ replace . "{year}" now.Year | markdownify}}{{ end }}
-  </p>
-
-  {{/* Display copyright license. */}}
-  {{ partial "site_footer_license" . }}
-
-  <p class="powered-by">
-    {{ if not site.Params.i_am_a_sponsor }}
-    This website is published using two great open source tools:
-    <a href="https://gohugo.io" target="_blank" rel="noopener">Hugo</a> & the
-    <a href="https://hugoblox.com/" target="_blank" rel="noopener">Academic theme.</a>
-    {{ end }}
-
-    {{ if not (in (slice "book" "docs" "updates") .Type) }}
-    <span class="float-right" aria-hidden="true">
-      <a href="#" class="back-to-top">
-        <span class="button_icon">
-          <i class="fas fa-chevron-up fa-2x"></i>
-        </span>
-      </a>
-    </span>
-    {{ end }}
-  </p>
+{{/* Doors site footer, from the `footer` and `social` menus in config/_default/menus.toml. */}}
+{{ $page := . }}
+{{ $logo := resources.Get "images/doors/logo-row.webp" }}
+<footer class="site-foot" lang="en" dir="ltr">
+  <div class="wrap">
+    <div class="foot-top">
+      <div>
+        <a class="brand" href="{{ "" | relLangURL }}" aria-label="FORRT home"><img src="{{ $logo.RelPermalink }}" width="{{ $logo.Width }}" height="{{ $logo.Height }}" alt="FORRT"></a>
+        <p>{{ site.Params.description }}</p>
+        <a href="mailto:info@forrt.org">info@forrt.org</a>
+        <a class="more foot-news" href="{{ relref $page "/newsletters" }}">Subscribe to the FORRT newsletter</a>
+      </div>
+      {{ range site.Menus.footer }}
+      <div>
+        <h2>{{ .Name }}</h2>
+        {{ range .Children }}
+          {{ partial "doors/menu_link" (dict "entry" . "page" $page) }}
+        {{ end }}
+      </div>
+      {{ end }}
+    </div>
+    <div class="socials">
+      {{ range site.Menus.social }}<a href="{{ .URL }}" rel="noopener">{{ .Name }}</a>{{ end }}
+    </div>
+    <div class="foot-base">
+      <span>FORRT Germany e.V. is a registered charity in Germany, closely affiliated with FORRT.</span>
+      <span class="foot-licence"><img src="{{ "img/licenses/by-nc-sa.svg" | relURL }}" alt="" width="88" height="31">Content licensed <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/">CC BY-NC-SA 4.0</a> unless stated otherwise.</span>
+    </div>
+    <div class="foot-legal">
+      <a href="{{ relref $page "/about/cite_us" }}">Cite FORRT</a>
+      {{ with site.GetPage "/imprint" }}<a href="{{ .RelPermalink }}">{{ .Title }}</a>{{ end }}
+      {{ with site.GetPage "privacy.md" }}<a href="{{ .RelPermalink }}">{{ .Title }}</a>{{ end }}
+      {{ with site.GetPage "terms.md" }}<a href="{{ .RelPermalink }}">{{ .Title }}</a>{{ end }}
+      <a href="#" data-cookie-settings>{{ i18n "cookie_settings" }}</a>
+      <span>{{ with site.Copyright }}{{ replace . "{year}" now.Year | markdownify }}{{ end }}</span>
+      <span>Published with <a href="https://gohugo.io" rel="noopener">Hugo</a> and the <a href="https://hugoblox.com/" rel="noopener">Academic theme</a>.</span>
+    </div>
+  </div>
 </footer>
diff --git a/layouts/partials/site_footer_license.html b/layouts/partials/site_footer_license.html
deleted file mode 100644
index 5c314d98b77..00000000000
--- a/layouts/partials/site_footer_license.html
+++ /dev/null
@@ -1,34 +0,0 @@
-{{/* Display copyright license. */}}
-
-{{ $copyright_license := .Params.copyright_license | default site.Params.copyright_license }}
-
-{{ if and $copyright_license $copyright_license.enable }}
-
-{{ $notice := .Params.copyright_license.notice | default site.Params.copyright_license.notice }}
-{{ $allow_commercial := .Params.copyright_license.allow_commercial | default site.Params.copyright_license.allow_commercial }}
-{{ $allow_derivatives := .Params.copyright_license.allow_derivatives | default site.Params.copyright_license.allow_derivatives }}
-{{ $share_alike := .Params.copyright_license.share_alike | default site.Params.copyright_license.share_alike }}
-
-{{ $cc_code := "by" }}
-{{ if not $allow_commercial }}
-{{ $cc_code = printf "%s-nc" $cc_code }}
-{{ end }}
-{{ if and $allow_derivatives $share_alike }}
-{{ $cc_code = printf "%s-sa" $cc_code }}
-{{ else if not $allow_derivatives }}
-{{ $cc_code = printf "%s-nd" $cc_code }}
-{{ end }}
-
-{{ $license_url := printf "https://creativecommons.org/licenses/%s/4.0" ($cc_code | urlize) }}
-
-{{ with $notice }}
-<p class="powered-by copyright-license-text">
-    {{ replace . "{license}" (printf "<a href=\"%s\" rel=\"noopener noreferrer\" target=\"_blank\">CC %s 4.0</a>" $license_url (replace $cc_code "-" " " | upper)) | markdownify }}
-</p>
-{{ end }}
-
-<div class="d-flex justify-content-center powered-by footer-license-icons pb-2">
-    <a rel="license" href="http://creativecommons.org/licenses/by-nc-sa/4.0/"><img alt="Creative Commons License" style="border-width:0" src="{{ "img/cc-by-nc-sa-88x31.webp" | relURL }}" width="88" height="31" /></a>
-</div>
-
-{{ end }}
\ No newline at end of file
diff --git a/layouts/partials/site_head.html b/layouts/partials/site_head.html
index d00091ccb87..c7ceecfbb75 100644
--- a/layouts/partials/site_head.html
+++ b/layouts/partials/site_head.html
@@ -12,7 +12,7 @@
   <link rel="stylesheet" href="{{ .RelPermalink }}">
 {{ end }}
 
-  <link rel="stylesheet" href="/academicons/css/academicons.min.css"/>
+  <link rel="stylesheet" href="{{ "academicons/css/academicons.min.css" | relURL }}"/>
 
 
   {{ $scr := .Scratch }}
@@ -38,10 +38,12 @@
   <meta name="robots" content="noindex, nofollow">
   {{ end }}
 
+  {{ $metadata := partial "functions/resource_metadata.html" . }}
+
   {{/* Generate page description: page-specific plain text (see the partial),
        shortened on a word boundary. `truncate` HTML-escapes its input, so the
        result is decoded again and the attribute escaping encodes it once. */}}
-  {{ $full_desc := partial "functions/page_description.html" . }}
+  {{ $full_desc := $metadata.description }}
   {{ $desc := replaceRE ` …$` "…" (truncate 250 $full_desc | htmlUnescape) }}
   <meta name="description" content='{{ $desc }}'>
   {{/* Shorter description for social previews. */}}
@@ -83,7 +85,7 @@
   <link rel="alternate" hreflang="x-default" href="{{ .url }}">
     {{- end }}
   {{ else }}
-  <link rel="alternate" hreflang="{{ $page_lang }}" href="{{ .Permalink }}">
+  <link rel="alternate" hreflang="{{ $page_lang }}" href="{{ $metadata.url }}">
   {{ end }}
 
   {{ partial "functions/parse_theme" . }}
@@ -130,8 +132,11 @@
     {{ if site.Params.icon.pack.ai }}
       {{ printf "<link rel=\"stylesheet\" href=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\">" (printf $css.academicons.url $css.academicons.version) $css.academicons.sri | safeHTML }}
     {{ end }}
+    {{/* Pages off the theme use the small icon font in assets/css/doors/icons.css instead. */}}
+    {{ if partial "doors/on_theme" . }}
     {{ printf "<link rel=\"stylesheet\" href=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\">" (printf $css.fontAwesome.url $css.fontAwesome.version) $css.fontAwesome.sri | safeHTML }}
     {{ printf "<link rel=\"stylesheet\" href=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\">" (printf $css.fancybox.url $css.fancybox.version) $css.fancybox.sri | safeHTML }}
+    {{ end }}
 
     {{ if ($scr.Get "highlight_enabled") }}
       {{ $v := $css.highlight.version }}
@@ -168,6 +173,9 @@
     {{ range $k, $v := hugo.Data.assets.js }}{{/* TODO: investigate why `where ... "async" true` does not work. */}}
       {{ $load := $v.async }}
 
+      {{/* Nothing on the site marks images for lazysizes. */}}
+      {{ if eq $k "lazysizes" }}{{ $load = false }}{{ end }}
+
       {{/* Only load MathJax if required. */}}
       {{ if (eq $k "mathJax") | and (not (or $.Params.math site.Params.math)) }}
         {{ $load = false }}
@@ -205,10 +213,8 @@
   {{- if (eq (getenv "HUGO_ENV") "production") -}}
     {{- $style = $style | minify | fingerprint "md5" -}}
   {{- end -}}
-  <link rel="stylesheet" href="{{ $style.RelPermalink }}">
-
-  <link rel="preload" href="{{ "fonts/domine/domine-latin-wght-normal.woff2" | relURL }}" as="font" type="font/woff2" crossorigin>
-  <link rel="stylesheet" href="{{ "css/fonts.css" | relURL }}">
+  {{ if partial "doors/on_theme" . }}<link rel="stylesheet" href="{{ $style.RelPermalink }}">{{ end }}
+  {{ partial "doors/assets" . }}
   <script src="{{ "js/click-to-load.js" | relURL }}" defer></script>
   <script src="{{ "js/newsletter.js" | relURL }}" defer></script>
 
@@ -221,30 +227,34 @@
   <link rel="alternate" href="{{.RelPermalink}}" type="application/rss+xml" title="{{site.Title}}">
   {{ end }}
 
-  <link rel="manifest" href="{{ "index.webmanifest" | relLangURL }}">
+  <link rel="manifest" href="{{ "manifest.webmanifest" | relLangURL }}">
   <link rel="icon" type="image/png" href="{{(partial "functions/get_icon" 32).RelPermalink}}">
   <link rel="apple-touch-icon" type="image/png" href="{{(partial "functions/get_icon" 192).RelPermalink}}">
 
-  <link rel="canonical" href="{{ .Permalink }}">
+  <link rel="canonical" href="{{ $metadata.url }}">
 
   {{/* Get page image for sharing. */}}
   {{ $featured_image := (.Resources.ByType "image").GetMatch "*featured*" }}
   {{ $avatar_image := (.Resources.ByType "image").GetMatch "avatar*" }}
   {{ $has_logo := fileExists "assets/images/logo.webp" | or (fileExists "assets/images/logo.svg") }}
   {{ $og_image := "" }}
+  {{ $og_resource := false }}
   {{ $og_image_width := 0 }}
   {{ $og_image_height := 0 }}
   {{ if (and (eq .Kind "taxonomy") $avatar_image) }}
     {{ $avatar_fill := $avatar_image.Fill "270x270 Center" }}
+    {{ $og_resource = $avatar_fill }}
     {{ $og_image = $avatar_fill.Permalink }}
     {{ $og_image_width = $avatar_fill.Width }}
     {{ $og_image_height = $avatar_fill.Height }}
   {{ else if $featured_image }}
+    {{ $og_resource = $featured_image }}
     {{ $og_image = $featured_image.Permalink }}
     {{ $og_image_width = $featured_image.Width }}
     {{ $og_image_height = $featured_image.Height }}
   {{ else if and .Params.sharing_image_resource (.Resources.GetMatch .Params.sharing_image_resource) }}
     {{ $share_res := .Resources.GetMatch .Params.sharing_image_resource }}
+    {{ $og_resource = $share_res }}
     {{ $og_image = $share_res.Permalink }}
     {{ $og_image_width = $share_res.Width }}
     {{ $og_image_height = $share_res.Height }}
@@ -265,15 +275,41 @@
       {{ $og_image_height = .Height }}
     {{ end }}
   {{ else if $has_logo }}
-    {{ $og_image = (partial "functions/get_logo" (dict "constraint" "fit" "size" 300)).Permalink }}
+    {{ $og_resource = partial "functions/get_logo" (dict "constraint" "fit" "size" 300) }}
+    {{ $og_image = $og_resource.Permalink }}
   {{ else }}
-    {{ $og_image = (partial "functions/get_icon" 512).Permalink }}
+    {{ $og_resource = partial "functions/get_icon" 512 }}
+    {{ $og_image = $og_resource.Permalink }}
+  {{ end }}
+  {{/* Static images join the same pipeline without moving or copying their sources.
+       absURL/relURL keep preview prefixes on the published derivative. */}}
+  {{ if not $og_resource }}
+    {{ $static_path := "" }}
+    {{ if .Params.sharing_image }}
+      {{ $static_path = .Params.sharing_image }}
+    {{ else if .Params.header.image }}
+      {{ $static_path = printf "%s/%s" $media_dir .Params.header.image }}
+    {{ else if site.Params.sharing_image }}
+      {{ $static_path = site.Params.sharing_image }}
+    {{ end }}
+    {{ if and $static_path (not (urls.Parse $static_path).IsAbs) (not (in (slice ".png" ".jpg" ".jpeg") (path.Ext $static_path | lower))) }}
+      {{ $source := printf "static/%s" (strings.TrimPrefix "/" $static_path) }}
+      {{ if fileExists $source }}
+        {{ $og_resource = resources.FromString (printf "social/%s" (strings.TrimPrefix "/" $static_path)) (readFile $source) }}
+      {{ end }}
+    {{ end }}
+  {{ end }}
+  {{ with $og_resource }}
+    {{ $social := partialCached "functions/social_image.html" . .Key }}
+    {{ $og_image = $social.Permalink }}
+    {{ $og_image_width = $social.Width }}
+    {{ $og_image_height = $social.Height }}
   {{ end }}
   {{ $scr.Set "og_image" $og_image }}{{/* Set `og_image` globally for `rss.xml`. */}}
   {{ $og_image_alt := site.Params.sharing_image_alt | default site.Title }}
   {{ if .Params.sharing_image_alt }}{{ $og_image_alt = .Params.sharing_image_alt }}{{ end }}
   <meta property="og:site_name" content="{{ site.Title }}">
-  <meta property="og:url" content="{{ .Permalink }}">
+  <meta property="og:url" content="{{ $metadata.url }}">
   {{/* Sharing title: allow override, else append site name for context in previews. */}}
   {{ $og_title := "" }}
   {{ if .Params.sharing_title }}
@@ -283,7 +319,7 @@
   {{ else if .IsHome }}
     {{ $og_title = site.Title }}
   {{ else }}
-    {{ $og_title = printf "%s | %s" .Title (site.Params.short_title | default site.Title) }}
+    {{ $og_title = printf "%s | %s" $metadata.title (site.Params.short_title | default site.Title) }}
   {{ end }}
   <meta property="og:title" content="{{ $og_title }}">
   <meta property="og:description" content='{{ $og_desc }}'>
@@ -327,6 +363,6 @@
        page with the full site title spent 61 of those on text that was never
        displayed, so pages carry the short name and only the home page spells
        the organisation out in full. */}}
-  <title>{{ if .IsHome }}{{ site.Title }}{{ else }}{{ .Title }} | {{ site.Params.short_title | default site.Title }}{{ end }}</title>
+  <title>{{ if .IsHome }}{{ site.Title }}{{ else }}{{ $metadata.title }} | {{ site.Params.short_title | default site.Title }}{{ end }}</title>
 
 </head>
diff --git a/layouts/partials/site_js.html b/layouts/partials/site_js.html
index 9edf1835ac8..e6863dc14d2 100644
--- a/layouts/partials/site_js.html
+++ b/layouts/partials/site_js.html
@@ -1,173 +1,37 @@
-    {{ $scr := $.Scratch }}
-
-    {{/* Attempt to load local vendor JS, otherwise load from CDN. */}}
-    {{ $js := hugo.Data.assets.js }}
-    {{ if not ($scr.Get "use_cdn") }}
-      <script src="{{ printf "/js/vendor/%s" ($scr.Get "vendor_js_filename") | relURL }}"></script>
-    {{ else }}
-      {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.jQuery.url $js.jQuery.version) $js.jQuery.sri | safeHTML }}
-      {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.imagesLoaded.url $js.imagesLoaded.version) $js.imagesLoaded.sri | safeHTML }}
-      {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.isotope.url $js.isotope.version) $js.isotope.sri | safeHTML }}
-      {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.fancybox.url $js.fancybox.version) $js.fancybox.sri | safeHTML }}
-      {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.instantpage.url $js.instantpage.version) $js.instantpage.sri | safeHTML }}
-
-      {{/* Mermaid and Highlight.js load only on pages that need them; site_head.html sets
-           the "diagram_enabled" and "highlight_enabled" flags. Both are deferred: their
-           only callers sit in academic.js's `$(document).ready` handler, which runs after
-           deferred scripts have executed. */}}
-      {{ if $scr.Get "diagram_enabled" }}
-        {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\" title=\"mermaid\" defer></script>" (printf $js.mermaid.url $js.mermaid.version) $js.mermaid.sri | safeHTML }}
-      {{ end }}
-
-      {{ if $scr.Get "highlight_enabled" }}
-        {{ $v := $js.highlight.version }}
-        {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\" defer></script>" (printf $js.highlight.url $v) $js.highlight.sri | safeHTML }}
-        {{ range site.Params.highlight_languages }}
-        <script src="/vendor/assets/highlight.js/{{ $v }}/languages/{{ . }}.min.js" defer></script>
-        {{ end }}
-      {{ end }}
-
-    {{ end }}
-
-    {{/* Maps JS. */}}
-    {{ if eq site.Params.map.engine 1 }}
-      <script async defer src="https://maps.googleapis.com/maps/api/js?key={{ site.Params.map.api_key }}"></script>
-      {{ if ($scr.Get "use_cdn") }}
-      {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.gmaps.url $js.gmaps.version) $js.gmaps.sri | safeHTML }}
-      {{ end }}
-    {{ else if and (or (eq site.Params.map.engine 2) (eq site.Params.map.engine 3)) ($scr.Get "use_cdn") }}
-      {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.leaflet.url $js.leaflet.version) $js.leaflet.sri | safeHTML }}
-    {{ end }}
-
-    {{/* Initialise code highlighting. */}}
-    {{ if $scr.Get "highlight_enabled" }}
-    <script>const code_highlighting = true;</script>
-    {{ else }}
-    <script>const code_highlighting = false;</script>
-    {{ end }}
-
-    {{ if ne site.Params.search.engine 0 }}
-    {{/* Configure search engine. */}}
-    {{ $min_length := site.Params.search.academic.min_length | default 1 }}
-    {{ $threshold := site.Params.search.academic.threshold | default 0.3 }}
-    {{ $search_i18n := dict "placeholder" (i18n "search_placeholder") "results" (i18n "search_results") "no_results" (i18n "search_no_results") }}
-    {{ $search_config := dict "indexURI" ("/index.json" | relLangURL) "threshold" $threshold "minLength" $min_length }}
-    <script>
-      const search_config = {{ $search_config | jsonify | safeJS }};
-      const i18n = {{ $search_i18n | jsonify | safeJS }};
-      const content_type = {
-        'post': {{ i18n "posts" }},
-        'project': {{ i18n "projects" }},
-        'publication' : {{ i18n "publications" }},
-        'talk' : {{ i18n "talks" }},
-        'slides' : {{ i18n "slides" | default (i18n "btn_slides") }}
-        };
-    </script>
-    {{ end }}
-
-    {{/* Load hash anchors for documentation pages. */}}
-    {{ if in (slice "book" "docs") .Type }}
-    {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.anchor.url $js.anchor.version) $js.anchor.sri | safeHTML }}
-    <script>
-      anchors.add();
-    </script>
-    {{ end }}
-
-    {{ if eq site.Params.search.engine 1 }}
-    {{/* Fuse search result template. */}}
-    <script id="search-hit-fuse-template" type="text/x-template">
-      <div class="search-hit" id="summary-{{"{{key}}"}}">
-      <div class="search-hit-content">
-        <div class="search-hit-name">
-          {{ printf "<a href=\"%s\">%s</a>" "{{relpermalink}}" "{{title}}" | safeHTML }}
-          <div class="article-metadata search-hit-type">{{"{{type}}"}}</div>
-          <p class="search-hit-description">{{"{{snippet}}"}}</p>
-        </div>
-      </div>
-      </div>
-    </script>
-    {{ else if eq site.Params.search.engine 2 }}
-    {{/* Algolia search result template. */}}
-    <script id="search-hit-algolia-template" type="text/html">
-      <div class="search-hit">
-        <div class="search-hit-content">
-          <div class="search-hit-name">
-            {{ printf "<a href=\"%s\">{{{_highlightResult.title.value}}}</a>" "{{relpermalink}}" | safeHTML }}
-          </div>
-          <div class="article-metadata search-hit-type">{{"{{type}}"}}</div>
-          <p class="search-hit-description">{{ safeHTML "{{{_highlightResult.summary.value}}}" }}</p>
-        </div>
-      </div>
-    </script>
-    {{ end }}
-
-    {{/* Fuse search engine. */}}
-    {{ if and (eq site.Params.search.engine 1) ($scr.Get "use_cdn") }}
-    {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.fuse.url $js.fuse.version) $js.fuse.sri | safeHTML }}
-    {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.mark.url $js.mark.version) $js.mark.sri | safeHTML }}
-    {{ end }}
-
-    {{/* Algolia search engine. */}}
-    {{ if eq site.Params.search.engine 2 }}
-    {{ if ($scr.Get "use_cdn") }}
-    {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.instantsearch.url $js.instantsearch.version) $js.instantsearch.sri | safeHTML }}
-    {{ end }}
-    <script>
-      const algoliaConfig = {
-        appId: {{ site.Params.search.algolia.app_id }},
-        apiKey: {{ site.Params.search.algolia.api_key }},
-        indexName: {{ site.Params.search.algolia.index_name }},
-        poweredBy: {{ site.Params.search.algolia.show_logo | default false }}
-      };
-    </script>
-    {{ end }}
-
-    {{/* Netlify Identity integration. */}}
-    {{ if .IsHome | and (site.Params.cms.netlify_cms | default true) }}
-    <script>
-      if (window.netlifyIdentity) {
-        window.netlifyIdentity.on("init", user => {
-          if (!user) {
-            window.netlifyIdentity.on("login", () => {
-              document.location.href = "/admin/";
-            });
-          }
-        });
-      }
-    </script>
-    {{ end }}
-
-    {{/* Charts */}}
-    {{ if .HasShortcode "chart" }}
-    <script>
-      window.PlotlyConfig = {MathJaxConfig: 'local'};
-    </script>
-    {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.plotly.url $js.plotly.version) $js.plotly.sri | safeHTML }}
-    {{ end }}
-
-    {{/* Disqus Comment Count JS. */}}
-    {{ if and (eq site.Params.comments.engine 1) (site.Params.comments.disqus.show_count | default true) }}
-    <script id="dsq-count-scr" src="https://{{site.Params.comments.disqus.shortname}}.disqus.com/count.js" async></script>
-    {{ end }}
-
-    {{ $js_comment := printf "/* Source Themes Academic v%s | https://sourcethemes.com/academic/ */\n" hugo.Data.academic.version }}
-    {{ $js_bundle_head := $js_comment | resources.FromString "js/bundle-head.js" }}
-    {{ $js_linebreak := "\n" | resources.FromString "js/linebreak.js" }}{{/* Fix no line break after Bootstrap JS causing error. */}}
-    {{ $js_academic := resources.Get "js/academic.js" }}
-    {{ $js_academic_search := resources.Get "js/academic-search.js" }}
-    {{ $js_algolia_search := resources.Get "js/algolia-search.js" }}
-    {{ $js_bootstrap := resources.Get "js/_vendor/bootstrap.min.js" }}
-    {{ $js_bundle := slice $js_bootstrap $js_linebreak $js_academic }}
-    {{ if eq site.Params.search.engine 1 }}
-      {{ $js_bundle = $js_bundle | append $js_academic_search }}
-    {{ else if eq site.Params.search.engine 2 }}
-      {{ $js_bundle = $js_bundle | append $js_algolia_search }}
-    {{ end }}
-    {{ range site.Params.plugins_js }}
-      {{ $js_bundle = $js_bundle | append (resources.Get (printf "js/%s.js" .)) }}
-    {{ end }}
-    {{ $js_bundle := $js_bundle | resources.Concat "js/academic-bundle-pre.js" | minify }}
-    {{ $js_bundle := slice $js_bundle_head $js_bundle | resources.Concat "js/academic.min.js" | fingerprint "md5" }}
-    <script src="{{ $js_bundle.RelPermalink }}"></script>
-
-    {{ partial "custom_js" . }}
+{{/* In place of the theme's site_js. Doors pages run assets/js/doors/site.js, loaded from the head,
+     and whatever a page itself asks for. jQuery, Bootstrap's script and academic.js load only on
+     pages still on the theme (doors/on_theme). Comments on the conditional libraries are in
+     site_head.html, which decides them. */}}
+{{ $scr := $.Scratch }}
+{{ $js := hugo.Data.assets.js }}
+{{ $themed := partial "doors/on_theme" . }}
+{{ if $themed }}
+  {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.jQuery.url $js.jQuery.version) $js.jQuery.sri | safeHTML }}
+  {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.imagesLoaded.url $js.imagesLoaded.version) $js.imagesLoaded.sri | safeHTML }}
+  {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.isotope.url $js.isotope.version) $js.isotope.sri | safeHTML }}
+  {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.fancybox.url $js.fancybox.version) $js.fancybox.sri | safeHTML }}
+{{ end }}
+{{ if $scr.Get "diagram_enabled" }}
+  {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\" title=\"mermaid\" defer></script>" (printf $js.mermaid.url $js.mermaid.version) $js.mermaid.sri | safeHTML }}
+{{ end }}
+{{ if $scr.Get "highlight_enabled" }}
+  {{ $v := $js.highlight.version }}
+  {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\" defer></script>" (printf $js.highlight.url $v) $js.highlight.sri | safeHTML }}
+  {{ range site.Params.highlight_languages }}
+  <script src="/vendor/assets/highlight.js/{{ $v }}/languages/{{ . }}.min.js" defer></script>
+  {{ end }}
+{{ end }}
+{{ if or (.HasShortcode "ga_map") (.HasShortcode "ga_map_yearly") (.Params.needs_map | default false) }}
+  {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.leaflet.url $js.leaflet.version) $js.leaflet.sri | safeHTML }}
+{{ end }}
+{{ if $themed }}
+  <script>const code_highlighting = false;</script>
+  {{ $bundle := slice (resources.Get "js/_vendor/bootstrap.min.js") ("\n" | resources.FromString "js/linebreak.js") (resources.Get "js/academic.js") | resources.Concat "js/academic-bundle-pre.js" | minify | fingerprint "md5" }}
+  <script src="{{ $bundle.RelPermalink }}"></script>
+{{ end }}
+{{/* Heading links on the summaries. */}}
+{{ if in (slice "book" "docs") .Type }}
+  {{ printf "<script src=\"%s\" integrity=\"%s\" crossorigin=\"anonymous\"></script>" (printf $js.anchor.url $js.anchor.version) $js.anchor.sri | safeHTML }}
+  <script>anchors.add('.article-style > h2, .article-style > h3');</script>
+{{ end }}
+{{ partial "custom_js" . }}
diff --git a/layouts/partials/social_links.html b/layouts/partials/social_links.html
index faa138caa59..09eba7247ad 100644
--- a/layouts/partials/social_links.html
+++ b/layouts/partials/social_links.html
@@ -9,12 +9,17 @@
     {{ $scheme := (urls.Parse $link).Scheme }}
     {{ $target := "" }}
     {{ if not $scheme }}
-      {{ $link = .link | relLangURL }}
+      {{/* A website written with no https:// would resolve against this site. */}}
+      {{ if findRE `^[\w-]+(\.[\w-]+)+(/|$)` .link }}{{ $link = printf "https://%s" .link }}{{ $target = `target="_blank" rel="noopener"` }}{{ else }}{{ $link = .link | relLangURL }}{{ end }}
     {{ else if in (slice "http" "https") $scheme }}
       {{ $target = "target=\"_blank\" rel=\"noopener\"" }}
     {{ end }}
     <li>
-      <a href="{{ $link | safeURL }}" {{ $target | safeHTMLAttr }}>
+      {{/* The icon alone says nothing to a screen reader, so the link is named. */}}
+      {{ $name := index (dict "envelope" "Email" "github" "GitHub" "osf" "OSF" "orcid" "ORCID" "google-scholar" "Google Scholar" "linkedin" "LinkedIn" "researchgate" "ResearchGate" "youtube" "YouTube") .icon | default (.icon | humanize | title) }}
+      {{/* Two links with one icon need telling apart, by the end of their address. */}}
+      {{ if gt (len (where $.Params.social "icon" .icon)) 1 }}{{ $name = printf "%s (%s)" $name (path.Base (strings.TrimSuffix "/" .link)) }}{{ end }}
+      <a href="{{ $link | safeURL }}" aria-label="{{ $.Title }}: {{ $name }}" {{ $target | safeHTMLAttr }}>
         <i class="{{ $pack }} {{ $pack_prefix }}-{{ .icon }}" aria-hidden="true"></i>
       </a>
     </li>
diff --git a/layouts/partials/structured-data/breadcrumbs.html b/layouts/partials/structured-data/breadcrumbs.html
index 200229246ab..5957538aae2 100644
--- a/layouts/partials/structured-data/breadcrumbs.html
+++ b/layouts/partials/structured-data/breadcrumbs.html
@@ -14,6 +14,9 @@
      `/glossary/` section stub, which only exists as a redirect to
      `/glossary/english/`) have no permalink and are left out: an entry
      without a URL is invalid, and its title would repeat the next level's.
+     An unrendered section can keep its step by naming its address in a
+     `breadcrumb_url` param (relative to the base URL), as /about/ does: that
+     address serves a redirect to the section's landing page.
 
      The skips are one wrapping conditional rather than early `return`s: a Hugo
      partial either returns a value or writes output, and mixing the two makes
@@ -30,17 +33,20 @@
 }}
 
 {{ if not $skip }}
+  {{ $metadata := partial "functions/resource_metadata.html" . }}
   {{ $trail := slice }}
 
   {{ range .Ancestors.Reverse }}
     {{ $ancestor := . }}
     {{ $name := cond .IsHome (site.Params.short_title | default site.Title) (.LinkTitle | default .Title) }}
-    {{ if and $name $ancestor.Permalink }}
+    {{ $item := $ancestor.Permalink }}
+    {{ if not $item }}{{ with $ancestor.Params.breadcrumb_url }}{{ $item = . | absURL }}{{ end }}{{ end }}
+    {{ if and $name $item }}
       {{ $trail = $trail | append (dict
         "@type" "ListItem"
         "position" (add (len $trail) 1)
         "name" $name
-        "item" $ancestor.Permalink
+        "item" $item
       ) }}
     {{ end }}
   {{ end }}
@@ -49,8 +55,8 @@
     {{ $trail = $trail | append (dict
       "@type" "ListItem"
       "position" (add (len $trail) 1)
-      "name" .
-      "item" $.Permalink
+      "name" $metadata.breadcrumb_title
+      "item" $metadata.url
     ) }}
   {{ end }}
 
diff --git a/layouts/partials/structured-data/glossary-term.html b/layouts/partials/structured-data/glossary-term.html
index 69098748aa2..393c3d0c731 100644
--- a/layouts/partials/structured-data/glossary-term.html
+++ b/layouts/partials/structured-data/glossary-term.html
@@ -18,7 +18,7 @@
   {{- $term := dict
       "@context" "https://schema.org"
       "@type" "DefinedTerm"
-      "name" .Title
+      "name" (partial "functions/plain_title.html" (dict "page" . "text" .Title))
       "description" $desc
       "url" .Permalink
       "inLanguage" $lang
diff --git a/layouts/partials/tags.html b/layouts/partials/tags.html
index 28abdaf4cb5..17249e7a279 100644
--- a/layouts/partials/tags.html
+++ b/layouts/partials/tags.html
@@ -4,7 +4,14 @@
      `/tags/?tag=`, which lists every page carrying the term. Reached by every
      section via `_default/single.html` -> `page_footer`. */}}
 
-{{ with partial "functions/page_tags.html" . }}
+{{/* Only tags on at least `min` pages (functions/tag_counts.html): a one-off tag leads to a list of one. */}}
+{{ $tc := partialCached "functions/tag_counts.html" . }}
+{{ $shown := slice }}
+{{ range partial "functions/page_tags.html" . }}
+  {{ $n := int (index $tc.counts (lower .) | default 0) }}
+  {{ if and (ge $n $tc.min) (le $n $tc.max) }}{{ $shown = $shown | append . }}{{ end }}
+{{ end }}
+{{ with $shown }}
 <div class="article-tags">
   {{ range . }}
   <a class="badge badge-light" href="{{ printf "tags/?tag=%s" (. | urlquery) | relURL }}">{{ . }}</a>
diff --git a/layouts/partials/widget_page.html b/layouts/partials/widget_page.html
new file mode 100644
index 00000000000..5750f41bf00
--- /dev/null
+++ b/layouts/partials/widget_page.html
@@ -0,0 +1,74 @@
+{{/* The generic section page: a page built from Markdown sections, on the same reading layout as an
+     article (see _default/single.html). The first section's title is the page's h1, and the side
+     card lists what follows when there is more than one thing to jump to. The theme's per-section
+     columns and backgrounds no longer apply, except that a section that had a colour stays set off. */}}
+{{ $page := . }}
+{{ $sections := where (.Resources.ByType "page") ".Params.active" "!=" false }}
+{{ $sections = where $sections ".Params.widget" "!=" "hero_welcome" }}
+{{ $first := index $sections 0 }}
+{{ $h1 := .Title }}
+{{ $lede := "" }}
+{{ with $first }}
+  {{ with .Title }}{{ $h1 = . }}{{ end }}
+  {{ with .Params.subtitle }}{{ $lede = . }}{{ end }}
+{{ end }}
+{{ $h1 = replaceRE `(?i)<br\s*/?>` " " $h1 | strings.TrimSpace }}
+
+{{/* Contents: later section titles and the second-level headings inside every section. */}}
+{{ $toc := slice }}
+{{ $rendered := slice }}
+{{ $hasCallouts := false }}
+{{ range $index, $st := $sections }}
+  {{ $hash_id := replace $st.File.ContentBaseName "index" (path.Base (path.Split $page.Path).Dir) }}
+  {{ $widget := or $st.Params.widget "blank" }}
+  {{ if eq $widget "custom" }}{{ $widget = "blank" }}{{ end }}
+  {{ $body := partial (printf "widgets/%s.html" $widget) (dict "root" $page "page" $st) }}
+  {{ $body = partial "doors/content" $body }}
+  {{ if strings.Contains $body `<aside class="callout` }}{{ $hasCallouts = true }}{{ end }}
+  {{ $title := replaceRE `(?i)<br\s*/?>` " " $st.Title | strings.TrimSpace }}
+  {{ if and $title (gt $index 0) }}{{ $toc = $toc | append (dict "id" $hash_id "title" $title) }}{{ end }}
+  {{ range findRESubmatch `<h2[^>]*\bid="?([^"> ]+)"?[^>]*>([\s\S]*?)</h2>` $body }}
+    {{ $text := index . 2 | plainify | strings.TrimSpace }}
+    {{ if $text }}{{ $toc = $toc | append (dict "id" (index . 1) "title" $text) }}{{ end }}
+  {{ end }}
+  {{ $tinted := false }}
+  {{ with $st.Params.design.background.color }}{{ if not (in (slice "#fefdf6" "#FEFDF6") .) }}{{ $tinted = true }}{{ end }}{{ end }}
+  {{ $rendered = $rendered | append (dict "id" $hash_id "title" (cond (gt $index 0) $title "") "subtitle" (cond (gt $index 0) ($st.Params.subtitle | default "") "") "body" $body "widget" $widget "tinted" $tinted) }}
+{{ end }}
+{{ $wide := in site.Params.doors.wide_pages .Path }}
+{{ $hasCard := and (not $wide) (gt (len $toc) 1) }}
+{{ $hasCallouts = and $hasCallouts (not $wide) }}
+{{ $card := "" }}
+{{ if $hasCard }}{{ $card = partial "doors/toc_card" $toc }}{{ end }}
+
+<div class="wrap">
+  <div class="article-layout{{ if $hasCallouts }} article-layout-callouts{{ else if not $hasCard }} article-layout-single{{ end }}{{ if $wide }} article-layout-wide{{ end }}">
+    {{ with .Params.hero_image }}
+      {{ $head := partial "doors/page_head" (dict "page" $page "h1" $h1 "lede" $lede) }}
+      {{ partial "doors/page_hero" (dict "page" $page "head" $head) }}
+    {{ end }}
+    {{/* First in the page, so keyboard order follows the layout: contents, then text. */}}
+    {{ $card }}
+    <article class="reading">
+      {{ if not .Params.hero_image }}
+      {{ partial "doors/page_head" (dict "page" . "h1" $h1 "lede" $lede) }}
+      {{ partial "doors/page_actions" . }}
+      {{ end }}
+      {{/* On phones the side card falls below the text, too late to help on a long page. */}}
+      {{ if $hasCard }}
+      {{ $items := "" }}{{ range $toc }}{{ $items = printf `%s<li><a href="#%s">%s</a></li>` $items (.id | htmlEscape) (.title | markdownify | emojify | plainify | htmlUnescape | htmlEscape) }}{{ end }}
+      {{ $nav := printf `<nav aria-label="On this page"><ul>%s</ul></nav>` $items }}
+      {{ partial "doors/toc_phone" $nav }}
+      {{ end }}
+      <div class="article-style">
+        {{ range $rendered }}
+        <section id="{{ .id }}" class="doc-section wg-{{ .widget }}{{ if .tinted }} doc-section-tinted{{ end }}">
+          {{ with .title }}<h2>{{ . | markdownify | emojify }}</h2>{{ end }}
+          {{ with .subtitle }}<p class="section-lede">{{ . | markdownify | emojify }}</p>{{ end }}
+          {{ .body }}
+        </section>
+        {{ end }}
+      </div>
+    </article>
+  </div>
+</div>
diff --git a/layouts/partials/widgets/about_welcome.html b/layouts/partials/widgets/about_welcome.html
deleted file mode 100644
index a0d013fe383..00000000000
--- a/layouts/partials/widgets/about_welcome.html
+++ /dev/null
@@ -1,119 +0,0 @@
-{{ $ := .root }}
-{{ $page := .page }}
-
-{{ $author := "" }}
-{{ if .author }}
-  {{ $author = .author }}
-{{ else }}
-  {{ $author = $page.Params.author }}
-{{end}}
-
-{{ $person_page_path := (printf "/authors/%s" (anchorize $author)) }}
-{{ $person_page := site.GetPage $person_page_path }}
-{{ if not $person_page }}
-  {{ errorf "Could not find an author page at `%s`. Please check the value of `author` in your About widget and create an associated author page if one does not already exist. See https://sourcethemes.com/academic/docs/page-builder/#about " $person_page_path }}
-{{end}}
-{{ $person := $person_page.Params }}
-{{ $avatar := ($person_page.Resources.ByType "image").GetMatch "*avatar*" }}
-{{ $avatar_shape := site.Params.avatar.shape | default "circle" }}
-
-<!-- About widget -->
-<div class="row">
-  <div class="col-12 col-lg-4">
-    <div id="profile">
-      {{ if eq $person.display_name true }} <div class="portrait-title">
-        <h2>{{ $person.name }}</h2>
-        {{ with $person.role }}<h3>{{ . | markdownify | emojify }}</h3>{{ end }}
-
-        {{ range $person.organizations }}
-        <h3>
-          {{ with .url }}<a href="{{ . }}" target="_blank" rel="noopener">{{ end }}
-          <span>{{ .name }}</span>
-          {{ if .url }}</a>{{ end }}
-        </h3>
-        {{ end }}
-      </div>
-      {{end}}
-
-      {{ if site.Params.avatar.gravatar }}
-      <img class="avatar {{if eq $avatar_shape "square"}}avatar-square{{else}}avatar-circle{{end}}" src="https://s.gravatar.com/avatar/{{ md5 $person.email }}?s=270')" alt="Avatar of {{ $person.name }}">
-      {{ else if $avatar }}
-      {{ $avatar_image := $avatar.Fill "270x270 Center" }}
-      <img class="avatar {{if eq $avatar_shape "square"}}avatar-square{{else}}avatar-circle{{end}}" src="{{ $avatar_image.RelPermalink }}" width="270" height="270" alt="Avatar of {{ $person.name }}">
-      {{ end }}
-
-
-      {{/* Each video_id needs a thumbnail in static/img/video-thumbnails/. */}}
-      {{ with $page.Params.video_id }}
-      <a class="yt-lightbox profile-video" data-fancybox href="https://www.youtube.com/watch?v={{ . }}" aria-label="Play video">
-        <img loading="lazy" src="{{ printf "img/video-thumbnails/%s.webp" . | relURL }}" width="480" height="360" alt="Play introduction video">
-        <span class="yt-play" aria-hidden="true"><i class="fas fa-play"></i></span>
-      </a>
-      <p class="small">Playing this video loads it from YouTube (Google). See our <a href="{{ "privacy/" | relURL }}#embedded-content">privacy policy</a>.</p>
-      {{ end }}
-
-      <ul class="network-icon" aria-hidden="true">
-        {{ range $person.social }}
-        {{ $pack := or .icon_pack "fas" }}
-        {{ $pack_prefix := $pack }}
-        {{ if in (slice "fab" "fas" "far" "fal") $pack }}
-          {{ $pack_prefix = "fa" }}
-        {{ end }}
-        {{ $link := .link }}
-        {{ $scheme := (urls.Parse $link).Scheme }}
-        {{ $target := "" }}
-        {{ if not $scheme }}
-          {{ $link = .link | relLangURL }}
-        {{ else if in (slice "http" "https") $scheme }}
-          {{ $target = "target=\"_blank\" rel=\"noopener\"" }}
-        {{ end }}
-        <li>
-          <a href="{{ $link | safeURL }}" {{ $target | safeHTMLAttr }}>
-            <i class="{{ $pack }} {{ $pack_prefix }}-{{ .icon }} big-icon"></i>
-          </a>
-        </li>
-        {{ end }}
-      </ul>
-
-    </div>
-  </div>
-  <div class="col-12 col-lg-8">
-
-    {{/* Only display widget title in explicit instances of about widget, not in author pages. */}}
-    {{ if and $page.Params.widget $page.Title }}<h2>{{ $page.Title | markdownify | emojify }}</h2>{{ end }}
-
-    {{ $person_page.Content }}
-
-    <div class="row">
-
-      {{ with $person.interests }}
-      <div class="col-md-5">
-        <h3>{{ i18n "interests" | markdownify }}</h3>
-        <ul class="ul-interests">
-          {{ range . }}
-          <li>{{ . | markdownify | emojify }}</li>
-          {{ end }}
-        </ul>
-      </div>
-      {{ end }}
-
-      {{ with $person.education }}
-      <div class="col-md-7">
-        <h3>{{ i18n "education" | markdownify }}</h3>
-        <ul class="ul-edu fa-ul">
-          {{ range .courses }}
-          <li>
-            <i class="fa-li fas fa-graduation-cap"></i>
-            <div class="description">
-              <p class="course">{{ .course }}{{ with .year }}, {{ . }}{{ end }}</p>
-              <p class="institution">{{ .institution }}</p>
-            </div>
-          </li>
-          {{ end }}
-        </ul>
-      </div>
-      {{ end }}
-
-    </div>
-  </div>
-</div>
diff --git a/layouts/partials/widgets/announcements.html b/layouts/partials/widgets/announcements.html
deleted file mode 100644
index 7370ce6ff06..00000000000
--- a/layouts/partials/widgets/announcements.html
+++ /dev/null
@@ -1,20 +0,0 @@
-{{/* Announcements widget — recent posts as a card grid. */}}
-{{ $ := .root }}
-{{ $page := .page }}
-{{ $count := $page.Params.count | default 3 }}
-{{ $posts := first $count (sort (where site.RegularPages "Type" "post") "Date" "desc") }}
-
-<div class="row justify-content-center">
-  <div class="col-12 section-heading text-center">
-    {{ with $page.Title }}<h2>{{ . | markdownify | emojify }}</h2>{{ end }}
-    {{ with $page.Params.subtitle }}<p>{{ . | markdownify | emojify }}</p>{{ end }}
-  </div>
-</div>
-
-<div class="announcements-grid">
-  {{ range $posts }}{{ partial "announcement_card.html" . }}{{ end }}
-</div>
-
-<div class="announcements-all">
-  <a class="btn btn-outline-primary" href="{{ (site.GetPage "/post").RelPermalink }}">See all announcements</a>
-</div>
diff --git a/layouts/partials/widgets/blank.html b/layouts/partials/widgets/blank.html
index 5333faad385..69834b3c539 100644
--- a/layouts/partials/widgets/blank.html
+++ b/layouts/partials/widgets/blank.html
@@ -1,32 +1 @@
-{{ $st := .page }}
-{{ $columns := $st.Params.design.columns | default "2" }}
-
-<div class="row">
-  {{ if ne $columns "1" }}
-    <div class="col-12 col-lg-4 section-heading">
-      {{ with $st.Title }}<h2 {{ with $st.Params.classtitle }} class="{{.}}"{{end}}>{{ . | markdownify | emojify }}</h2>{{ end }}
-      {{ with $st.Params.subtitle }}<p {{ with $st.Params.classtitle }} class="{{.}}"{{end}}>{{ . | markdownify | emojify }}</p>{{ end }}
-    </div>
-    <div class="col-12 col-lg-8">
-      {{ $st.Content }}
-    </div>
-  {{ else }}
-    <div class="col-lg-12 text-center">
-      {{/* One-column sections centre the title instead of putting it in the
-           `.section-heading` column, so `.section-heading h2` cannot restore the
-           size lost when this heading was demoted from h1 to h2. The class gives
-           that rule a hook here without pulling in `.section-heading p`, which
-           would also restyle the subtitle. */}}
-      {{ with $st.Title }}<h2 class="widget-title{{ with $st.Params.classtitle }} {{ . }}{{ end }}">{{ . | markdownify | emojify }}</h2>{{ end }}
-      {{ with $st.Params.subtitle }}<p {{ with $st.Params.classtitle }} class="{{.}}"{{end}}>{{ . | markdownify | emojify }}</p>{{ end }}
-    </div>
-    </div>
-    <div class="row">
-      <div class="col-lg-12">
-
-         {{ $st.Content }}
-
-      </div>
-    </div>
-  {{ end }}
-</div>
+{{ .page.Content }}
diff --git a/layouts/partials/widgets/featurette_alternative.html b/layouts/partials/widgets/featurette_alternative.html
deleted file mode 100644
index 7e0b9683468..00000000000
--- a/layouts/partials/widgets/featurette_alternative.html
+++ /dev/null
@@ -1,46 +0,0 @@
-{{ $ := .root }}
-{{ $page := .page }}
-
-<div class="row featurette">
-  {{ with $page.Title }}
-  <div class="col-md-12 section-heading">
-    <h2>{{ . | markdownify | emojify }}</h2>
-    {{ if $page.Params.subtitle }}<p>{{ $page.Params.subtitle | markdownify | emojify }}</p>{{ end }}
-  </div>
-  {{ end }}
-  {{ with $page.Content }}
-  <div class="col-md-12">
-    {{ . }}
-  </div>
-  {{ end }}
-</div>
-{{ range $page.Params.featurealt }}
-  {{ $pack := or .icon_pack "fas" }}
-  {{ $pack_prefix := $pack }}
-  {{ if in (slice "fab" "fas" "far" "fal") $pack }}
-    {{ $pack_prefix = "fa" }}
-  {{ end }}
-<div class="row py-3">
-  {{ if eq .imgside "left" }}
-      <div class="col-sm-4 align-self-center">
-      {{ if .buttonurl }}<a href="{{ .buttonurl }}">{{end}}{{ $dims := partial "functions/static_img_dims" .img }}<img class="rounded mx-auto d-block mt-4 mb-4 w-50" src="{{ (printf "img/%s" .img) | absURL }}" {{ $dims }} alt="{{ .imgalttext }}"> {{if .buttonurl}} </a> {{end}}
-      </div>
-        <div class="col-sm-8 align-self-center">
-        <h3>{{ .name | markdownify | emojify }}</h3>
-        {{ with .description }}<p>{{ . | markdownify | emojify }}</p>{{ end }}
-        {{ with .buttonurl }}<a href="{{ . }}" class="btn btn-menu btn-outline-primary">{{end}}{{ with .buttondescr }}{{ . | markdownify | emojify }}{{end}} {{if .buttonurl}}<i class="fa fa-angle-right" alt="right arrow" aria-hidden="true"></i></a>{{end}}
-      </div>
-  {{ end }}
-  {{ if eq .imgside "right" }}
-      <div class="col-sm-8 align-self-center">
-        <h3>{{ .name | markdownify | emojify }}</h3>
-        {{ with .description }}<p>{{ . | markdownify | emojify }}</p>{{ end }}
-        {{ with .buttonurl }}<a href="{{ . }}" class="btn btn-menu btn-outline-primary">{{end}}{{ with .buttondescr }}{{ . | markdownify | emojify }}{{end}} {{ if .buttonurl }}<i class="fa fa-angle-right" aria-hidden="true"></i></a> {{ end }}
-      </div>
-      <div class="col-sm-4 align-self-center">
-      {{ if .buttonurl }}<a href="{{ .buttonurl }}">{{end}}{{ $dims := partial "functions/static_img_dims" .img }}<img class="rounded mx-auto d-block mt-4 mb-4 w-50" src="{{ (printf "img/%s" .img) | absURL }}" {{ $dims }} alt="{{ .imgalttext }}"> {{if .buttonurl}} </a> {{end}}
-      </div>
-{{ end }}
-</div>  
-{{ end }}
-  
\ No newline at end of file
diff --git a/layouts/partials/widgets/featurette_team.html b/layouts/partials/widgets/featurette_team.html
index f67423ee327..ff40ac44300 100644
--- a/layouts/partials/widgets/featurette_team.html
+++ b/layouts/partials/widgets/featurette_team.html
@@ -1,47 +1,15 @@
-{{ $ := .root }}
+{{/* Teams: a short intro, then one row per team with its picture, description and link. */}}
 {{ $page := .page }}
-
-<div class="row featurette">
-  {{ with $page.Title }}
-  <div class="col-md-12 section-heading">
-    <h2>{{ . | markdownify | emojify }}</h2>
-    {{ if $page.Params.subtitle }}<p>{{ $page.Params.subtitle | markdownify | emojify }}</p>{{ end }}
-  </div>
-  {{ end }}
-  {{ with $page.Content }}
-  <div class="col-md-12">
-    {{ . }}
-  </div>
-  {{ end }}
-</div>
-{{ range $page.Params.featurealt }}
-  {{ $pack := or .icon_pack "fas" }}
-  {{ $pack_prefix := $pack }}
-  {{ if in (slice "fab" "fas" "far" "fal") $pack }}
-    {{ $pack_prefix = "fa" }}
-  {{ end }}
-<div class="row py-3">
-  {{ if eq .imgside "left" }}
-      <div class="col-sm-4 align-self-center">
-      {{ $dims := partial "functions/static_img_dims" .img }}{{ if .buttonurl }}<a href="{{ .buttonurl }}">{{end}}<img class="rounded-circle mx-auto d-block my-4 w-50 p-3" {{with .color}}style="background: {{.}}"{{end}} src="{{ (printf "img/%s" .img) | absURL }}" {{ $dims }} alt="{{ .imgalttext }}"> {{if .buttonurl}} </a> {{end}}
-      </div>
-        <div class="col-sm-8 align-self-center">
-        <h3>{{ .name | markdownify | emojify }}</h3>
-        {{ with .description }}<p>{{ . | markdownify | emojify }}</p>{{ end }}
-        {{ with .buttonurl }}<a href="{{ . }}" class="btn btn-menu btn-outline-primary">{{end}}{{ with .buttondescr }}{{ . | markdownify | emojify }}{{end}} {{if .buttonurl}}<i class="fa fa-angle-right" alt="right arrow" aria-hidden="true"></i></a>{{end}}
-      </div>
-  {{ end }}
-  {{ if eq .imgside "right" }}
-      <div class="col-sm-8 align-self-center">
-        <h3>{{ .name | markdownify | emojify }}</h3>
-        {{ with .description }}<p>{{ . | markdownify | emojify }}</p>{{ end }}
-        {{ with .buttonurl }}<a href="{{ . }}" class="btn btn-menu btn-outline-primary">{{end}}{{ with .buttondescr }}{{ . | markdownify | emojify }}{{end}} {{ if .buttonurl }}<i class="fa fa-angle-right" aria-hidden="true"></i></a> {{ end }}
-      </div>
-      <div class="col-sm-4 align-self-center">
-      {{ if .buttonurl }}<a href="{{ .buttonurl }}">{{end}}
-        {{ $dims := partial "functions/static_img_dims" .img }}<img class="rounded-circle mx-auto d-block my-4 w-50 p-3" {{with .color}}style="background: {{.}}"{{end}} src="{{ (printf "img/%s" .img) | absURL }}" {{ $dims }} alt="{{ .imgalttext }}"> {{if .buttonurl}} </a> {{end}}
-      </div>
-{{ end }}
-</div>  
-{{ end }}
-  
\ No newline at end of file
+{{ $page.Content }}
+<ul class="feature-rows">
+  {{ range $page.Params.featurealt }}
+  <li>
+    {{ if .img }}{{ $dims := partial "functions/static_img_dims" .img }}<img src="{{ (printf "img/%s" .img) | relURL }}" {{ $dims }} alt="{{ .imgalttext }}">{{ end }}
+    <div>
+      <h3>{{ .name | markdownify | emojify }}</h3>
+      {{ with .description }}<p>{{ . | markdownify | emojify }}</p>{{ end }}
+      {{ with .buttonurl }}<a href="{{ . }}" class="btn btn-outline-primary btn-sm">{{ end }}{{ with .buttondescr }}{{ . | markdownify | emojify }}{{ end }}{{ if .buttonurl }}</a>{{ end }}
+    </div>
+  </li>
+  {{ end }}
+</ul>
diff --git a/layouts/partials/widgets/featurette_welcome.html b/layouts/partials/widgets/featurette_welcome.html
index d250e488323..eedcfd43778 100644
--- a/layouts/partials/widgets/featurette_welcome.html
+++ b/layouts/partials/widgets/featurette_welcome.html
@@ -1,75 +1,26 @@
-{{ $ := .root }}
+{{/* A few short items with an icon or picture, and links. */}}
 {{ $page := .page }}
-
-<div class="row featurette justify-content-around">
-  {{ with $page.Title }}
-  <div class="col-md-12 section-heading">
-    <h2>{{ . | markdownify | emojify }}</h2>
-    {{ if $page.Params.subtitle }}<p>{{ $page.Params.subtitle | markdownify | emojify }}</p>{{ end }}
-  </div>
-  {{ end }}
-
+<ul class="feature-rows feature-rows-small">
   {{ range $page.Params.feature }}
   {{ $pack := or .icon_pack "fas" }}
-  {{ $pack_prefix := $pack }}
-  {{ if in (slice "fab" "fas" "far" "fal") $pack }}
-    {{ $pack_prefix = "fa" }}
-  {{ end }}
-  <div class="col-12 col-sm-4">
-    {{ if .icon }}<div class="featurette-icon"><i class="{{ $pack }} {{ $pack_prefix }}-{{ .icon }}" alt="{{ .iconalttext }}"></i></div>{{ end }}
-    {{ if .img }}<div class="pb-2">{{ $dims := partial "functions/static_img_dims" .img }}<img src="{{ (printf "img/%s" .img) | absURL }}" {{ $dims }} class="mx-auto w-25" alt="{{ .imgalttext }}"></div>{{ end }}
-    <h3>{{ .name | markdownify | emojify }}</h3>
-    {{ with .description }}<p>{{ . | markdownify | emojify }}</p>{{ end }}
-  </div>
+  {{ $prefix := $pack }}
+  {{ if in (slice "fab" "fas" "far" "fal") $pack }}{{ $prefix = "fa" }}{{ end }}
+  <li>
+    {{ if .icon }}<i class="{{ $pack }} {{ $prefix }}-{{ .icon }} feature-icon" aria-hidden="true"></i>{{ end }}
+    {{ if .img }}{{ $dims := partial "functions/static_img_dims" .img }}<img src="{{ (printf "img/%s" .img) | relURL }}" {{ $dims }} alt="{{ .imgalttext }}">{{ end }}
+    <div>
+      <h3>{{ .name | markdownify | emojify }}</h3>
+      {{ with .description }}<p>{{ . | markdownify | emojify }}</p>{{ end }}
+    </div>
+  </li>
   {{ end }}
-
-
-    {{/* Call-to-action link */}}
-    {{ if $page.Params.cta.url }}
-      {{ $pack := or $page.Params.cta.icon_pack "fas" }}
-      {{ $pack_prefix := $pack }}
-      {{ if in (slice "fab" "fas" "far" "fal") $pack }}
-        {{ $pack_prefix = "fa" }}
-      {{ end }}
-      {{ $link := $page.Params.cta.url }}
-      {{ $scheme := (urls.Parse $link).Scheme }}
-      {{ $target := "" }}
-      {{ if not $scheme }}
-        {{ $link = $link | relLangURL }}
-      {{ else if in (slice "http" "https") $scheme }}
-        {{ $target = "target=\"_blank\" rel=\"noopener\"" }}
-      {{ end }}
-   <div class="col-12 col-sm-8">  
-    <p class="cta-btns mx-auto pt-3">
-      <a href="{{ $link | safeURL }}" {{ $target | safeHTMLAttr }} class="btn btn-primary btn-lg">{{ if $page.Params.cta.icon }}<i class="{{ $pack }} {{ $pack_prefix }}-{{ $page.Params.cta.icon }} pr-1" aria-hidden="true"></i>{{end}}{{ $page.Params.cta.label | markdownify | emojify | safeHTML }}</a>
-
-      {{/* Alternative Call-to-action link */}}
-      {{ if $page.Params.cta_alt.url }}
-        {{ $link := $page.Params.cta_alt.url }}
-        {{ $scheme := (urls.Parse $link).Scheme }}
-        {{ $target := "" }}
-        {{ if not $scheme }}
-          {{ $link = $link | relLangURL }}
-        {{ else if in (slice "http" "https") $scheme }}
-          {{ $target = "target=\"_blank\" rel=\"noopener\"" }}
-        {{ end }}
-      <a href="{{ $link | safeURL }}" {{ $target | safeHTMLAttr }} class="hero-cta-alt pl-4">{{ $page.Params.cta_alt.label | markdownify | emojify | safeHTML }} <i class="fas fa-angle-right" aria-hidden="true"></i></a>
-      {{ end }}
-    </p>
-    {{ end }}
- </div>
-    {{/* Call-to-action note */}}
-    {{ with $page.Params.cta_note }}
-    <p class="hero-note text-muted mb-0">
-      {{ .label | markdownify | emojify | safeHTML }}
-    </p>
-    {{ end }}
-</div>
-<div class="row">
-  {{ with $page.Content }}
-  <div class="col-md-12">
-    {{ . }}
-  </div>
+</ul>
+<p class="feature-links">
+  {{ range slice "cta" "cta_alt" }}
+    {{ with index $page.Params . }}{{ if .url }}
+      {{ $link := .url }}{{ if not (urls.Parse .url).Scheme }}{{ $link = .url | relLangURL }}{{ end }}
+      <a href="{{ $link | safeURL }}" class="btn btn-outline-primary">{{ .label | markdownify | emojify }}</a>
+    {{ end }}{{ end }}
   {{ end }}
-
-</div>
+</p>
+{{ with $page.Content }}{{ . }}{{ end }}
diff --git a/layouts/partials/widgets/hero_quotes.html b/layouts/partials/widgets/hero_quotes.html
deleted file mode 100644
index 2f1be0814c2..00000000000
--- a/layouts/partials/widgets/hero_quotes.html
+++ /dev/null
@@ -1,63 +0,0 @@
-{{/* Rotating-quote hero. Cycles through $page.Params.quote with fade + dots. */}}
-{{ $ := .root }}
-{{ $page := .page }}
-{{ $quotes := $page.Params.quote }}
-
-<div class="hero-quotes">
-  {{ with $page.Params.eyebrow }}<p class="hq-eyebrow">{{ . | markdownify | emojify }}</p>{{ end }}
-
-  <div class="hq-stage">
-    {{ range $i, $q := $quotes }}
-      <blockquote class="hq-quote{{ if eq $i 0 }} is-active{{ end }}">{{ $q.text | safeHTML }}</blockquote>
-    {{ end }}
-  </div>
-
-  <div class="hq-actions">
-    {{ with $page.Params.primary_cta }}
-      <a class="btn btn-primary btn-lg" href="{{ .url | relLangURL }}">{{ .label }}</a>
-    {{ end }}
-    {{ with $page.Params.secondary_cta }}
-      <a class="btn btn-outline-primary btn-lg" href="{{ .url | relLangURL }}">{{ .label }}</a>
-    {{ end }}
-  </div>
-
-  {{ if gt (len $quotes) 1 }}
-  <div class="hq-dots" role="tablist" aria-label="Cycle key statements">
-    {{ range $i, $q := $quotes }}
-      <button class="hq-dot{{ if eq $i 0 }} on{{ end }}" data-i="{{ $i }}" aria-label="Statement {{ add $i 1 }}"></button>
-    {{ end }}
-  </div>
-  {{ end }}
-</div>
-
-<script>
-(function () {
-  var root = document.querySelector('.hero-quotes');
-  if (!root) return;
-  var quotes = root.querySelectorAll('.hq-quote');
-  var dots = root.querySelectorAll('.hq-dot');
-  if (quotes.length < 2) return;
-  var i = 0, timer = null;
-  var reduce = window.matchMedia('(prefers-reduced-motion: reduce)').matches;
-  function show(n) {
-    var prev = i;
-    var leaving = quotes[prev];
-    leaving.classList.remove('is-active');
-    leaving.classList.add('is-leaving');
-    // Reset the leaving quote once it has slid out, so it's ready below again.
-    setTimeout(function () { leaving.classList.remove('is-leaving'); }, 600);
-    if (dots[prev]) dots[prev].classList.remove('on');
-    i = (n + quotes.length) % quotes.length;
-    quotes[i].classList.add('is-active');
-    if (dots[i]) dots[i].classList.add('on');
-  }
-  function start() { if (reduce) return; stop(); timer = setInterval(function () { show(i + 1); }, 6000); }
-  function stop() { if (timer) { clearInterval(timer); timer = null; } }
-  dots.forEach(function (d) {
-    d.addEventListener('click', function () { show(parseInt(d.getAttribute('data-i'), 10)); start(); });
-  });
-  root.addEventListener('mouseenter', stop);
-  root.addEventListener('mouseleave', start);
-  start();
-})();
-</script>
diff --git a/layouts/partials/widgets/history.html b/layouts/partials/widgets/history.html
index decb73b719c..a3ea514476b 100644
--- a/layouts/partials/widgets/history.html
+++ b/layouts/partials/widgets/history.html
@@ -1,59 +1,15 @@
-{{ $ := .root }}
+{{/* FORRT's history: a dated list. Newest entries come from the section's [[experience]] blocks. */}}
 {{ $page := .page }}
-
-<!-- Experience widget -->
-<div class="row">
-  <div class="col-12 col-lg-4 section-heading">
-    <h2>{{ with $page.Title }}{{ . | markdownify }}{{ end }}</h2>
-    {{ with $page.Params.subtitle }}<p>{{ . | markdownify }}</p>{{ end }}
-  </div>
-  <div class="col-12 col-lg-8">
-    {{ with $page.Content }}{{ . }}{{ end }}
-
-    {{ if $page.Params.experience }}
-    {{ $exp_len := len $page.Params.experience }}
-    {{ range $idx, $key := sort $page.Params.experience ".date_start" "asc" }}
-    <div class="row experience">
-      <!-- Timeline -->
-      <div class="col-auto text-center flex-column d-none d-sm-flex">
-        <div class="row h-50">
-          <div class="col {{if gt $idx 0}}border-right{{end}}">&nbsp;</div>
-          <div class="col">&nbsp;</div>
-        </div>
-        <div class="m-2">
-          <span class="badge badge-pill border {{if not .date_end}}exp-fill{{end}}">&nbsp;</span>
-        </div>
-        <div class="row h-50">
-          <div class="col {{if lt $idx (sub $exp_len 1)}}border-right{{end}}">&nbsp;</div>
-          <div class="col">&nbsp;</div>
-        </div>
-      </div>
-      <!-- Content -->
-      <div class="col py-2">
-        <div class="card">
-          <div class="card-body">
-            <h4 class="card-title exp-title text-muted mt-0 mb-1">{{.title | markdownify | emojify}}</h4>
-            <h4 class="card-title exp-company text-muted my-0">
-              {{- with .company_url}}<a href="{{.}}" target="_blank" rel="noopener">{{end}}{{.company | markdownify | emojify}}{{with .company_url}}</a>{{end -}}
-            </h4>
-            <div class="text-muted exp-meta">
-              {{ (time .date_start).Format ($page.Params.date_format | default "January 2006") }} 
-              {{ if .date_end}}
-                – {{ (time .date_end).Format ($page.Params.date_format | default "January 2006") }}
-              {{else}}
-              {{ with .date_endnow }} - {{ . | markdownify }}{{end}}
-              {{end}}
-              {{with .location}}
-                <span class="middot-divider"></span>
-                <span>{{. | markdownify | emojify }}</span>
-              {{end}}
-            </div>
-            {{with .description}}<div class="card-text">{{. | markdownify | emojify}}</div>{{end}}
-          </div>
-        </div>
-      </div>
-    </div>
-    {{end}}
-    {{end}}
-  </div>
-</div>
+{{ with $page.Content }}{{ . }}{{ end }}
+{{ with $page.Params.experience }}
+<ol class="timeline">
+  {{ range sort . ".date_start" "asc" }}
+  <li>
+    <h3>{{ .title | markdownify | emojify }}</h3>
+    <p class="timeline-meta">{{ with .company_url }}<a href="{{ . }}" target="_blank" rel="noopener">{{ end }}{{ .company | markdownify | emojify }}{{ if .company_url }}</a>{{ end }}<br>
+    {{ (time .date_start).Format ($page.Params.date_format | default "January 2006") }}{{ with .date_end }} to {{ (time .).Format ($page.Params.date_format | default "January 2006") }}{{ else }}{{ with .date_endnow }} to {{ . | markdownify }}{{ end }}{{ end }}{{ with .location }}, {{ . | markdownify | emojify }}{{ end }}</p>
+    {{ with .description }}<div>{{ . | markdownify | emojify }}</div>{{ end }}
+  </li>
+  {{ end }}
+</ol>
+{{ end }}
diff --git a/layouts/partials/widgets/people-card.html b/layouts/partials/widgets/people-card.html
index b3c740a7310..90fd3ff8c96 100644
--- a/layouts/partials/widgets/people-card.html
+++ b/layouts/partials/widgets/people-card.html
@@ -1,160 +1,10 @@
+{{/* One person on a wall: portrait or initials, name, role. Input: dict with `person`. */}}
 {{ $person := .person }}
-{{ $show_social := .show_social | default false }}
-{{ $is_sc_page := .is_sc_page | default false }}
 {{ $avatar := ($person.Resources.ByType "image").GetMatch "*avatar*" }}
-
-{{ $src := "" }}
-{{ $size := 0 }}
-{{ $initials := "" }}
-{{ if site.Params.avatar.gravatar }}
-{{ $src = printf "https://s.gravatar.com/avatar/%s?s=150" (md5 $person.Params.email) }}
-{{ $size = 150 }}
-{{ else if $avatar }}
-{{ $avatar_image := $avatar.Fill "270x270 Center" }}
-{{ $src = $avatar_image.RelPermalink }}
-{{ $size = 270 }}
-{{ else }}
-{{ $name_parts := split $person.Params.name " " }}
-{{ range first 2 $name_parts }}{{ $initials = print $initials (substr . 0 1 | upper) }}{{ end }}
-{{ end }}
-
-{{ $content := trim $person.Content " \n\t\r" }}
-{{ $has_bio := and $content (ne $content "") (ne $content "Coming soon.") (not (in $content "<p>Coming soon")) }}
-
-  {{ $role_plain := "" }}
-  {{ with $person.Params.role }}
-  {{ $role_plain = (. | markdownify | plainify | htmlUnescape) }}
-  {{ end }}
-
-  {{ $bio_html := "" }}
-  {{ with $person.Content }}
-  {{ $bio_html = printf "%s" . }}
-  {{ end }}
-
-  {{ $social := $person.Params.social }}
-  {{ if not $social }}
-  {{ $social = slice }}
-  {{ end }}
-
-  {{ if $is_sc_page }}
-  {{ $card_classes := "portrait portrait--steering" }}
-  {{ if not $src }}{{ $card_classes = printf "%s portrait--placeholder" $card_classes }}{{ end }}
-
-<div class="{{ $card_classes }}">
-  {{ if $src }}
-  <img class="portrait-cover" src="{{ $src }}" width="{{ $size }}" height="{{ $size }}" alt="Portrait of {{ $person.Params.name }}">
-  {{ else }}
-  <div class="portrait-cover portrait-cover--initials">{{ $initials }}</div>
-  {{ end }}
-
-  <div class="portrait-overlay">
-    <div class="portrait-overlay-text">
-      <h2>{{ $person.Params.name | htmlUnescape }}</h2>
-      {{ with $role_plain }}<p>{{ . }}</p>{{ end }}
-    </div>
-    {{ if $has_bio }}
-    <span class="portrait-flip-edge" aria-hidden="true">
-      <svg viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round"
-        stroke-linejoin="round">
-        <polyline points="9 18 15 12 9 6"></polyline>
-      </svg>
-    </span>
-    <button class="bio-trigger portrait-overlay-hitarea" data-person-id="{{ $person.File.UniqueID }}"
-      aria-label="View bio for {{ $person.Params.name }}"></button>
-    {{ end }}
-  </div>
-</div>
-{{ else }}
-<div class="portrait">
-  {{ if $src }}
-  <img class="avatar-circle" src="{{ $src }}" width="{{ $size }}" height="{{ $size }}" alt="Avatar of {{ $person.Params.name }}">
-  {{ else }}
-  <div class="avatar-circle">{{ $initials }}</div>
-  {{ end }}
-
-  <div class="portrait-title">
-    <h2>{{ $person.Params.name }}</h2>
-    {{ with $person.Params.role }}<h3>{{ . | markdownify | emojify }}</h3>{{ end }}
-
-    {{ if or $show_social (and $has_bio $is_sc_page) }}
-    <div class="portrait-bio-button">
-      {{ if and $has_bio $is_sc_page }}
-      <button class="bio-trigger" data-person-id="{{ $person.File.UniqueID }}" title="Read full bio">
-        View Bio
-        <svg class="chevron" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2"
-          stroke-linecap="round" stroke-linejoin="round">
-          <polyline points="9 18 15 12 9 6"></polyline>
-        </svg>
-      </button>
-      {{ end }}
-
-      {{ if $show_social }}
-      <div class="portrait-social" style="margin-top: 0.5rem;">
-        {{ range $person.Params.social }}
-        {{ $link := .link }}
-        {{ $scheme := (urls.Parse $link).Scheme }}
-        {{ $target := "" }}
-        {{ if not $scheme }}
-        {{ $link = .link | relLangURL }}
-        {{ else if in (slice "http" "https") $scheme }}
-        {{ $target = "target=\"_blank\" rel=\"noopener\"" }}
-        {{ end }}
-        <a href="{{ $link | safeURL }}" {{ $target | safeHTMLAttr }} class="network-icon">
-          {{ if eq .icon "envelope" }}
-          <svg viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round"
-            stroke-linejoin="round">
-            <rect x="2" y="4" width="20" height="16" rx="2" />
-            <path d="m22 7-10 5L2 7" />
-          </svg>
-          {{ else if eq .icon "orcid" }}
-          <svg viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round"
-            stroke-linejoin="round">
-            <path
-              d="M12 2C6.48 2 2 6.48 2 12s4.48 10 10 10 10-4.48 10-10S17.52 2 12 2m0 3c-1.66 0-3 1.34-3 3s1.34 3 3 3 3-1.34 3-3-1.34-3-3-3m0 10.5c-2.33 0-7 1.17-7 3.5V19h14v-2.5c0-2.33-4.67-3.5-7-3.5" />
-          </svg>
-          {{ else if eq .icon "globe" }}
-          <svg viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round"
-            stroke-linejoin="round">
-            <circle cx="12" cy="12" r="10" />
-            <path
-              d="M2 12h20M12 2a15.3 15.3 0 0 1 4 10 15.3 15.3 0 0 1-4 10 15.3 15.3 0 0 1-4-10 15.3 15.3 0 0 1 4-10z" />
-          </svg>
-          {{ else if eq .icon "linkedin" }}
-          <svg viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round"
-            stroke-linejoin="round">
-            <path d="M16 8a6 6 0 0 1 6 6v7h-4v-7a2 2 0 0 0-2-2 2 2 0 0 0-2 2v7h-4v-7a6 6 0 0 1 6-6zM2 9h4v12H2z" />
-            <circle cx="4" cy="4" r="2" />
-          </svg>
-          {{ else if eq .icon "google-scholar" }}
-          <svg viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round"
-            stroke-linejoin="round">
-            <path d="M4 4h16v12H4zm0-2l8 6 8-6" />
-          </svg>
-          {{ else }}
-          <svg viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round"
-            stroke-linejoin="round">
-            <circle cx="12" cy="12" r="10" />
-          </svg>
-          {{ end }}
-        </a>
-        {{ end }}
-      </div>
-      {{ end }}
-    </div>
-    {{ end }}
-  </div>
-</div>
-{{ end }}
-
-{{ if $has_bio }}
-<script type="application/json" class="bio-data" data-person-id="{{ $person.File.UniqueID }}">
-  {
-    "name": {{ $person.Params.name | jsonify }},
-    "role": {{ $role_plain | jsonify }},
-    "bio": {{ $bio_html | jsonify }},
-    "avatar": {{ $src | jsonify }},
-    "initials": {{ $initials | jsonify }},
-    "social": {{ $social | jsonify }}
-  }
-</script>
-{{ end }}
\ No newline at end of file
+<li>
+  <a href="{{ $person.RelPermalink }}">
+    {{ with $avatar }}{{ $img := .Fill "120x120 Center webp" }}<img src="{{ $img.RelPermalink }}" width="60" height="60" alt="" loading="lazy">{{ else }}<span class="people-initials" aria-hidden="true">{{ range first 2 (split $person.Params.name " ") }}{{ substr . 0 1 | upper }}{{ end }}</span>{{ end }}
+    <span class="people-name">{{ $person.Params.name }}</span>
+  </a>
+  {{ with $person.Params.role }}<span class="people-role">{{ . | markdownify | emojify }}</span>{{ end }}
+</li>
diff --git a/layouts/partials/widgets/people.html b/layouts/partials/widgets/people.html
index 9cd53c682ed..a5a3a1ff3c4 100644
--- a/layouts/partials/widgets/people.html
+++ b/layouts/partials/widgets/people.html
@@ -1,216 +1,10 @@
-{{/* Steering Committee and People Widget - Redesigned */}}
-
-{{ $root := .root }}
+{{/* The community wall on /about/community/: everyone with a profile, or the listed groups. */}}
 {{ $page := .page }}
-{{ $show_social := $page.Params.design.show_social | default false }}
-{{ $show_interests := $page.Params.design.show_interests | default true }}
-{{ $enable_subsections := $page.Params.design.enable_subsections | default false }}
-{{ $show_all := $page.Params.content.show_all | default false }}
-{{ $is_sc_page := eq $root.RelPermalink "/about/steering-committee/" }}
-
-{{ if $is_sc_page }}
-<div class="people-widget">
-  {{ with $page.Content }}
-  <div class="page-header">
-    {{ . }}
-  </div>
-  {{ end }}
-
-  {{ range $page.Params.content.user_groups }}
-  {{ $group_name := . }}
-  {{ $query := where (where site.Pages "Section" "authors") ".Params.user_groups" "intersect" (slice .) }}
-
-  {{ if $query }}
-  <div class="section-heading-container">
-    <h2 class="section-heading">
-      {{ $icon := "" }}
-      {{ $group_lower := lower $group_name }}
-      {{ if in $group_lower "focus area" }}{{ $icon = "target" }}{{ else if or (in $group_lower "operation") (in
-      $group_lower "steward") (in $group_lower "ombudsman") }}{{ $icon = "settings" }}{{ else if in $group_lower
-      "steering" }}{{ $icon = "anchor" }}{{ else }}{{ $icon = "target" }}{{ end }}
-      <svg class="section-icon" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2"
-        stroke-linecap="round" stroke-linejoin="round">
-        {{ if eq $icon "target" }}
-        <circle cx="12" cy="12" r="1" />
-        <circle cx="19" cy="12" r="1" />
-        <circle cx="5" cy="12" r="1" />
-        <circle cx="12" cy="5" r="1" />
-        <circle cx="12" cy="19" r="1" />
-        <circle cx="12" cy="12" r="7" />
-        {{ else if eq $icon "settings" }}
-        <circle cx="12" cy="12" r="3" />
-        <path
-          d="M12 1v6m0 6v6M4.22 4.22l4.24 4.24m4.96 4.96l4.24 4.24M1 12h6m6 0h6M4.22 19.78l4.24-4.24m4.96-4.96l4.24-4.24" />
-        {{ else if eq $icon "anchor" }}
-        <circle cx="12" cy="5" r="1" />
-        <path d="M12 6v12M12 18H8v-1c0-1.5 1-3 4-3s4 1.5 4 3v1h-4" />
-        {{ else }}
-        <circle cx="12" cy="12" r="1" />
-        <circle cx="19" cy="12" r="1" />
-        <circle cx="5" cy="12" r="1" />
-        <circle cx="12" cy="5" r="1" />
-        <circle cx="12" cy="19" r="1" />
-        <circle cx="12" cy="12" r="7" />
-        {{ end }}
-      </svg>
-      {{ $group_name | markdownify | emojify }}
-    </h2>
-    {{ with $page.Params.subtitle }}<p class="section-subtitle">{{ . | markdownify | emojify }}</p>{{ end }}
-  </div>
-  {{ end }}
-
-  {{ if $enable_subsections }}
-  {{ $teams := dict }}
-  {{ $team_order := slice }}
-  {{ $uncategorized := slice }}
-
-  {{ range $query }}
-  {{ $team := trim (.Params.team | default "") " " }}
-
-  {{ if $team }}
-  {{ if not (index $teams $team) }}
-  {{ $team_order = $team_order | append $team }}
-  {{ end }}
-  {{ $members := (index $teams $team) | default slice }}
-  {{ $members = $members | append . }}
-  {{ $teams = merge $teams (dict $team $members) }}
-  {{ else }}
-  {{ $uncategorized = $uncategorized | append . }}
-  {{ end }}
-  {{ end }}
-
-  {{ $group_lower := lower $group_name }}
-  {{ $team_class := "" }}
-  {{ if in $group_lower "focus" }}
-  {{ $team_class = "focus-areas" }}
-  {{ else if or (in $group_lower "operation") (in $group_lower "steward") (in $group_lower "ombudsman") }}
-  {{ $team_class = "operations" }}
-  {{ else if in $group_lower "steering" }}
-  {{ $team_class = "steering" }}
-  {{ else }}
-  {{ $team_class = "focus-areas" }}
-  {{ end }}
-
-  {{ if and $is_sc_page (or (gt (len $team_order) 0) (gt (len $uncategorized) 0)) }}
-  {{ $items := slice }}
-  {{ range $team_order }}
-  {{ $team := . }}
-  {{ $items = $items | append (dict "kind" "team" "name" $team) }}
-  {{ range index $teams $team }}
-  {{ $items = $items | append (dict "kind" "member" "person" .) }}
-  {{ end }}
-  {{ end }}
-  {{ range $uncategorized }}
-  {{ $items = $items | append (dict "kind" "member" "person" .) }}
-  {{ end }}
-
-  <div class="people-grid people-grid--flow">
-    {{ range $items }}
-    {{ if eq .kind "team" }}
-    <div class="team-title-card {{ $team_class }} team-title-card--inline">
-      <div class="team-title-card-text">
-        <div class="team-title-card-label">Team</div>
-        <h3 class="team-title-card-name">{{ .name | markdownify }}</h3>
-      </div>
-      <div class="team-title-card-arrow" aria-hidden="true">
-        <svg viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round"
-          stroke-linejoin="round">
-          <polyline points="9 18 15 12 9 6"></polyline>
-        </svg>
-      </div>
-    </div>
-    {{ else }}
-    {{ partial "widgets/people-card.html" (dict "person" .person "show_social" $show_social "is_sc_page" $is_sc_page) }}
-    {{ end }}
-    {{ end }}
-  </div>
-  {{ else }}
-  <div class="people-container">
-    {{ range $team_order }}
-    {{ $team := . }}
-    <div class="people-subsection">
-      <div class="subsection-heading">
-        <div class="team-title-card {{ $team_class }}">
-          <div class="team-title-card-label">Team</div>
-          <h3 class="team-title-card-name">{{ $team | markdownify }}</h3>
-        </div>
-      </div>
-
-      <div class="people-items">
-        {{ range index $teams $team }}
-        {{ partial "widgets/people-card.html" (dict "person" . "show_social" $show_social "is_sc_page" $is_sc_page) }}
-        {{ end }}
-      </div>
-    </div>
-    {{ end }}
-
-    {{ if gt (len $uncategorized) 0 }}
-    <div class="people-items">
-      {{ range $uncategorized }}
-      {{ partial "widgets/people-card.html" (dict "person" . "show_social" $show_social "is_sc_page" $is_sc_page) }}
-      {{ end }}
-    </div>
-    {{ end }}
-  </div>
-  {{ end }}
-
-  {{ else }}
-  <div class="people-container">
-    {{ range $query }}
-    {{ partial "widgets/people-card.html" (dict "person" . "show_social" $show_social "is_sc_page" $is_sc_page) }}
-    {{ end }}
-  </div>
-  {{ end }}
-  {{ end }}
-</div>
-{{ else }}
-<div class="row justify-content-center people-widget">
-  {{ with $page.Title }}
-  <div class="col-md-12 section-heading">
-    <h2>{{ . | markdownify | emojify }}</h2>
-    {{ if $page.Params.subtitle }}<p>{{ $page.Params.subtitle | markdownify | emojify }}</p>{{ end }}
-  </div>
-  {{ end }}
-
-  {{ with $page.Content }}
-  <div class="col-md-12">
-    {{ . }}
-  </div>
-  {{ end }}
-
-
-  {{ if $show_all }}
-  <div class="col-md-12">
-    <div class="row">
-      {{ $authors := where site.Pages "Section" "authors" }}
-      {{ $authors = where $authors "Params.name" "!=" nil }}
-      {{ range sort $authors "Params.name" }}
-      <div class="col-12 col-sm-auto col-md-4 people-person py-3">
-        {{ partial "widgets/people-card.html" (dict "person" . "show_social" $show_social "is_sc_page" false) }}
-      </div>
-      {{ end }}
-    </div>
-  </div>
-  {{ else }}
-  {{ range $page.Params.content.user_groups }}
-  {{ $query := where (where site.Pages "Section" "authors") ".Params.user_groups" "intersect" (slice .) }}
-
-  {{ if $query }}
-  <div class="col-md-12">
-    <h2 class="mb-4">{{ . | markdownify | emojify }}</h2>
-  </div>
-  {{ end }}
-
-  <div class="col-md-12">
-    <div class="row">
-      {{ range $query }}
-      <div class="col-12 col-sm-auto col-md-4 people-person py-3">
-        {{ partial "widgets/people-card.html" (dict "person" . "show_social" $show_social "is_sc_page" false) }}
-      </div>
-      {{ end }}
-    </div>
-  </div>
-  {{ end }}
-  {{ end }}
-</div>
-{{ end }}
\ No newline at end of file
+{{ with $page.Content }}{{ . }}{{ end }}
+{{ $authors := where (where site.Pages "Section" "authors") "Params.name" "!=" nil }}
+{{ if not ($page.Params.content.show_all | default false) }}
+  {{ $authors = where $authors ".Params.user_groups" "intersect" $page.Params.content.user_groups }}
+{{ end }}
+<ul class="people-wall">
+  {{ range sort $authors "Params.name" }}{{ partial "widgets/people-card.html" (dict "person" .) }}{{ end }}
+</ul>
diff --git a/layouts/plain_page/list.html b/layouts/plain_page/list.html
index 337698dba0b..62f0ac53bc2 100644
--- a/layouts/plain_page/list.html
+++ b/layouts/plain_page/list.html
@@ -1,13 +1,5 @@
 {{- define "main" -}}
-
-{{ partial "page_header.html" . }}
-
-<div class="universal-wrapper">
-  {{ with .Content }}
-  <div class="article-style">{{ . }}</div>
-  {{ end }}
-</div>
-
-{{ partial "pagination" . }}
-
+{{/* Its numbered list pages stay at their addresses, though this layout does not list them. */}}
+{{ $_ := .Paginate .Data.Pages }}
+{{ partial "doors/reading" . }}
 {{- end -}}
diff --git a/layouts/plain_page/single.html b/layouts/plain_page/single.html
index 4b079626273..2b2aac2f545 100644
--- a/layouts/plain_page/single.html
+++ b/layouts/plain_page/single.html
@@ -1,17 +1,3 @@
 {{- define "main" -}}
-
-<article class="article">
-
-  {{ partial "page_header" . }}
-
-  <div class="article-container pt-3">
-
-    <div class="article-style pt-3">
-      {{ .Content }}
-    </div>
-
-
-  </div>
-</article>
-
+{{ partial "doors/reading" . }}
 {{- end -}}
diff --git a/layouts/replication_hub/list.html b/layouts/replication_hub/list.html
index 37c8d205cf7..61b41c4628c 100644
--- a/layouts/replication_hub/list.html
+++ b/layouts/replication_hub/list.html
@@ -1,26 +1,48 @@
-{{/* layouts/replication_hub/list.html - Main layout for replication hub page */}}
+{{/* The Replication Hub: the four stages and their tools, from the `cards` list in
+     content/replication-hub/_index.md. */}}
 {{ define "main" }}
-
-  <div class="universal-wrapper pt-3 pb-3">
-    <div class="container">
-      <div class="article-container pt-3">
-        <h1 class="clusters-site-heading clusters-hub-page__title" itemprop="headline">{{ .Params.heading_title | default .Title }}</h1>
+<div class="wrap">
+  <header class="page-heading">
+    {{ partial "doors/crumbs" (dict "page" .) }}
+    <div class="heading-grid">
+      <div>
+        <h1>{{ .Params.heading_title | default .Title }}</h1>
+        <p class="lede">{{ .Params.lede }}</p>
       </div>
+      {{/* The hub's own diagram of how its parts fit together (front matter `image`). */}}
+      {{ with .Resources.GetMatch .Params.image }}
+      <figure class="heading-plate-plain"><img src="{{ .RelPermalink }}" alt="{{ $.Params.image_alt }}" width="{{ .Width }}" height="{{ .Height }}" fetchpriority="high"></figure>
+      {{ end }}
     </div>
+  </header>
+  {{ with .Params.start }}
+  <nav class="hub-start" aria-label="Start here">
+    <h2>Start here</h2>
+    <ul class="action-cards">
+      {{ range . }}{{ $href := cond (hasPrefix .url "http") .url (.url | relLangURL) }}<li><a href="{{ $href }}"><strong>{{ .title }}</strong><span>{{ .text }}</span></a></li>{{ end }}
+    </ul>
+  </nav>
+  {{ end }}
+  {{/* On a phone the four stages stack, so the page opens with a way to jump to each. */}}
+  <nav class="stage-jumps" aria-label="Stages">
+    {{ range .Params.cards }}<a class="stage-jump stage-{{ .key }}" href="#stage-{{ .key }}">{{ .title }}</a>{{ end }}
+  </nav>
+  <div class="stages">
+    {{ range .Params.cards }}
+    <section class="stage stage-{{ .key }}" aria-labelledby="stage-{{ .key }}">
+      <header><h2 id="stage-{{ .key }}">{{ .title }}</h2><p>{{ .summary }}</p></header>
+      <ul>
+        {{ range .links }}
+        {{ $link := partial "doors/link" . }}
+        <li class="tool">
+          {{ with .format }}<p class="tool-format">{{ . }}</p>{{ end }}
+          <h3><a href="{{ $link.href }}">{{ $link.label }}</a></h3>
+          <p>{{ .note }}</p>
+        </li>
+        {{ end }}
+      </ul>
+    </section>
+    {{ end }}
   </div>
-
-  {{/* INTRO SECTION */}}
-  <section class="clusters-intro-section">
-    <div class="container">
-      {{ partial "replication-hub/intro.html" . }}
-    </div>
-  </section>
-
-  {{/* CARDS SECTION */}}
-  <section class="rephub-cards-section">
-    <div class="container">
-      {{ partial "replication-hub/cards.html" . }}
-    </div>
-  </section>
-
+</div>
 {{ end }}
diff --git a/layouts/resources/list.html b/layouts/resources/list.html
new file mode 100644
index 00000000000..5475c5aef26
--- /dev/null
+++ b/layouts/resources/list.html
@@ -0,0 +1,80 @@
+{{/* The curated resources directory. /resources/ and /resources/page/N/ carry their cards as
+     HTML, so search engines and visitors without JavaScript can walk the whole collection.
+     resources.js loads a small data file for filtering and a fuller one for searching on first
+     use, and keeps the state in the address, which is where the home page's topics link to. */}}
+{{ define "main" }}
+{{ $index := partialCached "doors/resource_index" . "resources" }}
+{{ $total := len $index.pages }}
+{{ $pager := .Paginate $index.pages 24 }}
+{{ $data := partialCached "doors/resource_data" (dict "index" $index) "resources" }}
+{{ $plate := resources.Get "images/doors/area-education.webp" }}
+<div class="wrap">
+  <header class="page-heading">
+    {{ partial "doors/crumbs" (dict "page" .) }}
+    <div class="heading-grid">
+      <div>
+        <h1>{{ .Params.heading }}</h1>
+        <p class="lede">{{ printf .Params.lede (lang.FormatNumber 0 $total) }}</p>
+      </div>
+      <figure class="heading-plate"><img src="{{ $plate.RelPermalink }}" alt="A brick pencil standing on an open green book." width="{{ $plate.Width }}" height="{{ $plate.Height }}"></figure>
+    </div>
+  </header>
+
+  <div class="directory" id="directory" data-directory-url="{{ $data.directory.RelPermalink }}" data-search-url="{{ $data.search.RelPermalink }}" data-list-url="{{ .RelPermalink }}" data-total="{{ $total }}" data-page="{{ $pager.PageNumber }}" data-per-page="{{ $pager.PagerSize }}">
+    <section class="filters" aria-label="Resource filters">
+      <details class="filter-drawer" id="filterDrawer">
+        <summary>Filter by type, level and cluster <span class="filter-badge" id="filterBadge"></span></summary>
+        {{ range $index.facets }}
+        <fieldset class="facet" data-facet="{{ .key }}">
+          <legend class="filter-title">{{ .name }}</legend>
+          <div class="chips">
+            {{ range .values }}<button class="chip" type="button" aria-pressed="false" data-value="{{ .slug }}">{{ .label }} <span class="chip-count">{{ .count }}</span></button>{{ end }}
+          </div>
+        </fieldset>
+        {{ end }}
+      </details>
+      {{/* Open on wider screens before the first paint, so the page does not jump. */}}
+      <script>if(matchMedia('(min-width:761px)').matches)document.getElementById('filterDrawer').open=true</script>
+      <noscript><p class="filter-note">Filters, search and sorting need JavaScript. Every resource is still listed in the pages below.</p></noscript>
+    </section>
+    <div class="catalogue">
+      <label for="resource-search" class="search-label">Search the collection</label>
+      {{/* The search, with sort order and page size as two quiet menus beside it (below it on a phone);
+           resources.js enables them once the data has loaded. */}}
+      <div class="search-row">
+        <input class="resource-search" id="resource-search" type="search" placeholder="Try preregistration, data or Bayesian" aria-describedby="resultCount" autocomplete="off">
+        <label class="visually-hidden" for="sortOrder">Sort</label>
+        <select class="search-option" id="sortOrder" disabled><option value="title" selected>Title A–Z</option><option value="newest">Newest added</option></select>
+        <label class="visually-hidden" for="perPage">Resources per page</label>
+        <select class="search-option" id="perPage" disabled>{{ range slice 12 24 48 }}<option value="{{ . }}"{{ if eq . $pager.PagerSize }} selected{{ end }}>{{ . }} per page</option>{{ end }}</select>
+      </div>
+      <div class="result-bar">
+        <p class="result-count" id="resultCount" role="status">{{ if gt $pager.TotalPages 1 }}{{ $first := add 1 (mul (sub $pager.PageNumber 1) $pager.PagerSize) }}Showing {{ lang.FormatNumber 0 $first }}–{{ lang.FormatNumber 0 (math.Min $total (add $first (sub $pager.PagerSize 1))) }} of {{ lang.FormatNumber 0 $total }} resources, A to Z{{ else }}Showing all {{ lang.FormatNumber 0 $total }} resources, A to Z{{ end }}</p>
+        <button class="text-button" id="clearFilters" type="button" hidden>Reset filters</button>
+        {{ partial "doors/pager_top" $pager }}
+        <nav class="pager pager-top" id="clientPagerTop" aria-label="Pages, at the top" hidden></nav>
+      </div>
+      <p class="active-filters" id="activeFilters" hidden></p>
+      <div class="res-grid" id="results">
+        {{ range $pager.Pages }}{{ partial "doors/resource_card" (index $index.items .RelPermalink) }}{{ end }}
+      </div>
+      <div class="empty" id="empty" hidden>
+        <h2>No resources match these filters.</h2>
+        <p>Remove a filter or try a broader search term. If something is missing from the collection, <a href="{{ .Params.form_url }}" rel="noopener">suggest a resource</a>.</p>
+        <p><button class="text-button" id="emptyReset" type="button">Reset filters and search</button></p>
+      </div>
+      <nav class="pager" id="clientPager" aria-label="Pages" hidden></nav>
+      {{ partial "doors/pager" $pager }}
+    </div>
+  </div>
+
+  <section class="collection-note" id="form" aria-labelledby="collection-h">
+    <h2 id="collection-h">Missing a resource?</h2>
+    <p><a class="more" href="{{ .Params.form_url }}" rel="noopener">Suggest a resource through our form</a></p>
+    <details class="collection-about"><summary>How the collection grew</summary>{{ .Content }}</details>
+  </section>
+</div>
+<template id="resCard">{{ partial "doors/resource_card" (dict "title" "" "url" "" "types" slice "levels" slice "clusters" slice) }}</template>
+{{ $js := resources.Get "js/doors/resources.js" | js.Build (dict "minify" true "format" "iife" "target" "es2019") | fingerprint "md5" }}
+<script src="{{ $js.RelPermalink }}" defer></script>
+{{ end }}
diff --git a/layouts/section/docs.html b/layouts/section/docs.html
index 1a46a841113..eb39c89a9d9 100644
--- a/layouts/section/docs.html
+++ b/layouts/section/docs.html
@@ -1,15 +1,11 @@
 {{- define "main" -}}
 
-{{ partial "page_header.html" . }}
-
-<div class="universal-wrapper">
-  {{ with .Content }}
-  <div class="article-style">{{ . }}</div>
-  {{ end }}
-  <ul class="list-unstyled">
+{{ partial "doors/reading" . }}
+<div class="wrap">
+  <ul class="plain-list">
     {{ if gt (len .Sections) 0}}
     {{ range .Sections }}
-    <li><h5><a href="{{.RelPermalink}}">{{.LinkTitle}}</a></h5> {{with .Params.summary}}<p>{{. | plainify | emojify}}</p>{{end}}</li>
+    <li><a href="{{.RelPermalink}}">{{.LinkTitle}}</a> {{with .Params.summary}}<p>{{. | plainify | emojify}}</p>{{end}}</li>
     {{end}}
     {{end}}
   </ul>
diff --git a/layouts/section/educators-corner.html b/layouts/section/educators-corner.html
index 9c282a76d19..63cdbed1048 100644
--- a/layouts/section/educators-corner.html
+++ b/layouts/section/educators-corner.html
@@ -1,26 +1,18 @@
 {{- define "main" -}}
-
-{{ partial "page_header.html" . }}
-
-<div class="universal-wrapper">
-
-  {{ with .Content }}
-  <div class="article-style">{{ . }}</div>
-  {{ end }}
-
-  {{ $paginator := .Paginate .Data.Pages }}
-  {{ range $paginator.Pages }}
-    {{ if eq $.Params.view 1 }}
-      {{ partial "li_list" . }}
-    {{ else if eq $.Params.view 3 }}
-      {{ partial "li_card" . }}
-    {{ else }}
-      {{ partial "li_compact" . }}
-    {{ end }}
-  {{ end }}
-
-  {{ partial "pagination" . }}
-
+{{/* A section of articles: its introduction, then the articles newest first, a page at a time. */}}
+{{ $pager := .Paginate .Data.Pages }}
+<div class="wrap">
+  <div class="article-layout article-layout-wide">
+    <article class="reading">
+      <header class="article-head">
+        {{ partial "doors/crumbs" (dict "page" .) }}
+        <h1>{{ .Title }}</h1>
+        {{ with .Params.subtitle }}<p class="standfirst">{{ . | markdownify | emojify }}</p>{{ end }}
+      </header>
+      {{ with .Content }}<div class="article-style">{{ partial "doors/content" . }}</div>{{ end }}
+      <div class="list-items">{{ range $pager.Pages }}{{ partial "doors/list_item" . }}{{ end }}</div>
+      {{ partial "doors/pager" $pager }}
+    </article>
+  </div>
 </div>
-
 {{- end -}}
diff --git a/layouts/section/neurodiversit-lessonbank.html b/layouts/section/neurodiversit-lessonbank.html
index 8da9485b9ad..62f0ac53bc2 100644
--- a/layouts/section/neurodiversit-lessonbank.html
+++ b/layouts/section/neurodiversit-lessonbank.html
@@ -1,12 +1,5 @@
-{{ define "main" }}
-
-  <div class="article-container">
-  {{ partial "page_header" . }}
-
-    <div class="article-style">
-      {{ .Content }}
-    </div>
-
-  </div>
-
-{{ end }}
+{{- define "main" -}}
+{{/* Its numbered list pages stay at their addresses, though this layout does not list them. */}}
+{{ $_ := .Paginate .Data.Pages }}
+{{ partial "doors/reading" . }}
+{{- end -}}
diff --git a/layouts/section/nowherelab.html b/layouts/section/nowherelab.html
index 9b527032b58..2b2aac2f545 100644
--- a/layouts/section/nowherelab.html
+++ b/layouts/section/nowherelab.html
@@ -1,17 +1,3 @@
 {{- define "main" -}}
-
-<div class="article-container" style="padding-top: 2rem;">
-  <div style="display:flex; flex-wrap:wrap; align-items:center; gap:1.5rem; margin-bottom: 1.5rem;">
-    <div style="flex:1 1 320px; min-width:240px;">
-      <h1 style="margin-top:0;">{{ .Title }}</h1>
-      {{ with .Params.subtitle }}<div class="article-subtitle" style="font-size:1.25rem; color:#555;">{{ . | markdownify }}</div>{{ end }}
-    </div>
-    <img src="/img/nowherelab-logo.png" alt="Nowhere Lab logo" style="width:160px; height:160px; flex:0 0 auto;" />
-  </div>
-
-  <div class="article-style">
-    {{ .Content }}
-  </div>
-</div>
-
+{{ partial "doors/reading" . }}
 {{- end -}}
diff --git a/layouts/section/pedagogies.html b/layouts/section/pedagogies.html
index 8e18c827acc..63cdbed1048 100644
--- a/layouts/section/pedagogies.html
+++ b/layouts/section/pedagogies.html
@@ -1,97 +1,18 @@
 {{- define "main" -}}
-
-{{ partial "page_header_pedagogies.html" . }}
-
-<div class="universal-wrapper">
-
-  {{ with .Content }}
-  <div class="article-style">{{ . }}</div>
-  {{ end }}
-
-  {{ $paginator := .Paginate .Data.Pages }}
-  {{ range $paginator.Pages }}
-
-  {{ $item := . }}
-
-
-{{/* Dynamic view adjusts to content type. */}}
-{{ $show_buttons := false }}
-{{ if eq $item.Type "talk" }}
-  {{ $show_buttons = true }}
-{{ else if eq $item.Type "publication" }}
-  {{ $show_buttons = true }}
-{{ else if eq $item.Type "pedagogies" }}
-  {{ $show_buttons = true }}
-{{ end }}
-
-{{/* Get summary. */}}
-{{ $summary := "" }}
-{{ if $item.Params.summary }}
-  {{ $summary = $item.Params.summary | markdownify | emojify }}
-{{ else if .Params.abstract }}
-  {{ $summary = .Params.abstract | markdownify | emojify }}
-{{ else if $item.Truncated }}
-  {{ $summary = $item.Summary }}
-{{ else }}
-  {{ $summary = $item.Content }}
-{{ end }}
-<div class="row">
-
-  <div class="col-md-8 mx-auto pb-2">
-    
-    <div class="card-simple">
-    
-      {{ if eq $item.Type "talk" }}
-    <div class="article-metadata">
-      {{ if $item.Params.authors }}
-      <div>
-        {{ partial "page_metadata_authors" $item }}
-    </div>
-    {{ end }}
-    <span>
-      {{ partial "functions/get_event_dates" $item }}
-    </span>
-    {{ with $item.Params.location }}
-    <span class="middot-divider"></span>
-    <span>{{ . }}</span>
-    {{ end }}
+{{/* A section of articles: its introduction, then the articles newest first, a page at a time. */}}
+{{ $pager := .Paginate .Data.Pages }}
+<div class="wrap">
+  <div class="article-layout article-layout-wide">
+    <article class="reading">
+      <header class="article-head">
+        {{ partial "doors/crumbs" (dict "page" .) }}
+        <h1>{{ .Title }}</h1>
+        {{ with .Params.subtitle }}<p class="standfirst">{{ . | markdownify | emojify }}</p>{{ end }}
+      </header>
+      {{ with .Content }}<div class="article-style">{{ partial "doors/content" . }}</div>{{ end }}
+      <div class="list-items">{{ range $pager.Pages }}{{ partial "doors/list_item" . }}{{ end }}</div>
+      {{ partial "doors/pager" $pager }}
+    </article>
   </div>
-  {{ else }}
-  {{ partial "page_metadata" (dict "page" $item "is_list" 1) }}
-    {{ end }}
-
-    {{ $resource := ($item.Resources.ByType "image").GetMatch "*featured*" }}
-  {{ $anchor := $item.Params.image.focal_point | default "Smart" }}
-  {{ with $resource }}
-  {{ $image := .Fill (printf "918x517 q90 %s" $anchor) }}
-  <a href="{{ $item.RelPermalink }}">
-      <img src="{{ $image.RelPermalink }}" class="article-banner" alt="{{ with $item.Params.image.alttext }}{{ . }}{{ else }}Featured image for {{ $item.Title }}{{ end }}">
-    </a>
-  {{end}}
-  
-  <h3 class="article-title mb-1 mt-3">
-    <a href="{{ $item.RelPermalink }}">{{ $item.Title }}</a>
-  </h3>
-  
-  {{ with $summary }}
-  <div class="article-style">
-    <p>{{.}}</p>
-  </div>
-  {{ end }}
-  
-  {{ if $show_buttons }}
-  <div class="btn-links">
-    {{ partial "page_links" (dict "page" $item "is_list" 1) }}
-  </div>
-  {{ end }}
-</div>
-  
-</div>
-</div>
-{{ end }}
-
-{{ partial "pagination" . }}
-
 </div>
-
 {{- end -}}
diff --git a/layouts/section/post.html b/layouts/section/post.html
index 130f2fb0053..db16a7d0d60 100644
--- a/layouts/section/post.html
+++ b/layouts/section/post.html
@@ -1,10 +1,12 @@
 {{- define "main" -}}
 
-{{ partial "page_header.html" . }}
-
-<div class="universal-wrapper">
-
-  {{ with .Content }}<div class="article-style text-center mb-4">{{ . }}</div>{{ end }}
+<div class="wrap news-page">
+  <header class="article-head">
+    {{ partial "doors/crumbs" (dict "page" .) }}
+    <h1>{{ .Title }}</h1>
+    {{ with .Params.subtitle }}<p class="standfirst">{{ . | markdownify | emojify }}</p>{{ end }}
+  </header>
+  {{ with .Content }}<div class="article-style">{{ partial "doors/content" . }}</div>{{ end }}
 
   {{ $posts := sort .Pages "Date" "desc" }}
 
@@ -14,8 +16,8 @@
   {{ $cats = uniq $cats }}
 
   <div class="ac-filters">
-    <button class="ac-chip active" data-cat="all">All</button>
-    {{ range $cats }}<button class="ac-chip" data-cat="{{ lower . }}">{{ . }}</button>{{ end }}
+    <button class="ac-chip active" type="button" aria-pressed="true" data-cat="all">All</button>
+    {{ range $cats }}<button class="ac-chip" type="button" aria-pressed="false" data-cat="{{ lower . }}">{{ . }}</button>{{ end }}
   </div>
 
   <div class="announcements-grid ac-grid-page">
@@ -30,8 +32,9 @@
 <script>
 document.querySelectorAll('.ac-chip').forEach(function (chip) {
   chip.addEventListener('click', function () {
-    document.querySelectorAll('.ac-chip').forEach(function (c) { c.classList.remove('active'); });
+    document.querySelectorAll('.ac-chip').forEach(function (c) { c.classList.remove('active'); c.setAttribute('aria-pressed', 'false'); });
     chip.classList.add('active');
+    chip.setAttribute('aria-pressed', 'true');
     var cat = chip.getAttribute('data-cat');
     document.querySelectorAll('.ac-item').forEach(function (it) {
       it.style.display = (cat === 'all' || it.getAttribute('data-cat') === cat) ? '' : 'none';
diff --git a/layouts/shortcodes/action_cards.html b/layouts/shortcodes/action_cards.html
new file mode 100644
index 00000000000..816e33f00e9
--- /dev/null
+++ b/layouts/shortcodes/action_cards.html
@@ -0,0 +1,9 @@
+{{/* A row of starting points, one card each, written one per line inside the shortcode as
+     Title | One line on what it is | address
+     e.g. {{< action_cards area="com" >}}Join our Slack | Where the community talks | https://…{{< /action_cards >}}
+     `area` (edu, res, jus or com) starts the row's colours with that area's; the bricks then run through the other areas. */}}
+<ul class="action-cards{{ with .Get "area" }} area-{{ . }}{{ end }}">
+  {{ range split (trim .Inner "\n ") "\n" }}{{ with trim . " " }}{{ $part := split . "|" }}
+  <li><a href="{{ trim (index $part 2) " " }}"><strong>{{ trim (index $part 0) " " }}</strong><span>{{ trim (index $part 1) " " | markdownify }}</span></a></li>
+  {{ end }}{{ end }}
+</ul>
diff --git a/layouts/shortcodes/adopting_feedback_form.html b/layouts/shortcodes/adopting_feedback_form.html
index c30e0aae49e..f91111711ff 100644
--- a/layouts/shortcodes/adopting_feedback_form.html
+++ b/layouts/shortcodes/adopting_feedback_form.html
@@ -65,9 +65,9 @@ <h3>Thank You!</h3>
     border: 1px solid rgba(0, 0, 0, 0.08);
     /* Logical property for visual consistency with the (RTL-aware) glossary
        feedback form, even though this page itself is English-only. */
-    border-inline-start: 4px solid #007bff;
+    border-inline-start: 4px solid var(--link);
     border-radius: 8px;
-    background: rgba(0, 123, 255, 0.03);
+    background: rgba(0, 90, 135, 0.03);
   }
 
   .adopting-feedback-header {
@@ -85,8 +85,8 @@ <h3>Thank You!</h3>
     width: 2.25rem;
     height: 2.25rem;
     border-radius: 50%;
-    background: rgba(0, 123, 255, 0.12);
-    color: #007bff;
+    background: rgba(0, 90, 135, 0.12);
+    color: var(--link);
     font-size: 1.1rem;
   }
 
@@ -98,7 +98,7 @@ <h3>Thank You!</h3>
 
   .adopting-feedback-intro {
     margin: 0;
-    color: #6c757d;
+    color: var(--ink);
     font-size: 0.9rem;
     line-height: 1.5;
   }
@@ -115,7 +115,7 @@ <h3>Thank You!</h3>
 
   .adopting-feedback-optional {
     font-weight: 400;
-    color: #6c757d;
+    color: var(--ink);
     font-size: 0.8rem;
   }
 
@@ -126,8 +126,8 @@ <h3>Thank You!</h3>
   }
 
   .adopting-feedback-form .form-control:focus {
-    border-color: #007bff;
-    box-shadow: 0 0 0 0.15rem rgba(0, 123, 255, 0.2);
+    border-color: var(--link);
+    box-shadow: 0 0 0 0.15rem rgba(0, 90, 135, 0.2);
   }
 
   .adopting-feedback-checkboxes {
@@ -173,10 +173,10 @@ <h3>Thank You!</h3>
 
   .adopting-feedback-hp {
     position: absolute;
-    left: -9999px;
     width: 1px;
     height: 1px;
     overflow: hidden;
+    clip-path: inset(50%);
   }
 
   .adopting-feedback-thanks {
@@ -185,7 +185,7 @@ <h3>Thank You!</h3>
   }
 
   .dark .adopting-feedback {
-    background: rgba(0, 123, 255, 0.07);
+    background: rgba(0, 90, 135, 0.07);
     border-color: rgb(68, 71, 90);
   }
 
diff --git a/layouts/shortcodes/callout.html b/layouts/shortcodes/callout.html
new file mode 100644
index 00000000000..5c2b63cfbde
--- /dev/null
+++ b/layouts/shortcodes/callout.html
@@ -0,0 +1,6 @@
+{{/* A short note beside the text on wide screens, and in the text on narrow ones. Put it just before
+     the paragraph it goes with. Optional: title, and tone ("example" or "warning"). */}}
+<aside class="callout{{ with .Get "tone" }} callout-{{ . }}{{ end }}"{{ with .Get "title" }} aria-label="{{ . }}"{{ end }}>
+  {{ with .Get "title" }}<p class="callout-title">{{ . }}</p>{{ end }}
+  {{ .Page.RenderString (dict "display" "block") .Inner | emojify }}
+</aside>
diff --git a/layouts/shortcodes/citation-card.html b/layouts/shortcodes/citation-card.html
index 9df064245bf..114b81f7d2f 100644
--- a/layouts/shortcodes/citation-card.html
+++ b/layouts/shortcodes/citation-card.html
@@ -1,3 +1,7 @@
+{{/* A suggested citation with a copy button. Either quote a work from the shared bibliography,
+     {{< citation-card key="Asai2026OpenScholar" />}}, or write the reference inside the shortcode.
+     Long author lists show three authors until the reader asks for all (citations/authors);
+     the copy button always copies the full reference (assets/js/doors/references.js). */}}
 {{ $css := resources.Get "css/cite_us.css" }}
 {{ if $css }}
   {{ $style := $css | minify | fingerprint }}
@@ -7,39 +11,29 @@
   <link rel="stylesheet" href="{{ "css/cite_us.css" | relURL }}">
 {{ end }}
 
+{{ $reference := "" }}
+{{ with .Get "key" }}
+  {{ $bib := partialCached "citations/bibliography" . "bibliography" }}
+  {{ with index $bib . }}
+    {{ $reference = markdownify . }}
+  {{ else }}
+    {{/* Local builds use the committed bibliography, which can lag the Doc: warn rather than fail. */}}
+    {{ warnf "citation-card: unknown bibliography key %q on %s" . $.Page.File.Path }}
+  {{ end }}
+{{ else }}
+  {{ $reference = .Inner | markdownify }}
+{{ end }}
+
+{{ with $reference }}
 <div class="cite-us-section citation-card">
   <div class="cite-us-item">
-    <div class="cite-us-text">{{ .Inner | markdownify }}</div>
-    <button type="button" class="copy-button" aria-label="Copy citation" onclick="copyCitationCard(this)">
+    <div class="cite-us-text"><p>{{ partial "citations/authors" $reference }}</p></div>
+    <button type="button" class="copy-button" data-copy-reference>
       <svg class="copy-icon" fill="none" stroke="currentColor" viewBox="0 0 24 24" aria-hidden="true">
         <path stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M8 16H6a2 2 0 01-2-2V6a2 2 0 012-2h8a2 2 0 012 2v2m-6 12h8a2 2 0 002-2v-8a2 2 0 00-2-2h-8a2 2 0 00-2 2v8a2 2 0 002 2z"></path>
       </svg>
-      Copy
+      <span class="copy-label" aria-live="polite">Copy</span><span class="visually-hidden"> citation</span>
     </button>
   </div>
 </div>
-
-<script>
-  async function copyCitationCard(button) {
-    const citation = button.previousElementSibling.innerText.trim();
-    const originalContent = button.innerHTML;
-
-    try {
-      await navigator.clipboard.writeText(citation);
-    } catch (err) {
-      const textarea = document.createElement('textarea');
-      textarea.value = citation;
-      document.body.appendChild(textarea);
-      textarea.select();
-      document.execCommand('copy');
-      document.body.removeChild(textarea);
-    }
-
-    button.innerHTML = '<svg class="copy-icon" fill="none" stroke="currentColor" viewBox="0 0 24 24" aria-hidden="true"><path stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M5 13l4 4L19 7"></path></svg>Copied!';
-    button.classList.add('copied');
-    setTimeout(() => {
-      button.innerHTML = originalContent;
-      button.classList.remove('copied');
-    }, 2000);
-  }
-</script>
+{{ end }}
diff --git a/layouts/shortcodes/citation-politics-toolkit.html b/layouts/shortcodes/citation-politics-toolkit.html
index 6dcbfcab328..e67697d951e 100644
--- a/layouts/shortcodes/citation-politics-toolkit.html
+++ b/layouts/shortcodes/citation-politics-toolkit.html
@@ -1,364 +1,306 @@
-
-{{ $css := resources.Get "css/citations.css" }}
-{{ if $css }}
-  {{ $style := $css | minify | fingerprint }}
-  <link rel="stylesheet" href="{{ $style.RelPermalink }}">
-{{ else }}
-  {{ warnf "CSS not found: css/citations.css. Using static version" }}
-  <link rel="stylesheet" href="{{ "css/citations.css" | relURL }}">
-{{ end }}
-
-
-<body>
-    <div class="container">
-        <!-- Header -->
-        <header class="header">
-            <h1 class="main-title">Citation Politics Toolkit</h1>
-            <p class="subtitle">A toolkit to encourage thoughtful citation</p>
-        </header>
-
-        <!-- Main Layout -->
-        <div class="main-layout">
-            <!-- Mobile Image (shown only on small screens) -->
-            <div class="mobile-image">
-                <img src="/img/citation-politics-toolkit.webp" 
-                     alt="Citational Justice Toolkit"
-                     class="toolkit-image">
-            </div>
-
-            <!-- Left Column - Paper Box -->
-            <div class="column left-column">
-                <div class="stage-box paper">
-                    <h3 class="stage-title">Paper</h3>
-                    <div class="box-content">
-                        <div class="content-group">
-                            <h4 class="section-title">Tools & Practices</h4>
-                            <div class="tools-grid">
-                                <div class="tool-box tool" data-category="tool">
-                                    <a href="https://docs.google.com/document/d/1JwwmOgRhd2p-Bl_RFEMnp04P0I2nNhOHW7JHdaLcyGs/edit?tab=t.0" target="_blank">
-                                        Mirya Holman's pre-submission checklist
-                                    </a>
-                                </div>
-                                <div class="tool-box tool" data-category="tool">
-                                    <a href="https://jlsumner.shinyapps.io/syllabustool/" target="_blank">
-                                        Gender Balance Assessment Tool (GBAT)
-                                    </a>
-                                </div>
-                                <div class="tool-box tool" data-category="tool">
-                                    <a href="https://doi.org/10.31234/osf.io/rfkyu" target="_blank">
-                                        Citation audit survey (Darda et al., 2023)
-                                    </a>
-                                </div>
-                                <div class="tool-box tool" data-category="tool">
-                                    <a href="https://scholar.google.com/scholar_lookup?title=Writing+your+journal+article+in+twelve+weeks%3A+A+guide+to+academic+publishing+success&author=W.+L.+Belcher&publication_year=2019&doi=10.7208%2Fchicago%2F9780226500089.001.0001" target="_blank">
-                                        Gray test (Belcher, 2019)
-                                    </a>
-                                </div>
-                                <div class="tool-box tool" data-category="tool">
-                                    <a href="https://docs.google.com/spreadsheets/d/1HHM6i1WDaAVzSJxgZG8UtNWP3aRcFprsdVpLZJEWxOQ/edit#gid=759055580" target="_blank">
-                                        SIBL Citation Audit Template
-                                    </a>
-                                </div>
-                                <div class="tool-box tool" data-category="tool">
-                                    <a href="http://github.com/dalejn/cleanBib" target="_blank">
-                                        Citational diversity codebook
-                                    </a>
-                                </div>
-                                <div class="tool-box tool" data-category="tool">
-                                    <a href="https://genderize.io/" target="_blank">
-                                        Genderize
-                                    </a>
-                                </div>
-                                <div class="tool-box tool" data-category="tool">
-                                    <a href="https://doi.org/10.18357/kula.135" target="_blank">
-                                        Template for citing Indigenous peoples (MacLeod, 2021)
-                                    </a>
-                                </div>
-                                <div class="tool-box tool" data-category="tool">
-                                    <a href="https://psych.wisc.edu/gcbialyzer/" target="_blank">
-                                        GCBI-alyzer
-                                    </a>
-                                </div>
-                                <div class="tool-box tool" data-category="tool">
-                                    <a href="https://doi.org/10.1371/journal.pone.0221212" target="_blank">
-                                        Inwardness metric (Baccini et al., 2019)
-                                    </a>
-                                </div>
-                                <div class="tool-box practice" data-category="practice">
-                                    <a href="https://doi.org/10.31234/osf.io/6kvqg" target="_blank">
-                                        Annotated reference list <br> (Lawson et al., 2025)
-                                    </a>
-                                </div>
-                                <div class="tool-box practice" data-category="practice">
-                                    <a href="https://doi.org/10.1016/j.tics.2020.06.009" target="_blank">
-                                        Citational diversity statement <br>
-                                        (Zurn et al., 2020)
-                                    </a>
-                                </div>
-                                <div class="tool-box practice" data-category="practice">
-                                    <a href="https://doi.org/10.31234/osf.io/6kvqg" target="_blank">
-                                        Citing R packages <br> (and other tools)
-                                    </a>
-                                </div>
-                            </div>
-                        </div>
-                    </div>
-                </div>
-            </div>
-
-            <!-- Center Column - Image (Large Screens Only) -->
-            <div class="column center-column">
-                <img src="/img/citation-politics-toolkit.webp" 
-                     alt="Citational Justice Toolkit"
-                     class="toolkit-image">
-            </div>
-
-            <!-- Right Column - Planning and Project Boxes -->
-            <div class="column right-column">
-                <!-- Planning Box -->
-                <div class="stage-box planning">
-                    <h3 class="stage-title">Planning</h3>
-                    <div class="box-content">
-                        <div class="content-group">
-                            <h4 class="section-title">Tools & Practices</h4>
-                            <div class="tools-grid">
-                                <div class="tool-box tool" data-category="tool">
-                                    <a href="https://chromewebstore.google.com/detail/citation-transparency/cepnbdbhabaljgecaddglhhcgajphbcf?hl=en&pli=1" target="_blank">
-                                        Citation Transparency browser extension
-                                    </a>
-                                </div>
-                                <div class="tool-box tool" data-category="tool">
-                                    <a href="#">
-                                        FORRT citational justice module (coming soon)
-                                    </a>
-                                </div>
-                                <div class="tool-box tool" data-category="tool">
-                                    <a href="https://civiclaboratory.nl/2023/08/08/citational-politics-training-module/" target="_blank">
-                                        Citational politics training module - CLEAR - Civic Laboratory for Environmental Action Research
-                                    </a>
-                                </div>
-                                <div class="tool-box practice" data-category="practice">
-                                    <a href="https://forrt.org/awop/" target="_blank">
-                                        Academic Wheel of Privilege <br> (AWoP)
-                                    </a>
-                                </div>
-                            </div>
-                        </div>
-                    </div>
-                </div>
-
-                <!-- Project Box -->
-                <div class="stage-box project">
-                    <h3 class="stage-title">Project</h3>
-                    <div class="box-content">
-                        <div class="content-group">
-                            <h4 class="section-title">Tools & Practices</h4>
-                            <div class="tools-grid">
-                                <div class="tool-box tool" data-category="tool">
-                                    <a href="https://web.archive.org/web/20260620235035/http://www.criticalethnicstudiesjournal.org/citation-practices/" target="_blank">
-                                        Citational Practices: Critical Ethnic Studies
-                                    </a>
-                                </div>
-                                <div class="tool-box practice" data-category="practice">
-                                    <a href="#">
-                                        Diversity reading - see Table below
-                                    </a>
-                                </div>
-                            </div>
-                        </div>
-                    </div>
-                </div>
-            </div>
-        </div>
-
-        <!-- Legend -->
-        <div class="legend">
-            <div class="legend-item tool">
-                <div class="legend-color"></div>
-                <span>Tools</span>
-            </div>
-            <div class="legend-item practice">
-                <div class="legend-color"></div>
-                <span>Practices</span>
-            </div>
+{{/* The Citation Politics Toolkit: an intro with the wheel and a search, the tools and practices by
+     stage of the research cycle, the diversity reading list, and how to cite the toolkit.
+     The entries are below as YAML. An entry links with `url`, or with `ref` for a page of this site;
+     one with neither shows as not yet available. `kind` is tool or practice. */}}
+{{ $data := `
+stages:
+  - id: planning
+    name: Planning
+    wheel: Ideas and funding
+    colour: "#f4b400"
+    items:
+      - kind: tool
+        name: Citation Transparency browser extension
+        url: https://chromewebstore.google.com/detail/citation-transparency/cepnbdbhabaljgecaddglhhcgajphbcf?hl=en&pli=1
+      - kind: tool
+        name: FORRT citational justice module
+        note: Coming soon
+      - kind: tool
+        name: Citational politics training module
+        source: CLEAR, Civic Laboratory for Environmental Action Research
+        url: https://civiclaboratory.nl/2023/08/08/citational-politics-training-module/
+      - kind: practice
+        name: Academic Wheel of Privilege (AWoP)
+        ref: /awop
+  - id: project
+    name: Project
+    wheel: Research and journal selection
+    colour: "#00a37a"
+    items:
+      - kind: tool
+        name: "Citational Practices: Critical Ethnic Studies"
+        url: https://web.archive.org/web/20260620235035/http://www.criticalethnicstudiesjournal.org/citation-practices/
+      - kind: practice
+        name: Diversity reading
+        note: See the diversity reading tools below
+        url: "#diversity-reading"
+  - id: paper
+    name: Paper
+    wheel: Paper writing and submission
+    colour: "#d45f00"
+    items:
+      - kind: tool
+        name: Mirya Holman's pre-submission checklist
+        url: https://docs.google.com/document/d/1JwwmOgRhd2p-Bl_RFEMnp04P0I2nNhOHW7JHdaLcyGs/edit?tab=t.0
+      - kind: tool
+        name: Gender Balance Assessment Tool (GBAT)
+        url: https://jlsumner.shinyapps.io/syllabustool/
+      - kind: tool
+        name: Citation audit survey
+        source: Darda et al., 2023
+        url: https://doi.org/10.31234/osf.io/rfkyu
+      - kind: tool
+        name: Gray test
+        source: Belcher, 2019
+        url: https://scholar.google.com/scholar_lookup?title=Writing+your+journal+article+in+twelve+weeks%3A+A+guide+to+academic+publishing+success&author=W.+L.+Belcher&publication_year=2019&doi=10.7208%2Fchicago%2F9780226500089.001.0001
+      - kind: tool
+        name: SIBL Citation Audit Template
+        url: https://docs.google.com/spreadsheets/d/1HHM6i1WDaAVzSJxgZG8UtNWP3aRcFprsdVpLZJEWxOQ/edit#gid=759055580
+      - kind: tool
+        name: Citational diversity codebook
+        url: http://github.com/dalejn/cleanBib
+      - kind: tool
+        name: Genderize
+        url: https://genderize.io/
+      - kind: tool
+        name: Template for citing Indigenous peoples
+        source: MacLeod, 2021
+        url: https://doi.org/10.18357/kula.135
+      - kind: tool
+        name: GCBI-alyzer
+        url: https://psych.wisc.edu/gcbialyzer/
+      - kind: tool
+        name: Inwardness metric
+        source: Baccini et al., 2019
+        url: https://doi.org/10.1371/journal.pone.0221212
+      - kind: practice
+        name: Annotated reference list
+        source: Lawson et al., 2025
+        url: https://doi.org/10.31234/osf.io/6kvqg
+      - kind: practice
+        name: Citational diversity statement
+        source: Zurn et al., 2020
+        url: https://doi.org/10.1016/j.tics.2020.06.009
+      - kind: practice
+        name: Citing R packages (and other tools)
+        url: https://doi.org/10.31234/osf.io/6kvqg
+  - id: publication
+    name: Publication
+    wheel: Peer review and publication
+    colour: "#5b3a99"
+    items:
+      - kind: practice
+        name: Academic Wheel of Privilege (AWoP)
+        note: Also listed under Planning
+        ref: /awop
+reading:
+  - name: Diverse speakers in STEM
+    url: https://docs.google.com/document/u/1/d/e/2PACX-1vSlvHTZtOc6wG5C9xEc-bAIYofpeDHVjrrVc7Q_5IQdmXcLeaYd27nhoJD9jub_q-qAILxHknMGbggb/pub
+    text: Database of databases of diverse speakers in STEM (includes some of the tools in this list, and much more)
+  - name: CiteBetter
+    url: http://citebetter.com
+    text: A community-driven pledge to promote equitable and inclusive citation practices, especially for scholars of color and non-cis-male voices. Offers minimum standards across roles (students, teachers, researchers, department chairs) to actively address citation bias.
+    note: From “Our Pledge” and “Statement of Purpose” on citebetter.com
+  - name: Citation justice in STEMM
+    url: https://libraryguides.mcgill.ca/citation_justice/how_to
+    text: McGill library list of tools and resources to help diversity reading and perform citation audits
+  - name: Citation Practice Self-Audits
+    url: https://research.ubc.ca/sites/default/files/vpri/Promising%20Practices.pdf
+    text: Faculty-led assessments of syllabi and reading lists to identify underrepresentation of women and scholars of color; encourages more inclusive citation practices across teaching and publishing. Promotes critical reflection and gradual change.
+    note: From Promising Practices for Addressing the Underrepresentation of Women in Science, Engineering, and Medicine
+  - name: Equity-Informed Editorial and Review Guidelines
+    url: https://research.ubc.ca/sites/default/files/vpri/Promising%20Practices.pdf
+    text: Proposes journals adopt guidelines that encourage authors, editors, and reviewers to consider gender and racial balance in citations. Promotes institutional accountability in publishing.
+    note: From Promising Practices for Addressing the Underrepresentation of Women in Science, Engineering, and Medicine
+  - name: Diverse Sources
+    url: https://diversesources.org/
+    text: Database of experts to include more underrepresented voices and perspectives in science, health and environment work
+  - name: Women in Neuroscience
+    url: https://www.winrepo.org/repo/
+    text: Women in neuroscience
+  - name: 500 Women Scientists
+    url: https://500womenscientists.org/
+    text: Women scientists across disciplines
+  - name: Anne's List
+    url: https://anneslist.net/
+    text: Women systems neuroscientists
+  - name: Women in Coastal Geoscience and Engineering
+    url: https://womenincoastal.org/
+    text: Aims to inspire, support, and encourage women at all career stages through networking and mentoring
+  - name: Women in Earth and Environmental Sciences in Australasia
+    url: https://www.womeesa.net/
+    text: Creating a unified Australasian network of women working in Earth and Environmental Sciences in academia, industry and government
+  - name: Global South Climate Database
+    url: https://www.carbonbrief.org/global-south-climate-database/
+    text: The Global South Climate Database is a publicly available, searchable database of scientists and experts in the fields of climate science, policy and energy.
+  - name: BIPOC-authored psychology papers
+    url: https://docs.google.com/spreadsheets/d/1i7Eacoyv9VVg2lBbCV-KJZg4nSGvR_VZFOysOyOGG8g/edit?gid=666010790#gid=666010790
+    text: A moderated database of papers to help course instructors diversify their syllabi.
+  - name: Black in Neuro
+    url: https://blackinneuro.com/
+    text: Black neuroscientists
+  - name: Cite Black authors
+    url: https://citeblackauthors.com/
+    text: Black authors across disciplines
+  - name: BlackComputerHer
+    url: https://blackcomputeher.org/citeher-bibliography/
+    text: Black women and girls in computing and tech
+    note: Links to the citeHER Bibliography
+  - name: Cite Black Women Collective
+    url: https://web.archive.org/web/20260605205836/http://www.citeblackwomencollective.org/
+    text: A movement that engages with social media and aesthetic representation (t-shirts) in order to push people to critically rethink the politics of knowledge production by engaging in a radical praxis of citation that acknowledges and honors Black women’s transnational intellectual production.
+  - name: Canadian Black Scientists Network
+    url: https://blackscientists.ca/
+    text: The Canadian Black Scientists Network (CBSN) exists to Elevate, make Visible, Celebrate and Connect Black Canadians in Science, Technology, Engineering, Mathematics & Medicine (STEMM) across sectors.
+  - name: BiasWatchNeuro
+    url: https://biaswatchneuro.com/
+    text: A website that tracks the women:men ratio of invited speakers at neuroscience conferences, workshops, and courses, as well as authors in neuroscience journals and recipients of neuroscience awards.
+  - name: 500 Queer Scientists
+    url: https://500queerscientists.com/
+    text: Queer scientists
+  - name: The Bee
+    url: https://thebeemagazine.com/
+    text: Literary magazine, online platform, podcast, and the heart of a writing community. Our mission is to nurture, publish and promote the best new working-class writing by new and established working-class writers and visual artists.
+    also:
+      - text: New Writing North
+        url: https://newwritingnorth.com/
+  - name: marginalia
+    url: https://www.marginaliascience.com/
+    text: Marginalia are committed to […] promoting female, non-gender conforming, POC, LGBTQIA+, differently abled or in any other way not promoted by the status quo in academia.
+  - name: Reviewer Zero
+    url: https://www.reviewerzero.net/about
+    text: Reviewer Zero aims to transform peer review in psychology and related fields to be more formative and constructive, reducing bias and promoting equity, especially for underserved groups. They provide training for reviewers, develop supportive review practices, and promote diverse research perspectives.
+  - name: JANE (Journal/Author Name Estimator)
+    url: https://jane.biosemantics.org/
+    text: Find papers, journals or authors based on your manuscript title, abstract or keywords. Can be used to find peer reviewers or additional literature to cite.
+  - name: Diversity Reading List in Philosophy
+    url: https://diversityreadinglist.org/
+    text: Diversity in philosophy
+  - name: Advancing big-team reproducible science through increased representation (ABRIR)
+    url: https://abrirpsy.org/about/abrir-hubs/
+    text: ABRIR is a working group that aims to diagnose the unique barriers to leadership & participation in Big-team/Open Science faced by researchers from LMICs (low-to-middle income countries).
+  - name: Framework for Open and Reproducible Research Training (FORRT) - Neurodiversity
+    ref: /neurodiversity
+    text: Supporting the messages of both open scholarship and neurodiversity will ensure that the goals of diversity, equity, and inclusion reach across populations and explicitly include neurodivergent people.
+    note: Includes a database of neurodivergent authors
+    also:
+      - text: Submit to the database of neurodivergent authors
+        url: https://qualtrics.kcl.ac.uk/jfe/form/SV_eLoQdOyAZTDGT7E
+  - name: Indigenous Science Network
+    url: https://research.acer.edu.au/isn/about.html
+    text: A network promoting First Nation/Indigenous science. Regular newsletters and resources for educators.
+  - name: City University of Seattle guide to Finding Indigenous Voices
+    url: https://library.cityu.edu/researchguides/indigenousresources/indigenousvoices
+    text: Tips for how to search for Indigenous voices in research
+  - name: Advancing Indigenous People in STEM (AISES)
+    url: https://www.aises.org/
+    text: AISES is a national nonprofit organization focused on substantially increasing the representation of Indigenous peoples of North America and the Pacific Islands in science, technology, engineering, and math (STEM) studies and careers.
+  - name: Anti-colonial research library (ACRL)
+    url: https://www.anticolonialresearchlibrary.org/
+    text: This Library holds a collection of open-access articles and books, websites, and YouTube videos on Indigenous and anti-colonial research methodologies.
+` | transform.Unmarshal }}
+{{ $page := .Page }}
+{{ $css := resources.Get "css/doors/toolkit.css" | minify | fingerprint "md5" }}
+<link rel="stylesheet" href="{{ $css.RelPermalink }}">
+{{ $wheel := "img/citation-politics-toolkit.webp" | relURL }}
+<div class="cpt">
+  <div class="cpt-intro">
+    <div class="cpt-lede">
+      <p>A toolkit to encourage thoughtful citation: tools and practices for citational justice at each stage of the research cycle, from planning a project to publishing it. Each entry is marked as a tool or a practice, and the wheel shows where it fits.</p>
+      <nav class="cpt-stages" aria-label="Stages">
+        <ul>
+          {{ range $data.stages }}<li><a href="#{{ .id }}" style="--stage:{{ .colour | safeCSS }}">{{ .name }}</a></li>{{ end }}
+          <li><a href="#diversity-reading">Diversity reading</a></li>
+        </ul>
+      </nav>
+      <div class="cpt-search" hidden>
+        <label for="cpt-search-input">Search tools and practices</label>
+        <input id="cpt-search-input" type="search" autocomplete="off" placeholder="For example: gender, audit, Indigenous">
+        <div class="cpt-result">
+          <p class="cpt-status" role="status" aria-live="polite"></p>
+          <button type="button" class="cpt-clear" hidden>Clear the search</button>
         </div>
+      </div>
     </div>
+    <figure class="cpt-wheel">
+      <a href="{{ $wheel }}">
+        <img src="{{ $wheel }}" width="2835" height="2835" alt="{{ $page.Params.sharing_image_alt }}">
+        <span class="cpt-wheel-open">Open the wheel full size</span>
+      </a>
+    </figure>
+  </div>
 
-    <script>
-                    // Enhanced hover effects and interactions
-        document.addEventListener('DOMContentLoaded', function() {
-            // hover effects to tool boxes
-            const toolBoxes = document.querySelectorAll('.tool-box');
-            
-            toolBoxes.forEach(box => {
-                box.addEventListener('mouseenter', function() {
-                    this.style.transform = 'translateY(-3px)';
-                    this.style.boxShadow = '0 6px 20px rgba(52, 152, 219, 0.25)';
-                });
-                
-                box.addEventListener('mouseleave', function() {
-                    this.style.transform = 'translateY(0)';
-                    this.style.boxShadow = '0 2px 10px rgba(0, 0, 0, 0.1)';
-                });
-            });
-
-            // click tracking for analytics
-            const links = document.querySelectorAll('.tool-box a');
-            
-            links.forEach(link => {
-                link.addEventListener('click', function(e) {
-                    const toolName = this.textContent.trim();
-                    const category = this.parentElement.dataset.category;
-                    
-                    // Log click for analytics (you can replace this with a analytics code)
-                    console.log(`Clicked: ${toolName} (${category})`);
-                    
-                    // Optional: Add a brief visual feedback
-                    this.parentElement.style.backgroundColor = '#e3f2fd';
-                    setTimeout(() => {
-                        this.parentElement.style.backgroundColor = '';
-                    }, 200);
-                });
-            });
-
-            // Smooth scroll behavior for any internal links
-            document.querySelectorAll('a[href^="#"]').forEach(anchor => {
-                anchor.addEventListener('click', function (e) {
-                    e.preventDefault();
-                    const target = document.querySelector(this.getAttribute('href'));
-                    if (target) {
-                        target.scrollIntoView({
-                            behavior: 'smooth',
-                            block: 'start'
-                        });
-                    }
-                });
-            });
-
-            // loading state for external links
-            const externalLinks = document.querySelectorAll('a[target="_blank"]');
-            
-            externalLinks.forEach(link => {
-                link.addEventListener('click', function() {
-                    const originalText = this.textContent;
-                    this.textContent = 'Opening...';
-                    
-                    setTimeout(() => {
-                        this.textContent = originalText;
-                    }, 1000);
-                });
-            });
-
-            // Intersection Observer for fade-in animations
-            const observerOptions = {
-                threshold: 0.1,
-                rootMargin: '0px 0px -50px 0px'
-            };
-
-            const observer = new IntersectionObserver((entries) => {
-                entries.forEach(entry => {
-                    if (entry.isIntersecting) {
-                        entry.target.style.opacity = '1';
-                        entry.target.style.transform = 'translateY(0)';
-                    }
-                });
-            }, observerOptions);
-
-            // Observe all stage boxes for animation
-            document.querySelectorAll('.stage-box').forEach(box => {
-                observer.observe(box);
-            });
-
-            // keyboard navigation support
-            document.addEventListener('keydown', function(e) {
-                if (e.key === 'Tab') {
-                    // Ensure focus is visible
-                    document.body.classList.add('keyboard-navigation');
-                }
-            });
-
-            document.addEventListener('mousedown', function() {
-                document.body.classList.remove('keyboard-navigation');
-            });
-
-            // search functionality (basic implementation)
-            function addSearchFunctionality() {
-                // Create search input
-                const searchContainer = document.createElement('div');
-                searchContainer.className = 'search-container';
-                searchContainer.innerHTML = `
-                    <input type="text" id="toolkit-search" placeholder="Search tools and practices..." 
-                        style="width: 100%; max-width: 400px; padding: 0.75rem; border: 2px solid #e5e7eb; 
-                                border-radius: 8px; font-size: 1rem; margin-bottom: 0.5rem;">
-                `;
-                
-                const header = document.querySelector('.header');
-                header.appendChild(searchContainer);
-
-                const searchInput = document.getElementById('toolkit-search');
-                
-                searchInput.addEventListener('input', function() {
-                    const searchTerm = this.value.toLowerCase();
-                    const toolBoxes = document.querySelectorAll('.tool-box');
-                    
-                    toolBoxes.forEach(box => {
-                        const text = box.textContent.toLowerCase();
-                        const shouldShow = text.includes(searchTerm);
-                        
-                        box.style.display = shouldShow ? 'flex' : 'none';
-                        
-                        // Add highlight effect
-                        if (searchTerm && shouldShow && searchTerm.length > 2) {
-                            box.style.backgroundColor = '#fff3cd';
-                            box.style.borderColor = '#ffc107';
-                        } else {
-                            box.style.backgroundColor = '';
-                            box.style.borderColor = '';
-                        }
-                    });
-                });
-            }
-
-            // Uncomment the line below to enable search functionality
-            addSearchFunctionality();
-        });
+  {{ range $data.stages }}
+  <section class="cpt-group" style="--stage:{{ .colour | safeCSS }}" data-cpt-group>
+    <h2 id="{{ .id }}">{{ .name }}</h2>
+    <p class="cpt-wheel-note">On the wheel: {{ .wheel }}</p>
+    <ul class="cpt-items">
+      {{ range .items }}
+      {{ $href := .url }}
+      {{ with .ref }}{{ $href = relref $page . }}{{ end }}
+      <li class="cpt-item" data-cpt-item>
+        <span class="cpt-kind cpt-kind-{{ .kind }}">{{ .kind | humanize }}</span>
+        {{ if $href }}
+        <a class="cpt-name" href="{{ $href }}"{{ if hasPrefix $href "http" }} target="_blank" rel="noopener"{{ end }}>{{ .name }}</a>
+        {{ else }}
+        <span class="cpt-name">{{ .name }}</span>
+        {{ end }}
+        {{ with .source }}<span class="cpt-source">{{ . }}</span>{{ end }}
+        {{ with .note }}<span class="cpt-note">{{ . }}</span>{{ end }}
+      </li>
+      {{ end }}
+    </ul>
+  </section>
+  {{ end }}
 
-        // Utility function to copy link to clipboard
-        function copyLinkToClipboard(url) {
-            navigator.clipboard.writeText(url).then(() => {
-                // Show temporary success message
-                const message = document.createElement('div');
-                message.textContent = 'Link copied to clipboard!';
-                message.style.cssText = `
-                    position: fixed;
-                    top: 20px;
-                    right: 20px;
-                    background: #10b981;
-                    color: white;
-                    padding: 0.75rem 1rem;
-                    border-radius: 8px;
-                    z-index: 1000;
-                    font-weight: 500;
-                `;
-                
-                document.body.appendChild(message);
-                
-                setTimeout(() => {
-                    message.remove();
-                }, 2000);
-            });
-        }
+  <section class="cpt-group cpt-reading" data-cpt-group>
+    <h2 id="diversity-reading">Diversity reading tools</h2>
+    <p>Databases, networks and guides that help you find and read work by scholars from under-represented groups.</p>
+    <ul class="cpt-items">
+      {{ range $data.reading }}
+      {{ $href := .url }}
+      {{ with .ref }}{{ $href = relref $page . }}{{ end }}
+      <li class="cpt-item" data-cpt-item>
+        <a class="cpt-name" href="{{ $href }}"{{ if hasPrefix $href "http" }} target="_blank" rel="noopener"{{ end }}>{{ .name }}</a>
+        <span class="cpt-text">{{ .text }}</span>
+        {{ with .note }}<span class="cpt-note">{{ . }}</span>{{ end }}
+        {{ range .also }}<a class="cpt-also" href="{{ .url }}" target="_blank" rel="noopener">{{ .text }}</a>{{ end }}
+      </li>
+      {{ end }}
+    </ul>
+  </section>
 
-        // copy functionality to tool boxes (right-click context)
-        document.addEventListener('contextmenu', function(e) {
-            const toolBox = e.target.closest('.tool-box');
-            if (toolBox) {
-                const link = toolBox.querySelector('a');
-                if (link && link.href !== '#') {
-                    e.preventDefault();
-                    copyLinkToClipboard(link.href);
-                }
-            }
-        });
-    </script>
-</body>
+  <section class="cpt-cite">
+    <h2 id="cite-as">Cite as</h2>
+    <blockquote><p>Sauvé, S. A., Middleton, S. L., Gellersen, H., &amp; Azevedo, F. (2025, July 31). In Pursuit of Citational Justice: A Toolkit for Equitable Scholarship. <a href="https://doi.org/10.31222/osf.io/qjecy_v2">https://doi.org/10.31222/osf.io/qjecy_v2</a></p></blockquote>
+  </section>
+</div>
+<script>
+(() => {
+  const root = document.querySelector('.cpt');
+  const box = root.querySelector('.cpt-search');
+  const input = root.querySelector('#cpt-search-input');
+  const status = root.querySelector('.cpt-status');
+  const result = root.querySelector('.cpt-result');
+  const clear = root.querySelector('.cpt-clear');
+  const items = [...root.querySelectorAll('[data-cpt-item]')].map((el) => [el, el.textContent.replace(/\s+/g, ' ').toLowerCase()]);
+  const groups = [...root.querySelectorAll('[data-cpt-group]')];
+  box.hidden = false;
+  const filter = () => {
+    const term = input.value.trim();
+    const query = term.toLowerCase();
+    let shown = 0;
+    for (const [el, text] of items) {
+      el.hidden = Boolean(query) && !text.includes(query);
+      if (!el.hidden) shown += 1;
+    }
+    for (const group of groups) group.hidden = !group.querySelector('[data-cpt-item]:not([hidden])');
+    result.classList.toggle('is-empty', !shown);
+    clear.hidden = !query;
+    status.textContent = !query ? '' : shown ? `${shown} of ${items.length} entries match “${term}”.` : `No tools, practices or reading lists match “${term}”. Try a shorter word, or clear the search to see everything.`;
+  };
+  input.addEventListener('input', filter);
+  input.addEventListener('keydown', (event) => { if (event.key === 'Escape' && input.value) { input.value = ''; filter(); } });
+  clear.addEventListener('click', () => { input.value = ''; filter(); input.focus(); });
+})();
+</script>
diff --git a/layouts/shortcodes/cite-us.html b/layouts/shortcodes/cite-us.html
index 2c1312f5f72..4644f640e50 100644
--- a/layouts/shortcodes/cite-us.html
+++ b/layouts/shortcodes/cite-us.html
@@ -1,3 +1,5 @@
+{{/* Suggested citations for FORRT's outputs. Long author lists show three authors until the reader
+     asks for all (citations/authors); Copy copies the full reference as shown (assets/js/doors/references.js). */}}
 {{ $css := resources.Get "css/cite_us.css" }}
 {{ if $css }}
 {{ $style := $css | minify | fingerprint }}
@@ -9,48 +11,45 @@
 
 {{/* Load FReD citation from text file or use fallback */}}
 {{ $fredCitation := "" }}
+{{ $fredNote := "" }}
 {{ $citationFile := "static/data/fred_citation.txt" }}
 {{ if fileExists $citationFile }}
     {{ $fredCitation = readFile $citationFile }}
     {{/* Remove leading/trailing whitespace manually */}}
     {{ $fredCitation = trim $fredCitation " \n\r\t" }}
 {{ else }}
-{{ $fredCitation = print "Wallrich, L.*, & Röseler, L.*, Hartmann, H., Ashcroft-Jones, S., Doetsch, C., Kaiser, L., Schüller, S. M., Aldoh, A., Behbood, H., Elsherif, M. M., Klett, N., Krapp, J., Liu, M., Pavlović, Z., Pennington, C. R., Schütz, A., Seida, C., Siziva, K., Skvortsova, A., Aczel, B., Adelina, N., Agostini, V., Al-Hoorie, A. H., Alarie, S., Albayrak-Aydemir, N., Alzahawi, S., Anvari, F., Arriaga, P., Baker, B. J., Barth, C. L., Bauer, D. J., Becker, R., Beitner, J., Belaus, A., Bhatt, H., Bhogal, J., Boyce, V., Breemer, L., Brick, C., Brohmer, H., Brummernhenrich, B., Budd, E., Butler, A., Casula, A., Chandrashekar, S. P., Chen, S., Chung, K. L., Cockcroft, J. P., Crowe, P., Cummins, J., Daniel, A., Deane, O., Deressa, T. K., Dienlin, T., Diveica, V., Draguns, A., Dumbalska, T., Efendic, E., El Halabi, M., Enright, S., Evans, T. R., Exner, A., Farrar, B. G., Feldman, G., Fillon, A., Floyd, J., Fontana Vieira, F., Frese, J., Förster, N., Gattie, M. C., Gemmecke, C., Genschow, O., Giannouli, V., Gjoneska, B., Gnambs, T., Gourdon-Kanhukamwe, A., Graham, C. J., Greshake Tzovaras, B., Guay, S., Hausenloy, J., Haviva, C., Henderson, E. L., Herderich, A., Hilbert, L., Holgado, D., Hussey, I., Höfer, L., Ilchovska, Z. G., Imada, H., Imwene, P., Izydorczak, K., Jaubert, S., Jeftić, A., Kalandadze, T., Kamermans, K., Karhulahti, V., Kasseckert, L., Kastrinogiannis, A., Klingelhöfer-Jens, M., Kocalar, H. E., Koppel, L., Koppold, A., Korbmacher, M., Kujawa, Z., Kulke, L., Kumar, P., Kuper, N., LaPlume, A. A., Lach, R., Lecuona, O., Lee, J., Leech, G., Leksina, E., Lin, C., Liu, Y., Lohkamp, F., Lou, N. M., Lynott, D., Mackinnon, S., Maier, M., Maiya, S., Makel, M. C., Manrique-Castano, D., Manríquez-Robles, D., Mathes, L., McSharry, D., Meidenbauer, K. L., Meier, M., Micheli, L., Miller, T., Montefinese, M., Moreau, D., Moser, N., Mrkva, K., Murphy, J., Muthu, J., Narkar, N., Nemcova, M., Nádvorník, J., O'Mahoney, R., O'Mahony, A., Oberholzer, Y., Oomen, D., Osano, M., Otstavnov, N., Packheiser, J., Pandey, S., Panton, H., Papenmeier, F., Parsons, S., Paruzel-Czachura, M., Pavlov, Y. G., Pittelkow, M., Plomp, W., Plonski, P. E., Pravednikov, A., Pronizius, E., Pua, A., Pypno-Blajda, K., Rausch, M., Raza, H., Reason, R., Rebholz, T. R., Resulbegoviq, H., Richert, E., Ross, R. M., Russo, S., Röer, J. P., Sandkühler, J. F., Schmidt, K., Sempere, N., Sobolak, R., Sperl, M. F., Stevens, J. R., Stogianni, M., Szekely, R., Tan, A. W., Thürmer, J. L., Tiulpakova, M., Tomczak, J., Tołopiło, A., Tunca, B., Vanpaemel, W., Vaughn, L. A., Verheyen, S., Vineyard, G. H., Weber, L., Weinberg, A., Wingen, S., Wolska, J., Yeung, S. K., Younssi, M., Zaneva, M., Zimmermann, D., Azevedo, F. (2026). FORRT Library of Reproduction and Replication Attempts (FLoRA) [Data set]. OSF. <a href=\"doi.org/10.17605/OSF.IO/9R62X\">doi.org/10.17605/OSF.IO/9R62X </a> <br> * These authors contributed equally to this work." }}
+{{ $fredCitation = print "Wallrich, L.*, & Röseler, L.*, Hartmann, H., Ashcroft-Jones, S., Doetsch, C., Kaiser, L., Schüller, S. M., Aldoh, A., Behbood, H., Elsherif, M. M., Klett, N., Krapp, J., Liu, M., Pavlović, Z., Pennington, C. R., Schütz, A., Seida, C., Siziva, K., Skvortsova, A., Aczel, B., Adelina, N., Agostini, V., Al-Hoorie, A. H., Alarie, S., Albayrak-Aydemir, N., Alzahawi, S., Anvari, F., Arriaga, P., Baker, B. J., Barth, C. L., Bauer, D. J., Becker, R., Beitner, J., Belaus, A., Bhatt, H., Bhogal, J., Boyce, V., Breemer, L., Brick, C., Brohmer, H., Brummernhenrich, B., Budd, E., Butler, A., Casula, A., Chandrashekar, S. P., Chen, S., Chung, K. L., Cockcroft, J. P., Crowe, P., Cummins, J., Daniel, A., Deane, O., Deressa, T. K., Dienlin, T., Diveica, V., Draguns, A., Dumbalska, T., Efendic, E., El Halabi, M., Enright, S., Evans, T. R., Exner, A., Farrar, B. G., Feldman, G., Fillon, A., Floyd, J., Fontana Vieira, F., Frese, J., Förster, N., Gattie, M. C., Gemmecke, C., Genschow, O., Giannouli, V., Gjoneska, B., Gnambs, T., Gourdon-Kanhukamwe, A., Graham, C. J., Greshake Tzovaras, B., Guay, S., Hausenloy, J., Haviva, C., Henderson, E. L., Herderich, A., Hilbert, L., Holgado, D., Hussey, I., Höfer, L., Ilchovska, Z. G., Imada, H., Imwene, P., Izydorczak, K., Jaubert, S., Jeftić, A., Kalandadze, T., Kamermans, K., Karhulahti, V., Kasseckert, L., Kastrinogiannis, A., Klingelhöfer-Jens, M., Kocalar, H. E., Koppel, L., Koppold, A., Korbmacher, M., Kujawa, Z., Kulke, L., Kumar, P., Kuper, N., LaPlume, A. A., Lach, R., Lecuona, O., Lee, J., Leech, G., Leksina, E., Lin, C., Liu, Y., Lohkamp, F., Lou, N. M., Lynott, D., Mackinnon, S., Maier, M., Maiya, S., Makel, M. C., Manrique-Castano, D., Manríquez-Robles, D., Mathes, L., McSharry, D., Meidenbauer, K. L., Meier, M., Micheli, L., Miller, T., Montefinese, M., Moreau, D., Moser, N., Mrkva, K., Murphy, J., Muthu, J., Narkar, N., Nemcova, M., Nádvorník, J., O'Mahoney, R., O'Mahony, A., Oberholzer, Y., Oomen, D., Osano, M., Otstavnov, N., Packheiser, J., Pandey, S., Panton, H., Papenmeier, F., Parsons, S., Paruzel-Czachura, M., Pavlov, Y. G., Pittelkow, M., Plomp, W., Plonski, P. E., Pravednikov, A., Pronizius, E., Pua, A., Pypno-Blajda, K., Rausch, M., Raza, H., Reason, R., Rebholz, T. R., Resulbegoviq, H., Richert, E., Ross, R. M., Russo, S., Röer, J. P., Sandkühler, J. F., Schmidt, K., Sempere, N., Sobolak, R., Sperl, M. F., Stevens, J. R., Stogianni, M., Szekely, R., Tan, A. W., Thürmer, J. L., Tiulpakova, M., Tomczak, J., Tołopiło, A., Tunca, B., Vanpaemel, W., Vaughn, L. A., Verheyen, S., Vineyard, G. H., Weber, L., Weinberg, A., Wingen, S., Wolska, J., Yeung, S. K., Younssi, M., Zaneva, M., Zimmermann, D., Azevedo, F. (2026). FORRT Library of Reproduction and Replication Attempts (FLoRA) [Data set]. OSF. <a href=\"https://doi.org/10.17605/OSF.IO/9R62X\">https://doi.org/10.17605/OSF.IO/9R62X</a>\n\n<strong>* These authors contributed equally to this work.</strong>" }}
+{{ end }}
+{{/* The citation puts its note on equal contributions after a blank line; Copy leaves the note out. */}}
+{{ with findRESubmatch `^([\s\S]*?)\s*\n\s*\n\s*([\s\S]*)$` $fredCitation 1 }}
+    {{ $fredCitation = index (index . 0) 1 }}
+    {{ $fredNote = index (index . 0) 2 }}
 {{ end }}
 
 <div class="cite-us-section">
     <h4 class="section-title">If you want to cite FORRT, in general, cite:</h4>
 
     <div class="cite-us-item">
-        <div class="cite-us-text">
-            Azevedo, F., Parsons, S., Micheli, L., Strand, J., Rinke, E., … & FORRT (2019, December 13). Introducing a
-            Framework for Open and Reproducible Research Training (FORRT).
-            <a href="https://doi.org/10.31219/osf.io/bnh7p" target="_blank" class="doi-link">https://doi.org/10.31219/osf.io/bnh7p</a>
-        </div>
-        <button class="copy-button" onclick="copyText(this, 'forrt1')">
-            <svg class="copy-icon" fill="none" stroke="currentColor" viewBox="0 0 24 24">
+        <div class="cite-us-text"><p>{{ partial "citations/authors" `Azevedo, F., Parsons, S., Micheli, L., Strand, J., Rinke, E., … & FORRT (2019, December 13). Introducing a Framework for Open and Reproducible Research Training (FORRT). <a href="https://doi.org/10.31219/osf.io/bnh7p" target="_blank" class="doi-link">https://doi.org/10.31219/osf.io/bnh7p</a>` }}</p></div>
+        <button type="button" class="copy-button" data-copy-reference>
+            <svg class="copy-icon" aria-hidden="true" fill="none" stroke="currentColor" viewBox="0 0 24 24">
                 <path stroke-linecap="round" stroke-linejoin="round" stroke-width="2"
                     d="M8 16H6a2 2 0 01-2-2V6a2 2 0 012-2h8a2 2 0 012 2v2m-6 12h8a2 2 0 002-2v-8a2 2 0 00-2-2h-8a2 2 0 00-2 2v8a2 2 0 002 2z">
                 </path>
             </svg>
-            Copy
+            <span class="copy-label" aria-live="polite">Copy</span><span class="visually-hidden"> citation</span>
         </button>
     </div>
 
     <div class="cite-us-item">
-        <div class="cite-us-text">
-            Azevedo, F., Liu, M., Pennington, C. R., Pownall, M., Evans, T. R., Parsons, S., Elsherif, M. M., Micheli,
-            L., Westwood, S., & FORRT. (2021). Towards a culture of open scholarship: The role of pedagogical
-            communities. BMC Research Notes, 15(1), 1-5.
-            <a href="https://doi.org/10.1186/s13104-022-05944-1" target="_blank" class="doi-link">https://doi.org/10.1186/s13104-022-05944-1</a>
-        </div>
-        <button class="copy-button" onclick="copyText(this, 'forrt2')">
-            <svg class="copy-icon" fill="none" stroke="currentColor" viewBox="0 0 24 24">
+        <div class="cite-us-text"><p>{{ partial "citations/authors" `Azevedo, F., Liu, M., Pennington, C. R., Pownall, M., Evans, T. R., Parsons, S., Elsherif, M. M., Micheli, L., Westwood, S., & FORRT. (2022). Towards a culture of open scholarship: The role of pedagogical communities. BMC Research Notes, 15(1), 1-5. <a href="https://doi.org/10.1186/s13104-022-05944-1" target="_blank" class="doi-link">https://doi.org/10.1186/s13104-022-05944-1</a>` }}</p></div>
+        <button type="button" class="copy-button" data-copy-reference>
+            <svg class="copy-icon" aria-hidden="true" fill="none" stroke="currentColor" viewBox="0 0 24 24">
                 <path stroke-linecap="round" stroke-linejoin="round" stroke-width="2"
                     d="M8 16H6a2 2 0 01-2-2V6a2 2 0 012-2h8a2 2 0 012 2v2m-6 12h8a2 2 0 002-2v-8a2 2 0 00-2-2h-8a2 2 0 00-2 2v8a2 2 0 002 2z">
                 </path>
             </svg>
-            Copy
+            <span class="copy-label" aria-live="polite">Copy</span><span class="visually-hidden"> citation</span>
         </button>
     </div>
 </div>
@@ -60,18 +59,14 @@ <h4 class="section-title">If you want to cite FORRT, in general, cite:</h4>
     <h4 class="section-title">Citational Justice Toolkit:</h4>
 
     <div class="cite-us-item">
-        <div class="cite-us-text">
-            Sauvé, S. A., Middleton, S. L., Gellersen, H., & Azevedo, F. (2025, July 31). In Pursuit of Citational
-            Justice: A Toolkit for Equitable Scholarship.
-            <a href="https://doi.org/10.31222/osf.io/qjecy_v2" target="_blank" class="doi-link">https://doi.org/10.31222/osf.io/qjecy_v2</a>
-        </div>
-        <button class="copy-button" onclick="copyText(this, 'citational_justice_toolkit')">
-            <svg class="copy-icon" fill="none" stroke="currentColor" viewBox="0 0 24 24">
+        <div class="cite-us-text"><p>{{ partial "citations/authors" `Sauvé, S. A., Middleton, S. L., Gellersen, H., & Azevedo, F. (2025, July 31). In Pursuit of Citational Justice: A Toolkit for Equitable Scholarship. <a href="https://doi.org/10.31222/osf.io/qjecy_v2" target="_blank" class="doi-link">https://doi.org/10.31222/osf.io/qjecy_v2</a>` }}</p></div>
+        <button type="button" class="copy-button" data-copy-reference>
+            <svg class="copy-icon" aria-hidden="true" fill="none" stroke="currentColor" viewBox="0 0 24 24">
                 <path stroke-linecap="round" stroke-linejoin="round" stroke-width="2"
                     d="M8 16H6a2 2 0 01-2-2V6a2 2 0 012-2h8a2 2 0 012 2v2m-6 12h8a2 2 0 002-2v-8a2 2 0 00-2-2h-8a2 2 0 00-2 2v8a2 2 0 002 2z">
                 </path>
             </svg>
-            Copy
+            <span class="copy-label" aria-live="polite">Copy</span><span class="visually-hidden"> citation</span>
         </button>
     </div>
 </div>
@@ -80,17 +75,14 @@ <h4 class="section-title">Citational Justice Toolkit:</h4>
     <h4 class="section-title">The Academic Wheel of Privilege (AWoP):</h4>
 
     <div class="cite-us-item">
-        <div class="cite-us-text">
-            Middleton, S. L., Sulik, J., Iley, B., Elsherif, M. M., & Azevedo, F. (2026). The Academic Wheel of Privilege: An equity-based tool for authorship order. [Preprint]
-            <a href="https://doi.org/10.31222/osf.io/af4nk_v1" target="_blank" class="doi-link">https://doi.org/10.31222/osf.io/af4nk_v1</a>
-        </div>
-        <button class="copy-button" onclick="copyText(this, 'awop')">
-            <svg class="copy-icon" fill="none" stroke="currentColor" viewBox="0 0 24 24">
+        <div class="cite-us-text"><p>{{ partial "citations/authors" `Middleton, S. L., Sulik, J., Iley, B., Elsherif, M. M., & Azevedo, F. (2026). The Academic Wheel of Privilege: An equity-based tool for authorship order. [Preprint] <a href="https://doi.org/10.31222/osf.io/af4nk_v1" target="_blank" class="doi-link">https://doi.org/10.31222/osf.io/af4nk_v1</a>` }}</p></div>
+        <button type="button" class="copy-button" data-copy-reference>
+            <svg class="copy-icon" aria-hidden="true" fill="none" stroke="currentColor" viewBox="0 0 24 24">
                 <path stroke-linecap="round" stroke-linejoin="round" stroke-width="2"
                     d="M8 16H6a2 2 0 01-2-2V6a2 2 0 012-2h8a2 2 0 012 2v2m-6 12h8a2 2 0 002-2v-8a2 2 0 00-2-2h-8a2 2 0 00-2 2v8a2 2 0 002 2z">
                 </path>
             </svg>
-            Copy
+            <span class="copy-label" aria-live="polite">Copy</span><span class="visually-hidden"> citation</span>
         </button>
     </div>
 </div>
@@ -99,60 +91,14 @@ <h4 class="section-title">The Academic Wheel of Privilege (AWoP):</h4>
     <h4 class="section-title">If you want to cite FReD, cite:</h4>
 
     <div class="cite-us-item">
-        <div class="cite-us-text">
-            {{ $fredCitation | safeHTML }}
-        </div>
-        <button class="copy-button" onclick="copyText(this, 'fred')">
-            <svg class="copy-icon" fill="none" stroke="currentColor" viewBox="0 0 24 24">
+        <div class="cite-us-text"><p>{{ partial "citations/authors" $fredCitation }}</p>{{ with $fredNote }}<p class="ref-note">{{ . | safeHTML }}</p>{{ end }}</div>
+        <button type="button" class="copy-button" data-copy-reference>
+            <svg class="copy-icon" aria-hidden="true" fill="none" stroke="currentColor" viewBox="0 0 24 24">
                 <path stroke-linecap="round" stroke-linejoin="round" stroke-width="2"
                     d="M8 16H6a2 2 0 01-2-2V6a2 2 0 012-2h8a2 2 0 012 2v2m-6 12h8a2 2 0 002-2v-8a2 2 0 00-2-2h-8a2 2 0 00-2 2v8a2 2 0 002 2z">
                 </path>
             </svg>
-            Copy
+            <span class="copy-label" aria-live="polite">Copy</span><span class="visually-hidden"> citation</span>
         </button>
     </div>
 </div>
-
-<script>
-    const citations = {
-        forrt1: "Azevedo, F., Parsons, S., Micheli, L., Strand, J., Rinke, E., … & FORRT (2019, December 13). Introducing a Framework for Open and Reproducible Research Training (FORRT). https://doi.org/10.31219/osf.io/bnh7p",
-        forrt2: "Azevedo, F., Liu, M., Pennington, C. R., Pownall, M., Evans, T. R., Parsons, S., Elsherif, M. M., Micheli, L., Westwood, S., & FORRT. (2021). Towards a culture of open scholarship: The role of pedagogical communities. BMC Research Notes, 15(1), 1-5. https://doi.org/10.1186/s13104-022-05944-1",
-        fred: {{ $fredCitation | jsonify }},
-        citational_justice_toolkit: "Sauvé, S. A., Middleton, S. L., Gellersen, H., & Azevedo, F. (2025, July 31). In Pursuit of Citational Justice: A Toolkit for Equitable Scholarship. https://doi.org/10.31222/osf.io/qjecy_v2",
-        awop: "Middleton, S. L., Sulik, J., Iley, B., Elsherif, M. M., & Azevedo, F. (2026). The Academic Wheel of Privilege: An equity-based tool for authorship order. [Preprint] https://doi.org/10.31222/osf.io/af4nk_v1"
-    };
-
-    const copyIcon = `<svg class="copy-icon" fill="none" stroke="currentColor" viewBox="0 0 24 24">
-        <path stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M8 16H6a2 2 0 01-2-2V6a2 2 0 012-2h8a2 2 0 012 2v2m-6 12h8a2 2 0 002-2v-8a2 2 0 00-2-2h-8a2 2 0 00-2 2v8a2 2 0 002 2z"></path>
-    </svg>Copy`;
-
-    const checkIcon = `<svg class="copy-icon" fill="none" stroke="currentColor" viewBox="0 0 24 24">
-        <path stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M5 13l4 4L19 7"></path>
-    </svg>Copied!`;
-
-    async function copyText(button, key) {
-        const text = citations[key];
-
-        try {
-            await navigator.clipboard.writeText(text);
-        } catch (err) {
-            // Fallback for older browsers
-            const textarea = document.createElement('textarea');
-            textarea.value = text;
-            document.body.appendChild(textarea);
-            textarea.select();
-            document.execCommand('copy');
-            document.body.removeChild(textarea);
-        }
-
-        // Show feedback
-        button.innerHTML = checkIcon;
-        button.classList.add('copied');
-
-        // Reset after 2 seconds
-        setTimeout(() => {
-            button.innerHTML = copyIcon;
-            button.classList.remove('copied');
-        }, 2000);
-    }
-</script>
\ No newline at end of file
diff --git a/layouts/shortcodes/cite.html b/layouts/shortcodes/cite.html
new file mode 100644
index 00000000000..a8735e771db
--- /dev/null
+++ b/layouts/shortcodes/cite.html
@@ -0,0 +1,22 @@
+{{- $keys := .Params -}}
+{{- $narrative := false -}}
+{{- $bare := false -}}{{/* bare="true": "Author, Year" without brackets, for a citation inside the author's own brackets */}}
+{{- if .IsNamedParams -}}
+  {{- $keys = slice (.Get "key") -}}
+  {{- $narrative = eq (printf "%v" (.Get "narrative")) "true" -}}
+  {{- $bare = eq (printf "%v" (.Get "bare")) "true" -}}
+{{- end -}}
+{{- $bib := partialCached "citations/bibliography" . "bibliography" -}}
+{{- if not (or $narrative $bare) -}}({{- end -}}
+{{- range $i, $key := $keys -}}
+  {{- if $i -}}; {{ end -}}
+  {{- with index $bib $key -}}
+    {{- $meta := partialCached "citations/metadata" . . -}}
+    {{- $.Page.Store.SetInMap "citations" $key (dict "key" $key "apa" . "sort" (lower $meta.plain)) -}}
+    <a class="cite" href="#ref-{{ $key }}" data-cite="{{ $key }}">{{ if $narrative }}{{ replace $meta.author " & " " and " }} ({{ $meta.year }}){{ else }}{{ $meta.author }}, {{ $meta.year }}{{ end }}</a>
+  {{- else -}}
+    {{- warnf "Unknown citation key %q on %s" $key $.Page.File.Path -}}
+    [{{ $key }}]
+  {{- end -}}
+{{- end -}}
+{{- if not (or $narrative $bare) -}}){{- end -}}
diff --git a/layouts/shortcodes/community_map.html b/layouts/shortcodes/community_map.html
index 47e299c6b56..a4d68a5cd6c 100644
--- a/layouts/shortcodes/community_map.html
+++ b/layouts/shortcodes/community_map.html
@@ -1,5 +1,43 @@
 <!--community_map.html-->
 {{/* Usage: {{< community_map [height] >}}. Embeds the static Leaflet map at static/apps/community_map.html, regenerated from https://github.com/forrtproject/map-community; height is in px (default 600). */}}
-<iframe src="{{ "apps/community_map.html" | relURL }}"
+<style>
+  .community-map-frame{display:block;width:100%;height:var(--map-height);border:none}
+  /* A world map is wider than it is tall, so a tall frame on a phone is mostly empty sea. */
+  @media (max-width:760px){.community-map-frame{height:min(var(--map-height),440px)}}
+</style>
+<iframe src="{{ "apps/community_map.html" | relURL }}" class="community-map-frame"
         title="FORRT Community Map" loading="lazy"
-        style="height:{{ .Get 0 | default "600" }}px;width:100%;border:none;"></iframe>
+        style="--map-height:{{ .Get 0 | default "600" }}px"></iframe>
+<script>
+  /* The generated map opens at zoom 2, its lowest, which on a phone shows Europe and Africa and
+     cannot zoom out. On a narrow frame, fit it to its members instead, and let it zoom out to the
+     whole world. Done from here, because static/apps/community_map.html is regenerated elsewhere. */
+  (function() {
+    var frame = document.currentScript.previousElementSibling;
+    if (frame.clientWidth >= 700) return;
+    function fit(tries) {
+      var win = frame.contentWindow;
+      var widget = win && win.HTMLWidgets && win.HTMLWidgets.find('.leaflet');
+      var map = widget && widget.getMap && widget.getMap();
+      if (!map) { if (tries > 0) setTimeout(function() { fit(tries - 1); }, 200); return; }
+      var data = JSON.parse(win.document.querySelector('script[data-for]').textContent).x.limits;
+      var members = [[data.lat[0], data.lng[0]], [data.lat[1], data.lng[1]]];
+      function view() { map.fitBounds(members, { padding: [12, 12], animate: false }); }
+      map.setMinZoom(0);
+      map.invalidateSize();
+      view();
+      map.setMinZoom(Math.min(map.getZoom(), map.getBoundsZoom([[-60, -180], [78, 180]])));
+      // Its reset button would go back to zoom 2; make it come back to this view.
+      win.document.addEventListener('click', function(event) {
+        if (event.target.closest && event.target.closest('.easy-button-button')) {
+          event.stopPropagation();
+          event.preventDefault();
+          view();
+        }
+      }, true);
+    }
+    function start() { fit(50); }
+    frame.addEventListener('load', start);
+    if (frame.contentDocument && frame.contentDocument.readyState === 'complete' && frame.contentWindow.location.href !== 'about:blank') start();
+  })();
+</script>
diff --git a/layouts/shortcodes/dearflip.html b/layouts/shortcodes/dearflip.html
index 5ef1e15a369..7c582d4c4d1 100644
--- a/layouts/shortcodes/dearflip.html
+++ b/layouts/shortcodes/dearflip.html
@@ -135,77 +135,67 @@
 </style>
 <!-- Required CSS -->
 <link href="/lib/dflip/css/dflip.min.css" rel="stylesheet" type="text/css">
-<link href="/lib/dflip/css/custom.css" rel="stylesheet" type="text/css">
 <!-- themify-icons -->
 <link href="/vendor/assets/themify-icons/themify-icons.css" rel="stylesheet" type="text/css">
 
-{{ with .Get "id" }}
-<!-- Container for the flipbook -->
-<div class="_df_book" id="flipbook-{{ . }}"
-     source="{{ $.Get "pdf" | default "/files/FORRT_Booklet(A5).pdf" }}"
-     style="height: {{ $.Get "height" | default "80vh" }}; margin: 20px 0; min-height: 500px; max-height: 1200px;">
-</div>
-{{ else }}
-<!-- Container for the flipbook -->
-<div class="_df_book" id="flipbook-default"
-     source="{{ .Get "pdf" | default "/files/FORRT_Booklet(A5).pdf" }}"
-     style="height: {{ .Get "height" | default "80vh" }}; margin: 20px 0; min-height: 500px; max-height: 1200px;">
-</div>
-{{ end }}
+{{ $pdf := .Get "pdf" | default "/files/FORRT_Booklet(A5).pdf" }}
+{{ $id := printf "flipbook-%s" (.Get "id" | default "default") }}
+<p class="booklet-open"><a class="btn btn-primary" href="{{ $pdf }}">Open the PDF</a> to read it full screen or save it.</p>
+<div class="_df_book" id="{{ $id }}" source="{{ $pdf }}" style="height:{{ .Get "height" | default "80vh" }};margin:20px 0;min-height:500px;max-height:1200px;"></div>
 
-<!-- Initialize DearFlip once jQuery and DearFlip library are available -->
 <script>
   if (typeof window !== 'undefined' && !window.pdfjsWorkerSrc) {
     window.pdfjsWorkerSrc = '/lib/dflip/js/libs/pdf.worker.min.js';
   }
   (function() {
-    function initializeDFlip() {
-      var $ = window.jQuery;
-      if (!$) { setTimeout(initializeDFlip,100); return; }
-      if (!$.fn.dFlip) { setTimeout(initializeDFlip,100); return; }
-      try {
-        $('._df_book').dFlip();
-        remapFlipbookIcons(); // run after init
-        // Apply dynamic height after DearFlip initialization
-        setTimeout(function() {
-          updateBookletHeight();
-        }, 100);
-      } catch(e){ console.error('DearFlip init failed:', e); }
+    var book = document.getElementById('{{ $id }}');
+    // DearFlip shows one page at a time only when the user agent names a phone, so a narrow
+    // window that does not (a desktop browser, an iPad, a headless browser) turned to a spread
+    // too small to read. Its options take a page mode: 1 is one page, 2 turns it like a booklet.
+    var narrow = book.clientWidth < 700;
+    window['option_' + book.id] = narrow ? { pageMode: 1, singlePageMode: 2 } : {};
+
+    function size() {
+      var height;
+      if (narrow) {
+        // One A5 page across the frame (210 by 148 mm), with room for the toolbar below it.
+        height = Math.round(book.clientWidth * 210 / 148) + 70;
+        book.style.minHeight = '0';
+      } else {
+        height = Math.max(500, Math.min(1200, Math.floor((window.innerHeight || document.documentElement.clientHeight) * 0.8)));
+      }
+      book.style.setProperty('height', height + 'px', 'important');
+    }
+    // Sized before the library measures the frame on creation.
+    size();
+
+    // The library swaps in its own toolbar after it has read the PDF; give it the site's glyphs.
+    function remapWhenReady(tries) {
+      if (book.querySelector('.df-ui-btn')) { remapFlipbookIcons(); return; }
+      if (tries > 0) setTimeout(function() { remapWhenReady(tries - 1); }, 200);
     }
     function loadDFlip() {
-      var s=document.createElement('script');
-      s.src='/lib/dflip/js/dflip.min.js';
-      s.onload=function(){
-        if (document.readyState==='loading')
-          document.addEventListener('DOMContentLoaded', initializeDFlip);
-        else initializeDFlip();
-      };
+      var s = document.createElement('script');
+      s.src = '/lib/dflip/js/dflip.min.js';
+      // dflip.min.js builds every ._df_book itself on document ready, from the options above.
+      s.onload = function() { remapWhenReady(150); };
       document.head.appendChild(s);
     }
-    if (typeof jQuery==='undefined') {
-      var jq=document.createElement('script');
-      jq.src='/lib/dflip/js/libs/jquery.min.js';
-      jq.onload=loadDFlip;
+    if (typeof jQuery === 'undefined') {
+      var jq = document.createElement('script');
+      jq.src = '/lib/dflip/js/libs/jquery.min.js';
+      jq.onload = loadDFlip;
       document.head.appendChild(jq);
     } else {
       loadDFlip();
     }
-  })();
 
-  /* Dynamic booklet sizing: adjust height based on viewport */
-  function updateBookletHeight() {
-    var books = document.querySelectorAll('._df_book');
-    books.forEach(function(book){
-      // Calculate optimal height: 80% of viewport height
-      // Ensuring minimum of 500px and maximum of 1200px
-      var viewportHeight = window.innerHeight || document.documentElement.clientHeight;
-      var targetHeight = Math.floor(viewportHeight * 0.8);
-      targetHeight = Math.max(500, Math.min(1200, targetHeight));
-      book.style.height = targetHeight + 'px';
-      // Also set inline style with !important to override any library styles
-      book.style.setProperty('height', targetHeight + 'px', 'important');
+    var resizeTimer;
+    window.addEventListener('resize', function() {
+      clearTimeout(resizeTimer);
+      resizeTimer = setTimeout(size, 250);
     });
-  }
+  })();
 
   /* Remap ti-* classes to df-icon-* so glyphs display */
   function remapFlipbookIcons() {
@@ -260,17 +250,4 @@
     }).observe(book,{childList:true,subtree:true});
   });
 
-  /* Update on window resize with debouncing */
-  var resizeTimer;
-  window.addEventListener('resize', function() {
-    clearTimeout(resizeTimer);
-    resizeTimer = setTimeout(function() {
-      updateBookletHeight();
-    }, 250);
-  });
-
-  /* Initial height update after page fully loads */
-  window.addEventListener('load', function() {
-    setTimeout(updateBookletHeight, 500);
-  });
 </script>
diff --git a/layouts/shortcodes/embed.html b/layouts/shortcodes/embed.html
index 745f98fe12e..2a415f68bcd 100644
--- a/layouts/shortcodes/embed.html
+++ b/layouts/shortcodes/embed.html
@@ -1,5 +1,7 @@
-<object data="/files/{{ .Get "name" }}" type="application/pdf" width="100%" height="1000px">
-    <embed src="/files/{{ .Get "name" }}">
+{{/* A PDF: a link to open it whole, then the browser's viewer, with its side panel of page thumbnails shut. */}}
+<p class="pdf-open"><a class="btn btn-outline-primary" href="/files/{{ .Get "name" }}" target="_blank" rel="noopener">Open or download the PDF</a></p>
+<object class="pdf-viewer" data="/files/{{ .Get "name" }}#navpanes=0" type="application/pdf" width="100%" height="1000px">
+    <embed src="/files/{{ .Get "name" }}#navpanes=0">
         <p>This browser does not support PDFs. Please download the PDF to view it: <a href="/files/{{ .Get "name" }}">Download PDF</a>.</p>
     </embed>
-</object>
\ No newline at end of file
+</object>
diff --git a/layouts/shortcodes/expand.html b/layouts/shortcodes/expand.html
index b9ea98a5609..d462cbf1d6a 100644
--- a/layouts/shortcodes/expand.html
+++ b/layouts/shortcodes/expand.html
@@ -1,17 +1,6 @@
 {{ $_hugo_config := `{ "version": 1 }` }}
-<div class="expand">
-    <div class="expand-label" style="cursor: pointer;" onclick="$h = $(this);$h.next('div').slideToggle(100,function () {$h.children('i').attr('class',function () {return $h.next('div').is(':visible') ? 'fas fa-chevron-down' : 'fas fa-chevron-right';});});">
-        <i style="font-size:large;" class="fas fa-chevron-right"></i>
-        <span>
-        {{$expandMessage := T "Expand-title"}}
-    	{{ if .IsNamedParams }}
-    	{{.Get "default" | default $expandMessage}}
-    	{{else}}
-    	{{.Get 0 | default $expandMessage}}
-    	{{end}}
-    	</span>
-    </div>
-    <div class="expand-content" style="display: none;">
-        {{.Inner | markdownify | emojify | safeHTML}}
-    </div>
-</div>
\ No newline at end of file
+{{ $expandMessage := T "Expand-title" }}
+<details class="spoiler expand">
+  <summary>{{ if .IsNamedParams }}{{ .Get "default" | default $expandMessage }}{{ else }}{{ .Get 0 | default $expandMessage }}{{ end }}</summary>
+  <div class="spoiler-body">{{ .Inner | markdownify | emojify | safeHTML }}</div>
+</details>
diff --git a/layouts/shortcodes/ga_daily_visitors.html b/layouts/shortcodes/ga_daily_visitors.html
index 7a8b4551aaa..595466b7650 100644
--- a/layouts/shortcodes/ga_daily_visitors.html
+++ b/layouts/shortcodes/ga_daily_visitors.html
@@ -6,6 +6,7 @@
   var dailyData = {{ hugo.Data.ga_data.daily_visitors | jsonify | safeJS }};
   if (dailyData && dailyData.length) {
     dailyData.sort((a, b) => new Date(a.date) - new Date(b.date));
+    {{/* The workflow fetches just after midnight UTC. The latest available row is provisional (the day just ended, or partial current-day data), so it is dropped on purpose. */}}
     dailyData.pop();
     var labels = dailyData.map(function(entry) { return entry.date; });
     var dataPoints = dailyData.map(function(entry) { return entry.users; });
diff --git a/layouts/shortcodes/ga_daily_visitors_yearly.html b/layouts/shortcodes/ga_daily_visitors_yearly.html
index 166aa6a7403..b8e9797c2fa 100644
--- a/layouts/shortcodes/ga_daily_visitors_yearly.html
+++ b/layouts/shortcodes/ga_daily_visitors_yearly.html
@@ -8,6 +8,7 @@ <h3 id="-by-day-1">&hellip; by day</h3>
   var dailyData = {{ hugo.Data.ga_data.daily_visitors_yearly | jsonify | safeJS }};
   if (dailyData && dailyData.length) {
     dailyData.sort((a, b) => new Date(a.date) - new Date(b.date));
+    {{/* The workflow fetches just after midnight UTC. The latest available row is provisional (the day just ended, or partial current-day data), so it is dropped on purpose. */}}
     dailyData.pop();
     var labels = dailyData.map(function(entry) { return entry.date; });
     var dataPoints = dailyData.map(function(entry) { return entry.users; });
diff --git a/layouts/shortcodes/ga_map.html b/layouts/shortcodes/ga_map.html
index 7540821bd5e..9a7c4f82da0 100644
--- a/layouts/shortcodes/ga_map.html
+++ b/layouts/shortcodes/ga_map.html
@@ -20,6 +20,12 @@
     maxBoundsViscosity: 1.0
   }).setView([40, 0], 1.25); // ✅ Adjust as needed
 
+  // On a phone the view above cut off the Americas and East Asia, so fit the inhabited world to the frame.
+  if (document.getElementById('ga_map').clientWidth < 700) {
+    window.myLeafletMap.options.zoomSnap = 0.25;
+    window.myLeafletMap.fitBounds([[-56, -168], [72, 180]]);
+  }
+
   // ✅ Define visitor data from Hugo
   var gaRegionsData = {{ hugo.Data.ga_data.regions | jsonify | safeJS }};
   var gaRegions = {};
diff --git a/layouts/shortcodes/ga_map_yearly.html b/layouts/shortcodes/ga_map_yearly.html
index c468df12ad3..129aeba0325 100644
--- a/layouts/shortcodes/ga_map_yearly.html
+++ b/layouts/shortcodes/ga_map_yearly.html
@@ -23,6 +23,12 @@ <h3 id="-by-country-1">&hellip; by country</h3>
     maxBoundsViscosity: 1.0
   }).setView([40, 0], 1.25);
 
+  // On a phone the view above cut off the Americas and East Asia, so fit the inhabited world to the frame.
+  if (document.getElementById('ga_map_yearly').clientWidth < 700) {
+    window.myLeafletMapYearly.options.zoomSnap = 0.25;
+    window.myLeafletMapYearly.fitBounds([[-56, -168], [72, 180]]);
+  }
+
   // Define visitor data from Hugo
   var gaRegionsData = {{ hugo.Data.ga_data.regions_yearly | jsonify | safeJS }};
   if (!gaRegionsData) {
diff --git a/layouts/shortcodes/ga_top_pages.html b/layouts/shortcodes/ga_top_pages.html
index c0b6b8d0ac9..acab87ea17d 100644
--- a/layouts/shortcodes/ga_top_pages.html
+++ b/layouts/shortcodes/ga_top_pages.html
@@ -21,7 +21,7 @@
             <a href="{{ .RelPermalink }}">{{ .RelPermalink }}</a>
           {{ end }}
         {{ else }}
-          <a href="https://forrt.org{{ .page }}">https://forrt.org{{ .page }}</a>
+          <a href="{{ .page | relURL }}">forrt.org{{ .page }}</a>
         {{ end }}
       </td>
       <td>{{ .views }}</td>
diff --git a/layouts/shortcodes/ga_top_pages_yearly.html b/layouts/shortcodes/ga_top_pages_yearly.html
index 00e2a6102a1..28ace9cc514 100644
--- a/layouts/shortcodes/ga_top_pages_yearly.html
+++ b/layouts/shortcodes/ga_top_pages_yearly.html
@@ -23,7 +23,7 @@ <h3 id="-by-destination-1">&hellip; by destination</h3>
             <a href="{{ .RelPermalink }}">{{ .RelPermalink }}</a>
           {{ end }}
         {{ else }}
-          <a href="https://forrt.org{{ .page }}">https://forrt.org{{ .page }}</a>
+          <a href="{{ .page | relURL }}">forrt.org{{ .page }}</a>
         {{ end }}
       </td>
       <td>{{ .views }}</td>
diff --git a/layouts/shortcodes/get_involved_projects.html b/layouts/shortcodes/get_involved_projects.html
index 9f837930c06..c1d7a0df802 100644
--- a/layouts/shortcodes/get_involved_projects.html
+++ b/layouts/shortcodes/get_involved_projects.html
@@ -6,39 +6,35 @@
 {{ $data := index hugo.Data "get_involved_projects" }}
 {{ $projects := $data.projects }}
 
-<div class="get-involved-projects" style="display: flex; flex-direction: column; gap: 1rem; margin-top: 1.5rem;">
+{{/* A search over the projects by name and description (site.js); hidden with JavaScript off. */}}
+<div class="list-filter project-filter" hidden>
+  <label for="project-filter-input">Search {{ len $projects }} projects</label>
+  <input type="search" id="project-filter-input" placeholder="e.g. data, teaching, replication" autocomplete="off">
+  <p class="list-filter-count" aria-live="polite"></p>
+</div>
+<div class="get-involved-projects">
   {{ range $projects }}
-    <div class="get-involved-card" style="background: #FEFDF6; border-radius: 8px; box-shadow: 0 4px 20px rgba(0, 0, 0, 0.08); border: 1px solid rgba(0, 0, 0, 0.1); padding: 1.25rem;">
-      <h3 style="font-size: 1.15rem; font-weight: 700; margin: 0 0 0.5rem 0; line-height: 1.35;">
+    <div class="get-involved-card">
+      <h3>
         {{ if .link }}
-          <a href="{{ .link }}" style="color: inherit; text-decoration: none;">{{ .name }}</a>
+          <a href="{{ .link }}">{{ .name }}</a>
         {{ else }}
           {{ .name }}
         {{ end }}
       </h3>
-      <div style="font-size: 0.95rem; color: #495057; line-height: 1.6; margin-bottom: 0.9rem;">
+      <div>
         {{ .description | markdownify }}
       </div>
-      <div style="display: flex; flex-wrap: wrap; gap: 0.5rem; align-items: center; padding-top: 0.6rem; border-top: 1px solid #f1f3f5;">
-        {{ if .link }}
-          <a href="{{ .link }}" class="btn btn-outline-primary btn-sm">
-            <i class="fas fa-external-link-alt"></i> Visit project
-          </a>
-        {{ end }}
-        {{ if .slack }}
-          <a href="{{ .slack }}" target="_blank" rel="noopener" class="btn btn-outline-info btn-sm">
-            <i class="fab fa-slack"></i> Slack
-          </a>
-        {{ end }}
+      {{/* One filled action to reach a person; the project's own page and its Slack channel follow as plain links. */}}
+      <div class="get-involved-actions">
         {{ if .contact_email }}
-          <a href="mailto:{{ .contact_email }}" class="btn btn-outline-success btn-sm">
-            <i class="fas fa-envelope"></i> Email {{ .contact_name }}
-          </a>
+          <a href="mailto:{{ .contact_email }}" class="btn btn-primary btn-sm is-main">Email {{ .contact_name | default "the team" }}</a>
         {{ else if .contact_name }}
-          <span style="font-size: 0.85rem; color: #495057;">
-            <i class="fas fa-user"></i> Contact: {{ .contact_name }} (reach out via Slack)
-          </span>
+          {{/* No email: the person is reached on FORRT's Slack, so the button joins it. */}}
+          <a href="https://join.slack.com/t/forrt/shared_invite/zt-alobr3z7-NOR0mTBfD1vKXn9qlOKqaQ" target="_blank" rel="noopener" class="btn btn-primary btn-sm is-main">Ask {{ .contact_name }} on Slack</a>
         {{ end }}
+        {{ if .slack }}<a href="{{ .slack }}" target="_blank" rel="noopener" class="get-involved-link">Slack channel</a>{{ end }}
+        {{ if .link }}<a href="{{ .link }}" class="get-involved-link">Visit project</a>{{ end }}
       </div>
     </div>
   {{ end }}
diff --git a/layouts/shortcodes/gform.html b/layouts/shortcodes/gform.html
index 74961c28ba1..d134271df03 100644
--- a/layouts/shortcodes/gform.html
+++ b/layouts/shortcodes/gform.html
@@ -4,7 +4,7 @@
   "link" $url
   "provider" "Google Forms"
   "label" "This form"
-  "title" "Google Form"
+  "title" (.Get "title" | default (printf "Google form: %s" .Page.Title))
   "width" (.Get "width")
   "height" (.Get "height")
 ) }}
diff --git a/layouts/shortcodes/just_os_chat.html b/layouts/shortcodes/just_os_chat.html
index f9cbde384db..dae77e3af29 100644
--- a/layouts/shortcodes/just_os_chat.html
+++ b/layouts/shortcodes/just_os_chat.html
@@ -1,3 +1,5 @@
+{{ $css := resources.Get "css/doors/chatbot.css" | minify | fingerprint "md5" }}
+<link rel="stylesheet" href="{{ $css.RelPermalink }}">
 {{ $active := true }}
 {{ if isset site.Params "justos_chatbot" }}
   {{ $active = default true (index site.Params.justos_chatbot "active") }}
@@ -8,6 +10,7 @@
 {{ end }}
 
 {{ if $active }}
+<script src="{{ "js/just-os-chat.js" | relURL }}" defer></script>
 <div id="just-os-fullpage" class="just-os-fullpage" style="
   width: 100%;
   max-width: 1200px;
@@ -61,25 +64,16 @@
     <textarea class="just-os-input" rows="1" placeholder="Ask a question…" aria-label="Chat message"
       style="
         flex: 1;
-        border: 1px solid #ccc;
-        border-radius: 8px;
+        border: 1.5px solid var(--line);
+        border-radius: var(--r-small);
         padding: 10px 12px;
-        font-size: 0.95rem;
+        font-size: 16px;
         resize: none;
         max-height: 120px;
         font-family: inherit;
         line-height: 1.4;
       "></textarea>
-    <button class="just-os-send-btn" type="button" style="
-      background: #0d3c74;
-      color: white;
-      border: none;
-      border-radius: 8px;
-      padding: 10px 18px;
-      cursor: pointer;
-      font-size: 0.95rem;
-      white-space: nowrap;
-    ">Send</button>
+    <button class="just-os-send-btn" type="button">Send</button>
   </div>
 </div>
 {{ else }}
diff --git a/layouts/shortcodes/just_os_team.html b/layouts/shortcodes/just_os_team.html
index 27eecd86568..22cfa89ddc7 100644
--- a/layouts/shortcodes/just_os_team.html
+++ b/layouts/shortcodes/just_os_team.html
@@ -1,8 +1,8 @@
 {{ $imageBase := "/img/team/just_os_chatbot_team" }}
 
-<h2 style="text-align: center; margin: 10px 0 24px;">The Team</h2>
+<h2>The Team</h2>
 
-<div style="display: flex; flex-wrap: wrap; gap: 24px; justify-content: center; margin-top: 20px;">
+<ul class="jos-team">
   {{ $members := slice
     (dict "name" "Rink Hoekstra" "image" "rink-hoekstra.webp" "alt" "Rink Hoekstra" "description" "Associate Professor at Pedagogical and Educational Science department, University of Groningen; board member Open Science Community Groningen; co-project manager.")
     (dict "name" "Nina Schwarzbach" "image" "nina-schwarzbach.webp" "alt" "Nina Schwarzbach" "description" "PhD candidate in psychotherapy and research methodology at University of Groningen; co-project manager.")
@@ -16,12 +16,10 @@ <h2 style="text-align: center; margin: 10px 0 24px;">The Team</h2>
   }}
 
   {{ range $members }}
-  <div style="width: 250px; padding: 2px; border-radius: 18px; background: linear-gradient(135deg, #0f766e 0%, #0ea5e9 50%, #f59e0b 100%); box-shadow: 0 10px 24px rgba(15, 118, 110, 0.15);">
-    <div style="height: 100%; background: #fff; border-radius: 16px; padding: 16px; text-align: center;">
-      <img src="{{ printf "%s/%s" $imageBase .image | relURL }}" alt="{{ .alt }}" style="width: 180px; height: 180px; border-radius: 50%; object-fit: cover;">
-      <h4 style="margin: 12px 0 6px;">{{ .name }}</h4>
-      <p style="font-size: 0.9rem; color: #555; margin: 0;">{{ .description }}</p>
-    </div>
-  </div>
+  <li>
+    <img src="{{ printf "%s/%s" $imageBase .image | relURL }}" alt="{{ .alt }}" width="96" height="96" loading="lazy">
+    <h3>{{ .name }}</h3>
+    <p>{{ .description }}</p>
+  </li>
   {{ end }}
-</div>
\ No newline at end of file
+</ul>
diff --git a/layouts/shortcodes/list_filter.html b/layouts/shortcodes/list_filter.html
new file mode 100644
index 00000000000..9f396a2d424
--- /dev/null
+++ b/layouts/shortcodes/list_filter.html
@@ -0,0 +1,7 @@
+{{/* A search over the list items that follow it on the page, e.g. {{< list_filter label="Search the effects" placeholder="e.g. priming" noun="effects" >}}.
+     site.js hides items that do not match and headings left with none; it stays hidden with JavaScript off. One per page: site.js sets up the first. */}}
+<div class="list-filter" data-noun="{{ .Get "noun" | default "entries" }}" hidden>
+  <label for="list-filter-input">{{ .Get "label" | default "Search this list" }}</label>
+  <input type="search" id="list-filter-input" placeholder="{{ .Get "placeholder" }}" autocomplete="off">
+  <p class="list-filter-count" aria-live="polite"></p>
+</div>
diff --git a/layouts/shortcodes/partner_filters.html b/layouts/shortcodes/partner_filters.html
index a283cfc5f61..5daabede871 100644
--- a/layouts/shortcodes/partner_filters.html
+++ b/layouts/shortcodes/partner_filters.html
@@ -3,14 +3,14 @@
     {{/* Cluster Filter */}}
     <div class="filter-section-title">Filter by Partner Category</div>
     <div id="pill-bar-cluster" class="pill-bar">
-        <span class="filter-pill active" data-group="cluster" data-value="all">All Partners</span>
-        <span class="filter-pill" data-group="cluster" data-value="Global Intergovernmental Organizations">Global Intergovernmental Organizations</span>
-        <span class="filter-pill" data-group="cluster" data-value="Reproducibility Networks">Reproducibility Networks</span>
-        <span class="filter-pill" data-group="cluster" data-value="Open Science Infrastructure">Open Science Infrastructure</span>
-        <span class="filter-pill" data-group="cluster" data-value="Open Research Communities">Open Research Communities</span>
-        <span class="filter-pill" data-group="cluster" data-value="Education & Training">Education & Training</span>
-        <span class="filter-pill" data-group="cluster" data-value="Open Research & Equity">Open Research & Equity</span>
-        <span class="filter-pill" data-group="cluster" data-value="Higher Education Partners">Higher Education Partners</span>
+        <button type="button" class="filter-pill active" aria-pressed="true" data-group="cluster" data-value="all">All Partners</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="cluster" data-value="Global Intergovernmental Organizations">Global Intergovernmental Organizations</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="cluster" data-value="Reproducibility Networks">Reproducibility Networks</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="cluster" data-value="Open Science Infrastructure">Open Science Infrastructure</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="cluster" data-value="Open Research Communities">Open Research Communities</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="cluster" data-value="Education & Training">Education & Training</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="cluster" data-value="Open Research & Equity">Open Research & Equity</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="cluster" data-value="Higher Education Partners">Higher Education Partners</button>
     </div>
 
     {{/* Empty State Warning */}}
@@ -73,8 +73,9 @@ <h4><i class="fas fa-search"></i> No partners found</h4>
         // Cluster Filters
         clusterPills.forEach(pill => {
             pill.addEventListener('click', () => {
-                clusterPills.forEach(p => p.classList.remove('active'));
+                clusterPills.forEach(p => { p.classList.remove('active'); p.setAttribute('aria-pressed', 'false'); });
                 pill.classList.add('active');
+                pill.setAttribute('aria-pressed', 'true');
                 currentCluster = pill.getAttribute('data-value');
                 filterPartners();
             });
diff --git a/layouts/shortcodes/partner_list.html b/layouts/shortcodes/partner_list.html
index 67451169b46..a4b1374f717 100644
--- a/layouts/shortcodes/partner_list.html
+++ b/layouts/shortcodes/partner_list.html
@@ -29,7 +29,7 @@
 
 <div class="partner-section-group" data-cluster="{{ $cluster }}">
     {{ if $title }}
-    <div class="section-heading" align="center">
+    <div class="section-heading" >
         <h2>{{ $title | markdownify }}</h2>
         <hr>
         {{ if $description }}
@@ -39,48 +39,47 @@ <h2>{{ $title | markdownify }}</h2>
         {{ end }}
     </div>
     {{ end }}
-    <div class="partner-list" style="display: flex; flex-direction: column; gap: 1rem; margin-top: 1rem;">
+    <div class="partner-list">
         {{ range $items }}
         {{ $clusterClass := index $clusterMap .cluster | default "default" }}
         <div class="partner-card" data-aos="fade-up" data-cluster="{{ .cluster }}"
             {{ if .status }}data-status="{{ .status }}"{{ end }}
-            {{ if .project_specific }}data-project="true"{{ end }}
-            style="background: #FEFDF6; border-radius: 8px; box-shadow: 0 4px 20px rgba(0, 0, 0, 0.08); border: 1px solid rgba(0, 0, 0, 0.1); padding: 1.25rem; margin-bottom: 0.5rem;">
+            {{ if .project_specific }}data-project="true"{{ end }}>
             <div class="partner-card-body">
 
-                <div class="partner-header" style="display: flex; justify-content: space-between; align-items: center; margin-bottom: 0.75rem;">
-                    <div class="partner-tags" style="display: flex; flex-wrap: wrap; gap: 6px;">
+                <div class="partner-header">
+                    <div class="partner-tags">
                         {{/* Cluster Pill */}}
-                        <span class="partner-pill pill-{{ $clusterClass }}" style="display: inline-block; padding: 0.2em 0.6em; font-size: 0.75rem; font-weight: 500; border-radius: 50rem;">{{ .cluster }}</span>
+                        <span class="partner-pill pill-{{ $clusterClass }}">{{ .cluster }}</span>
                         {{ if .status }}
-                        <span class="partner-pill pill-status-{{ .status }}" style="display: inline-block; padding: 0.2em 0.6em; font-size: 0.75rem; font-weight: 500; border-radius: 50rem;">{{ .status | title }}</span>
+                        <span class="partner-pill pill-status-{{ .status }}">{{ .status | title }}</span>
                         {{ end }}
                         {{ if .project_specific }}
-                        <span class="partner-pill pill-project" style="display: inline-block; padding: 0.2em 0.6em; font-size: 0.75rem; font-weight: 500; border-radius: 50rem; background-color: #d3f9d8; color: #2b8a3e;">Project Partner</span>
+                        <span class="partner-pill pill-project">Project Partner</span>
                         {{ end }}
                     </div>
                 </div>
 
-                <div class="partner-content" style="display: flex; gap: 1.5rem; align-items: flex-start; margin-bottom: 1rem;">
-                    <div class="partner-logo-container" style="flex-shrink: 0; width: 120px; min-width: 120px; display: flex; align-items: center; justify-content: center;">
+                <div class="partner-content">
+                    <div class="partner-logo-container">
                         {{ if .logo }}
-                        <a href="{{ .url }}" target="_blank" rel="noopener" style="display: flex; align-items: center; justify-content: center;">
-                            <img src="logos/{{ .logo }}" alt="{{ .name }} logo" class="partner-logo" loading="lazy" style="max-width: 120px; max-height: 80px; width: auto; height: auto; object-fit: contain;">
+                        <a href="{{ .url }}" target="_blank" rel="noopener">
+                            <img src="logos/{{ .logo }}" alt="{{ .name }} logo" class="partner-logo" loading="lazy">
                         </a>
                         {{ end }}
                     </div>
-                    <div class="partner-info" style="flex: 1; min-width: 0;">
-                        <h3 class="partner-title" style="font-size: 1.1rem; font-weight: 700; color: #212529; margin-bottom: 0.5rem; line-height: 1.35;">
-                            <a href="{{ .url }}" target="_blank" rel="noopener" style="color: inherit; text-decoration: none;">{{ .name }}</a>
+                    <div class="partner-info">
+                        <h3 class="partner-title">
+                            <a href="{{ .url }}" target="_blank" rel="noopener">{{ .name }}</a>
                         </h3>
-                        <div class="partner-description" style="font-size: 0.9rem; color: #495057; line-height: 1.6;">
+                        <div class="partner-description">
                             {{ .description | markdownify }}
                         </div>
                     </div>
                 </div>
 
-                <div class="partner-footer" style="display: flex; flex-wrap: wrap; justify-content: flex-start; align-items: center; gap: 0.5rem; padding-top: 0.75rem; border-top: 1px solid #f1f3f5;">
-                    <div class="partner-buttons" style="display: flex; gap: 0.35rem; flex-wrap: wrap;">
+                <div class="partner-footer">
+                    <div class="partner-buttons">
                         {{ if .url }}
                         <a href="{{ .url }}" target="_blank" rel="noopener" class="btn btn-outline-primary btn-sm">
                             <i class="fas fa-external-link-alt"></i> Visit Website
diff --git a/layouts/shortcodes/publication_filters.html b/layouts/shortcodes/publication_filters.html
index 3b8b012a610..f4abe9d43bb 100644
--- a/layouts/shortcodes/publication_filters.html
+++ b/layouts/shortcodes/publication_filters.html
@@ -3,37 +3,36 @@
     {{/* Content Type Filter */}}
     <div class="filter-section-title">Filter by Content Type</div>
     <div id="pill-bar-type" class="pill-bar">
-        <span class="filter-pill active" data-group="type" data-value="all">All</span>
-        <span class="filter-pill" data-group="type" data-value="Publications">Publications</span>
-        <span class="filter-pill" data-group="type" data-value="Preprints">Preprints</span>
-        <span class="filter-pill" data-group="type" data-value="Policy Briefs">Policy Briefs</span>
-        <span class="filter-pill" data-group="type" data-value="Op-Eds">Op-Eds</span>
-        <span class="filter-pill" data-group="type" data-value="Teaching Materials">Teaching Materials</span>
-        <span class="filter-pill" data-group="type" data-value="Interactive Tools / Apps">Interactive Tools /
-            Apps</span>
-        <span class="filter-pill" data-group="type" data-value="Data, Code & Packages">Data, Code & Packages</span>
-        <span class="filter-pill" data-group="type" data-value="Working Papers & Ongoing Projects">Working Papers &
-            Ongoing Projects</span>
-        <span class="filter-pill" data-group="type" data-value="Affiliated Projects">Affiliated Projects</span>
+        <button type="button" class="filter-pill active" aria-pressed="true" data-group="type" data-value="all">All</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="type" data-value="Publications">Publications</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="type" data-value="Preprints">Preprints</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="type" data-value="Policy Briefs">Policy Briefs</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="type" data-value="Op-Eds">Op-Eds</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="type" data-value="Teaching Materials">Teaching Materials</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="type" data-value="Interactive Tools / Apps">Interactive Tools /
+            Apps</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="type" data-value="Data, Code & Packages">Data, Code & Packages</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="type" data-value="Working Papers & Ongoing Projects">Working Papers &
+            Ongoing Projects</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="type" data-value="Affiliated Projects">Affiliated Projects</button>
     </div>
 
-    <br>
-
+    
     {{/* Focus Area Filter */}}
     <div class="filter-section-title">Filter by Research Area</div>
     <div id="pill-bar-focus" class="pill-bar">
-        <span class="filter-pill active" data-group="focus" data-value="all">All Areas</span>
-        <span class="filter-pill" data-group="focus" data-value="Meta-Research & Scientific Reform">Meta-Research &
-            Scientific Reform</span>
-        <span class="filter-pill" data-group="focus" data-value="Equity, Diversity & Social Justice">Equity, Diversity &
-            Social Justice</span>
-        <span class="filter-pill" data-group="focus" data-value="Community, Governance & Sustainability">Community,
-            Governance & Sustainability</span>
-        <span class="filter-pill" data-group="focus" data-value="Education & Pedagogy">Education & Pedagogy</span>
+        <button type="button" class="filter-pill active" aria-pressed="true" data-group="focus" data-value="all">All Areas</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="focus" data-value="Meta-Research & Scientific Reform">Meta-Research &
+            Scientific Reform</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="focus" data-value="Equity, Diversity & Social Justice">Equity, Diversity &
+            Social Justice</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="focus" data-value="Community, Governance & Sustainability">Community,
+            Governance & Sustainability</button>
+        <button type="button" class="filter-pill" aria-pressed="false" data-group="focus" data-value="Education & Pedagogy">Education & Pedagogy</button>
     </div>
 
     {{/* Empty State Warning */}}
-    <div id="no-resources-warning" style="display: none; text-align: center; margin-top: 2rem; color: #666;">
+    <div id="no-resources-warning" style="display: none;" role="status">
         <h4><i class="fas fa-search"></i> No resources available</h4>
         <p>There are no publications matching the selected content type and research area.</p>
     </div>
@@ -104,8 +103,9 @@ <h4><i class="fas fa-search"></i> No resources available</h4>
         // Type Filters
         typePills.forEach(pill => {
             pill.addEventListener('click', () => {
-                typePills.forEach(p => p.classList.remove('active'));
+                typePills.forEach(p => { p.classList.remove('active'); p.setAttribute('aria-pressed', 'false'); });
                 pill.classList.add('active');
+                pill.setAttribute('aria-pressed', 'true');
                 currentType = pill.getAttribute('data-value');
                 filterPublications();
             });
@@ -114,8 +114,9 @@ <h4><i class="fas fa-search"></i> No resources available</h4>
         // Focus Filters
         focusPills.forEach(pill => {
             pill.addEventListener('click', () => {
-                focusPills.forEach(p => p.classList.remove('active'));
+                focusPills.forEach(p => { p.classList.remove('active'); p.setAttribute('aria-pressed', 'false'); });
                 pill.classList.add('active');
+                pill.setAttribute('aria-pressed', 'true');
                 currentFocus = pill.getAttribute('data-value');
                 filterPublications();
             });
diff --git a/layouts/shortcodes/publication_list.html b/layouts/shortcodes/publication_list.html
index fe37b1e8f1f..c7bbe5aae24 100644
--- a/layouts/shortcodes/publication_list.html
+++ b/layouts/shortcodes/publication_list.html
@@ -18,8 +18,8 @@
 <div class="pub-section-group">
     {{ $description := .Get "description" }}
     {{ if $title }}
-    <div class="section-heading" align="center">
-        <h1>{{ $title | markdownify }}</h1>
+    <div class="section-heading">
+        <h2>{{ $title | markdownify }}</h2>
         <hr>
         {{ if $description }}
         <div class="pub-section-description">
@@ -29,7 +29,7 @@ <h1>{{ $title | markdownify }}</h1>
     </div>
     {{ end }}
     <div class="pub-list">
-        {{ range $items }}
+        {{ range $i, $_ := $items }}
         {{ $dataType := index $typeMap .type | default .type }}
         <div class="pub-card" data-aos="fade-up" data-type="{{ $dataType }}"
             data-focus="{{ if .focus_area }}{{ .focus_area }}{{ else }}uncategorized{{ end }}">
@@ -77,21 +77,23 @@ <h3 class="pub-title">{{ .title | markdownify }}</h3>
                 </div>
 
                 <div class="pub-abstract-toggle">
-                    <button class="btn-toggle-abstract"
-                        onclick="this.parentElement.nextElementSibling.classList.toggle('show'); this.classList.toggle('active');">
-                        <i class="fas fa-chevron-right"></i> Show Abstract
+                    {{ $abstractID := printf "abstract-%d-%d" $.Ordinal $i }}
+                    <button type="button" class="btn-toggle-abstract" aria-expanded="false" aria-controls="{{ $abstractID }}"
+                        onclick="var open = this.parentElement.nextElementSibling.classList.toggle('show'); this.classList.toggle('active', open); this.setAttribute('aria-expanded', open); this.querySelector('.toggle-label').textContent = open ? 'Hide Abstract' : 'Show Abstract';">
+                        <i class="fas fa-chevron-right" aria-hidden="true"></i> <span class="toggle-label">Show Abstract</span>
                     </button>
                 </div>
-                <div class="publication-card-abstract">
+                <div class="publication-card-abstract" id="{{ $abstractID }}">
                     <p>{{ .abstract | markdownify }}</p>
                 </div>
 
-                <div class="pub-citation-section">
-                    <strong>Cite:</strong>
+                {{/* The card already shows title, authors and venue, so the full reference waits behind "Cite". */}}
+                <details class="pub-citation-section">
+                    <summary><i class="fas fa-chevron-right" aria-hidden="true"></i> Cite this</summary>
                     <div class="citation-text">
                         {{ .citation | markdownify }}
                     </div>
-                </div>
+                </details>
 
                 <div class="pub-footer">
                     <div class="pub-buttons">
diff --git a/layouts/shortcodes/references.html b/layouts/shortcodes/references.html
new file mode 100644
index 00000000000..ac8881b2e4f
--- /dev/null
+++ b/layouts/shortcodes/references.html
@@ -0,0 +1,8 @@
+{{- with .Page.Store.Get "citations" -}}
+<h2 id="references">References</h2>
+<ul class="references-list">
+  {{- range sort . "sort" -}}
+    {{- partial "citations/entry" . -}}
+  {{- end -}}
+</ul>
+{{- end -}}
diff --git a/layouts/shortcodes/spoiler.html b/layouts/shortcodes/spoiler.html
index 630cbea7bac..241c63cdb25 100644
--- a/layouts/shortcodes/spoiler.html
+++ b/layouts/shortcodes/spoiler.html
@@ -1,13 +1,4 @@
-{{- $id := printf "spoiler-%d" .Ordinal -}}
-<div class="spoiler {{ .Get "class" }}" {{ with .Get "style" }}style="{{ . | safeCSS }}"{{ end }}>
-  <p>
-    <a class="btn btn-primary text-white" data-toggle="collapse" href="#{{$id}}" role="button" aria-expanded="false" aria-controls="{{$id}}">
-      {{ .Get "text" | emojify }}
-    </a>
-  </p>
-  <div class="collapse card {{ if (eq (.Get "open") "true") }}show{{ end }}" id="{{$id}}">
-    <div class="card-body">
-      {{ .Inner | markdownify | emojify }}
-    </div>
-  </div>
-</div>
\ No newline at end of file
+<details class="spoiler {{ .Get "class" }}"{{ if eq (.Get "open") "true" }} open{{ end }}{{ with .Get "style" }} style="{{ . | safeCSS }}"{{ end }}>
+  <summary>{{ .Get "text" | emojify }}</summary>
+  <div class="spoiler-body">{{ .Inner | markdownify | emojify }}</div>
+</details>
diff --git a/layouts/shortcodes/subscribe.html b/layouts/shortcodes/subscribe.html
index 3a3ae3dc2d8..37a5c397c4b 100644
--- a/layouts/shortcodes/subscribe.html
+++ b/layouts/shortcodes/subscribe.html
@@ -1 +1 @@
-{{ partial "newsletter_form.html" . }}
+{{ partial "doors/newsletter" . }}
diff --git a/layouts/shortcodes/summaries.html b/layouts/shortcodes/summaries.html
index 53b278f365b..0538155f039 100644
--- a/layouts/shortcodes/summaries.html
+++ b/layouts/shortcodes/summaries.html
@@ -1,8 +1,9 @@
 {{ partial "structured-data/summaries-jsonld.html" (dict "page" .Page "deiOnly" false) }}
 {{ $summaries := hugo.Data.summaries }}
-{{ range $summaries }}
+{{ range $summaries }}{{ if .Title }}
 
-<h2 id="{{.Id}}">{{ .Title | markdownify }}</h2>
+<details class="summary-entry">
+<summary><h2 id="{{.Id}}">{{ .Title | markdownify }}</h2></summary>
 <h3> Main Takeaways: </h3>
 <ul>
     {{ range .Main_Takeaways }}
@@ -23,7 +24,5 @@ <h3>You may also be interested in</h3>
     <li><a href="{{.href}}" class="">{{.Relevant_ref}}</a>
     {{end}}
 </ul>
-<br>
-<hr>
-<br>
-{{end}}
+</details>
+{{ end }}{{end}}
diff --git a/layouts/shortcodes/summaries_dei.html b/layouts/shortcodes/summaries_dei.html
index a0fd39b4c44..756ed0f8b63 100644
--- a/layouts/shortcodes/summaries_dei.html
+++ b/layouts/shortcodes/summaries_dei.html
@@ -3,7 +3,8 @@
 {{ range $summaries}}
 {{ if in .Title "⌺" }}
 
-<h2 id="{{.Id}}">{{ .Title | markdownify }}</h2>
+<details class="summary-entry">
+<summary><h2 id="{{.Id}}">{{ .Title | markdownify }}</h2></summary>
 <h3> Main Takeaways: </h3>
 <ul>
     {{ range .Main_Takeaways }}
@@ -24,8 +25,6 @@ <h3>You may also be interested in</h3>
     <li><a href="{{.href}}" class="">{{.Relevant_ref}}</a>
     {{end}}
 </ul>
-<br>
-<hr>
-<br>
+</details>
 
 {{end}} {{end}}
diff --git a/layouts/shortcodes/term.html b/layouts/shortcodes/term.html
new file mode 100644
index 00000000000..bb68e5a1dc0
--- /dev/null
+++ b/layouts/shortcodes/term.html
@@ -0,0 +1,10 @@
+{{- $name := .Get 0 -}}
+{{- $text := .Get 1 | default $name -}}
+{{- $key := lower $name -}}
+{{- $terms := partialCached "doors/glossary_index.html" site -}}
+{{- with index $terms $key -}}
+  <a class="gloss-term" href="{{ .url }}" data-term="{{ $key }}">{{ $text }}</a>
+{{- else -}}
+  {{- warnf "Unknown English glossary term %q at %s" $name .Position -}}
+  {{- $text -}}
+{{- end -}}
diff --git a/layouts/shortcodes/toolkit.html b/layouts/shortcodes/toolkit.html
deleted file mode 100644
index 3c5e2932458..00000000000
--- a/layouts/shortcodes/toolkit.html
+++ /dev/null
@@ -1,244 +0,0 @@
-<style>
-.citation-toolkit {
-  margin: 1.5rem 0;
-  border: 1px solid #2769bf;
-  border-radius: 8px;
-  padding: 0;
-}
-
-.citation-toolkit summary {
-  cursor: pointer;
-  font-weight: 600;
-  padding: 1rem 1.5rem;
-  background-color: #f6f8fa;
-  border-radius: 8px 8px 0 0;
-  list-style: none;
-}
-
-.citation-toolkit summary::marker,
-.citation-toolkit summary::-webkit-details-marker {
-  display: none;
-}
-
-.citation-toolkit summary:after {
-  content: "▼";
-  float: right;
-  transition: transform 0.2s;
-}
-
-.citation-toolkit[open] summary:after {
-  transform: rotate(180deg);
-}
-
-.table-wrapper {
-  overflow-x: auto;
-  padding: 1rem;
-}
-
-.citation-toolkit table {
-  width: 100%;
-  border-collapse: collapse;
-  margin-top: 0.5rem;
-}
-
-.citation-toolkit th {
-  background-color: #f0f4f8;
-  text-align: left;
-  padding: 0.75rem 1rem;
-  border-bottom: 2px solid #d0d7de;
-}
-
-.citation-toolkit td {
-  padding: 0.75rem 1rem;
-  border-bottom: 1px solid #eaecef;
-  vertical-align: top;
-}
-
-.citation-toolkit tr:hover td {
-  background-color: #f8f9fa;
-}
-
-.citation-toolkit a {
-  color: #8e0000;
-  text-decoration: none;
-}
-
-.citation-toolkit a:hover {
-  text-decoration: underline;
-  color: #b3005a;
-}
-</style>
-
-<!-- Diversity reading tools table -->
-
-<details class="citation-toolkit">
-<summary>📚 click here to View Diversity Reading Tools table 🔍📊 </summary>
-<div class="table-wrapper">
-<table>
-  <thead>
-    <tr>
-      <th>Tool</th>
-      <th>Description</th>
-      <th>Source</th>
-    </tr>
-  </thead>
-  <tbody>
-    <tr>
-      <td>Diverse speakers in STEM</td>
-      <td>Database of databases of diverse speakers in STEM (includes some of the tools in this table, and much more)</td>
-      <td><a href="https://docs.google.com/document/u/1/d/e/2PACX-1vSlvHTZtOc6wG5C9xEc-bAIYofpeDHVjrrVc7Q_5IQdmXcLeaYd27nhoJD9jub_q-qAILxHknMGbggb/pub" target="_blank">Diverse speakers in STEM lists</a></td>
-    </tr>
-    <tr>
-      <td>CiteBetter</td>
-      <td>A community-driven pledge to promote equitable and inclusive citation practices, especially for scholars of color and non-cis-male voices. Offers minimum standards across roles (students, teachers, researchers, department chairs) to actively address citation bias.</td>
-      <td>“Our Pledge” and “Statement of Purpose” of <a href="http://citebetter.com" target="_blank">citebetter.com</a></td>
-    </tr>
-    <tr>
-      <td>Citation justice in STEMM</td>
-      <td>McGill library list of tools and resources to help diversity reading and perform citation audits</td>
-      <td><a href="https://libraryguides.mcgill.ca/citation_justice/how_to" target="_blank">How to diversify your citations - Citation Justice in STEMM - Guides at McGill Library</a></td>
-    </tr>
-    <tr>
-      <td>Citation Practice Self-Audits</td>
-      <td>Faculty-led assessments of syllabi and reading lists to identify underrepresentation of women and scholars of color; encourages more inclusive citation practices across teaching and publishing. Promotes critical reflection and gradual change.</td>
-      <td><a href="https://research.ubc.ca/sites/default/files/vpri/Promising%20Practices.pdf" target="_blank">Promising Practices for Addressing the Underrepresentation of Women in Science, Engineering, and Medicine.</a></td>
-    </tr>
-    <tr>
-      <td>Equity-Informed Editorial and Review Guidelines</td>
-      <td>Proposes journals adopt guidelines that encourage authors, editors, and reviewers to consider gender and racial balance in citations. Promotes institutional accountability in publishing.</td>
-      <td><a href="https://research.ubc.ca/sites/default/files/vpri/Promising%20Practices.pdf" target="_blank">Promising Practices for Addressing the Underrepresentation of Women in Science, Engineering, and Medicine.</a></td>
-    </tr>
-    <tr>
-      <td>Diverse Sources</td>
-      <td>Database of experts to include more underrepresented voices and perspectives in science, health and environment work</td>
-      <td><a href="https://diversesources.org/" target="_blank">Diverse Sources</a></td>
-    </tr>
-    <tr>
-      <td>Women in Neuroscience</td>
-      <td>Women in neuroscience</td>
-      <td><a href="https://www.winrepo.org/repo/" target="_blank">Women in Neuroscience Repo - Repository (winrepo.org)</a></td>
-    </tr>
-    <tr>
-      <td>500 Women Scientists</td>
-      <td>Women scientists across disciplines</td>
-      <td><a href="https://500womenscientists.org/" target="_blank">https://500womenscientists.org/</a></td>
-    </tr>
-    <tr>
-      <td>Anne's List</td>
-      <td>Women systems neuroscientists</td>
-      <td><a href="https://anneslist.net/" target="_blank">AnnesList</a></td>
-    </tr>
-    <tr>
-      <td>Women in Coastal Geoscience and Engineering</td>
-      <td>Aims to inspire, support, and encourage women at all career stages through networking and mentoring</td>
-      <td><a href="https://womenincoastal.org/" target="_blank">WICGE</a></td>
-    </tr>
-    <tr>
-      <td>Women in Earth and Environmental Sciences in Australasia</td>
-      <td>Creating a unified Australasian network of women working in Earth and Environmental Sciences in academia, industry and government</td>
-      <td> <a href="https://www.womeesa.net/" target="_blank">WOMEESA</a></td>
-    </tr>
-    <tr>
-      <td>Global South Climate Database</td>
-      <td>The Global South Climate Database is a publicly available, searchable database of scientists and experts in the fields of climate science, policy and energy.</td>
-      <td><a href="https://www.carbonbrief.org/global-south-climate-database/" target="_blank">Global South Climate Database - Carbon Brief</a></td>
-    </tr>
-    <tr>
-      <td>BIPOC-authored psychology papers</td>
-      <td>A moderated database of papers to help course instructors diversify their syllabi.</td>
-      <td><a href="https://docs.google.com/spreadsheets/d/1i7Eacoyv9VVg2lBbCV-KJZg4nSGvR_VZFOysOyOGG8g/edit?gid=666010790#gid=666010790" target="_blank">BIPOC-authored Psychology Papers - Google Sheets</a></td>
-    </tr>
-    <tr>
-      <td>Black in Neuro</td>
-      <td>Black neuroscientists</td>
-      <td><a href="https://blackinneuro.com/" target="_blank">Black In Neuro</a></td>
-    </tr>
-    <tr>
-      <td>Cite Black authors</td>
-      <td>Black authors across disciplines</td>
-      <td><a href="https://citeblackauthors.com/" target="_blank">Cite Black Authors – A database for academic research by Black authors</a></td>
-    </tr>
-    <tr>
-      <td>BlackComputerHer</td>
-      <td>Black women and girls in computing and tech</td>
-      <td><a href="https://blackcomputeher.org/citeher-bibliography/" target="_blank">citeHER Bibliography (blackcomputeher.org)</a></td>
-    </tr>
-    <tr>
-      <td>Cite Black Women Collective</td>
-      <td>A movement that engages with social media and aesthetic representation (t-shirts) in order to push people to critically rethink the politics of knowledge production by engaging in a radical praxis of citation that acknowledges and honors Black women’s transnational intellectual production. </td>
-      <td><a href="https://web.archive.org/web/20260605205836/http://www.citeblackwomencollective.org/" target="_blank">Cite Black Women. - HOME (citeblackwomencollective.org)</a></td>
-    </tr>
-    <tr>
-      <td>Canadian Black Scientists Network</td>
-      <td>The Canadian Black Scientists Network (CBSN) exists to Elevate, make Visible, Celebrate and Connect Black Canadians in Science, Technology, Engineering, Mathematics & Medicine (STEMM) across sectors.</td>
-      <td><a href="https://blackscientists.ca/" target="_blank">Canadian Black Scientists</a></td>
-    </tr>
-    <tr>
-      <td>BiasWatchNeuro</td>
-      <td>A website that tracks the women:men ratio of invited speakers at neuroscience conferences, workshops, and courses, as well as authors in neuroscience journals and recipients of neuroscience awards.</td>
-      <td><a href="https://biaswatchneuro.com/" target="_blank">biaswatchneuro</a></td>
-    </tr>
-    <tr>
-      <td>500 Queer Scientists</td>
-      <td>Queer scientists</td>
-      <td><a href="https://500queerscientists.com/" target="_blank">https://500queerscientists.com/</a></td>
-    </tr>
-    <tr>
-      <td>The Bee</td>
-      <td>Literary magazine, online platform, podcast, and the heart of a writing community. Our mission is to nurture, publish and promote the best new working-class writing by new and established working-class writers and visual artists.</td>
-      <td><a href="https://thebeemagazine.com/" target="_blank">The Bee - A home for working-class readers and writers</a> <br> <a href="https://newwritingnorth.com/">Home - New Writing North</a></td>
-    </tr>
-    <tr>
-      <td>marginalia</td>
-      <td>Marginalia are committed to […] promoting female, non-gender conforming, POC, LGBTQIA+, differently abled or in any other way not promoted by the status quo in academia.</td>
-      <td><a href="https://www.marginaliascience.com/" target="_blank">https://www.marginaliascience.com/</a></td>
-    </tr>
-    <tr>
-      <td>Reviewer Zero</td>
-      <td>Reviewer Zero aims to transform peer review in psychology and related fields to be more formative and constructive, reducing bias and promoting equity, especially for underserved groups. They provide training for reviewers, develop supportive review practices, and promote diverse research perspectives.	</td>
-      <td><a href="https://www.reviewerzero.net/about" target="_blank">Reviewer Zero - https://www.reviewerzero.net</a></td>
-    </tr>
-    <tr>
-      <td>JANE (Journal/Author Name Estimator)</td>
-      <td>Find papers, journals or authors based on your manuscript title, abstract or keywords. Can be used to find peer reviewers or additional literature to cite.</td>
-      <td><a href="https://jane.biosemantics.org/" target="_blank">JANE: journal/author name estimator - https://jane.biosemantics.org/</a></td>
-    </tr>
-    <tr>
-      <td>Diversity Reading List in Philosophy</td>
-      <td>Diversity in philosophy</td>
-      <td><a href="https://diversityreadinglist.org/" target="_blank">Diversity Reading List – Helping you include authors from under-represented groups in your teaching</a></td>
-    </tr>
-    <tr>
-      <td>Advancing big-team reproducible science through increased representation (ABRIR)</td>
-      <td>ABRIR is a working group that aims to diagnose the unique barriers to leadership & participation in Big-team/Open Science faced by researchers from LMICs (low-to-middle income countries).</td>
-      <td><a href="https://abrirpsy.org/about/abrir-hubs/" target="_blank">https://abrirpsy.org/about/abrir-hubs/</a></td>
-    </tr>
-    <tr>
-      <td>Framework for Open and Reproducible Research Training (FORRT) - Neurodiversity</td>
-      <td>Supporting the messages of both open scholarship and neurodiversity will ensure that the goals of diversity, equity, and inclusion reach across populations and explicitly include neurodivergent people.</td>
-      <td><a href="https://forrt.org/neurodiversity/" target="_blank">https://forrt.org/neurodiversity/</a> <br>Database of neurodivergent authors <br> To submit to the database:  <a href="https://qualtrics.kcl.ac.uk/jfe/form/SV_eLoQdOyAZTDGT7E">Qualtrics Survey | Qualtrics Experience Management</a></td>
-    </tr>
-    <tr>
-      <td>Indigenous Science Network</td>
-      <td>A network promoting First Nation/Indigenous science. Regular newsletters and resources for educators.</td>
-      <td><a href="https://research.acer.edu.au/isn/about.html" target="_blank">https://research.acer.edu.au/isn/about.html</a></td>
-    </tr>
-    <tr>
-      <td>City University of Seattle guide to Finding Indigenous Voices</td>
-      <td>Tips for how to search for Indigenous voices in research</td>
-      <td><a href="https://library.cityu.edu/researchguides/indigenousresources/indigenousvoices" target="_blank">Finding Indigenous Voices - Indigenous Research and Ethics - City University of Seattle Library at City University of Seattle</a></td>
-    </tr>
-    <tr>
-      <td>Advancing Indigenous People in STEM (AISES)</td>
-      <td>AISES is a national nonprofit organization focused on substantially increasing the representation of Indigenous peoples of North America and the Pacific Islands in science, technology, engineering, and math (STEM) studies and careers.</td>
-      <td><a href="https://www.aises.org/" target="_blank">AISES | Advancing Indigenous People in STEM</a></td>
-    </tr>
-    <tr>
-      <td>Anti-colonial research library (ACRL)</td>
-      <td>This Library holds a collection of open-access articles and books, websites, and YouTube videos on Indigenous and anti-colonial research methodologies.</td>
-      <td><a href="https://www.anticolonialresearchlibrary.org/" target="_blank">Anti-Colonial Research Library</a></td>
-    </tr>
-  </tbody>
-</table>
-</div>
-</details>
diff --git a/layouts/shortcodes/welcome.html b/layouts/shortcodes/welcome.html
index 9226f06e009..3bafd5ce74f 100644
--- a/layouts/shortcodes/welcome.html
+++ b/layouts/shortcodes/welcome.html
@@ -1,12 +1,3 @@
-{{ $css := resources.Get "css/welcome.css" }}
-{{ if $css }}
-  {{ $style := $css | minify | fingerprint }}
-  <link rel="stylesheet" href="{{ $style.RelPermalink }}">
-{{ else }}
-  {{ warnf "CSS not found: css/welcome.css. Using static version" }}
-  <link rel="stylesheet" href="{{ "css/welcome.css" | relURL }}">
-{{ end }}
-
 {{/* Getting Started Step Shortcode */}}
 {{ if and (.Get "title") (.Get "step") }}
 <div class="card step-card">
@@ -51,7 +42,9 @@
     </div>
     <div class="resource-description">{{ .Get "description" }}</div>
     <a href="{{ .Get "url" }}" class="resource-button">
-      {{ if hasPrefix (.Get "count") "team-" }}
+      {{ if .Get "button" }}
+      {{ .Get "button" }} <i class="fas fa-arrow-right"></i>
+      {{ else if hasPrefix (.Get "count") "team-" }}
       Explore Teams <i class="fas fa-arrow-right"></i>
       {{ else if eq (.Get "count") "15 teams" }}
       Explore Teams <i class="fas fa-arrow-right"></i>
diff --git a/layouts/shortcodes/youtube.html b/layouts/shortcodes/youtube.html
index ca65e4bed72..6303a0d4acc 100644
--- a/layouts/shortcodes/youtube.html
+++ b/layouts/shortcodes/youtube.html
@@ -1,9 +1,11 @@
-{{ $id := cond .IsNamedParams (.Get "id") (.Get 0) }}
-{{ partial "click_to_load.html" (dict
-  "src" (printf "https://www.youtube-nocookie.com/embed/%s" $id)
-  "link" (printf "https://www.youtube.com/watch?v=%s" $id)
-  "provider" "YouTube (Google)"
-  "label" "This video"
-  "title" (.Get "title" | default "YouTube video")
-  "style" "aspect-ratio: 16 / 9; width: 100%;"
-) }}
+{{/* A YouTube video as a poster and a link. Nothing loads from YouTube until a visitor plays it, from
+     assets/js/doors/site.js. Add each video's poster to static/img/video-thumbnails/<id>.webp; without one
+     the poster is a plain panel. Usage as Hugo's own: {{< youtube ID >}} or {{< youtube id="ID" title="..." >}}. */}}
+{{ $id := .Get "id" | default (.Get 0) }}
+{{ $title := .Get "title" | default (printf "Play video %d on this page" (add .Ordinal 1)) }}
+{{ $poster := printf "img/video-thumbnails/%s.webp" $id }}
+<a class="video-poster" href="https://www.youtube.com/watch?v={{ $id }}" data-video="{{ $id }}" aria-label="{{ $title }}">
+  {{ if fileExists (printf "static/%s" $poster) }}<img src="{{ $poster | relURL }}" width="480" height="360" alt="" loading="lazy">{{ end }}
+  <span class="video-play" aria-hidden="true"><i class="fas fa-play"></i></span>
+</a>
+<p class="video-note">Playing this video loads it from YouTube (Google). See our <a href="{{ "privacy/" | relURL }}#embedded-content">privacy policy</a>.</p>
diff --git a/layouts/tags/list.html b/layouts/tags/list.html
index f540eac398d..287a7fcb7d5 100644
--- a/layouts/tags/list.html
+++ b/layouts/tags/list.html
@@ -4,40 +4,58 @@
      The cloud is server-rendered so the vocabulary is readable, linkable and
      indexable with JavaScript off. Selecting a term reloads with `?tag=`, and
      `static/js/tag-browser.js` fills the result list from `list.json` with every
-     tagged page in any section.
-
-     Renders once per build, so it also publishes the legacy `/tag/<term>/`
-     redirects. */}}
-
-{{/* Assigned, not printed: the partial's only output is loop whitespace. */}}
-{{ $_ := partial "publish_legacy_tag_redirects.html" . }}
+     tagged page in any section. The 404 page sends the old `/tag/<term>/` addresses here. */}}
 
 {{ $tags := partialCached "functions/tag_counts.html" . }}
-{{ $rows := $tags.rows }}
+{{ $rows := $tags.common }}
 
-<div class="universal-wrapper">
-  <h1>{{ .Title }}</h1>
-  {{ with .Params.description }}<p class="lead">{{ . }}</p>{{ end }}
-  <p class="text-muted">
-    {{ len $rows }} tags across {{ $tags.pages }} pages, most used first. Tags are
-    contributor-supplied keywords; for curated topics see
-    <a href="{{ "clusters/" | relURL }}">FORRT clusters</a>.
-  </p>
+<div class="wrap tags-page">
+  <header class="article-head">
+    {{ partial "doors/crumbs" (dict "page" .) }}
+    <h1>{{ .Title }}</h1>
+    {{ with .Params.description }}<p class="standfirst">{{ . }}</p>{{ end }}
+  </header>
+
+  {{/* A search over the listed tags (static/js/tag-browser.js); with JavaScript off it stays hidden. */}}
+  <div class="tag-find" hidden>
+    <label for="tag-filter">Find a tag</label>
+    <input type="search" id="tag-filter" placeholder="e.g. preregistration" autocomplete="off">
+    <p class="tag-filter-count" aria-live="polite"></p>
+  </div>
 
   {{/* Filled by the script when a tag is selected; stays empty otherwise. */}}
-  <div id="tag-results" class="my-4" hidden>
-    <h2 id="tag-results-heading" class="h4"></h2>
-    <ul id="tag-results-list" class="list-unstyled"></ul>
+  <noscript><p class="tags-note">Listing the pages for a tag needs JavaScript. The <a href="{{ "resources/" | relLangURL }}">resources directory</a> lists every resource without it.</p></noscript>
+  <div id="tag-results" hidden>
+    <h2 id="tag-results-heading"></h2>
+    <ul id="tag-results-list" class="plain-list"></ul>
     <p><a href="{{ "tags/" | relURL }}">Show all tags</a></p>
   </div>
 
-  <div id="tag-cloud" class="tag-cloud my-4">
-    {{ range $rows }}
-      <a class="badge badge-light mr-1 mb-1"
-         href="{{ printf "tags/?tag=%s" (.tag | urlquery) | relURL }}"
-         title="{{ .count }} page{{ if ne .count 1 }}s{{ end }}">{{ .tag }}
-        <span class="text-muted">{{ .count }}</span></a>
-    {{ end }}
+  {{/* The twelve most used as larger pills, then the common tags A to Z with letter links. */}}
+  {{ $sorted := sort $rows "tag" }}
+  {{ $groups := slice }}{{ $current := "" }}{{ $items := slice }}
+  {{ range $sorted }}
+    {{ $first := upper (substr (strings.TrimLeft "\"“'#(*[ " .tag) 0 1) }}
+    {{ if not (findRE `^[A-Z]$` $first) }}{{ $first = "#" }}{{ end }}
+    {{ if ne $first $current }}{{ if $items }}{{ $groups = $groups | append (dict "letter" $current "rows" $items) }}{{ end }}{{ $current = $first }}{{ $items = slice }}{{ end }}
+    {{ $items = $items | append . }}
+  {{ end }}
+  {{ if $items }}{{ $groups = $groups | append (dict "letter" $current "rows" $items) }}{{ end }}
+  <div id="tag-cloud">
+    <section class="tag-top">
+      <h2>Most used</h2>
+      <div class="tag-cloud">{{ range first 12 $rows }}<a href="{{ printf "tags/?tag=%s" (.tag | urlquery) | relURL }}">{{ .tag }} <span class="tag-count">{{ .count }}</span></a>{{ end }}</div>
+    </section>
+    <section class="tag-all">
+      <h2>All common tags, A to Z</h2>
+      <nav class="tag-letters" aria-label="Tags by letter">{{ range $groups }}<a href="#tags-{{ .letter | urlize | default "other" }}">{{ .letter }}</a>{{ end }}</nav>
+      {{ range $groups }}
+      <div class="tag-group" id="tags-{{ .letter | urlize | default "other" }}">
+        <h3>{{ .letter }}</h3>
+        <ul>{{ range .rows }}<li><a href="{{ printf "tags/?tag=%s" (.tag | urlquery) | relURL }}">{{ .tag }} <span class="tag-count">{{ .count }}</span></a></li>{{ end }}</ul>
+      </div>
+      {{ end }}
+    </section>
   </div>
 </div>
 {{ end }}
diff --git a/layouts/welcome/single.html b/layouts/welcome/single.html
index f80e760846e..45a96a60134 100644
--- a/layouts/welcome/single.html
+++ b/layouts/welcome/single.html
@@ -1,41 +1,19 @@
 {{- define "main" -}}
-
-<div class="welcome-page">
-  <!-- Hero Section -->
-  <section class="hero-section">
-    <div class="hero-container">
-      <div class="hero-content">
-        <h1 class="hero-title">{{ .Title }}</h1>
-        <p class="hero-description">
-          Welcome to FORRT - your gateway to open and reproducible research practices in education. 
-          Whether you're new to open science or looking to deepen your knowledge, we have resources to support your journey.
-        </p>
-        <div class="hero-buttons">
-          <a href="/" class="hero-btn hero-btn-primary">Get Started</a>
-          <a href="/curated_resources" class="hero-btn hero-btn-secondary">Explore Resources</a>
-        </div>
-      </div>
-    </div>
-  </section>
-
-  <!-- Content Section with Shortcodes -->
+{{/* The welcome page for new members: where to start, the teams and the resources. */}}
+<div class="wrap welcome-page">
+  <header class="article-head">
+    {{ partial "doors/crumbs" (dict "page" .) }}
+    <h1>{{ .Title }}</h1>
+    <p class="standfirst">Your gateway to open and reproducible research practices in education, whether you're new to open science or looking to deepen your knowledge.</p>
+    <p class="welcome-buttons"><a href="{{ "" | relLangURL }}" class="btn btn-primary">Get started</a> <a href="{{ "resources/" | relLangURL }}" class="btn">Explore resources</a></p>
+  </header>
   <div class="welcome-content">
-    {{ .Content }}
+    {{ partial "doors/content" .Content }}
   </div>
-
-  <!-- Community & Support -->
-  <section class="community-section">
-    <div class="community-container">
-      <h2 class="community-title">Join Our Community</h2>
-      <p class="community-description">
-        Connect with educators, researchers, and students passionate about open and reproducible science.
-      </p>
-      <div class="community-buttons">
-        <a href="/about/get-involved" class="community-btn">Get Involved</a>
-        <a href="/about/community" class="community-btn">Community</a>
-      </div>
-    </div>
+  <section class="welcome-community">
+    <h2>Join our community</h2>
+    <p>Connect with educators, researchers, and students passionate about open and reproducible science.</p>
+    <p class="welcome-buttons"><a href="{{ "about/get-involved/" | relLangURL }}" class="btn btn-primary">Get involved</a> <a href="{{ "about/community/" | relLangURL }}" class="btn">Community</a></p>
   </section>
 </div>
-
-{{- end -}}
\ No newline at end of file
+{{- end -}}
diff --git a/scripts/check_seo_html.py b/scripts/check_seo_html.py
index a8b3648f54a..e1aae64a6b2 100644
--- a/scripts/check_seo_html.py
+++ b/scripts/check_seo_html.py
@@ -28,12 +28,31 @@
      non-empty meta description (#864).
   10. No meta description contains a double-escaped entity such as `&amp;ldquo;`
      (#864). Text that merely looks like an entity (`&name;`) is not one.
-  11. The FLoRA page (replication-hub/flora/) contains the FLoRA citation DOI.
-
-Report-only sections (never fail): pages with zero or several <h1>, the
+  11. No page has more than one <h1> (#928).
+  12. Numbered resource subsets have unique, self-canonical metadata and
+      CollectionPage data matching their HTML cards (#868).
+  13. PNG/JPEG social images have matching Open Graph/Twitter URLs, type and
+      positive dimensions (#927). Unsupported formats remain report-only.
+  14. No page inlines more than 200 KB in one <script> (#993). Large data belongs in a
+     separate file the page fetches when it needs it.
+  15. Every citation links to its reference on the same page (#200).
+  16. Every glossary term link points to an existing English glossary page (#227).
+  17. Every link in a visible breadcrumb trail (nav.crumbs) has a non-empty href,
+     so a section that is not rendered cannot leave an empty link in the trail.
+  18. No glossary page's <title> or <h1> shows Markdown emphasis as typed, e.g. "(*p*)".
+  19. No page loads EmailOctopus or reCAPTCHA before a visitor subscribes.
+  20. Cluster pages render publication-title markup (<i>, <em>, <scp>) instead of
+     showing it as literal or escaped text, and at least one cluster page exists.
+  21. The /clusters/ illustration (svg.clusters-map__art) is hidden from assistive technology
+      and holds no tab stop (every link has tabindex="-1"), and every in-page link in the
+      clusters map reaches an id on the page.
+  22. The FLoRA page (replication-hub/flora/) contains the FLoRA citation DOI.
+
+Report-only sections (never fail): pages with no <h1>, the
 site-wide share of images that carry both width and height, pages whose
 og:image is not a PNG or JPEG, and indexable pages whose description repeats
-the homepage's, is shared with another page or contains HTML markup as text.
+the homepage's, is shared with another page, contains HTML markup as text, or
+contains a raw HTTP(S) URL or forrt.org/ path (#987).
 """
 
 import json
@@ -43,13 +62,15 @@
 from collections import Counter
 from html.entities import html5
 from html.parser import HTMLParser
-from urllib.parse import unquote, urlparse
+from urllib.parse import unquote, urljoin, urlparse
 
 MAX_LISTED = 20
+MAX_INLINE_SCRIPT = 200_000  # bytes in one inline <script> (#993)
 # Markup that survived flattening, e.g. an indented HTML block rendered as code.
 HTML_TAG = re.compile(r"</?[A-Za-z][A-Za-z0-9]*(\s[^<>]*)?/?>")
 # Attribute values arrive already unescaped, so any entity left in them was
 # escaped twice in the HTML (e.g. `&amp;ldquo;`).
+DESCRIPTION_URL = re.compile(r"https?://|\bforrt\.org/", re.I)
 LITERAL_ENTITY = re.compile(r"&(#\d+|#x[0-9a-fA-F]+|[A-Za-z][A-Za-z0-9]*);")
 
 
@@ -67,14 +88,41 @@ def __init__(self):
         self._h1_buffer = []
         self.jsonld = []
         self.canonical = None
+        self.title = ""
+        self.resource_links = []
+        self._in_title = False
+        self._in_resource_heading = False
+        self.gloss_terms = []
         self._jsonld_buffer = None
+        self.largest_inline_script = 0
+        self._inline_script = None
+        self.ids = set()
+        self.citations = []
+        self.crumb_links = []
+        self._in_crumbs = False
 
     def handle_starttag(self, tag, attrs):
         attrs = dict(attrs)
+        if tag == "script" and not attrs.get("src"):
+            self._inline_script = 0
+        if attrs.get("id"):
+            self.ids.add(attrs["id"])
+        if tag == "nav" and "crumbs" in (attrs.get("class") or "").split():
+            self._in_crumbs = True
+        if tag == "a" and self._in_crumbs:
+            self.crumb_links.append(attrs.get("href") or "")
+        if tag == "a" and "cite" in attrs.get("class", "").split():
+            self.citations.append(attrs.get("href", ""))
         if tag == "script" and attrs.get("type") == "application/ld+json":
             self._jsonld_buffer = []
         elif tag == "link" and attrs.get("rel") == "canonical":
             self.canonical = attrs.get("href")
+        if tag == "title":
+            self._in_title = True
+        if tag == "h2" and "res-title" in attrs.get("class", "").split():
+            self._in_resource_heading = True
+        if tag == "a" and self._in_resource_heading and attrs.get("href"):
+            self.resource_links.append(attrs["href"])
         if tag == "h1":
             self._h1_depth += 1
         elif tag in ("script", "link"):
@@ -83,6 +131,8 @@ def handle_starttag(self, tag, attrs):
                 self.urls.append(url)
         elif tag == "img":
             self.imgs.append(attrs)
+        elif tag == "a" and "gloss-term" in (attrs.get("class") or "").split():
+            self.gloss_terms.append(attrs.get("href") or "")
         elif tag == "meta":
             self.metas.append(attrs)
             key = attrs.get("property") or attrs.get("name")
@@ -94,9 +144,18 @@ def handle_starttag(self, tag, attrs):
             self.code_classes.append(attrs.get("class") or "")
 
     def handle_endtag(self, tag):
+        if tag == "nav":
+            self._in_crumbs = False
+        if tag == "script" and self._inline_script is not None:
+            self.largest_inline_script = max(self.largest_inline_script, self._inline_script)
+            self._inline_script = None
         if tag == "script" and self._jsonld_buffer is not None:
             self.jsonld.append("".join(self._jsonld_buffer))
             self._jsonld_buffer = None
+        if tag == "title":
+            self._in_title = False
+        if tag == "h2":
+            self._in_resource_heading = False
         if tag == "pre":
             self._in_pre = False
         if tag == "h1" and self._h1_depth > 0:
@@ -105,7 +164,18 @@ def handle_endtag(self, tag):
                 self.h1_texts.append("".join(self._h1_buffer).strip())
                 self._h1_buffer = []
 
+    def close(self):
+        super().close()
+        # A script left open at the end of the file still counts.
+        if self._inline_script is not None:
+            self.largest_inline_script = max(self.largest_inline_script, self._inline_script)
+            self._inline_script = None
+
     def handle_data(self, data):
+        if self._in_title:
+            self.title += data
+        if self._inline_script is not None:
+            self._inline_script += len(data.encode("utf-8"))
         if self._jsonld_buffer is not None:
             self._jsonld_buffer.append(data)
         if self._h1_depth > 0:
@@ -116,6 +186,8 @@ class Page:
     def __init__(self, path, parser):
         self.path = path
         self.h1_texts = parser.h1_texts
+        self.title = parser.title.strip()
+        self.resource_links = parser.resource_links
         self.urls = parser.urls
         self.imgs = parser.imgs
         self.meta = parser.meta
@@ -131,11 +203,16 @@ def __init__(self, path, parser):
         elsewhere = (parser.canonical is not None and
                      unquote(urlparse(parser.canonical).path) != unquote(own))
         # Redirect stubs, noindexed pages and pages canonicalised to another URL
-        # (pagination pages point at page 1) never reach search results as such.
+        # never reach search results as such.
         self.noindex = "noindex" in robots
         self.indexable = not self.noindex and not refresh and not elsewhere
         self.jsonld = parser.jsonld
         self.canonical = parser.canonical
+        self.largest_inline_script = parser.largest_inline_script
+        self.ids = parser.ids
+        self.citations = parser.citations
+        self.gloss_terms = parser.gloss_terms
+        self.crumb_links = parser.crumb_links
 
     def loads(self, needle):
         return any(needle in url for url in self.urls)
@@ -169,11 +246,42 @@ def load_pages(public_dir):
             parser = PageParser()
             with open(full, encoding="utf-8", errors="replace") as handle:
                 parser.feed(handle.read())
+            parser.close()
             pages.append(Page(os.path.relpath(full, public_dir), parser))
     pages.sort(key=lambda page: page.path)
     return pages
 
 
+def check_glossary_links(pages):
+    # Canonical URLs include a preview subfolder when built with --baseURL.
+    english = set()
+    for page in pages:
+        path = page.path.replace(os.sep, "/")
+        if path.startswith("glossary/english/") and path != "glossary/english/index.html":
+            url = urlparse(page.canonical or "/" + path.removesuffix("index.html"))
+            english.add((url.netloc, unquote(url.path)))
+    failures = []
+    for page in pages:
+        path = page.path.replace(os.sep, "/")
+        for href in page.gloss_terms:
+            url = urlparse(urljoin(page.canonical or "/" + path, href))
+            if not href or url.scheme not in ("", "http", "https") or (url.netloc, unquote(url.path)) not in english:
+                failures.append("%s (%s)" % (page.path, href or "missing href"))
+    return failures
+
+
+# Paired asterisks around text: Markdown emphasis shown as typed. Asterisks inside a word
+# ("G*Power", "P*Hack") are not delimiters.
+LITERAL_EMPHASIS = re.compile(r"(?<!\w)\*[^*\s](?:[^*]*[^*\s])?\*(?!\w)")
+
+
+def check_glossary_title_markdown(pages):
+    """Glossary titles such as "Research Contribution Metric (*p*)" must render, not show asterisks."""
+    return [p.path for p in pages
+            if p.path.replace(os.sep, "/").startswith("glossary/")
+            and any(LITERAL_EMPHASIS.search(text) for text in [p.title, *p.h1_texts])]
+
+
 def check_no_search_heading(pages):
     return [p.path for p in pages if any(t.lower() == "search" for t in p.h1_texts)]
 
@@ -232,6 +340,32 @@ def check_img_alt(pages):
             for p in pages if p.imgs_without_alt]
 
 
+# Escaped once (&lt;i&gt;) or twice (&amp;lt;i&amp;gt;), or a raw <scp> no browser styles.
+LITERAL_TITLE_MARKUP = re.compile(r"&(?:amp;)?lt;/?(?:i|em|scp)&(?:amp;)?gt;|</?scp>", re.IGNORECASE)
+
+
+def check_cluster_title_markup(public_dir):
+    """Cluster pages render publication-title markup (clusters/rich_text.html), never show it."""
+    clusters_dir = os.path.join(public_dir, "clusters")
+    found, scanned = [], 0
+    for root, _dirs, files in os.walk(clusters_dir):
+        if "index.html" in files:
+            scanned += 1
+            full = os.path.join(root, "index.html")
+            with open(full, encoding="utf-8", errors="replace") as handle:
+                if LITERAL_TITLE_MARKUP.search(handle.read()):
+                    found.append(os.path.relpath(full, public_dir))
+    if not scanned:
+        return ["clusters/ (no cluster pages found)"]
+    return sorted(found)
+
+
+def check_citation_targets(pages):
+    return ["%s (%s)" % (p.path, href or "missing href")
+            for p in pages for href in p.citations
+            if not href.startswith("#ref-") or unquote(href[1:]) not in p.ids]
+
+
 def breadcrumb_lists(page):
     """BreadcrumbList objects in the page's JSON-LD, top level or in @graph.
     Blocks that do not parse are returned as None so the check can flag them."""
@@ -346,6 +480,97 @@ def check_description_entities(pages):
     return failures
 
 
+
+def check_description_urls(pages):
+    return [p.path for p in pages
+            if p.indexable and any(DESCRIPTION_URL.search(d) for d in p.descriptions)]
+
+
+def check_share_image_metadata(pages):
+    failures = []
+    for p in pages:
+        image = p.meta.get("og:image", "")
+        if not is_share_format(image):
+            continue  # Undecodable originals and standalone pages are reported below.
+        expected_type = "image/png" if urlparse(image).path.lower().endswith(".png") else "image/jpeg"
+        problems = []
+        if p.meta.get("twitter:image") != image:
+            problems.append("Open Graph and Twitter images differ")
+        if p.meta.get("og:image:type") != expected_type:
+            problems.append("incorrect image type")
+        for key in ("og:image:width", "og:image:height"):
+            value = p.meta.get(key, "")
+            if not value.isdigit() or int(value) <= 0:
+                problems.append("missing or invalid " + key)
+        if problems:
+            failures.append("%s (%s)" % (p.path, ", ".join(problems)))
+    return failures
+
+
+def check_resource_pagination(pages):
+    """Check the directory and every numbered subset, including preview base paths."""
+    directory = next((p for p in pages if p.path == os.path.join("resources", "index.html")), None)
+    if directory is None:
+        return []  # This check also supports small fixtures with no directory.
+    failures = []
+    titles, descriptions = set(), set()
+    root = (directory.canonical or "").rstrip("/") + "/"
+    for p in pages:
+        match = re.fullmatch(r"resources/page/([2-9]|[1-9]\d+)/index\.html", p.path.replace(os.sep, "/"))
+        if p is not directory and not match:
+            continue
+        number = int(match[1]) if match else 1
+        expected = root if number == 1 else root + "page/%d/" % number
+        problems = []
+        if not directory.canonical or p.canonical != expected:
+            problems.append("not self-canonical")
+        if p.meta.get("og:url") != expected:
+            problems.append("og:url does not match canonical")
+        if p.noindex != directory.noindex:
+            problems.append("subset robots metadata differs from the directory")
+        for label, value, seen in (("title", p.title, titles),
+                                   ("description", next(iter(p.descriptions), ""), descriptions)):
+            if not value or value in seen:
+                problems.append("empty or repeated " + label)
+            seen.add(value)
+        if p.meta.get("og:title") != p.title:
+            problems.append("og:title does not match title")
+        if number > 1 and ("Page %d" % number not in p.title
+                           or "page %d" % number not in next(iter(p.descriptions), "")):
+            problems.append("metadata omits page number")
+        try:
+            blocks = [json.loads(block) for block in p.jsonld]
+            collections = [block for block in blocks if isinstance(block, dict)
+                           and block.get("@type") == "CollectionPage"]
+        except ValueError:
+            collections = []
+        if len(collections) != 1:
+            problems.append("missing CollectionPage")
+        else:
+            collection = collections[0]
+            if (collection.get("url") != expected
+                    or collection.get("@id") != expected + "#collection"
+                    or collection.get("name") != p.title.rsplit(" | ", 1)[0]):
+                problems.append("CollectionPage URL/name does not match metadata")
+            items = collection.get("mainEntity", {})
+            listed = items.get("itemListElement", [])
+            links = [urlparse(item.get("url", "")).path for item in listed]
+            if (not p.resource_links or links != p.resource_links
+                    or items.get("numberOfItems") != len(p.resource_links)):
+                problems.append("CollectionPage subset does not match HTML cards")
+        if problems:
+            failures.append("%s (%s)" % (p.path, ", ".join(problems)))
+    return failures
+def check_third_party_forms(pages):
+    """The newsletter form loads reCAPTCHA and posts to EmailOctopus only when a visitor subscribes."""
+    return sorted(p.path for p in pages if p.loads("recaptcha") or p.loads("eocampaign1.com"))
+
+
+def check_inline_scripts(pages):
+    return ["%s (%d KB)" % (p.path, p.largest_inline_script // 1000) for p in pages
+            if p.largest_inline_script > MAX_INLINE_SCRIPT]
+
+
 FLORA_PAGE = "replication-hub/flora/index.html"
 
 
@@ -389,9 +614,55 @@ def print_items(title, items):
         print("      +%d more" % (len(items) - MAX_LISTED))
 
 
-def check_third_party_forms(pages):
-    """The newsletter form loads reCAPTCHA and posts to EmailOctopus only when a visitor subscribes."""
-    return sorted(p.path for p in pages if p.loads("recaptcha") or p.loads("eocampaign1.com"))
+class ClustersMapParser(HTMLParser):
+    """Ids on the page, the illustration's attributes and links, and every in-page link in the map."""
+
+    def __init__(self):
+        super().__init__(convert_charrefs=True)
+        self.ids, self.arts, self.art_links, self.map_hrefs = set(), [], [], []
+        self.stack = []  # (tag, in_art, in_map) for open elements
+
+    def handle_starttag(self, tag, attrs):
+        attrs = dict(attrs)
+        if attrs.get("id"):
+            self.ids.add(attrs["id"])
+        classes = (attrs.get("class") or "").split()
+        in_art = (self.stack[-1][1] if self.stack else False) or (tag == "svg" and "clusters-map__art" in classes)
+        in_map = (self.stack[-1][2] if self.stack else False) or "clusters-map" in classes
+        if tag == "svg" and "clusters-map__art" in classes:
+            self.arts.append(attrs)
+        if tag == "a" and in_art:
+            self.art_links.append(attrs)
+        if tag == "a" and in_map and (attrs.get("href") or "").startswith("#"):
+            self.map_hrefs.append(attrs["href"])
+        if tag not in ("path", "rect", "circle", "image", "tspan", "br", "img", "input", "meta", "link"):
+            self.stack.append((tag, in_art, in_map))
+
+    def handle_endtag(self, tag):
+        for i in range(len(self.stack) - 1, -1, -1):
+            if self.stack[i][0] == tag:
+                del self.stack[i:]
+                break
+
+
+def check_clusters_map(public_dir):
+    path = os.path.join(public_dir, "clusters", "index.html")
+    if not os.path.exists(path):
+        return []
+    parser = ClustersMapParser()
+    with open(path, encoding="utf-8", errors="replace") as handle:
+        parser.feed(handle.read())
+    failures = []
+    if not parser.arts:
+        failures.append("clusters/index.html: no svg.clusters-map__art")
+    failures += ["clusters/index.html: the illustration is not aria-hidden"
+                 for art in parser.arts if art.get("aria-hidden") != "true"]
+    stops = [a.get("href", "") for a in parser.art_links if a.get("tabindex") != "-1"]
+    if stops:
+        failures.append("clusters/index.html: %d links in the illustration are tab stops, e.g. %s" % (len(stops), stops[0]))
+    missing = sorted({h for h in parser.map_hrefs if unquote(h[1:]) not in parser.ids})
+    failures += ["clusters/index.html: %s has no target" % h for h in missing]
+    return failures
 
 
 def main(public_dir):
@@ -401,6 +672,7 @@ def main(public_dir):
 
     results = {
         '1. no <h1>Search</h1>': check_no_search_heading(pages),
+        "18. glossary titles show no Markdown asterisks": check_glossary_title_markdown(pages),
         "2. homepage free of mermaid/highlight.js assets": check_homepage_assets(home),
         "4. every <img> has an alt attribute": check_img_alt(pages),
         "5. every homepage <img> has width and height": check_homepage_img_dims(home),
@@ -408,7 +680,17 @@ def main(public_dir):
         "7. breadcrumb JSON-LD is well formed": check_breadcrumbs(pages),
         "9. every indexable page has a meta description": check_description_present(pages),
         "10. no double-escaped entity in a meta description": check_description_entities(pages),
-        "11. FLoRA page shows the citation": check_flora_citation(public_dir),
+        "11. no page has several <h1>": [p.path for p in pages if len(p.h1_texts) > 1],
+        "12. resource subsets have consistent, unique metadata": check_resource_pagination(pages),
+        "13. compatible social images have type, dimensions and matching URLs": check_share_image_metadata(pages),
+        "14. no inline <script> over 200 KB": check_inline_scripts(pages),
+        "15. every citation has a local reference target": check_citation_targets(pages),
+        "16. glossary links reach existing English terms": check_glossary_links(pages),
+        "17. every breadcrumb link has a target": [p.path for p in pages if any(not h.strip() for h in p.crumb_links)],
+        "19. no page loads EmailOctopus or reCAPTCHA before a visitor subscribes": check_third_party_forms(pages),
+        "20. cluster pages show no literal <i>/<em>/<scp> title markup": check_cluster_title_markup(public_dir),
+        "21. the clusters illustration holds no tab stop and its links have targets": check_clusters_map(public_dir),
+        "22. FLoRA page shows the citation": check_flora_citation(public_dir),
     }
     conditional = check_conditional_assets(pages)
     results["3. conditional highlight.js / mermaid loading"] = [
@@ -435,7 +717,6 @@ def main(public_dir):
 
     print("\nReport only (never fails)")
     print_items("pages with no <h1>", [p.path for p in pages if not p.h1_texts])
-    print_items("pages with several <h1>", [p.path for p in pages if len(p.h1_texts) > 1])
     all_imgs = sum(len(p.imgs) for p in pages)
     unsized = sum(len(p.imgs_without_dims) for p in pages)
     if all_imgs:
@@ -444,6 +725,7 @@ def main(public_dir):
     print_items("pages whose og:image is not PNG/JPEG",
                 ["%s (%s)" % (p.path, p.meta["og:image"]) for p in pages
                  if p.meta.get("og:image") and not is_share_format(p.meta["og:image"])])
+    print_items("pages whose meta description contains a raw URL", check_description_urls(pages))
     description_report(pages, home)
 
     return 1 if any(results.values()) else 0
diff --git a/scripts/generate_cluster_pages.py b/scripts/generate_cluster_pages.py
index 88e95059cef..9e2270c03dc 100644
--- a/scripts/generate_cluster_pages.py
+++ b/scripts/generate_cluster_pages.py
@@ -1,5 +1,9 @@
 #!/usr/bin/env python3
-"""Generate content/clusters/cluster-N/index.md from data/clusters_v4.json (re-run after JSON changes)."""
+"""Generate content/clusters/cluster-N/index.md from data/clusters_v4.json (re-run after JSON changes).
+
+The /clusters/ share image is rendered separately: after the clusters change, rebuild the
+site and run scripts/render_clusters_share_image.py <build-dir>.
+"""
 from __future__ import annotations
 
 import json
diff --git a/scripts/generate_sc_profiles.py b/scripts/generate_sc_profiles.py
index 4e059901048..8b783a059a9 100755
--- a/scripts/generate_sc_profiles.py
+++ b/scripts/generate_sc_profiles.py
@@ -91,16 +91,15 @@
 <link rel="stylesheet" href="/css/steering-committee.css">
 
 <div id="sc-container" class="col-lg-12">
-    <h1 class="sc-page-title">Steering Committee</h1>
     <nav class="sc-nav">
         <a href="#strategic">Strategic Focus Areas</a>
         <a href="#operations">Operations & Stewardship</a>
         <a href="#steering">Strategic Facilitation & Integration</a>
         <a href="#guidance">Guidance & Oversight</a>
     </nav>
-    <main>
+    <div>
         __CONTENT__
-    </main>
+    </div>
     <div id="modals-container">
         __MODALS__
     </div>
@@ -282,6 +281,14 @@ def find_existing_author_dir(personal_name, authors_dir):
     sources disagrees with what's already on disk.
     """
     normalized_target = normalize_name(personal_name)
+    # Some folders run the words together ("ruthvanderhallenphd"), which similarity undervalues.
+    compact_target = re.sub(r'[^a-z0-9]', '', normalized_target)
+    compact_matches = [
+        existing_dir.name for existing_dir in authors_dir.iterdir()
+        if existing_dir.is_dir() and re.sub(r'[^a-z0-9]', '', normalize_name(existing_dir.name)) == compact_target
+    ]
+    if len(compact_matches) == 1:
+        return compact_matches[0]
     best_match = None
     # 0.9 is deliberately strict: legitimate spelling variants of the SAME person
     # (Dr prefix, missing middle initial, hyphen vs space in a surname) all score >=0.95
diff --git a/scripts/rebrand/README.md b/scripts/rebrand/README.md
new file mode 100644
index 00000000000..11ccaad3163
--- /dev/null
+++ b/scripts/rebrand/README.md
@@ -0,0 +1,46 @@
+# Doors redesign checks
+
+Tools for the long-lived `rebrand-doors` branch, which moves forrt.org to the Doors design. The branch stays a draft PR until launch; its preview is at <https://forrt.org/rebrand-doors/>.
+
+Only `check_preview.py --production` runs against production, after launch; everything else checks the branch, its builds or the preview. Delete this folder after launch unless a check has been promoted into the normal workflows.
+
+## What runs on every push and PR
+
+`.github/workflows/rebrand-preview.yaml` builds the branch and its merge base with `main` from the same data and announcement artifacts as `deploy.yaml`, with Hugo 0.158.0 and `HUGO_ENV=staging`, and then runs:
+
+| Check | Script | Fails when |
+|---|---|---|
+| Source rules | `check_source_rules.py` | A template or menu hard-codes one of this site's own forrt.org URLs (use `relref`), or the branch edits a generated path |
+| Builds compared | `compare_builds.py` | A page, feed or data file appears or goes, a structured-data count falls, JSON-LD is invalid, or a page's SEO tags change |
+| Internal links | `check_internal_links.py` | A link broken here is not also broken at the merge base. Lychee excludes forrt.org, so nothing else checks these |
+| Built HTML | `../check_seo_html.py` | The site's standing rules on headings, conditional assets, image `alt` and home-page images |
+| Designed screens | `check_design.py` | On the designed screens and every page on the reading layout (a sample of the three large collections): sideways overflow, italics, line length, small text, low contrast, broken images or more than one `h1`; an icon outside the subset or a theme asset loaded anywhere; the home page's topics too far down (A14), layout shift, pause control or the resources directory misbehaving; a call-out over the text, the card or another call-out; the chat launcher, its invitation or label, or back to top over text, a card or a control at any of several scroll positions (below 1440 px, where the launcher and back to top float in the corner, over each other mid-page or over anything at the end), or the invitation showing nowhere; specialist resources shown on a cluster page while their box is unticked; the conference programme's day tabs, abstract dialog or width misbehaving, or any of its days failing the audit with JavaScript off; the contributor network off centre or too small on its canvas, reaching another site, or not answering to its search boxes, pointer, keyboard or reduced motion; an abstract toggle that does not say Hide when open, panel text wider than the reading measure on `/clusters/` or `/disciplines/`, the booklet turning to a spread at 390 px, or the community map opening at 390 px without its members in view or unable to zoom out |
+| Accessibility rules | `check_axe.py` | axe-core reports a Level A or AA problem on a sample page at 390 or 1440 px, apart from the provider's markup listed in `KNOWN` |
+
+Pushes also run `preview_paths.py`, which prefixes root-relative paths for the subfolder and adds noindex to every HTML file, and then deploy. A failed check marks the run red but does not hold the preview back. Tests are in `../tests/test_rebrand_checks.py`.
+
+Agreed exceptions go in `allowed_changes.txt` (URL list) and `link_allowlist.txt` (retired paths the 404 page redirects), with a comment saying why. `link_allowlist.txt` does not exist yet, because no exception has been agreed.
+
+## Baseline
+
+`baseline/` records `main` before the redesign, built with Hugo 0.158.0 and the production artifacts of the same day. `baseline/README.md` has the commit and date. The files are `paths.txt`, `structured_data.json`, `seo_heads.json` and `weights.json`. Screenshots of `sample_pages.json` at 390, 1024 and 1440 px are on the [`baseline` branch of forrtproject/rebrand-doors](https://github.com/forrtproject/rebrand-doors/tree/baseline), to keep them out of this repository.
+
+CI compares against a fresh build of the merge base and not these files, because generated collections change daily. The baseline is the fixed record for before-and-after comparison.
+
+To recapture from a checkout of `main` with the artifacts applied (`apply_artifacts.sh`), using Hugo 0.158.0 and `git config core.quotepath false`. Python needs `playwright` and `pillow`:
+
+```sh
+HUGO_ENV=production hugo --gc --minify --cleanDestinationDir --destination /tmp/public-main
+python3 scripts/rebrand/site_inventory.py /tmp/public-main --out scripts/rebrand/baseline
+python3 scripts/rebrand/capture_pages.py /tmp/public-main --out /tmp/baseline-shots
+```
+
+## Other tools
+
+- `check_preview.py` checks the deployed preview in a browser: one URL per rule in the 404 table, a sample of links and assets, noindex, search, and that the newsletter form loads on a click and not before. After launch, `check_preview.py --production` runs the same checks on <https://forrt.org/> and instead requires that sampled pages carry no noindex and that their canonical URLs sit on the root domain and outside `/rebrand-doors/`. Redirects and search results must also stay on that origin. A retired path that names a sister site lands on that site there, because its own repository answers first.
+- `rehearse_launch.py --work <dir> [--doors-ref <ref>]` rehearses the launch without pushing anything. It merges the branch into a throwaway branch from `main` with `--no-ff`, builds that merge and `main` as `deploy.yaml` does (production artifacts, Hugo 0.158.0, `HUGO_ENV=production`), and runs `deploy.yaml`'s checks and `compare_builds.py` on both. It then checks noindex, canonical URLs, the sitemap and leftover `/rebrand-doors` paths, rebuilds without any data-artifact file that would revert a Doors change, and loads sample pages on localhost to list requests to other hosts. Results go to `<dir>/summary.json`; everything else is deleted unless `--keep` is given.
+- `check_design.py` checks the designed screens in a browser, on a build or the preview, in Chromium by default and with `--browser firefox` or `--browser webkit` in the others: overflow, also on the sample pages, italics, line length, one `h1`, hidden buttons, and the resources directory's filters, address, search and pages. On a build it also sweeps the reading layout's pages, including for empty space beside the text, and scans for icons and theme assets.
+- `screenshot_pages.py <public-dir | address> --out <dir>` shoots the sample pages, or `--paths`, at phone (390 px) and desktop (1440 px) size for design review, with the cookie banner answered, and cuts each page into tiles about two screens tall so text stays legible. `manifest.json` lists the tiles.
+- `capture_pages.py` also weighs and screenshots a preview build with `--base /rebrand-doors/`.
+- `build_fonts.py` rebuilds `static/fonts/doors/`, and with `--icons` the subset of Font Awesome and `assets/css/doors/icons.css`. Add a new icon to its `ICONS` list.
+- `render_castle_still.py` rerenders the home page's still image.
diff --git a/scripts/rebrand/allowed_changes.txt b/scripts/rebrand/allowed_changes.txt
new file mode 100644
index 00000000000..7813aa5bab4
--- /dev/null
+++ b/scripts/rebrand/allowed_changes.txt
@@ -0,0 +1,60 @@
+# Paths allowed to differ from main, one normalised path or glob per line. Say why.
+fonts/doors/Newsreader-OFL.txt   # Licence beside the self-hosted font, not a page
+fonts/doors/SourceSans3-OFL.txt  # Licence beside the self-hosted font, not a page
+fonts/doors/FontAwesome-LICENSE.txt  # Licence beside the self-hosted icon subset, not a page
+resources/page/*/index.html  # Crawlable pages of the directory (D16, #868). Their number follows the collection
+resources/directory.json     # The directory's filter data (D16, #868)
+resources/search.json        # The directory's search data, fetched on first search (D16, #868)
+resources/index.html         # Became a list page for its pager, so its SEO tags gain CollectionPage
+home/7-newsletter.md.old     # A retired draft that Hugo copied out by accident, not a page
+resources/resource.py  # #976: generator script (or draft) Hugo published by accident, not a page
+summaries/summaries.py  # #976: generator script (or draft) Hugo published by accident, not a page
+glossary/_create_glossaries.py  # #976: generator script (or draft) Hugo published by accident, not a page
+glossary/_build_references.py  # #976: generator script (or draft) Hugo published by accident, not a page
+replication-hub/submit/submit.mdOUT  # #976: generator script (or draft) Hugo published by accident, not a page
+data/pub_cards.*.json        # #993: the clusters pages' publication cards, fetched on demand instead of inlined
+about/visitors/index.html    # Its generated description quotes the stats table, whose link text lost "https://" for the preview
+js/newsletter.js                 # Main's old newsletter form script; the Doors footer form (doors/newsletter.html) replaces it
+js/load-theme.js                 # The theme's day/night script, gone with the theme's look
+js/academic.min.FINGERPRINT.js   # The theme's script bundle, without its search, under a new name while some pages still need it
+curated_resources/page/*/index.html  # Decision D17: paginated lists removed, and the 404 page sends old links to /resources/
+forrt_clusters/*/page/*/index.html   # Decision D17: paginated lists removed, and the 404 page sends old links to the cluster's page
+tag/index.html                       # The migration plan's one 404 rule replaces the /tag/ stubs
+tag/*/index.html                     # The migration plan's one 404 rule replaces the /tag/ stubs
+tag/*/*/index.html                   # The same, for the one tag with a slash in it
+css/academic.css                 # The theme's stylesheet: no template needs it
+css/academic.min.FINGERPRINT.css # The same stylesheet under its production name, which only rehearse_launch.py's builds show
+css/404.min.FINGERPRINT.css      # Folded into the Doors stylesheet
+css/welcome.min.FINGERPRINT.css  # Folded into the Doors stylesheet
+css/citations.min.FINGERPRINT.css  # The old toolkit stylesheet, replaced by css/doors/toolkit.css
+post/*/featured_hu.jpg           # The page's resized image is now WebP, so its generated copy has a new name
+post/*/featured_hu.png           # The same
+ai-metascience/featured_hu.png   # The same
+coc/index.html  # Its title was empty (" | FORRT"), and it now says Code of Conduct
+glossary/english/research_contribution_metric__p_/index.html  # #1085: glossary titles render their Markdown, so the <title>, og:title and JSON-LD name read "(p)" instead of "(*p*)"
+glossary/german/p/index.html  # #1085: glossary titles render their Markdown, so the <title>, og:title and JSON-LD name read "(p)" instead of "(*p*)"
+glossary/arabic/مقياس_المساهمة_البحثي_ة_نشر/index.html  # #1085: glossary titles render their Markdown, so the <title>, og:title and JSON-LD name read "(p)" instead of "(*p*)"
+glossary/arabic/p_مقياس_المساهمة_البحثي_ة_نشر/index.html  # #1085: the same Arabic page under the older slug that the content committed on this branch still uses
+glossary/chinese/研究贡献指标_p_/index.html  # #1085: glossary titles render their Markdown, so the <title>, og:title and JSON-LD name read "(p)" instead of "(*p*)"
+glossary/turkish/bilimsel_katkı_olcutu_p_/index.html  # #1085: glossary titles render their Markdown, so the <title>, og:title and JSON-LD name read "(p)" instead of "(*p*)"
+about/charity/gep/index.html  # #973: redirect from the address printed in the GEP PDF to /about/charity/, not a page
+data/glossary-terms.*.json  # Build-time English glossary lookup, fetched on first term interaction (#227); not a page
+cv/index.html  # Retitled as a CV template in the content review (#1079). Exempts all its SEO tags: remove once main has the new title
+# Content-review changes made on rebrand-doors only. Each entry exempts all of that page's SEO tags: remove it once main has the change (at the latest at launch).
+about/index.html           # Content review (ha-about-redirect-text): /about/ is now an alias redirect to /about/us/, not a list page
+about/index.xml            # The same: the unrendered About section has no feed
+about/page/1/index.html    # The same: the About list page and its pager are gone
+about/page/2/index.html    # The same
+equityinos/index.html      # Content review (init-eq-04): title is now "Equity in Open Scholarship"
+impact/index.html          # Content review (nexus-impact-recently): description no longer opens with "Recently"
+mapping_os/index.html      # Content review (init-mo-03): description uses the name "Mapping Open Science Communities"
+pedagogies/004-thomas-rhys-evans/index.html  # Content review (nexus-pedagogies-evan-name): summary spells "Evans" correctly
+welcome/index.html         # Content review (sol-welcome-counters): description drops the outdated list of teams
+about/teams/index.html     # Content review (community-teams-intro-grammar): description's list of purposes made grammatical
+educators-corner/018-accessible-feedback-in-research/index.html  # Review of #1078: its authors are listed one per entry, so its author data changes
+privacy/index.html  # #1096: the policy describes the native newsletter form, so its 'Last updated' description and modified time change
+about/get-involved/index.html  # #1118: its description is now a written summary, not the opening link text
+awop/index.html                # #1118: its description is now a written summary, not the opening link text
+reversals/index.html           # #1118: its description now opens with the concluded-project note at the top of the page
+tags/index.html                # #1118: its description says in one sentence what tags are for
+submit/index.html               # #1133: a new page listing the ways to submit work to FORRT
diff --git a/scripts/rebrand/apply_artifacts.sh b/scripts/rebrand/apply_artifacts.sh
new file mode 100755
index 00000000000..c1c1277fc39
--- /dev/null
+++ b/scripts/rebrand/apply_artifacts.sh
@@ -0,0 +1,26 @@
+#!/usr/bin/env bash
+# Overlay the production data and announcement artifacts on a checkout, the way
+# deploy.yaml does: clear the curated-resource seed first, and replace announcement
+# bundles only when a tarball exists, so rows removed from a sheet cannot survive.
+#
+# Usage: apply_artifacts.sh <checkout> <data-artifact-dir> <announcements-artifact-dir>
+set -euo pipefail
+
+checkout=$1
+data_dir=$2
+announcements_dir=$3
+
+find "$checkout/content/curated_resources" -maxdepth 1 -type f ! -name '_index.md' -delete
+
+if [ -d "$data_dir/content" ] || [ -d "$data_dir/data" ]; then
+  cp -R "$data_dir/." "$checkout/"
+else
+  echo "::warning::No data artifact; building from the committed seed copies."
+fi
+
+if [ -f "$announcements_dir/announcements.tar.gz" ]; then
+  find "$checkout/content/post" -mindepth 1 -maxdepth 1 -type d -exec rm -rf {} +
+  tar xzf "$announcements_dir/announcements.tar.gz" -C "$checkout"
+else
+  echo "::warning::No announcements artifact; keeping the committed posts."
+fi
diff --git a/scripts/rebrand/baseline/README.md b/scripts/rebrand/baseline/README.md
new file mode 100644
index 00000000000..9c86a37ccd0
--- /dev/null
+++ b/scripts/rebrand/baseline/README.md
@@ -0,0 +1,14 @@
+# Baseline: forrt.org before the Doors redesign
+
+Built on 3 November 2026 from `main` at `f8425848db462a87a11f86f55b035e8deeb48cc6`, with Hugo 0.158.0 extended, `HUGO_ENV=production` and the production data and announcement artifacts of that day. An earlier build by the same steps, at `ed4633e`, matched the deployed `gh-pages` branch file for file, apart from `CNAME`, `.nojekyll` and `media/.gitkeep`.
+
+| File | Contents |
+|---|---|
+| `paths.txt` | Every output file, with build-specific hashes normalised |
+| `structured_data.json` | JSON-LD records by type and template group, with page counts |
+| `seo_heads.json` | A digest of each page's title, description, canonical, hreflang, robots, sharing tags and JSON-LD |
+| `weights.json` | Sample pages from `../sample_pages.json`: compressed bytes (own and third-party), requests, hosts, DOM size, JavaScript errors, sideways overflow |
+
+Own files are weighed at their gzip size. Third-party figures include embeds such as YouTube, so they vary between runs.
+
+Template groups come from paths and are an approximation: widget and plain pages share one group, because the built output does not show which template made them.
diff --git a/scripts/rebrand/baseline/paths.txt b/scripts/rebrand/baseline/paths.txt
new file mode 100644
index 00000000000..cd1b29d6b73
--- /dev/null
+++ b/scripts/rebrand/baseline/paths.txt
@@ -0,0 +1,6471 @@
+404.html
+about/charity/forrt-gep.pdf
+about/charity/index.html
+about/cite_us/index.html
+about/community/index.html
+about/confidential-advisor-ombuds/index.html
+about/get-involved/index.html
+about/index.html
+about/index.xml
+about/mission/index.html
+about/page/1/index.html
+about/page/2/index.html
+about/partnerships/index.html
+about/partnerships/logos/2025_04_09_FORRT_Flavio_Azevedo_.pdf
+about/partnerships/logos/A2P.webp
+about/partnerships/logos/ABRIR.webp
+about/partnerships/logos/AIMOS.webp
+about/partnerships/logos/AREN.webp
+about/partnerships/logos/BITS.webp
+about/partnerships/logos/COSiE.webp
+about/partnerships/logos/CREP.png.webp
+about/partnerships/logos/CREP.webp
+about/partnerships/logos/CollectiveLibrary.webp
+about/partnerships/logos/FeministWonderLabCollective_Logo.webp
+about/partnerships/logos/Klein_logo_OSCU.webp
+about/partnerships/logos/LOGO-BRRN.webp
+about/partnerships/logos/Logo_PCI-PCJ-full.webp
+about/partnerships/logos/MD.webp
+about/partnerships/logos/NERQ.webp
+about/partnerships/logos/OLS.webp
+about/partnerships/logos/OSC_Logo.webp
+about/partnerships/logos/PAPORTRAIL.webp
+about/partnerships/logos/ProjectTier.webp
+about/partnerships/logos/QualaLab.webp
+about/partnerships/logos/RN_German.webp
+about/partnerships/logos/ReplicationWiki.webp
+about/partnerships/logos/SIPS.webp
+about/partnerships/logos/UKRN.webp
+about/partnerships/logos/UN.webp
+about/partnerships/logos/UNESCO.webp
+about/partnerships/logos/University-of-Portsmouth-logo.webp
+about/partnerships/logos/Utrecht-University.webp
+about/partnerships/logos/bitss.webp
+about/partnerships/logos/cos.webp
+about/partnerships/logos/dra.webp
+about/partnerships/logos/gate_logo.webp
+about/partnerships/logos/iRISE.webp
+about/partnerships/logos/icor.webp
+about/partnerships/logos/jrp.webp
+about/partnerships/logos/liberate-science.webp
+about/partnerships/logos/mucos_logo.webp
+about/partnerships/logos/nowherelab.webp
+about/partnerships/logos/rainbowR.webp
+about/partnerships/logos/reproducibilitea.webp
+about/partnerships/logos/rose_logo.webp
+about/partnerships/logos/rtea_bordeaux.webp
+about/partnerships/pdf/nominatie_FORRT.pdf
+about/principles/index.html
+about/steering-committee/index.html
+about/teams/index.html
+about/us/index.html
+about/visitors/index.html
+academicons/css/academicons.css
+academicons/css/academicons.min.css
+academicons/fonts/academicons.eot
+academicons/fonts/academicons.svg
+academicons/fonts/academicons.ttf
+academicons/fonts/academicons.woff
+admin/config.yml
+admin/index.html
+adopting/index.html
+ai-metascience/featured.png
+ai-metascience/featured_hu.png
+ai-metascience/index.html
+annotator/index.html
+antarctica.geojson
+apps/awop_app.html
+apps/community_map.html
+apps/flora_annotator.html
+apps/forrt-map.html
+apps/fred_annotator.html
+apps/fred_explorer.html
+apps/open_research_games_portal.html
+apps/os_map.html
+apps/re-searchterms.html
+authors/adam-partridge/avatar.webp
+authors/adam-partridge/avatar_hu.webp
+authors/adam-partridge/index.html
+authors/adam-partridge/index.xml
+authors/adira-daniel/avatar.webp
+authors/adira-daniel/avatar_hu.webp
+authors/adira-daniel/index.html
+authors/adira-daniel/index.xml
+authors/alaa-aldoh/avatar.webp
+authors/alaa-aldoh/avatar_hu.webp
+authors/alaa-aldoh/index.html
+authors/alaa-aldoh/index.xml
+authors/aleksandra-lazic/avatar.webp
+authors/aleksandra-lazic/avatar_hu.webp
+authors/aleksandra-lazic/index.html
+authors/aleksandra-lazic/index.xml
+authors/alexander-hart/avatar.webp
+authors/alexander-hart/avatar_hu.webp
+authors/alexander-hart/index.html
+authors/alexander-hart/index.xml
+authors/alice-rees/avatar.webp
+authors/alice-rees/avatar_hu.webp
+authors/alice-rees/index.html
+authors/alice-rees/index.xml
+authors/alicia-tamara-veersma-barredo/avatar.webp
+authors/alicia-tamara-veersma-barredo/avatar_hu.webp
+authors/alicia-tamara-veersma-barredo/index.html
+authors/alicia-tamara-veersma-barredo/index.xml
+authors/amanda-kay-montoya/avatar.webp
+authors/amanda-kay-montoya/avatar_hu.webp
+authors/amanda-kay-montoya/index.html
+authors/amanda-kay-montoya/index.xml
+authors/amani-aloufi/avatar.webp
+authors/amani-aloufi/avatar_hu.webp
+authors/amani-aloufi/index.html
+authors/amani-aloufi/index.xml
+authors/amelie-bret/avatar.webp
+authors/amelie-bret/avatar_hu.webp
+authors/amelie-bret/index.html
+authors/amelie-bret/index.xml
+authors/amelie-gourdon/avatar.webp
+authors/amelie-gourdon/avatar_hu.webp
+authors/amelie-gourdon/index.html
+authors/amelie-gourdon/index.xml
+authors/ana-carolina-marinho/avatar.webp
+authors/ana-carolina-marinho/avatar_hu.webp
+authors/ana-carolina-marinho/index.html
+authors/ana-carolina-marinho/index.xml
+authors/anna-meier/avatar.webp
+authors/anna-meier/avatar_hu.webp
+authors/anna-meier/index.html
+authors/anna-meier/index.xml
+authors/annalisa-myer/avatar.webp
+authors/annalisa-myer/avatar_hu.webp
+authors/annalisa-myer/index.html
+authors/annalisa-myer/index.xml
+authors/annalise-laplume/avatar.webp
+authors/annalise-laplume/avatar_hu.webp
+authors/annalise-laplume/index.html
+authors/annalise-laplume/index.xml
+authors/aoife-omahony/avatar.webp
+authors/aoife-omahony/avatar_hu.webp
+authors/aoife-omahony/index.html
+authors/aoife-omahony/index.xml
+authors/ashley-blake/avatar.webp
+authors/ashley-blake/avatar_hu.webp
+authors/ashley-blake/index.html
+authors/ashley-blake/index.xml
+authors/balazs-aczel/avatar.webp
+authors/balazs-aczel/avatar_hu.webp
+authors/balazs-aczel/index.html
+authors/balazs-aczel/index.xml
+authors/ben-saunders/avatar.webp
+authors/ben-saunders/avatar_hu.webp
+authors/ben-saunders/index.html
+authors/ben-saunders/index.xml
+authors/berit-t-barthelmes-msc/avatar.webp
+authors/berit-t-barthelmes-msc/avatar_hu.webp
+authors/berit-t-barthelmes-msc/index.html
+authors/berit-t-barthelmes-msc/index.xml
+authors/bethan-iley/avatar.webp
+authors/bethan-iley/avatar_hu.webp
+authors/bethan-iley/index.html
+authors/bethan-iley/index.xml
+authors/bradley-baker/avatar.webp
+authors/bradley-baker/avatar_hu.webp
+authors/bradley-baker/index.html
+authors/bradley-baker/index.xml
+authors/cass-gheoghe/avatar.webp
+authors/cass-gheoghe/avatar_hu.webp
+authors/cass-gheoghe/index.html
+authors/cass-gheoghe/index.xml
+authors/catherine-laverty/avatar.webp
+authors/catherine-laverty/avatar_hu.webp
+authors/catherine-laverty/index.html
+authors/catherine-laverty/index.xml
+authors/catia-oliveira/avatar.webp
+authors/catia-oliveira/avatar_hu.webp
+authors/catia-oliveira/index.html
+authors/catia-oliveira/index.xml
+authors/charlotte-r-pennington/avatar.webp
+authors/charlotte-r-pennington/avatar_hu.webp
+authors/charlotte-r-pennington/index.html
+authors/charlotte-r-pennington/index.xml
+authors/christopher-eaker/avatar.webp
+authors/christopher-eaker/avatar_hu.webp
+authors/christopher-eaker/index.html
+authors/christopher-eaker/index.xml
+authors/ciara-egan/avatar.webp
+authors/ciara-egan/avatar_hu.webp
+authors/ciara-egan/index.html
+authors/ciara-egan/index.xml
+authors/connor-keating/avatar.webp
+authors/connor-keating/avatar_hu.webp
+authors/connor-keating/index.html
+authors/connor-keating/index.xml
+authors/crystal-steltenpohl/avatar.webp
+authors/crystal-steltenpohl/avatar_hu.webp
+authors/crystal-steltenpohl/index.html
+authors/crystal-steltenpohl/index.xml
+authors/daniela-duca/avatar.webp
+authors/daniela-duca/avatar_hu.webp
+authors/daniela-duca/index.html
+authors/daniela-duca/index.xml
+authors/david-moreau/avatar.webp
+authors/david-moreau/avatar_hu.webp
+authors/david-moreau/index.html
+authors/david-moreau/index.xml
+authors/dermot-lynott/avatar.webp
+authors/dermot-lynott/avatar_hu.webp
+authors/dermot-lynott/index.html
+authors/dermot-lynott/index.xml
+authors/dushime-mudahera-richard/avatar.webp
+authors/dushime-mudahera-richard/avatar_hu.webp
+authors/dushime-mudahera-richard/index.html
+authors/dushime-mudahera-richard/index.xml
+authors/eike-rinke/avatar.webp
+authors/eike-rinke/avatar_hu.webp
+authors/eike-rinke/index.html
+authors/eike-rinke/index.xml
+authors/filip-dechterenko/avatar.webp
+authors/filip-dechterenko/avatar_hu.webp
+authors/filip-dechterenko/index.html
+authors/filip-dechterenko/index.xml
+authors/flavio-azevedo/avatar.webp
+authors/flavio-azevedo/avatar_hu.webp
+authors/flavio-azevedo/index.html
+authors/flavio-azevedo/index.xml
+authors/forrt/avatar.webp
+authors/forrt/avatar1.webp
+authors/forrt/avatar2.webp
+authors/forrt/avatar3.webp
+authors/forrt/avatar5.webp
+authors/forrt/avatar_hu.webp
+authors/forrt/index.html
+authors/forrt/index.xml
+authors/fotis-mystakopoulos-phd-student/avatar.webp
+authors/fotis-mystakopoulos-phd-student/avatar_hu.webp
+authors/fotis-mystakopoulos-phd-student/index.html
+authors/fotis-mystakopoulos-phd-student/index.xml
+authors/gavin-leech/avatar.webp
+authors/gavin-leech/avatar_hu.webp
+authors/gavin-leech/index.html
+authors/gavin-leech/index.xml
+authors/gilad-feldman/avatar.webp
+authors/gilad-feldman/avatar_hu.webp
+authors/gilad-feldman/index.html
+authors/gilad-feldman/index.xml
+authors/giorgia-andreolli/avatar.webp
+authors/giorgia-andreolli/avatar_hu.webp
+authors/giorgia-andreolli/index.html
+authors/giorgia-andreolli/index.xml
+authors/heather-urry/avatar.webp
+authors/heather-urry/avatar_hu.webp
+authors/heather-urry/index.html
+authors/heather-urry/index.xml
+authors/helena-hartmann/avatar.webp
+authors/helena-hartmann/avatar_hu.webp
+authors/helena-hartmann/index.html
+authors/helena-hartmann/index.xml
+authors/henrik-schoenemann/avatar.webp
+authors/henrik-schoenemann/avatar_hu.webp
+authors/henrik-schoenemann/index.html
+authors/henrik-schoenemann/index.xml
+authors/index.html
+authors/index.xml
+authors/jacob-miranda/avatar.webp
+authors/jacob-miranda/avatar_hu.webp
+authors/jacob-miranda/index.html
+authors/jacob-miranda/index.xml
+authors/jade-pickering/avatar.webp
+authors/jade-pickering/avatar_hu.webp
+authors/jade-pickering/index.html
+authors/jade-pickering/index.xml
+authors/james-bartlett/avatar.webp
+authors/james-bartlett/avatar_hu.webp
+authors/james-bartlett/index.html
+authors/james-bartlett/index.xml
+authors/jan-philipp-roer/avatar.webp
+authors/jan-philipp-roer/avatar_hu.webp
+authors/jan-philipp-roer/index.html
+authors/jan-philipp-roer/index.xml
+authors/jeef-lees/avatar.webp
+authors/jeef-lees/avatar_hu.webp
+authors/jeef-lees/index.html
+authors/jeef-lees/index.xml
+authors/joanne-mccuaig/avatar.webp
+authors/joanne-mccuaig/avatar_hu.webp
+authors/joanne-mccuaig/index.html
+authors/joanne-mccuaig/index.xml
+authors/john-shaw/avatar.webp
+authors/john-shaw/avatar_hu.webp
+authors/john-shaw/index.html
+authors/john-shaw/index.xml
+authors/jordan-wagge/avatar.webp
+authors/jordan-wagge/avatar_hu.webp
+authors/jordan-wagge/index.html
+authors/jordan-wagge/index.xml
+authors/julia-pauquet/avatar.webp
+authors/julia-pauquet/avatar_hu.webp
+authors/julia-pauquet/index.html
+authors/julia-pauquet/index.xml
+authors/julia-strand/avatar.webp
+authors/julia-strand/avatar_hu.webp
+authors/julia-strand/index.html
+authors/julia-strand/index.xml
+authors/julia-wolska/avatar.webp
+authors/julia-wolska/avatar_hu.webp
+authors/julia-wolska/index.html
+authors/julia-wolska/index.xml
+authors/justin-sulik/avatar.webp
+authors/justin-sulik/avatar_hu.webp
+authors/justin-sulik/index.html
+authors/justin-sulik/index.xml
+authors/kai-krautter/avatar.webp
+authors/kai-krautter/avatar_hu.webp
+authors/kai-krautter/index.html
+authors/kai-krautter/index.xml
+authors/kaili-chung/avatar.webp
+authors/kaili-chung/avatar_hu.webp
+authors/kaili-chung/index.html
+authors/kaili-chung/index.xml
+authors/kamil-izydorczak/avatar.webp
+authors/kamil-izydorczak/avatar_hu.webp
+authors/kamil-izydorczak/index.html
+authors/kamil-izydorczak/index.xml
+authors/karen-matvienko-sikar/avatar.webp
+authors/karen-matvienko-sikar/avatar_hu.webp
+authors/karen-matvienko-sikar/index.html
+authors/karen-matvienko-sikar/index.xml
+authors/karolina-urbanska/avatar.webp
+authors/karolina-urbanska/avatar_hu.webp
+authors/karolina-urbanska/index.html
+authors/karolina-urbanska/index.xml
+authors/kelly-lloyd/avatar.webp
+authors/kelly-lloyd/avatar_hu.webp
+authors/kelly-lloyd/index.html
+authors/kelly-lloyd/index.xml
+authors/kimberly-quinn/avatar.webp
+authors/kimberly-quinn/avatar_hu.webp
+authors/kimberly-quinn/index.html
+authors/kimberly-quinn/index.xml
+authors/laurel-standiford/avatar.webp
+authors/laurel-standiford/avatar_hu.webp
+authors/laurel-standiford/index.html
+authors/laurel-standiford/index.xml
+authors/leticia-micheli/avatar.webp
+authors/leticia-micheli/avatar_hu.webp
+authors/leticia-micheli/index.html
+authors/leticia-micheli/index.xml
+authors/lorna-hamilton/avatar.webp
+authors/lorna-hamilton/avatar_hu.webp
+authors/lorna-hamilton/index.html
+authors/lorna-hamilton/index.xml
+authors/louise-bezuidenhout/avatar.webp
+authors/louise-bezuidenhout/avatar_hu.webp
+authors/louise-bezuidenhout/index.html
+authors/louise-bezuidenhout/index.xml
+authors/lukas-roseler/avatar.webp
+authors/lukas-roseler/avatar_hu.webp
+authors/lukas-roseler/index.html
+authors/lukas-roseler/index.xml
+authors/lukas-wallrich/avatar.webp
+authors/lukas-wallrich/avatar_hu.webp
+authors/lukas-wallrich/index.html
+authors/lukas-wallrich/index.xml
+authors/lydia-riedl/avatar.webp
+authors/lydia-riedl/avatar_hu.webp
+authors/lydia-riedl/index.html
+authors/lydia-riedl/index.xml
+authors/madeleine-pownall/avatar.webp
+authors/madeleine-pownall/avatar_hu.webp
+authors/madeleine-pownall/index.html
+authors/madeleine-pownall/index.xml
+authors/magdelna-grose-hodge/avatar.webp
+authors/magdelna-grose-hodge/avatar_hu.webp
+authors/magdelna-grose-hodge/index.html
+authors/magdelna-grose-hodge/index.xml
+authors/mahmoud-elsherif/avatar.webp
+authors/mahmoud-elsherif/avatar_hu.webp
+authors/mahmoud-elsherif/index.html
+authors/mahmoud-elsherif/index.xml
+authors/malika-ihle/avatar.webp
+authors/malika-ihle/avatar_hu.webp
+authors/malika-ihle/index.html
+authors/malika-ihle/index.xml
+authors/markus-konkol/avatar.webp
+authors/markus-konkol/avatar_hu.webp
+authors/markus-konkol/index.html
+authors/markus-konkol/index.xml
+authors/martin-vasilev/avatar.webp
+authors/martin-vasilev/avatar_hu.webp
+authors/martin-vasilev/index.html
+authors/martin-vasilev/index.xml
+authors/max-korbmacher/avatar.webp
+authors/max-korbmacher/avatar_hu.webp
+authors/max-korbmacher/index.html
+authors/max-korbmacher/index.xml
+authors/meera-chandra/avatar.webp
+authors/meera-chandra/avatar_hu.webp
+authors/meera-chandra/index.html
+authors/meera-chandra/index.xml
+authors/mehdi-goughari/avatar.webp
+authors/mehdi-goughari/avatar_hu.webp
+authors/mehdi-goughari/index.html
+authors/mehdi-goughari/index.xml
+authors/meng-liu/avatar.webp
+authors/meng-liu/avatar_hu.webp
+authors/meng-liu/index.html
+authors/meng-liu/index.xml
+authors/mike-galang/avatar.webp
+authors/mike-galang/avatar_hu.webp
+authors/mike-galang/index.html
+authors/mike-galang/index.xml
+authors/monica-gonzales-marquez/avatar.webp
+authors/monica-gonzales-marquez/avatar_hu.webp
+authors/monica-gonzales-marquez/index.html
+authors/monica-gonzales-marquez/index.xml
+authors/myriam-baum/avatar.webp
+authors/myriam-baum/avatar_hu.webp
+authors/myriam-baum/index.html
+authors/myriam-baum/index.xml
+authors/nihan-albayrak-aydemir/avatar.webp
+authors/nihan-albayrak-aydemir/avatar_hu.webp
+authors/nihan-albayrak-aydemir/index.html
+authors/nihan-albayrak-aydemir/index.xml
+authors/olly-robertson/avatar.webp
+authors/olly-robertson/avatar_hu.webp
+authors/olly-robertson/index.html
+authors/olly-robertson/index.xml
+authors/patrick-s-forscher/avatar.webp
+authors/patrick-s-forscher/avatar_hu.webp
+authors/patrick-s-forscher/index.html
+authors/patrick-s-forscher/index.xml
+authors/priya-silverstein/avatar.webp
+authors/priya-silverstein/avatar_hu.webp
+authors/priya-silverstein/index.html
+authors/priya-silverstein/index.xml
+authors/rachel-heyard/avatar.webp
+authors/rachel-heyard/avatar_hu.webp
+authors/rachel-heyard/index.html
+authors/rachel-heyard/index.xml
+authors/rachel-renbarger/avatar.webp
+authors/rachel-renbarger/avatar_hu.webp
+authors/rachel-renbarger/index.html
+authors/rachel-renbarger/index.xml
+authors/rivaquiroga/avatar.webp
+authors/roksanasobolak/avatar.webp
+authors/ruthvanderhallenphd/avatar.webp
+authors/sam-parsons/avatar.webp
+authors/sam-parsons/avatar_hu.webp
+authors/sam-parsons/index.html
+authors/sam-parsons/index.xml
+authors/sam-westwood/avatar.webp
+authors/sam-westwood/avatar_hu.webp
+authors/sam-westwood/index.html
+authors/sam-westwood/index.xml
+authors/samantha-tyler/avatar.webp
+authors/samantha-tyler/avatar_hu.webp
+authors/samantha-tyler/index.html
+authors/samantha-tyler/index.xml
+authors/samuel-alarie/avatar.webp
+authors/samuel-alarie/avatar_hu.webp
+authors/samuel-alarie/index.html
+authors/samuel-alarie/index.xml
+authors/samuel-guay/avatar.webp
+authors/samuel-guay/avatar_hu.webp
+authors/samuel-guay/backavatar.webp
+authors/samuel-guay/index.html
+authors/samuel-guay/index.xml
+authors/sandra-grinschgl/avatar.webp
+authors/sandra-grinschgl/avatar_hu.webp
+authors/sandra-grinschgl/index.html
+authors/sandra-grinschgl/index.xml
+authors/sara-lil-middleton/avatar.webp
+authors/sara-lil-middleton/avatar_hu.webp
+authors/sara-lil-middleton/index.html
+authors/sara-lil-middleton/index.xml
+authors/sarah-a-sauve/avatar.webp
+authors/sarah-a-sauve/avatar_hu.webp
+authors/sarah-a-sauve/index.html
+authors/sarah-a-sauve/index.xml
+authors/sarah-ashcroftjones/avatar.webp
+authors/sarah-ashcroftjones/avatar_hu.webp
+authors/sarah-ashcroftjones/index.html
+authors/sarah-ashcroftjones/index.xml
+authors/sau-chin-chen/avatar.webp
+authors/sau-chin-chen/avatar_hu.webp
+authors/sau-chin-chen/index.html
+authors/sau-chin-chen/index.xml
+authors/shilaan-alzahawi/avatar.webp
+authors/shilaan-alzahawi/avatar_hu.webp
+authors/shilaan-alzahawi/index.html
+authors/shilaan-alzahawi/index.xml
+authors/siu-kit-yeung/avatar.webp
+authors/siu-kit-yeung/avatar_hu.webp
+authors/siu-kit-yeung/index.html
+authors/siu-kit-yeung/index.xml
+authors/sonia-rishi/avatar.webp
+authors/sonia-rishi/avatar_hu.webp
+authors/sonia-rishi/index.html
+authors/sonia-rishi/index.xml
+authors/stephanie-zellers/avatar.webp
+authors/stephanie-zellers/avatar_hu.webp
+authors/stephanie-zellers/index.html
+authors/stephanie-zellers/index.xml
+authors/steven-verheyen/avatar.webp
+authors/steven-verheyen/avatar_hu.webp
+authors/steven-verheyen/index.html
+authors/steven-verheyen/index.xml
+authors/susanne-vogel/avatar.webp
+authors/susanne-vogel/avatar_hu.webp
+authors/susanne-vogel/index.html
+authors/susanne-vogel/index.xml
+authors/tamara-kalandadze/avatar.webp
+authors/tamara-kalandadze/avatar_hu.webp
+authors/tamara-kalandadze/index.html
+authors/tamara-kalandadze/index.xml
+authors/tamara-marques/avatar.webp
+authors/tamara-marques/avatar_hu.webp
+authors/tamara-marques/index.html
+authors/tamara-marques/index.xml
+authors/thomas-rhys-evans/avatar.webp
+authors/thomas-rhys-evans/avatar_hu.webp
+authors/thomas-rhys-evans/index.html
+authors/thomas-rhys-evans/index.xml
+authors/timo-roettger/avatar.webp
+authors/timo-roettger/avatar_hu.webp
+authors/timo-roettger/index.html
+authors/timo-roettger/index.xml
+authors/tina-lonsdorf/avatar.webp
+authors/tina-lonsdorf/avatar_hu.webp
+authors/tina-lonsdorf/index.html
+authors/tina-lonsdorf/index.xml
+authors/tom-heyman/avatar.webp
+authors/tom-heyman/avatar_hu.webp
+authors/tom-heyman/index.html
+authors/tom-heyman/index.xml
+authors/waleed-alsubhi/avatar.webp
+authors/waleed-alsubhi/avatar_hu.webp
+authors/waleed-alsubhi/index.html
+authors/waleed-alsubhi/index.xml
+authors/william-ngiam/avatar.webp
+authors/william-ngiam/avatar_hu.webp
+authors/william-ngiam/index.html
+authors/william-ngiam/index.xml
+authors/yanna-weisberg/avatar.webp
+authors/yanna-weisberg/avatar_hu.webp
+authors/yanna-weisberg/index.html
+authors/yanna-weisberg/index.xml
+authors/yufang-yang/avatar.webp
+authors/yufang-yang/avatar_hu.webp
+authors/yufang-yang/index.html
+authors/yufang-yang/index.xml
+authors/zoe-flack/avatar.webp
+authors/zoe-flack/avatar_hu.webp
+authors/zoe-flack/index.html
+authors/zoe-flack/index.xml
+authors/zoran-pavlovic/avatar.webp
+authors/zoran-pavlovic/avatar_hu.webp
+authors/zoran-pavlovic/index.html
+authors/zoran-pavlovic/index.xml
+awards/Einstein.webp
+awards/Jisc.webp
+awards/Leo_Waaijers_Open_Science_Award_2026/1.webp
+awards/Leo_Waaijers_Open_Science_Award_2026/2.webp
+awards/Leo_Waaijers_Open_Science_Award_2026/3.webp
+awards/Leo_Waaijers_Open_Science_Award_2026/4.webp
+awards/Leo_Waaijers_Open_Science_Award_2026/5.webp
+awards/alt.webp
+awards/hiddenref.webp
+awards/index.html
+awards/inosc.webp
+awards/osc-galway.webp
+awards/sips.webp
+awards/ukrn.webp
+awards/unesco_recognition.webp
+awop/AWOP.webp
+awop/index.html
+awop_app/index.html
+booklet/index.html
+booklet/index.xml
+booklet/page/1/index.html
+categories/index.html
+categories/index.xml
+categories/page/1/index.html
+category/event/index.html
+category/event/index.xml
+category/event/page/1/index.html
+category/milestone/index.html
+category/milestone/index.xml
+category/milestone/page/1/index.html
+category/newsletter/index.html
+category/newsletter/index.xml
+category/newsletter/page/1/index.html
+category/opportunity/index.html
+category/opportunity/index.xml
+category/opportunity/page/1/index.html
+category/resource/index.html
+category/resource/index.xml
+category/resource/page/1/index.html
+citation-politics/index.html
+citation-politics/index.xml
+citation-politics/page/1/index.html
+citation-politics/toolkit/index.html
+clusters/FORRT_Clusters.webp
+clusters/FORRT_O&R_101_Syllabus.pdf
+clusters/cluster-1/index.html
+clusters/cluster-10/index.html
+clusters/cluster-11/index.html
+clusters/cluster-2/index.html
+clusters/cluster-3/index.html
+clusters/cluster-4/index.html
+clusters/cluster-5/index.html
+clusters/cluster-6/index.html
+clusters/cluster-7/index.html
+clusters/cluster-8/index.html
+clusters/cluster-9/index.html
+clusters/index.html
+clusters/index.xml
+coc/index.html
+community-map/index.html
+contributor-analysis/index.html
+contributor-analysis/projects-plot-1.png
+contributor-analysis/roles-plot-1.png
+contributor-analysis/treemap-plot-1.png
+contributors/index.html
+countries.geojson
+css/404.min.FINGERPRINT.css
+css/academic.min.FINGERPRINT.css
+css/citations.min.FINGERPRINT.css
+css/cite_us.min.FINGERPRINT.css
+css/steering-committee.css
+css/welcome.min.FINGERPRINT.css
+curated_resources/1-500-scientists-lift-the-lid-on-reprodu/index.html
+curated_resources/10-things-for-curating-reproducible-and/index.html
+curated_resources/1economics-270d-research-transparency-me/index.html
+curated_resources/66th-helmholtz-open-science-online-semin/index.html
+curated_resources/7-easy-steps-to-open-science-an-annotate/index.html
+curated_resources/a-21-word-solution/index.html
+curated_resources/a-bayesian-perspective-on-the-reproducib/index.html
+curated_resources/a-call-for-open-science-in-forensics/index.html
+curated_resources/a-case-for-data-dashboards-first-steps-w/index.html
+curated_resources/a-cautionary-note-on-aggregation-in-educ/index.html
+curated_resources/a-checklist-is-associated-with-increased/index.html
+curated_resources/a-collaborative-approach-to-infant-resea/index.html
+curated_resources/a-community-endorsed-open-source-lexicon/index.html
+curated_resources/a-consensus-based-transparency-checklist/index.html
+curated_resources/a-critique-of-using-the-labels-confirmat/index.html
+curated_resources/a-dataset-without-a-code-book-ethnograph/index.html
+curated_resources/a-duty-to-describe-better-the-devil-you/index.html
+curated_resources/a-framework-for-understanding-an-open-sc/index.html
+curated_resources/a-funder-imposed-data-publication-requir/index.html
+curated_resources/a-future-for-digital-public-goods-for-mo/index.html
+curated_resources/a-general-course-outline-for-an-overview/index.html
+curated_resources/a-guide-for-social-science-journal-edito/index.html
+curated_resources/a-guide-for-social-science-journal-edito_2/index.html
+curated_resources/a-guide-to-choosing-a-data-repository-fo/index.html
+curated_resources/a-guide-to-data-visualization-best-pract/index.html
+curated_resources/a-guide-to-supporting-early-career-resea/index.html
+curated_resources/a-healthy-phd/index.html
+curated_resources/a-library-of-electrophysiological-respon/index.html
+curated_resources/a-manifesto-for-reproducible-science/index.html
+curated_resources/a-manifesto-for-rewarding-and-recognizin/index.html
+curated_resources/a-minimal-metadata-set-mnms-to-repurpose/index.html
+curated_resources/a-multilab-preregistered-replication-of/index.html
+curated_resources/a-pathway-to-strengthening-open-science/index.html
+curated_resources/a-plan-to-develop-open-science-s-green-s/index.html
+curated_resources/a-plea-for-preregistration-in-personalit/index.html
+curated_resources/a-power-primer/index.html
+curated_resources/a-powerful-nudge-presenting-calculable-c/index.html
+curated_resources/a-primer-for-choosing-designing-and-eval/index.html
+curated_resources/a-primer-on-systematic-review-and-meta-a/index.html
+curated_resources/a-proposal-for-a-new-editorial-policy-in/index.html
+curated_resources/a-proposal-for-the-future-of-scientific/index.html
+curated_resources/a-public-option-for-clinical-trials-less/index.html
+curated_resources/a-reading-list-for-the-replicability-cri/index.html
+curated_resources/a-recipe-for-extremely-reproducible-enri/index.html
+curated_resources/a-registered-report-survey-of-open-resea/index.html
+curated_resources/a-reliability-generalization-study-of-jo/index.html
+curated_resources/a-replication-crisis-in-methodological-r/index.html
+curated_resources/a-reputation-economy-how-individual-rewa/index.html
+curated_resources/a-short-introduction-to-the-reproducibil/index.html
+curated_resources/a-short-personal-future-history-of-revol/index.html
+curated_resources/a-social-priming-data-set-with-troubling/index.html
+curated_resources/a-social-psychological-model-of-scientif/index.html
+curated_resources/a-software-tool-for-removing-patient-ide/index.html
+curated_resources/a-solomon-kurz-website/index.html
+curated_resources/a-step-by-step-guide-on-preregistration/index.html
+curated_resources/a-student-s-guide-to-open-science-using/index.html
+curated_resources/a-study-of-the-impact-of-data-sharing-on/index.html
+curated_resources/a-study-on-formalizing-the-knowledge-of/index.html
+curated_resources/a-survey-of-researchers-methods-sharing/index.html
+curated_resources/a-survey-of-the-statistical-power-of-res/index.html
+curated_resources/a-survey-on-how-preregistration-affects/index.html
+curated_resources/a-systematic-review-of-statistical-power/index.html
+curated_resources/a-tale-of-two-papers/index.html
+curated_resources/a-test-of-the-diffusion-model-explanatio/index.html
+curated_resources/a-tutorial-on-cognitive-modeling-for-cog/index.html
+curated_resources/a-unified-framework-to-quantify-the-cred/index.html
+curated_resources/a-vast-graveyard-of-undead-theories-publ/index.html
+curated_resources/abandon-statistical-significance/index.html
+curated_resources/academic-fraud-is-a-waster-of-taxpayer-d/index.html
+curated_resources/academic-jobs-in-the-us-vs-the-uk/index.html
+curated_resources/academic-research-in-the-21st-century-ma/index.html
+curated_resources/accessibility-data-curation-primer/index.html
+curated_resources/accessible-feedback-in-research/index.html
+curated_resources/accuracy-of-effect-size-estimates-from-p/index.html
+curated_resources/adapting-open-science-and-pre-registrati/index.html
+curated_resources/addressing-the-grand-challenges-facing-p/index.html
+curated_resources/addressing-the-issue-of-representation-i/index.html
+curated_resources/adjusting-for-publication-bias-in-metaan/index.html
+curated_resources/adopting-open-educational-resources-as-a/index.html
+curated_resources/adopting-principled-education/index.html
+curated_resources/advancing-data-honesty-in-experimental-b/index.html
+curated_resources/advancing-equity-and-innovation-in-resea/index.html
+curated_resources/advancing-equity-in-academia-through-inn/index.html
+curated_resources/advancing-oscm-scientific-knowledge-by-r/index.html
+curated_resources/advocating-for-change-in-how-science-is/index.html
+curated_resources/advocating-for-generalizability-acceptin/index.html
+curated_resources/agape-open-science-mooc/index.html
+curated_resources/ai-sanctions-screening-study-the-ofac-li/index.html
+curated_resources/all-is-well-that-replicates-well-the-rep/index.html
+curated_resources/all-the-weight-of-our-dreams-on-living-r/index.html
+curated_resources/always-use-welch-t-test/index.html
+curated_resources/an-agenda-for-purely-confirmatory-resear/index.html
+curated_resources/an-assessment-of-the-magnitude-of-effect/index.html
+curated_resources/an-excess-of-positive-results-comparing/index.html
+curated_resources/an-exploratory-test-for-an-excess-of-sig/index.html
+curated_resources/an-introduction-to-registered-replicatio/index.html
+curated_resources/an-introduction-to-registered-reports-fo/index.html
+curated_resources/an-introduction-to-the-topic-of-open-sci/index.html
+curated_resources/an-open-investigation-of-the-reproducibi/index.html
+curated_resources/an-open-science-mri-database-of-over-100/index.html
+curated_resources/an-open-science-primer-for-social-scient/index.html
+curated_resources/an-open-source-pharma-roadmap/index.html
+curated_resources/analisis-y-visualizacion-de-datos-usando/index.html
+curated_resources/analysis-of-open-data-and-computational/index.html
+curated_resources/analytic-review-as-a-solution-to-the-mis/index.html
+curated_resources/analytical-code-sharing-practices-in-bio/index.html
+curated_resources/analyzing-education-data-with-open-scien/index.html
+curated_resources/announcing-datacite-s-first-public-data/index.html
+curated_resources/applied-multiple-regression-correlation/index.html
+curated_resources/applied-open-science-talk-gsa-2020/index.html
+curated_resources/applying-social-and-behavioral-science-t/index.html
+curated_resources/approaching-psychology-s-current-crises/index.html
+curated_resources/approaching-psychology-s-current-crises_2/index.html
+curated_resources/are-choices-based-on-conditional-or-conj/index.html
+curated_resources/are-preregistration-and-registered-repor/index.html
+curated_resources/are-psychology-journals-anti-replication/index.html
+curated_resources/are-we-wasting-a-good-crisis-the-availab/index.html
+curated_resources/ariadne-a-scientific-navigator-to-find-y/index.html
+curated_resources/ariadne-a-scientific-navigator-to-find-y_2/index.html
+curated_resources/ariadne-scientific-resource-navigator/index.html
+curated_resources/arrested-theory-development-the-misguide/index.html
+curated_resources/arrive-has-not-arrived-support-for-the-a/index.html
+curated_resources/artificial-intelligence-and-responsibili/index.html
+curated_resources/ascent-foss-resource-list-for-global-sou/index.html
+curated_resources/asl-lexicon-and-reporting-recommendation/index.html
+curated_resources/assessing-data-availability-and-research/index.html
+curated_resources/assessing-open-scholarship-practices-in/index.html
+curated_resources/assessment-of-transparency-indicators-in/index.html
+curated_resources/association-between-trial-registration-a/index.html
+curated_resources/at-what-sample-size-do-correlations-stab/index.html
+curated_resources/attitudes-towards-animal-study-registrie/index.html
+curated_resources/authorization-of-animal-experiments-is-b/index.html
+curated_resources/authorship-practices-must-evolve-to-supp/index.html
+curated_resources/autistic-community-and-the-neurodiversit/index.html
+curated_resources/automation-and-make/index.html
+curated_resources/awesome-open-science-resources/index.html
+curated_resources/awesome-reproducible-research/index.html
+curated_resources/bacillus-calmette-guerin-vaccine-to-redu/index.html
+curated_resources/bad-science-blog-on-the-guardian-webpage/index.html
+curated_resources/bad-science-log-post-guardian/index.html
+curated_resources/badges-for-sharing-data-and-code-at-bios/index.html
+curated_resources/badges-to-acknowledge-open-practices-a-s/index.html
+curated_resources/barcelona-declaration-on-open-research-i/index.html
+curated_resources/bargain-basement-bayes/index.html
+curated_resources/bayes-factor/index.html
+curated_resources/bayes-for-beginners-probability-and-like/index.html
+curated_resources/bayes-rules-an-introduction-to-bayesian/index.html
+curated_resources/bayesian-cognitive-modelling/index.html
+curated_resources/bayesian-inference-for-psychology-part-i/index.html
+curated_resources/bayesian-inference/index.html
+curated_resources/being-a-reviewer-or-editor-for-registere/index.html
+curated_resources/ben-goldacre-battling-bad-science/index.html
+curated_resources/benefits-of-open-and-high-powered-resear/index.html
+curated_resources/berlin-oxford-summer-school-2020/index.html
+curated_resources/best-practices-in-data-analysis-and-shar/index.html
+curated_resources/best-research-practices-in-psychology-il/index.html
+curated_resources/better-p-curves-making-p-curve-analysis/index.html
+curated_resources/beyond-infrastructure-unpacking-the-comp/index.html
+curated_resources/beyond-kindness-a-proposal-for-the-flour/index.html
+curated_resources/beyond-power-calculations-assessing-type/index.html
+curated_resources/biden-harris-administration-marks-the-an/index.html
+curated_resources/big-correlations-in-little-studies-infla/index.html
+curated_resources/big-team-science-initiatives-a-catalyst/index.html
+curated_resources/big-team-setup-guide/index.html
+curated_resources/biomedical-data-repository-concepts-and/index.html
+curated_resources/biomedical-publishing-past-historic-pres/index.html
+curated_resources/bite-size-science-and-its-undesired-side/index.html
+curated_resources/blaze-a-search-engine-and-email-subscrip/index.html
+curated_resources/boas-praticas-em-ciencia/index.html
+curated_resources/bounded-research-ethicality-researchers/index.html
+curated_resources/bradley-efron-frequentist-accuracy-of-ba/index.html
+curated_resources/brainlife-io-a-decentralized-and-open-so/index.html
+curated_resources/breaking-free-how-preregistration-hurts/index.html
+curated_resources/bridging-neurodiversity-and-open-scholar/index.html
+curated_resources/bringing-institutional-multidisciplinary/index.html
+curated_resources/bringing-the-pre-registration-revolution/index.html
+curated_resources/building-reproducible-bridges-to-cross-t/index.html
+curated_resources/building-transparency-and-reproducibilit/index.html
+curated_resources/calculating-and-reporting-effect-sizes-t/index.html
+curated_resources/calculating-the-overlap-of-two-normal-di/index.html
+curated_resources/campbell-open-and-reproducible-science-s/index.html
+curated_resources/campbell-s-law-explains-the-replication/index.html
+curated_resources/can-a-good-theory-be-built-using-bad-ing/index.html
+curated_resources/can-you-trust-the-data-from-your-wearabl/index.html
+curated_resources/canadian-open-neuroscience-platform-conp/index.html
+curated_resources/cancer-researchers-experiences-with-and/index.html
+curated_resources/capstone-advanced-general/index.html
+curated_resources/care-principles-for-indigenous-data-gove/index.html
+curated_resources/cargo-cult-science/index.html
+curated_resources/carpentries-instructor-training/index.html
+curated_resources/catalyzing-communities-of-research-rigou/index.html
+curated_resources/catecor-an-open-science-shaded-truss-ext/index.html
+curated_resources/challenges-and-opportunities-in-preregis/index.html
+curated_resources/champions-of-transparency-in-education-w/index.html
+curated_resources/change-starts-with-journal-editors-in-re/index.html
+curated_resources/changing-the-culture-of-peer-review-for/index.html
+curated_resources/chaos-in-the-brickyard/index.html
+curated_resources/characteristics-of-clinical-trials-regis/index.html
+curated_resources/chatgpt-teaches-open-science/index.html
+curated_resources/choice-of-analysis-pathway-dramatically/index.html
+curated_resources/choosing-prediction-over-explanation-in/index.html
+curated_resources/chrome-book-data-science/index.html
+curated_resources/ciencia-aberta-e-reprodutivel/index.html
+curated_resources/circle-of-willis-episode-with-simine-vaz/index.html
+curated_resources/citing-and-being-cited-data-code-edition/index.html
+curated_resources/cjep-will-offer-open-science-badges/index.html
+curated_resources/claims-about-scientific-rigour-require-r/index.html
+curated_resources/clinical-trial-registration-a-statement/index.html
+curated_resources/clinical-trial-registration-and-reportin/index.html
+curated_resources/clinical-trial-registration-looking-back/index.html
+curated_resources/clinical-trial-registration-transparency/index.html
+curated_resources/clusters/index.html
+curated_resources/cognitive-science-stackexchange-site-for/index.html
+curated_resources/common-statistical-tests-are-linear-mode/index.html
+curated_resources/community-consensus-on-core-open-science/index.html
+curated_resources/community-sourced-glossary-of-open-schol/index.html
+curated_resources/compare-a-prospective-cohort-study-corre/index.html
+curated_resources/comparing-analysis-blinding-with-preregi/index.html
+curated_resources/comparing-published-scientific-journal-a/index.html
+curated_resources/comparison-of-preregistration-platforms/index.html
+curated_resources/comparison-of-registered-and-published-o/index.html
+curated_resources/comparison-of-registered-and-published-p/index.html
+curated_resources/computational-social-science-is-growing/index.html
+curated_resources/conducting-research-with-people-in-lower/index.html
+curated_resources/conflicting-results-and-statistical-mall/index.html
+curated_resources/connecting-research-tools-to-the-open-sc/index.html
+curated_resources/consent-form-reporting-on-clinicaltrials/index.html
+curated_resources/consequences-of-low-statistical-power/index.html
+curated_resources/consequences-of-prejudice-against-the-nu/index.html
+curated_resources/conservative-tests-under-satisficing-mod/index.html
+curated_resources/consolidated-reporting-guidelines-for-pr/index.html
+curated_resources/consort-statement-adherence-and-risk-of/index.html
+curated_resources/constraints-on-generality-statements-are/index.html
+curated_resources/construct-validation-in-social-and-perso/index.html
+curated_resources/continuously-cumulating-meta-analysis-an/index.html
+curated_resources/coping-with-common-phd-challenges-by-mak/index.html
+curated_resources/correcting-for-bias-in-psychology-a-comp/index.html
+curated_resources/correlational-effect-size-benchmarks/index.html
+curated_resources/cos-10-year-anniversary-starting-scaling/index.html
+curated_resources/cos-registered-reports-portal/index.html
+curated_resources/course-materials-project-tier/index.html
+curated_resources/course-on-open-science-101/index.html
+curated_resources/course-syllabi-for-open-and-reproducible/index.html
+curated_resources/creating-an-inclusive-research-lab-with/index.html
+curated_resources/credibility-of-preprints-an-interdiscipl/index.html
+curated_resources/credible-science-course/index.html
+curated_resources/crep-project/index.html
+curated_resources/crep-tutorials/index.html
+curated_resources/crisis-research-fast-and-slow/index.html
+curated_resources/critical-metascience-articles/index.html
+curated_resources/crossvalidated-stackexchange-site-for-st/index.html
+curated_resources/crowdsourced-research-many-hands-make-ti/index.html
+curated_resources/crustybase-v-2-0-new-features-and-enhanc/index.html
+curated_resources/curate-science/index.html
+curated_resources/curating-research-assets-a-tutorial-on-t/index.html
+curated_resources/current-incentives-for-scientists-lead-t/index.html
+curated_resources/curtailing-the-use-of-preregistration-a/index.html
+curated_resources/dagitty/index.html
+curated_resources/data-analysis-and-visualization-in-pytho/index.html
+curated_resources/data-analysis-and-visualization-in-r-for/index.html
+curated_resources/data-analysis-and-visualization-with-pyt/index.html
+curated_resources/data-and-open-science/index.html
+curated_resources/data-availability-reusability-and-analyt/index.html
+curated_resources/data-carpentry-for-biologists/index.html
+curated_resources/data-carpentry/index.html
+curated_resources/data-cleaning-and-management-using-openr/index.html
+curated_resources/data-cleaning-with-openrefine-for-ecolog/index.html
+curated_resources/data-intro-for-archivists/index.html
+curated_resources/data-is-present-open-workshops-and-hacka/index.html
+curated_resources/data-management-and-data-sharing-in-psyc/index.html
+curated_resources/data-management-for-psychological-scienc/index.html
+curated_resources/data-management-plans-as-linked-open-dat/index.html
+curated_resources/data-management-reproducibility/index.html
+curated_resources/data-management-with-sql-for-ecologists/index.html
+curated_resources/data-management-with-sql-for-social-scie/index.html
+curated_resources/data-management/index.html
+curated_resources/data-organization-in-spreadsheets-for-ec/index.html
+curated_resources/data-organization-in-spreadsheets-for-so/index.html
+curated_resources/data-overuse-in-aging-research-emerging/index.html
+curated_resources/data-peeking-without-p-hacking/index.html
+curated_resources/data-policies-of-highly-ranked-social-sc/index.html
+curated_resources/data-reuse-and-the-open-data-citation-ad/index.html
+curated_resources/data-sharing-by-scientists-practices-and/index.html
+curated_resources/data-sharing-in-plos-one-an-analysis-of/index.html
+curated_resources/data-sharing-in-psychology-a-survey-on-b/index.html
+curated_resources/data-sharing-is-caring/index.html
+curated_resources/data-sharing-practices-in-collaborative/index.html
+curated_resources/data-tutorial-power-analysis-using-g-pow/index.html
+curated_resources/data-wrangling-and-processing-for-genomi/index.html
+curated_resources/databases-and-sql/index.html
+curated_resources/debate-statistical-analysis-plans-for-ob/index.html
+curated_resources/decatastrophizing-research-irreproducibi/index.html
+curated_resources/decisions-decisions-decisions-an-ethnogr/index.html
+curated_resources/declaration-of-common-standards-for-the/index.html
+curated_resources/declaration-of-helsinki-ethical-norm-in/index.html
+curated_resources/decolonising-open-science-symposium-dism/index.html
+curated_resources/deep-dive-into-open-scholarship-collabor/index.html
+curated_resources/deep-dive-into-open-scholarship-data-mat/index.html
+curated_resources/deep-dive-into-open-scholarship-preprint/index.html
+curated_resources/deep-dive-into-open-scholarship-preregis/index.html
+curated_resources/deep-dive-on-open-practices-understandin/index.html
+curated_resources/deep-dive-on-open-practices-understandin_2/index.html
+curated_resources/deep-dive-on-open-practices-understandin_3/index.html
+curated_resources/deep-dive-on-open-practices-understandin_4/index.html
+curated_resources/defining-and-distinguishing-validity-int/index.html
+curated_resources/defining-and-growing-the-field-of-metasc/index.html
+curated_resources/defining-effect-sizes/index.html
+curated_resources/degrees-of-freedom-in-planning-running-a/index.html
+curated_resources/degrees-of-freedom-tutorial/index.html
+curated_resources/deletion-erasure-and-what-the-marker-tes/index.html
+curated_resources/dementia-big-data-and-open-science/index.html
+curated_resources/demystifying-open-science-in-health-psyc/index.html
+curated_resources/demystifying-open-science-in-health-psyc_2/index.html
+curated_resources/der-umgang-mit-forschungsdaten-im-fach-p/index.html
+curated_resources/des-rap-book-reproducible-discrete-event/index.html
+curated_resources/design-and-validation-of-a-conceptual-mo/index.html
+curated_resources/designing-for-preregistration-a-user-cen/index.html
+curated_resources/detecting-and-avoiding-likely-false-posi/index.html
+curated_resources/detecting-bad-science/index.html
+curated_resources/detecting-fraud-in-social-science/index.html
+curated_resources/determinants-of-behaviour-and-their-effi/index.html
+curated_resources/developing-a-comprehensive-directory-of/index.html
+curated_resources/developing-a-wiki-integrated-workflow-to/index.html
+curated_resources/developing-an-open-educational-resource/index.html
+curated_resources/developing-principled-pedagogies-an-open/index.html
+curated_resources/development-of-an-open-access-virtual-bi/index.html
+curated_resources/disclosing-and-managing-non-financial-co/index.html
+curated_resources/discrepancies-in-the-registries-of-diet/index.html
+curated_resources/discrepancy-review-a-feasibility-study-o/index.html
+curated_resources/dissemination-and-publication-of-researc/index.html
+curated_resources/distribution-of-p-values-when-comparing/index.html
+curated_resources/diversifying-research-methods-syllabi/index.html
+curated_resources/divorcing-white-supremacy-culture/index.html
+curated_resources/do-grant-proposal-texts-matter-for-fundi/index.html
+curated_resources/do-organisms-need-an-impact-factor-citat/index.html
+curated_resources/do-p-values-lose-their-meaning-in-explor/index.html
+curated_resources/do-pre-analysis-plans-hamper-publication/index.html
+curated_resources/do-pre-registration-and-pre-analysis-pla/index.html
+curated_resources/do-statistical-reporting-standards-affec/index.html
+curated_resources/do-studies-of-statistical-power-have-an/index.html
+curated_resources/does-preregistration-improve-the-credibi/index.html
+curated_resources/does-use-of-the-consort-statement-impact/index.html
+curated_resources/draft-dated-2016-01-11-please-see-culear/index.html
+curated_resources/dyadic-data-analysis-methodology-in-the/index.html
+curated_resources/easy-preregistration-will-beneft-any-res/index.html
+curated_resources/economic-statistics-with-calculus/index.html
+curated_resources/economics-lesson-with-stata/index.html
+curated_resources/editorial-bias-against-replication-resea/index.html
+curated_resources/editorial-bullying-an-exploration-of-act/index.html
+curated_resources/editorial-introducing-surgery-open-scien/index.html
+curated_resources/editorial-open-science-and-ethics/index.html
+curated_resources/editorial-open-science-in-consciousness/index.html
+curated_resources/editors-at-philosophy-public-affairs-res/index.html
+curated_resources/educational-psychologist-educational-psy/index.html
+curated_resources/effect-of-open-peer-review-on-quality-of/index.html
+curated_resources/effect-of-population-heterogenization-on/index.html
+curated_resources/effect-size-and-power-in-assessing-moder/index.html
+curated_resources/effect-size-estimates-current-use-calcul/index.html
+curated_resources/effect-size-estimation-in-neuroimaging/index.html
+curated_resources/effect-size-guidelines-for-individual-di/index.html
+curated_resources/effect-sizes-and-p-values-what-should-be/index.html
+curated_resources/effect-sizes-why-when-and-how-to-use-the/index.html
+curated_resources/eight-common-but-false-objections-to-the/index.html
+curated_resources/el-control-de-versiones-con-git/index.html
+curated_resources/eleven-strategies-for-making-reproducibl/index.html
+curated_resources/eleven-strategies-for-making-reproducibl_2/index.html
+curated_resources/elsevier-title-level-pricing-dissecting/index.html
+curated_resources/embedding-open-and-reproducible-science/index.html
+curated_resources/embedding-open-and-reproducible-science_2/index.html
+curated_resources/embracing-open-science-paving-the-way-fo/index.html
+curated_resources/emerging-scientific-research-practices/index.html
+curated_resources/empirical-assessment-of-published-effect/index.html
+curated_resources/empirical-evaluation-of-very-large-treat/index.html
+curated_resources/empirical-study-of-data-sharing-by-autho/index.html
+curated_resources/enabling-data-discovery-with-the-astrobi/index.html
+curated_resources/enabling-open-science-initiatives-in-cli/index.html
+curated_resources/endorsement-of-open-science-practices-by/index.html
+curated_resources/enhancing-public-access-to-the-results-o/index.html
+curated_resources/enhancing-reproducibility-through-rigor/index.html
+curated_resources/enhancing-transparency-of-the-research-p/index.html
+curated_resources/eplatypus-an-ecosystem-for-computational/index.html
+curated_resources/equity-transparency-and-accountability-o/index.html
+curated_resources/equivalence-testing-for-psychological-re/index.html
+curated_resources/equivalence-tests-a-practical-primer-for/index.html
+curated_resources/erroneous-analyses-of-interactions-in-ne/index.html
+curated_resources/error-tight-exercises-for-lab-groups-to/index.html
+curated_resources/establishing-trust-in-automated-reasonin/index.html
+curated_resources/estimating-the-prevalence-of-transparenc/index.html
+curated_resources/estimating-the-reproducibility-of-psycho/index.html
+curated_resources/estimating-the-unobserved-hierarchical-b/index.html
+curated_resources/ethnography-vs-zombie-methodologies-what/index.html
+curated_resources/european-sociological-association-journa/index.html
+curated_resources/evading-open-science-the-black-box-of-st/index.html
+curated_resources/evaluating-content-related-validity-evid/index.html
+curated_resources/evaluating-registered-reports-a-naturali/index.html
+curated_resources/evaluating-the-r-index-and-the-p-curve/index.html
+curated_resources/evaluating-what-works/index.html
+curated_resources/evaluation-of-transparency-and-openness/index.html
+curated_resources/everything-hertz/index.html
+curated_resources/everytool4u-json-to-csv-converter/index.html
+curated_resources/evidence-of-insufficient-quality-of-repo/index.html
+curated_resources/evolution-of-reporting-p-values-in-the-b/index.html
+curated_resources/excess-success-for-psychology-articles-i/index.html
+curated_resources/expectations-for-replications-are-yours/index.html
+curated_resources/experimentation-and-manipulation-with-pr/index.html
+curated_resources/experimenter-as-automaton-experimenter-a/index.html
+curated_resources/experiments-with-more-than-one-random-fa/index.html
+curated_resources/exploratory-factor-analysis/index.html
+curated_resources/exploratory-hypothesis-tests-can-be-more/index.html
+curated_resources/exploring-pre-registration-and-pre-analy/index.html
+curated_resources/exploring-regulatory-flexibility-to-crea/index.html
+curated_resources/express-entry-invited-candidates-reprodu/index.html
+curated_resources/fabbs-open-science-statement/index.html
+curated_resources/facilitating-open-science-practices-for/index.html
+curated_resources/fact-sheet-biden-harris-administration-t/index.html
+curated_resources/facts-are-more-important-than-novelty-re/index.html
+curated_resources/faculty-of-science-course-syllabus/index.html
+curated_resources/fair-health-data-in-the-national-and-int/index.html
+curated_resources/faking-science-a-true-story-of-academic/index.html
+curated_resources/false-positive-citations/index.html
+curated_resources/false-positive-psychology-undisclosed-fl/index.html
+curated_resources/false-positive-psychology/index.html
+curated_resources/falsely-reassuring-analyses-of-all-p-val/index.html
+curated_resources/falsifiability-is-not-optional/index.html
+curated_resources/fearing-the-future-of-empirical-psycholo/index.html
+curated_resources/feasibility-of-emulating-clinical-trials/index.html
+curated_resources/feeling-the-future-experimental-evidence/index.html
+curated_resources/fifty-years-of-research-on-questionable/index.html
+curated_resources/finding-evaluating-open-data/index.html
+curated_resources/fishing-commitment-and-communication-a-p/index.html
+curated_resources/five-selfish-reasons-to-work-reproducibl/index.html
+curated_resources/flood-of-fake-science-forces-multiple-jo/index.html
+curated_resources/forcing-a-deterministic-frame-on-probabi/index.html
+curated_resources/forrt-s-open-and-reproducible-science-sy/index.html
+curated_resources/forrt-summaries/index.html
+curated_resources/foster-open-science/index.html
+curated_resources/four-simple-recommendations-to-encourage/index.html
+curated_resources/framework-for-value-based-academic-asses/index.html
+curated_resources/free-and-low-cost-resources-for-graduate/index.html
+curated_resources/from-mental-health-breakfast-interventio/index.html
+curated_resources/from-policy-to-practice-lessons-learned/index.html
+curated_resources/from-pre-registration-to-publication-a-n/index.html
+curated_resources/from-private-incentives-to-public-health/index.html
+curated_resources/funder-data-sharing-policies-overview-an/index.html
+curated_resources/g-power/index.html
+curated_resources/game-based-approaches-for-research-skill/index.html
+curated_resources/game-based-approaches-in-the-teaching-an/index.html
+curated_resources/gelbox-open-source-software-to-improve-r/index.html
+curated_resources/general-principles-of-preclinical-study/index.html
+curated_resources/generic-syllabus-maker/index.html
+curated_resources/genomics-workshop-overview/index.html
+curated_resources/geofor-a-collaborative-forensic-taphonom/index.html
+curated_resources/geospatial-workshop-overview/index.html
+curated_resources/getting-involved-with-top-factor/index.html
+curated_resources/getting-ontologically-serious-about-the/index.html
+curated_resources/ggplot-colors-best-tricks-you-will-love/index.html
+curated_resources/giving-community-psychology-away-a-case/index.html
+curated_resources/glimmpse/index.html
+curated_resources/global-data-tracker-country-level-sanita/index.html
+curated_resources/good-clinical-practice-improves-rigor-an/index.html
+curated_resources/good-enough-practices-in-scientific-comp/index.html
+curated_resources/good-science-bad-science/index.html
+curated_resources/good-supervision-and-mentoring-a-key-par/index.html
+curated_resources/graduate-research-methods/index.html
+curated_resources/graduate-students-need-more-quantitative/index.html
+curated_resources/grand-challenge-social-psychology-withou/index.html
+curated_resources/graphical-causal-models/index.html
+curated_resources/growth-from-uncertainty-understanding-th/index.html
+curated_resources/guide-your-students-to-become-better-res/index.html
+curated_resources/guideline-for-reporting-systematic-revie/index.html
+curated_resources/guidelines-for-evaluating-the-comparabil/index.html
+curated_resources/guidelines-to-improve-internationalizati/index.html
+curated_resources/habits-and-perceptions-regarding-open-sc/index.html
+curated_resources/hack-your-way-to-scientific-glory/index.html
+curated_resources/hail-the-impossible-p-values-evidence-an/index.html
+curated_resources/hark-no-more-on-the-preregistration-of-c/index.html
+curated_resources/harking-how-badly-can-cherry-picking-and/index.html
+curated_resources/harking-hypothesizing-after-the-results/index.html
+curated_resources/harry-potter-and-the-methods-of-reproduc/index.html
+curated_resources/harvard-professor-s-papers-contain-copie/index.html
+curated_resources/harvard-teaching-hospital-seeks-retracti/index.html
+curated_resources/hello-keyboard-combine-two-columns/index.html
+curated_resources/heterogeneity-in-effect-size-estimates/index.html
+curated_resources/heyutils-json-schema-validator/index.html
+curated_resources/history-and-methods-of-psychology-syllab/index.html
+curated_resources/history-and-philosophy-of-psychology/index.html
+curated_resources/history-repeating-guidelines-to-address/index.html
+curated_resources/how-and-whether-to-teach-undergraduates/index.html
+curated_resources/how-can-preregistration-contribute-to-re/index.html
+curated_resources/how-failure-has-made-mathematics-stronge/index.html
+curated_resources/how-flash-mobs-can-be-used-for-data-coll/index.html
+curated_resources/how-openness-facilitates-collaboration/index.html
+curated_resources/how-racist-policing-took-over-american-c/index.html
+curated_resources/how-scientists-can-stop-fooling-themselv/index.html
+curated_resources/how-significant-are-the-public-dimension/index.html
+curated_resources/how-to-classify-detect-and-manage-univar/index.html
+curated_resources/how-to-crack-pre-registration-toward-tra/index.html
+curated_resources/how-to-make-data-open-stop-overlooking-l/index.html
+curated_resources/how-to-make-more-published-research-true/index.html
+curated_resources/how-to-produce-identify-and-motivate-rob/index.html
+curated_resources/how-to-test-ai-research-tools-a-repeatab/index.html
+curated_resources/how-to-use-osf-as-an-electronic-lab-note/index.html
+curated_resources/how-uk-science-is-failing-black-research/index.html
+curated_resources/i-fooled-millions-into-thinking-chocolat/index.html
+curated_resources/i-m-telling-you-my-story-not-publishing/index.html
+curated_resources/identifying-participants-in-the-personal/index.html
+curated_resources/iit-vs-gnwt-and-the-meaning-of-evidence/index.html
+curated_resources/image-processing-with-python/index.html
+curated_resources/impact-of-genetic-background-and-experim/index.html
+curated_resources/improvements-since-the-replication-crisi/index.html
+curated_resources/improving-evidence-based-practice-throug/index.html
+curated_resources/improving-our-science-reproducibility-re/index.html
+curated_resources/improving-our-science/index.html
+curated_resources/improving-the-dependability-of-research/index.html
+curated_resources/improving-transparency-in-observational/index.html
+curated_resources/improving-your-statistical-inferences/index.html
+curated_resources/in-praise-of-moderation-suggestions-for/index.html
+curated_resources/in-praise-of-the-null-hypothesis-statist/index.html
+curated_resources/inappropriate-fiddling-with-statistical/index.html
+curated_resources/inconsistent-multiple-testing-correction/index.html
+curated_resources/incorporating-ecological-momentary-asses/index.html
+curated_resources/increasing-efficiency-of-preclinical-res/index.html
+curated_resources/increasing-the-transparency-of-systemati/index.html
+curated_resources/increasing-transparency-through-a-multiv/index.html
+curated_resources/increasing-transparency-through-open-sci/index.html
+curated_resources/increasing-value-and-reducing-waste-addr/index.html
+curated_resources/index.html
+curated_resources/index.xml
+curated_resources/infra-finder-your-hub-for-finding-infras/index.html
+curated_resources/innovations-in-graduate-education-progra/index.html
+curated_resources/innovative-mentoring/index.html
+curated_resources/instead-of-playing-the-game-it-is-time-t/index.html
+curated_resources/intellectual-humility-is-central-to-scie/index.html
+curated_resources/interactional-roles-and-social-actions-t/index.html
+curated_resources/internal-conceptual-replications-do-not/index.html
+curated_resources/international-collaboration-to-help-impl/index.html
+curated_resources/international-initiatives-to-enhance-awa/index.html
+curated_resources/interpreting-confidence-intervals/index.html
+curated_resources/interpreting-correlations-an-interactive/index.html
+curated_resources/interpreting-effect-sizes-and-confidence/index.html
+curated_resources/interpreting-effect-sizes-toward-a-quant/index.html
+curated_resources/intro-to-calculating-confidence-interval/index.html
+curated_resources/intro-to-r-and-rstudio-for-genomics/index.html
+curated_resources/intro-to-the-special-issue/index.html
+curated_resources/introducing-a-framework-for-open-and-rep/index.html
+curated_resources/introducing-jasp/index.html
+curated_resources/introducing-nowhere-lab/index.html
+curated_resources/introducing-open-science-in-teaching-hea/index.html
+curated_resources/introducing-preregistration-of-research/index.html
+curated_resources/introducing-the-national-open-research-t/index.html
+curated_resources/introduction-materials-for-reproducible/index.html
+curated_resources/introduction-to-cloud-computing-for-geno/index.html
+curated_resources/introduction-to-geospatial-concepts/index.html
+curated_resources/introduction-to-geospatial-raster-and-ve/index.html
+curated_resources/introduction-to-git-github/index.html
+curated_resources/introduction-to-jupyter-notebooks/index.html
+curated_resources/introduction-to-mediation-moderation-and/index.html
+curated_resources/introduction-to-meta-analysis/index.html
+curated_resources/introduction-to-open-science-principles/index.html
+curated_resources/introduction-to-power-analyses-in-r/index.html
+curated_resources/introduction-to-power/index.html
+curated_resources/introduction-to-preprints/index.html
+curated_resources/introduction-to-r-for-geospatial-data/index.html
+curated_resources/introduction-to-research-data-management/index.html
+curated_resources/introduction-to-simulations/index.html
+curated_resources/introduction-to-the-command-line-for-eco/index.html
+curated_resources/introduction-to-the-command-line-for-gen/index.html
+curated_resources/introduction-to-web-scraping/index.html
+curated_resources/investigating-the-nature-of-open-science/index.html
+curated_resources/investigating-variation-in-replicability/index.html
+curated_resources/investigation-and-its-discontents-some-c/index.html
+curated_resources/ioannidis-j-p-a-2012-why-science-is-not/index.html
+curated_resources/is-preregistration-worthwhile/index.html
+curated_resources/is-psychology-suffering-from-a-replicati/index.html
+curated_resources/is-replication-possible-in-qualitative-r/index.html
+curated_resources/is-the-call-to-abandon-p-values-the-red/index.html
+curated_resources/is-the-replicability-crisis-overblown-th/index.html
+curated_resources/is-there-a-credibility-crisis-in-strateg/index.html
+curated_resources/is-there-a-free-lunch-in-inference/index.html
+curated_resources/issues-in-the-registration-of-clinical-t/index.html
+curated_resources/it-s-time-to-broaden-the-replicability-c/index.html
+curated_resources/it-s-time-to-join-the-conversation-visio/index.html
+curated_resources/joy-and-rigor-in-behavioral-science/index.html
+curated_resources/joy-in-academia-centering-racialized-voi/index.html
+curated_resources/jpa-promotes-open-science/index.html
+curated_resources/jupyter-notebooks-with-r-git/index.html
+curated_resources/just-post-it-the-lesson-from-two-cases-o/index.html
+curated_resources/just-prepare-putting-resident-practices/index.html
+curated_resources/justify-your-alpha/index.html
+curated_resources/key-practices-for-the-language-scientist/index.html
+curated_resources/kinds-of-replication/index.html
+curated_resources/knowledge-rights-21/index.html
+curated_resources/l-autorat-et-nous-de-la-collaboration-au/index.html
+curated_resources/la-terminal-de-unix/index.html
+curated_resources/lab-js-online-research-made-easy/index.html
+curated_resources/landmark-college-institute-for-research/index.html
+curated_resources/last-contact-a-science-adventure/index.html
+curated_resources/last-week-tonight-with-john-oliver-scien/index.html
+curated_resources/latent-variable-modeling-with-r/index.html
+curated_resources/learn-stats-with-jamovi/index.html
+curated_resources/learning-statistics-with-r/index.html
+curated_resources/leonardo-da-vinci-preregistration-and-th/index.html
+curated_resources/let-s-celebrate-earth-day-as-the-age-of/index.html
+curated_resources/let-s-publish-fewer-papers/index.html
+curated_resources/let-s-put-our-money-where-our-mouth-is-i/index.html
+curated_resources/level-up-the-reproducibility-of-your-dat/index.html
+curated_resources/leveraging-open-ecosystems-to-enhance-re/index.html
+curated_resources/library-carpentry-introduction-to-git/index.html
+curated_resources/library-carpentry-introduction-to-workin/index.html
+curated_resources/library-carpentry-openrefine/index.html
+curated_resources/library-carpentry-sql/index.html
+curated_resources/library-carpentry-the-unix-shell/index.html
+curated_resources/licensing-your-research/index.html
+curated_resources/likelihood-of-null-effects-of-large-nhlb/index.html
+curated_resources/linking-to-data-effect-on-citation-rates/index.html
+curated_resources/local-grassroots-networks-engaging-open/index.html
+curated_resources/logical-and-methodological-issues-affect/index.html
+curated_resources/longitudinal-structural-equation-modelin/index.html
+curated_resources/low-research-data-availability-in-educat/index.html
+curated_resources/making-erp-research-more-transparent-gui/index.html
+curated_resources/making-lemonade-out-of-remote-teaching/index.html
+curated_resources/making-prospective-registration-of-obser/index.html
+curated_resources/making-qualitative-data-reusable-a-short/index.html
+curated_resources/making-replication-mainstream/index.html
+curated_resources/making-research-data-publicly-accessible/index.html
+curated_resources/making-science-public-a-review-of-journa/index.html
+curated_resources/managing-a-personal-research-archive/index.html
+curated_resources/managing-qualitative-social-science-data/index.html
+curated_resources/many-labs-3-evaluating-participant-pool/index.html
+curated_resources/mapping-open-and-internationally-relevan/index.html
+curated_resources/mapping-the-universe-of-registered-repor/index.html
+curated_resources/materials-for-the-webinar-helping-scienc/index.html
+curated_resources/materials-scientist-explains-why-he-star/index.html
+curated_resources/maximizing-data-transparency-with-rigor/index.html
+curated_resources/maximizing-the-reproducibility-of-your-r/index.html
+curated_resources/measurement-error-and-the-replication-cr/index.html
+curated_resources/measurement-matters/index.html
+curated_resources/measuring-the-prevalence-of-questionable/index.html
+curated_resources/medical-product-industry-ties-to-patient/index.html
+curated_resources/medicines-and-healthcare-products-regula/index.html
+curated_resources/meeting-the-requirements-of-funders-arou/index.html
+curated_resources/mentorship-practices-that-improve-the-cu/index.html
+curated_resources/mermaid-live-editor/index.html
+curated_resources/meta-analyses-are-no-substitute-for-regi/index.html
+curated_resources/meta-assessment-of-bias-in-science/index.html
+curated_resources/meta-docenia/index.html
+curated_resources/meta-regression-approximations-to-reduce/index.html
+curated_resources/metascience-forum-2020/index.html
+curated_resources/methodological-advances-in-behavioral-re/index.html
+curated_resources/methods-and-results-of-studies-on-report/index.html
+curated_resources/methods-for-reliable-transparent-and-ope/index.html
+curated_resources/milgram-obedience-experiment-an-agent-ba/index.html
+curated_resources/millions-of-research-papers-at-risk-of-d/index.html
+curated_resources/mindless-statistics/index.html
+curated_resources/mini-course-on-reproducibility-open-rese/index.html
+curated_resources/mini-meta-analysis-of-your-own-studies-s/index.html
+curated_resources/minimal-criteria-for-reporting-mesenchym/index.html
+curated_resources/minimizing-questionable-research-practic/index.html
+curated_resources/minimizing-variability-in-developmental/index.html
+curated_resources/misaligned-incentives-hurt-science-but-w/index.html
+curated_resources/mission-p-curve/index.html
+curated_resources/mitigating-illusory-results-through-prer/index.html
+curated_resources/mobilizing-data-during-a-crisis-building/index.html
+curated_resources/more-than-meets-the-itt-a-guide-for-anti/index.html
+curated_resources/moving-toward-transparent-open-and-repro/index.html
+curated_resources/multi-site-replications-in-social-psycho/index.html
+curated_resources/multilevel-analysis-an-introduction-to-b/index.html
+curated_resources/multiscale-modeling-in-the-framework-of/index.html
+curated_resources/natio-nal-guide-li-nes-for-promoting-ope/index.html
+curated_resources/national-open-access-monitor-launch-mark/index.html
+curated_resources/nature-earns-ire-over-lack-of-code-avail/index.html
+curated_resources/navigating-open-scholarship-for-neurodiv/index.html
+curated_resources/navigating-the-science-system-research-i/index.html
+curated_resources/negative-results-are-disappearing-from-m/index.html
+curated_resources/negativity-towards-negative-results-a-di/index.html
+curated_resources/neuroscientist-explains/index.html
+curated_resources/new-trends-in-science-communication-fost/index.html
+curated_resources/news-at-a-glance-planning-for-mentoring/index.html
+curated_resources/niaid-centers-of-excellence-for-influenz/index.html
+curated_resources/nieuw-onderzoeksprogramma-voor-kansengel/index.html
+curated_resources/nigms-clearinghouse-for-training-modules/index.html
+curated_resources/nih-scientific-data-sharing/index.html
+curated_resources/no-evidence-of-publication-bias-in-clima/index.html
+curated_resources/novel-methods-to-deal-with-publication-b/index.html
+curated_resources/nowiknowmyabcd-a-global-resource-hub-for/index.html
+curated_resources/null-hypothesis-significance-testing-a-r/index.html
+curated_resources/null-hypothesis-significance-testing-on/index.html
+curated_resources/number-of-countries-with-open-science-po/index.html
+curated_resources/obviously-chatgpt-how-reviewers-accused/index.html
+curated_resources/on-being-a-scientist-a-guide-to-responsi/index.html
+curated_resources/on-not-confusing-the-tree-of-trustworthy/index.html
+curated_resources/on-the-challenges-of-drawing-conclusions/index.html
+curated_resources/on-the-origins-of-the-05-level-of-statis/index.html
+curated_resources/on-the-plurality-of-methodological-world/index.html
+curated_resources/on-the-reproducibility-of-meta-analyses/index.html
+curated_resources/on-the-reproducibility-of-psychological/index.html
+curated_resources/on-the-reproducibility-of-science-unique/index.html
+curated_resources/on-the-surprising-longevity-of-flogged-h/index.html
+curated_resources/on-the-use-and-misuses-of-preregistratio/index.html
+curated_resources/one-cheer-for-null-hypothesis-significan/index.html
+curated_resources/online-experimentation-and-sampling-in-c/index.html
+curated_resources/online-experiments-for-language-scientis/index.html
+curated_resources/open-access-directory/index.html
+curated_resources/open-access-journal-publication-in-healt/index.html
+curated_resources/open-access-target-validation-is-a-more/index.html
+curated_resources/open-access-tracking-project/index.html
+curated_resources/open-and-reproducible-methods-syllabus/index.html
+curated_resources/open-and-reproducible-research-in-psycho/index.html
+curated_resources/open-and-reproducible-science-syllabus/index.html
+curated_resources/open-and-reproducible-science-syllabus_2/index.html
+curated_resources/open-and-reproducible-science-walks-into/index.html
+curated_resources/open-and-reproducible-science/index.html
+curated_resources/open-and-responsible-researcher-reward-a/index.html
+curated_resources/open-code-for-open-science/index.html
+curated_resources/open-data-governance-at-the-canadian-ope/index.html
+curated_resources/open-developmental-science-an-overview-a/index.html
+curated_resources/open-education-challenge-series/index.html
+curated_resources/open-education-data-research-and-policy/index.html
+curated_resources/open-education-in-promotion-tenure-and-f/index.html
+curated_resources/open-educational-resources-equitable-and/index.html
+curated_resources/open-educational-resources-fur-die-hno-h/index.html
+curated_resources/open-for-insight-experimental-methods-op/index.html
+curated_resources/open-hardware-in-microscopy/index.html
+curated_resources/open-intro-statistics/index.html
+curated_resources/open-lab/index.html
+curated_resources/open-pedagogy-a-driving-force-for-meanin/index.html
+curated_resources/open-pedagogy-how-to-engage-your-student/index.html
+curated_resources/open-peer-review-pros-and-cons-from-the/index.html
+curated_resources/open-qualitative-research-a-primer-from/index.html
+curated_resources/open-reproducible-research-workshop/index.html
+curated_resources/open-research-community-accelerator-orca/index.html
+curated_resources/open-research-examples-of-good-practice/index.html
+curated_resources/open-research-reforms-and-the-capitalist/index.html
+curated_resources/open-resources-for-biology-education-orb/index.html
+curated_resources/open-rigorous-and-reproducible-research/index.html
+curated_resources/open-scholarship-norms-among-education-r/index.html
+curated_resources/open-scholarship-where-are-the-self-corr/index.html
+curated_resources/open-science-2-0-towards-a-truly-collabo/index.html
+curated_resources/open-science-2030-in-the-netherlands-npo/index.html
+curated_resources/open-science-a-practical-guide-for-early/index.html
+curated_resources/open-science-and-methodological-improvem/index.html
+curated_resources/open-science-and-reproducible-research-k/index.html
+curated_resources/open-science-and-the-climate-crisis/index.html
+curated_resources/open-science-challenges-benefits-and-tip/index.html
+curated_resources/open-science-clusters-action-for-researc/index.html
+curated_resources/open-science-decoded/index.html
+curated_resources/open-science-education-through-student-p/index.html
+curated_resources/open-science-hardware-and-space-research/index.html
+curated_resources/open-science-in-dementia-care-embedded-p/index.html
+curated_resources/open-science-in-latin-america/index.html
+curated_resources/open-science-in-sport-and-exercise-psych/index.html
+curated_resources/open-science-inclusive-psychology/index.html
+curated_resources/open-science-interventions-to-improve-re/index.html
+curated_resources/open-science-is-for-aging-research-too/index.html
+curated_resources/open-science-made-easy/index.html
+curated_resources/open-science-manual/index.html
+curated_resources/open-science-many-hands-make-light-work/index.html
+curated_resources/open-science-practices-are-on-the-rise-t/index.html
+curated_resources/open-science-practices-are-on-the-rise-t_2/index.html
+curated_resources/open-science-practices-in-psychiatric-ge/index.html
+curated_resources/open-science-practices-need-substantial/index.html
+curated_resources/open-science-retreat/index.html
+curated_resources/open-science-saves-lives-lessons-from-th/index.html
+curated_resources/open-science-saves-lives-lessons-from-th_2/index.html
+curated_resources/open-science-seminar-how-to-do-credible/index.html
+curated_resources/open-science-session-gsa-2019/index.html
+curated_resources/open-science-sprint-content/index.html
+curated_resources/open-science-takes-on-the-coronavirus-pa/index.html
+curated_resources/open-science-teaching/index.html
+curated_resources/open-science-the-replication-crisis-and/index.html
+curated_resources/open-science-toolbox/index.html
+curated_resources/open-science-training-handbook/index.html
+curated_resources/open-science-training-in-triple/index.html
+curated_resources/open-science-what-why-and-how/index.html
+curated_resources/open-science-workshop-materials-of-the-l/index.html
+curated_resources/open-science/index.html
+curated_resources/open-sharing-of-data-on-close-relationsh/index.html
+curated_resources/open-source-exploitation-david-whitney-n/index.html
+curated_resources/open-source-guides/index.html
+curated_resources/open-source-research-methods-for-the-soc/index.html
+curated_resources/open-stats-lab-teach-statistics-using-op/index.html
+curated_resources/open-stats-lab/index.html
+curated_resources/openaccess-net/index.html
+curated_resources/openaire-open-science-train-the-trainer/index.html
+curated_resources/opening-knowledge-retaining-rights-and-o/index.html
+curated_resources/opening-open-science-to-all-demystifying/index.html
+curated_resources/opening-science/index.html
+curated_resources/opening-up-understanding-of-neurodiversi/index.html
+curated_resources/openmreye-camera-free-magnetic-resonance/index.html
+curated_resources/openrefine-for-social-science-data/index.html
+curated_resources/opensafely-a-platform-for-analysing-elec/index.html
+curated_resources/opinion-promoting-open-science/index.html
+curated_resources/optimizing-research-collaboration-for-re/index.html
+curated_resources/optimizing-research-collaboration/index.html
+curated_resources/optimizing-research-payoff/index.html
+curated_resources/optimizing-the-methodology-of-human-slee/index.html
+curated_resources/orcc-ukrn-primer-on-working-in-open-rese/index.html
+curated_resources/osf-collections-supporting-research-disc/index.html
+curated_resources/osf-deep-dive/index.html
+curated_resources/osf-in-the-classroom/index.html
+curated_resources/osf-in-the-lab-organizing-related-projec/index.html
+curated_resources/osf101/index.html
+curated_resources/our-data-ourselves-a-framework-for-using/index.html
+curated_resources/outcome-reporting-bias-in-randomized-con/index.html
+curated_resources/overcoming-the-knowledge-barrier-in-open/index.html
+curated_resources/oxford-berlin-open-research-summer-schoo/index.html
+curated_resources/oxford-berlin-summer-school-on-open-rese/index.html
+curated_resources/p-curve-a-key-to-the-file-drawer/index.html
+curated_resources/p-curve-visualization-updated-with-log-x/index.html
+curated_resources/p-curve/index.html
+curated_resources/p-hacking-its-costs-and-when-it-is-warra/index.html
+curated_resources/p-values-and-statistical-practice/index.html
+curated_resources/p-values-in-display-items-are-ubiquitous/index.html
+curated_resources/page/1/index.html
+curated_resources/page/10/index.html
+curated_resources/page/100/index.html
+curated_resources/page/101/index.html
+curated_resources/page/102/index.html
+curated_resources/page/103/index.html
+curated_resources/page/104/index.html
+curated_resources/page/105/index.html
+curated_resources/page/106/index.html
+curated_resources/page/107/index.html
+curated_resources/page/108/index.html
+curated_resources/page/109/index.html
+curated_resources/page/11/index.html
+curated_resources/page/110/index.html
+curated_resources/page/111/index.html
+curated_resources/page/112/index.html
+curated_resources/page/113/index.html
+curated_resources/page/114/index.html
+curated_resources/page/115/index.html
+curated_resources/page/116/index.html
+curated_resources/page/117/index.html
+curated_resources/page/118/index.html
+curated_resources/page/119/index.html
+curated_resources/page/12/index.html
+curated_resources/page/120/index.html
+curated_resources/page/121/index.html
+curated_resources/page/122/index.html
+curated_resources/page/123/index.html
+curated_resources/page/124/index.html
+curated_resources/page/125/index.html
+curated_resources/page/126/index.html
+curated_resources/page/127/index.html
+curated_resources/page/128/index.html
+curated_resources/page/129/index.html
+curated_resources/page/13/index.html
+curated_resources/page/130/index.html
+curated_resources/page/131/index.html
+curated_resources/page/132/index.html
+curated_resources/page/133/index.html
+curated_resources/page/134/index.html
+curated_resources/page/135/index.html
+curated_resources/page/136/index.html
+curated_resources/page/137/index.html
+curated_resources/page/138/index.html
+curated_resources/page/139/index.html
+curated_resources/page/14/index.html
+curated_resources/page/140/index.html
+curated_resources/page/141/index.html
+curated_resources/page/142/index.html
+curated_resources/page/143/index.html
+curated_resources/page/144/index.html
+curated_resources/page/145/index.html
+curated_resources/page/146/index.html
+curated_resources/page/147/index.html
+curated_resources/page/148/index.html
+curated_resources/page/149/index.html
+curated_resources/page/15/index.html
+curated_resources/page/16/index.html
+curated_resources/page/17/index.html
+curated_resources/page/18/index.html
+curated_resources/page/19/index.html
+curated_resources/page/2/index.html
+curated_resources/page/20/index.html
+curated_resources/page/21/index.html
+curated_resources/page/22/index.html
+curated_resources/page/23/index.html
+curated_resources/page/24/index.html
+curated_resources/page/25/index.html
+curated_resources/page/26/index.html
+curated_resources/page/27/index.html
+curated_resources/page/28/index.html
+curated_resources/page/29/index.html
+curated_resources/page/3/index.html
+curated_resources/page/30/index.html
+curated_resources/page/31/index.html
+curated_resources/page/32/index.html
+curated_resources/page/33/index.html
+curated_resources/page/34/index.html
+curated_resources/page/35/index.html
+curated_resources/page/36/index.html
+curated_resources/page/37/index.html
+curated_resources/page/38/index.html
+curated_resources/page/39/index.html
+curated_resources/page/4/index.html
+curated_resources/page/40/index.html
+curated_resources/page/41/index.html
+curated_resources/page/42/index.html
+curated_resources/page/43/index.html
+curated_resources/page/44/index.html
+curated_resources/page/45/index.html
+curated_resources/page/46/index.html
+curated_resources/page/47/index.html
+curated_resources/page/48/index.html
+curated_resources/page/49/index.html
+curated_resources/page/5/index.html
+curated_resources/page/50/index.html
+curated_resources/page/51/index.html
+curated_resources/page/52/index.html
+curated_resources/page/53/index.html
+curated_resources/page/54/index.html
+curated_resources/page/55/index.html
+curated_resources/page/56/index.html
+curated_resources/page/57/index.html
+curated_resources/page/58/index.html
+curated_resources/page/59/index.html
+curated_resources/page/6/index.html
+curated_resources/page/60/index.html
+curated_resources/page/61/index.html
+curated_resources/page/62/index.html
+curated_resources/page/63/index.html
+curated_resources/page/64/index.html
+curated_resources/page/65/index.html
+curated_resources/page/66/index.html
+curated_resources/page/67/index.html
+curated_resources/page/68/index.html
+curated_resources/page/69/index.html
+curated_resources/page/7/index.html
+curated_resources/page/70/index.html
+curated_resources/page/71/index.html
+curated_resources/page/72/index.html
+curated_resources/page/73/index.html
+curated_resources/page/74/index.html
+curated_resources/page/75/index.html
+curated_resources/page/76/index.html
+curated_resources/page/77/index.html
+curated_resources/page/78/index.html
+curated_resources/page/79/index.html
+curated_resources/page/8/index.html
+curated_resources/page/80/index.html
+curated_resources/page/81/index.html
+curated_resources/page/82/index.html
+curated_resources/page/83/index.html
+curated_resources/page/84/index.html
+curated_resources/page/85/index.html
+curated_resources/page/86/index.html
+curated_resources/page/87/index.html
+curated_resources/page/88/index.html
+curated_resources/page/89/index.html
+curated_resources/page/9/index.html
+curated_resources/page/90/index.html
+curated_resources/page/91/index.html
+curated_resources/page/92/index.html
+curated_resources/page/93/index.html
+curated_resources/page/94/index.html
+curated_resources/page/95/index.html
+curated_resources/page/96/index.html
+curated_resources/page/97/index.html
+curated_resources/page/98/index.html
+curated_resources/page/99/index.html
+curated_resources/pangea/index.html
+curated_resources/participatory-research-approaches-in-alz/index.html
+curated_resources/pathos-open-science-impact-pathways/index.html
+curated_resources/paths-in-strange-spaces-a-comment-on-pre/index.html
+curated_resources/paving-the-way-for-greater-open-science/index.html
+curated_resources/pbfj-editorial-engaging-with-responsible/index.html
+curated_resources/pearl-neuro-database-eeg-fmri-health-and/index.html
+curated_resources/peer-review-decisions-decisions/index.html
+curated_resources/peer-review-practices-of-psychological-j/index.html
+curated_resources/performing-high-powered-studies-efficien/index.html
+curated_resources/perspectives-on-improving-methods-in-psy/index.html
+curated_resources/perspectives-replication-is-more-than-me/index.html
+curated_resources/pewtranslate-census-language-lookup/index.html
+curated_resources/philosophical-psychology-1989/index.html
+curated_resources/plan-e-for-education-open-access-to-educ/index.html
+curated_resources/platform-controlled-social-media-apis-th/index.html
+curated_resources/plotting-and-programming-in-python/index.html
+curated_resources/point-of-view-an-annotated-introductory/index.html
+curated_resources/point-of-view-how-open-science-helps-res/index.html
+curated_resources/policy-recommendations-to-ensure-that-re/index.html
+curated_resources/poor-replication-validity-of-biomedical/index.html
+curated_resources/poor-statistical-reporting-inadequate-da/index.html
+curated_resources/positionality-statements-are-just-the-ti/index.html
+curated_resources/positionality-statements-in-science/index.html
+curated_resources/positive-deviance-underlies-successful-s/index.html
+curated_resources/positive-results-increase-down-the-hiera/index.html
+curated_resources/power-analysis-and-effect-size-in-mixed/index.html
+curated_resources/power-failure-why-small-sample-size-unde/index.html
+curated_resources/power-posing-reassessing-the-evidence-be/index.html
+curated_resources/power-up-a-reanalysis-of-power-failure-i/index.html
+curated_resources/practical-considerations-for-navigating/index.html
+curated_resources/practical-guides-on-open-science-for-res/index.html
+curated_resources/practical-solutions-for-sharing-data-and/index.html
+curated_resources/practical-steps-for-increasing-opennes-a/index.html
+curated_resources/pre-analysis-plans-a-stocktaking/index.html
+curated_resources/pre-analysis-plans-an-early-stocktaking/index.html
+curated_resources/pre-analysis-plans-have-limited-upside-e/index.html
+curated_resources/pre-registration-and-results-free-review/index.html
+curated_resources/pre-registration-in-social-psychology-a/index.html
+curated_resources/pre-registration-in-the-undergraduate-di/index.html
+curated_resources/pre-registration-of-clinical-trials-is-a/index.html
+curated_resources/pre-registration-of-mathematical-models/index.html
+curated_resources/pre-registration-weighing-costs-and-bene/index.html
+curated_resources/pre-registration-why-and-how/index.html
+curated_resources/pre-results-review-in-economics-lessons/index.html
+curated_resources/pre-self-what-fraction-of-a-journal-s-pa/index.html
+curated_resources/prediction-interval-what-to-expect-when/index.html
+curated_resources/preliminary-analysis-of-covid-19-academi/index.html
+curated_resources/premiering-pre-registration-at-plos-biol/index.html
+curated_resources/preparing-code-and-data-for-computationa/index.html
+curated_resources/preregister-your-ethical-redlines-vulner/index.html
+curated_resources/preregistering-qualitative-research-a-de/index.html
+curated_resources/preregistering-qualitative-research/index.html
+curated_resources/preregistering-transparency-and-large-sa/index.html
+curated_resources/preregistration-and-incentives/index.html
+curated_resources/preregistration-and-registered-reports-i/index.html
+curated_resources/preregistration-and-reproducibility/index.html
+curated_resources/preregistration-as-a-way-to-limit-questi/index.html
+curated_resources/preregistration-becoming-the-norm-in-psy/index.html
+curated_resources/preregistration-definition-advantages-di/index.html
+curated_resources/preregistration-does-not-improve-the-tra/index.html
+curated_resources/preregistration-improve-research-rigor-r/index.html
+curated_resources/preregistration-in-complex-contexts-a-pr/index.html
+curated_resources/preregistration-in-diverse-contexts-a-pr/index.html
+curated_resources/preregistration-in-experimental-linguist/index.html
+curated_resources/preregistration-in-infant-research-a-pri/index.html
+curated_resources/preregistration-in-single-case-design-re/index.html
+curated_resources/preregistration-is-hard-and-worthwhile/index.html
+curated_resources/preregistration-is-neither-sufficient-no/index.html
+curated_resources/preregistration-is-not-a-panacea-but-why/index.html
+curated_resources/preregistration-of-analyses-of-preexisti/index.html
+curated_resources/preregistration-of-animal-research-proto/index.html
+curated_resources/preregistration-of-epidemiologic-studies/index.html
+curated_resources/preregistration-of-epidemiology-protocol/index.html
+curated_resources/preregistration-of-epidemiology-protocol_2/index.html
+curated_resources/preregistration-of-epidemiology-protocol_3/index.html
+curated_resources/preregistration-of-exploratory-research/index.html
+curated_resources/preregistration-of-information-systems-r/index.html
+curated_resources/preregistration-of-machine-learning-rese/index.html
+curated_resources/preregistration-of-modeling-exercises-ma/index.html
+curated_resources/preregistration-of-qualitative-research/index.html
+curated_resources/preregistration-of-randomized-controlled/index.html
+curated_resources/preregistration-of-secondary-data-analys/index.html
+curated_resources/preregistration-of-studies-with-existing/index.html
+curated_resources/preregistration-of-study-protocols-is-un/index.html
+curated_resources/preregistration-overview-page/index.html
+curated_resources/preregistration-practical-considerations/index.html
+curated_resources/preregistration-replication-and-nonexper/index.html
+curated_resources/preregistration-specificity-adherence-a/index.html
+curated_resources/preregistration-templates-as-a-new-addit/index.html
+curated_resources/preregistration-the-good-the-bad-and-the/index.html
+curated_resources/presentations-given-by-center-for-open-s/index.html
+curated_resources/preserving-privacy-in-the-era-of-opennes/index.html
+curated_resources/primer-on-reproducible-research-in-r-enh/index.html
+curated_resources/priming-replication-and-the-hardest-scie/index.html
+curated_resources/principles-of-instruction-research-based/index.html
+curated_resources/prioritizing-open-science-in-space-medic/index.html
+curated_resources/privacy-and-data-based-research/index.html
+curated_resources/probing-birth-order-effects-on-narrow-tr/index.html
+curated_resources/problems-in-using-p-curve-analysis-and-t/index.html
+curated_resources/procedimentos-para-investigacao-cientifi/index.html
+curated_resources/processes-and-lessons-learned-in-establi/index.html
+curated_resources/programming-psychological-experiments-us/index.html
+curated_resources/programming-with-matlab/index.html
+curated_resources/programming-with-python/index.html
+curated_resources/programming-with-r/index.html
+curated_resources/project-organization-and-management-for/index.html
+curated_resources/project-teaching-integrity-in-empirical/index.html
+curated_resources/promises-and-perils-of-pre-analysis-plan/index.html
+curated_resources/promoting-an-open-research-culture/index.html
+curated_resources/promoting-civility-in-formal-and-informa/index.html
+curated_resources/promoting-transparency-in-social-science/index.html
+curated_resources/promotion-tenure-aligning-incentives-wit/index.html
+curated_resources/psychological-testing-and-psychological/index.html
+curated_resources/psychologists-are-open-to-change-yet-war/index.html
+curated_resources/psychology-as-a-robust-science/index.html
+curated_resources/psychology-s-credibility-revolution/index.html
+curated_resources/psychology-s-renaissance/index.html
+curated_resources/psychology-s-replication-crisis-and-the/index.html
+curated_resources/psychology-science-and-knowledge-constru/index.html
+curated_resources/psyteachr/index.html
+curated_resources/pubcompare-the-largest-database-of-trust/index.html
+curated_resources/public-availability-of-published-researc/index.html
+curated_resources/public-data-archiving-in-ecology-and-evo/index.html
+curated_resources/publication-bias-and-the-canonization-of/index.html
+curated_resources/publication-bias-and-the-limited-strengt/index.html
+curated_resources/publication-bias-in-clinical-research/index.html
+curated_resources/publication-bias-in-psychology-a-diagnos/index.html
+curated_resources/publication-bias-in-the-social-sciences/index.html
+curated_resources/publication-decisions-and-their-possible/index.html
+curated_resources/publication-of-nih-funded-trials-registe/index.html
+curated_resources/publication-prejudices-an-experimental-s/index.html
+curated_resources/publication-pressure-and-scientific-misc/index.html
+curated_resources/publication-rate-in-preclinical-research/index.html
+curated_resources/publishing-in-the-open-access-and-open-s/index.html
+curated_resources/python-for-harvesting-data-on-the-web/index.html
+curated_resources/python-for-humanities/index.html
+curated_resources/qdr-data-for-teaching/index.html
+curated_resources/qualitative-open-science-practices/index.html
+curated_resources/qualitative-research-using-open-tools/index.html
+curated_resources/quality-indicators-of-secondary-data-ana/index.html
+curated_resources/quality-uncertainty-erodes-trust-in-scie/index.html
+curated_resources/quantitative-emerging-practices-and-meth/index.html
+curated_resources/questionable-and-open-research-practices/index.html
+curated_resources/questionable-metascience-practices/index.html
+curated_resources/questionable-research-practices-among-it/index.html
+curated_resources/questionable-research-practices-among-re/index.html
+curated_resources/questionable-research-practices-followin/index.html
+curated_resources/questionable-research-practices-in-ecolo/index.html
+curated_resources/questionable-research-practices-revisite/index.html
+curated_resources/r-for-reproducible-scientific-analysis/index.html
+curated_resources/r-for-social-scientists/index.html
+curated_resources/r-graphics-cookbook-practical-recipes-fo/index.html
+curated_resources/r-para-analisis-cientificos-reproducible/index.html
+curated_resources/race-to-the-bottom-competition-and-quali/index.html
+curated_resources/raiders-of-the-lost-hark-a-reproducible/index.html
+curated_resources/raise-standards-for-preclinical-cancer-r/index.html
+curated_resources/raising-awareness-of-uncertain-choices-i/index.html
+curated_resources/randomization-does-not-help-much-compara/index.html
+curated_resources/rate-and-success-of-study-replication-in/index.html
+curated_resources/rationalizing-pre-analysis-plans-statist/index.html
+curated_resources/re-run-repeat-reproduce-reuse-replicate/index.html
+curated_resources/recommendations-for-empowering-early-car/index.html
+curated_resources/recommendations-for-increasing-replicabi/index.html
+curated_resources/reconceptualizing-replication-as-a-seque/index.html
+curated_resources/redefine-statistical-signifcance/index.html
+curated_resources/reducing-bias-increasing-transparency-an/index.html
+curated_resources/reflection-over-compliance-critiquing-ma/index.html
+curated_resources/reflections-on-preregistration-core-crit/index.html
+curated_resources/reflections-on-the-unintended-consequenc/index.html
+curated_resources/reflections-on-the-unintended-consequenc_2/index.html
+curated_resources/registered-replication-report-hart-albar/index.html
+curated_resources/registered-replication-report-rand-green/index.html
+curated_resources/registered-replication-report-schooler-a/index.html
+curated_resources/registered-replication-report-strack-mar/index.html
+curated_resources/registered-replication-report-study-1-fr/index.html
+curated_resources/registered-replication-reports-in-the-cl/index.html
+curated_resources/registered-report-adoption-in-academic-j/index.html
+curated_resources/registered-report-protocol-survey-on-att/index.html
+curated_resources/registered-report-stage-1-manuscript-tem/index.html
+curated_resources/registered-reports-a-method-to-increase/index.html
+curated_resources/registered-reports-a-new-publishing-init/index.html
+curated_resources/registered-reports-an-early-example-and/index.html
+curated_resources/registered-reports-and-replications-an-o/index.html
+curated_resources/registered-reports-factsheet-for-editors/index.html
+curated_resources/registered-reports-faq/index.html
+curated_resources/registered-reports-q-a/index.html
+curated_resources/reimagining-peer-review-the-emergence-of/index.html
+curated_resources/releasing-a-preprint-is-associated-with/index.html
+curated_resources/renovating-the-theatre-of-persuasion-man/index.html
+curated_resources/repetitive-research-a-conceptual-space-a/index.html
+curated_resources/replacing-p-values-with-bayes-factors-a/index.html
+curated_resources/replicability-and-reproducibility-in-com/index.html
+curated_resources/replicability-and-reproducibility/index.html
+curated_resources/replicability-syllabus-2018/index.html
+curated_resources/replicability-syllabus-2020/index.html
+curated_resources/replicating-and-extending-soroka-fournie/index.html
+curated_resources/replicating-studies-in-which-samples-of/index.html
+curated_resources/replication-and-bias-in-special-educatio/index.html
+curated_resources/replication-and-open-science-for-undergr/index.html
+curated_resources/replication-and-robustness-in-developmen/index.html
+curated_resources/replication-and-the-manufacture-of-scien/index.html
+curated_resources/replication-communication-and-the-popula/index.html
+curated_resources/replication-is-relevant-in-qualitative-r/index.html
+curated_resources/replications-in-psychology-research-how/index.html
+curated_resources/repligate-reliability-and-reproducibilit/index.html
+curated_resources/reply-to-ledgerwood-predictions-without/index.html
+curated_resources/reporting-effect-sizes-in-original-psych/index.html
+curated_resources/reporting-in-experimental-philosophy-cur/index.html
+curated_resources/reporting-standards-for-complication-stu/index.html
+curated_resources/repository-of-psychological-instruments/index.html
+curated_resources/representing-epistemic-and-disciplinary/index.html
+curated_resources/reproducibilitea-introductory-reading-li/index.html
+curated_resources/reproducibilitea/index.html
+curated_resources/reproducibility-and-replicability-of-qua/index.html
+curated_resources/reproducibility-and-research-integrity-s/index.html
+curated_resources/reproducibility-for-everyone/index.html
+curated_resources/reproducibility-immersive-course/index.html
+curated_resources/reproducibility-in-cancer-biology-the-ch/index.html
+curated_resources/reproducibility-in-psychology-syllabus/index.html
+curated_resources/reproducibility-in-the-psychological-sci/index.html
+curated_resources/reproducibility-librarianship-in-practic/index.html
+curated_resources/reproducibility-open-science-and-clinica/index.html
+curated_resources/reproducibility-preservation-and-access/index.html
+curated_resources/reproducible-and-reusable-research-are-j/index.html
+curated_resources/reproducible-and-transparent-research-pr/index.html
+curated_resources/reproducible-research-in-sport-and-exerc/index.html
+curated_resources/reproducible-research-methods/index.html
+curated_resources/reproducible-research-practices-transpar/index.html
+curated_resources/reproducible-research-true-or-false/index.html
+curated_resources/reproducible-research-walking-the-walk/index.html
+curated_resources/reproducible-research/index.html
+curated_resources/reproducible-science-curriculum-lesson-f/index.html
+curated_resources/reproducible-science-curriculum-lesson-f_2/index.html
+curated_resources/reproducible-science-curriculum-lesson-f_3/index.html
+curated_resources/reproducible-science-curriculum-lesson-f_4/index.html
+curated_resources/reproducible-science-curriculum-lesson-f_5/index.html
+curated_resources/reproducible-science-workshop/index.html
+curated_resources/reproducible-statistics-for-psychologist/index.html
+curated_resources/reputation-without-practice-a-dynamic-co/index.html
+curated_resources/research-and-data-lessons-from-a-non-aca/index.html
+curated_resources/research-assessment-using-a-narrow-defin/index.html
+curated_resources/research-culture-is-broken-open-science/index.html
+curated_resources/research-integrity-and-open-science-i-ps/index.html
+curated_resources/research-integrity-and-responsible-schol/index.html
+curated_resources/research-integrity-definitions-and-chall/index.html
+curated_resources/research-methods-2020/index.html
+curated_resources/research-methods-in-psychology-syllabus/index.html
+curated_resources/research-methods-in-psychology/index.html
+curated_resources/research-methods-in-social-psychology/index.html
+curated_resources/research-methods-in-social-psychology_2/index.html
+curated_resources/research-methods-psychology-summer-2021/index.html
+curated_resources/research-methods-syllabi/index.html
+curated_resources/research-misconduct/index.html
+curated_resources/research-practices-and-statistical-repor/index.html
+curated_resources/research-practices-for-a-robust-psycholo/index.html
+curated_resources/research-practices-that-can-prevent-an-i/index.html
+curated_resources/research-preregistration-101/index.html
+curated_resources/research-preregistration-as-a-teaching-a/index.html
+curated_resources/research-preregistration-in-political-sc/index.html
+curated_resources/research-project-initialization-and-orga/index.html
+curated_resources/research-project-management-using-the-op/index.html
+curated_resources/research-support-games-list/index.html
+curated_resources/research-transparency-and-reproducibilit/index.html
+curated_resources/researchers-intuitions-about-power-in-ps/index.html
+curated_resources/reshaping-the-training-landscape-by-addr/index.html
+curated_resources/resolving-the-tension-between-exploratio/index.html
+curated_resources/resource-lists-overview-for-working-with/index.html
+curated_resources/resources-for-practicing-open-science-wi/index.html
+curated_resources/resources-tutorials-papers-analysis-scri/index.html
+curated_resources/response-to-comment-on-estimating-the-re/index.html
+curated_resources/responsible-assessment-of-what-research/index.html
+curated_resources/responsible-data-sharing-identifying-and/index.html
+curated_resources/responsible-research-assessment-should-p/index.html
+curated_resources/responsible-scholarship/index.html
+curated_resources/rethinking-research-assessment-addressin/index.html
+curated_resources/rethinking-transparency-and-rigor-from-a/index.html
+curated_resources/retiring-popper-critical-realism-falsifi/index.html
+curated_resources/retraction-watch-michael-lacour-archives/index.html
+curated_resources/review-of-four-preregistration-registrie/index.html
+curated_resources/reviewer-bias-against-replication-resear/index.html
+curated_resources/revisiting-the-replication-crisis-withou/index.html
+curated_resources/rewarding-replications-a-sure-and-simple/index.html
+curated_resources/richard-mcelreath/index.html
+curated_resources/rigor-and-reproducibility/index.html
+curated_resources/rigor-champions-and-resources/index.html
+curated_resources/rigorous-exploration-in-a-model-centric/index.html
+curated_resources/rigorous-reproducible-research-practices/index.html
+curated_resources/riot-science-club/index.html
+curated_resources/riposte-a-framework-for-improving-the-de/index.html
+curated_resources/risk-of-bias-in-reports-of-in-vivo-resea/index.html
+curated_resources/rluk22-keynote-kaitlin-thaney-invest-in/index.html
+curated_resources/robust-modeling-in-cognitive-science/index.html
+curated_resources/rpm-an-open-source-rotation-platform-for/index.html
+curated_resources/rstudio-cheatsheets/index.html
+curated_resources/safeguard-power-as-a-protection-against/index.html
+curated_resources/sailing-from-the-seas-of-chaos-into-the/index.html
+curated_resources/sample-size-in-psychological-research-ov/index.html
+curated_resources/sample-size-justification-shiny-app/index.html
+curated_resources/sample-size-planning-for-more-accurate-s/index.html
+curated_resources/sample-size-planning-for-statistical-pow/index.html
+curated_resources/sample-size-planning-for-the-standardize/index.html
+curated_resources/samply/index.html
+curated_resources/sanctions-list-data-dates-of-birth-names/index.html
+curated_resources/scandal-in-scientific-reform-the-breakin/index.html
+curated_resources/scanning-the-horizon-towards-transparent/index.html
+curated_resources/scholarly-publishing-as-a-global-endeavo/index.html
+curated_resources/school-psychology-annual-journal-update/index.html
+curated_resources/schools-should-teach-children-how-to-spo/index.html
+curated_resources/science-and-pseudoscience-bbc-radio-talk/index.html
+curated_resources/science-for-progress-initiative/index.html
+curated_resources/science-isn-t-broken/index.html
+curated_resources/science-literacy/index.html
+curated_resources/science-of-psychological-phenomena-and-t/index.html
+curated_resources/science-or-art-how-aesthetic-standards-g/index.html
+curated_resources/scientific-apophenia-in-strategic-manage/index.html
+curated_resources/scientific-reform-citation-politics-and/index.html
+curated_resources/scientific-utopia-i-opening-scientific-c/index.html
+curated_resources/scientific-utopia-ii-restructuring-incen/index.html
+curated_resources/scientific-utopia-ii-restructuring-incen_2/index.html
+curated_resources/scientists-reputations-are-based-on-gett/index.html
+curated_resources/secondary-data-preregistration/index.html
+curated_resources/seek-and-you-may-not-find-a-multi-instit/index.html
+curated_resources/selective-and-mis-leading-economics-jour/index.html
+curated_resources/self-reported-checklists-and-quality-sco/index.html
+curated_resources/shall-we-really-do-it-again-the-powerful/index.html
+curated_resources/sharestats-the-open-statistics-assessmen/index.html
+curated_resources/sharing-brain-imaging-data-in-the-open-s/index.html
+curated_resources/sharing-detailed-research-data-is-associ/index.html
+curated_resources/shifting-medical-education-the-impact-of/index.html
+curated_resources/shifting-the-culture-of-peer-review-with/index.html
+curated_resources/short-r-script-to-plot-effect-sizes-cohe/index.html
+curated_resources/short-sweet-and-problematic-the-rise-of/index.html
+curated_resources/should-preregistration-of-epidemiologic/index.html
+curated_resources/signaling-the-trustworthiness-of-science/index.html
+curated_resources/significance-tests-have-their-place/index.html
+curated_resources/significance/index.html
+curated_resources/simple-heuristics-to-run-a-research-grou/index.html
+curated_resources/sips-2016-what-does-diversity-mean-for-o/index.html
+curated_resources/smaat/index.html
+curated_resources/small-telescopes-detectability-and-the-e/index.html
+curated_resources/snapshot-reporting-practices-for-publish/index.html
+curated_resources/sneaked-references-cooked-reference-meta/index.html
+curated_resources/social-behavioral-and-economic-sciences/index.html
+curated_resources/social-identity-and-morality-lab-teachin/index.html
+curated_resources/social-science-workshop-overview/index.html
+curated_resources/social-sciences-research-methods-centre/index.html
+curated_resources/software-carpentry/index.html
+curated_resources/sorry-we-re-open-come-in-we-re-closed-di/index.html
+curated_resources/sources-of-nonreplicability-in-aging-eth/index.html
+curated_resources/sparc-popular-resources/index.html
+curated_resources/special-issue-innovation-in-aging/index.html
+curated_resources/special-issue-preregistered-studies-of-p/index.html
+curated_resources/spiro-the-automated-petri-plate-imaging/index.html
+curated_resources/springer-nature-announces-unified-open-c/index.html
+curated_resources/spsp-experts-open-science/index.html
+curated_resources/spurious-correlations/index.html
+curated_resources/standard-operating-procedures-a-safety-n/index.html
+curated_resources/star-wars-the-empirics-strike-back/index.html
+curated_resources/stat-545/index.html
+curated_resources/statcheck/index.html
+curated_resources/state-of-open-science-in-cancer-research/index.html
+curated_resources/statements-on-open-science-for-sustainab/index.html
+curated_resources/statistical-errors-p-values-the-gold-sta/index.html
+curated_resources/statistical-evidence-a-likelihood-paradi/index.html
+curated_resources/statistical-methods-in-psychological-res/index.html
+curated_resources/statistical-methods-in-psychology-journa/index.html
+curated_resources/statistical-modeling-causal-inference-an/index.html
+curated_resources/statistical-power-analysis/index.html
+curated_resources/statistical-power-and-optimal-design-in/index.html
+curated_resources/statistical-power-and-the-testing-of-nul/index.html
+curated_resources/statistical-power-in-operations-manageme/index.html
+curated_resources/statistical-power-of-psychological-resea/index.html
+curated_resources/statistical-power-problems-with-moderate/index.html
+curated_resources/statistical-power-sample-size-and-their/index.html
+curated_resources/statistical-procedures-and-the-justifica/index.html
+curated_resources/statistical-reporting-errors-and-collabo/index.html
+curated_resources/statistical-rethinking-winter-2015/index.html
+curated_resources/statistical-significance-and-the-dichoto/index.html
+curated_resources/statistical-significance-in-psychologica/index.html
+curated_resources/statistical-significance-testing-and-cum/index.html
+curated_resources/statistical-tests-p-values-confidence-in/index.html
+curated_resources/statistics-and-quantitative-methods-exam/index.html
+curated_resources/statistics-of-doom/index.html
+curated_resources/statistics-with-jasp-and-the-open-scienc/index.html
+curated_resources/stereotype-threat/index.html
+curated_resources/strong-inference/index.html
+curated_resources/study-preregistration-an-evaluation-of-a/index.html
+curated_resources/studying-the-association-between-lonelin/index.html
+curated_resources/supporting-open-science-data-curation-pr/index.html
+curated_resources/supporting-robust-research-on-adult-emot/index.html
+curated_resources/supporting-study-registration-to-reduce/index.html
+curated_resources/supporting-the-next-generation-of-psycho/index.html
+curated_resources/surrogate-science-the-idol-of-a-universa/index.html
+curated_resources/swirl/index.html
+curated_resources/syllabus-replicability/index.html
+curated_resources/symposium-qualitative-open-science-chall/index.html
+curated_resources/systematic-review-of-the-empirical-evide/index.html
+curated_resources/systematic-reviews-and-meta-analysis/index.html
+curated_resources/taking-stock-of-the-credibility-revoluti/index.html
+curated_resources/taking-stock-of-the-credibility-revoluti_2/index.html
+curated_resources/taxonomia-da-ciencia-aberta-revisada-e-a/index.html
+curated_resources/teaching-and-mentoring-open-science/index.html
+curated_resources/teaching-open-and-reproducible-scholarsh/index.html
+curated_resources/teaching-psych-science/index.html
+curated_resources/teaching-replicable-and-reproducible-sci/index.html
+curated_resources/teaching-replication-in-psychology-a-gui/index.html
+curated_resources/teaching-replication-in-social-sciences/index.html
+curated_resources/teaching-replication-to-graduate-student/index.html
+curated_resources/teaching-replication/index.html
+curated_resources/teaching-resources-spreadsheet/index.html
+curated_resources/teaching-the-why-and-how-of-replication/index.html
+curated_resources/team-neurodiversity/index.html
+curated_resources/template-preregistration-registered-repo/index.html
+curated_resources/ten-quick-tips-for-building-fair-workflo/index.html
+curated_resources/ten-simple-rules-for-effective-statistic/index.html
+curated_resources/ten-simple-rules-for-pushing-boundaries/index.html
+curated_resources/ten-simple-rules-for-reproducible-comput/index.html
+curated_resources/ten-simple-rules-for-the-care-and-feedin/index.html
+curated_resources/ten-strategies-to-foster-open-science-in/index.html
+curated_resources/tension-between-theory-and-practice-of-r/index.html
+curated_resources/the-52-symptoms-of-major-depression-lack/index.html
+curated_resources/the-academic-impact-of-open-science-a-sc/index.html
+curated_resources/the-amazing-significo-why-researchers-ne/index.html
+curated_resources/the-appropriate-use-of-null-hypothesis-t/index.html
+curated_resources/the-asa-statement-on-p-values-context-pr/index.html
+curated_resources/the-baby-factory-difficult-research-obje/index.html
+curated_resources/the-bayes-factor/index.html
+curated_resources/the-bayesfactor-blog/index.html
+curated_resources/the-bayesian-reproducibility-project/index.html
+curated_resources/the-benefits-of-preregistration-and-regi/index.html
+curated_resources/the-benefits-of-preregistration-for-hypo/index.html
+curated_resources/the-black-goat/index.html
+curated_resources/the-buffet-approach-to-open-science/index.html
+curated_resources/the-case-against-statistical-significanc/index.html
+curated_resources/the-case-for-formal-methodology-in-scien/index.html
+curated_resources/the-case-for-using-educational-scholarsh/index.html
+curated_resources/the-challenges-of-open-data-sharing-for/index.html
+curated_resources/the-chinese-open-science-network-cosn-bu/index.html
+curated_resources/the-chrysalis-effect-how-ugly-initial-re/index.html
+curated_resources/the-citation-advantage-of-linking-public/index.html
+curated_resources/the-clinicaltrials-gov-results-database/index.html
+curated_resources/the-corpus-of-language-discrimination-in/index.html
+curated_resources/the-costs-of-competition-in-distributing/index.html
+curated_resources/the-costs-of-harking/index.html
+curated_resources/the-crisis-of-confidence-in-social-psych/index.html
+curated_resources/the-cumulative-effect-of-reporting-and-c/index.html
+curated_resources/the-default-bayesian-test-is-prejudiced/index.html
+curated_resources/the-earth-is-flat-p-0-05-significance-th/index.html
+curated_resources/the-earth-is-round-p-05/index.html
+curated_resources/the-economics-of-reproducibility-in-prec/index.html
+curated_resources/the-effect-of-horizontal-eye-movements-o/index.html
+curated_resources/the-effect-of-preregistration-on-trust-i/index.html
+curated_resources/the-effect-of-publishing-peer-review-rep/index.html
+curated_resources/the-empirical-benefits-of-conceptual-rig/index.html
+curated_resources/the-empirical-march-making-science-bette/index.html
+curated_resources/the-existence-of-publication-bias-and-ri/index.html
+curated_resources/the-experiment-experiment/index.html
+curated_resources/the-extent-and-consequences-of-p-hacking/index.html
+curated_resources/the-fickle-p-value-generates-irreproduci/index.html
+curated_resources/the-file-drawer-problem-and-tolerance-fo/index.html
+curated_resources/the-frequency-of-excess-success-for-arti/index.html
+curated_resources/the-garden-of-forking-paths-why-multiple/index.html
+curated_resources/the-general-linear-model-semester-2/index.html
+curated_resources/the-generalizability-of-survey-experimen/index.html
+curated_resources/the-go-fair-foundation-s-fair-capacity-b/index.html
+curated_resources/the-grim-test-a-simple-technique-detects/index.html
+curated_resources/the-hardest-science/index.html
+curated_resources/the-harm-done-by-tests-of-significance/index.html
+curated_resources/the-influence-of-journal-submission-guid/index.html
+curated_resources/the-invisible-workload-of-open-research/index.html
+curated_resources/the-ironic-effect-of-significant-results/index.html
+curated_resources/the-landscape-of-open-science-in-behavio/index.html
+curated_resources/the-logical-structure-of-experiments-lay/index.html
+curated_resources/the-meaning-of-significance-for-differen/index.html
+curated_resources/the-meaningfulness-of-effect-sizes-in-ps/index.html
+curated_resources/the-mis-reporting-of-statistical-results/index.html
+curated_resources/the-missing-semester-of-your-cs-educatio/index.html
+curated_resources/the-n-pact-factor-evaluating-the-quality/index.html
+curated_resources/the-natural-selection-of-bad-science/index.html
+curated_resources/the-need-for-public-opinion-and-survey-m/index.html
+curated_resources/the-needed-link-between-open-science-and/index.html
+curated_resources/the-new-statistics-confidence-intervals/index.html
+curated_resources/the-new-statistics-effect-sizes-and-conf/index.html
+curated_resources/the-new-statistics-meta-analysis-and-met/index.html
+curated_resources/the-new-statistics-planning-power-and-pr/index.html
+curated_resources/the-new-statistics-research-integrity-th/index.html
+curated_resources/the-new-statistics-the-new-statistics-in/index.html
+curated_resources/the-new-statistics-why-and-how/index.html
+curated_resources/the-null-hypothesis-significance-testing/index.html
+curated_resources/the-null-ritual-what-you-always-wanted-t/index.html
+curated_resources/the-o3-guidelines-open-data-open-code-an/index.html
+curated_resources/the-open-research-lifecycle/index.html
+curated_resources/the-open-research-toolkit/index.html
+curated_resources/the-open-science-training-handbook/index.html
+curated_resources/the-p-value-misconception-eradication-ch/index.html
+curated_resources/the-papor-trail-course-principles-and-pr/index.html
+curated_resources/the-past-present-and-future-of-registere/index.html
+curated_resources/the-peer-reviewers-openness-initiative-i/index.html
+curated_resources/the-persistence-of-underpowered-studies/index.html
+curated_resources/the-pipeline-project-pre-publication-ind/index.html
+curated_resources/the-poor-availability-of-psychological-r/index.html
+curated_resources/the-poor-availability-of-syntaxes-of-str/index.html
+curated_resources/the-post-embargo-open-access-citation-ad/index.html
+curated_resources/the-power-of-many-brains-catalyzing-neur/index.html
+curated_resources/the-preregistration-challenge-a-how-to-g/index.html
+curated_resources/the-preregistration-prescriptiveness-tra/index.html
+curated_resources/the-preregistration-revolution-needs-to/index.html
+curated_resources/the-preregistration-revolution/index.html
+curated_resources/the-prevalence-of-statistical-reporting/index.html
+curated_resources/the-problem-of-new-evidence-p-hacking-an/index.html
+curated_resources/the-promises-and-pitfalls-of-preregistra/index.html
+curated_resources/the-promises-and-pitfalls-of-preregistra_2/index.html
+curated_resources/the-psychological-reality-of-the-learned/index.html
+curated_resources/the-psychological-reality-of-the-learned_2/index.html
+curated_resources/the-psychology-of-experimental-psycholog/index.html
+curated_resources/the-quantitative-paradigm-and-the-nature/index.html
+curated_resources/the-race-in-academia-collective/index.html
+curated_resources/the-relation-between-statistical-power-a/index.html
+curated_resources/the-replication-crisis-in-psychology/index.html
+curated_resources/the-replication-crisis-is-less-of-a-cris/index.html
+curated_resources/the-replication-crisis-is-less-of-a-cris_2/index.html
+curated_resources/the-replication-database-documenting-the/index.html
+curated_resources/the-replication-recipe-what-makes-for-a/index.html
+curated_resources/the-reporting-completeness-and-transpare/index.html
+curated_resources/the-reputational-consequences-of-failed/index.html
+curated_resources/the-role-of-libraries-in-the-age-of-comp/index.html
+curated_resources/the-role-of-replication-research-in-adva/index.html
+curated_resources/the-rules-of-the-game-called-psychologic/index.html
+curated_resources/the-secret-to-writing-a-great-nasa-propo/index.html
+curated_resources/the-societal-impact-of-open-science-a-sc/index.html
+curated_resources/the-societal-impact-of-open-science-a-sc_2/index.html
+curated_resources/the-state-of-play-of-reproducibility-in/index.html
+curated_resources/the-state-of-social-and-personality-scie/index.html
+curated_resources/the-state-of-the-science-address/index.html
+curated_resources/the-statistical-power-of-abnormal-social/index.html
+curated_resources/the-stem-education-hub-helps-your-resear/index.html
+curated_resources/the-superego-the-ego-and-the-id-in-stati/index.html
+curated_resources/the-t-distritbution-and-its-normal-appro/index.html
+curated_resources/the-test-of-insufficient-variance-tiva-a/index.html
+curated_resources/the-tone-debate-knowledge-self-and-socia/index.html
+curated_resources/the-transparency-of-quantitative-empiric/index.html
+curated_resources/the-trustworthiness-of-the-cumulative-kn/index.html
+curated_resources/the-unix-shell/index.html
+curated_resources/the-value-of-direct-replication/index.html
+curated_resources/the-value-of-openness-in-open-science/index.html
+curated_resources/the-value-of-preregistration-for-psychol/index.html
+curated_resources/the-values-and-practice-of-science/index.html
+curated_resources/the-weak-spots-in-contemporary-science-a/index.html
+curated_resources/the-web-of-schizotypal-personality-trait/index.html
+curated_resources/the-what-why-and-how-of-born-open-data/index.html
+curated_resources/the-what-why-and-how-of-preregistration/index.html
+curated_resources/theoretical-risks-and-tabular-asterisks/index.html
+curated_resources/theory-construction-and-model-building-s/index.html
+curated_resources/theory-testing-in-psychology-and-physics/index.html
+curated_resources/there-is-no-theory-crisis-in-psychologic/index.html
+curated_resources/things-i-have-learned-so-far/index.html
+curated_resources/three-ways-to-recognize-hidden-labour-in/index.html
+curated_resources/tie-my-hands-loosely-pre-analysis-plans/index.html
+curated_resources/too-true-to-be-bad-when-sets-of-studies/index.html
+curated_resources/toolkit-for-aligning-incentives-2-0/index.html
+curated_resources/tools-for-reproducible-research/index.html
+curated_resources/top-guidelines/index.html
+curated_resources/top-tips-for-navigating-your-career-the/index.html
+curated_resources/topicos-especiais-em-biotecnologia-plane/index.html
+curated_resources/topics-in-social-psychology-and-personal/index.html
+curated_resources/toward-a-21st-century-national-data-infr/index.html
+curated_resources/toward-a-more-accurate-notion-of-explora/index.html
+curated_resources/toward-a-more-credible-assessment-of-the/index.html
+curated_resources/toward-reproducible-computational-resear/index.html
+curated_resources/towards-a-culture-of-open-scholarship-th/index.html
+curated_resources/towards-building-a-trustworthy-pipeline/index.html
+curated_resources/towards-inclusive-funding-practices-for/index.html
+curated_resources/towards-inclusive-mentoring-in-academic/index.html
+curated_resources/towards-reproducible-radiomics-research/index.html
+curated_resources/tracking-replicability-as-a-method-of-po/index.html
+curated_resources/trainer-space-for-the-introduction-to-op/index.html
+curated_resources/transdisciplinary-global-health-challeng/index.html
+curated_resources/transform-to-open-science/index.html
+curated_resources/transparency-and-open-science-symposium/index.html
+curated_resources/transparency-of-chi-research-artifacts-r/index.html
+curated_resources/transparency-replicability-and-discovery/index.html
+curated_resources/transparent-and-open-social-science-rese/index.html
+curated_resources/transparent-reproducible-and-open-scienc/index.html
+curated_resources/transparent-science-a-more-credible-repr/index.html
+curated_resources/trial-publication-after-registration-in/index.html
+curated_resources/trial-registration-10-years-on/index.html
+curated_resources/trust-your-science-open-your-data-and-co/index.html
+curated_resources/turtle-and-hare-workshops-exchanging-sof/index.html
+curated_resources/tutorial-r-code-for-creating-funnel-fore/index.html
+curated_resources/tutorial-r-code-for-creating-plots-for-2/index.html
+curated_resources/tutorial-r-code-for-creating-scree-paral/index.html
+curated_resources/two-years-later-journals-are-not-yet-enf/index.html
+curated_resources/type-i-error-rates-are-not-usually-infla/index.html
+curated_resources/ukrn-open-research-primers/index.html
+curated_resources/ukrn/index.html
+curated_resources/ulysses-pact-or-ulysses-raft-using-pre-a/index.html
+curated_resources/uncertainty-is-science-s-superpower-make/index.html
+curated_resources/underreporting-in-psychology-experiments/index.html
+curated_resources/understanding-bayes-a-look-at-the-likeli/index.html
+curated_resources/understanding-bayes-visualization-of-the/index.html
+curated_resources/understanding-psychology-as-a-science-an/index.html
+curated_resources/understanding-statistical-power-and-sign/index.html
+curated_resources/understanding-the-provenance-and-quality/index.html
+curated_resources/understanding-the-value-of-curation-a-su/index.html
+curated_resources/unesco-recommendation-on-open-science/index.html
+curated_resources/universities-should-put-educational-mate/index.html
+curated_resources/unlikely-results/index.html
+curated_resources/up-front-and-open-shrouded-in-secrecy-or/index.html
+curated_resources/update-on-the-endorsement-of-consort-by/index.html
+curated_resources/update-on-trial-registration-11-years-af/index.html
+curated_resources/us-project-seeks-standard-way-to-communi/index.html
+curated_resources/use-of-the-journal-impact-factor-in-acad/index.html
+curated_resources/using-artificial-intelligence-to-create/index.html
+curated_resources/using-osf-to-share-data-a-step-by-step-g/index.html
+curated_resources/using-pre-analysis-plans-in-qualitative/index.html
+curated_resources/using-prediction-markets-to-estimate-the/index.html
+curated_resources/using-r-and-lme-lmer-to-fit-different-tw/index.html
+curated_resources/using-science-and-psychology-to-improve/index.html
+curated_resources/using-the-transparency-checklist-guideli/index.html
+curated_resources/va-big-data-science-a-model-for-improved/index.html
+curated_resources/version-control-with-the-osf/index.html
+curated_resources/visualizing-a-one-way-anova-using-d3-js/index.html
+curated_resources/volunteerism-has-gone-too-far/index.html
+curated_resources/want-to-speed-up-scientific-progress-fir/index.html
+curated_resources/we-built-this-culture-so-we-can-change-i/index.html
+curated_resources/we-have-to-break-up/index.html
+curated_resources/we-knew-the-future-all-along-scientific/index.html
+curated_resources/welcoming-quality-in-non-significance-an/index.html
+curated_resources/what-does-open-science-mean-for-educatio/index.html
+curated_resources/what-does-research-reproducibility-mean/index.html
+curated_resources/what-incentives-increase-data-sharing-in/index.html
+curated_resources/what-is-a-p-value/index.html
+curated_resources/what-is-replication/index.html
+curated_resources/what-is-statistical-power/index.html
+curated_resources/what-is-the-replication-crisis-a-crisis/index.html
+curated_resources/what-is-this-thing-called-open-science/index.html
+curated_resources/what-is-universal-design-for-learning-ud/index.html
+curated_resources/what-makes-a-good-theory-and-how-do-we-m/index.html
+curated_resources/what-s-new-in-neuro/index.html
+curated_resources/what-s-wrong-with-psychology-anyway/index.html
+curated_resources/what-s-wrong-with-statistical-tests-and/index.html
+curated_resources/what-should-a-preregistration-contain/index.html
+curated_resources/what-you-see-is-what-you-get-enhancing-m/index.html
+curated_resources/when-does-harking-hurt-identifying-when/index.html
+curated_resources/when-great-minds-think-unalike-inside-sc/index.html
+curated_resources/when-is-science-un-reliable/index.html
+curated_resources/when-power-analyses-based-on-pilot-data/index.html
+curated_resources/which-is-the-correct-statistical-test-to/index.html
+curated_resources/who-re-uses-data-a-bibliometric-analysis/index.html
+curated_resources/who-would-have-thought-that-we-needed-an/index.html
+curated_resources/why-an-entire-field-of-psychology-is-in/index.html
+curated_resources/why-and-how-to-use-pre-analysis-plans/index.html
+curated_resources/why-hypothesis-testers-should-spend-less/index.html
+curated_resources/why-most-discovered-true-associations-ar/index.html
+curated_resources/why-most-of-psychology-is-statistically/index.html
+curated_resources/why-most-published-research-findings-are/index.html
+curated_resources/why-nasa-and-federal-agencies-are-declar/index.html
+curated_resources/why-p-048-should-be-rare-and-why-this-fe/index.html
+curated_resources/why-preregistration-makes-me-nervous/index.html
+curated_resources/why-psychologists-food-fight-matters/index.html
+curated_resources/why-psychologists-must-change-the-way-th/index.html
+curated_resources/why-summaries-of-research-on-psychologic/index.html
+curated_resources/wide-open-accelerating-public-data-relea/index.html
+curated_resources/will-funders-have-the-patience-to-reform/index.html
+curated_resources/willingness-to-share-research-data-is-re/index.html
+curated_resources/with-low-power-comes-low-credibility-tow/index.html
+curated_resources/workflow-for-awarding-badges/index.html
+curated_resources/writing-a-data-management-plan-for-grant/index.html
+curated_resources/writing-reproducible-geoscience-papers-u/index.html
+curated_resources/you-are-not-so-smart/index.html
+curated_resources/you-cannot-step-into-the-same-river-twic/index.html
+curated_resources/your-questions-answered-how-to-retain-co/index.html
+curated_resources/zootraits-an-r-shiny-app-for-exploring-a/index.html
+cv/index.html
+data/fred_citation.txt
+data/open_research_games.json
+dei/index.html
+disciplines/README
+disciplines/UKRN.webp
+disciplines/index.html
+disciplines/index.xml
+educators-corner/001-representation-heatherurry/featured.webp
+educators-corner/001-representation-heatherurry/featured_hu.webp
+educators-corner/001-representation-heatherurry/featured_hu.webp
+educators-corner/001-representation-heatherurry/her1.webp
+educators-corner/001-representation-heatherurry/her2.webp
+educators-corner/001-representation-heatherurry/iceberg.webp
+educators-corner/001-representation-heatherurry/index.html
+educators-corner/002-transparencychecklist-balazsaczel/Checklist.webp
+educators-corner/002-transparencychecklist-balazsaczel/Checklist_v2.webp
+educators-corner/002-transparencychecklist-balazsaczel/featured.webp
+educators-corner/002-transparencychecklist-balazsaczel/featured_hu.webp
+educators-corner/002-transparencychecklist-balazsaczel/index.html
+educators-corner/003-developing-tools/Screen Shot 2021-02-11 at 10.36.21 AM.webp
+educators-corner/003-developing-tools/featured.webp
+educators-corner/003-developing-tools/featured_hu.webp
+educators-corner/003-developing-tools/fig2.webp
+educators-corner/003-developing-tools/fig3.webp
+educators-corner/003-developing-tools/fig4.webp
+educators-corner/003-developing-tools/fig5.webp
+educators-corner/003-developing-tools/fig6.webp
+educators-corner/003-developing-tools/fig7.webp
+educators-corner/003-developing-tools/index.html
+educators-corner/004-teaching-why-how-replication/featured.webp
+educators-corner/004-teaching-why-how-replication/featured_hu.webp
+educators-corner/004-teaching-why-how-replication/fig1.webp
+educators-corner/004-teaching-why-how-replication/fig10.webp
+educators-corner/004-teaching-why-how-replication/fig11.webp
+educators-corner/004-teaching-why-how-replication/fig12.webp
+educators-corner/004-teaching-why-how-replication/fig13.webp
+educators-corner/004-teaching-why-how-replication/fig2.webp
+educators-corner/004-teaching-why-how-replication/fig3.webp
+educators-corner/004-teaching-why-how-replication/fig4.webp
+educators-corner/004-teaching-why-how-replication/fig5.webp
+educators-corner/004-teaching-why-how-replication/fig6.webp
+educators-corner/004-teaching-why-how-replication/fig7.webp
+educators-corner/004-teaching-why-how-replication/fig8.webp
+educators-corner/004-teaching-why-how-replication/fig9.webp
+educators-corner/004-teaching-why-how-replication/index.html
+educators-corner/005-remote-teaching-platform/Fig1.webp
+educators-corner/005-remote-teaching-platform/Fig2.webp
+educators-corner/005-remote-teaching-platform/Fig3.webp
+educators-corner/005-remote-teaching-platform/featured.webp
+educators-corner/005-remote-teaching-platform/featured_hu.webp
+educators-corner/005-remote-teaching-platform/index.html
+educators-corner/006-qualitative-os-practices/Fig1.webp
+educators-corner/006-qualitative-os-practices/Fig2.webp
+educators-corner/006-qualitative-os-practices/featured.webp
+educators-corner/006-qualitative-os-practices/featured_hu.webp
+educators-corner/006-qualitative-os-practices/index.html
+educators-corner/007-easy-steps-to-elevate-your-mentoring/featured.webp
+educators-corner/007-easy-steps-to-elevate-your-mentoring/featured_hu.webp
+educators-corner/007-easy-steps-to-elevate-your-mentoring/featured_hu.webp
+educators-corner/007-easy-steps-to-elevate-your-mentoring/fig1.webp
+educators-corner/007-easy-steps-to-elevate-your-mentoring/index.html
+educators-corner/008-open-research-toolkit/featured.webp
+educators-corner/008-open-research-toolkit/featured_hu.webp
+educators-corner/008-open-research-toolkit/featured_hu.webp
+educators-corner/008-open-research-toolkit/index.html
+educators-corner/009-papor-trail/Picture1.webp
+educators-corner/009-papor-trail/Picture2.webp
+educators-corner/009-papor-trail/featured.webp
+educators-corner/009-papor-trail/featured_hu.webp
+educators-corner/009-papor-trail/index.html
+educators-corner/010-neurodiversity/featured.webp
+educators-corner/010-neurodiversity/featured_hu.webp
+educators-corner/010-neurodiversity/featured_hu.webp
+educators-corner/010-neurodiversity/fig1.webp
+educators-corner/010-neurodiversity/index.html
+educators-corner/011-intersectionality-open-science/featured.webp
+educators-corner/011-intersectionality-open-science/featured_hu.webp
+educators-corner/011-intersectionality-open-science/image.webp
+educators-corner/011-intersectionality-open-science/index.html
+educators-corner/012-lessons-from-non-academic-jobs/featured.webp
+educators-corner/012-lessons-from-non-academic-jobs/featured_hu.webp
+educators-corner/012-lessons-from-non-academic-jobs/index.html
+educators-corner/013-introducing-nowhere-lab/featured.webp
+educators-corner/013-introducing-nowhere-lab/featured_hu.webp
+educators-corner/013-introducing-nowhere-lab/index.html
+educators-corner/014-students-guide-to-open-science/aspredicted-template.webp
+educators-corner/014-students-guide-to-open-science/charlotte-r-pennington.webp
+educators-corner/014-students-guide-to-open-science/featured.webp
+educators-corner/014-students-guide-to-open-science/featured_hu.webp
+educators-corner/014-students-guide-to-open-science/featured_hu.webp
+educators-corner/014-students-guide-to-open-science/index.html
+educators-corner/014-students-guide-to-open-science/seat-of-a-replicator.webp
+educators-corner/015-academic-jobs-us-vs-uk/featured.webp
+educators-corner/015-academic-jobs-us-vs-uk/featured_hu.webp
+educators-corner/015-academic-jobs-us-vs-uk/featured_hu.webp
+educators-corner/015-academic-jobs-us-vs-uk/index.html
+educators-corner/015-academic-jobs-us-vs-uk/labour-situation.webp
+educators-corner/015-academic-jobs-us-vs-uk/ucu-strike.webp
+educators-corner/016-reviewer-zero/featured.webp
+educators-corner/016-reviewer-zero/featured_hu.webp
+educators-corner/016-reviewer-zero/featured_hu.webp
+educators-corner/016-reviewer-zero/index.html
+educators-corner/016-reviewer-zero/pic_rz.webp
+educators-corner/016-reviewer-zero/reviewerzero.webp
+educators-corner/016-reviewer-zero/rz.webp
+educators-corner/016-reviewer-zero/tweet_rz.webp
+educators-corner/017-teaching-os-to-undergraduates/featured.webp
+educators-corner/017-teaching-os-to-undergraduates/featured_hu.webp
+educators-corner/017-teaching-os-to-undergraduates/index.html
+educators-corner/018-accessible-feedback-in-research/featured.webp
+educators-corner/018-accessible-feedback-in-research/featured_hu.webp
+educators-corner/018-accessible-feedback-in-research/featured_hu.webp
+educators-corner/018-accessible-feedback-in-research/index.html
+educators-corner/019-being-a-minoritized-early-career-researcher-in-political-psychology/index.html
+educators-corner/020-community-augmented-meta-analyses-in-education/ELD-CAMA.webp
+educators-corner/020-community-augmented-meta-analyses-in-education/featured.webp
+educators-corner/020-community-augmented-meta-analyses-in-education/featured_hu.webp
+educators-corner/020-community-augmented-meta-analyses-in-education/index.html
+educators-corner/021-lmu-forrt-train-the-trainer-program-press-release/featured.webp
+educators-corner/021-lmu-forrt-train-the-trainer-program-press-release/featured_hu.webp
+educators-corner/021-lmu-forrt-train-the-trainer-program-press-release/featured_hu.webp
+educators-corner/021-lmu-forrt-train-the-trainer-program-press-release/index.html
+educators-corner/022-repro-metrics-forrt-irise/featured.webp
+educators-corner/022-repro-metrics-forrt-irise/featured_hu.webp
+educators-corner/022-repro-metrics-forrt-irise/featured_hu.webp
+educators-corner/022-repro-metrics-forrt-irise/index.html
+educators-corner/022-repro-metrics-forrt-irise/reprometrics_app.png
+educators-corner/023-forward-a-unesco-decade-of-science-programme/featured.webp
+educators-corner/023-forward-a-unesco-decade-of-science-programme/featured_hu.webp
+educators-corner/023-forward-a-unesco-decade-of-science-programme/index.html
+educators-corner/023-forward-a-unesco-decade-of-science-programme/unesco_recognition.webp
+educators-corner/024-meaningful_results_for_meaningful_hypotheses/Michael_Franke.webp
+educators-corner/024-meaningful_results_for_meaningful_hypotheses/Timo_B_Roettger.webp
+educators-corner/024-meaningful_results_for_meaningful_hypotheses/featured.webp
+educators-corner/024-meaningful_results_for_meaningful_hypotheses/featured_hu.webp
+educators-corner/024-meaningful_results_for_meaningful_hypotheses/index.html
+educators-corner/024-meaningful_results_for_meaningful_hypotheses/meaningful_r_for_m_hypotheses.webp
+educators-corner/index.html
+educators-corner/index.xml
+educators-corner/page/1/index.html
+educators-corner/page/2/index.html
+educators-corner/page/3/index.html
+equityinos/index.html
+explorer/index.html
+feedback/index.html
+files/FORRT.vcf
+files/FORRT_Booklet(A5).pdf
+files/FORRT_CoP.pdf
+files/FORRT_Presentation_SPSP.pdf
+files/FORRT_cv.pdf
+files/FORRT_cv_v2.pdf
+files/Leo_Waaijers_Open_Science_Award_2026.pdf
+files/NowhereLab_PhD_Survival_Guide.pdf
+files/Satzung_FORRT_Germany.pdf
+files/Satzung_FORRT_Germany_translated.pdf
+files/forrt_v1.pdf
+flora/index.html
+forrt_clusters/academic-life-and-culture/index.html
+forrt_clusters/academic-life-and-culture/index.xml
+forrt_clusters/academic-life-and-culture/page/1/index.html
+forrt_clusters/academic-life-and-culture/page/10/index.html
+forrt_clusters/academic-life-and-culture/page/11/index.html
+forrt_clusters/academic-life-and-culture/page/12/index.html
+forrt_clusters/academic-life-and-culture/page/13/index.html
+forrt_clusters/academic-life-and-culture/page/14/index.html
+forrt_clusters/academic-life-and-culture/page/15/index.html
+forrt_clusters/academic-life-and-culture/page/16/index.html
+forrt_clusters/academic-life-and-culture/page/17/index.html
+forrt_clusters/academic-life-and-culture/page/18/index.html
+forrt_clusters/academic-life-and-culture/page/19/index.html
+forrt_clusters/academic-life-and-culture/page/2/index.html
+forrt_clusters/academic-life-and-culture/page/20/index.html
+forrt_clusters/academic-life-and-culture/page/21/index.html
+forrt_clusters/academic-life-and-culture/page/22/index.html
+forrt_clusters/academic-life-and-culture/page/23/index.html
+forrt_clusters/academic-life-and-culture/page/24/index.html
+forrt_clusters/academic-life-and-culture/page/25/index.html
+forrt_clusters/academic-life-and-culture/page/26/index.html
+forrt_clusters/academic-life-and-culture/page/27/index.html
+forrt_clusters/academic-life-and-culture/page/3/index.html
+forrt_clusters/academic-life-and-culture/page/4/index.html
+forrt_clusters/academic-life-and-culture/page/5/index.html
+forrt_clusters/academic-life-and-culture/page/6/index.html
+forrt_clusters/academic-life-and-culture/page/7/index.html
+forrt_clusters/academic-life-and-culture/page/8/index.html
+forrt_clusters/academic-life-and-culture/page/9/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/index.xml
+forrt_clusters/conceptual-and-statistical-knowledge/page/1/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/10/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/11/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/12/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/13/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/14/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/15/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/16/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/17/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/18/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/19/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/2/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/20/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/21/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/22/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/23/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/24/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/25/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/26/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/27/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/28/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/29/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/3/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/30/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/31/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/32/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/33/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/34/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/35/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/36/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/37/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/4/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/5/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/6/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/7/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/8/index.html
+forrt_clusters/conceptual-and-statistical-knowledge/page/9/index.html
+forrt_clusters/index.html
+forrt_clusters/index.xml
+forrt_clusters/open-data-and-materials/index.html
+forrt_clusters/open-data-and-materials/index.xml
+forrt_clusters/open-data-and-materials/page/1/index.html
+forrt_clusters/open-data-and-materials/page/10/index.html
+forrt_clusters/open-data-and-materials/page/11/index.html
+forrt_clusters/open-data-and-materials/page/12/index.html
+forrt_clusters/open-data-and-materials/page/13/index.html
+forrt_clusters/open-data-and-materials/page/14/index.html
+forrt_clusters/open-data-and-materials/page/15/index.html
+forrt_clusters/open-data-and-materials/page/16/index.html
+forrt_clusters/open-data-and-materials/page/17/index.html
+forrt_clusters/open-data-and-materials/page/18/index.html
+forrt_clusters/open-data-and-materials/page/19/index.html
+forrt_clusters/open-data-and-materials/page/2/index.html
+forrt_clusters/open-data-and-materials/page/20/index.html
+forrt_clusters/open-data-and-materials/page/21/index.html
+forrt_clusters/open-data-and-materials/page/22/index.html
+forrt_clusters/open-data-and-materials/page/23/index.html
+forrt_clusters/open-data-and-materials/page/24/index.html
+forrt_clusters/open-data-and-materials/page/25/index.html
+forrt_clusters/open-data-and-materials/page/26/index.html
+forrt_clusters/open-data-and-materials/page/27/index.html
+forrt_clusters/open-data-and-materials/page/28/index.html
+forrt_clusters/open-data-and-materials/page/29/index.html
+forrt_clusters/open-data-and-materials/page/3/index.html
+forrt_clusters/open-data-and-materials/page/30/index.html
+forrt_clusters/open-data-and-materials/page/31/index.html
+forrt_clusters/open-data-and-materials/page/32/index.html
+forrt_clusters/open-data-and-materials/page/33/index.html
+forrt_clusters/open-data-and-materials/page/4/index.html
+forrt_clusters/open-data-and-materials/page/5/index.html
+forrt_clusters/open-data-and-materials/page/6/index.html
+forrt_clusters/open-data-and-materials/page/7/index.html
+forrt_clusters/open-data-and-materials/page/8/index.html
+forrt_clusters/open-data-and-materials/page/9/index.html
+forrt_clusters/page/1/index.html
+forrt_clusters/preregistration/index.html
+forrt_clusters/preregistration/index.xml
+forrt_clusters/preregistration/page/1/index.html
+forrt_clusters/preregistration/page/10/index.html
+forrt_clusters/preregistration/page/11/index.html
+forrt_clusters/preregistration/page/12/index.html
+forrt_clusters/preregistration/page/13/index.html
+forrt_clusters/preregistration/page/14/index.html
+forrt_clusters/preregistration/page/15/index.html
+forrt_clusters/preregistration/page/16/index.html
+forrt_clusters/preregistration/page/17/index.html
+forrt_clusters/preregistration/page/18/index.html
+forrt_clusters/preregistration/page/19/index.html
+forrt_clusters/preregistration/page/2/index.html
+forrt_clusters/preregistration/page/20/index.html
+forrt_clusters/preregistration/page/21/index.html
+forrt_clusters/preregistration/page/22/index.html
+forrt_clusters/preregistration/page/23/index.html
+forrt_clusters/preregistration/page/24/index.html
+forrt_clusters/preregistration/page/25/index.html
+forrt_clusters/preregistration/page/26/index.html
+forrt_clusters/preregistration/page/27/index.html
+forrt_clusters/preregistration/page/3/index.html
+forrt_clusters/preregistration/page/4/index.html
+forrt_clusters/preregistration/page/5/index.html
+forrt_clusters/preregistration/page/6/index.html
+forrt_clusters/preregistration/page/7/index.html
+forrt_clusters/preregistration/page/8/index.html
+forrt_clusters/preregistration/page/9/index.html
+forrt_clusters/replication-research/index.html
+forrt_clusters/replication-research/index.xml
+forrt_clusters/replication-research/page/1/index.html
+forrt_clusters/replication-research/page/10/index.html
+forrt_clusters/replication-research/page/11/index.html
+forrt_clusters/replication-research/page/12/index.html
+forrt_clusters/replication-research/page/13/index.html
+forrt_clusters/replication-research/page/14/index.html
+forrt_clusters/replication-research/page/15/index.html
+forrt_clusters/replication-research/page/16/index.html
+forrt_clusters/replication-research/page/17/index.html
+forrt_clusters/replication-research/page/18/index.html
+forrt_clusters/replication-research/page/19/index.html
+forrt_clusters/replication-research/page/2/index.html
+forrt_clusters/replication-research/page/20/index.html
+forrt_clusters/replication-research/page/21/index.html
+forrt_clusters/replication-research/page/22/index.html
+forrt_clusters/replication-research/page/23/index.html
+forrt_clusters/replication-research/page/24/index.html
+forrt_clusters/replication-research/page/25/index.html
+forrt_clusters/replication-research/page/26/index.html
+forrt_clusters/replication-research/page/27/index.html
+forrt_clusters/replication-research/page/28/index.html
+forrt_clusters/replication-research/page/29/index.html
+forrt_clusters/replication-research/page/3/index.html
+forrt_clusters/replication-research/page/30/index.html
+forrt_clusters/replication-research/page/31/index.html
+forrt_clusters/replication-research/page/32/index.html
+forrt_clusters/replication-research/page/33/index.html
+forrt_clusters/replication-research/page/4/index.html
+forrt_clusters/replication-research/page/5/index.html
+forrt_clusters/replication-research/page/6/index.html
+forrt_clusters/replication-research/page/7/index.html
+forrt_clusters/replication-research/page/8/index.html
+forrt_clusters/replication-research/page/9/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/index.xml
+forrt_clusters/reproducibility-and-replicability-knowledge/page/1/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/10/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/11/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/12/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/13/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/14/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/15/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/16/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/17/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/18/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/19/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/2/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/20/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/21/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/22/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/23/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/24/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/25/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/26/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/27/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/28/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/29/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/3/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/30/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/31/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/32/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/33/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/34/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/35/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/36/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/37/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/38/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/39/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/4/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/40/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/41/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/42/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/43/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/44/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/45/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/46/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/47/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/48/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/49/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/5/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/50/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/6/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/7/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/8/index.html
+forrt_clusters/reproducibility-and-replicability-knowledge/page/9/index.html
+forrt_clusters/reproducible-analyses/index.html
+forrt_clusters/reproducible-analyses/index.xml
+forrt_clusters/reproducible-analyses/page/1/index.html
+forrt_clusters/reproducible-analyses/page/10/index.html
+forrt_clusters/reproducible-analyses/page/11/index.html
+forrt_clusters/reproducible-analyses/page/12/index.html
+forrt_clusters/reproducible-analyses/page/13/index.html
+forrt_clusters/reproducible-analyses/page/14/index.html
+forrt_clusters/reproducible-analyses/page/15/index.html
+forrt_clusters/reproducible-analyses/page/16/index.html
+forrt_clusters/reproducible-analyses/page/17/index.html
+forrt_clusters/reproducible-analyses/page/18/index.html
+forrt_clusters/reproducible-analyses/page/19/index.html
+forrt_clusters/reproducible-analyses/page/2/index.html
+forrt_clusters/reproducible-analyses/page/20/index.html
+forrt_clusters/reproducible-analyses/page/21/index.html
+forrt_clusters/reproducible-analyses/page/22/index.html
+forrt_clusters/reproducible-analyses/page/23/index.html
+forrt_clusters/reproducible-analyses/page/24/index.html
+forrt_clusters/reproducible-analyses/page/3/index.html
+forrt_clusters/reproducible-analyses/page/4/index.html
+forrt_clusters/reproducible-analyses/page/5/index.html
+forrt_clusters/reproducible-analyses/page/6/index.html
+forrt_clusters/reproducible-analyses/page/7/index.html
+forrt_clusters/reproducible-analyses/page/8/index.html
+forrt_clusters/reproducible-analyses/page/9/index.html
+games/index.html
+games/index.xml
+games/page/1/index.html
+glossary/_build_references.py
+glossary/_create_glossaries.py
+glossary/_glossaries.json
+glossary/abstract_bias/index.html
+glossary/academic_impact/index.html
+glossary/accessibility/index.html
+glossary/ad_hominem_bias/index.html
+glossary/adversarial_collaboration/index.html
+glossary/adversarial_collaborative_commentary/index.html
+glossary/affiliation_bias/index.html
+glossary/aleatoric_uncertainty/index.html
+glossary/altmetrics/index.html
+glossary/amnesia/index.html
+glossary/analytic_flexibility/index.html
+glossary/anonymity/index.html
+glossary/apa_lookup.json
+glossary/arabic/_ا_لانحياز_الت_وكيدي_.md
+glossary/arabic/aka_replicability_or_replication_crisis_ازمة_اعادة_الانتاج_او_ازمة_الت_كرار/index.html
+glossary/arabic/analyses_المتانة_في_التحليلات/index.html
+glossary/arabic/apc_رسوم_الن_شر/index.html
+glossary/arabic/artificial_intelligence_علم_الوجود_الذ_كاء_الاصطناعي/index.html
+glossary/arabic/cc_license_رخصة_المشاع_الابداعي_/index.html
+glossary/arabic/cobidas_لجنة_افضل_الممارسات_في_تحليل_البيانات_ومشاركتها/index.html
+glossary/arabic/cog_قيود_الت_عميم/index.html
+glossary/arabic/collaborative_commentary_الت_عليق_الت_عاوني_العدايي/index.html
+glossary/arabic/computational_الن_موذج_الحاسوبي_/index.html
+glossary/arabic/cos_مركز_العلم_المفتوح/index.html
+glossary/arabic/crep_مشروع_الت_كرار_والت_عليم_الت_عاوني/index.html
+glossary/arabic/da_rt_الوصول_للبيانات_وشفافي_ة_البحث/index.html
+glossary/arabic/digital_object_identifier_معر_ف_الكاين_الر_قمي/index.html
+glossary/arabic/dmp_خطة_ادارة_البيانات/index.html
+glossary/arabic/ecrs_الباحثون_المبتديون/index.html
+glossary/arabic/file_drawer_problem_تحي_ز_الن_شر_مشكلة_درج_الملف_ات/index.html
+glossary/arabic/flae_مبدا_الت_اكيد_على_المولف_ين_الاول_والاخير/index.html
+glossary/arabic/gdpr_لايحة_حماية_البيانات_العام_ة/index.html
+glossary/arabic/in_science_تاثير_ماثيو_في_العلوم/index.html
+glossary/arabic/index.html
+glossary/arabic/index.xml
+glossary/arabic/moocs_مقر_رات_الت_عل_م_الض_خمة_المفتوحة_عن_بعد/index.html
+glossary/arabic/moops_الاوراق_الضخمة_والمفتوحة_على_الانترنت/index.html
+glossary/arabic/netanos_اخفاء_ه_وي_ة_الن_ص_المعتمد_على_الكيان_للعلم_المفتوح/index.html
+glossary/arabic/nhst_اختبار_دلالة_الفرضي_ة_الص_فري_ة/index.html
+glossary/arabic/niro_sr_المراجعات_المنهجي_ة_غير_الت_دخلي_ة_المفتوحة_والقابلة_للت_كرار/index.html
+glossary/arabic/oer_commons_مصادر_التع_ل_م_المفتوحة_العام_ة/index.html
+glossary/arabic/oers_المصادر_الت_عليمي_ة_المفتوحة/index.html
+glossary/arabic/open_researcher_and_contributor_id_الاوركيد/index.html
+glossary/arabic/open_science_الش_ارات_العلم_المفتوح/index.html
+glossary/arabic/or_guest_authorship_الت_اليف_الم_هدى_او_المولف_الض_يف/index.html
+glossary/arabic/p_مقياس_المساهمة_البحثي_ة_نشر/index.html
+glossary/arabic/peer_community_in_منظ_مة_الاقران/index.html
+glossary/arabic/peer_review_openness_initiative_مبادرة_انفتاح_تحكيم_الاقران/index.html
+glossary/arabic/philosophy_الن_موذج_الفلسفي_/index.html
+glossary/arabic/ppi_عي_نة_ومجتمع_الد_راسة_المساهمين/index.html
+glossary/arabic/qmp_ممارسات_القياس_المشكوك_فيها/index.html
+glossary/arabic/qrps_ممارسات_البحث_المشكوك_فيها_او_ممارسات_اعداد_الت_قارير_المشكوك_فيها/index.html
+glossary/arabic/sdc_نهج_الت_سلسل_الذي_يحد_د_المساهمة/index.html
+glossary/arabic/sips_جمعية_تطويرالعلوم_الن_فسي_ة/index.html
+glossary/arabic/sortee_جمعي_ة_علم_البيية_والبيولوجيا_الت_طوري_ة_المنفتحة_والموثوقة_والش_فافة/index.html
+glossary/arabic/statistical_الن_موذج_الاحصايي_/index.html
+glossary/arabic/the_system_الت_لاعب_بالن_ظام/index.html
+glossary/arabic/to_open_scholarship_الن_هج_الت_صاعدي_/index.html
+glossary/arabic/udl_الت_صميم_الش_امل_للت_عل_م/index.html
+glossary/arabic/اختبار_الت_كافو/index.html
+glossary/arabic/ادارة_بيانات_البحث/index.html
+glossary/arabic/ارشادات_ارايف/index.html
+glossary/arabic/ارشادات_الاعداد/index.html
+glossary/arabic/اسواق_الت_كرار/index.html
+glossary/arabic/اشباه_البيانات/index.html
+glossary/arabic/اطار_العلوم_المفتوحة/index.html
+glossary/arabic/اعلان_سان_فرانسيسكو_بشان_تقييم_البحوث/index.html
+glossary/arabic/اكتساب_المعرفة/index.html
+glossary/arabic/اكتشاف_الاخطاء/index.html
+glossary/arabic/الاثر_الاقتصادي_والاجتماعي/index.html
+glossary/arabic/الاحتمال_العشوايي/index.html
+glossary/arabic/الاستدلال_البايزي/index.html
+glossary/arabic/الاستقراء/index.html
+glossary/arabic/الاستنساخ_الحسابي/index.html
+glossary/arabic/الاسهام/index.html
+glossary/arabic/الاطار_المجتمعي_للممارسات_الجي_دة_في_المستودعات/index.html
+glossary/arabic/الافتراض_بعد_معرفة_الن_تايج/index.html
+glossary/arabic/الافتراضات_الاحصايي_ة/index.html
+glossary/arabic/الانتاج_المشترك/index.html
+glossary/arabic/الاندماج_الاجتماعي_/index.html
+glossary/arabic/الانعكاسي_ة/index.html
+glossary/arabic/الايقاف_الاختياري/index.html
+glossary/arabic/البحث_الجماعي/index.html
+glossary/arabic/البحث_الكمي_/index.html
+glossary/arabic/البحث_الن_وعي/index.html
+glossary/arabic/البحث_والابتكار_المسوول/index.html
+glossary/arabic/البحوث_الت_شاركي_ة/index.html
+glossary/arabic/البحوث_الحس_اسة/index.html
+glossary/arabic/البيان_التصحيحي/index.html
+glossary/arabic/البيانات_المفتوحة/index.html
+glossary/arabic/البيانات_الوصفي_ة/index.html
+glossary/arabic/الت_اثير_الاكاديمي_/index.html
+glossary/arabic/الت_اليف/index.html
+glossary/arabic/الت_حالف_الت_اليفي/index.html
+glossary/arabic/الت_حكم_في_الاصدار/index.html
+glossary/arabic/الت_حكيم_المفتوح/index.html
+glossary/arabic/الت_حكيم_ثلاثي_الت_عمية/index.html
+glossary/arabic/الت_حليل_البعدي/index.html
+glossary/arabic/الت_حليل_البعدي_للمقاييس_الن_فسي_ة/index.html
+glossary/arabic/الت_حليلات_الت_وكيدي_ة/index.html
+glossary/arabic/الت_حي_ز_الايديولوجي/index.html
+glossary/arabic/الت_راخيص_المفتوحة/index.html
+glossary/arabic/الت_سجيل_المسبق/index.html
+glossary/arabic/الت_سجيل_بعد_معرفة_الن_تايج/index.html
+glossary/arabic/الت_سمية_المستعارة/index.html
+glossary/arabic/الت_شابك/index.html
+glossary/arabic/الت_شارك_العدايي/index.html
+glossary/arabic/الت_شاركي_ة/index.html
+glossary/arabic/الت_عددي_ة/index.html
+glossary/arabic/الت_عمية/index.html
+glossary/arabic/الت_قاطعي_ة/index.html
+glossary/arabic/الت_قرير_المسج_ل/index.html
+glossary/arabic/الت_قطيع_غير_المبر_ر/index.html
+glossary/arabic/الت_كرار/index.html
+glossary/arabic/الت_كرار_الكاذب/index.html
+glossary/arabic/الت_كرار_المباشر/index.html
+glossary/arabic/الت_كرار_المفاهيمي/index.html
+glossary/arabic/الت_نوع/index.html
+glossary/arabic/الت_وزيع_الل_احق/index.html
+glossary/arabic/الت_وزيع_المسبق/index.html
+glossary/arabic/التحكيم_احادي__الت_عمية/index.html
+glossary/arabic/التحكيم_مزدوج_الت_عمية/index.html
+glossary/arabic/الث_بات/index.html
+glossary/arabic/الث_لاثي_المقلق/index.html
+glossary/arabic/الخطا_من_الن_وع_اس/index.html
+glossary/arabic/الخطا_من_الن_وع_الاو_ل/index.html
+glossary/arabic/الخطا_من_الن_وع_الث_اني/index.html
+glossary/arabic/الخطا_من_الن_وع_ام/index.html
+glossary/arabic/الد_راسات_متعد_دة_المحل_لين/index.html
+glossary/arabic/الد_لالة_الاحصايي_ة/index.html
+glossary/arabic/الس_بق/index.html
+glossary/arabic/الش_فافي_ة/index.html
+glossary/arabic/الش_مول/index.html
+glossary/arabic/الص_دق/index.html
+glossary/arabic/الص_دق_الاحصايي/index.html
+glossary/arabic/الص_دق_البنايي/index.html
+glossary/arabic/الص_دق_الخارجي/index.html
+glossary/arabic/الص_دق_الد_اخلي/index.html
+glossary/arabic/الص_دق_الظاهري/index.html
+glossary/arabic/الض_ريبة_الث_قافي_ة/index.html
+glossary/arabic/الط_باعة_الاولي_ة/index.html
+glossary/arabic/الط_بقة_الاجتماعي_ة/index.html
+glossary/arabic/العدالة/index.html
+glossary/arabic/العديد_من_المول_فين/index.html
+glossary/arabic/العلم_البطيء/index.html
+glossary/arabic/العلم_الت_راكمي/index.html
+glossary/arabic/العلم_المفتوح/index.html
+glossary/arabic/العلوم_البعدي_ة_الت_لوية_او_البحث_البعدي_الت_لوي/index.html
+glossary/arabic/الغسل_المفتوح/index.html
+glossary/arabic/الفرضي_ة/index.html
+glossary/arabic/الفرضية_المساعدة/index.html
+glossary/arabic/الفرق_الحمراء/index.html
+glossary/arabic/القابلي_ة_للت_عميم/index.html
+glossary/arabic/القرصنة_العكسي_ة_للقيمة_الاحتمالي_ة/index.html
+glossary/arabic/القو_ة_الاحصايي_ة/index.html
+glossary/arabic/القياسات_الد_لالي_ة/index.html
+glossary/arabic/القيمة_الاحتمالي_ة/index.html
+glossary/arabic/الل_جنة_الذ_كوري_ة/index.html
+glossary/arabic/اللايقين_المعرفي/index.html
+glossary/arabic/المتغي_رات_الوسيطة_الخفي_ة/index.html
+glossary/arabic/المجل_ات_الت_ركيبي_ة/index.html
+glossary/arabic/المراجعة_المنهجي_ة/index.html
+glossary/arabic/المرونة_الت_حليلي_ة/index.html
+glossary/arabic/المشاريع_المجتمعي_ة/index.html
+glossary/arabic/المعامل_المتعد_دة/index.html
+glossary/arabic/المعرفة_المفتوحة/index.html
+glossary/arabic/المقاييس_البديلة/index.html
+glossary/arabic/المنص_ة_العصبي_ة_المفتوحة/index.html
+glossary/arabic/المواد_المفتوحة/index.html
+glossary/arabic/الموضعي_ة/index.html
+glossary/arabic/الموضوعي_ة/index.html
+glossary/arabic/الن_شر_المفترس_الاستغلالي_/index.html
+glossary/arabic/الن_شر_او_الفناء/index.html
+glossary/arabic/الن_ص_البرمجي_المفتوح/index.html
+glossary/arabic/الن_ظري_ة/index.html
+glossary/arabic/النقد_بعد_معرفة_النتايج/index.html
+glossary/arabic/الوصول_المفتوح/index.html
+glossary/arabic/الوعي_المزدوج/index.html
+glossary/arabic/امكاني_ة_الوصول/index.html
+glossary/arabic/امنيجا/index.html
+glossary/arabic/انحياز_المستخلص/index.html
+glossary/arabic/انهاء_الاستعمار/index.html
+glossary/arabic/بايثون/index.html
+glossary/arabic/برنامج_جاب_ريف/index.html
+glossary/arabic/برنامج_جاسب/index.html
+glossary/arabic/برنامج_قوة_جي/index.html
+glossary/arabic/برنامج_مفتوح_المصدر/index.html
+glossary/arabic/بروبنساينس/index.html
+glossary/arabic/بناء_الن_ظري_ة/index.html
+glossary/arabic/بنية_بيانات_تصوير_الد_ماغ/index.html
+glossary/arabic/بيان_تنو_ع_الاستشهادات/index.html
+glossary/arabic/بيزار/index.html
+glossary/arabic/ت_عهد_الت_سجيل_المسبق/index.html
+glossary/arabic/تاطير_المقابلات/index.html
+glossary/arabic/تحليل_الاكوان_المتعد_دة/index.html
+glossary/arabic/تحليل_البيانات_الاستكشافي_/index.html
+glossary/arabic/تحليل_منحنى_المواصفات/index.html
+glossary/arabic/تحي_ز_الاستشهاد/index.html
+glossary/arabic/تحي_ز_الانتماء/index.html
+glossary/arabic/تحي_ز_الش_خصنة/index.html
+glossary/arabic/تصنيف_ادوار_المول_فين/index.html
+glossary/arabic/تصوير_البيانات/index.html
+glossary/arabic/تعارض_المصالح/index.html
+glossary/arabic/تقدير_المعاملات_باستخدام_الن_هج_البايزي/index.html
+glossary/arabic/توليف_الادلة/index.html
+glossary/arabic/تينزينج/index.html
+glossary/arabic/ثقة_الجمهور_في_العلوم/index.html
+glossary/arabic/ثورة_المصداقي_ة/index.html
+glossary/arabic/جاموفي/index.html
+glossary/arabic/حاجز_مالي/index.html
+glossary/arabic/حديقة_المسارات_المتشعبة/index.html
+glossary/arabic/خريطة_الموضعية/index.html
+glossary/arabic/خطة_الص_دمة/index.html
+glossary/arabic/خلاصة_وافية/index.html
+glossary/arabic/دالة_الاحتمالي_ة/index.html
+glossary/arabic/درجات_حر_ي_ة_الباحث/index.html
+glossary/arabic/دليل_اعداد_الت_قارير/index.html
+glossary/arabic/دليل_الر_موز/index.html
+glossary/arabic/دورة_البحث/index.html
+glossary/arabic/زينودو/index.html
+glossary/arabic/سترينج_الخلفي_ة_الاجتماعي_ة_والقابلي_ة_للت_تبع_والاختيار_الذ_اتي_وتاريخ_الت_ربية_والت_اقلم_والت_عود/index.html
+glossary/arabic/سج_ل_مستودعات_بيانات_البحث/index.html
+glossary/arabic/شبكة_ارشيف_المعرفة_الش_املة/index.html
+glossary/arabic/شبكة_التكرار/index.html
+glossary/arabic/شيربا_روميو/index.html
+glossary/arabic/صدق_المحتوى/index.html
+glossary/arabic/صدق_المحك/index.html
+glossary/arabic/طريقة_الت_قليم_والت_عبية/index.html
+glossary/arabic/علم_المواطن/index.html
+glossary/arabic/علم_الن_فس_الن_سوي/index.html
+glossary/arabic/فترة_الحظر/index.html
+glossary/arabic/فورت/index.html
+glossary/arabic/قابلي_ة_اعادة_الانتاج/index.html
+glossary/arabic/قابلي_ة_الت_كرار/index.html
+glossary/arabic/قاعدة_المعرفة_للمنح_الد_راسي_ة_المفتوحة/index.html
+glossary/arabic/قانون_قودهارت/index.html
+glossary/arabic/قايمة_مراجعة_الش_فافي_ة/index.html
+glossary/arabic/قرصنة_القيمة_الاحتمالي_ة/index.html
+glossary/arabic/قياسات_الويب/index.html
+glossary/arabic/لغة_الار/index.html
+glossary/arabic/مبادلة_الد_راسات/index.html
+glossary/arabic/مبادي_الث_قة/index.html
+glossary/arabic/مبادي_فير/index.html
+glossary/arabic/مبدا_الاحتمالي_ة/index.html
+glossary/arabic/مجتمع_الاقران_للت_قارير_المسج_لة/index.html
+glossary/arabic/مراجعة_الادبي_ات/index.html
+glossary/arabic/مراجعة_الاقران_بعد_الن_شر/index.html
+glossary/arabic/مراجعة_الن_ص_البرمجي/index.html
+glossary/arabic/مراسم_البحث/index.html
+glossary/arabic/مسار_البحث_العلمي_/index.html
+glossary/arabic/مستودع_البيانات/index.html
+glossary/arabic/مشاركة_البيانات/index.html
+glossary/arabic/مشروع_الت_كرار/index.html
+glossary/arabic/مشكلة_ازدواجية_الاسم/index.html
+glossary/arabic/مصانع_الورق/index.html
+glossary/arabic/معامل_بايز/index.html
+glossary/arabic/معامل_تاثير_المج_لة/index.html
+glossary/arabic/معيار_الت_مييز/index.html
+glossary/arabic/مغالطة_الت_فاعل/index.html
+glossary/arabic/ملفات_جي_سون/index.html
+glossary/arabic/منتدى_العلوم_المتعد_د_القابلة_للت_كرار_والقابلة_للت_فسير_والمفتوحة_والش_فافة_نادي_رايوت_للعلوم/index.html
+glossary/arabic/منحنى_القيم_الاحتمالي_ة/index.html
+glossary/arabic/منحنى_زد/index.html
+glossary/arabic/منص_ة_حر_ر_معرفتنا/index.html
+glossary/arabic/منصة_باب_ير_pubpeer/index.html
+glossary/arabic/موشر_i10/index.html
+glossary/arabic/موشر_اتش/index.html
+glossary/arabic/نزاهة_البحث/index.html
+glossary/arabic/نظري_ة_المعرفة/index.html
+glossary/arabic/نقص_الت_مثيل/index.html
+glossary/arabic/نهج_الت_دمير_الابداعي_للت_كرار/index.html
+glossary/arabic/نوادي_الابحاث_الت_كراري_ة/index.html
+glossary/arabic/هاكثون/index.html
+glossary/arabic/هيكل_الحوافز/index.html
+glossary/arabic/و_يرد/index.html
+glossary/arrive_guidelines/index.html
+glossary/article_processing_charge_apc_/index.html
+glossary/authorship/index.html
+glossary/auxiliary_hypothesis/index.html
+glossary/badges_open_science_/index.html
+glossary/bayes_factor/index.html
+glossary/bayesian_inference/index.html
+glossary/bayesian_parameter_estimation/index.html
+glossary/bids_data_structure/index.html
+glossary/bizarre/index.html
+glossary/bottom_up_approach_to_open_scholarship_/index.html
+glossary/bracketing_interviews/index.html
+glossary/bropenscience/index.html
+glossary/carking/index.html
+glossary/center_for_open_science_cos_/index.html
+glossary/chinese/_兄弟_式开放科学/index.html
+glossary/chinese/_旧金山科研评估宣言_.md
+glossary/chinese/amnesia/index.html
+glossary/chinese/arrive指南/index.html
+glossary/chinese/bizarre/index.html
+glossary/chinese/coar存储库良好实践社区框架/index.html
+glossary/chinese/fair原则/index.html
+glossary/chinese/g_power/index.html
+glossary/chinese/git/index.html
+glossary/chinese/h指数/index.html
+glossary/chinese/i10指数/index.html
+glossary/chinese/index.html
+glossary/chinese/index.xml
+glossary/chinese/jabref/index.html
+glossary/chinese/jamovi/index.html
+glossary/chinese/jasp/index.html
+glossary/chinese/json_文件/index.html
+glossary/chinese/manel/index.html
+glossary/chinese/m类错误/index.html
+glossary/chinese/openneuro/index.html
+glossary/chinese/p_曲线/index.html
+glossary/chinese/pci_注册报告/index.html
+glossary/chinese/prepare_指南/index.html
+glossary/chinese/pubpeer/index.html
+glossary/chinese/python/index.html
+glossary/chinese/p值/index.html
+glossary/chinese/p值操纵/index.html
+glossary/chinese/r/index.html
+glossary/chinese/replicats项目/index.html
+glossary/chinese/reproducibilitea/index.html
+glossary/chinese/riot科学俱乐部/index.html
+glossary/chinese/sherpa_romeo/index.html
+glossary/chinese/strange/index.html
+glossary/chinese/studyswap/index.html
+glossary/chinese/s类错误/index.html
+glossary/chinese/s计划/index.html
+glossary/chinese/tenzing/index.html
+glossary/chinese/trust原则/index.html
+glossary/chinese/zenodo/index.html
+glossary/chinese/z曲线/index.html
+glossary/chinese/一类错误/index.html
+glossary/chinese/三大隐患/index.html
+glossary/chinese/三盲同行评审/index.html
+glossary/chinese/不当测量行为/index.html
+glossary/chinese/不当研究行为或不当报告行为/index.html
+glossary/chinese/事后/index.html
+glossary/chinese/二类错误/index.html
+glossary/chinese/交互谬误/index.html
+glossary/chinese/交叉性/index.html
+glossary/chinese/人身偏见/index.html
+glossary/chinese/从属偏见/index.html
+glossary/chinese/付费墙/index.html
+glossary/chinese/代码审查/index.html
+glossary/chinese/代表性不足/index.html
+glossary/chinese/众包研究/index.html
+glossary/chinese/伪重复/index.html
+glossary/chinese/似然函数/index.html
+glossary/chinese/似然原理/index.html
+glossary/chinese/作者署名/index.html
+glossary/chinese/信度/index.html
+glossary/chinese/假名化/index.html
+glossary/chinese/假设/index.html
+glossary/chinese/元分析/index.html
+glossary/chinese/元数据/index.html
+glossary/chinese/元科学或元研究/index.html
+glossary/chinese/先验分布/index.html
+glossary/chinese/公众对科学的信任/index.html
+glossary/chinese/公众科学/index.html
+glossary/chinese/公平/index.html
+glossary/chinese/共同生产/index.html
+glossary/chinese/共有性/index.html
+glossary/chinese/内容效度/index.html
+glossary/chinese/内部效度/index.html
+glossary/chinese/分析灵活性/index.html
+glossary/chinese/切香肠式发表/index.html
+glossary/chinese/划界标准/index.html
+glossary/chinese/创造性破坏式的复现方法/index.html
+glossary/chinese/利益冲突/index.html
+glossary/chinese/剪补法/index.html
+glossary/chinese/勘误表/index.html
+glossary/chinese/包容性/index.html
+glossary/chinese/匿名性/index.html
+glossary/chinese/协作式复现与教育项目/index.html
+glossary/chinese/单盲同行评审/index.html
+glossary/chinese/去殖民化/index.html
+glossary/chinese/参与式研究/index.html
+glossary/chinese/参与者和公众参与/index.html
+glossary/chinese/双盲同行评审/index.html
+glossary/chinese/双重意识/index.html
+glossary/chinese/反向p值操纵/index.html
+glossary/chinese/反身性/index.html
+glossary/chinese/发表偏倚_文件抽屉问题/index.html
+glossary/chinese/发表后同行评审/index.html
+glossary/chinese/发表或灭亡/index.html
+glossary/chinese/叠加期刊/index.html
+glossary/chinese/古德哈特定律/index.html
+glossary/chinese/可信度革命/index.html
+glossary/chinese/可复现性/index.html
+glossary/chinese/可推广性/index.html
+glossary/chinese/可访问性/index.html
+glossary/chinese/可重复性/index.html
+glossary/chinese/可重复性危机_又称可复现性或复现危机_/index.html
+glossary/chinese/可重复性网络/index.html
+glossary/chinese/同行评审开放性倡议/index.html
+glossary/chinese/同辈社区/index.html
+glossary/chinese/后验分布/index.html
+glossary/chinese/团体项目/index.html
+glossary/chinese/复现市场/index.html
+glossary/chinese/外部效度/index.html
+glossary/chinese/多作者参与/index.html
+glossary/chinese/多分析者研究/index.html
+glossary/chinese/多实验室协作/index.html
+glossary/chinese/多样性/index.html
+glossary/chinese/多重分析/index.html
+glossary/chinese/多重性/index.html
+glossary/chinese/大型开放式在线论文/index.html
+glossary/chinese/大型开放式在线课程/index.html
+glossary/chinese/女性主义心理学/index.html
+glossary/chinese/姓名歧义问题/index.html
+glossary/chinese/存储库/index.html
+glossary/chinese/学术影响/index.html
+glossary/chinese/定性研究/index.html
+glossary/chinese/定量研究/index.html
+glossary/chinese/客观性/index.html
+glossary/chinese/对抗性_合作性_评论/index.html
+glossary/chinese/对抗性合作/index.html
+glossary/chinese/尽责的研究与创新/index.html
+glossary/chinese/开放_可靠_透明的生态与进化生物学学会/index.html
+glossary/chinese/开放代码/index.html
+glossary/chinese/开放可重复研究与教学框架/index.html
+glossary/chinese/开放同行评审/index.html
+glossary/chinese/开放学术/index.html
+glossary/chinese/开放学术知识库/index.html
+glossary/chinese/开放教育资源/index.html
+glossary/chinese/开放教育资源在线库/index.html
+glossary/chinese/开放数据/index.html
+glossary/chinese/开放材料/index.html
+glossary/chinese/开放漂白/index.html
+glossary/chinese/开放研究者和贡献者id/index.html
+glossary/chinese/开放科学/index.html
+glossary/chinese/开放科学中心/index.html
+glossary/chinese/开放科学框架/index.html
+glossary/chinese/开放科学的命名实体文本匿名化工具/index.html
+glossary/chinese/开放获取/index.html
+glossary/chinese/开放许可/index.html
+glossary/chinese/开源软件/index.html
+glossary/chinese/引用偏见/index.html
+glossary/chinese/引用多样性声明/index.html
+glossary/chinese/归纳/index.html
+glossary/chinese/徽章_开放科学_/index.html
+glossary/chinese/心理测量元分析/index.html
+glossary/chinese/心理科学改进学会/index.html
+glossary/chinese/意识形态偏见/index.html
+glossary/chinese/慢科学/index.html
+glossary/chinese/抢发/index.html
+glossary/chinese/报告指南/index.html
+glossary/chinese/括号式访谈/index.html
+glossary/chinese/掠夺性出版/index.html
+glossary/chinese/探索性数据分析/index.html
+glossary/chinese/摘要偏倚/index.html
+glossary/chinese/效度/index.html
+glossary/chinese/效标效度/index.html
+glossary/chinese/敏感研究/index.html
+glossary/chinese/数字对象唯一标识符/index.html
+glossary/chinese/数据共享/index.html
+glossary/chinese/数据分析与共享最佳实践委员会/index.html
+glossary/chinese/数据可视化/index.html
+glossary/chinese/数据管理计划/index.html
+glossary/chinese/数据获取与研究透明度/index.html
+glossary/chinese/文化税负/index.html
+glossary/chinese/文献综述/index.html
+glossary/chinese/早期职业研究人员/index.html
+glossary/chinese/普遍性限制/index.html
+glossary/chinese/替代计量/index.html
+glossary/chinese/期刊影响因子/index.html
+glossary/chinese/本体论_人工智能_/index.html
+glossary/chinese/构念效度/index.html
+glossary/chinese/概念复现/index.html
+glossary/chinese/歧路花园/index.html
+glossary/chinese/汇编/index.html
+glossary/chinese/注册报告/index.html
+glossary/chinese/激励机制/index.html
+glossary/chinese/版本控制/index.html
+glossary/chinese/版面费/index.html
+glossary/chinese/理论/index.html
+glossary/chinese/理论建构/index.html
+glossary/chinese/理论模型/index.html
+glossary/chinese/直接复现/index.html
+glossary/chinese/知识共享许可协议/index.html
+glossary/chinese/知识获取/index.html
+glossary/chinese/研究人员自由度/index.html
+glossary/chinese/研究工作流程/index.html
+glossary/chinese/研究循环/index.html
+glossary/chinese/研究数据存储库注册系统/index.html
+glossary/chinese/研究数据管理/index.html
+glossary/chinese/研究方案/index.html
+glossary/chinese/研究诚信/index.html
+glossary/chinese/研究贡献指标_p_/index.html
+glossary/chinese/确认偏误/index.html
+glossary/chinese/社会融合/index.html
+glossary/chinese/社会阶层/index.html
+glossary/chinese/禁运期/index.html
+glossary/chinese/稳健性_分析_/index.html
+glossary/chinese/立场性/index.html
+glossary/chinese/立场性图谱/index.html
+glossary/chinese/等效性检验/index.html
+glossary/chinese/系统综述/index.html
+glossary/chinese/累积性科学/index.html
+glossary/chinese/红队/index.html
+glossary/chinese/经济和社会影响/index.html
+glossary/chinese/结果已知后假设/index.html
+glossary/chinese/结果已知后批评/index.html
+glossary/chinese/结果已知后预注册/index.html
+glossary/chinese/统计假设/index.html
+glossary/chinese/统计功效/index.html
+glossary/chinese/统计效度/index.html
+glossary/chinese/统计显著性/index.html
+glossary/chinese/统计模型/index.html
+glossary/chinese/综合知识档案网络/index.html
+glossary/chinese/编码表/index.html
+glossary/chinese/网络计量学/index.html
+glossary/chinese/署名顺序决定贡献法/index.html
+glossary/chinese/联合作者署名/index.html
+glossary/chinese/联锁/index.html
+glossary/chinese/脑成像数据结构/index.html
+glossary/chinese/自下而上的方法_用于开放学术_/index.html
+glossary/chinese/表面效度/index.html
+glossary/chinese/西方的_受过教育的_工业化的_富裕的_民主的社会/index.html
+glossary/chinese/规范曲线分析/index.html
+glossary/chinese/解放我们的知识平台/index.html
+glossary/chinese/计算可重复性/index.html
+glossary/chinese/计算模型/index.html
+glossary/chinese/认识不确定性/index.html
+glossary/chinese/认识论/index.html
+glossary/chinese/论文工厂/index.html
+glossary/chinese/证据综合/index.html
+glossary/chinese/语义计量/index.html
+glossary/chinese/贝叶斯参数估计/index.html
+glossary/chinese/贝叶斯因子/index.html
+glossary/chinese/贝叶斯推断/index.html
+glossary/chinese/贡献/index.html
+glossary/chinese/贡献者角色分类法/index.html
+glossary/chinese/赠予_或客座_署名权/index.html
+glossary/chinese/辅助假设/index.html
+glossary/chinese/辅助数据/index.html
+glossary/chinese/选择性终止/index.html
+glossary/chinese/透明度/index.html
+glossary/chinese/透明度清单/index.html
+glossary/chinese/通用学习设计/index.html
+glossary/chinese/通用数据保护条例/index.html
+glossary/chinese/重复性/index.html
+glossary/chinese/钻_系统_空子/index.html
+glossary/chinese/错误检测/index.html
+glossary/chinese/随机不确定性/index.html
+glossary/chinese/隐性调节变量/index.html
+glossary/chinese/零假设显著性检验方法/index.html
+glossary/chinese/非干预_可重复_开放的系统综述/index.html
+glossary/chinese/预印本/index.html
+glossary/chinese/预注册/index.html
+glossary/chinese/预注册承诺/index.html
+glossary/chinese/首末作者强调规范/index.html
+glossary/chinese/马太效应_科学领域_/index.html
+glossary/chinese/验证性分析/index.html
+glossary/chinese/黑客马拉松/index.html
+glossary/citation_bias/index.html
+glossary/citation_diversity_statement/index.html
+glossary/citizen_science/index.html
+glossary/ckan/index.html
+glossary/co_production/index.html
+glossary/coar_community_framework_for_good_practices_in_repositories/index.html
+glossary/code_review/index.html
+glossary/codebook/index.html
+glossary/collaborative_replication_and_education_project_crep_/index.html
+glossary/committee_on_best_practices_in_data_analysis_and_sharing_cobidas_/index.html
+glossary/communality/index.html
+glossary/community_projects/index.html
+glossary/compendium/index.html
+glossary/computational_reproducibility/index.html
+glossary/conceptual_replication/index.html
+glossary/confirmation_bias/index.html
+glossary/confirmatory_analyses/index.html
+glossary/conflict_of_interest/index.html
+glossary/consortium_authorship/index.html
+glossary/constraints_on_generality_cog_/index.html
+glossary/construct_validity/index.html
+glossary/content_validity/index.html
+glossary/corrigendum/index.html
+glossary/creative_commons_cc_license/index.html
+glossary/creative_destruction_approach_to_replication/index.html
+glossary/credibility_revolution/index.html
+glossary/credit/index.html
+glossary/criterion_validity/index.html
+glossary/crowdsourced_research/index.html
+glossary/cultural_taxation/index.html
+glossary/cumulative_science/index.html
+glossary/data_access_and_research_transparency_da_rt_/index.html
+glossary/data_management_plan_dmp_/index.html
+glossary/data_sharing/index.html
+glossary/data_visualisation/index.html
+glossary/decolonisation/index.html
+glossary/demarcation_criterion/index.html
+glossary/direct_replication/index.html
+glossary/diversity/index.html
+glossary/doi_digital_object_identifier_/index.html
+glossary/dora/index.html
+glossary/double_blind_peer_review/index.html
+glossary/double_consciousness/index.html
+glossary/early_career_researchers_ecrs_/index.html
+glossary/economic_and_societal_impact/index.html
+glossary/embargo_period/index.html
+glossary/english/abstract_bias/index.html
+glossary/english/academic_impact/index.html
+glossary/english/accessibility/index.html
+glossary/english/ad_hominem_bias/index.html
+glossary/english/adversarial_collaboration/index.html
+glossary/english/adversarial_collaborative_commentary/index.html
+glossary/english/affiliation_bias/index.html
+glossary/english/aleatoric_uncertainty/index.html
+glossary/english/altmetrics/index.html
+glossary/english/amnesia/index.html
+glossary/english/analytic_flexibility/index.html
+glossary/english/anonymity/index.html
+glossary/english/arrive_guidelines/index.html
+glossary/english/article_processing_charge_apc_/index.html
+glossary/english/authorship/index.html
+glossary/english/auxiliary_hypothesis/index.html
+glossary/english/badges_open_science_/index.html
+glossary/english/bayes_factor/index.html
+glossary/english/bayesian_inference/index.html
+glossary/english/bayesian_parameter_estimation/index.html
+glossary/english/bids_data_structure/index.html
+glossary/english/bizarre/index.html
+glossary/english/bottom_up_approach_to_open_scholarship_/index.html
+glossary/english/bracketing_interviews/index.html
+glossary/english/bropenscience/index.html
+glossary/english/carking/index.html
+glossary/english/center_for_open_science_cos_/index.html
+glossary/english/citation_bias/index.html
+glossary/english/citation_diversity_statement/index.html
+glossary/english/citizen_science/index.html
+glossary/english/ckan/index.html
+glossary/english/co_production/index.html
+glossary/english/coar_community_framework_for_good_practices_in_repositories/index.html
+glossary/english/code_review/index.html
+glossary/english/codebook/index.html
+glossary/english/collaborative_replication_and_education_project_crep_/index.html
+glossary/english/committee_on_best_practices_in_data_analysis_and_sharing_cobidas_/index.html
+glossary/english/communality/index.html
+glossary/english/community_projects/index.html
+glossary/english/compendium/index.html
+glossary/english/computational_reproducibility/index.html
+glossary/english/conceptual_replication/index.html
+glossary/english/confirmation_bias/index.html
+glossary/english/confirmatory_analyses/index.html
+glossary/english/conflict_of_interest/index.html
+glossary/english/consortium_authorship/index.html
+glossary/english/constraints_on_generality_cog_/index.html
+glossary/english/construct_validity/index.html
+glossary/english/content_validity/index.html
+glossary/english/corrigendum/index.html
+glossary/english/creative_commons_cc_license/index.html
+glossary/english/creative_destruction_approach_to_replication/index.html
+glossary/english/credibility_revolution/index.html
+glossary/english/credit/index.html
+glossary/english/criterion_validity/index.html
+glossary/english/crowdsourced_research/index.html
+glossary/english/cultural_taxation/index.html
+glossary/english/cumulative_science/index.html
+glossary/english/data_access_and_research_transparency_da_rt_/index.html
+glossary/english/data_management_plan_dmp_/index.html
+glossary/english/data_sharing/index.html
+glossary/english/data_visualisation/index.html
+glossary/english/decolonisation/index.html
+glossary/english/demarcation_criterion/index.html
+glossary/english/direct_replication/index.html
+glossary/english/diversity/index.html
+glossary/english/doi_digital_object_identifier_/index.html
+glossary/english/dora/index.html
+glossary/english/double_blind_peer_review/index.html
+glossary/english/double_consciousness/index.html
+glossary/english/early_career_researchers_ecrs_/index.html
+glossary/english/economic_and_societal_impact/index.html
+glossary/english/embargo_period/index.html
+glossary/english/epistemic_uncertainty/index.html
+glossary/english/epistemology/index.html
+glossary/english/equity/index.html
+glossary/english/equivalence_testing/index.html
+glossary/english/error_detection/index.html
+glossary/english/evidence_synthesis/index.html
+glossary/english/exploratory_data_analysis/index.html
+glossary/english/external_validity/index.html
+glossary/english/face_validity/index.html
+glossary/english/fair_principles/index.html
+glossary/english/feminist_psychology/index.html
+glossary/english/first_last_author_emphasis_norm_flae_/index.html
+glossary/english/forrt/index.html
+glossary/english/free_our_knowledge_platform/index.html
+glossary/english/gaming_the_system_/index.html
+glossary/english/garden_of_forking_paths/index.html
+glossary/english/general_data_protection_regulation_gdpr_/index.html
+glossary/english/generalizability/index.html
+glossary/english/gift_or_guest_authorship/index.html
+glossary/english/git/index.html
+glossary/english/goodhart_s_law/index.html
+glossary/english/gpower/index.html
+glossary/english/h_index/index.html
+glossary/english/hackathon/index.html
+glossary/english/harking/index.html
+glossary/english/hidden_moderators/index.html
+glossary/english/hypothesis/index.html
+glossary/english/i10_index/index.html
+glossary/english/ideological_bias/index.html
+glossary/english/incentive_structure/index.html
+glossary/english/inclusion/index.html
+glossary/english/index.html
+glossary/english/index.xml
+glossary/english/induction/index.html
+glossary/english/interaction_fallacy/index.html
+glossary/english/interlocking/index.html
+glossary/english/internal_validity/index.html
+glossary/english/intersectionality/index.html
+glossary/english/jabref/index.html
+glossary/english/jamovi/index.html
+glossary/english/jasp/index.html
+glossary/english/journal_impact_factor_/index.html
+glossary/english/json_file/index.html
+glossary/english/knowledge_acquisition/index.html
+glossary/english/likelihood_function/index.html
+glossary/english/likelihood_principle/index.html
+glossary/english/literature_review/index.html
+glossary/english/manel/index.html
+glossary/english/many_authors/index.html
+glossary/english/many_labs/index.html
+glossary/english/massive_open_online_courses_moocs_/index.html
+glossary/english/massively_open_online_papers_moops_/index.html
+glossary/english/matthew_effect_in_science_/index.html
+glossary/english/meta_analysis/index.html
+glossary/english/meta_science_or_meta_research/index.html
+glossary/english/metadata/index.html
+glossary/english/model_computational_/index.html
+glossary/english/model_philosophy_/index.html
+glossary/english/model_statistical_/index.html
+glossary/english/multi_analyst_studies/index.html
+glossary/english/multiplicity/index.html
+glossary/english/multiverse_analysis/index.html
+glossary/english/name_ambiguity_problem/index.html
+glossary/english/named_entity_based_text_anonymization_for_open_science_netanos_/index.html
+glossary/english/non_intervention_reproducible_and_open_systematic_reviews_niro_sr_/index.html
+glossary/english/null_hypothesis_significance_testing_nhst_/index.html
+glossary/english/objectivity/index.html
+glossary/english/ontology_artificial_intelligence_/index.html
+glossary/english/open_access/index.html
+glossary/english/open_code/index.html
+glossary/english/open_data/index.html
+glossary/english/open_educational_resources_oer_commons/index.html
+glossary/english/open_educational_resources_oers_/index.html
+glossary/english/open_licenses/index.html
+glossary/english/open_material/index.html
+glossary/english/open_peer_review/index.html
+glossary/english/open_scholarship/index.html
+glossary/english/open_scholarship_knowledge_base/index.html
+glossary/english/open_science/index.html
+glossary/english/open_science_framework/index.html
+glossary/english/open_source_software/index.html
+glossary/english/open_washing/index.html
+glossary/english/openneuro/index.html
+glossary/english/optional_stopping/index.html
+glossary/english/orcid_open_researcher_and_contributor_id_/index.html
+glossary/english/overlay_journal/index.html
+glossary/english/p_curve/index.html
+glossary/english/p_hacking/index.html
+glossary/english/p_value/index.html
+glossary/english/papermill/index.html
+glossary/english/paradata/index.html
+glossary/english/parking/index.html
+glossary/english/participatory_research/index.html
+glossary/english/patient_and_public_involvement_ppi_/index.html
+glossary/english/paywall/index.html
+glossary/english/pci_peer_community_in_/index.html
+glossary/english/pci_registered_reports/index.html
+glossary/english/plan_s/index.html
+glossary/english/positionality/index.html
+glossary/english/positionality_map/index.html
+glossary/english/post_hoc/index.html
+glossary/english/post_publication_peer_review/index.html
+glossary/english/posterior_distribution/index.html
+glossary/english/predatory_publishing/index.html
+glossary/english/prepare_guidelines/index.html
+glossary/english/preprint/index.html
+glossary/english/preregistration/index.html
+glossary/english/preregistration_pledge/index.html
+glossary/english/prior_distribution/index.html
+glossary/english/pro_peer_review_openness_initiative/index.html
+glossary/english/pseudonymisation/index.html
+glossary/english/pseudoreplication/index.html
+glossary/english/psychometric_meta_analysis/index.html
+glossary/english/public_trust_in_science/index.html
+glossary/english/publication_bias_file_drawer_problem_/index.html
+glossary/english/publish_or_perish/index.html
+glossary/english/pubpeer/index.html
+glossary/english/python/index.html
+glossary/english/qualitative_research/index.html
+glossary/english/quantitative_research/index.html
+glossary/english/questionable_measurement_practices_qmp_/index.html
+glossary/english/questionable_research_practices_or_questionable_reporting_practices_qrps_/index.html
+glossary/english/r/index.html
+glossary/english/red_teams/index.html
+glossary/english/reflexivity/index.html
+glossary/english/registered_report/index.html
+glossary/english/registry_of_research_data_repositories/index.html
+glossary/english/reliability/index.html
+glossary/english/repeatability/index.html
+glossary/english/replicability/index.html
+glossary/english/replication_markets/index.html
+glossary/english/replicats_project/index.html
+glossary/english/reporting_guideline/index.html
+glossary/english/repository/index.html
+glossary/english/reproducibilitea/index.html
+glossary/english/reproducibility/index.html
+glossary/english/reproducibility_crisis_aka_replicability_or_replication_crisis_/index.html
+glossary/english/reproducibility_network/index.html
+glossary/english/research_contribution_metric__p_/index.html
+glossary/english/research_cycle/index.html
+glossary/english/research_data_management/index.html
+glossary/english/research_integrity/index.html
+glossary/english/research_protocol/index.html
+glossary/english/research_workflow/index.html
+glossary/english/researcher_degrees_of_freedom/index.html
+glossary/english/responsible_research_and_innovation/index.html
+glossary/english/reverse_p_hacking/index.html
+glossary/english/riot_science_club/index.html
+glossary/english/robustness_analyses_/index.html
+glossary/english/salami_slicing/index.html
+glossary/english/scooping/index.html
+glossary/english/semantometrics/index.html
+glossary/english/sensitive_research/index.html
+glossary/english/sequence_determines_credit_approach_sdc_/index.html
+glossary/english/sherpa_romeo/index.html
+glossary/english/single_blind_peer_review/index.html
+glossary/english/slow_science/index.html
+glossary/english/social_class/index.html
+glossary/english/social_integration/index.html
+glossary/english/society_for_open_reliable_and_transparent_ecology_and_evolutionary_biology_sortee_/index.html
+glossary/english/society_for_the_improvement_of_psychological_science_sips_/index.html
+glossary/english/specification_curve_analysis/index.html
+glossary/english/statistical_assumptions/index.html
+glossary/english/statistical_power/index.html
+glossary/english/statistical_significance/index.html
+glossary/english/statistical_validity/index.html
+glossary/english/strange/index.html
+glossary/english/studyswap/index.html
+glossary/english/systematic_review/index.html
+glossary/english/tenzing/index.html
+glossary/english/the_troubling_trio/index.html
+glossary/english/theory/index.html
+glossary/english/theory_building/index.html
+glossary/english/transparency/index.html
+glossary/english/transparency_checklist/index.html
+glossary/english/triple_blind_peer_review/index.html
+glossary/english/trust_principles/index.html
+glossary/english/type_i_error/index.html
+glossary/english/type_ii_error/index.html
+glossary/english/type_m_error/index.html
+glossary/english/type_s_error/index.html
+glossary/english/under_representation/index.html
+glossary/english/universal_design_for_learning_udl_/index.html
+glossary/english/validity/index.html
+glossary/english/version_control/index.html
+glossary/english/webometrics/index.html
+glossary/english/z_curve/index.html
+glossary/english/zenodo/index.html
+glossary/epistemic_uncertainty/index.html
+glossary/epistemology/index.html
+glossary/equity/index.html
+glossary/equivalence_testing/index.html
+glossary/error_detection/index.html
+glossary/evidence_synthesis/index.html
+glossary/exploratory_data_analysis/index.html
+glossary/external_validity/index.html
+glossary/face_validity/index.html
+glossary/fair_principles/index.html
+glossary/feminist_psychology/index.html
+glossary/first_last_author_emphasis_norm_flae_/index.html
+glossary/forrt/index.html
+glossary/free_our_knowledge_platform/index.html
+glossary/gaming_the_system_/index.html
+glossary/garden_of_forking_paths/index.html
+glossary/general_data_protection_regulation_gdpr_/index.html
+glossary/generalizability/index.html
+glossary/german/a_priori_verteilung/index.html
+glossary/german/abstract_verzerrung/index.html
+glossary/german/ad_hominem_verzerrung/index.html
+glossary/german/affiliations_verzerrung/index.html
+glossary/german/aka_replicability_or_replication_crisis_reproduzierbarkeitskrise_auch_replizierbarkeitskrise_oder_replikationskrise/index.html
+glossary/german/akademischer_einfluss/index.html
+glossary/german/aleatorische_unsicherheit/index.html
+glossary/german/altmetrics/index.html
+glossary/german/amnesia/index.html
+glossary/german/analyses_robustheit_sanalysen/index.html
+glossary/german/analytische_flexibilitat/index.html
+glossary/german/anonymitat/index.html
+glossary/german/anreizsystem/index.html
+glossary/german/aquivalenztesten/index.html
+glossary/german/arrive_leitlinien/index.html
+glossary/german/artificial_intelligence_ontologie_in_der_kunstlichen_intelligenz/index.html
+glossary/german/artikelverarbeitungsgebuhr/index.html
+glossary/german/augenscheinvaliditat/index.html
+glossary/german/autor_innenschaft/index.html
+glossary/german/barrierefreiheit/index.html
+glossary/german/bayes_faktor/index.html
+glossary/german/bayes_sche_parameter_schatzung/index.html
+glossary/german/bayessche_inferenz/index.html
+glossary/german/beitrag/index.html
+glossary/german/berichtleitlinien/index.html
+glossary/german/bestatigungsverzerrung/index.html
+glossary/german/bezahlschranke/index.html
+glossary/german/bids_datenstruktur/index.html
+glossary/german/bizarre/index.html
+glossary/german/bropenscience/index.html
+glossary/german/burger_innenwissenschaft/index.html
+glossary/german/carking/index.html
+glossary/german/cc/index.html
+glossary/german/ckan/index.html
+glossary/german/coar_community_framework_for_good_practices_in_repositories/index.html
+glossary/german/cobidas/index.html
+glossary/german/code_uberprufung/index.html
+glossary/german/codebuch/index.html
+glossary/german/cog_beschrankungen_der_generalisierbarkeit/index.html
+glossary/german/collaborative_commentary_gegnerischer_kollaborativer_kommentar/index.html
+glossary/german/computational_rechenmodell/index.html
+glossary/german/cos/index.html
+glossary/german/credit/index.html
+glossary/german/crep/index.html
+glossary/german/crowdsourcing_forschung/index.html
+glossary/german/da_rt/index.html
+glossary/german/data_sharing/index.html
+glossary/german/datenvisualisierung/index.html
+glossary/german/dekolonialisierung/index.html
+glossary/german/demarkationskriterium/index.html
+glossary/german/die_dreisten_drei/index.html
+glossary/german/digital_object_identifier/index.html
+glossary/german/direkte_replikation/index.html
+glossary/german/diversity/index.html
+glossary/german/dmp_datenmanagementplan/index.html
+glossary/german/doppelblinde_begutachtung/index.html
+glossary/german/doppeltes_bewusstsein/index.html
+glossary/german/dora/index.html
+glossary/german/dreifach_blindes_peer_review/index.html
+glossary/german/economic_and_societal_impact/index.html
+glossary/german/ecrs_nachwuchswissenschaftler_innen/index.html
+glossary/german/einfachblinde_peer_begutachtung/index.html
+glossary/german/epistemiologie__erkenntnistheorie/index.html
+glossary/german/epistemische_unsicherheit/index.html
+glossary/german/evidenzsynthese/index.html
+glossary/german/explorative_datenanalyse/index.html
+glossary/german/externe_validitat/index.html
+glossary/german/fair_prinzipien/index.html
+glossary/german/fehlererfassung/index.html
+glossary/german/feministische_psychologie/index.html
+glossary/german/file_drawer_problem_publikationsverzerrung_aktenschubladenproblem/index.html
+glossary/german/flae_norm_der_betonung_der_erst_und_letztautor_innenschaft/index.html
+glossary/german/forrt/index.html
+glossary/german/forschungs_arbeitsablauf/index.html
+glossary/german/forschungsdatenmanagement/index.html
+glossary/german/forschungsintegritat/index.html
+glossary/german/forschungsprotokoll/index.html
+glossary/german/forschungszyklus/index.html
+glossary/german/free_our_knowledge_platform/index.html
+glossary/german/freiheitsgrade_von_forschenden/index.html
+glossary/german/garten_der_weggabelungen/index.html
+glossary/german/gdpr_dt_datenschutzgrundverordnung_dsgvo/index.html
+glossary/german/gegnerische_kollaboration/index.html
+glossary/german/gemeinschaftsprojekte/index.html
+glossary/german/generalisierbarkeit/index.html
+glossary/german/git/index.html
+glossary/german/glaubhaftigkeitsrevolution/index.html
+glossary/german/gleichstellung/index.html
+glossary/german/goodharts_gesetz/index.html
+glossary/german/gpower/index.html
+glossary/german/h_index_hirsch_index/index.html
+glossary/german/hackathon/index.html
+glossary/german/handbuch/index.html
+glossary/german/harking/index.html
+glossary/german/hilfshypothese/index.html
+glossary/german/hypothese/index.html
+glossary/german/i10_index/index.html
+glossary/german/ideologische_verzerrung/index.html
+glossary/german/im_nachhinein/index.html
+glossary/german/in_science_matthew_effekt_in_der_wissenschaft/index.html
+glossary/german/index.html
+glossary/german/index.xml
+glossary/german/induktion/index.html
+glossary/german/inhaltsvaliditat/index.html
+glossary/german/inklusion_inklusivitat/index.html
+glossary/german/interaktionsfehlschluss/index.html
+glossary/german/interessenkonflikt/index.html
+glossary/german/interne_validitat/index.html
+glossary/german/intersektionalitat/index.html
+glossary/german/jabref/index.html
+glossary/german/jamovi/index.html
+glossary/german/jasp/index.html
+glossary/german/json_file/index.html
+glossary/german/klammer_interviews/index.html
+glossary/german/knowledge_acquisition/index.html
+glossary/german/ko_produktion/index.html
+glossary/german/kommunalitat/index.html
+glossary/german/konfirmatorische_analysen/index.html
+glossary/german/konsortium_autor_innenschaft/index.html
+glossary/german/konstruktvaliditat/index.html
+glossary/german/konzeptionelle_replikation/index.html
+glossary/german/korrigendum/index.html
+glossary/german/kriteriumsvaliditat/index.html
+glossary/german/kulturelle_taxierung/index.html
+glossary/german/kumulative_wissenschaft/index.html
+glossary/german/langsame_forschung/index.html
+glossary/german/likelihood_funktion/index.html
+glossary/german/likelihood_prinzip/index.html
+glossary/german/literaturzusammenfassung/index.html
+glossary/german/manel/index.html
+glossary/german/many_authors/index.html
+glossary/german/many_labs/index.html
+glossary/german/meta_analyse/index.html
+glossary/german/meta_wissenschaft_oder_meta_forschung/index.html
+glossary/german/metadaten/index.html
+glossary/german/moocs/index.html
+glossary/german/moops/index.html
+glossary/german/multi_analytiker_innen_studien/index.html
+glossary/german/multiplizitat/index.html
+glossary/german/multiversumsanalyse/index.html
+glossary/german/netanos/index.html
+glossary/german/nhst_nullhypothesen_signifikanztestung/index.html
+glossary/german/niro_sr/index.html
+glossary/german/objektivitat/index.html
+glossary/german/oer/index.html
+glossary/german/oers_offene_bildungsressourcen/index.html
+glossary/german/offene_begutachtung/index.html
+glossary/german/offene_daten/index.html
+glossary/german/offene_forschung/index.html
+glossary/german/offene_lizenzen/index.html
+glossary/german/offene_materialien/index.html
+glossary/german/offener_code/index.html
+glossary/german/offentliches_vertrauen_in_die_wissenschaft/index.html
+glossary/german/open_access/index.html
+glossary/german/open_researcher_and_contributor_id/index.html
+glossary/german/open_scholarship/index.html
+glossary/german/open_scholarship_knowledge_base/index.html
+glossary/german/open_science_framework/index.html
+glossary/german/open_science_open_science_abzeichen/index.html
+glossary/german/open_washing/index.html
+glossary/german/openneuro/index.html
+glossary/german/optionales_stoppen/index.html
+glossary/german/or_guest_authorship_geschenkte_autor_innenschaft__gastautor_innenschaft/index.html
+glossary/german/overlay_zeitschrift/index.html
+glossary/german/p/index.html
+glossary/german/p_hacking/index.html
+glossary/german/p_kurve/index.html
+glossary/german/p_wert/index.html
+glossary/german/papierfabrik/index.html
+glossary/german/paradaten/index.html
+glossary/german/parking/index.html
+glossary/german/partizipative_forschung/index.html
+glossary/german/pci_registered_reports/index.html
+glossary/german/peer_community_in/index.html
+glossary/german/peer_review_nach_der_veroffentlichung/index.html
+glossary/german/peer_review_openness_initiative_pro_initiative/index.html
+glossary/german/philosophy/index.html
+glossary/german/plan_s/index.html
+glossary/german/positionalitat/index.html
+glossary/german/positionalitatskarte/index.html
+glossary/german/posterior_distribution/index.html
+glossary/german/ppi_einbindung_von_patient_innen_und_offentlichkeit/index.html
+glossary/german/praregistrierung/index.html
+glossary/german/praregistrierungs_versprechen/index.html
+glossary/german/predatory_verlagswesen/index.html
+glossary/german/prepare_leitlinien/index.html
+glossary/german/problem_mehrdeutiger_namen/index.html
+glossary/german/pseudonymisierung/index.html
+glossary/german/pseudoreplikation/index.html
+glossary/german/psychometrische_metaanalyse/index.html
+glossary/german/publizieren_oder_untergehen/index.html
+glossary/german/pubpeer/index.html
+glossary/german/python/index.html
+glossary/german/qmp_fragwurdige_forschungspraktiken/index.html
+glossary/german/qrps_fragwurdige_forschungs_oder_veroffentlichungspraktiken/index.html
+glossary/german/qualitative_forschung/index.html
+glossary/german/quantitative_forschung_translated_reviewed/index.html
+glossary/german/r/index.html
+glossary/german/rechnerische_reproduzierbarkeit/index.html
+glossary/german/reflexivitat/index.html
+glossary/german/registered_report/index.html
+glossary/german/registry_of_research_data_repositories/index.html
+glossary/german/reliabilitat/index.html
+glossary/german/replicats_project/index.html
+glossary/german/replikabilitat/index.html
+glossary/german/replikationsmarkte/index.html
+glossary/german/repositorium/index.html
+glossary/german/reproducibilitea/index.html
+glossary/german/reproduzierbarkeit/index.html
+glossary/german/reproduzierbarkeitsnetzwerk/index.html
+glossary/german/reverse_p_hacking/index.html
+glossary/german/riot_science_club/index.html
+glossary/german/rote_teams/index.html
+glossary/german/salamischneiden/index.html
+glossary/german/schopferische_zerstorung_als_herangehensweise_an_replikationen/index.html
+glossary/german/sdc/index.html
+glossary/german/semantometrie/index.html
+glossary/german/sensitive_forschung/index.html
+glossary/german/sherpa_romeo/index.html
+glossary/german/sips/index.html
+glossary/german/software_mit_offenem_quellcode/index.html
+glossary/german/sortee/index.html
+glossary/german/soziale_integration/index.html
+glossary/german/soziale_schicht/index.html
+glossary/german/sperrfrist/index.html
+glossary/german/spezifikationskurvenanalyse/index.html
+glossary/german/statistical_statistisches_modell/index.html
+glossary/german/statistische_signifikanz/index.html
+glossary/german/statistische_teststarke/index.html
+glossary/german/statistische_validitat/index.html
+glossary/german/statistische_vorannahmen/index.html
+glossary/german/strange/index.html
+glossary/german/studyswap/index.html
+glossary/german/systematisches_review/index.html
+glossary/german/tenzing/index.html
+glossary/german/the_system_das_system_uberlisten/index.html
+glossary/german/theorie/index.html
+glossary/german/theoriebildung/index.html
+glossary/german/to_open_scholarship_bottom_up_ansatz/index.html
+glossary/german/transparenz/index.html
+glossary/german/transparenz_checkliste/index.html
+glossary/german/trim_and_fill_method/index.html
+glossary/german/trust_prinzipien/index.html
+glossary/german/typ_i_fehler/index.html
+glossary/german/typ_ii_fehler/index.html
+glossary/german/typ_m_fehler/index.html
+glossary/german/typ_s_fehler/index.html
+glossary/german/udl/index.html
+glossary/german/untergrabung/index.html
+glossary/german/unterreprasentation/index.html
+glossary/german/validitat/index.html
+glossary/german/verantwortungsvolle_forschung_und_innovation/index.html
+glossary/german/versionskontrolle/index.html
+glossary/german/versteckte_moderatoren/index.html
+glossary/german/verzahnung/index.html
+glossary/german/vorabdruck/index.html
+glossary/german/webometrie/index.html
+glossary/german/weird/index.html
+glossary/german/wiederholbarkeit/index.html
+glossary/german/z_kurve/index.html
+glossary/german/zeitschriften_impact_faktor/index.html
+glossary/german/zenodo/index.html
+glossary/german/zitations_diversitats_erklarung/index.html
+glossary/german/zitations_verzerrung/index.html
+glossary/gift_or_guest_authorship/index.html
+glossary/git/index.html
+glossary/goodhart_s_law/index.html
+glossary/gpower/index.html
+glossary/h_index/index.html
+glossary/hackathon/index.html
+glossary/harking/index.html
+glossary/hidden_moderators/index.html
+glossary/hypothesis/index.html
+glossary/i10_index/index.html
+glossary/ideological_bias/index.html
+glossary/incentive_structure/index.html
+glossary/inclusion/index.html
+glossary/index.html
+glossary/induction/index.html
+glossary/interaction_fallacy/index.html
+glossary/interlocking/index.html
+glossary/internal_validity/index.html
+glossary/intersectionality/index.html
+glossary/jabref/index.html
+glossary/jamovi/index.html
+glossary/jasp/index.html
+glossary/journal_impact_factor_/index.html
+glossary/json_file/index.html
+glossary/knowledge_acquisition/index.html
+glossary/likelihood_function/index.html
+glossary/likelihood_principle/index.html
+glossary/literature_review/index.html
+glossary/manel/index.html
+glossary/many_authors/index.html
+glossary/many_labs/index.html
+glossary/massive_open_online_courses_moocs_/index.html
+glossary/massively_open_online_papers_moops_/index.html
+glossary/matthew_effect_in_science_/index.html
+glossary/meta_analysis/index.html
+glossary/meta_science_or_meta_research/index.html
+glossary/metadata/index.html
+glossary/missing_references.txt
+glossary/model_computational_/index.html
+glossary/model_philosophy_/index.html
+glossary/model_statistical_/index.html
+glossary/multi_analyst_studies/index.html
+glossary/multiplicity/index.html
+glossary/multiverse_analysis/index.html
+glossary/name_ambiguity_problem/index.html
+glossary/named_entity_based_text_anonymization_for_open_science_netanos_/index.html
+glossary/non_intervention_reproducible_and_open_systematic_reviews_niro_sr_/index.html
+glossary/null_hypothesis_significance_testing_nhst_/index.html
+glossary/objectivity/index.html
+glossary/ontology_artificial_intelligence_/index.html
+glossary/open_access/index.html
+glossary/open_code/index.html
+glossary/open_data/index.html
+glossary/open_educational_resources_oer_commons/index.html
+glossary/open_educational_resources_oers_/index.html
+glossary/open_licenses/index.html
+glossary/open_material/index.html
+glossary/open_peer_review/index.html
+glossary/open_scholarship/index.html
+glossary/open_scholarship_knowledge_base/index.html
+glossary/open_science/index.html
+glossary/open_science_framework/index.html
+glossary/open_source_software/index.html
+glossary/open_washing/index.html
+glossary/openneuro/index.html
+glossary/optional_stopping/index.html
+glossary/orcid_open_researcher_and_contributor_id_/index.html
+glossary/overlay_journal/index.html
+glossary/p_curve/index.html
+glossary/p_hacking/index.html
+glossary/p_value/index.html
+glossary/papermill/index.html
+glossary/paradata/index.html
+glossary/parking/index.html
+glossary/participatory_research/index.html
+glossary/patient_and_public_involvement_ppi_/index.html
+glossary/paywall/index.html
+glossary/pci_peer_community_in_/index.html
+glossary/pci_registered_reports/index.html
+glossary/plan_s/index.html
+glossary/positionality/index.html
+glossary/positionality_map/index.html
+glossary/post_hoc/index.html
+glossary/post_publication_peer_review/index.html
+glossary/posterior_distribution/index.html
+glossary/predatory_publishing/index.html
+glossary/prepare_guidelines/index.html
+glossary/preprint/index.html
+glossary/preregistration/index.html
+glossary/preregistration_pledge/index.html
+glossary/prior_distribution/index.html
+glossary/pro_peer_review_openness_initiative/index.html
+glossary/pseudonymisation/index.html
+glossary/pseudoreplication/index.html
+glossary/psychometric_meta_analysis/index.html
+glossary/public_trust_in_science/index.html
+glossary/publication_bias_file_drawer_problem_/index.html
+glossary/publish_or_perish/index.html
+glossary/pubpeer/index.html
+glossary/python/index.html
+glossary/qualitative_research/index.html
+glossary/quantitative_research/index.html
+glossary/questionable_measurement_practices_qmp_/index.html
+glossary/questionable_research_practices_or_questionable_reporting_practices_qrps_/index.html
+glossary/r/index.html
+glossary/red_teams/index.html
+glossary/references/index.html
+glossary/reflexivity/index.html
+glossary/registered_report/index.html
+glossary/registry_of_research_data_repositories/index.html
+glossary/reliability/index.html
+glossary/repeatability/index.html
+glossary/replicability/index.html
+glossary/replication_markets/index.html
+glossary/replicats_project/index.html
+glossary/reporting_guideline/index.html
+glossary/repository/index.html
+glossary/reproducibilitea/index.html
+glossary/reproducibility/index.html
+glossary/reproducibility_crisis_aka_replicability_or_replication_crisis_/index.html
+glossary/reproducibility_network/index.html
+glossary/research_contribution_metric__p_/index.html
+glossary/research_cycle/index.html
+glossary/research_data_management/index.html
+glossary/research_integrity/index.html
+glossary/research_protocol/index.html
+glossary/research_workflow/index.html
+glossary/researcher_degrees_of_freedom/index.html
+glossary/responsible_research_and_innovation/index.html
+glossary/reverse_p_hacking/index.html
+glossary/riot_science_club/index.html
+glossary/robustness_analyses_/index.html
+glossary/salami_slicing/index.html
+glossary/scooping/index.html
+glossary/semantometrics/index.html
+glossary/sensitive_research/index.html
+glossary/sequence_determines_credit_approach_sdc_/index.html
+glossary/sherpa_romeo/index.html
+glossary/single_blind_peer_review/index.html
+glossary/slow_science/index.html
+glossary/social_class/index.html
+glossary/social_integration/index.html
+glossary/society_for_open_reliable_and_transparent_ecology_and_evolutionary_biology_sortee_/index.html
+glossary/society_for_the_improvement_of_psychological_science_sips_/index.html
+glossary/specification_curve_analysis/index.html
+glossary/statistical_assumptions/index.html
+glossary/statistical_power/index.html
+glossary/statistical_significance/index.html
+glossary/statistical_validity/index.html
+glossary/strange/index.html
+glossary/studyswap/index.html
+glossary/systematic_review/index.html
+glossary/tenzing/index.html
+glossary/the_troubling_trio/index.html
+glossary/theory/index.html
+glossary/theory_building/index.html
+glossary/transparency/index.html
+glossary/transparency_checklist/index.html
+glossary/triple_blind_peer_review/index.html
+glossary/trust_principles/index.html
+glossary/turkish/acık_akademi/index.html
+glossary/turkish/acık_akademi_bilgi_tabanı_oskb_open_scholarship_knowledge_base_/index.html
+glossary/turkish/acık_aklama/index.html
+glossary/turkish/acık_arastırmacı_ve_katkı_saglayıcı_kimligi_orcid_open_researcher_and_contributor_id_/index.html
+glossary/turkish/acık_bilim/index.html
+glossary/turkish/acık_bilim_icin_adlandırılmıs_varlık_tabanlı_metin_anonimlestirme_netanos_named_entity_based_text_anonymization_for_open_science_/index.html
+glossary/turkish/acık_bilim_merkezi/index.html
+glossary/turkish/acık_bilim_platformu_osf_open_science_framework_/index.html
+glossary/turkish/acık_egitim_kaynakları_platformu/index.html
+glossary/turkish/acık_erisim/index.html
+glossary/turkish/acık_guvenilir_ve_seffaf_ekoloji_ve_evrimsel_biyoloji_dernegi/index.html
+glossary/turkish/acık_hakem_degerlendirmesi/index.html
+glossary/turkish/acık_kaynaklı_yazılım/index.html
+glossary/turkish/acık_kod/index.html
+glossary/turkish/acık_lisanslar/index.html
+glossary/turkish/acık_materyal/index.html
+glossary/turkish/acık_veri/index.html
+glossary/turkish/ad_hominem_safsatası/index.html
+glossary/turkish/agacık_bilim/index.html
+glossary/turkish/akademik_etki/index.html
+glossary/turkish/akran_toplulugu_icinde_degerlendirme_sistemi_pci_peer_community_in_/index.html
+glossary/turkish/aleatorik_seckisiz_belirsizlik/index.html
+glossary/turkish/altmetriler/index.html
+glossary/turkish/ambargo_suresi/index.html
+glossary/turkish/amnesia/index.html
+glossary/turkish/analitik_esneklik/index.html
+glossary/turkish/anonimlik/index.html
+glossary/turkish/arastırma_dongusu/index.html
+glossary/turkish/arastırma_is_akısı/index.html
+glossary/turkish/arastırma_protokolu/index.html
+glossary/turkish/arastırma_veri_deposu_kayıtları/index.html
+glossary/turkish/arastırma_verisi_yonetimi_avy_/index.html
+glossary/turkish/arastırmacının_serbestlik_derecesi/index.html
+glossary/turkish/arastırmada_etik_butunluk/index.html
+glossary/turkish/arrive_kılavuzu/index.html
+glossary/turkish/asagıdan_yukarıya_yaklasım_acık_akademiye_yonelik_/index.html
+glossary/turkish/atıf_cesitliligi_beyanı/index.html
+glossary/turkish/atıf_yanlılıgı/index.html
+glossary/turkish/baglantı_yanlılıgı/index.html
+glossary/turkish/bayes_faktoru/index.html
+glossary/turkish/bayesyen_cıkarım/index.html
+glossary/turkish/bayesyen_parametre_tahmini/index.html
+glossary/turkish/bela_uclu/index.html
+glossary/turkish/bids_veri_yapısı/index.html
+glossary/turkish/bilgi_edinme/index.html
+glossary/turkish/bilgimizi_ozgurlestirelim_platformu/index.html
+glossary/turkish/bilime_duyulan_toplumsal_guven/index.html
+glossary/turkish/bilimsel_katkı_olcutu_p_/index.html
+glossary/turkish/bizarre/index.html
+glossary/turkish/carking/index.html
+glossary/turkish/cesitlilik/index.html
+glossary/turkish/cift_bilinclilik/index.html
+glossary/turkish/cift_kor_hakem_degerlendirmesi/index.html
+glossary/turkish/coar_repolardaki_iyi_uygulamalar_icin_topluluk_platformu/index.html
+glossary/turkish/cok_yazarlı/index.html
+glossary/turkish/coklu_analist_calısmaları/index.html
+glossary/turkish/coklu_evren_analizi/index.html
+glossary/turkish/coklu_laboratuvarlı/index.html
+glossary/turkish/cokluluk/index.html
+glossary/turkish/creative_commons_cc_lisansı/index.html
+glossary/turkish/credit_katkı_rolleri_taksonomisi_/index.html
+glossary/turkish/cıkar_catısması/index.html
+glossary/turkish/dekolonizasyon/index.html
+glossary/turkish/dergi_etki_faktoru/index.html
+glossary/turkish/dogrudan_replikasyon/index.html
+glossary/turkish/dogrulama_yanlılıgı/index.html
+glossary/turkish/dogrulayıcı_analizler/index.html
+glossary/turkish/doi_dijital_nesne_tanımlayıcısı_/index.html
+glossary/turkish/dora/index.html
+glossary/turkish/dusmanca_is_birligi/index.html
+glossary/turkish/dusmanca_is_birlikci_yorumlama/index.html
+glossary/turkish/dusunumsellik/index.html
+glossary/turkish/duzeltme/index.html
+glossary/turkish/dıs_gecerlilik/index.html
+glossary/turkish/ekonomik_ve_toplumsal_etki/index.html
+glossary/turkish/epistemik_belirsizlik/index.html
+glossary/turkish/epistemoloji/index.html
+glossary/turkish/erisilebilirlik/index.html
+glossary/turkish/erken_kariyer_arastırmacıları_eka_/index.html
+glossary/turkish/esdegerlik_testi/index.html
+glossary/turkish/etkilesim_yanılgısı/index.html
+glossary/turkish/fair_ilkeleri/index.html
+glossary/turkish/feminist_psikoloji/index.html
+glossary/turkish/forrt/index.html
+glossary/turkish/g_power/index.html
+glossary/turkish/gecerlilik/index.html
+glossary/turkish/genel_veri_koruma_tuzugu_gdpr_/index.html
+glossary/turkish/genellenebilirlik/index.html
+glossary/turkish/genellige_iliskin_kısıtlamalar/index.html
+glossary/turkish/git/index.html
+glossary/turkish/gizli_moderatorler/index.html
+glossary/turkish/goodhart_yasası/index.html
+glossary/turkish/guvenilirlik/index.html
+glossary/turkish/h_indeksi/index.html
+glossary/turkish/hackathon/index.html
+glossary/turkish/hakem_degerlendirmesi_seffaflıgı_girisimi_pro_girisimi_/index.html
+glossary/turkish/hakkaniyet/index.html
+glossary/turkish/harking/index.html
+glossary/turkish/hassas_arastırma/index.html
+glossary/turkish/hasta_ve_topluluk_katılımı_ppi_patient_and_public_involvement_/index.html
+glossary/turkish/hata_tespiti/index.html
+glossary/turkish/hediye_veya_misafir_yazarlık/index.html
+glossary/turkish/hesaplamalı_yeniden_uretilebilirlik/index.html
+glossary/turkish/hipotez/index.html
+glossary/turkish/i_10_indeksi/index.html
+glossary/turkish/ic_gecerlilik/index.html
+glossary/turkish/ic_icelik_interlocking_/index.html
+glossary/turkish/icerik_gecerliligi/index.html
+glossary/turkish/ideolojik_yanlılık/index.html
+glossary/turkish/ilk_son_yazar_vurgusu_normu/index.html
+glossary/turkish/index.html
+glossary/turkish/index.xml
+glossary/turkish/is_birligine_dayalı_replikasyon_ve_egitim_projesi_crep_/index.html
+glossary/turkish/isim_belirsizligi_sorunu/index.html
+glossary/turkish/istatistiksel_anlamlılık/index.html
+glossary/turkish/istatistiksel_gecerlilik/index.html
+glossary/turkish/istatistiksel_guc/index.html
+glossary/turkish/istatistiksel_varsayımlar/index.html
+glossary/turkish/itibar_devrimi/index.html
+glossary/turkish/jabref/index.html
+glossary/turkish/jamovi/index.html
+glossary/turkish/jasp/index.html
+glossary/turkish/json_dosyası/index.html
+glossary/turkish/kanıt_sentezi/index.html
+glossary/turkish/kapsamlı_bilgi_arsivi_agı/index.html
+glossary/turkish/kapsayıcılık/index.html
+glossary/turkish/katılımlı_arastırma/index.html
+glossary/turkish/kavramsal_replikasyon/index.html
+glossary/turkish/kayıtlı_rapor/index.html
+glossary/turkish/kesifsel_veri_analizi/index.html
+glossary/turkish/kesisimsellik/index.html
+glossary/turkish/kitle_kaynaklı_arastırma/index.html
+glossary/turkish/kitlesel_acık_cevrim_ici_dersler_massive_open_online_courses_moocs_/index.html
+glossary/turkish/kitlesel_acık_cevrim_ici_makaleler_moops_massively_open_online_papers_/index.html
+glossary/turkish/kod_degerlendirmesi/index.html
+glossary/turkish/kod_kitabı/index.html
+glossary/turkish/kompendiyum/index.html
+glossary/turkish/komunalite/index.html
+glossary/turkish/konsorsiyum_yazarlıgı/index.html
+glossary/turkish/konumsallık/index.html
+glossary/turkish/konumsallık_haritası/index.html
+glossary/turkish/kriter_gecerliligi/index.html
+glossary/turkish/kulturel_vergilendirme/index.html
+glossary/turkish/kumulatif_bilim/index.html
+glossary/turkish/kızıl_ekipler/index.html
+glossary/turkish/literatur_taraması/index.html
+glossary/turkish/makale_fabrikası/index.html
+glossary/turkish/makale_islem_ucreti_apc_/index.html
+glossary/turkish/manel/index.html
+glossary/turkish/matthew_etkisi_bilimde_/index.html
+glossary/turkish/meta_analiz/index.html
+glossary/turkish/meta_bilim_ya_da_meta_arastırma/index.html
+glossary/turkish/metaveri/index.html
+glossary/turkish/model_felsefe_/index.html
+glossary/turkish/mudahalesiz_yeniden_uretilebilir_ve_acık_sistematik_derlemeler_niro_sr_non_intervention_reproducible_and_open_systematic_reviews_/index.html
+glossary/turkish/nesnellik/index.html
+glossary/turkish/nicel_arastırma/index.html
+glossary/turkish/nitel_arastırma/index.html
+glossary/turkish/odeme_duvarı_paywall_/index.html
+glossary/turkish/ogrenmede_evrensel_tasarım_oet_/index.html
+glossary/turkish/olasılık_fonksiyonu/index.html
+glossary/turkish/olasılık_ilkesi/index.html
+glossary/turkish/on_baskı/index.html
+glossary/turkish/on_baskı_tabanlı_dergi/index.html
+glossary/turkish/on_kayıt/index.html
+glossary/turkish/on_kayıt_taahhudu/index.html
+glossary/turkish/onceligi_kapma/index.html
+glossary/turkish/onsel_dagılım/index.html
+glossary/turkish/ontoloji_yapay_zeka_/index.html
+glossary/turkish/openneuro/index.html
+glossary/turkish/opsiyonel_durdurma/index.html
+glossary/turkish/ortak_uretim/index.html
+glossary/turkish/ozet_yanlılıgı/index.html
+glossary/turkish/p_degeri/index.html
+glossary/turkish/p_egrisi/index.html
+glossary/turkish/p_hackleme/index.html
+glossary/turkish/paradata/index.html
+glossary/turkish/paranteze_alma_epoche_gorusmeleri/index.html
+glossary/turkish/parking/index.html
+glossary/turkish/pci_kayıtlı_raporlar/index.html
+glossary/turkish/plan_s/index.html
+glossary/turkish/post_hoc/index.html
+glossary/turkish/prepare_rehberi/index.html
+glossary/turkish/psikoloji_biliminin_gelistirilmesi_dernegi/index.html
+glossary/turkish/psikometrik_meta_analiz/index.html
+glossary/turkish/psodonimlestirme/index.html
+glossary/turkish/psodoreplikasyon/index.html
+glossary/turkish/pubpeer/index.html
+glossary/turkish/python/index.html
+glossary/turkish/r/index.html
+glossary/turkish/raporlama_kılavuzu/index.html
+glossary/turkish/replikasyonda_yaratıcı_yıkım_yaklasımı/index.html
+glossary/turkish/repo/index.html
+glossary/turkish/reproducibilitea/index.html
+glossary/turkish/riot_bilim_kulubu/index.html
+glossary/turkish/rozetler_acık_bilim_/index.html
+glossary/turkish/saglamlık_analizleri_/index.html
+glossary/turkish/seffaflık/index.html
+glossary/turkish/seffaflık_kontrol_listesi/index.html
+glossary/turkish/semantometriler/index.html
+glossary/turkish/sistematik_derleme/index.html
+glossary/turkish/sistemi_oyuna_getirme/index.html
+glossary/turkish/sonsal_dagılım/index.html
+glossary/turkish/sorumlu_arastırma_ve_inovasyon/index.html
+glossary/turkish/sosyal_entegrasyon/index.html
+glossary/turkish/sosyal_sınıf/index.html
+glossary/turkish/spesifikasyon_egrisi_analizi/index.html
+glossary/turkish/strange/index.html
+glossary/turkish/studyswap/index.html
+glossary/turkish/supheli_arastırma_uygulamaları_veya_supheli_raporlama_uygulamaları/index.html
+glossary/turkish/supheli_olcme_uygulamaları/index.html
+glossary/turkish/sıfır_hipotez_anlamlılık_testi_nhst_null_hypothesis_significance_testing_/index.html
+glossary/turkish/sınırlandırma_olcutu/index.html
+glossary/turkish/tek_kor_hakemlik/index.html
+glossary/turkish/tekrarlanabilirlik/index.html
+glossary/turkish/tenzing/index.html
+glossary/turkish/teori/index.html
+glossary/turkish/teori_insası/index.html
+glossary/turkish/tersine_p_hackleme/index.html
+glossary/turkish/tesvik_yapısı/index.html
+glossary/turkish/tip_i_hata/index.html
+glossary/turkish/tip_ii_hata/index.html
+glossary/turkish/tip_m_hata/index.html
+glossary/turkish/tip_s_hata/index.html
+glossary/turkish/topluluk_projeleri/index.html
+glossary/turkish/trust_ilkeleri/index.html
+glossary/turkish/tumevarım/index.html
+glossary/turkish/uclu_kor_hakemlik/index.html
+glossary/turkish/veri_analizi_ve_paylasımında_en_iyi_uygulamalar_komitesi/index.html
+glossary/turkish/veri_dilimleme/index.html
+glossary/turkish/veri_gorsellestirme/index.html
+glossary/turkish/veri_paylasımı/index.html
+glossary/turkish/veri_yonetim_planı_dmp_/index.html
+glossary/turkish/veriye_erisim_ve_arastırma_seffaflıgı_da_rt_/index.html
+glossary/turkish/versiyon_kontrolu/index.html
+glossary/turkish/webometriler/index.html
+glossary/turkish/yagmacı_yayın/index.html
+glossary/turkish/yapı_gecerliligi/index.html
+glossary/turkish/yardımcı_hipotez/index.html
+glossary/turkish/yavas_bilim/index.html
+glossary/turkish/yayımla_ya_da_yok_ol/index.html
+glossary/turkish/yayın_sonrası_hakem_degerlendirmesi/index.html
+glossary/turkish/yayın_yanlılıgı_dosya_cekmecesi_problemi_/index.html
+glossary/turkish/yazar_sırası_krediyi_belirler_yaklasımı/index.html
+glossary/turkish/yazarlık/index.html
+glossary/turkish/yeniden_uretilebilirlik/index.html
+glossary/turkish/yeniden_uretilebilirlik_agı/index.html
+glossary/turkish/yeniden_uretilebilirlik_krizi_diger_adıyla_tekrarlanabilirlik_veya_tekrarlama_krizi_/index.html
+glossary/turkish/yetersiz_temsil/index.html
+glossary/turkish/yinelenebilirlik/index.html
+glossary/turkish/yolları_catallanan_bahce/index.html
+glossary/turkish/yurttas_bilimi/index.html
+glossary/turkish/yuzey_gecerliligi/index.html
+glossary/turkish/z_egrisi/index.html
+glossary/turkish/zenodo/index.html
+glossary/type_i_error/index.html
+glossary/type_ii_error/index.html
+glossary/type_m_error/index.html
+glossary/type_s_error/index.html
+glossary/under_representation/index.html
+glossary/universal_design_for_learning_udl_/index.html
+glossary/validity/index.html
+glossary/version_control/index.html
+glossary/webometrics/index.html
+glossary/z_curve/index.html
+glossary/zenodo/index.html
+home/7-newsletter.md.old
+images/icon_hu.webp
+images/icon_hu.webp
+images/icon_hu.webp
+images/logo.svg
+img/7steps.webp
+img/Awards.webp
+img/FORRT Badge - Color - v4.webp
+img/FORRT.svg
+img/FORRT_banner.svg
+img/FORRTbanner.webp
+img/Garciaetal2020.webp
+img/High5.webp
+img/Partnerships.webp
+img/Partnerships_v2.webp
+img/Partnerships_v3.webp
+img/SS_FORRT_OSSC19.webp
+img/SS_OS_Day_Goethe.webp
+img/Team.webp
+img/ape.webp
+img/avatar_fem.webp
+img/avatar_fem1.webp
+img/avatar_fem2.webp
+img/avatar_male.webp
+img/avatar_male2.webp
+img/boards.webp
+img/book_dipl.webp
+img/chat.webp
+img/citation-politics-toolkit.webp
+img/colorwheel.webp
+img/compose.webp
+img/document.webp
+img/forrt-share.png
+img/forward_unesco_sdgs/10.webp
+img/forward_unesco_sdgs/16.webp
+img/forward_unesco_sdgs/17.webp
+img/forward_unesco_sdgs/4.webp
+img/forward_unesco_sdgs/5.webp
+img/headers/FORRT_banner.svg
+img/headers/bubbles-wide.webp
+img/headers/orgp.webp
+img/hero-academic.webp
+img/image.webp
+img/just_os_icon.webp
+img/licenses/by-nc-nd.svg
+img/licenses/by-nc-sa.svg
+img/licenses/by-nc.svg
+img/licenses/by-sa.svg
+img/licenses/cc-zero.svg
+img/licenses/cc_by.svg
+img/megaphone.webp
+img/nowherelab-logo.png
+img/partner.webp
+img/teacher_emc2.webp
+img/team/brain-puzzle.svg
+img/team/cohesion.svg
+img/team/database.svg
+img/team/enpass.svg
+img/team/ethics.svg
+img/team/just_os_chatbot_team/flavio-azevedo.webp
+img/team/just_os_chatbot_team/just-os-mascot.webp
+img/team/just_os_chatbot_team/lukas-wallrich.webp
+img/team/just_os_chatbot_team/madelief-van-der-velden.webp
+img/team/just_os_chatbot_team/michiel-van-der-ree.webp
+img/team/just_os_chatbot_team/nina-schwarzbach.webp
+img/team/just_os_chatbot_team/rink-hoekstra.webp
+img/team/just_os_chatbot_team/robin-hoekstra.webp
+img/team/just_os_chatbot_team/vera-heininga.webp
+img/team/manuscript.svg
+img/team/mentorship.svg
+img/team/outreach.svg
+img/team/pedagogies.svg
+img/team/redux.svg
+img/team/selfassessment.svg
+img/team/team-ambassador.svg
+img/team/team-ideas.svg
+img/team/team-summaries.svg
+img/team/website.svg
+img/teamwork.webp
+img/unesco_recognition_h.webp
+img/unesco_recognition_v.webp
+img/youtubeicon.webp
+impact/impacts-map.webp
+impact/index.html
+imprint/index.html
+index.html
+index.json
+index.xml
+js/academic.min.FINGERPRINT.js
+js/adopting-feedback.js
+js/clusters-page.js
+js/contributor-filter.js
+js/featured-resources.js
+js/glossary-feedback.js
+js/js-confetti.browser.js
+js/just-os-chat.js
+js/load-theme.js
+js/search.js
+js/tag-browser.js
+js/vendor/reveal.js/plugin/notes/notes.html
+js/vendor/reveal.js/plugin/notes/notes.js
+just_os_chatbot/index.html
+lesson-plans/LessonPlans.webp
+lesson-plans/LessonPlans1.docx
+lesson-plans/LessonPlans1.pdf
+lesson-plans/LessonPlans2.pdf
+lesson-plans/LessonPlansTemplate.webp
+lesson-plans/index.html
+lib/dflip/css/dflip.min.css
+lib/dflip/css/themify-icons.min.css
+lib/dflip/fonts/themify.eot
+lib/dflip/fonts/themify.svg
+lib/dflip/fonts/themify.ttf
+lib/dflip/fonts/themify.woff
+lib/dflip/images/chrome-extension.png
+lib/dflip/images/get-it-from-MS.png
+lib/dflip/images/loading.gif
+lib/dflip/images/pdfjs/annotation-check.svg
+lib/dflip/images/pdfjs/annotation-comment.svg
+lib/dflip/images/pdfjs/annotation-help.svg
+lib/dflip/images/pdfjs/annotation-insert.svg
+lib/dflip/images/pdfjs/annotation-key.svg
+lib/dflip/images/pdfjs/annotation-newparagraph.svg
+lib/dflip/images/pdfjs/annotation-noicon.svg
+lib/dflip/images/pdfjs/annotation-note.svg
+lib/dflip/images/pdfjs/annotation-paragraph.svg
+lib/dflip/images/textures/white.jpg
+lib/dflip/js/dflip.min.js
+lib/dflip/js/libs/cmaps/78-EUC-H.bcmap
+lib/dflip/js/libs/cmaps/78-EUC-V.bcmap
+lib/dflip/js/libs/cmaps/78-H.bcmap
+lib/dflip/js/libs/cmaps/78-RKSJ-H.bcmap
+lib/dflip/js/libs/cmaps/78-RKSJ-V.bcmap
+lib/dflip/js/libs/cmaps/78-V.bcmap
+lib/dflip/js/libs/cmaps/78ms-RKSJ-H.bcmap
+lib/dflip/js/libs/cmaps/78ms-RKSJ-V.bcmap
+lib/dflip/js/libs/cmaps/83pv-RKSJ-H.bcmap
+lib/dflip/js/libs/cmaps/90ms-RKSJ-H.bcmap
+lib/dflip/js/libs/cmaps/90ms-RKSJ-V.bcmap
+lib/dflip/js/libs/cmaps/90msp-RKSJ-H.bcmap
+lib/dflip/js/libs/cmaps/90msp-RKSJ-V.bcmap
+lib/dflip/js/libs/cmaps/90pv-RKSJ-H.bcmap
+lib/dflip/js/libs/cmaps/90pv-RKSJ-V.bcmap
+lib/dflip/js/libs/cmaps/Add-H.bcmap
+lib/dflip/js/libs/cmaps/Add-RKSJ-H.bcmap
+lib/dflip/js/libs/cmaps/Add-RKSJ-V.bcmap
+lib/dflip/js/libs/cmaps/Add-V.bcmap
+lib/dflip/js/libs/cmaps/Adobe-CNS1-0.bcmap
+lib/dflip/js/libs/cmaps/Adobe-CNS1-1.bcmap
+lib/dflip/js/libs/cmaps/Adobe-CNS1-2.bcmap
+lib/dflip/js/libs/cmaps/Adobe-CNS1-3.bcmap
+lib/dflip/js/libs/cmaps/Adobe-CNS1-4.bcmap
+lib/dflip/js/libs/cmaps/Adobe-CNS1-5.bcmap
+lib/dflip/js/libs/cmaps/Adobe-CNS1-6.bcmap
+lib/dflip/js/libs/cmaps/Adobe-CNS1-UCS2.bcmap
+lib/dflip/js/libs/cmaps/Adobe-GB1-0.bcmap
+lib/dflip/js/libs/cmaps/Adobe-GB1-1.bcmap
+lib/dflip/js/libs/cmaps/Adobe-GB1-2.bcmap
+lib/dflip/js/libs/cmaps/Adobe-GB1-3.bcmap
+lib/dflip/js/libs/cmaps/Adobe-GB1-4.bcmap
+lib/dflip/js/libs/cmaps/Adobe-GB1-5.bcmap
+lib/dflip/js/libs/cmaps/Adobe-GB1-UCS2.bcmap
+lib/dflip/js/libs/cmaps/Adobe-Japan1-0.bcmap
+lib/dflip/js/libs/cmaps/Adobe-Japan1-1.bcmap
+lib/dflip/js/libs/cmaps/Adobe-Japan1-2.bcmap
+lib/dflip/js/libs/cmaps/Adobe-Japan1-3.bcmap
+lib/dflip/js/libs/cmaps/Adobe-Japan1-4.bcmap
+lib/dflip/js/libs/cmaps/Adobe-Japan1-5.bcmap
+lib/dflip/js/libs/cmaps/Adobe-Japan1-6.bcmap
+lib/dflip/js/libs/cmaps/Adobe-Japan1-UCS2.bcmap
+lib/dflip/js/libs/cmaps/Adobe-Korea1-0.bcmap
+lib/dflip/js/libs/cmaps/Adobe-Korea1-1.bcmap
+lib/dflip/js/libs/cmaps/Adobe-Korea1-2.bcmap
+lib/dflip/js/libs/cmaps/Adobe-Korea1-UCS2.bcmap
+lib/dflip/js/libs/cmaps/B5-H.bcmap
+lib/dflip/js/libs/cmaps/B5-V.bcmap
+lib/dflip/js/libs/cmaps/B5pc-H.bcmap
+lib/dflip/js/libs/cmaps/B5pc-V.bcmap
+lib/dflip/js/libs/cmaps/CNS-EUC-H.bcmap
+lib/dflip/js/libs/cmaps/CNS-EUC-V.bcmap
+lib/dflip/js/libs/cmaps/CNS1-H.bcmap
+lib/dflip/js/libs/cmaps/CNS1-V.bcmap
+lib/dflip/js/libs/cmaps/CNS2-H.bcmap
+lib/dflip/js/libs/cmaps/CNS2-V.bcmap
+lib/dflip/js/libs/cmaps/ETHK-B5-H.bcmap
+lib/dflip/js/libs/cmaps/ETHK-B5-V.bcmap
+lib/dflip/js/libs/cmaps/ETen-B5-H.bcmap
+lib/dflip/js/libs/cmaps/ETen-B5-V.bcmap
+lib/dflip/js/libs/cmaps/ETenms-B5-H.bcmap
+lib/dflip/js/libs/cmaps/ETenms-B5-V.bcmap
+lib/dflip/js/libs/cmaps/EUC-H.bcmap
+lib/dflip/js/libs/cmaps/EUC-V.bcmap
+lib/dflip/js/libs/cmaps/Ext-H.bcmap
+lib/dflip/js/libs/cmaps/Ext-RKSJ-H.bcmap
+lib/dflip/js/libs/cmaps/Ext-RKSJ-V.bcmap
+lib/dflip/js/libs/cmaps/Ext-V.bcmap
+lib/dflip/js/libs/cmaps/GB-EUC-H.bcmap
+lib/dflip/js/libs/cmaps/GB-EUC-V.bcmap
+lib/dflip/js/libs/cmaps/GB-H.bcmap
+lib/dflip/js/libs/cmaps/GB-V.bcmap
+lib/dflip/js/libs/cmaps/GBK-EUC-H.bcmap
+lib/dflip/js/libs/cmaps/GBK-EUC-V.bcmap
+lib/dflip/js/libs/cmaps/GBK2K-H.bcmap
+lib/dflip/js/libs/cmaps/GBK2K-V.bcmap
+lib/dflip/js/libs/cmaps/GBKp-EUC-H.bcmap
+lib/dflip/js/libs/cmaps/GBKp-EUC-V.bcmap
+lib/dflip/js/libs/cmaps/GBT-EUC-H.bcmap
+lib/dflip/js/libs/cmaps/GBT-EUC-V.bcmap
+lib/dflip/js/libs/cmaps/GBT-H.bcmap
+lib/dflip/js/libs/cmaps/GBT-V.bcmap
+lib/dflip/js/libs/cmaps/GBTpc-EUC-H.bcmap
+lib/dflip/js/libs/cmaps/GBTpc-EUC-V.bcmap
+lib/dflip/js/libs/cmaps/GBpc-EUC-H.bcmap
+lib/dflip/js/libs/cmaps/GBpc-EUC-V.bcmap
+lib/dflip/js/libs/cmaps/H.bcmap
+lib/dflip/js/libs/cmaps/HKdla-B5-H.bcmap
+lib/dflip/js/libs/cmaps/HKdla-B5-V.bcmap
+lib/dflip/js/libs/cmaps/HKdlb-B5-H.bcmap
+lib/dflip/js/libs/cmaps/HKdlb-B5-V.bcmap
+lib/dflip/js/libs/cmaps/HKgccs-B5-H.bcmap
+lib/dflip/js/libs/cmaps/HKgccs-B5-V.bcmap
+lib/dflip/js/libs/cmaps/HKm314-B5-H.bcmap
+lib/dflip/js/libs/cmaps/HKm314-B5-V.bcmap
+lib/dflip/js/libs/cmaps/HKm471-B5-H.bcmap
+lib/dflip/js/libs/cmaps/HKm471-B5-V.bcmap
+lib/dflip/js/libs/cmaps/HKscs-B5-H.bcmap
+lib/dflip/js/libs/cmaps/HKscs-B5-V.bcmap
+lib/dflip/js/libs/cmaps/Hankaku.bcmap
+lib/dflip/js/libs/cmaps/Hiragana.bcmap
+lib/dflip/js/libs/cmaps/KSC-EUC-H.bcmap
+lib/dflip/js/libs/cmaps/KSC-EUC-V.bcmap
+lib/dflip/js/libs/cmaps/KSC-H.bcmap
+lib/dflip/js/libs/cmaps/KSC-Johab-H.bcmap
+lib/dflip/js/libs/cmaps/KSC-Johab-V.bcmap
+lib/dflip/js/libs/cmaps/KSC-V.bcmap
+lib/dflip/js/libs/cmaps/KSCms-UHC-H.bcmap
+lib/dflip/js/libs/cmaps/KSCms-UHC-HW-H.bcmap
+lib/dflip/js/libs/cmaps/KSCms-UHC-HW-V.bcmap
+lib/dflip/js/libs/cmaps/KSCms-UHC-V.bcmap
+lib/dflip/js/libs/cmaps/KSCpc-EUC-H.bcmap
+lib/dflip/js/libs/cmaps/KSCpc-EUC-V.bcmap
+lib/dflip/js/libs/cmaps/Katakana.bcmap
+lib/dflip/js/libs/cmaps/LICENSE
+lib/dflip/js/libs/cmaps/NWP-H.bcmap
+lib/dflip/js/libs/cmaps/NWP-V.bcmap
+lib/dflip/js/libs/cmaps/RKSJ-H.bcmap
+lib/dflip/js/libs/cmaps/RKSJ-V.bcmap
+lib/dflip/js/libs/cmaps/Roman.bcmap
+lib/dflip/js/libs/cmaps/UniCNS-UCS2-H.bcmap
+lib/dflip/js/libs/cmaps/UniCNS-UCS2-V.bcmap
+lib/dflip/js/libs/cmaps/UniCNS-UTF16-H.bcmap
+lib/dflip/js/libs/cmaps/UniCNS-UTF16-V.bcmap
+lib/dflip/js/libs/cmaps/UniCNS-UTF32-H.bcmap
+lib/dflip/js/libs/cmaps/UniCNS-UTF32-V.bcmap
+lib/dflip/js/libs/cmaps/UniCNS-UTF8-H.bcmap
+lib/dflip/js/libs/cmaps/UniCNS-UTF8-V.bcmap
+lib/dflip/js/libs/cmaps/UniGB-UCS2-H.bcmap
+lib/dflip/js/libs/cmaps/UniGB-UCS2-V.bcmap
+lib/dflip/js/libs/cmaps/UniGB-UTF16-H.bcmap
+lib/dflip/js/libs/cmaps/UniGB-UTF16-V.bcmap
+lib/dflip/js/libs/cmaps/UniGB-UTF32-H.bcmap
+lib/dflip/js/libs/cmaps/UniGB-UTF32-V.bcmap
+lib/dflip/js/libs/cmaps/UniGB-UTF8-H.bcmap
+lib/dflip/js/libs/cmaps/UniGB-UTF8-V.bcmap
+lib/dflip/js/libs/cmaps/UniJIS-UCS2-H.bcmap
+lib/dflip/js/libs/cmaps/UniJIS-UCS2-HW-H.bcmap
+lib/dflip/js/libs/cmaps/UniJIS-UCS2-HW-V.bcmap
+lib/dflip/js/libs/cmaps/UniJIS-UCS2-V.bcmap
+lib/dflip/js/libs/cmaps/UniJIS-UTF16-H.bcmap
+lib/dflip/js/libs/cmaps/UniJIS-UTF16-V.bcmap
+lib/dflip/js/libs/cmaps/UniJIS-UTF32-H.bcmap
+lib/dflip/js/libs/cmaps/UniJIS-UTF32-V.bcmap
+lib/dflip/js/libs/cmaps/UniJIS-UTF8-H.bcmap
+lib/dflip/js/libs/cmaps/UniJIS-UTF8-V.bcmap
+lib/dflip/js/libs/cmaps/UniJIS2004-UTF16-H.bcmap
+lib/dflip/js/libs/cmaps/UniJIS2004-UTF16-V.bcmap
+lib/dflip/js/libs/cmaps/UniJIS2004-UTF32-H.bcmap
+lib/dflip/js/libs/cmaps/UniJIS2004-UTF32-V.bcmap
+lib/dflip/js/libs/cmaps/UniJIS2004-UTF8-H.bcmap
+lib/dflip/js/libs/cmaps/UniJIS2004-UTF8-V.bcmap
+lib/dflip/js/libs/cmaps/UniJISPro-UCS2-HW-V.bcmap
+lib/dflip/js/libs/cmaps/UniJISPro-UCS2-V.bcmap
+lib/dflip/js/libs/cmaps/UniJISPro-UTF8-V.bcmap
+lib/dflip/js/libs/cmaps/UniJISX0213-UTF32-H.bcmap
+lib/dflip/js/libs/cmaps/UniJISX0213-UTF32-V.bcmap
+lib/dflip/js/libs/cmaps/UniJISX02132004-UTF32-H.bcmap
+lib/dflip/js/libs/cmaps/UniJISX02132004-UTF32-V.bcmap
+lib/dflip/js/libs/cmaps/UniKS-UCS2-H.bcmap
+lib/dflip/js/libs/cmaps/UniKS-UCS2-V.bcmap
+lib/dflip/js/libs/cmaps/UniKS-UTF16-H.bcmap
+lib/dflip/js/libs/cmaps/UniKS-UTF16-V.bcmap
+lib/dflip/js/libs/cmaps/UniKS-UTF32-H.bcmap
+lib/dflip/js/libs/cmaps/UniKS-UTF32-V.bcmap
+lib/dflip/js/libs/cmaps/UniKS-UTF8-H.bcmap
+lib/dflip/js/libs/cmaps/UniKS-UTF8-V.bcmap
+lib/dflip/js/libs/cmaps/V.bcmap
+lib/dflip/js/libs/cmaps/WP-Symbol.bcmap
+lib/dflip/js/libs/compatibility.js
+lib/dflip/js/libs/jquery.min.js
+lib/dflip/js/libs/mockup.min.js
+lib/dflip/js/libs/pdf.min.js
+lib/dflip/js/libs/pdf.worker.min.js
+lib/dflip/js/libs/three.min.js
+lib/dflip/sound/turn.mp3
+lib/dflip/sound/turn2.mp3
+lib/dflip/sound/turn2a.mp3
+lib/dflip/sound/turn3.mp3
+manifest.webmanifest
+manuscript/index.html
+mapping_os/index.html
+neurodiversity-lessonbank/LICENSE
+neurodiversity-lessonbank/Lesson plans/Avoiding ableist language to diversify open scholarship.docx
+neurodiversity-lessonbank/Lesson plans/Diversity and Research.docx
+neurodiversity-lessonbank/Lesson plans/Diversity as a core value of Open Science.docx
+neurodiversity-lessonbank/Lesson plans/Diversity open scholarship with a neurodivergent perspective.docx
+neurodiversity-lessonbank/Lesson plans/How can we Open Scholarship to address the structural ableism and racism in our society.docx
+neurodiversity-lessonbank/Lesson plans/Implicit Bias part 2.docx
+neurodiversity-lessonbank/Lesson plans/Neuro_para.docx
+neurodiversity-lessonbank/Lesson plans/The myth of the normality How neurodiversity dismantles the generalisability crisis.docx
+neurodiversity-lessonbank/Lesson plans/generalizability.docx
+neurodiversity-lessonbank/Lesson plans/implicit bias lesson plan.docx
+neurodiversity-lessonbank/Lesson_Plans/Avoiding_ableist language_to_diversify_open_scholarship.pdf
+neurodiversity-lessonbank/Lesson_Plans/Diversity_and_Research.pdf
+neurodiversity-lessonbank/Lesson_Plans/Diversity_as_a_corevalue_of_Open Science.pdf
+neurodiversity-lessonbank/Lesson_Plans/Diversity_open scholarship_with_a_neurodivergent_perspective.pdf
+neurodiversity-lessonbank/Lesson_Plans/How_can_we_Open Scholarship_to_address_the structural_ableism_and_racism_in_our_society.pdf
+neurodiversity-lessonbank/Lesson_Plans/Implicit_Bias_part_2.pdf
+neurodiversity-lessonbank/Lesson_Plans/Implicit_bias.pdf
+neurodiversity-lessonbank/Lesson_Plans/Neuro_para.pdf
+neurodiversity-lessonbank/Lesson_Plans/The_myth_of_the_normality_How_neurodiversity_dismantles_the_generalisability_crisis.pdf
+neurodiversity-lessonbank/Lesson_Plans/generalizability.pdf
+neurodiversity-lessonbank/Lesson_Plans/implicit_bias_lesson_plan.pdf
+neurodiversity-lessonbank/community-psychology-diversity/index.html
+neurodiversity-lessonbank/diversity-and-research/index.html
+neurodiversity-lessonbank/generalizability/index.html
+neurodiversity-lessonbank/images/Neurodivdef.webp
+neurodiversity-lessonbank/images/SAM_OS.webp
+neurodiversity-lessonbank/images/books-5937823_1920.webp
+neurodiversity-lessonbank/images/defandtwt.webp
+neurodiversity-lessonbank/images/freedom-1886402_640.webp
+neurodiversity-lessonbank/images/handprints-2754263_1280.webp
+neurodiversity-lessonbank/images/lefthand.webp
+neurodiversity-lessonbank/images/logo.webp
+neurodiversity-lessonbank/images/ndforrt.webp
+neurodiversity-lessonbank/images/ndtr.webp
+neurodiversity-lessonbank/images/neurodiversity.webp
+neurodiversity-lessonbank/images/puzzle-2500333_640.webp
+neurodiversity-lessonbank/images/research.webp
+neurodiversity-lessonbank/images/respect_for_diversity.webp
+neurodiversity-lessonbank/implicit_bias/index.html
+neurodiversity-lessonbank/index.html
+neurodiversity-lessonbank/index.xml
+neurodiversity-lessonbank/masterstools/index.html
+neurodiversity-lessonbank/page/1/index.html
+neurodiversity/index.html
+newsletters/index.html
+nexus/index.html
+nowherelab/index.html
+nowherelab/index.xml
+nowherelab/phd-survival-guide/index.html
+open-research-games-portal/index.html
+os-developing-world/Authors_Geo.webp
+os-developing-world/LMIC.webp
+os-developing-world/Open_Science_Developing_Countries.pdf
+os-developing-world/Practical_Guides_for_Implementing_Open_Science.webp
+os-developing-world/The_hidden_costs_of_best_open-science_practices.webp
+os-developing-world/barriers_for_engaging_in_open_science_in_developing_countries.webp
+os-developing-world/index.html
+partials/network-graph.html
+pedagogies/001-julia-strand/JS-interview.pdf
+pedagogies/001-julia-strand/featured.webp
+pedagogies/001-julia-strand/featured_hu.webp
+pedagogies/001-julia-strand/index.html
+pedagogies/001-julia-strand/interview.webp
+pedagogies/002-gilad-feldman/FigQ1.webp
+pedagogies/002-gilad-feldman/FigQ11.webp
+pedagogies/002-gilad-feldman/FigQ2.webp
+pedagogies/002-gilad-feldman/FigQ3.webp
+pedagogies/002-gilad-feldman/FigQ4.webp
+pedagogies/002-gilad-feldman/FigQ7.webp
+pedagogies/002-gilad-feldman/GF-interview.pdf
+pedagogies/002-gilad-feldman/featured.webp
+pedagogies/002-gilad-feldman/featured_hu.webp
+pedagogies/002-gilad-feldman/index.html
+pedagogies/002-gilad-feldman/interview.webp
+pedagogies/003-crep/CREP-interview.pdf
+pedagogies/003-crep/featured.webp
+pedagogies/003-crep/featured_hu.webp
+pedagogies/003-crep/image1.webp
+pedagogies/003-crep/image2.webp
+pedagogies/003-crep/image3.webp
+pedagogies/003-crep/index.html
+pedagogies/004-thomas-rhys-evans/featured.webp
+pedagogies/004-thomas-rhys-evans/featured_hu.webp
+pedagogies/004-thomas-rhys-evans/index.html
+pedagogies/004-thomas-rhys-evans/teampedagogy.webp
+pedagogies/featured.webp
+pedagogies/index.html
+pedagogies/index.xml
+pedagogies/page/1/index.html
+positive-changes-replication-crisis/Viz_FORRT.webp
+positive-changes-replication-crisis/index.html
+positive-changes-replication-crisis/modes-of-change.webp
+post/2015-07-23-r-rmarkdown_files/figure-html/pie-1.webp
+post/2026-01-newsletter/featured.jpg
+post/2026-01-newsletter/featured_hu.jpg
+post/2026-01-newsletter/featured_hu.jpg
+post/2026-01-newsletter/index.html
+post/2026-02-newsletter/featured.jpg
+post/2026-02-newsletter/featured_hu.jpg
+post/2026-02-newsletter/featured_hu.jpg
+post/2026-02-newsletter/index.html
+post/2026-03-newsletter/featured.jpg
+post/2026-03-newsletter/featured_hu.jpg
+post/2026-03-newsletter/featured_hu.jpg
+post/2026-03-newsletter/index.html
+post/2026-04-newsletter/featured.jpg
+post/2026-04-newsletter/featured_hu.jpg
+post/2026-04-newsletter/featured_hu.jpg
+post/2026-04-newsletter/index.html
+post/2026-05-chinese-glossary/featured.jpg
+post/2026-05-chinese-glossary/featured_hu.jpg
+post/2026-05-chinese-glossary/featured_hu.jpg
+post/2026-05-chinese-glossary/index.html
+post/2026-05-get-involved-page/featured.jpg
+post/2026-05-get-involved-page/featured_hu.jpg
+post/2026-05-get-involved-page/featured_hu.jpg
+post/2026-05-get-involved-page/index.html
+post/2026-05-just-os-chatbot/featured.jpg
+post/2026-05-just-os-chatbot/featured_hu.jpg
+post/2026-05-just-os-chatbot/featured_hu.jpg
+post/2026-05-just-os-chatbot/index.html
+post/2026-05-newsletter/featured.jpg
+post/2026-05-newsletter/featured_hu.jpg
+post/2026-05-newsletter/featured_hu.jpg
+post/2026-05-newsletter/index.html
+post/2026-05-nowhere-lab/featured.jpg
+post/2026-05-nowhere-lab/featured_hu.jpg
+post/2026-05-nowhere-lab/featured_hu.jpg
+post/2026-05-nowhere-lab/index.html
+post/2026-06-ai-metascience-call/featured.jpg
+post/2026-06-ai-metascience-call/featured_hu.jpg
+post/2026-06-ai-metascience-call/featured_hu.jpg
+post/2026-06-ai-metascience-call/index.html
+post/2026-06-peer-community-in-partner/featured.jpg
+post/2026-06-peer-community-in-partner/featured_hu.jpg
+post/2026-06-peer-community-in-partner/featured_hu.jpg
+post/2026-06-peer-community-in-partner/index.html
+post/2026-10-ai-in-metascience-recordings/featured.png
+post/2026-10-ai-in-metascience-recordings/featured_hu.png
+post/2026-10-ai-in-metascience-recordings/index.html
+post/2026-10-nwo-award/featured.jpg
+post/2026-10-nwo-award/featured_hu.jpg
+post/2026-10-nwo-award/featured_hu.jpg
+post/2026-10-nwo-award/index.html
+post/2026-10-presentations/featured.png
+post/2026-10-presentations/featured_hu.png
+post/2026-10-presentations/featured_hu.png
+post/2026-10-presentations/index.html
+post/2026-9-registrations-are-now-open-for-the-ai-in-metascience-online-conference/featured.png
+post/2026-9-registrations-are-now-open-for-the-ai-in-metascience-online-conference/featured_hu.png
+post/2026-9-registrations-are-now-open-for-the-ai-in-metascience-online-conference/index.html
+post/index.html
+post/index.xml
+publication_types/index.html
+publication_types/index.xml
+publication_types/page/1/index.html
+publications/2023_QAA _ FORRT_UKRN.pdf
+publications/Azevedo_et.al._FORRT_Pedagogical_Communities.pdf
+publications/Azevedo_et.al._FORRT_Science_Technology_Committee_UK_Inquiry.pdf
+publications/Korbmacher-et-al-positive-structural-procedural-and-community-changes.pdf
+publications/Letter_to_UNESCO’s_Principles_of_Open_Science_Monitoring.pdf
+publications/Parsons_Azevedo_Elsherif_FORRT_Glossary_Community_Sourced_Glossary_Open_Scholarship_Terms.pdf
+publications/Parsons_Azevedo_FORRT_UKRN_Briefing_note_for_degree_accrediting_societies.pdf
+publications/README
+publications/citation_chart.webp
+publications/index.html
+publications/pdf/Inaugural_Editorial_of_Replication_Research_R2.pdf
+publications/pdf/OSF_Making_Open_Science_Multilingual_Lessons_from_the_Turkish_Adaptation_of_FORRT’s_Open_Science_Glossary.pdf
+publications/template.yaml
+replication-hub/flora/index.html
+replication-hub/flora/index.xml
+replication-hub/flora/page/1/index.html
+replication-hub/fred.webp
+replication-hub/index.html
+replication-hub/index.xml
+replication-hub/large-scale-replication-projects/index.html
+replication-hub/rep_hub_framework.webp
+replication-hub/rep_research.webp
+replication-hub/replication_hub.webp
+replication-hub/submit/index.html
+replication-hub/submit/submit.mdOUT
+resources/index.html
+resources/resource.py
+reversals/index.html
+robots.txt
+sitemap.xml
+summaries/FORRT_O&R_101_Syllabus.pdf
+summaries/diversity-equity-inclusion/index.html
+summaries/index.html
+summaries/index.xml
+summaries/open-reproducible/index.html
+summaries/summaries.py
+syllabus/index.html
+tag/3d-printing/index.html
+tag/3r/index.html
+tag/a-priori-power-analysis/index.html
+tag/abcd/index.html
+tag/abstract/index.html
+tag/academia/index.html
+tag/academic-bullying/index.html
+tag/academic-capitalism/index.html
+tag/academic-careers/index.html
+tag/academic-course/index.html
+tag/academic-culture-change/index.html
+tag/academic-events/index.html
+tag/academic-fraud/index.html
+tag/academic-job-market/index.html
+tag/academic-labor-conditions/index.html
+tag/academic-life/index.html
+tag/academic-opportunities/index.html
+tag/academic-professional-development/index.html
+tag/academic-publishing/index.html
+tag/academic-reform/index.html
+tag/academic-skills/index.html
+tag/academic/index.html
+tag/accelerated-nursing-education/index.html
+tag/accelerating-research-on-consciousness/index.html
+tag/accessibility/index.html
+tag/accommodation/index.html
+tag/accountability/index.html
+tag/accuracy/index.html
+tag/activities/index.html
+tag/acute-myeloid-leukemia/index.html
+tag/adaptation/index.html
+tag/adhd/index.html
+tag/administration/index.html
+tag/administrative-burden/index.html
+tag/adult-emotional-development/index.html
+tag/adverse-events/index.html
+tag/advertising/index.html
+tag/advice/index.html
+tag/agent-based-modelling/index.html
+tag/aggregation/index.html
+tag/aging-research/index.html
+tag/aging-science/index.html
+tag/aging/index.html
+tag/ai-research-assistants/index.html
+tag/ai/index.html
+tag/alzheimers-disease/index.html
+tag/amanda-montoya/index.html
+tag/ambition-document/index.html
+tag/analgesics/index.html
+tag/analyses/index.html
+tag/analysis-of-variance/index.html
+tag/analysis-plan/index.html
+tag/analysis/index.html
+tag/analytic-flexibility/index.html
+tag/and-inclusion-dei/index.html
+tag/and-inclusion-edi/index.html
+tag/and-tenure/index.html
+tag/anesthetics/index.html
+tag/animal-behavior/index.html
+tag/animal-models/index.html
+tag/animal-research/index.html
+tag/animal-slaughter/index.html
+tag/animal-studies/index.html
+tag/animal-trait-database/index.html
+tag/animal-welfare/index.html
+tag/annotated-code/index.html
+tag/anthropological-holism/index.html
+tag/anthropological-methods/index.html
+tag/antibodies/index.html
+tag/antidepressants/index.html
+tag/antiracist/index.html
+tag/apc/article-processing-charge/index.html
+tag/applicability/index.html
+tag/applied-epistemology/index.html
+tag/applied-research/index.html
+tag/arabidopsis-thaliana/index.html
+tag/archaeology/index.html
+tag/archival-data/index.html
+tag/archives/index.html
+tag/archiving/index.html
+tag/ariadne/index.html
+tag/arms/index.html
+tag/arnold-foundation/index.html
+tag/arterial-spin-labeling/index.html
+tag/article-publishing-fees/index.html
+tag/artificial-intelligence/index.html
+tag/arts-and-humanities/index.html
+tag/assignments/index.html
+tag/assumptions/index.html
+tag/astrobiology/index.html
+tag/astrophysics/index.html
+tag/attitudes-towards-open-science/index.html
+tag/auditory-fear-conditioning/index.html
+tag/author-contract/index.html
+tag/author-guidelines/index.html
+tag/authors/index.html
+tag/authorship/index.html
+tag/autism/index.html
+tag/automated-image-analysis/index.html
+tag/automated-imaging/index.html
+tag/bad-science/index.html
+tag/badges/index.html
+tag/barcelona-open-research-declaration/index.html
+tag/barriers-to-higher-education/index.html
+tag/barriers/index.html
+tag/bayesian-confirmation-theory/index.html
+tag/bayesian-method/index.html
+tag/bayesian-statistics/index.html
+tag/bayesian/index.html
+tag/behavior/index.html
+tag/behavioral-ecology/index.html
+tag/behavioral-medicine/index.html
+tag/behavioral-neuroscience/index.html
+tag/behavioural-addiction/index.html
+tag/behavioural-medicine/index.html
+tag/best-practice/index.html
+tag/best-practices/index.html
+tag/betsy-mccoach/index.html
+tag/bias-in-peer-review/index.html
+tag/bias/index.html
+tag/biases/index.html
+tag/bibliographic-metadata/index.html
+tag/bibliometric/index.html
+tag/bibliometrics/index.html
+tag/big-data/index.html
+tag/big-science/index.html
+tag/big-team-science-initiatives/index.html
+tag/big-team-science/index.html
+tag/bilingualism/index.html
+tag/bioassays-and-physiological-analysis/index.html
+tag/bioinformatics/index.html
+tag/biologics/index.html
+tag/biology/index.html
+tag/biomarkers/index.html
+tag/biomedical-data/index.html
+tag/biomedical-research/index.html
+tag/biomedical-sciences/index.html
+tag/biomedicine/index.html
+tag/biotechnology/index.html
+tag/black-researchers/index.html
+tag/blended-data/index.html
+tag/blind-data-analysis/index.html
+tag/blog/index.html
+tag/book/index.html
+tag/borrowers/index.html
+tag/bounded-ethicality/index.html
+tag/brain-imaging/index.html
+tag/brain-tumors/index.html
+tag/brain/index.html
+tag/breast-cancer/index.html
+tag/buffet-approach/index.html
+tag/burnout/index.html
+tag/business-models/index.html
+tag/business/index.html
+tag/canadian-open-neuroscience-platform-conp/index.html
+tag/canadian-open-neuroscience-platform/index.html
+tag/cancer-research/index.html
+tag/cancer/index.html
+tag/cancers-and-neoplasms/index.html
+tag/caplex/index.html
+tag/care-principles/index.html
+tag/career-advice/index.html
+tag/career/index.html
+tag/careers-in-research/index.html
+tag/careers/index.html
+tag/case-studies/index.html
+tag/categorial-perception/index.html
+tag/categorical-perception/index.html
+tag/cc-licences/index.html
+tag/census-data/index.html
+tag/center-for-open-science/index.html
+tag/centerforopenscience/index.html
+tag/centrality/index.html
+tag/change/index.html
+tag/characterization/index.html
+tag/chatgpt/index.html
+tag/checklist/index.html
+tag/checklists/index.html
+tag/chemistry/index.html
+tag/chi-square-tests/index.html
+tag/chinese/index.html
+tag/chrysalis-effect/index.html
+tag/ciencia-aberta-taxonomia/index.html
+tag/citation-analysis/index.html
+tag/citation-bias/index.html
+tag/citation-manipulation/index.html
+tag/citation-politics/index.html
+tag/citation/index.html
+tag/citations/index.html
+tag/citizen-science/index.html
+tag/classroom-instruction/index.html
+tag/climate-research/index.html
+tag/clinical-data/index.html
+tag/clinical-psychology/index.html
+tag/clinical-research/index.html
+tag/clinical-science/index.html
+tag/clinical-trial-registration/index.html
+tag/clinical-trials-cancer-treatment/index.html
+tag/clinical-trials/index.html
+tag/clinicaltrials.gov/index.html
+tag/close-replication/index.html
+tag/cloud-computing/index.html
+tag/clusters/index.html
+tag/code-availability/index.html
+tag/code-of-conduct/index.html
+tag/code-sharing/index.html
+tag/code-transparency/index.html
+tag/code/index.html
+tag/cognitive-ageing/index.html
+tag/cognitive-aging/index.html
+tag/cognitive-modeling/index.html
+tag/cognitive-modelling/index.html
+tag/cognitive-neuroscience/index.html
+tag/cohen/index.html
+tag/colaboration/index.html
+tag/collaboration/index.html
+tag/collaborative-learning/index.html
+tag/collection/index.html
+tag/columbia-card-task-cct/index.html
+tag/comic/index.html
+tag/commerce/index.html
+tag/communications/index.html
+tag/community-based-change/index.html
+tag/community-ecology/index.html
+tag/community-resources/index.html
+tag/comparative-physiology/index.html
+tag/comparative-psychology/index.html
+tag/competition/index.html
+tag/competitive-funding/index.html
+tag/complementary-alternative-and-integrative-medicine/index.html
+tag/computational-biology/index.html
+tag/computational-immunology/index.html
+tag/computational-literary-studies/index.html
+tag/computational-model/index.html
+tag/computational-modeling/index.html
+tag/computational-modelling/index.html
+tag/computational-neuroscience/index.html
+tag/computational-science/index.html
+tag/computational-social-science/index.html
+tag/computer-and-information-sciences/index.html
+tag/computer-applications/index.html
+tag/computer-code-access/index.html
+tag/computer-code/index.html
+tag/computer-science/index.html
+tag/computer-sciences/index.html
+tag/computer-software/index.html
+tag/computing/index.html
+tag/comunicacao-cientifica/index.html
+tag/conceptual-and-statistical-knowledge/index.html
+tag/conceptual-model/index.html
+tag/conceptual-replication/index.html
+tag/conditional-probability/index.html
+tag/confidence-interval/index.html
+tag/confidence-intervals/index.html
+tag/confirmatory-analyses/index.html
+tag/confirmatory-analysis/index.html
+tag/confirmatory-research/index.html
+tag/confirmatory/index.html
+tag/conflicts-of-interest/index.html
+tag/conjunctive-probability/index.html
+tag/consciousness/index.html
+tag/consolidation/index.html
+tag/consort/index.html
+tag/consortia/index.html
+tag/conspiracy-theories/index.html
+tag/constructive-replication/index.html
+tag/consultation/index.html
+tag/consulting/index.html
+tag/consumer-policy/index.html
+tag/consumer-psychology/index.html
+tag/consumer-research/index.html
+tag/context-exploratory-replication/index.html
+tag/context/index.html
+tag/contextual-fear-conditioning/index.html
+tag/control-systems/index.html
+tag/controversial-topics/index.html
+tag/copyright/index.html
+tag/coronagraph/index.html
+tag/cos/index.html
+tag/cosmin/index.html
+tag/counter-norms/index.html
+tag/country-comparisons/index.html
+tag/course-materials/index.html
+tag/course/index.html
+tag/courses/index.html
+tag/covid-19/index.html
+tag/creative-commons/index.html
+tag/credibility-crisis/index.html
+tag/credibility-revolution/index.html
+tag/credibility/index.html
+tag/credible-science/index.html
+tag/crep/index.html
+tag/crisis/index.html
+tag/critical-rationalism/index.html
+tag/critical-realism/index.html
+tag/critical-skills/index.html
+tag/critical-thinking/index.html
+tag/critique/index.html
+tag/critiques/index.html
+tag/crustacea/index.html
+tag/csv/index.html
+tag/cultural-diversity/index.html
+tag/cultural-evolution/index.html
+tag/cultural-participation/index.html
+tag/cultural-taxation/index.html
+tag/culture-change/index.html
+tag/culture/index.html
+tag/cumulative-research/index.html
+tag/curated-resources/index.html
+tag/curation/index.html
+tag/curriculum-change/index.html
+tag/curriculum-design/index.html
+tag/cystic-fibrosis/index.html
+tag/dana-farber-cancer-institute/index.html
+tag/data-access/index.html
+tag/data-acquisition/index.html
+tag/data-analysis-tools/index.html
+tag/data-analysis/index.html
+tag/data-anonymity/index.html
+tag/data-citation/index.html
+tag/data-collection-tools/index.html
+tag/data-collection/index.html
+tag/data-communication/index.html
+tag/data-conversion/index.html
+tag/data-curation/index.html
+tag/data-driven-research/index.html
+tag/data-governance/index.html
+tag/data-infrastructure/index.html
+tag/data-infrastructures/index.html
+tag/data-integration/index.html
+tag/data-integrity/index.html
+tag/data-interpretation/index.html
+tag/data-literacy/index.html
+tag/data-management-plan/index.html
+tag/data-management-plans/index.html
+tag/data-management/index.html
+tag/data-manipulation/index.html
+tag/data-mining/index.html
+tag/data-notes/index.html
+tag/data-overuse/index.html
+tag/data-policy/index.html
+tag/data-preparation/index.html
+tag/data-processing/index.html
+tag/data-protection/index.html
+tag/data-provenance/index.html
+tag/data-quality/index.html
+tag/data-removal/index.html
+tag/data-repositiories/index.html
+tag/data-repositories/index.html
+tag/data-repository/index.html
+tag/data-reuse/index.html
+tag/data-science-tool/index.html
+tag/data-security/index.html
+tag/data-sharing-in-dentistry/index.html
+tag/data-sharing-policies/index.html
+tag/data-sharing/index.html
+tag/data-software/index.html
+tag/data-standards/index.html
+tag/data-transparency-levels/index.html
+tag/data-transparency/index.html
+tag/data-validation/index.html
+tag/data-visualisation/index.html
+tag/data-visualization/index.html
+tag/data/index.html
+tag/database-searching/index.html
+tag/databases/index.html
+tag/dates/index.html
+tag/dce-mri/index.html
+tag/debate/index.html
+tag/declaration-of-helsinki/index.html
+tag/decolonialisation/index.html
+tag/decomposition/index.html
+tag/deepmind-protein-folding/index.html
+tag/dementia-care/index.html
+tag/dementia/index.html
+tag/demo/index.html
+tag/dental-journals/index.html
+tag/dependent-events/index.html
+tag/depression/index.html
+tag/dermatology/index.html
+tag/development/index.html
+tag/developmental-cognitive-neuroscience/index.html
+tag/deviance/index.html
+tag/diabetes/index.html
+tag/diagnostic-models/index.html
+tag/diagrams-as-code/index.html
+tag/dialogue-model/index.html
+tag/differential-gene-expression/index.html
+tag/digital-archiving/index.html
+tag/digital-humanities/index.html
+tag/digital-libraries/index.html
+tag/digital-preservation/index.html
+tag/digital-repository/index.html
+tag/digital-technology/index.html
+tag/digital-tools/index.html
+tag/digital-trace-data/index.html
+tag/digitalisation/index.html
+tag/direct-replication/index.html
+tag/discovery/index.html
+tag/dissertation/index.html
+tag/diveristy/index.html
+tag/diversity-in-academia/index.html
+tag/diversity-inclusion/index.html
+tag/diversity/index.html
+tag/diy-science/index.html
+tag/docker/index.html
+tag/documentation/index.html
+tag/double-dipping/index.html
+tag/down-sample/index.html
+tag/drug-administration/index.html
+tag/drug-development/index.html
+tag/drug-discovery/index.html
+tag/drug-research-and-development/index.html
+tag/drug-therapy/index.html
+tag/drugs/index.html
+tag/dsc-mri/index.html
+tag/due-process/index.html
+tag/e-commerce/index.html
+tag/e-government/index.html
+tag/early-career-researcher/index.html
+tag/early-career-researchers/index.html
+tag/earlycareerresearchers/index.html
+tag/earth-day/index.html
+tag/ecological-momentary-assessment/index.html
+tag/ecology-and-environmental-sciences/index.html
+tag/ecology/index.html
+tag/economic-journals/index.html
+tag/economics/index.html
+tag/ecosystems/index.html
+tag/editor/index.html
+tag/editorial-independence/index.html
+tag/editorial-policy/index.html
+tag/editorial/index.html
+tag/education-fees/index.html
+tag/education-research/index.html
+tag/education/index.html
+tag/educational-efficiency/index.html
+tag/educational-psychology/index.html
+tag/educational-research/index.html
+tag/educational-resources/index.html
+tag/educational-technology/index.html
+tag/educators/index.html
+tag/eeg/index.html
+tag/effect-estimation/index.html
+tag/effect-size/index.html
+tag/effect-sizes/index.html
+tag/electronic-health-records/index.html
+tag/electronic-lab-notebooks/index.html
+tag/electrophysiology/index.html
+tag/email-newsletter/index.html
+tag/email-subscription/index.html
+tag/embedded-pragmatic-clinical-trials/index.html
+tag/embodied-cognition/index.html
+tag/empirical-legal-research/index.html
+tag/empirical-studies-in-hci/index.html
+tag/energy-research/index.html
+tag/enrichment-analysis/index.html
+tag/environmental-impact/index.html
+tag/environmental-policy/index.html
+tag/environmental-public-health/index.html
+tag/environmental-stress/index.html
+tag/eosc/index.html
+tag/epidemiology/index.html
+tag/epistemic-and-disciplinary-diversity-in-open-research/index.html
+tag/epistemic-diversity/index.html
+tag/epistemic-injustice/index.html
+tag/epistemic-intellectual-humility/index.html
+tag/epistemic-iteration/index.html
+tag/epistemology/index.html
+tag/equality/index.html
+tag/equity-and-inclusion/index.html
+tag/equity-diversity-inclusion-edi/index.html
+tag/equity-in-academia/index.html
+tag/equity-in-nursing-education/index.html
+tag/equity-inclusion-dei/index.html
+tag/equity/index.html
+tag/equivalence-testing/index.html
+tag/erp/index.html
+tag/error-prevention/index.html
+tag/error-rate/index.html
+tag/error-statistics/index.html
+tag/escape-room/index.html
+tag/essentialism/index.html
+tag/estimation/index.html
+tag/ethical-redlines/index.html
+tag/ethics-of-research/index.html
+tag/ethics-review/index.html
+tag/ethics-training/index.html
+tag/ethics/index.html
+tag/ethnography/index.html
+tag/europe/index.html
+tag/evaluation/index.html
+tag/evidence-based-practice/index.html
+tag/evidence-based-practices/index.html
+tag/evidence-informed-policy-making/index.html
+tag/evidence-interpretation/index.html
+tag/evidence/index.html
+tag/evolution-of-science/index.html
+tag/evolutionary-biology/index.html
+tag/evolutionary-ecology/index.html
+tag/evolutionary-genetics/index.html
+tag/exact-replication/index.html
+tag/excess-statistical-significance/index.html
+tag/exemplars/index.html
+tag/existing-data/index.html
+tag/experiment/index.html
+tag/experimental-bias/index.html
+tag/experimental-design-details/index.html
+tag/experimental-design/index.html
+tag/experimental-economics/index.html
+tag/experimental-psychology/index.html
+tag/experimentation/index.html
+tag/experiments/index.html
+tag/exploration/index.html
+tag/exploratory-analyses/index.html
+tag/exploratory-analysis/index.html
+tag/exploratory-hypotheses/index.html
+tag/exploratory-research/index.html
+tag/exploratory/index.html
+tag/external-validity/index.html
+tag/extinction/index.html
+tag/extrinsic-factors/index.html
+tag/eye-movements/index.html
+tag/fabbs/index.html
+tag/factorial-design/index.html
+tag/faculty-development/index.html
+tag/failure/index.html
+tag/fair-data-management/index.html
+tag/fair-data-materials/index.html
+tag/fair-data-principles/index.html
+tag/fair-data/index.html
+tag/fair-dmps/index.html
+tag/fair-principles/index.html
+tag/fair/index.html
+tag/fake-science/index.html
+tag/false-belief/index.html
+tag/false-negative/index.html
+tag/false-positive/index.html
+tag/false-positives/index.html
+tag/false-preregistration/index.html
+tag/falsification/index.html
+tag/falsificationism/index.html
+tag/familywise-error-rate/index.html
+tag/federal-policy/index.html
+tag/federal-research/index.html
+tag/feedback/index.html
+tag/field-tests/index.html
+tag/fieldwork/index.html
+tag/finance/index.html
+tag/financial/index.html
+tag/flash-mob/index.html
+tag/flourishing/index.html
+tag/flowcharts/index.html
+tag/flu/index.html
+tag/foreign-countries/index.html
+tag/forensics/index.html
+tag/forking-paths/index.html
+tag/formal-theory/index.html
+tag/foss/index.html
+tag/foster/index.html
+tag/framework/index.html
+tag/fraud/index.html
+tag/frequentist/index.html
+tag/funder-behaviour/index.html
+tag/funder-policies/index.html
+tag/funders/index.html
+tag/funding-agencies/index.html
+tag/funding-decision-processes/index.html
+tag/funding/index.html
+tag/gambling-studies/index.html
+tag/gambling/index.html
+tag/game-based-learning/index.html
+tag/gaming/index.html
+tag/gapminder/index.html
+tag/gelbox/index.html
+tag/gels/index.html
+tag/gender-bias/index.html
+tag/gene-expression/index.html
+tag/generalizability/index.html
+tag/genetically-modified-animals/index.html
+tag/genetics/index.html
+tag/genome-wide-association-study/index.html
+tag/genomic-characterization/index.html
+tag/genomic-libraries/index.html
+tag/genomic-medicine/index.html
+tag/genomic-sem/index.html
+tag/genomics/index.html
+tag/geographic-data/index.html
+tag/geosciences/index.html
+tag/geospatial/index.html
+tag/german-network-university-medicine/index.html
+tag/gerontology/index.html
+tag/gis/index.html
+tag/git/index.html
+tag/github/index.html
+tag/gitlab/index.html
+tag/global-challenges/index.html
+tag/global-education/index.html
+tag/global-health/index.html
+tag/global-lab/index.html
+tag/global-south/index.html
+tag/glossary/index.html
+tag/gnwt/index.html
+tag/google/index.html
+tag/government/index.html
+tag/governmental-policies/index.html
+tag/graduate-education/index.html
+tag/graduate-research/index.html
+tag/graduate-training/index.html
+tag/grant-writing/index.html
+tag/grants/index.html
+tag/graph-theory/index.html
+tag/grassroots-network/index.html
+tag/guide/index.html
+tag/guidelines-for-open-science/index.html
+tag/guidelines/index.html
+tag/guiding-principles/index.html
+tag/habits/index.html
+tag/hacking/index.html
+tag/handbook/index.html
+tag/harassment/index.html
+tag/hardware/index.html
+tag/harking/index.html
+tag/harvard-medical-school/index.html
+tag/harvard/index.html
+tag/health-care-policy/index.html
+tag/health-disparities/index.html
+tag/health-economics-and-outcomes-research-heor/index.html
+tag/health-economics/index.html
+tag/health-for-all/index.html
+tag/health-psychology/index.html
+tag/health-research/index.html
+tag/health-risk-analysis/index.html
+tag/health/index.html
+tag/healthcare/index.html
+tag/hearing/index.html
+tag/helmholz-open-science/index.html
+tag/heuristics/index.html
+tag/hidden-curriculum/index.html
+tag/higher-education-costs/index.html
+tag/higher-education/index.html
+tag/higher-order-theories/index.html
+tag/hiring/index.html
+tag/history-of-open-source/index.html
+tag/history-of-psychology/index.html
+tag/history-of-science/index.html
+tag/history/index.html
+tag/human-behaviour/index.html
+tag/human-centered-computing/index.html
+tag/human-computer-interaction-hci/index.html
+tag/human-computer-interaction/index.html
+tag/human-genomics/index.html
+tag/human-mind/index.html
+tag/human-variation/index.html
+tag/hypothesis-generating/index.html
+tag/hypothesis-registry/index.html
+tag/hypothesis-testing/index.html
+tag/idiographic/index.html
+tag/iit/index.html
+tag/image-processing/index.html
+tag/imagej-macro/index.html
+tag/immunoblots/index.html
+tag/impact-factor/index.html
+tag/implementability/index.html
+tag/in-vivo-data/index.html
+tag/in-vivo-studies/index.html
+tag/inbred-strains/index.html
+tag/incentives/index.html
+tag/inclusion-and-accessibility/index.html
+tag/inclusion/index.html
+tag/inclusive-research-and-education/index.html
+tag/inclusive-scientific-practices/index.html
+tag/inclusivity-in-academia/index.html
+tag/inclusivity/index.html
+tag/index.html
+tag/indigenous-data-governance/index.html
+tag/indigenous-peoples/index.html
+tag/inductive-risk/index.html
+tag/industry/index.html
+tag/inequality/index.html
+tag/infant-research/index.html
+tag/inference/index.html
+tag/influenza/index.html
+tag/information-acquisition/index.html
+tag/information-literacy/index.html
+tag/information-science/index.html
+tag/information-systems/index.html
+tag/information-technology/index.html
+tag/informed-consent/index.html
+tag/infra-finder/index.html
+tag/infrastructure/index.html
+tag/innovation/index.html
+tag/innovations/index.html
+tag/inside-your-classroom/index.html
+tag/institutional-expenses/index.html
+tag/institutional-policies/index.html
+tag/institutional-policy/index.html
+tag/institutional-repositories/index.html
+tag/institutional-values/index.html
+tag/instruction-principles/index.html
+tag/instrumental-variable-analysis/index.html
+tag/instrumentation/index.html
+tag/integrative-pluralism/index.html
+tag/integrity/index.html
+tag/interaction-design/index.html
+tag/interaction-effects/index.html
+tag/interaction/index.html
+tag/interactive/index.html
+tag/interdisciplinary/index.html
+tag/international-initiatives/index.html
+tag/internationalization-of-psychology/index.html
+tag/internet/index.html
+tag/interoperability/index.html
+tag/interpersonal-civility/index.html
+tag/intersectionality/index.html
+tag/intervention-research/index.html
+tag/intimidation/index.html
+tag/introduction/index.html
+tag/introductory-guide/index.html
+tag/introductory/index.html
+tag/ircc-official-data/index.html
+tag/ismrm-osipi/index.html
+tag/it-infrastructure/index.html
+tag/italian-people/index.html
+tag/jasp/index.html
+tag/job/index.html
+tag/journal-club/index.html
+tag/journal-editing/index.html
+tag/journal-editorial-practices/index.html
+tag/journal-editors/index.html
+tag/journal-impact-factor/index.html
+tag/journal-operations/index.html
+tag/journal-reviewer/index.html
+tag/journal/index.html
+tag/journalism/index.html
+tag/journals/index.html
+tag/json-schema/index.html
+tag/json/index.html
+tag/junk-fees/index.html
+tag/jupyter-notebooks/index.html
+tag/jupyter/index.html
+tag/just-in-bello/index.html
+tag/justice/index.html
+tag/karen-rambo-hernandez/index.html
+tag/kindness/index.html
+tag/knowledge-dissemination/index.html
+tag/knowledge-graphs/index.html
+tag/knowledge-rights/index.html
+tag/knowledge/index.html
+tag/lab-exercises/index.html
+tag/lab-group/index.html
+tag/lab-management/index.html
+tag/labor/index.html
+tag/laboratory-automation/index.html
+tag/lakatos/index.html
+tag/language-access/index.html
+tag/language/index.html
+tag/large-collaborations/index.html
+tag/law/index.html
+tag/leadership/index.html
+tag/learning/index.html
+tag/leave-one-out/index.html
+tag/lecture/index.html
+tag/legal-issues/index.html
+tag/legislation/index.html
+tag/lesson-bank/index.html
+tag/lesson-plans/index.html
+tag/leukemias/index.html
+tag/levels/index.html
+tag/lexicon/index.html
+tag/librarians/index.html
+tag/librarianship/index.html
+tag/licenses/index.html
+tag/licensing/index.html
+tag/life-sciences/index.html
+tag/lifespan-development/index.html
+tag/ligand-receptor-interactions/index.html
+tag/linear-regression-analysis/index.html
+tag/linguistics/index.html
+tag/linked-open-data/index.html
+tag/list-of-syllabi/index.html
+tag/literate-programming/index.html
+tag/literature-review/index.html
+tag/lived-experience/index.html
+tag/local-perspective/index.html
+tag/longitudinal-research/index.html
+tag/longitudinal-studies/index.html
+tag/longitudinal/index.html
+tag/low-and-middle-income-countries/index.html
+tag/lung-and-intrathoracic-tumors/index.html
+tag/lymphomas/index.html
+tag/machine-actionable/index.html
+tag/machine-learning/index.html
+tag/magnetic-resonance-imaging/index.html
+tag/make/index.html
+tag/malahanobis-distance/index.html
+tag/mammals/index.html
+tag/management/index.html
+tag/managerialism/index.html
+tag/mandatory-inclusion-of-raw-data/index.html
+tag/manipulation/index.html
+tag/manuscript-template/index.html
+tag/many-analysts/index.html
+tag/manylabs/index.html
+tag/marginalised-scholars/index.html
+tag/marginalized-scholars/index.html
+tag/margins-of-error/index.html
+tag/marketing/index.html
+tag/materials/index.html
+tag/math/index.html
+tag/mathematical-modeling/index.html
+tag/matlab/index.html
+tag/matt-makel/index.html
+tag/max-plack-institutes/index.html
+tag/meaningful-learning/index.html
+tag/measurement-properties/index.html
+tag/measurement-validity/index.html
+tag/measurement/index.html
+tag/median-absolute-deviation/index.html
+tag/medical-education/index.html
+tag/medical-facies/index.html
+tag/medical-journals/index.html
+tag/medical-laboratory-sciences/index.html
+tag/medical-publishing/index.html
+tag/medical-research/index.html
+tag/medicine-and-health-sciences/index.html
+tag/medicine/index.html
+tag/memory/index.html
+tag/mental-health-and-psychiatry/index.html
+tag/mentoring/index.html
+tag/mentorship/index.html
+tag/mermaid/index.html
+tag/mesa/index.html
+tag/mesenchymal-stem-cells/index.html
+tag/meta-analysis/index.html
+tag/meta-analyst/index.html
+tag/meta-data/index.html
+tag/meta-epidemiology/index.html
+tag/meta-hypothesis/index.html
+tag/meta-research/index.html
+tag/meta-science-replication-crisis/index.html
+tag/meta-science/index.html
+tag/meta-scientific-models/index.html
+tag/meta-scientific-research-design/index.html
+tag/meta-xcience/index.html
+tag/metadata-registration/index.html
+tag/metadata-standard/index.html
+tag/metadata/index.html
+tag/metaresearch/index.html
+tag/metascience/index.html
+tag/metatheoretical-calculcus/index.html
+tag/metatheory/index.html
+tag/methodological-pluralism/index.html
+tag/methodological-reform/index.html
+tag/methodological-reforms/index.html
+tag/methodological-statistical-issues/index.html
+tag/methodology/index.html
+tag/methods-sharing/index.html
+tag/methods/index.html
+tag/metrics/index.html
+tag/mice/index.html
+tag/microarrays/index.html
+tag/microgravity/index.html
+tag/microscopy/index.html
+tag/milgram-experiment/index.html
+tag/minimum-covariance-determinant/index.html
+tag/minimum-requirements/index.html
+tag/minoritized-doctoral-students/index.html
+tag/misconduct/index.html
+tag/missing-data/index.html
+tag/model-centric/index.html
+tag/modeling/index.html
+tag/module/index.html
+tag/molecular-characterization/index.html
+tag/monitor/index.html
+tag/moral-economy/index.html
+tag/motivated-reasoning/index.html
+tag/motivation/index.html
+tag/multi-laboratory-replications/index.html
+tag/multi-site-replications/index.html
+tag/multiomics/index.html
+tag/multiple-comparisons-per-family/index.html
+tag/multiple-testing/index.html
+tag/multiplicity/index.html
+tag/nasa/index.html
+tag/national-academies/index.html
+tag/national-infrastructure/index.html
+tag/national-policy/index.html
+tag/navigation/index.html
+tag/neoliberalism/index.html
+tag/neurodivergent-researchers/index.html
+tag/neurodiversity/index.html
+tag/neuroimaging/index.html
+tag/neuropsychiatric-disorders/index.html
+tag/neuropsychology/index.html
+tag/neuroscience-data/index.html
+tag/neuroscience/index.html
+tag/nhst/index.html
+tag/nih/index.html
+tag/nomothetic/index.html
+tag/non-academic/index.html
+tag/non-financial/index.html
+tag/non-weird-research/index.html
+tag/non-weird/index.html
+tag/noninvasive/index.html
+tag/nonreplicability/index.html
+tag/normative-methodologies/index.html
+tag/null-hypothesis-significance-test/index.html
+tag/null-hypothesis/index.html
+tag/null-results/index.html
+tag/nursing-textbooks/index.html
+tag/obedience/index.html
+tag/objective-subjective/index.html
+tag/objectivity/index.html
+tag/oblivion/index.html
+tag/observational-research/index.html
+tag/oecd/index.html
+tag/oer/index.html
+tag/ohdsi/index.html
+tag/older-adults/index.html
+tag/onboarding-materials/index.html
+tag/oncology/index.html
+tag/online-education/index.html
+tag/online-experiments/index.html
+tag/online-resource/index.html
+tag/online-teaching/index.html
+tag/ontologies/index.html
+tag/ontology/index.html
+tag/open-access-funding/index.html
+tag/open-access-policies/index.html
+tag/open-access-policy/index.html
+tag/open-access-publishing/index.html
+tag/open-access/index.html
+tag/open-activities/index.html
+tag/open-and-reproducible-science/index.html
+tag/open-code-policy/index.html
+tag/open-code/index.html
+tag/open-data/index.html
+tag/open-education-data/index.html
+tag/open-education-research/index.html
+tag/open-education/index.html
+tag/open-educational-practices/index.html
+tag/open-educational-resource/index.html
+tag/open-educational-resources-oer/index.html
+tag/open-educational-resources/index.html
+tag/open-hardware/index.html
+tag/open-infrastructure/index.html
+tag/open-lab/index.html
+tag/open-materials/index.html
+tag/open-microscopy/index.html
+tag/open-pedagogy/index.html
+tag/open-peer-review/index.html
+tag/open-policies/index.html
+tag/open-practices/index.html
+tag/open-qualitative-research/index.html
+tag/open-reporting/index.html
+tag/open-repository/index.html
+tag/open-research-community-accelerator-orca/index.html
+tag/open-research-training/index.html
+tag/open-research/index.html
+tag/open-resources/index.html
+tag/open-review/index.html
+tag/open-scholarship-guidelines/index.html
+tag/open-scholarship-policy/index.html
+tag/open-scholarship-practices/index.html
+tag/open-scholarship-terms/index.html
+tag/open-scholarship-tools-and-technologies/index.html
+tag/open-scholarship/index.html
+tag/open-science-aims/index.html
+tag/open-science-badges/index.html
+tag/open-science-community/index.html
+tag/open-science-education/index.html
+tag/open-science-framework/index.html
+tag/open-science-hardware/index.html
+tag/open-science-impact/index.html
+tag/open-science-initiatives/index.html
+tag/open-science-policies/index.html
+tag/open-science-policy/index.html
+tag/open-science-practices/index.html
+tag/open-science-research-lifecycle/index.html
+tag/open-science-retreat/index.html
+tag/open-science-strategies/index.html
+tag/open-science-training/index.html
+tag/open-science/index.html
+tag/open-sciences/index.html
+tag/open-software/index.html
+tag/open-source-drug-discovery/index.html
+tag/open-source-hardware/index.html
+tag/open-source-software/index.html
+tag/open-source/index.html
+tag/open-standards/index.html
+tag/open-textbook/index.html
+tag/open-theory/index.html
+tag/openness-in-research/index.html
+tag/openness-in-science/index.html
+tag/openness/index.html
+tag/openpractice/index.html
+tag/openrefine/index.html
+tag/openscience/index.html
+tag/opensesame/index.html
+tag/operational-definitions/index.html
+tag/optional-stopping/index.html
+tag/organizational-change/index.html
+tag/organizational-climate/index.html
+tag/organizational-sciences/index.html
+tag/organizations/index.html
+tag/organizing/index.html
+tag/osca-awards-2025/index.html
+tag/osca-awards/index.html
+tag/oscars/index.html
+tag/osf-collections/index.html
+tag/osf-project/index.html
+tag/osf/index.html
+tag/osfr/index.html
+tag/oskb/index.html
+tag/outcome-measurement-instrument/index.html
+tag/outcome-study/index.html
+tag/outcome-switching/index.html
+tag/outliers/index.html
+tag/outputs-reproducibility-research/index.html
+tag/overview-of-systematic-review/index.html
+tag/p-hacking/index.html
+tag/p-values/index.html
+tag/palliative-care/index.html
+tag/pandemic-preparedness/index.html
+tag/pandemic-response/index.html
+tag/pandemic/index.html
+tag/pandemics/index.html
+tag/paper-in-a-day/index.html
+tag/parkinson-disease/index.html
+tag/participants/index.html
+tag/participatory-research/index.html
+tag/passive-measurement/index.html
+tag/patents/index.html
+tag/patient-advocacy-organizations/index.html
+tag/patient-centered/index.html
+tag/paywall/index.html
+tag/pedagogical-resources/index.html
+tag/pedagogy/index.html
+tag/peer-community-in-research-reports/index.html
+tag/peer-revied/index.html
+tag/peer-review/index.html
+tag/performance-support/index.html
+tag/perfusion-imaging/index.html
+tag/perfusion/index.html
+tag/personal-criticism/index.html
+tag/personality-disorders/index.html
+tag/persuasion/index.html
+tag/pharmacoepidemiology/index.html
+tag/pharmacology/index.html
+tag/phase-i-clinical-investigation/index.html
+tag/phd-supervision/index.html
+tag/phd/index.html
+tag/phenotyping/index.html
+tag/philosophical-psychology/index.html
+tag/philosophy-of-science/index.html
+tag/philosophy/index.html
+tag/phylogenetics/index.html
+tag/physical-sciences/index.html
+tag/physics/index.html
+tag/pilot-studies/index.html
+tag/placebo/index.html
+tag/plain-text/index.html
+tag/plan-e/index.html
+tag/plan-s/index.html
+tag/planning/index.html
+tag/plant-authophagy/index.html
+tag/plant-electrical-signals/index.html
+tag/plant-physiology/index.html
+tag/plasma/index.html
+tag/pluripotent-stem-cells/index.html
+tag/pmi/index.html
+tag/podcast/index.html
+tag/policy-change/index.html
+tag/policy-changes/index.html
+tag/policy-issues/index.html
+tag/policy-makers/index.html
+tag/policy/index.html
+tag/policymaking/index.html
+tag/political-science/index.html
+tag/poor-code-quality/index.html
+tag/popper/index.html
+tag/population-estimates/index.html
+tag/positionality/index.html
+tag/positions/index.html
+tag/posititionality/index.html
+tag/positive-deviance/index.html
+tag/post-trial-access/index.html
+tag/power-analysis-tool/index.html
+tag/power-analysis/index.html
+tag/power-imbalance/index.html
+tag/power/index.html
+tag/prarking/index.html
+tag/pre-analysis-plan/index.html
+tag/pre-analysis-planning/index.html
+tag/pre-analysis-plans/index.html
+tag/pre-egistration/index.html
+tag/pre-planning/index.html
+tag/pre-registration-in-education-research/index.html
+tag/pre-registration-in-science/index.html
+tag/pre-registration-template/index.html
+tag/pre-registration/index.html
+tag/preclinical-randomized-controlled-trial/index.html
+tag/preclinical-research/index.html
+tag/prediction/index.html
+tag/predictions/index.html
+tag/predictive-models/index.html
+tag/predictivism/index.html
+tag/preprint/index.html
+tag/preprints-in-dental-research/index.html
+tag/preprints/index.html
+tag/preregistation/index.html
+tag/preregistering/index.html
+tag/preregistration-badges/index.html
+tag/preregistration-challenge/index.html
+tag/preregistration-templates/index.html
+tag/preregistration/index.html
+tag/prevention-science/index.html
+tag/primer/index.html
+tag/principles/index.html
+tag/prisma/index.html
+tag/privacy/index.html
+tag/probability-distribution/index.html
+tag/problem-of-generality/index.html
+tag/problematic-practices/index.html
+tag/product/index.html
+tag/professional-development/index.html
+tag/profiles/index.html
+tag/prognosis/index.html
+tag/prognostic-models/index.html
+tag/prognostic-prediction-model/index.html
+tag/programming-languages/index.html
+tag/programming/index.html
+tag/project-management/index.html
+tag/project-tulip/index.html
+tag/promotion/index.html
+tag/proposal/index.html
+tag/prospective-registration/index.html
+tag/protocol-sharing/index.html
+tag/protocols.io/index.html
+tag/protocols/index.html
+tag/pseudotime/index.html
+tag/psychedelics/index.html
+tag/psychiatric-genetics/index.html
+tag/psycholinguistics/index.html
+tag/psychological-attitudes/index.html
+tag/psychological-measures/index.html
+tag/psychological-research-methods/index.html
+tag/psychological-research/index.html
+tag/psychological-science/index.html
+tag/psychologists/index.html
+tag/psychology-education/index.html
+tag/psychology/index.html
+tag/psychometrics/index.html
+tag/psychopathology/index.html
+tag/psychotherapy/index.html
+tag/public-access/index.html
+tag/public-and-occupational-health/index.html
+tag/public-engagement/index.html
+tag/public-opinion/index.html
+tag/public-policy/index.html
+tag/public-science/index.html
+tag/public-sector/index.html
+tag/publication-bias/index.html
+tag/publication-ethics/index.html
+tag/publication-rate/index.html
+tag/publication/index.html
+tag/publish-or-perish-culture/index.html
+tag/publishers/index.html
+tag/publishing-formats/index.html
+tag/publishing-models/index.html
+tag/publishing-recommendations/index.html
+tag/publishing/index.html
+tag/publishinggovernment-funding-of-science/index.html
+tag/puzzle/index.html
+tag/python/index.html
+tag/qualitative-data/index.html
+tag/qualitative-inference/index.html
+tag/qualitative-method/index.html
+tag/qualitative-methods/index.html
+tag/qualitative-research-tools/index.html
+tag/qualitative-research/index.html
+tag/qualitative/index.html
+tag/quality-control/index.html
+tag/quality-of-publication/index.html
+tag/quantitative-methods/index.html
+tag/quantitative-psychology/index.html
+tag/quantitative-research-tools/index.html
+tag/quantitative-research/index.html
+tag/quantitative/index.html
+tag/questionable-metascience-practices/index.html
+tag/questionable-research-practice/index.html
+tag/questionable-research-practices/index.html
+tag/questionnaires/index.html
+tag/r-code/index.html
+tag/r-for-researchers/index.html
+tag/r-package/index.html
+tag/r/index.html
+tag/race-and-education/index.html
+tag/race/index.html
+tag/racialised-academics/index.html
+tag/radio-therapy/index.html
+tag/radiomics/index.html
+tag/randomised-controlled-trial/index.html
+tag/randomized-controlled-trials/index.html
+tag/randomized-experiment/index.html
+tag/randomized-trial/index.html
+tag/rap/index.html
+tag/rapid-evidence-generation/index.html
+tag/raspberry-pi/index.html
+tag/raunkiæran-shortfall/index.html
+tag/re-identification/index.html
+tag/reading-list/index.html
+tag/readings/index.html
+tag/real-world-data/index.html
+tag/real-world-evidence/index.html
+tag/reanalyssis/index.html
+tag/recommendations/index.html
+tag/record-alignment/index.html
+tag/recplication/index.html
+tag/referees/index.html
+tag/reflexivity/index.html
+tag/reform/index.html
+tag/regenerative-medicine/index.html
+tag/registered-report/index.html
+tag/registered-reporting/index.html
+tag/registered-reports-in-education-research/index.html
+tag/registered-reports/index.html
+tag/registration/index.html
+tag/registry/index.html
+tag/regulatory-exclusivity/index.html
+tag/reliability-of-findings/index.html
+tag/reliability/index.html
+tag/reliable-science/index.html
+tag/remote-lab/index.html
+tag/remote-learning/index.html
+tag/renv/index.html
+tag/repair/index.html
+tag/repeatability/index.html
+tag/replicability/index.html
+tag/replicable-science/index.html
+tag/replication-crisis/index.html
+tag/replication-data/index.html
+tag/replication-database/index.html
+tag/replication-in-education-research/index.html
+tag/replication-research/index.html
+tag/replication-studies/index.html
+tag/replication-types/index.html
+tag/replication/index.html
+tag/replications/index.html
+tag/reply/index.html
+tag/report-preregistration/index.html
+tag/report-writing/index.html
+tag/reporting-bias/index.html
+tag/reporting-checklists/index.html
+tag/reporting-completeness/index.html
+tag/reporting-guideline/index.html
+tag/reporting-guidelines/index.html
+tag/reporting/index.html
+tag/repositories/index.html
+tag/representacao-do-conhecimento/index.html
+tag/representation-in-science/index.html
+tag/reproducability/index.html
+tag/reproducibiity/index.html
+tag/reproducibility-and-replicability/index.html
+tag/reproducibility-challenges/index.html
+tag/reproducibility-crisis-and-credibility-revolution/index.html
+tag/reproducibility-crisis/index.html
+tag/reproducibility-knowledge/index.html
+tag/reproducibility-of-results/index.html
+tag/reproducibility-policy/index.html
+tag/reproducibility-project-cancer-biology/index.html
+tag/reproducibility-test/index.html
+tag/reproducibility/index.html
+tag/reproducible-analyses/index.html
+tag/reproducible-analysis/index.html
+tag/reproducible-research/index.html
+tag/reproducible-scholarship/index.html
+tag/reproducible-science/index.html
+tag/reproducible/index.html
+tag/reproduction/index.html
+tag/reprozip/index.html
+tag/research-administration/index.html
+tag/research-analysis/index.html
+tag/research-and-development/index.html
+tag/research-assessment/index.html
+tag/research-best-practices/index.html
+tag/research-collaboration/index.html
+tag/research-credibility/index.html
+tag/research-critique/index.html
+tag/research-culture/index.html
+tag/research-cycle/index.html
+tag/research-data-management-tools/index.html
+tag/research-data-management/index.html
+tag/research-data/index.html
+tag/research-design/index.html
+tag/research-equity/index.html
+tag/research-error/index.html
+tag/research-errors/index.html
+tag/research-ethics/index.html
+tag/research-evaluation/index.html
+tag/research-funding/index.html
+tag/research-grants/index.html
+tag/research-graphs/index.html
+tag/research-group/index.html
+tag/research-infrastructure/index.html
+tag/research-institutions/index.html
+tag/research-integration/index.html
+tag/research-integrity/index.html
+tag/research-laboratories/index.html
+tag/research-lifecycle/index.html
+tag/research-management/index.html
+tag/research-method/index.html
+tag/research-methodology/index.html
+tag/research-methods.-transparency/index.html
+tag/research-methods/index.html
+tag/research-misconduct/index.html
+tag/research-on-research/index.html
+tag/research-planning/index.html
+tag/research-policies/index.html
+tag/research-policy-monitoring/index.html
+tag/research-practice/index.html
+tag/research-practices/index.html
+tag/research-process/index.html
+tag/research-quality-assessment/index.html
+tag/research-quality/index.html
+tag/research-replication/index.html
+tag/research-reporting-guidelines/index.html
+tag/research-reports/index.html
+tag/research-retractions/index.html
+tag/research-rigor/index.html
+tag/research-skills/index.html
+tag/research-software/index.html
+tag/research-support-staff/index.html
+tag/research-support/index.html
+tag/research-tools/index.html
+tag/research-training/index.html
+tag/research-transparency/index.html
+tag/research-validity/index.html
+tag/research-waste/index.html
+tag/research-workflow-documentation/index.html
+tag/research-workflow/index.html
+tag/research/index.html
+tag/researcher-attitudes/index.html
+tag/researcher-degrees-of-freedom/index.html
+tag/researcher-development/index.html
+tag/researcher-discretion/index.html
+tag/researcher-engagement/index.html
+tag/researchers/index.html
+tag/researchersopen-scholarship-guidelines/index.html
+tag/resignation/index.html
+tag/resource-list/index.html
+tag/resource-navigation/index.html
+tag/resource-planning/index.html
+tag/resource/index.html
+tag/resources/index.html
+tag/respiratory-illness/index.html
+tag/responsibility/index.html
+tag/responsible-conduct-of-research/index.html
+tag/responsible-engagement/index.html
+tag/responsible-research-assessment/index.html
+tag/responsible-research-culture/index.html
+tag/responsible-research-practices/index.html
+tag/responsible-research/index.html
+tag/responsible-scholarship/index.html
+tag/responsible-science/index.html
+tag/restorative-practices/index.html
+tag/result-centric/index.html
+tag/results-blind-review/index.html
+tag/retraction-notifications/index.html
+tag/reusability/index.html
+tag/reuse/index.html
+tag/review-of-publications/index.html
+tag/review/index.html
+tag/reviewability/index.html
+tag/reviewer-guidelines/index.html
+tag/revision/index.html
+tag/rewards-and-recognition/index.html
+tag/rigor-enhancing-practices/index.html
+tag/rigor-icons/index.html
+tag/rigor/index.html
+tag/risk-assessment/index.html
+tag/risk-factors/index.html
+tag/rmarkdown/index.html
+tag/rna-seq/index.html
+tag/robis-assessment/index.html
+tag/robust-detection/index.html
+tag/robust-practices/index.html
+tag/robust-science/index.html
+tag/robustness-check/index.html
+tag/robustness/index.html
+tag/rodents/index.html
+tag/role/index.html
+tag/root-growth/index.html
+tag/rr/index.html
+tag/rstats/index.html
+tag/rstudio/index.html
+tag/rt2/index.html
+tag/runnable-papers/index.html
+tag/safety-studies/index.html
+tag/sample-size-justification/index.html
+tag/sample-size/index.html
+tag/sampling/index.html
+tag/samply/index.html
+tag/sanctions-screening/index.html
+tag/sanitation/index.html
+tag/sara-hart/index.html
+tag/scales/index.html
+tag/scandal/index.html
+tag/scholarly-communication/index.html
+tag/scholarly-communications/index.html
+tag/scholarly-practice/index.html
+tag/scholarly-publishing/index.html
+tag/scholars-attitudes/index.html
+tag/scholarship/index.html
+tag/school-psychology/index.html
+tag/science-as-a-social-system/index.html
+tag/science-communication/index.html
+tag/science-communicators/index.html
+tag/science-culture/index.html
+tag/science-diplomacy/index.html
+tag/science-for-progress-initiative/index.html
+tag/science-improvement/index.html
+tag/science-integrity/index.html
+tag/science-of-science/index.html
+tag/science-policy-and-economics/index.html
+tag/science-policy/index.html
+tag/science-reform/index.html
+tag/science/index.html
+tag/scientific-communication/index.html
+tag/scientific-community/index.html
+tag/scientific-data/index.html
+tag/scientific-funding/index.html
+tag/scientific-impact/index.html
+tag/scientific-improvement/index.html
+tag/scientific-integrity/index.html
+tag/scientific-journals/index.html
+tag/scientific-method/index.html
+tag/scientific-misconduct/index.html
+tag/scientific-norms/index.html
+tag/scientific-presentations/index.html
+tag/scientific-process/index.html
+tag/scientific-progress/index.html
+tag/scientific-publication/index.html
+tag/scientific-publishing/index.html
+tag/scientific-reform/index.html
+tag/scientific-rigor/index.html
+tag/scientific-rigour/index.html
+tag/scientists/index.html
+tag/scoping-review/index.html
+tag/scoring-tools/index.html
+tag/scott-peters/index.html
+tag/search-engine/index.html
+tag/secondary-analysis/index.html
+tag/secondary-data-analysis/index.html
+tag/secondary-data-preregistration/index.html
+tag/security/index.html
+tag/seed-dormancy/index.html
+tag/seed-germination/index.html
+tag/selective-reporting/index.html
+tag/self-reporting/index.html
+tag/sensorimotor-processing/index.html
+tag/sensory-processing/index.html
+tag/sequence-analysis/index.html
+tag/sequence-databases/index.html
+tag/sequential-risk-taking/index.html
+tag/series/index.html
+tag/serious-games/index.html
+tag/ses/index.html
+tag/severity/index.html
+tag/sexuality/index.html
+tag/shell/index.html
+tag/significance-testing/index.html
+tag/significance/index.html
+tag/simulation-learning/index.html
+tag/simulation/index.html
+tag/simulations/index.html
+tag/single-case-design/index.html
+tag/sips-2016/index.html
+tag/sleep/index.html
+tag/smaat/index.html
+tag/sneaked-references/index.html
+tag/social-and-behavioral-sciences/index.html
+tag/social-change/index.html
+tag/social-determinants-of-learning/index.html
+tag/social-impact/index.html
+tag/social-interaction/index.html
+tag/social-media/index.html
+tag/social-psychology/index.html
+tag/social-science/index.html
+tag/social-sciences/index.html
+tag/societal-impact/index.html
+tag/society/index.html
+tag/sociocultural/index.html
+tag/socioeconomic-status/index.html
+tag/socioeconomic/index.html
+tag/software-development/index.html
+tag/software-documentation/index.html
+tag/software-engineers/index.html
+tag/software-tools/index.html
+tag/software/index.html
+tag/source-code/index.html
+tag/source-verification/index.html
+tag/south-africa/index.html
+tag/space-medicine/index.html
+tag/space-research/index.html
+tag/spaceflight-biology-research/index.html
+tag/spaceflight/index.html
+tag/spanish-speaking-communities/index.html
+tag/spatial-transcriptomics/index.html
+tag/spatial/index.html
+tag/special-education/index.html
+tag/speech/index.html
+tag/sport-healthcare/index.html
+tag/spreadsheet-data-literacy/index.html
+tag/spreadsheets/index.html
+tag/springer-nature/index.html
+tag/sql/index.html
+tag/stakeholder-involvement/index.html
+tag/standardization/index.html
+tag/state-of-social-science-s3-survey/index.html
+tag/statistical-book/index.html
+tag/statistical-data/index.html
+tag/statistical-decisions/index.html
+tag/statistical-distributions/index.html
+tag/statistical-literacy/index.html
+tag/statistical-power/index.html
+tag/statistical-programming/index.html
+tag/statistical-theory/index.html
+tag/statistical-thinking/index.html
+tag/statistical-tools/index.html
+tag/statistics-activities/index.html
+tag/statistics-teaching/index.html
+tag/statistics/index.html
+tag/stem-graduate-education/index.html
+tag/stigma-reduction/index.html
+tag/stock-centers/index.html
+tag/strategic-goals/index.html
+tag/streamlit/index.html
+tag/structural-modeling/index.html
+tag/structured-data/index.html
+tag/student-assignments/index.html
+tag/student-engagement/index.html
+tag/student-research/index.html
+tag/student-wellbeing/index.html
+tag/students/index.html
+tag/study-design/index.html
+tag/study-planning/index.html
+tag/study-protocol/index.html
+tag/study-protocols/index.html
+tag/subgroup-analyses/index.html
+tag/subjectivity/index.html
+tag/subscription/index.html
+tag/summaries/index.html
+tag/summary-statistics/index.html
+tag/supervision/index.html
+tag/suppressed-data/index.html
+tag/survey-research/index.html
+tag/survey-tools/index.html
+tag/survey/index.html
+tag/surveys/index.html
+tag/sustainable-change/index.html
+tag/sustainable-development-goals/index.html
+tag/syllabus/index.html
+tag/symposium/index.html
+tag/systematic-barriers/index.html
+tag/systematic-mapping-review/index.html
+tag/systematic-review/index.html
+tag/systematic-reviews/index.html
+tag/systemic-barriers-in-academia/index.html
+tag/systems-immunology/index.html
+tag/tabular-data/index.html
+tag/taguette/index.html
+tag/taxonomy/index.html
+tag/tcim/index.html
+tag/teaching-activity/index.html
+tag/teaching-material/index.html
+tag/teaching-methods/index.html
+tag/teaching-practices/index.html
+tag/teaching-resource/index.html
+tag/teaching-resources/index.html
+tag/teaching/index.html
+tag/team-infrastructure-roles/index.html
+tag/team-science/index.html
+tag/technical-advance/index.html
+tag/technical-blogs/index.html
+tag/technical-content/index.html
+tag/technical-writings/index.html
+tag/technology/index.html
+tag/template/index.html
+tag/tenure/index.html
+tag/terminology/index.html
+tag/text-mining/index.html
+tag/textbook/index.html
+tag/textbooks/index.html
+tag/textual-congruence/index.html
+tag/the-netherlands/index.html
+tag/theft/index.html
+tag/theoretical-and-philosophical-psychology/index.html
+tag/theoretical-psychology/index.html
+tag/theoretical-virtue/index.html
+tag/theory-building/index.html
+tag/theory-crisis/index.html
+tag/theory-development/index.html
+tag/theory-testing/index.html
+tag/theory/index.html
+tag/thesis/index.html
+tag/three-ts/index.html
+tag/time-lapse-imaging/index.html
+tag/tissue-stem-cells/index.html
+tag/tone-debate/index.html
+tag/tool/index.html
+tag/tools/index.html
+tag/top-factor/index.html
+tag/top-guidelines/index.html
+tag/topguidelines/index.html
+tag/toxicology/index.html
+tag/traceability/index.html
+tag/training-and-education/index.html
+tag/training-modules/index.html
+tag/training/index.html
+tag/trait-based-ecology/index.html
+tag/transcriptome/index.html
+tag/transferability/index.html
+tag/transformative-agreement/index.html
+tag/transgenic-animals/index.html
+tag/translation/index.html
+tag/translational-research/index.html
+tag/transnational/index.html
+tag/transparecnt-and-openness-promotion/index.html
+tag/transparecy-indicators/index.html
+tag/transparency-and-openness-promotion/index.html
+tag/transparency-checklist/index.html
+tag/transparency/index.html
+tag/transparent-workflow/index.html
+tag/trial-registration/index.html
+tag/trust/index.html
+tag/trustworthiness-of-our-scientific-knowledge/index.html
+tag/trustworthiness/index.html
+tag/truth-value/index.html
+tag/tuberculosis/index.html
+tag/tutorial/index.html
+tag/type-i-error-rate-inflation/index.html
+tag/type-i-error-rate/index.html
+tag/type-i-errors/index.html
+tag/ukrn/index.html
+tag/uncertainty/index.html
+tag/unconference-2022/index.html
+tag/undergraduate-biology-education/index.html
+tag/undergraduate-preregistration-assignment/index.html
+tag/undergraduate-research/index.html
+tag/undergraduate-students/index.html
+tag/undergraduate-teaching/index.html
+tag/undergraduate-training/index.html
+tag/undergraduate/index.html
+tag/undue-citations/index.html
+tag/unesco-recommendations-on-open-science/index.html
+tag/unesco/index.html
+tag/united-states/index.html
+tag/universality-crisis/index.html
+tag/universities/index.html
+tag/unknown-unknowns/index.html
+tag/usa/index.html
+tag/validation/index.html
+tag/validity/index.html
+tag/values-based-academic-assessment/index.html
+tag/values-in-science/index.html
+tag/variability/index.html
+tag/verifiable-disclosure/index.html
+tag/version-control/index.html
+tag/vestibular/index.html
+tag/veteran-affairs/index.html
+tag/video/index.html
+tag/videos/index.html
+tag/virtual-laboratory/index.html
+tag/virtual-reality/index.html
+tag/visualisation/index.html
+tag/visualization/index.html
+tag/volunteering/index.html
+tag/vulnerable-populations/index.html
+tag/web-based-applications/index.html
+tag/web-scraping/index.html
+tag/website/index.html
+tag/weird-science/index.html
+tag/white-house-office-of-science-and-technology-policy-ostp/index.html
+tag/white-light/index.html
+tag/white-supremacy/index.html
+tag/whiteness/index.html
+tag/wikidata/index.html
+tag/wikiversity/index.html
+tag/wiley/index.html
+tag/workflow-tools/index.html
+tag/workload/index.html
+tag/workshop/index.html
+tag/writing-fraud/index.html
+tag/year-of-open-science/index.html
+tag/zombie-methodology/index.html
+tags/index.html
+tags/index.json
+teaching_os/PostEdu.webp
+teaching_os/PostEdu1.webp
+teaching_os/index.html
+testimonials/README
+testimonials/index.html
+testimonials/testimonials/AnaCarolinaMarinho.webp
+testimonials/testimonials/DrAndreaKis.webp
+testimonials/testimonials/MaxKorbmacher.webp
+testimonials/testimonials/RichardDushime.webp
+testimonials/testimonials/Roksana.webp
+testimonials/testimonials/leonie.webp
+welcome/index.html
diff --git a/scripts/rebrand/baseline/seo_heads.json b/scripts/rebrand/baseline/seo_heads.json
new file mode 100644
index 00000000000..3ef514f65dd
--- /dev/null
+++ b/scripts/rebrand/baseline/seo_heads.json
@@ -0,0 +1,3421 @@
+{
+"404.html": "876006ed85e4af80",
+"about/charity/index.html": "a87322077b70cfdf",
+"about/cite_us/index.html": "5c274fc4f19a364f",
+"about/community/index.html": "eab342e23c3b02f3",
+"about/confidential-advisor-ombuds/index.html": "2fcaf01275f5cb30",
+"about/get-involved/index.html": "dc22a81debb40624",
+"about/index.html": "ae98b10d8284b11a",
+"about/mission/index.html": "ae24c9d9768d3618",
+"about/page/2/index.html": "ae98b10d8284b11a",
+"about/partnerships/index.html": "0143f4257d9ef80b",
+"about/principles/index.html": "e7423c7a30cc040b",
+"about/steering-committee/index.html": "c91a261d1bfb5292",
+"about/teams/index.html": "7720262844ee378c",
+"about/us/index.html": "7ca7c95ceb890066",
+"about/visitors/index.html": "c7f4c532a8189083",
+"adopting/index.html": "ab878fcb0bece122",
+"ai-metascience/index.html": "1fab5706d9cd80f3",
+"authors/adam-partridge/index.html": "a775843eaec1c049",
+"authors/adira-daniel/index.html": "b3c24c9e1c08a7bc",
+"authors/alaa-aldoh/index.html": "7668c004ba7d60ef",
+"authors/aleksandra-lazic/index.html": "b0684233e2850fca",
+"authors/alexander-hart/index.html": "3fc522524fb1488f",
+"authors/alice-rees/index.html": "548079aca3a03f87",
+"authors/alicia-tamara-veersma-barredo/index.html": "e9e92d847d79ec6e",
+"authors/amanda-kay-montoya/index.html": "ab99f3943737069c",
+"authors/amani-aloufi/index.html": "fc45508bb622846f",
+"authors/amelie-bret/index.html": "01f0fffb67e3317b",
+"authors/amelie-gourdon/index.html": "4bffee3292dd3f21",
+"authors/ana-carolina-marinho/index.html": "4933a6b62d515db4",
+"authors/anna-meier/index.html": "77b53d3203a7fcc4",
+"authors/annalisa-myer/index.html": "87131ee720541e99",
+"authors/annalise-laplume/index.html": "8ad3001d6b78599a",
+"authors/aoife-omahony/index.html": "610a0960351789ff",
+"authors/ashley-blake/index.html": "4c2e9957e4740792",
+"authors/balazs-aczel/index.html": "f7f836dd29a663fb",
+"authors/ben-saunders/index.html": "2ed550dc287aaaf7",
+"authors/berit-t-barthelmes-msc/index.html": "98b92134892cb7f8",
+"authors/bethan-iley/index.html": "f29505041a135801",
+"authors/bradley-baker/index.html": "70319b10bab35d00",
+"authors/cass-gheoghe/index.html": "522770a9f451d810",
+"authors/catherine-laverty/index.html": "1387cde15bc70c2c",
+"authors/catia-oliveira/index.html": "b48efe264f5097df",
+"authors/charlotte-r-pennington/index.html": "fe54432f51a0ab8a",
+"authors/christopher-eaker/index.html": "ae638874f73a1ac7",
+"authors/ciara-egan/index.html": "d671a79c08917300",
+"authors/connor-keating/index.html": "2ba530ba34fb0c47",
+"authors/crystal-steltenpohl/index.html": "2b53a6f00e5d9357",
+"authors/daniela-duca/index.html": "c8d13b9c3117125a",
+"authors/david-moreau/index.html": "e2d22ec0a09e7a86",
+"authors/dermot-lynott/index.html": "232f30b856494a65",
+"authors/dushime-mudahera-richard/index.html": "c68399b875871653",
+"authors/eike-rinke/index.html": "51b67d2db5415223",
+"authors/filip-dechterenko/index.html": "d003a6a98d9c22de",
+"authors/flavio-azevedo/index.html": "954d312635789a3d",
+"authors/forrt/index.html": "7ffc142add671393",
+"authors/fotis-mystakopoulos-phd-student/index.html": "6c88e03ba3c13f53",
+"authors/gavin-leech/index.html": "b61d056fe217fa2c",
+"authors/gilad-feldman/index.html": "7bd70e01c0209f09",
+"authors/giorgia-andreolli/index.html": "5fcc4f688693f076",
+"authors/heather-urry/index.html": "4fd0eede3abba3e4",
+"authors/helena-hartmann/index.html": "741099afde9f9b70",
+"authors/henrik-schoenemann/index.html": "188db0be8804cfe1",
+"authors/index.html": "232a30e3d1654eb0",
+"authors/jacob-miranda/index.html": "0735c962a4bb3695",
+"authors/jade-pickering/index.html": "a7f82e8ca77910b6",
+"authors/james-bartlett/index.html": "1d6c33a9fad21264",
+"authors/jan-philipp-roer/index.html": "715390a98a6a86f5",
+"authors/jeef-lees/index.html": "2bd6bfea4f60bc4f",
+"authors/joanne-mccuaig/index.html": "4a2d93e2dd593ca7",
+"authors/john-shaw/index.html": "e831d7ea0734332c",
+"authors/jordan-wagge/index.html": "d78a8554c6938ca5",
+"authors/julia-pauquet/index.html": "67a2affd805759b7",
+"authors/julia-strand/index.html": "9e4a20cd1d2d12c9",
+"authors/julia-wolska/index.html": "8636b402f0b55419",
+"authors/justin-sulik/index.html": "8d9484c60e1f3492",
+"authors/kai-krautter/index.html": "acf463ee501d432e",
+"authors/kaili-chung/index.html": "d6d590840d5d3155",
+"authors/kamil-izydorczak/index.html": "2b7db6ec54ae8b2a",
+"authors/karen-matvienko-sikar/index.html": "6e1f9958cdb5db29",
+"authors/karolina-urbanska/index.html": "ddd42907341f40ce",
+"authors/kelly-lloyd/index.html": "832a37c46bc7ccae",
+"authors/kimberly-quinn/index.html": "e1abd0f71b582a71",
+"authors/laurel-standiford/index.html": "f077bc8547d5e6be",
+"authors/leticia-micheli/index.html": "036ad5d4133b8699",
+"authors/lorna-hamilton/index.html": "1d895558cff770d9",
+"authors/louise-bezuidenhout/index.html": "4c7710888b66e187",
+"authors/lukas-roseler/index.html": "79845e61c6cf7a91",
+"authors/lukas-wallrich/index.html": "4e5be14c20673141",
+"authors/lydia-riedl/index.html": "5bf93f66411deab2",
+"authors/madeleine-pownall/index.html": "d06bcd3545f7dd90",
+"authors/magdelna-grose-hodge/index.html": "1ee32486923ed1c8",
+"authors/mahmoud-elsherif/index.html": "5a3fbdd2009bf941",
+"authors/malika-ihle/index.html": "46ddaab05d68c370",
+"authors/markus-konkol/index.html": "1483e1de5369639a",
+"authors/martin-vasilev/index.html": "929b15d7938fd84d",
+"authors/max-korbmacher/index.html": "8d67e66ad0518048",
+"authors/meera-chandra/index.html": "8df7d699c79d26fc",
+"authors/mehdi-goughari/index.html": "9d29b2e9d6e6269a",
+"authors/meng-liu/index.html": "1d563e372643e5cf",
+"authors/mike-galang/index.html": "4afefcd6e0e1f1e8",
+"authors/monica-gonzales-marquez/index.html": "98531a4cae739910",
+"authors/myriam-baum/index.html": "5304e6abc0ad7417",
+"authors/nihan-albayrak-aydemir/index.html": "1f88189d6a64b0dc",
+"authors/olly-robertson/index.html": "2d29dcac48bc5842",
+"authors/patrick-s-forscher/index.html": "ccbad35ccd72f1b0",
+"authors/priya-silverstein/index.html": "7007921f36ea98c5",
+"authors/rachel-heyard/index.html": "b55836bfccbb793c",
+"authors/rachel-renbarger/index.html": "48895f4b2c3b86e9",
+"authors/sam-parsons/index.html": "da19be85537fd886",
+"authors/sam-westwood/index.html": "773530adb644cb04",
+"authors/samantha-tyler/index.html": "20b5dc7e3e9b76b7",
+"authors/samuel-alarie/index.html": "9794d3493e6189e5",
+"authors/samuel-guay/index.html": "cf41717bb8f9e17f",
+"authors/sandra-grinschgl/index.html": "82b9eb54bfa45d92",
+"authors/sara-lil-middleton/index.html": "4fda7d2d6aac4657",
+"authors/sarah-a-sauve/index.html": "c5dfb6bfee8b9b4c",
+"authors/sarah-ashcroftjones/index.html": "0d8c1ce6dd702023",
+"authors/sau-chin-chen/index.html": "3c0c380321ed57e7",
+"authors/shilaan-alzahawi/index.html": "f5e334d684e08eb1",
+"authors/siu-kit-yeung/index.html": "3505bc382e436b76",
+"authors/sonia-rishi/index.html": "d6b74db2ba78933b",
+"authors/stephanie-zellers/index.html": "438dc51426a0d464",
+"authors/steven-verheyen/index.html": "791544fe8a4878b7",
+"authors/susanne-vogel/index.html": "68201b7ec934fb29",
+"authors/tamara-kalandadze/index.html": "30fb302bddfdc407",
+"authors/tamara-marques/index.html": "595f2847d827bcf2",
+"authors/thomas-rhys-evans/index.html": "0b9fc999953c09af",
+"authors/timo-roettger/index.html": "86f9169e2e94080f",
+"authors/tina-lonsdorf/index.html": "d2c9c637f3375d2f",
+"authors/tom-heyman/index.html": "7a8f838ff1eb8170",
+"authors/waleed-alsubhi/index.html": "327ea42215bc734c",
+"authors/william-ngiam/index.html": "f1e738a2217325cd",
+"authors/yanna-weisberg/index.html": "3da5db60babd7d2e",
+"authors/yufang-yang/index.html": "d4d5c767b427ea92",
+"authors/zoe-flack/index.html": "6750b052faaf05f0",
+"authors/zoran-pavlovic/index.html": "7e0eb40862e40486",
+"awards/index.html": "f93b17ac0c461822",
+"awop/index.html": "7e9a3452fb901645",
+"booklet/index.html": "b19f21623d57aae8",
+"categories/index.html": "90d5d72739237c1a",
+"category/event/index.html": "f693630b4d9b52fb",
+"category/milestone/index.html": "085302c6943be601",
+"category/newsletter/index.html": "0e26cfa35648299b",
+"category/opportunity/index.html": "c6b60748520ddcf4",
+"category/resource/index.html": "ff8cc8571e74d83d",
+"citation-politics/index.html": "061c770434296b6f",
+"citation-politics/toolkit/index.html": "27915b855c693266",
+"clusters/cluster-1/index.html": "6712e4bca415b0ea",
+"clusters/cluster-10/index.html": "ac93f4ef64feb63b",
+"clusters/cluster-11/index.html": "7cb161ea4a35edcd",
+"clusters/cluster-2/index.html": "abaa6d900a217bce",
+"clusters/cluster-3/index.html": "bf8113f10f95d4a7",
+"clusters/cluster-4/index.html": "60ccff3c86c1c75b",
+"clusters/cluster-5/index.html": "6099546a9691734d",
+"clusters/cluster-6/index.html": "8a1cf39c5db9ef16",
+"clusters/cluster-7/index.html": "a74e5dd43b3cc6ce",
+"clusters/cluster-8/index.html": "dae684a438aede7e",
+"clusters/cluster-9/index.html": "a5e638972a4e239d",
+"clusters/index.html": "c59c531215c70542",
+"coc/index.html": "c958f305f7be838a",
+"community-map/index.html": "dea268e98001fb95",
+"contributor-analysis/index.html": "675591b786fadd70",
+"contributors/index.html": "55dd9bc8192829ae",
+"curated_resources/1-500-scientists-lift-the-lid-on-reprodu/index.html": "6fd11beef9e05f9e",
+"curated_resources/10-things-for-curating-reproducible-and/index.html": "ac5b40dcc5b14f8b",
+"curated_resources/1economics-270d-research-transparency-me/index.html": "bfb5764f28b00eae",
+"curated_resources/66th-helmholtz-open-science-online-semin/index.html": "03daa4d8f3a2025f",
+"curated_resources/7-easy-steps-to-open-science-an-annotate/index.html": "a4c839ebd8336d34",
+"curated_resources/a-21-word-solution/index.html": "73edcc346d0b122a",
+"curated_resources/a-bayesian-perspective-on-the-reproducib/index.html": "d25ec625f92f2fff",
+"curated_resources/a-call-for-open-science-in-forensics/index.html": "9838821fd2e86649",
+"curated_resources/a-case-for-data-dashboards-first-steps-w/index.html": "b0c0976308dd6c65",
+"curated_resources/a-cautionary-note-on-aggregation-in-educ/index.html": "85fbc4917deb88e3",
+"curated_resources/a-checklist-is-associated-with-increased/index.html": "29d419a33f5005d1",
+"curated_resources/a-collaborative-approach-to-infant-resea/index.html": "fff528cf4681fda0",
+"curated_resources/a-community-endorsed-open-source-lexicon/index.html": "1a824c6263cadb73",
+"curated_resources/a-consensus-based-transparency-checklist/index.html": "590f2c4f9026a91d",
+"curated_resources/a-critique-of-using-the-labels-confirmat/index.html": "169a4d599e04e0eb",
+"curated_resources/a-dataset-without-a-code-book-ethnograph/index.html": "d9246c3dcbca6eb6",
+"curated_resources/a-duty-to-describe-better-the-devil-you/index.html": "f6e8cd0fd269ef0b",
+"curated_resources/a-framework-for-understanding-an-open-sc/index.html": "2bbaaf6cc4fb01a0",
+"curated_resources/a-funder-imposed-data-publication-requir/index.html": "a55e3f439b016e80",
+"curated_resources/a-future-for-digital-public-goods-for-mo/index.html": "dd22f1f907851b3f",
+"curated_resources/a-general-course-outline-for-an-overview/index.html": "3493b2a925e80f84",
+"curated_resources/a-guide-for-social-science-journal-edito/index.html": "da441f9e24216c8a",
+"curated_resources/a-guide-for-social-science-journal-edito_2/index.html": "48b8cbc4c409c9f2",
+"curated_resources/a-guide-to-choosing-a-data-repository-fo/index.html": "47eda571094350d2",
+"curated_resources/a-guide-to-data-visualization-best-pract/index.html": "7fe80026ad7aa646",
+"curated_resources/a-guide-to-supporting-early-career-resea/index.html": "6c8b0106f8759748",
+"curated_resources/a-healthy-phd/index.html": "0fc274eff35825b1",
+"curated_resources/a-library-of-electrophysiological-respon/index.html": "290e0bd233e0edba",
+"curated_resources/a-manifesto-for-reproducible-science/index.html": "e0e79fff573ca785",
+"curated_resources/a-manifesto-for-rewarding-and-recognizin/index.html": "25b9d0095081fe1e",
+"curated_resources/a-minimal-metadata-set-mnms-to-repurpose/index.html": "3d0663ea7d0deb06",
+"curated_resources/a-multilab-preregistered-replication-of/index.html": "361566a45746c7fb",
+"curated_resources/a-pathway-to-strengthening-open-science/index.html": "0bffd2babe38df4d",
+"curated_resources/a-plan-to-develop-open-science-s-green-s/index.html": "40a7f3de931af36c",
+"curated_resources/a-plea-for-preregistration-in-personalit/index.html": "4d038fb0579a7498",
+"curated_resources/a-power-primer/index.html": "e70577cda6807078",
+"curated_resources/a-powerful-nudge-presenting-calculable-c/index.html": "c67d535263901c65",
+"curated_resources/a-primer-for-choosing-designing-and-eval/index.html": "eda70fd58ba68f0a",
+"curated_resources/a-primer-on-systematic-review-and-meta-a/index.html": "fe1b16af965289dd",
+"curated_resources/a-proposal-for-a-new-editorial-policy-in/index.html": "e6f07a81b5ab8029",
+"curated_resources/a-proposal-for-the-future-of-scientific/index.html": "8bd9b3ba86f00375",
+"curated_resources/a-public-option-for-clinical-trials-less/index.html": "9a3a032bded7aa8f",
+"curated_resources/a-reading-list-for-the-replicability-cri/index.html": "03a90cc786a3a4cb",
+"curated_resources/a-recipe-for-extremely-reproducible-enri/index.html": "8194c88ed69507db",
+"curated_resources/a-registered-report-survey-of-open-resea/index.html": "3e7819169db40125",
+"curated_resources/a-reliability-generalization-study-of-jo/index.html": "0fb68aa8e1519c76",
+"curated_resources/a-replication-crisis-in-methodological-r/index.html": "3142b5995bf514ea",
+"curated_resources/a-reputation-economy-how-individual-rewa/index.html": "c932c5bdfcabd108",
+"curated_resources/a-short-introduction-to-the-reproducibil/index.html": "8b65f243dca821ab",
+"curated_resources/a-short-personal-future-history-of-revol/index.html": "81b9de93fc23246b",
+"curated_resources/a-social-priming-data-set-with-troubling/index.html": "182db0ba3b7fb83d",
+"curated_resources/a-social-psychological-model-of-scientif/index.html": "2fbecbbb537700e4",
+"curated_resources/a-software-tool-for-removing-patient-ide/index.html": "100cefc00ba44ca7",
+"curated_resources/a-solomon-kurz-website/index.html": "320d44be19e81242",
+"curated_resources/a-step-by-step-guide-on-preregistration/index.html": "6bd94cab0162b9f4",
+"curated_resources/a-student-s-guide-to-open-science-using/index.html": "95e56917726939ee",
+"curated_resources/a-study-of-the-impact-of-data-sharing-on/index.html": "3bdf3e53e521cd74",
+"curated_resources/a-study-on-formalizing-the-knowledge-of/index.html": "eb210f00b23c7e0d",
+"curated_resources/a-survey-of-researchers-methods-sharing/index.html": "e2fe44c689f11e53",
+"curated_resources/a-survey-of-the-statistical-power-of-res/index.html": "7b874d48bb9a171e",
+"curated_resources/a-survey-on-how-preregistration-affects/index.html": "25accd29f9d97d66",
+"curated_resources/a-systematic-review-of-statistical-power/index.html": "ed542508a45d6406",
+"curated_resources/a-tale-of-two-papers/index.html": "29a76ca9a16ffe99",
+"curated_resources/a-test-of-the-diffusion-model-explanatio/index.html": "e87f934ce368aa21",
+"curated_resources/a-tutorial-on-cognitive-modeling-for-cog/index.html": "5c183c606fcfa78e",
+"curated_resources/a-unified-framework-to-quantify-the-cred/index.html": "7fed753aa35e59ef",
+"curated_resources/a-vast-graveyard-of-undead-theories-publ/index.html": "a6101047e54551e9",
+"curated_resources/abandon-statistical-significance/index.html": "dde74e5a176992df",
+"curated_resources/academic-fraud-is-a-waster-of-taxpayer-d/index.html": "b209ea9a25a604f1",
+"curated_resources/academic-jobs-in-the-us-vs-the-uk/index.html": "3118f381ea0ddb0e",
+"curated_resources/academic-research-in-the-21st-century-ma/index.html": "b9f617a494876ce6",
+"curated_resources/accessibility-data-curation-primer/index.html": "18393dfd9cbf0fc7",
+"curated_resources/accessible-feedback-in-research/index.html": "d04f9a3a8f79f157",
+"curated_resources/accuracy-of-effect-size-estimates-from-p/index.html": "32a0f628e1bd4372",
+"curated_resources/adapting-open-science-and-pre-registrati/index.html": "54788a43bdb9eb42",
+"curated_resources/addressing-the-grand-challenges-facing-p/index.html": "5870215657827854",
+"curated_resources/addressing-the-issue-of-representation-i/index.html": "8f8b94de9d73f3e3",
+"curated_resources/adjusting-for-publication-bias-in-metaan/index.html": "0e4a1c8542136544",
+"curated_resources/adopting-open-educational-resources-as-a/index.html": "965836d26c1af3b1",
+"curated_resources/adopting-principled-education/index.html": "33c906cab9cbfbfe",
+"curated_resources/advancing-data-honesty-in-experimental-b/index.html": "64cdb2c8085439a2",
+"curated_resources/advancing-equity-and-innovation-in-resea/index.html": "8fbcd4bb951f380d",
+"curated_resources/advancing-equity-in-academia-through-inn/index.html": "6df6859e242da84b",
+"curated_resources/advancing-oscm-scientific-knowledge-by-r/index.html": "4186db958fb2e407",
+"curated_resources/advocating-for-change-in-how-science-is/index.html": "1e09d197fb02b70d",
+"curated_resources/advocating-for-generalizability-acceptin/index.html": "c7f30b099acafdff",
+"curated_resources/agape-open-science-mooc/index.html": "c55ece501d6488a2",
+"curated_resources/ai-sanctions-screening-study-the-ofac-li/index.html": "16f221866621436d",
+"curated_resources/all-is-well-that-replicates-well-the-rep/index.html": "b35b9ab04b81cf0a",
+"curated_resources/all-the-weight-of-our-dreams-on-living-r/index.html": "5b40d734a0a65c51",
+"curated_resources/always-use-welch-t-test/index.html": "a7878ad5feb533fd",
+"curated_resources/an-agenda-for-purely-confirmatory-resear/index.html": "d06f9510d668d63e",
+"curated_resources/an-assessment-of-the-magnitude-of-effect/index.html": "f9b84953bcf11776",
+"curated_resources/an-excess-of-positive-results-comparing/index.html": "f8c2a82436c30c63",
+"curated_resources/an-exploratory-test-for-an-excess-of-sig/index.html": "cace115307f4dff6",
+"curated_resources/an-introduction-to-registered-replicatio/index.html": "219b21446e7fcc9d",
+"curated_resources/an-introduction-to-registered-reports-fo/index.html": "510c89cd20346349",
+"curated_resources/an-introduction-to-the-topic-of-open-sci/index.html": "73b0c8acbcd0001a",
+"curated_resources/an-open-investigation-of-the-reproducibi/index.html": "60fbc81b8edb0d93",
+"curated_resources/an-open-science-mri-database-of-over-100/index.html": "f326de91939515b8",
+"curated_resources/an-open-science-primer-for-social-scient/index.html": "fa2096cb96900034",
+"curated_resources/an-open-source-pharma-roadmap/index.html": "70a0437620c67af1",
+"curated_resources/analisis-y-visualizacion-de-datos-usando/index.html": "a0c1fbd7aaa3cb20",
+"curated_resources/analysis-of-open-data-and-computational/index.html": "81f1daad5cacaf07",
+"curated_resources/analytic-review-as-a-solution-to-the-mis/index.html": "58966012249c3a4b",
+"curated_resources/analytical-code-sharing-practices-in-bio/index.html": "d249eef2fd9e6225",
+"curated_resources/analyzing-education-data-with-open-scien/index.html": "46212a19607e5091",
+"curated_resources/announcing-datacite-s-first-public-data/index.html": "7c862b768a2a70d6",
+"curated_resources/applied-multiple-regression-correlation/index.html": "cbabcc1c914a83d0",
+"curated_resources/applied-open-science-talk-gsa-2020/index.html": "3ba638a127f50262",
+"curated_resources/applying-social-and-behavioral-science-t/index.html": "56f665d49ed0d986",
+"curated_resources/approaching-psychology-s-current-crises/index.html": "1d7a034482d2271c",
+"curated_resources/approaching-psychology-s-current-crises_2/index.html": "5adb7445f6276105",
+"curated_resources/are-choices-based-on-conditional-or-conj/index.html": "5cf10fd582e36a5a",
+"curated_resources/are-preregistration-and-registered-repor/index.html": "0df1d80ddbbe7d03",
+"curated_resources/are-psychology-journals-anti-replication/index.html": "222ca2d21478219d",
+"curated_resources/are-we-wasting-a-good-crisis-the-availab/index.html": "bdb8bc3820f96c9a",
+"curated_resources/ariadne-a-scientific-navigator-to-find-y/index.html": "6fee85d60c81efce",
+"curated_resources/ariadne-a-scientific-navigator-to-find-y_2/index.html": "fc42cb709458cdf7",
+"curated_resources/ariadne-scientific-resource-navigator/index.html": "21e40b06b1c86100",
+"curated_resources/arrested-theory-development-the-misguide/index.html": "5ec501e38b1a49cf",
+"curated_resources/arrive-has-not-arrived-support-for-the-a/index.html": "5820e76acbca7d8f",
+"curated_resources/artificial-intelligence-and-responsibili/index.html": "983e37818aa3bdb9",
+"curated_resources/ascent-foss-resource-list-for-global-sou/index.html": "e8bd9183d2646161",
+"curated_resources/asl-lexicon-and-reporting-recommendation/index.html": "98a7bde7f8f9290c",
+"curated_resources/assessing-data-availability-and-research/index.html": "487caf986ff15c01",
+"curated_resources/assessing-open-scholarship-practices-in/index.html": "db60cd5f63441762",
+"curated_resources/assessment-of-transparency-indicators-in/index.html": "74d660723814f02e",
+"curated_resources/association-between-trial-registration-a/index.html": "fd4c189c8f04192a",
+"curated_resources/at-what-sample-size-do-correlations-stab/index.html": "7bfc562e3258763c",
+"curated_resources/attitudes-towards-animal-study-registrie/index.html": "6c19a1d4ea318310",
+"curated_resources/authorization-of-animal-experiments-is-b/index.html": "2ff8502be316334d",
+"curated_resources/authorship-practices-must-evolve-to-supp/index.html": "75c5344f38c00f4e",
+"curated_resources/autistic-community-and-the-neurodiversit/index.html": "c5fb94049d333888",
+"curated_resources/automation-and-make/index.html": "71749943171531d0",
+"curated_resources/awesome-open-science-resources/index.html": "f8ce4caf898a3665",
+"curated_resources/awesome-reproducible-research/index.html": "76b4535fe8037875",
+"curated_resources/bacillus-calmette-guerin-vaccine-to-redu/index.html": "b83a742346875888",
+"curated_resources/bad-science-blog-on-the-guardian-webpage/index.html": "696c3f07e13eec28",
+"curated_resources/bad-science-log-post-guardian/index.html": "83db0416adcc0527",
+"curated_resources/badges-for-sharing-data-and-code-at-bios/index.html": "a577260dd01e13eb",
+"curated_resources/badges-to-acknowledge-open-practices-a-s/index.html": "4b9c3e9a818a1bfb",
+"curated_resources/barcelona-declaration-on-open-research-i/index.html": "888134e09e316248",
+"curated_resources/bargain-basement-bayes/index.html": "f47ef336055695af",
+"curated_resources/bayes-factor/index.html": "dc7b2882f410c151",
+"curated_resources/bayes-for-beginners-probability-and-like/index.html": "0c030500815c56ec",
+"curated_resources/bayes-rules-an-introduction-to-bayesian/index.html": "cf5575a6df814841",
+"curated_resources/bayesian-cognitive-modelling/index.html": "1698c5509c3a5703",
+"curated_resources/bayesian-inference-for-psychology-part-i/index.html": "309e847ed0d8198e",
+"curated_resources/bayesian-inference/index.html": "c6d3dc8e161c6f93",
+"curated_resources/being-a-reviewer-or-editor-for-registere/index.html": "a11b5cf76c149b9c",
+"curated_resources/ben-goldacre-battling-bad-science/index.html": "a3002ecc09581443",
+"curated_resources/benefits-of-open-and-high-powered-resear/index.html": "23930a2f071e0ddd",
+"curated_resources/berlin-oxford-summer-school-2020/index.html": "4c5b849bbe5aebec",
+"curated_resources/best-practices-in-data-analysis-and-shar/index.html": "4b6c8e3f9528b162",
+"curated_resources/best-research-practices-in-psychology-il/index.html": "873f6a84ba3324ba",
+"curated_resources/better-p-curves-making-p-curve-analysis/index.html": "ba32dcb82f78257c",
+"curated_resources/beyond-infrastructure-unpacking-the-comp/index.html": "4e6d4f4930eee4fe",
+"curated_resources/beyond-kindness-a-proposal-for-the-flour/index.html": "ec28164006f31f22",
+"curated_resources/beyond-power-calculations-assessing-type/index.html": "05a927d4bb6b0964",
+"curated_resources/biden-harris-administration-marks-the-an/index.html": "530b0e648ab5bd04",
+"curated_resources/big-correlations-in-little-studies-infla/index.html": "39c99ce32aecdabc",
+"curated_resources/big-team-science-initiatives-a-catalyst/index.html": "63cdf2a2b2580e42",
+"curated_resources/big-team-setup-guide/index.html": "d0d6ad4551f64632",
+"curated_resources/biomedical-data-repository-concepts-and/index.html": "f020d5047785b718",
+"curated_resources/biomedical-publishing-past-historic-pres/index.html": "1a4ebae0189a6035",
+"curated_resources/bite-size-science-and-its-undesired-side/index.html": "cb2cb22f5f06a5b3",
+"curated_resources/blaze-a-search-engine-and-email-subscrip/index.html": "d29ea51d5a846b58",
+"curated_resources/boas-praticas-em-ciencia/index.html": "1c7c4d9449191094",
+"curated_resources/bounded-research-ethicality-researchers/index.html": "a77df49b6757738e",
+"curated_resources/bradley-efron-frequentist-accuracy-of-ba/index.html": "ee110064ac9edc30",
+"curated_resources/brainlife-io-a-decentralized-and-open-so/index.html": "213a29e3a5509710",
+"curated_resources/breaking-free-how-preregistration-hurts/index.html": "f63e3795b706921a",
+"curated_resources/bridging-neurodiversity-and-open-scholar/index.html": "ec6de00c17d484e4",
+"curated_resources/bringing-institutional-multidisciplinary/index.html": "7cf93191f6aa5a9c",
+"curated_resources/bringing-the-pre-registration-revolution/index.html": "35e36595242fee29",
+"curated_resources/building-reproducible-bridges-to-cross-t/index.html": "7e815203443b829d",
+"curated_resources/building-transparency-and-reproducibilit/index.html": "59d193f69ebc8153",
+"curated_resources/calculating-and-reporting-effect-sizes-t/index.html": "dc488106c47ce144",
+"curated_resources/calculating-the-overlap-of-two-normal-di/index.html": "96662d30eb921cf8",
+"curated_resources/campbell-open-and-reproducible-science-s/index.html": "cacccc83acc73f30",
+"curated_resources/campbell-s-law-explains-the-replication/index.html": "323e98c7ad82c1a0",
+"curated_resources/can-a-good-theory-be-built-using-bad-ing/index.html": "228ee7b31d1f28b2",
+"curated_resources/can-you-trust-the-data-from-your-wearabl/index.html": "d401148ad4ac7c6f",
+"curated_resources/canadian-open-neuroscience-platform-conp/index.html": "e838cf2d7fad9733",
+"curated_resources/cancer-researchers-experiences-with-and/index.html": "1e31683dbac2a3e4",
+"curated_resources/capstone-advanced-general/index.html": "0a537b77b8936429",
+"curated_resources/care-principles-for-indigenous-data-gove/index.html": "401c40108dc66ed1",
+"curated_resources/cargo-cult-science/index.html": "a3c70c37901a3bf9",
+"curated_resources/carpentries-instructor-training/index.html": "91a3bd449cac6e06",
+"curated_resources/catalyzing-communities-of-research-rigou/index.html": "fec853250db01213",
+"curated_resources/catecor-an-open-science-shaded-truss-ext/index.html": "aaebbd03cd9c0b55",
+"curated_resources/challenges-and-opportunities-in-preregis/index.html": "46c700119f083b77",
+"curated_resources/champions-of-transparency-in-education-w/index.html": "5b71841f76a3ef8b",
+"curated_resources/change-starts-with-journal-editors-in-re/index.html": "c16059a87ed30df2",
+"curated_resources/changing-the-culture-of-peer-review-for/index.html": "7afcb83867a10d1e",
+"curated_resources/chaos-in-the-brickyard/index.html": "cfd73f86c25f623e",
+"curated_resources/characteristics-of-clinical-trials-regis/index.html": "4bdeda19acedd97b",
+"curated_resources/chatgpt-teaches-open-science/index.html": "8fcf80222a181afd",
+"curated_resources/choice-of-analysis-pathway-dramatically/index.html": "ced3cccad093d2f3",
+"curated_resources/choosing-prediction-over-explanation-in/index.html": "ea86f959ff996e37",
+"curated_resources/chrome-book-data-science/index.html": "055f9a12ece15cc0",
+"curated_resources/ciencia-aberta-e-reprodutivel/index.html": "a3791a0fbec6a358",
+"curated_resources/circle-of-willis-episode-with-simine-vaz/index.html": "8578b53cbc88756f",
+"curated_resources/citing-and-being-cited-data-code-edition/index.html": "4a26eb4205fc85da",
+"curated_resources/cjep-will-offer-open-science-badges/index.html": "062332ddf196e49c",
+"curated_resources/claims-about-scientific-rigour-require-r/index.html": "4447d6a9b35d1a73",
+"curated_resources/clinical-trial-registration-a-statement/index.html": "0bba582a66c0b0de",
+"curated_resources/clinical-trial-registration-and-reportin/index.html": "769fba22a6c5f79f",
+"curated_resources/clinical-trial-registration-looking-back/index.html": "c27efd8cb64048dc",
+"curated_resources/clinical-trial-registration-transparency/index.html": "3fe116fa24fb66bb",
+"curated_resources/clusters/index.html": "33f0ae9184dd28ce",
+"curated_resources/cognitive-science-stackexchange-site-for/index.html": "2663822160b7fd64",
+"curated_resources/common-statistical-tests-are-linear-mode/index.html": "d51a78b004f135b3",
+"curated_resources/community-consensus-on-core-open-science/index.html": "c5cc2621740ff664",
+"curated_resources/community-sourced-glossary-of-open-schol/index.html": "435f75cc88e63477",
+"curated_resources/compare-a-prospective-cohort-study-corre/index.html": "ea4e902160b36730",
+"curated_resources/comparing-analysis-blinding-with-preregi/index.html": "43ed078eb617c947",
+"curated_resources/comparing-published-scientific-journal-a/index.html": "57e212bc223c8fa5",
+"curated_resources/comparison-of-preregistration-platforms/index.html": "7c62a140be145f7d",
+"curated_resources/comparison-of-registered-and-published-o/index.html": "a8891cd25e470d64",
+"curated_resources/comparison-of-registered-and-published-p/index.html": "60872b388321dffb",
+"curated_resources/computational-social-science-is-growing/index.html": "066a7d278fe75bf3",
+"curated_resources/conducting-research-with-people-in-lower/index.html": "31a791d5aedaf67f",
+"curated_resources/conflicting-results-and-statistical-mall/index.html": "c783263dd03a9133",
+"curated_resources/connecting-research-tools-to-the-open-sc/index.html": "d2e86e8555f5f8fb",
+"curated_resources/consent-form-reporting-on-clinicaltrials/index.html": "f3953002687fe60a",
+"curated_resources/consequences-of-low-statistical-power/index.html": "a610f61125f78d5c",
+"curated_resources/consequences-of-prejudice-against-the-nu/index.html": "c1a79f18f2542007",
+"curated_resources/conservative-tests-under-satisficing-mod/index.html": "a73ee4e3f8d71392",
+"curated_resources/consolidated-reporting-guidelines-for-pr/index.html": "e7bd3b42e2efe333",
+"curated_resources/consort-statement-adherence-and-risk-of/index.html": "ef7ee8b0627cff1c",
+"curated_resources/constraints-on-generality-statements-are/index.html": "4d738fbe60df2d50",
+"curated_resources/construct-validation-in-social-and-perso/index.html": "f92bd3f552e9835a",
+"curated_resources/continuously-cumulating-meta-analysis-an/index.html": "b094336bf2dce3f9",
+"curated_resources/coping-with-common-phd-challenges-by-mak/index.html": "7209377e57056826",
+"curated_resources/correcting-for-bias-in-psychology-a-comp/index.html": "3ce606a28bd15c0e",
+"curated_resources/correlational-effect-size-benchmarks/index.html": "e6d2b6523da972c6",
+"curated_resources/cos-10-year-anniversary-starting-scaling/index.html": "ffebfe79535a5880",
+"curated_resources/cos-registered-reports-portal/index.html": "8ca94d3462680ce1",
+"curated_resources/course-materials-project-tier/index.html": "c2ed47b199b806f1",
+"curated_resources/course-on-open-science-101/index.html": "a68f490ff5476b9f",
+"curated_resources/course-syllabi-for-open-and-reproducible/index.html": "f587f92a526f56ad",
+"curated_resources/creating-an-inclusive-research-lab-with/index.html": "40cf028e74df7d9c",
+"curated_resources/credibility-of-preprints-an-interdiscipl/index.html": "e8393550df721f26",
+"curated_resources/credible-science-course/index.html": "81f363078ef7a22c",
+"curated_resources/crep-project/index.html": "f3dc99679cb38bb0",
+"curated_resources/crep-tutorials/index.html": "beb7a1516956713d",
+"curated_resources/crisis-research-fast-and-slow/index.html": "fb4cd6952e3b8648",
+"curated_resources/critical-metascience-articles/index.html": "955b8ca659cee3bc",
+"curated_resources/crossvalidated-stackexchange-site-for-st/index.html": "21c4131047e6a3fb",
+"curated_resources/crowdsourced-research-many-hands-make-ti/index.html": "3456d88c451d14d9",
+"curated_resources/crustybase-v-2-0-new-features-and-enhanc/index.html": "2f59ab6daaf3c351",
+"curated_resources/curate-science/index.html": "a898ca81679361b2",
+"curated_resources/curating-research-assets-a-tutorial-on-t/index.html": "eb033b7a917e3f1c",
+"curated_resources/current-incentives-for-scientists-lead-t/index.html": "3aec42e7d7f9de02",
+"curated_resources/curtailing-the-use-of-preregistration-a/index.html": "301cbd86269dfd1f",
+"curated_resources/dagitty/index.html": "6e8fa297ca81a475",
+"curated_resources/data-analysis-and-visualization-in-pytho/index.html": "e382bee1f7ba9bf3",
+"curated_resources/data-analysis-and-visualization-in-r-for/index.html": "3995fa8a5c6cebe4",
+"curated_resources/data-analysis-and-visualization-with-pyt/index.html": "d5a598f29486195a",
+"curated_resources/data-and-open-science/index.html": "8baa63e483dc1bb5",
+"curated_resources/data-availability-reusability-and-analyt/index.html": "198e0c8aecd1e3bc",
+"curated_resources/data-carpentry-for-biologists/index.html": "e683aff865ffcbda",
+"curated_resources/data-carpentry/index.html": "f0ac9148858542b6",
+"curated_resources/data-cleaning-and-management-using-openr/index.html": "e3b7c986ef0df3c4",
+"curated_resources/data-cleaning-with-openrefine-for-ecolog/index.html": "b1edb01f5ca56b26",
+"curated_resources/data-intro-for-archivists/index.html": "e0aea5779fb34fd7",
+"curated_resources/data-is-present-open-workshops-and-hacka/index.html": "6379c690f108b964",
+"curated_resources/data-management-and-data-sharing-in-psyc/index.html": "a79fb6a4654ed5e2",
+"curated_resources/data-management-for-psychological-scienc/index.html": "232b484f53663fd4",
+"curated_resources/data-management-plans-as-linked-open-dat/index.html": "9f9060b1424b76c4",
+"curated_resources/data-management-reproducibility/index.html": "477c77aa5def5b77",
+"curated_resources/data-management-with-sql-for-ecologists/index.html": "7704e650efd5b9ba",
+"curated_resources/data-management-with-sql-for-social-scie/index.html": "5735cf694d9a7634",
+"curated_resources/data-management/index.html": "a64f0bb0de2be2d2",
+"curated_resources/data-organization-in-spreadsheets-for-ec/index.html": "c43e35a2a069203e",
+"curated_resources/data-organization-in-spreadsheets-for-so/index.html": "3b0ceabd807505f1",
+"curated_resources/data-overuse-in-aging-research-emerging/index.html": "e73dc090d4bd180f",
+"curated_resources/data-peeking-without-p-hacking/index.html": "cde2a9e3d1a1b086",
+"curated_resources/data-policies-of-highly-ranked-social-sc/index.html": "d9d014b416df9fa9",
+"curated_resources/data-reuse-and-the-open-data-citation-ad/index.html": "04d2dfdaa29be81f",
+"curated_resources/data-sharing-by-scientists-practices-and/index.html": "92ea9ad08867ea74",
+"curated_resources/data-sharing-in-plos-one-an-analysis-of/index.html": "8cdbd8e378d2866c",
+"curated_resources/data-sharing-in-psychology-a-survey-on-b/index.html": "df3fe2c6d5c7f500",
+"curated_resources/data-sharing-is-caring/index.html": "5bf25be5f47d6a62",
+"curated_resources/data-sharing-practices-in-collaborative/index.html": "bf3b6320e3a8a1a6",
+"curated_resources/data-tutorial-power-analysis-using-g-pow/index.html": "6810f31296b2337a",
+"curated_resources/data-wrangling-and-processing-for-genomi/index.html": "72968e5bc3c2bdbe",
+"curated_resources/databases-and-sql/index.html": "e5d582f9d797f74d",
+"curated_resources/debate-statistical-analysis-plans-for-ob/index.html": "90b338a04a2b47b2",
+"curated_resources/decatastrophizing-research-irreproducibi/index.html": "f26b632af7c6c8e8",
+"curated_resources/decisions-decisions-decisions-an-ethnogr/index.html": "6258dcb29ae758ae",
+"curated_resources/declaration-of-common-standards-for-the/index.html": "da96255de2c0ac88",
+"curated_resources/declaration-of-helsinki-ethical-norm-in/index.html": "2835cff80e4d09d9",
+"curated_resources/decolonising-open-science-symposium-dism/index.html": "6449e702e5884687",
+"curated_resources/deep-dive-into-open-scholarship-collabor/index.html": "6225aaac65fbd8de",
+"curated_resources/deep-dive-into-open-scholarship-data-mat/index.html": "3e363014a43ef2ef",
+"curated_resources/deep-dive-into-open-scholarship-preprint/index.html": "3a8f304d05cb4508",
+"curated_resources/deep-dive-into-open-scholarship-preregis/index.html": "3b6c4603cfdd2f89",
+"curated_resources/deep-dive-on-open-practices-understandin/index.html": "57ff3e41065c4f3e",
+"curated_resources/deep-dive-on-open-practices-understandin_2/index.html": "140e88632dd9c919",
+"curated_resources/deep-dive-on-open-practices-understandin_3/index.html": "6a40490cb766ddc8",
+"curated_resources/deep-dive-on-open-practices-understandin_4/index.html": "b3f110027c6ce0f6",
+"curated_resources/defining-and-distinguishing-validity-int/index.html": "ec28312aab0f6559",
+"curated_resources/defining-and-growing-the-field-of-metasc/index.html": "5b6fe13274c54ac9",
+"curated_resources/defining-effect-sizes/index.html": "4b63072bc33c307a",
+"curated_resources/degrees-of-freedom-in-planning-running-a/index.html": "cf78433c6fa05798",
+"curated_resources/degrees-of-freedom-tutorial/index.html": "f24a45cd1105f547",
+"curated_resources/deletion-erasure-and-what-the-marker-tes/index.html": "5df25c8d3277e45a",
+"curated_resources/dementia-big-data-and-open-science/index.html": "1042156ba3195333",
+"curated_resources/demystifying-open-science-in-health-psyc/index.html": "623e6b77fee2f758",
+"curated_resources/demystifying-open-science-in-health-psyc_2/index.html": "842e5ffb4fe980de",
+"curated_resources/der-umgang-mit-forschungsdaten-im-fach-p/index.html": "b83075f3244b8ec0",
+"curated_resources/des-rap-book-reproducible-discrete-event/index.html": "14514b392438e888",
+"curated_resources/design-and-validation-of-a-conceptual-mo/index.html": "3cfb0afcc926fe2e",
+"curated_resources/designing-for-preregistration-a-user-cen/index.html": "67e6df654a78e3b6",
+"curated_resources/detecting-and-avoiding-likely-false-posi/index.html": "fe5680f158a9359d",
+"curated_resources/detecting-bad-science/index.html": "3a6b944fd619ee3b",
+"curated_resources/detecting-fraud-in-social-science/index.html": "3e43352f8fa356eb",
+"curated_resources/determinants-of-behaviour-and-their-effi/index.html": "c9de5ffcb55425bf",
+"curated_resources/developing-a-comprehensive-directory-of/index.html": "72aad8b2a4705ea9",
+"curated_resources/developing-a-wiki-integrated-workflow-to/index.html": "2ade0d3f2e15f4d5",
+"curated_resources/developing-an-open-educational-resource/index.html": "08f32ef4c27e805d",
+"curated_resources/developing-principled-pedagogies-an-open/index.html": "16211bbc7b1463d3",
+"curated_resources/development-of-an-open-access-virtual-bi/index.html": "8518d667f84916d4",
+"curated_resources/disclosing-and-managing-non-financial-co/index.html": "65c7d43579c92501",
+"curated_resources/discrepancies-in-the-registries-of-diet/index.html": "fe80a106b8e0ee28",
+"curated_resources/discrepancy-review-a-feasibility-study-o/index.html": "3c3eb42714cbd80c",
+"curated_resources/dissemination-and-publication-of-researc/index.html": "da5e4214b0fad283",
+"curated_resources/distribution-of-p-values-when-comparing/index.html": "8ed90667081595f0",
+"curated_resources/diversifying-research-methods-syllabi/index.html": "fd08fb0cb45f831e",
+"curated_resources/divorcing-white-supremacy-culture/index.html": "7a763ac751c0c182",
+"curated_resources/do-grant-proposal-texts-matter-for-fundi/index.html": "0136d0d3d4d65c6e",
+"curated_resources/do-organisms-need-an-impact-factor-citat/index.html": "782b73122b72cdba",
+"curated_resources/do-p-values-lose-their-meaning-in-explor/index.html": "422889da06a84190",
+"curated_resources/do-pre-analysis-plans-hamper-publication/index.html": "04e4c625db891f04",
+"curated_resources/do-pre-registration-and-pre-analysis-pla/index.html": "1157265c87faed69",
+"curated_resources/do-statistical-reporting-standards-affec/index.html": "16cae21834050eeb",
+"curated_resources/do-studies-of-statistical-power-have-an/index.html": "c669eb76471ddb0f",
+"curated_resources/does-preregistration-improve-the-credibi/index.html": "1870ae980ff228a8",
+"curated_resources/does-use-of-the-consort-statement-impact/index.html": "fac06860b53767eb",
+"curated_resources/draft-dated-2016-01-11-please-see-culear/index.html": "c03183f879892907",
+"curated_resources/dyadic-data-analysis-methodology-in-the/index.html": "b912cb49999e872b",
+"curated_resources/easy-preregistration-will-beneft-any-res/index.html": "6331af73fd4ddb05",
+"curated_resources/economic-statistics-with-calculus/index.html": "dd1eff5c240e95bf",
+"curated_resources/economics-lesson-with-stata/index.html": "cfdde3b63ff7030e",
+"curated_resources/editorial-bias-against-replication-resea/index.html": "f2ea91cf9d70d722",
+"curated_resources/editorial-bullying-an-exploration-of-act/index.html": "7d52f38fee2722a2",
+"curated_resources/editorial-introducing-surgery-open-scien/index.html": "289ebe50728b9574",
+"curated_resources/editorial-open-science-and-ethics/index.html": "578189253e014e08",
+"curated_resources/editorial-open-science-in-consciousness/index.html": "e4edd9b2956838ab",
+"curated_resources/editors-at-philosophy-public-affairs-res/index.html": "c7635e1e81a9acdc",
+"curated_resources/educational-psychologist-educational-psy/index.html": "d2585544b992cc70",
+"curated_resources/effect-of-open-peer-review-on-quality-of/index.html": "48b824d4495a7e31",
+"curated_resources/effect-of-population-heterogenization-on/index.html": "4ddf586ee73c076a",
+"curated_resources/effect-size-and-power-in-assessing-moder/index.html": "417bda894561e4c9",
+"curated_resources/effect-size-estimates-current-use-calcul/index.html": "fcbf4ce8ca9d6d07",
+"curated_resources/effect-size-estimation-in-neuroimaging/index.html": "0e9adf67c503ac61",
+"curated_resources/effect-size-guidelines-for-individual-di/index.html": "bd702f64a950d5ad",
+"curated_resources/effect-sizes-and-p-values-what-should-be/index.html": "3e2a33a0f5a8851e",
+"curated_resources/effect-sizes-why-when-and-how-to-use-the/index.html": "c582e7c8167941a9",
+"curated_resources/eight-common-but-false-objections-to-the/index.html": "2e176c88aafa0be0",
+"curated_resources/el-control-de-versiones-con-git/index.html": "cc44a438094c0efa",
+"curated_resources/eleven-strategies-for-making-reproducibl/index.html": "36c21a22b81afc81",
+"curated_resources/eleven-strategies-for-making-reproducibl_2/index.html": "b34223c335d4ea3a",
+"curated_resources/elsevier-title-level-pricing-dissecting/index.html": "a3aebe62b933dab7",
+"curated_resources/embedding-open-and-reproducible-science/index.html": "d35fc36139cbda27",
+"curated_resources/embedding-open-and-reproducible-science_2/index.html": "71047c2d61908a46",
+"curated_resources/embracing-open-science-paving-the-way-fo/index.html": "656af7e7a6488c31",
+"curated_resources/emerging-scientific-research-practices/index.html": "161907ff658126f2",
+"curated_resources/empirical-assessment-of-published-effect/index.html": "4265db48b103fbcc",
+"curated_resources/empirical-evaluation-of-very-large-treat/index.html": "42332bad976d8a58",
+"curated_resources/empirical-study-of-data-sharing-by-autho/index.html": "404288383731dc70",
+"curated_resources/enabling-data-discovery-with-the-astrobi/index.html": "ff11f2df57a88c1f",
+"curated_resources/enabling-open-science-initiatives-in-cli/index.html": "c54f2d50aff822af",
+"curated_resources/endorsement-of-open-science-practices-by/index.html": "c8b8179992e4bab0",
+"curated_resources/enhancing-public-access-to-the-results-o/index.html": "c1d139c89bebec96",
+"curated_resources/enhancing-reproducibility-through-rigor/index.html": "edf3d8463e99884a",
+"curated_resources/enhancing-transparency-of-the-research-p/index.html": "fc4f2aaf4c1a6699",
+"curated_resources/eplatypus-an-ecosystem-for-computational/index.html": "66590d009efe95cc",
+"curated_resources/equity-transparency-and-accountability-o/index.html": "9a37a4d4ea34b81b",
+"curated_resources/equivalence-testing-for-psychological-re/index.html": "510fc892cd4ff68c",
+"curated_resources/equivalence-tests-a-practical-primer-for/index.html": "6f963b4f53df3e79",
+"curated_resources/erroneous-analyses-of-interactions-in-ne/index.html": "cb9e08e6eaacb6dd",
+"curated_resources/error-tight-exercises-for-lab-groups-to/index.html": "b20a20055b2f2139",
+"curated_resources/establishing-trust-in-automated-reasonin/index.html": "256c7079397f776c",
+"curated_resources/estimating-the-prevalence-of-transparenc/index.html": "e7af23c18d6dc970",
+"curated_resources/estimating-the-reproducibility-of-psycho/index.html": "9aef16e979d5a697",
+"curated_resources/estimating-the-unobserved-hierarchical-b/index.html": "a30c8861d10d0414",
+"curated_resources/ethnography-vs-zombie-methodologies-what/index.html": "cb738dac14e5f5af",
+"curated_resources/european-sociological-association-journa/index.html": "e1f2c7b0a26b0070",
+"curated_resources/evading-open-science-the-black-box-of-st/index.html": "5248a84d02d53c59",
+"curated_resources/evaluating-content-related-validity-evid/index.html": "48b4e3263110207e",
+"curated_resources/evaluating-registered-reports-a-naturali/index.html": "9fe9299366dc069d",
+"curated_resources/evaluating-the-r-index-and-the-p-curve/index.html": "3c0e1f6ef8e1c860",
+"curated_resources/evaluating-what-works/index.html": "201cf897fb2e9030",
+"curated_resources/evaluation-of-transparency-and-openness/index.html": "a1fd0abb0781e2d4",
+"curated_resources/everything-hertz/index.html": "3b036b46f807191a",
+"curated_resources/everytool4u-json-to-csv-converter/index.html": "3f0bce9a904ada9d",
+"curated_resources/evidence-of-insufficient-quality-of-repo/index.html": "de43a5e6fc85fcec",
+"curated_resources/evolution-of-reporting-p-values-in-the-b/index.html": "45de0bca67f37b99",
+"curated_resources/excess-success-for-psychology-articles-i/index.html": "bb753fd7da8895ae",
+"curated_resources/expectations-for-replications-are-yours/index.html": "cd7e6130379a7cef",
+"curated_resources/experimentation-and-manipulation-with-pr/index.html": "23ddd2d24c2fb1f7",
+"curated_resources/experimenter-as-automaton-experimenter-a/index.html": "483b452085c5d047",
+"curated_resources/experiments-with-more-than-one-random-fa/index.html": "6a0c0b08967c1fe9",
+"curated_resources/exploratory-factor-analysis/index.html": "e917c5eeb83ebe86",
+"curated_resources/exploratory-hypothesis-tests-can-be-more/index.html": "193eacda97280437",
+"curated_resources/exploring-pre-registration-and-pre-analy/index.html": "a350015561aaead6",
+"curated_resources/exploring-regulatory-flexibility-to-crea/index.html": "ef7ec640c259768c",
+"curated_resources/express-entry-invited-candidates-reprodu/index.html": "29c77bfed5492a43",
+"curated_resources/fabbs-open-science-statement/index.html": "bec9945bcd9f51e1",
+"curated_resources/facilitating-open-science-practices-for/index.html": "9007293e8ba25ef7",
+"curated_resources/fact-sheet-biden-harris-administration-t/index.html": "4cc06dbdd179ae8d",
+"curated_resources/facts-are-more-important-than-novelty-re/index.html": "570c0e1c9e592b6f",
+"curated_resources/faculty-of-science-course-syllabus/index.html": "d64d19fbc3a013d0",
+"curated_resources/fair-health-data-in-the-national-and-int/index.html": "eb83aa797ae1fc76",
+"curated_resources/faking-science-a-true-story-of-academic/index.html": "f8d448a80017e5fc",
+"curated_resources/false-positive-citations/index.html": "0326d3d75f2b5569",
+"curated_resources/false-positive-psychology-undisclosed-fl/index.html": "8a595430dae7398b",
+"curated_resources/false-positive-psychology/index.html": "fb675c09fad962cb",
+"curated_resources/falsely-reassuring-analyses-of-all-p-val/index.html": "50ca501969cc9f71",
+"curated_resources/falsifiability-is-not-optional/index.html": "df76f6a5e59db5f0",
+"curated_resources/fearing-the-future-of-empirical-psycholo/index.html": "c296e521bb54725f",
+"curated_resources/feasibility-of-emulating-clinical-trials/index.html": "170fed68f5120630",
+"curated_resources/feeling-the-future-experimental-evidence/index.html": "43b3d6f4f0b5e6c9",
+"curated_resources/fifty-years-of-research-on-questionable/index.html": "ea544781c14d4800",
+"curated_resources/finding-evaluating-open-data/index.html": "f7e4df05e71a4c08",
+"curated_resources/fishing-commitment-and-communication-a-p/index.html": "c55d718ba2e3cc13",
+"curated_resources/five-selfish-reasons-to-work-reproducibl/index.html": "c01b1c5ef839e5c4",
+"curated_resources/flood-of-fake-science-forces-multiple-jo/index.html": "150026f87aeac073",
+"curated_resources/forcing-a-deterministic-frame-on-probabi/index.html": "a0619f0bbec6104e",
+"curated_resources/forrt-s-open-and-reproducible-science-sy/index.html": "116a37d710c71335",
+"curated_resources/forrt-summaries/index.html": "d43ebc96a4c751ec",
+"curated_resources/foster-open-science/index.html": "076dac623d635a29",
+"curated_resources/four-simple-recommendations-to-encourage/index.html": "bb70b65cd1457b54",
+"curated_resources/framework-for-value-based-academic-asses/index.html": "e6402f505fd2d1ec",
+"curated_resources/free-and-low-cost-resources-for-graduate/index.html": "309d8f770b1341dc",
+"curated_resources/from-mental-health-breakfast-interventio/index.html": "79c6f990a5adc06b",
+"curated_resources/from-policy-to-practice-lessons-learned/index.html": "062066f15a3ec0ab",
+"curated_resources/from-pre-registration-to-publication-a-n/index.html": "49b7004586634abf",
+"curated_resources/from-private-incentives-to-public-health/index.html": "72b1f87939eefd45",
+"curated_resources/funder-data-sharing-policies-overview-an/index.html": "d59a0f352b20da30",
+"curated_resources/g-power/index.html": "ed9f67f1f190dbaa",
+"curated_resources/game-based-approaches-for-research-skill/index.html": "4f5d45d05d096936",
+"curated_resources/game-based-approaches-in-the-teaching-an/index.html": "15155a691ff80fb3",
+"curated_resources/gelbox-open-source-software-to-improve-r/index.html": "a91d551a8ac74136",
+"curated_resources/general-principles-of-preclinical-study/index.html": "415169bcc88e735c",
+"curated_resources/generic-syllabus-maker/index.html": "292403dad96f5e44",
+"curated_resources/genomics-workshop-overview/index.html": "f1d29d6e973ead99",
+"curated_resources/geofor-a-collaborative-forensic-taphonom/index.html": "b95efc22f82d9fe8",
+"curated_resources/geospatial-workshop-overview/index.html": "edf63334b9f2cc6d",
+"curated_resources/getting-involved-with-top-factor/index.html": "2e65910b2ad0a4cc",
+"curated_resources/getting-ontologically-serious-about-the/index.html": "93f82a74d198cd70",
+"curated_resources/ggplot-colors-best-tricks-you-will-love/index.html": "1325b0826b70c5f4",
+"curated_resources/giving-community-psychology-away-a-case/index.html": "6c2d1613c7c605f8",
+"curated_resources/glimmpse/index.html": "5d33b08087ebb64f",
+"curated_resources/global-data-tracker-country-level-sanita/index.html": "4081cfaba2c969f1",
+"curated_resources/good-clinical-practice-improves-rigor-an/index.html": "264fc1693274fbf2",
+"curated_resources/good-enough-practices-in-scientific-comp/index.html": "0d700a6a8d1cd010",
+"curated_resources/good-science-bad-science/index.html": "3854e6892209360b",
+"curated_resources/good-supervision-and-mentoring-a-key-par/index.html": "10b8a2d20d426abc",
+"curated_resources/graduate-research-methods/index.html": "f6df54dfca3e2735",
+"curated_resources/graduate-students-need-more-quantitative/index.html": "4547fc17d35c93ce",
+"curated_resources/grand-challenge-social-psychology-withou/index.html": "bae4152360c6f436",
+"curated_resources/graphical-causal-models/index.html": "e9cbcdf59d436a84",
+"curated_resources/growth-from-uncertainty-understanding-th/index.html": "0a5be6fd5a2deb4a",
+"curated_resources/guide-your-students-to-become-better-res/index.html": "c38d134c7ad297b8",
+"curated_resources/guideline-for-reporting-systematic-revie/index.html": "3e17e1440752c199",
+"curated_resources/guidelines-for-evaluating-the-comparabil/index.html": "0fbfd788aac2b8d0",
+"curated_resources/guidelines-to-improve-internationalizati/index.html": "38be4de7f049c636",
+"curated_resources/habits-and-perceptions-regarding-open-sc/index.html": "2c4e8cedcd442bcd",
+"curated_resources/hack-your-way-to-scientific-glory/index.html": "3203a34d2657183c",
+"curated_resources/hail-the-impossible-p-values-evidence-an/index.html": "31b5d0cd10dc049a",
+"curated_resources/hark-no-more-on-the-preregistration-of-c/index.html": "43d2489844b100ce",
+"curated_resources/harking-how-badly-can-cherry-picking-and/index.html": "5703defc18f8286d",
+"curated_resources/harking-hypothesizing-after-the-results/index.html": "1b6ea49d655dbc31",
+"curated_resources/harry-potter-and-the-methods-of-reproduc/index.html": "084966baaa94c214",
+"curated_resources/harvard-professor-s-papers-contain-copie/index.html": "cfaa2ba15e703a07",
+"curated_resources/harvard-teaching-hospital-seeks-retracti/index.html": "da9b7a058c80ab8a",
+"curated_resources/hello-keyboard-combine-two-columns/index.html": "3719d18b4736a292",
+"curated_resources/heterogeneity-in-effect-size-estimates/index.html": "a12f84600f2a47f1",
+"curated_resources/heyutils-json-schema-validator/index.html": "db0a8c799cd5f981",
+"curated_resources/history-and-methods-of-psychology-syllab/index.html": "0406d84bc24247c4",
+"curated_resources/history-and-philosophy-of-psychology/index.html": "27fce6774880fae0",
+"curated_resources/history-repeating-guidelines-to-address/index.html": "ddd0aad845052418",
+"curated_resources/how-and-whether-to-teach-undergraduates/index.html": "9bff6a6881ca67c2",
+"curated_resources/how-can-preregistration-contribute-to-re/index.html": "9ef3753ba956ade0",
+"curated_resources/how-failure-has-made-mathematics-stronge/index.html": "112037c449757cb4",
+"curated_resources/how-flash-mobs-can-be-used-for-data-coll/index.html": "05c167e38c41ed27",
+"curated_resources/how-openness-facilitates-collaboration/index.html": "e9fc89628678c5ce",
+"curated_resources/how-racist-policing-took-over-american-c/index.html": "b3412af89751c5d0",
+"curated_resources/how-scientists-can-stop-fooling-themselv/index.html": "bc3a04660754be28",
+"curated_resources/how-significant-are-the-public-dimension/index.html": "306b1273b908122d",
+"curated_resources/how-to-classify-detect-and-manage-univar/index.html": "600fa29ffc49f114",
+"curated_resources/how-to-crack-pre-registration-toward-tra/index.html": "83dc55b846e0d38f",
+"curated_resources/how-to-make-data-open-stop-overlooking-l/index.html": "fbc58c3261b62a1c",
+"curated_resources/how-to-make-more-published-research-true/index.html": "6b3310553025e146",
+"curated_resources/how-to-produce-identify-and-motivate-rob/index.html": "9c4e48e2f63aa4e5",
+"curated_resources/how-to-test-ai-research-tools-a-repeatab/index.html": "2d334fc629314c2a",
+"curated_resources/how-to-use-osf-as-an-electronic-lab-note/index.html": "a80a96877d8ac377",
+"curated_resources/how-uk-science-is-failing-black-research/index.html": "fa7726083501a1dd",
+"curated_resources/i-fooled-millions-into-thinking-chocolat/index.html": "a8ddb3acf19acba6",
+"curated_resources/i-m-telling-you-my-story-not-publishing/index.html": "50f2e069444249a9",
+"curated_resources/identifying-participants-in-the-personal/index.html": "4f159c52b2e913e3",
+"curated_resources/iit-vs-gnwt-and-the-meaning-of-evidence/index.html": "1a616c2881c37f37",
+"curated_resources/image-processing-with-python/index.html": "6ee2b9454888abe1",
+"curated_resources/impact-of-genetic-background-and-experim/index.html": "957f684e06ed11a0",
+"curated_resources/improvements-since-the-replication-crisi/index.html": "9372c8e20068a302",
+"curated_resources/improving-evidence-based-practice-throug/index.html": "7773c24931433950",
+"curated_resources/improving-our-science-reproducibility-re/index.html": "655098d48df52dc1",
+"curated_resources/improving-our-science/index.html": "847188b8a1ab1a24",
+"curated_resources/improving-the-dependability-of-research/index.html": "5e57017711afc301",
+"curated_resources/improving-transparency-in-observational/index.html": "3c94265914843b72",
+"curated_resources/improving-your-statistical-inferences/index.html": "87c52c35d62d5af0",
+"curated_resources/in-praise-of-moderation-suggestions-for/index.html": "3eb966d9b82dcdc3",
+"curated_resources/in-praise-of-the-null-hypothesis-statist/index.html": "52850800534e1421",
+"curated_resources/inappropriate-fiddling-with-statistical/index.html": "f33a193a4fa4c056",
+"curated_resources/inconsistent-multiple-testing-correction/index.html": "297383dceb770997",
+"curated_resources/incorporating-ecological-momentary-asses/index.html": "335a248d9d033d52",
+"curated_resources/increasing-efficiency-of-preclinical-res/index.html": "a5c47bfc0dbeef7e",
+"curated_resources/increasing-the-transparency-of-systemati/index.html": "4c89cba2f3f24641",
+"curated_resources/increasing-transparency-through-a-multiv/index.html": "3ba4b0e795d06cec",
+"curated_resources/increasing-transparency-through-open-sci/index.html": "0890a384817609cb",
+"curated_resources/increasing-value-and-reducing-waste-addr/index.html": "a0ab2b4da408f721",
+"curated_resources/index.html": "27171a33c1a98472",
+"curated_resources/infra-finder-your-hub-for-finding-infras/index.html": "190393fcd10e8825",
+"curated_resources/innovations-in-graduate-education-progra/index.html": "59e52410ab33292b",
+"curated_resources/innovative-mentoring/index.html": "dd23d1e5b7a01a5a",
+"curated_resources/instead-of-playing-the-game-it-is-time-t/index.html": "06695a68dcf64f3f",
+"curated_resources/intellectual-humility-is-central-to-scie/index.html": "5aac4b85a795c8a3",
+"curated_resources/interactional-roles-and-social-actions-t/index.html": "3b34d4c04384c544",
+"curated_resources/internal-conceptual-replications-do-not/index.html": "69998b2d246eb34b",
+"curated_resources/international-collaboration-to-help-impl/index.html": "1c4b5354b7446cf3",
+"curated_resources/international-initiatives-to-enhance-awa/index.html": "4083cf276d0e114b",
+"curated_resources/interpreting-confidence-intervals/index.html": "a9794c83e53b1a8e",
+"curated_resources/interpreting-correlations-an-interactive/index.html": "a3b2eec739c7129e",
+"curated_resources/interpreting-effect-sizes-and-confidence/index.html": "a03b85bb2adbe7eb",
+"curated_resources/interpreting-effect-sizes-toward-a-quant/index.html": "d8ae4afb628e6be7",
+"curated_resources/intro-to-calculating-confidence-interval/index.html": "8c8414e1429aa157",
+"curated_resources/intro-to-r-and-rstudio-for-genomics/index.html": "1fb0528a271dfb6d",
+"curated_resources/intro-to-the-special-issue/index.html": "ea081a3b40c81b12",
+"curated_resources/introducing-a-framework-for-open-and-rep/index.html": "46dcf96dd47120d0",
+"curated_resources/introducing-jasp/index.html": "88879e5d5e4427ad",
+"curated_resources/introducing-nowhere-lab/index.html": "a3a86e70345f05c9",
+"curated_resources/introducing-open-science-in-teaching-hea/index.html": "86a886b4b5da60d4",
+"curated_resources/introducing-preregistration-of-research/index.html": "716c2f062a15192d",
+"curated_resources/introducing-the-national-open-research-t/index.html": "0b03ddb1270c7c41",
+"curated_resources/introduction-materials-for-reproducible/index.html": "f26d7283eaab19c3",
+"curated_resources/introduction-to-cloud-computing-for-geno/index.html": "a8c952fef31d12a3",
+"curated_resources/introduction-to-geospatial-concepts/index.html": "67fb3c21cc3c3a56",
+"curated_resources/introduction-to-geospatial-raster-and-ve/index.html": "a0ca3c9e13aceb61",
+"curated_resources/introduction-to-git-github/index.html": "ff2699a13ca35bf4",
+"curated_resources/introduction-to-jupyter-notebooks/index.html": "fbe1cfea119498ab",
+"curated_resources/introduction-to-mediation-moderation-and/index.html": "6d92782d8623ee30",
+"curated_resources/introduction-to-meta-analysis/index.html": "eb5f8e3c8b1e17e9",
+"curated_resources/introduction-to-open-science-principles/index.html": "b36df3ca8381e454",
+"curated_resources/introduction-to-power-analyses-in-r/index.html": "3adf51192375559c",
+"curated_resources/introduction-to-power/index.html": "5f607b32aa801c16",
+"curated_resources/introduction-to-preprints/index.html": "d3d1ebfff4fbb103",
+"curated_resources/introduction-to-r-for-geospatial-data/index.html": "959d023cd9e397b4",
+"curated_resources/introduction-to-research-data-management/index.html": "6e7b0bb9a8f2818c",
+"curated_resources/introduction-to-simulations/index.html": "396370e7621a44e1",
+"curated_resources/introduction-to-the-command-line-for-eco/index.html": "2ea12e0c44a9911d",
+"curated_resources/introduction-to-the-command-line-for-gen/index.html": "0d534d1c74cccb0f",
+"curated_resources/introduction-to-web-scraping/index.html": "9da395ff7115f8ce",
+"curated_resources/investigating-the-nature-of-open-science/index.html": "6e8be9b96f383ab1",
+"curated_resources/investigating-variation-in-replicability/index.html": "d1857d2d1b73d8aa",
+"curated_resources/investigation-and-its-discontents-some-c/index.html": "59c82bb5459efc23",
+"curated_resources/ioannidis-j-p-a-2012-why-science-is-not/index.html": "23250f6ece397404",
+"curated_resources/is-preregistration-worthwhile/index.html": "e75baf9557418110",
+"curated_resources/is-psychology-suffering-from-a-replicati/index.html": "b3a49c3d8ee2cdeb",
+"curated_resources/is-replication-possible-in-qualitative-r/index.html": "508a0986e1db20b9",
+"curated_resources/is-the-call-to-abandon-p-values-the-red/index.html": "0ec24c59044ff7c4",
+"curated_resources/is-the-replicability-crisis-overblown-th/index.html": "d166e480886307a4",
+"curated_resources/is-there-a-credibility-crisis-in-strateg/index.html": "0208f07372141e9b",
+"curated_resources/is-there-a-free-lunch-in-inference/index.html": "53fb49fa434402eb",
+"curated_resources/issues-in-the-registration-of-clinical-t/index.html": "db1d37ee8c8220ca",
+"curated_resources/it-s-time-to-broaden-the-replicability-c/index.html": "f6021079424b28f5",
+"curated_resources/it-s-time-to-join-the-conversation-visio/index.html": "f023fb372522b846",
+"curated_resources/joy-and-rigor-in-behavioral-science/index.html": "559f4b5a56c66c93",
+"curated_resources/joy-in-academia-centering-racialized-voi/index.html": "a2fdbb7db8ece794",
+"curated_resources/jpa-promotes-open-science/index.html": "d1bb839b782ff72f",
+"curated_resources/jupyter-notebooks-with-r-git/index.html": "6781448b0e971f58",
+"curated_resources/just-post-it-the-lesson-from-two-cases-o/index.html": "49caea41239c52e2",
+"curated_resources/just-prepare-putting-resident-practices/index.html": "0647eb41cbd5a941",
+"curated_resources/justify-your-alpha/index.html": "df7e6140377ec7ab",
+"curated_resources/key-practices-for-the-language-scientist/index.html": "c0648e9d25dca103",
+"curated_resources/kinds-of-replication/index.html": "e762eb263dfc73fd",
+"curated_resources/knowledge-rights-21/index.html": "db04f0158d779bac",
+"curated_resources/l-autorat-et-nous-de-la-collaboration-au/index.html": "6cc69d4d6cffa091",
+"curated_resources/la-terminal-de-unix/index.html": "2d604e86f1de47f5",
+"curated_resources/lab-js-online-research-made-easy/index.html": "1a18f98bea5683e8",
+"curated_resources/landmark-college-institute-for-research/index.html": "973de45472475a24",
+"curated_resources/last-contact-a-science-adventure/index.html": "6375f26f1ceba3dd",
+"curated_resources/last-week-tonight-with-john-oliver-scien/index.html": "5d07b7374edac4b8",
+"curated_resources/latent-variable-modeling-with-r/index.html": "1e0da0974166cc8d",
+"curated_resources/learn-stats-with-jamovi/index.html": "9bb2c5f6632ef5df",
+"curated_resources/learning-statistics-with-r/index.html": "f55fd2b4701a3756",
+"curated_resources/leonardo-da-vinci-preregistration-and-th/index.html": "0e3b8bf763d53b3d",
+"curated_resources/let-s-celebrate-earth-day-as-the-age-of/index.html": "983cad8a13d1887d",
+"curated_resources/let-s-publish-fewer-papers/index.html": "76824e33a09dd12e",
+"curated_resources/let-s-put-our-money-where-our-mouth-is-i/index.html": "4493c2ffa6f19d1c",
+"curated_resources/level-up-the-reproducibility-of-your-dat/index.html": "fae8befb6e1eb559",
+"curated_resources/leveraging-open-ecosystems-to-enhance-re/index.html": "380a91c6f795f5c1",
+"curated_resources/library-carpentry-introduction-to-git/index.html": "d3275aafc72b4579",
+"curated_resources/library-carpentry-introduction-to-workin/index.html": "3525e7f24da3150f",
+"curated_resources/library-carpentry-openrefine/index.html": "01ebd7e69be958fa",
+"curated_resources/library-carpentry-sql/index.html": "cb653430e3283301",
+"curated_resources/library-carpentry-the-unix-shell/index.html": "0426593429065c1e",
+"curated_resources/licensing-your-research/index.html": "a9bc794e2256db57",
+"curated_resources/likelihood-of-null-effects-of-large-nhlb/index.html": "c5626daae262c9df",
+"curated_resources/linking-to-data-effect-on-citation-rates/index.html": "8f54e0225730a56f",
+"curated_resources/local-grassroots-networks-engaging-open/index.html": "2d7b13670c05cec3",
+"curated_resources/logical-and-methodological-issues-affect/index.html": "c3afdb2129347baa",
+"curated_resources/longitudinal-structural-equation-modelin/index.html": "0890af4235695cbf",
+"curated_resources/low-research-data-availability-in-educat/index.html": "19a718931d393a7e",
+"curated_resources/making-erp-research-more-transparent-gui/index.html": "fada04e1bbd64e3a",
+"curated_resources/making-lemonade-out-of-remote-teaching/index.html": "9de1490ccba805f4",
+"curated_resources/making-prospective-registration-of-obser/index.html": "195c764e11ced277",
+"curated_resources/making-qualitative-data-reusable-a-short/index.html": "b835715ad87fe8c4",
+"curated_resources/making-replication-mainstream/index.html": "a7ea7034efd6e4ee",
+"curated_resources/making-research-data-publicly-accessible/index.html": "3b7e5b22f69eec5e",
+"curated_resources/making-science-public-a-review-of-journa/index.html": "2c777ad9c6c89a01",
+"curated_resources/managing-a-personal-research-archive/index.html": "723515d520ea34ca",
+"curated_resources/managing-qualitative-social-science-data/index.html": "e61c0d096e5d55d6",
+"curated_resources/many-labs-3-evaluating-participant-pool/index.html": "9fa7f7e652476c2f",
+"curated_resources/mapping-open-and-internationally-relevan/index.html": "d909c63f33447ee1",
+"curated_resources/mapping-the-universe-of-registered-repor/index.html": "448f965e78816640",
+"curated_resources/materials-for-the-webinar-helping-scienc/index.html": "9d22784ba69acc4d",
+"curated_resources/materials-scientist-explains-why-he-star/index.html": "ffa3a347261dbd1b",
+"curated_resources/maximizing-data-transparency-with-rigor/index.html": "85434401c40dedcf",
+"curated_resources/maximizing-the-reproducibility-of-your-r/index.html": "2993529b1b377cd6",
+"curated_resources/measurement-error-and-the-replication-cr/index.html": "3422c500e719cd4d",
+"curated_resources/measurement-matters/index.html": "a850d79847f3c09c",
+"curated_resources/measuring-the-prevalence-of-questionable/index.html": "24f14ed4628537ee",
+"curated_resources/medical-product-industry-ties-to-patient/index.html": "f4ccd920bd638d26",
+"curated_resources/medicines-and-healthcare-products-regula/index.html": "8a5e4dd3f34c687e",
+"curated_resources/meeting-the-requirements-of-funders-arou/index.html": "8262fc86bc6cc25a",
+"curated_resources/mentorship-practices-that-improve-the-cu/index.html": "6b3d061efcd8166f",
+"curated_resources/mermaid-live-editor/index.html": "51976d2127f2584c",
+"curated_resources/meta-analyses-are-no-substitute-for-regi/index.html": "8fbf30a755318e96",
+"curated_resources/meta-assessment-of-bias-in-science/index.html": "74407c3e21756f7f",
+"curated_resources/meta-docenia/index.html": "e7c653ae9d7804a0",
+"curated_resources/meta-regression-approximations-to-reduce/index.html": "db5376c6c1803c8d",
+"curated_resources/metascience-forum-2020/index.html": "5cfb3379b83f3c0f",
+"curated_resources/methodological-advances-in-behavioral-re/index.html": "69de6f76bcc8198e",
+"curated_resources/methods-and-results-of-studies-on-report/index.html": "24a73fb2870f3ac5",
+"curated_resources/methods-for-reliable-transparent-and-ope/index.html": "3c95199840ded316",
+"curated_resources/milgram-obedience-experiment-an-agent-ba/index.html": "270c6d3278299a12",
+"curated_resources/millions-of-research-papers-at-risk-of-d/index.html": "165e0de6635dba85",
+"curated_resources/mindless-statistics/index.html": "90e31cfa750f6d19",
+"curated_resources/mini-course-on-reproducibility-open-rese/index.html": "f11d0ed62b7a4cfa",
+"curated_resources/mini-meta-analysis-of-your-own-studies-s/index.html": "989149fafc1857fc",
+"curated_resources/minimal-criteria-for-reporting-mesenchym/index.html": "a94e4477f5e7a3b7",
+"curated_resources/minimizing-questionable-research-practic/index.html": "2889705a82d1c958",
+"curated_resources/minimizing-variability-in-developmental/index.html": "c7850ef9680ef93a",
+"curated_resources/misaligned-incentives-hurt-science-but-w/index.html": "d2a20e71f9993151",
+"curated_resources/mission-p-curve/index.html": "25ec9c13b482b52d",
+"curated_resources/mitigating-illusory-results-through-prer/index.html": "cc32d1caf69db3d7",
+"curated_resources/mobilizing-data-during-a-crisis-building/index.html": "8859df94f4bd5f68",
+"curated_resources/more-than-meets-the-itt-a-guide-for-anti/index.html": "22d47dee38a0b52e",
+"curated_resources/moving-toward-transparent-open-and-repro/index.html": "18957bab6377202d",
+"curated_resources/multi-site-replications-in-social-psycho/index.html": "8e4049b13cd28983",
+"curated_resources/multilevel-analysis-an-introduction-to-b/index.html": "cd39041d57e45c88",
+"curated_resources/multiscale-modeling-in-the-framework-of/index.html": "5d0ca3ad012bbb15",
+"curated_resources/natio-nal-guide-li-nes-for-promoting-ope/index.html": "99a8cd6cdb82899e",
+"curated_resources/national-open-access-monitor-launch-mark/index.html": "8e739ada06d8b1e5",
+"curated_resources/nature-earns-ire-over-lack-of-code-avail/index.html": "a796e7673fed4ac0",
+"curated_resources/navigating-open-scholarship-for-neurodiv/index.html": "0402e66ddef6d8ec",
+"curated_resources/navigating-the-science-system-research-i/index.html": "e684733c7cb13818",
+"curated_resources/negative-results-are-disappearing-from-m/index.html": "93aa739ce161ff63",
+"curated_resources/negativity-towards-negative-results-a-di/index.html": "dc092c7c90e79b34",
+"curated_resources/neuroscientist-explains/index.html": "1e68b726f6575882",
+"curated_resources/new-trends-in-science-communication-fost/index.html": "3049d31ad5ac62bf",
+"curated_resources/news-at-a-glance-planning-for-mentoring/index.html": "52cf5ba9260843e3",
+"curated_resources/niaid-centers-of-excellence-for-influenz/index.html": "25f1489acd0255c0",
+"curated_resources/nieuw-onderzoeksprogramma-voor-kansengel/index.html": "af55236fd278f0b5",
+"curated_resources/nigms-clearinghouse-for-training-modules/index.html": "e24f806515522f86",
+"curated_resources/nih-scientific-data-sharing/index.html": "662cd42d895ea34d",
+"curated_resources/no-evidence-of-publication-bias-in-clima/index.html": "910524e4478a7512",
+"curated_resources/novel-methods-to-deal-with-publication-b/index.html": "9b32709827368a16",
+"curated_resources/nowiknowmyabcd-a-global-resource-hub-for/index.html": "0c5a60647516a35a",
+"curated_resources/null-hypothesis-significance-testing-a-r/index.html": "ee029be549b4686c",
+"curated_resources/null-hypothesis-significance-testing-on/index.html": "5f1f13934741582c",
+"curated_resources/number-of-countries-with-open-science-po/index.html": "c8c5978bd9b638f1",
+"curated_resources/obviously-chatgpt-how-reviewers-accused/index.html": "afa4ddecf1231db2",
+"curated_resources/on-being-a-scientist-a-guide-to-responsi/index.html": "9326401d452a2021",
+"curated_resources/on-not-confusing-the-tree-of-trustworthy/index.html": "09d8d3e6f388e152",
+"curated_resources/on-the-challenges-of-drawing-conclusions/index.html": "7c0d5d1ea40b517d",
+"curated_resources/on-the-origins-of-the-05-level-of-statis/index.html": "36b673ded6bd9de5",
+"curated_resources/on-the-plurality-of-methodological-world/index.html": "7b7b4d0f872d6315",
+"curated_resources/on-the-reproducibility-of-meta-analyses/index.html": "c84aabf6be6b0dea",
+"curated_resources/on-the-reproducibility-of-psychological/index.html": "5664e632d232b723",
+"curated_resources/on-the-reproducibility-of-science-unique/index.html": "8a454f71d675fb8b",
+"curated_resources/on-the-surprising-longevity-of-flogged-h/index.html": "94d44b158bdc0f02",
+"curated_resources/on-the-use-and-misuses-of-preregistratio/index.html": "754b651b6177ded6",
+"curated_resources/one-cheer-for-null-hypothesis-significan/index.html": "88fbf0a35fe3daf8",
+"curated_resources/online-experimentation-and-sampling-in-c/index.html": "bd056eaac080336e",
+"curated_resources/online-experiments-for-language-scientis/index.html": "53471a79c2bdd09e",
+"curated_resources/open-access-directory/index.html": "4eb8a09ccdebbd4c",
+"curated_resources/open-access-journal-publication-in-healt/index.html": "7b64142c2ab6a924",
+"curated_resources/open-access-target-validation-is-a-more/index.html": "a71949b735390df9",
+"curated_resources/open-access-tracking-project/index.html": "99e878b1fd1f8c2d",
+"curated_resources/open-and-reproducible-methods-syllabus/index.html": "1f50f1f4ecd50421",
+"curated_resources/open-and-reproducible-research-in-psycho/index.html": "33c3dd989efe1ddb",
+"curated_resources/open-and-reproducible-science-syllabus/index.html": "3aa2861a5866eac2",
+"curated_resources/open-and-reproducible-science-syllabus_2/index.html": "b0300b84d18e88bd",
+"curated_resources/open-and-reproducible-science-walks-into/index.html": "fb15ca88f613095e",
+"curated_resources/open-and-reproducible-science/index.html": "3326eae69f8174dd",
+"curated_resources/open-and-responsible-researcher-reward-a/index.html": "02bb48bb815f4a57",
+"curated_resources/open-code-for-open-science/index.html": "faeddfd99178996a",
+"curated_resources/open-data-governance-at-the-canadian-ope/index.html": "c024b709277b02d1",
+"curated_resources/open-developmental-science-an-overview-a/index.html": "9c8213eb9199083b",
+"curated_resources/open-education-challenge-series/index.html": "a9112338b731e669",
+"curated_resources/open-education-data-research-and-policy/index.html": "a3372e1188781165",
+"curated_resources/open-education-in-promotion-tenure-and-f/index.html": "e89c644cc20ad6e1",
+"curated_resources/open-educational-resources-equitable-and/index.html": "d92c77d9c8ce8a48",
+"curated_resources/open-educational-resources-fur-die-hno-h/index.html": "0dd763e6ec0817b1",
+"curated_resources/open-for-insight-experimental-methods-op/index.html": "91ec9355bf92dbc6",
+"curated_resources/open-hardware-in-microscopy/index.html": "37a42bc03be229fc",
+"curated_resources/open-intro-statistics/index.html": "169b06d4f63fe809",
+"curated_resources/open-lab/index.html": "08341b6005398b83",
+"curated_resources/open-pedagogy-a-driving-force-for-meanin/index.html": "fb048162616f2143",
+"curated_resources/open-pedagogy-how-to-engage-your-student/index.html": "491f7369be63cda7",
+"curated_resources/open-peer-review-pros-and-cons-from-the/index.html": "91a02e62b4b62b73",
+"curated_resources/open-qualitative-research-a-primer-from/index.html": "efeae33d9232b655",
+"curated_resources/open-reproducible-research-workshop/index.html": "6f6eacf4677f5ce7",
+"curated_resources/open-research-community-accelerator-orca/index.html": "cab15a66095ce4fe",
+"curated_resources/open-research-examples-of-good-practice/index.html": "57993f4d2c6285f9",
+"curated_resources/open-research-reforms-and-the-capitalist/index.html": "19c452b78f72cb95",
+"curated_resources/open-resources-for-biology-education-orb/index.html": "9792aebcd57e19d9",
+"curated_resources/open-rigorous-and-reproducible-research/index.html": "29e32304765701e1",
+"curated_resources/open-scholarship-norms-among-education-r/index.html": "417df49a9d4af312",
+"curated_resources/open-scholarship-where-are-the-self-corr/index.html": "d1172baabe21417e",
+"curated_resources/open-science-2-0-towards-a-truly-collabo/index.html": "3e857c78e41cf93c",
+"curated_resources/open-science-2030-in-the-netherlands-npo/index.html": "41c71e7f8b44e801",
+"curated_resources/open-science-a-practical-guide-for-early/index.html": "2a92eaf71ac1f326",
+"curated_resources/open-science-and-methodological-improvem/index.html": "6684539bc7ec5e06",
+"curated_resources/open-science-and-reproducible-research-k/index.html": "6f41b1a76f2bfdec",
+"curated_resources/open-science-and-the-climate-crisis/index.html": "e461ac19b7d91fd9",
+"curated_resources/open-science-challenges-benefits-and-tip/index.html": "c1e264250541de68",
+"curated_resources/open-science-clusters-action-for-researc/index.html": "ae972ac2527c0f82",
+"curated_resources/open-science-decoded/index.html": "7217dd87c6562057",
+"curated_resources/open-science-education-through-student-p/index.html": "5c8d9a17a9b284f0",
+"curated_resources/open-science-hardware-and-space-research/index.html": "3d4c38e6f7137e96",
+"curated_resources/open-science-in-dementia-care-embedded-p/index.html": "d1d3912819b65e5c",
+"curated_resources/open-science-in-latin-america/index.html": "813cd4c6d624f400",
+"curated_resources/open-science-in-sport-and-exercise-psych/index.html": "18bea6c4c76cd521",
+"curated_resources/open-science-inclusive-psychology/index.html": "201f055c2c941e63",
+"curated_resources/open-science-interventions-to-improve-re/index.html": "7dedf3030c505f68",
+"curated_resources/open-science-is-for-aging-research-too/index.html": "da566aa55123cbf6",
+"curated_resources/open-science-made-easy/index.html": "254b267bbdf38ded",
+"curated_resources/open-science-manual/index.html": "c78784b600a154fa",
+"curated_resources/open-science-many-hands-make-light-work/index.html": "dca1b7bedd923ddb",
+"curated_resources/open-science-practices-are-on-the-rise-t/index.html": "59d638e70ea9e602",
+"curated_resources/open-science-practices-are-on-the-rise-t_2/index.html": "9a89d46466b728b3",
+"curated_resources/open-science-practices-in-psychiatric-ge/index.html": "6fe544ab9ac56733",
+"curated_resources/open-science-practices-need-substantial/index.html": "de200f9671b7a9c2",
+"curated_resources/open-science-retreat/index.html": "8cdc59149b8b701f",
+"curated_resources/open-science-saves-lives-lessons-from-th/index.html": "c2479f9152dc1665",
+"curated_resources/open-science-saves-lives-lessons-from-th_2/index.html": "163ba5f5919b4194",
+"curated_resources/open-science-seminar-how-to-do-credible/index.html": "a105c8315244bd27",
+"curated_resources/open-science-session-gsa-2019/index.html": "e11f202f18f2199c",
+"curated_resources/open-science-sprint-content/index.html": "80373bdd4d5a8aa1",
+"curated_resources/open-science-takes-on-the-coronavirus-pa/index.html": "a700cf819e29013e",
+"curated_resources/open-science-teaching/index.html": "83628ac374ae6760",
+"curated_resources/open-science-the-replication-crisis-and/index.html": "6c5462fd9ad11023",
+"curated_resources/open-science-toolbox/index.html": "6eca4e44535509d5",
+"curated_resources/open-science-training-handbook/index.html": "af0d10ba2bd9ddec",
+"curated_resources/open-science-training-in-triple/index.html": "573177ffc0ae798a",
+"curated_resources/open-science-what-why-and-how/index.html": "761d1c92135ee00d",
+"curated_resources/open-science-workshop-materials-of-the-l/index.html": "6be49140cb5d4575",
+"curated_resources/open-science/index.html": "284f94a4f54fa85d",
+"curated_resources/open-sharing-of-data-on-close-relationsh/index.html": "180796fbdf301638",
+"curated_resources/open-source-exploitation-david-whitney-n/index.html": "3fc1e9730704e949",
+"curated_resources/open-source-guides/index.html": "b592c48974d0a9fb",
+"curated_resources/open-source-research-methods-for-the-soc/index.html": "ef979bb3afde36da",
+"curated_resources/open-stats-lab-teach-statistics-using-op/index.html": "a2c66ae2091a7ad6",
+"curated_resources/open-stats-lab/index.html": "0c02c8f717533eac",
+"curated_resources/openaccess-net/index.html": "e1e390ee57a1ec66",
+"curated_resources/openaire-open-science-train-the-trainer/index.html": "40690441c8f7bfe3",
+"curated_resources/opening-knowledge-retaining-rights-and-o/index.html": "f7ff41b9af509462",
+"curated_resources/opening-open-science-to-all-demystifying/index.html": "83183a0758eb8842",
+"curated_resources/opening-science/index.html": "5076765766ff88d0",
+"curated_resources/opening-up-understanding-of-neurodiversi/index.html": "abdf14ea360f8e70",
+"curated_resources/openmreye-camera-free-magnetic-resonance/index.html": "b36f056b1f0d1481",
+"curated_resources/openrefine-for-social-science-data/index.html": "5bdb655b864fdf4f",
+"curated_resources/opensafely-a-platform-for-analysing-elec/index.html": "35a566aeabc7f81c",
+"curated_resources/opinion-promoting-open-science/index.html": "24169b6ca0a55eb6",
+"curated_resources/optimizing-research-collaboration-for-re/index.html": "f75dcdbe7bc23f59",
+"curated_resources/optimizing-research-collaboration/index.html": "2d0c57015bf7fc93",
+"curated_resources/optimizing-research-payoff/index.html": "b22808a594ec0162",
+"curated_resources/optimizing-the-methodology-of-human-slee/index.html": "a0d5323fea7da3fa",
+"curated_resources/orcc-ukrn-primer-on-working-in-open-rese/index.html": "20b016c7faa570dc",
+"curated_resources/osf-collections-supporting-research-disc/index.html": "99931350191d81d8",
+"curated_resources/osf-deep-dive/index.html": "cf37e77a449d5980",
+"curated_resources/osf-in-the-classroom/index.html": "36660a8b99798e64",
+"curated_resources/osf-in-the-lab-organizing-related-projec/index.html": "40751aba57444cf8",
+"curated_resources/osf101/index.html": "a21cdbb4a0fcc16e",
+"curated_resources/our-data-ourselves-a-framework-for-using/index.html": "ddbf906d0ec581ad",
+"curated_resources/outcome-reporting-bias-in-randomized-con/index.html": "a3dcf5d9259f97d7",
+"curated_resources/overcoming-the-knowledge-barrier-in-open/index.html": "466e7c917a63afdd",
+"curated_resources/oxford-berlin-open-research-summer-schoo/index.html": "a7b2760ec05a9c15",
+"curated_resources/oxford-berlin-summer-school-on-open-rese/index.html": "18bc98b1e762206a",
+"curated_resources/p-curve-a-key-to-the-file-drawer/index.html": "3673a661539e930e",
+"curated_resources/p-curve-visualization-updated-with-log-x/index.html": "2a74569e678518b1",
+"curated_resources/p-curve/index.html": "1f3de89e8cfb8faf",
+"curated_resources/p-hacking-its-costs-and-when-it-is-warra/index.html": "e191bf0d842c1122",
+"curated_resources/p-values-and-statistical-practice/index.html": "040a0303c31f90b2",
+"curated_resources/p-values-in-display-items-are-ubiquitous/index.html": "8a33e36e97992566",
+"curated_resources/page/10/index.html": "27171a33c1a98472",
+"curated_resources/page/100/index.html": "27171a33c1a98472",
+"curated_resources/page/101/index.html": "27171a33c1a98472",
+"curated_resources/page/102/index.html": "27171a33c1a98472",
+"curated_resources/page/103/index.html": "27171a33c1a98472",
+"curated_resources/page/104/index.html": "27171a33c1a98472",
+"curated_resources/page/105/index.html": "27171a33c1a98472",
+"curated_resources/page/106/index.html": "27171a33c1a98472",
+"curated_resources/page/107/index.html": "27171a33c1a98472",
+"curated_resources/page/108/index.html": "27171a33c1a98472",
+"curated_resources/page/109/index.html": "27171a33c1a98472",
+"curated_resources/page/11/index.html": "27171a33c1a98472",
+"curated_resources/page/110/index.html": "27171a33c1a98472",
+"curated_resources/page/111/index.html": "27171a33c1a98472",
+"curated_resources/page/112/index.html": "27171a33c1a98472",
+"curated_resources/page/113/index.html": "27171a33c1a98472",
+"curated_resources/page/114/index.html": "27171a33c1a98472",
+"curated_resources/page/115/index.html": "27171a33c1a98472",
+"curated_resources/page/116/index.html": "27171a33c1a98472",
+"curated_resources/page/117/index.html": "27171a33c1a98472",
+"curated_resources/page/118/index.html": "27171a33c1a98472",
+"curated_resources/page/119/index.html": "27171a33c1a98472",
+"curated_resources/page/12/index.html": "27171a33c1a98472",
+"curated_resources/page/120/index.html": "27171a33c1a98472",
+"curated_resources/page/121/index.html": "27171a33c1a98472",
+"curated_resources/page/122/index.html": "27171a33c1a98472",
+"curated_resources/page/123/index.html": "27171a33c1a98472",
+"curated_resources/page/124/index.html": "27171a33c1a98472",
+"curated_resources/page/125/index.html": "27171a33c1a98472",
+"curated_resources/page/126/index.html": "27171a33c1a98472",
+"curated_resources/page/127/index.html": "27171a33c1a98472",
+"curated_resources/page/128/index.html": "27171a33c1a98472",
+"curated_resources/page/129/index.html": "27171a33c1a98472",
+"curated_resources/page/13/index.html": "27171a33c1a98472",
+"curated_resources/page/130/index.html": "27171a33c1a98472",
+"curated_resources/page/131/index.html": "27171a33c1a98472",
+"curated_resources/page/132/index.html": "27171a33c1a98472",
+"curated_resources/page/133/index.html": "27171a33c1a98472",
+"curated_resources/page/134/index.html": "27171a33c1a98472",
+"curated_resources/page/135/index.html": "27171a33c1a98472",
+"curated_resources/page/136/index.html": "27171a33c1a98472",
+"curated_resources/page/137/index.html": "27171a33c1a98472",
+"curated_resources/page/138/index.html": "27171a33c1a98472",
+"curated_resources/page/139/index.html": "27171a33c1a98472",
+"curated_resources/page/14/index.html": "27171a33c1a98472",
+"curated_resources/page/140/index.html": "27171a33c1a98472",
+"curated_resources/page/141/index.html": "27171a33c1a98472",
+"curated_resources/page/142/index.html": "27171a33c1a98472",
+"curated_resources/page/143/index.html": "27171a33c1a98472",
+"curated_resources/page/144/index.html": "27171a33c1a98472",
+"curated_resources/page/145/index.html": "27171a33c1a98472",
+"curated_resources/page/146/index.html": "27171a33c1a98472",
+"curated_resources/page/147/index.html": "27171a33c1a98472",
+"curated_resources/page/148/index.html": "27171a33c1a98472",
+"curated_resources/page/149/index.html": "27171a33c1a98472",
+"curated_resources/page/15/index.html": "27171a33c1a98472",
+"curated_resources/page/16/index.html": "27171a33c1a98472",
+"curated_resources/page/17/index.html": "27171a33c1a98472",
+"curated_resources/page/18/index.html": "27171a33c1a98472",
+"curated_resources/page/19/index.html": "27171a33c1a98472",
+"curated_resources/page/2/index.html": "27171a33c1a98472",
+"curated_resources/page/20/index.html": "27171a33c1a98472",
+"curated_resources/page/21/index.html": "27171a33c1a98472",
+"curated_resources/page/22/index.html": "27171a33c1a98472",
+"curated_resources/page/23/index.html": "27171a33c1a98472",
+"curated_resources/page/24/index.html": "27171a33c1a98472",
+"curated_resources/page/25/index.html": "27171a33c1a98472",
+"curated_resources/page/26/index.html": "27171a33c1a98472",
+"curated_resources/page/27/index.html": "27171a33c1a98472",
+"curated_resources/page/28/index.html": "27171a33c1a98472",
+"curated_resources/page/29/index.html": "27171a33c1a98472",
+"curated_resources/page/3/index.html": "27171a33c1a98472",
+"curated_resources/page/30/index.html": "27171a33c1a98472",
+"curated_resources/page/31/index.html": "27171a33c1a98472",
+"curated_resources/page/32/index.html": "27171a33c1a98472",
+"curated_resources/page/33/index.html": "27171a33c1a98472",
+"curated_resources/page/34/index.html": "27171a33c1a98472",
+"curated_resources/page/35/index.html": "27171a33c1a98472",
+"curated_resources/page/36/index.html": "27171a33c1a98472",
+"curated_resources/page/37/index.html": "27171a33c1a98472",
+"curated_resources/page/38/index.html": "27171a33c1a98472",
+"curated_resources/page/39/index.html": "27171a33c1a98472",
+"curated_resources/page/4/index.html": "27171a33c1a98472",
+"curated_resources/page/40/index.html": "27171a33c1a98472",
+"curated_resources/page/41/index.html": "27171a33c1a98472",
+"curated_resources/page/42/index.html": "27171a33c1a98472",
+"curated_resources/page/43/index.html": "27171a33c1a98472",
+"curated_resources/page/44/index.html": "27171a33c1a98472",
+"curated_resources/page/45/index.html": "27171a33c1a98472",
+"curated_resources/page/46/index.html": "27171a33c1a98472",
+"curated_resources/page/47/index.html": "27171a33c1a98472",
+"curated_resources/page/48/index.html": "27171a33c1a98472",
+"curated_resources/page/49/index.html": "27171a33c1a98472",
+"curated_resources/page/5/index.html": "27171a33c1a98472",
+"curated_resources/page/50/index.html": "27171a33c1a98472",
+"curated_resources/page/51/index.html": "27171a33c1a98472",
+"curated_resources/page/52/index.html": "27171a33c1a98472",
+"curated_resources/page/53/index.html": "27171a33c1a98472",
+"curated_resources/page/54/index.html": "27171a33c1a98472",
+"curated_resources/page/55/index.html": "27171a33c1a98472",
+"curated_resources/page/56/index.html": "27171a33c1a98472",
+"curated_resources/page/57/index.html": "27171a33c1a98472",
+"curated_resources/page/58/index.html": "27171a33c1a98472",
+"curated_resources/page/59/index.html": "27171a33c1a98472",
+"curated_resources/page/6/index.html": "27171a33c1a98472",
+"curated_resources/page/60/index.html": "27171a33c1a98472",
+"curated_resources/page/61/index.html": "27171a33c1a98472",
+"curated_resources/page/62/index.html": "27171a33c1a98472",
+"curated_resources/page/63/index.html": "27171a33c1a98472",
+"curated_resources/page/64/index.html": "27171a33c1a98472",
+"curated_resources/page/65/index.html": "27171a33c1a98472",
+"curated_resources/page/66/index.html": "27171a33c1a98472",
+"curated_resources/page/67/index.html": "27171a33c1a98472",
+"curated_resources/page/68/index.html": "27171a33c1a98472",
+"curated_resources/page/69/index.html": "27171a33c1a98472",
+"curated_resources/page/7/index.html": "27171a33c1a98472",
+"curated_resources/page/70/index.html": "27171a33c1a98472",
+"curated_resources/page/71/index.html": "27171a33c1a98472",
+"curated_resources/page/72/index.html": "27171a33c1a98472",
+"curated_resources/page/73/index.html": "27171a33c1a98472",
+"curated_resources/page/74/index.html": "27171a33c1a98472",
+"curated_resources/page/75/index.html": "27171a33c1a98472",
+"curated_resources/page/76/index.html": "27171a33c1a98472",
+"curated_resources/page/77/index.html": "27171a33c1a98472",
+"curated_resources/page/78/index.html": "27171a33c1a98472",
+"curated_resources/page/79/index.html": "27171a33c1a98472",
+"curated_resources/page/8/index.html": "27171a33c1a98472",
+"curated_resources/page/80/index.html": "27171a33c1a98472",
+"curated_resources/page/81/index.html": "27171a33c1a98472",
+"curated_resources/page/82/index.html": "27171a33c1a98472",
+"curated_resources/page/83/index.html": "27171a33c1a98472",
+"curated_resources/page/84/index.html": "27171a33c1a98472",
+"curated_resources/page/85/index.html": "27171a33c1a98472",
+"curated_resources/page/86/index.html": "27171a33c1a98472",
+"curated_resources/page/87/index.html": "27171a33c1a98472",
+"curated_resources/page/88/index.html": "27171a33c1a98472",
+"curated_resources/page/89/index.html": "27171a33c1a98472",
+"curated_resources/page/9/index.html": "27171a33c1a98472",
+"curated_resources/page/90/index.html": "27171a33c1a98472",
+"curated_resources/page/91/index.html": "27171a33c1a98472",
+"curated_resources/page/92/index.html": "27171a33c1a98472",
+"curated_resources/page/93/index.html": "27171a33c1a98472",
+"curated_resources/page/94/index.html": "27171a33c1a98472",
+"curated_resources/page/95/index.html": "27171a33c1a98472",
+"curated_resources/page/96/index.html": "27171a33c1a98472",
+"curated_resources/page/97/index.html": "27171a33c1a98472",
+"curated_resources/page/98/index.html": "27171a33c1a98472",
+"curated_resources/page/99/index.html": "27171a33c1a98472",
+"curated_resources/pangea/index.html": "7c66ac959b7f6f29",
+"curated_resources/participatory-research-approaches-in-alz/index.html": "4a7a07420f7aaae6",
+"curated_resources/pathos-open-science-impact-pathways/index.html": "2a92aa478cb0a556",
+"curated_resources/paths-in-strange-spaces-a-comment-on-pre/index.html": "1fa1cf04d3537050",
+"curated_resources/paving-the-way-for-greater-open-science/index.html": "2851b22992b7e5e2",
+"curated_resources/pbfj-editorial-engaging-with-responsible/index.html": "e25ca4e6c1718a01",
+"curated_resources/pearl-neuro-database-eeg-fmri-health-and/index.html": "faa5ff589c459433",
+"curated_resources/peer-review-decisions-decisions/index.html": "53d2cbd5024d919f",
+"curated_resources/peer-review-practices-of-psychological-j/index.html": "24fe84bb510b68e2",
+"curated_resources/performing-high-powered-studies-efficien/index.html": "adfcbbc4633e72f6",
+"curated_resources/perspectives-on-improving-methods-in-psy/index.html": "06f971600a5a9ee3",
+"curated_resources/perspectives-replication-is-more-than-me/index.html": "e009f14977fdce9d",
+"curated_resources/pewtranslate-census-language-lookup/index.html": "afff88f9b6562cf5",
+"curated_resources/philosophical-psychology-1989/index.html": "6a2673fb72b015dc",
+"curated_resources/plan-e-for-education-open-access-to-educ/index.html": "a6f2072d6ee883ce",
+"curated_resources/platform-controlled-social-media-apis-th/index.html": "40ad52c7e293c761",
+"curated_resources/plotting-and-programming-in-python/index.html": "699dd07ef13c19b4",
+"curated_resources/point-of-view-an-annotated-introductory/index.html": "e00ceff5e509ad34",
+"curated_resources/point-of-view-how-open-science-helps-res/index.html": "1ff42899736dc319",
+"curated_resources/policy-recommendations-to-ensure-that-re/index.html": "ecbea89ea37d218b",
+"curated_resources/poor-replication-validity-of-biomedical/index.html": "0c94ad6377f48aa1",
+"curated_resources/poor-statistical-reporting-inadequate-da/index.html": "32350248fab3183a",
+"curated_resources/positionality-statements-are-just-the-ti/index.html": "d74cd06b225ddd4a",
+"curated_resources/positionality-statements-in-science/index.html": "3c2f5c644fc27ac9",
+"curated_resources/positive-deviance-underlies-successful-s/index.html": "dfc066db3151d8ed",
+"curated_resources/positive-results-increase-down-the-hiera/index.html": "c4d76f7f7dfbb015",
+"curated_resources/power-analysis-and-effect-size-in-mixed/index.html": "cc9720a38899743c",
+"curated_resources/power-failure-why-small-sample-size-unde/index.html": "e3a837e283f7bb4d",
+"curated_resources/power-posing-reassessing-the-evidence-be/index.html": "328dfcdf510f61bd",
+"curated_resources/power-up-a-reanalysis-of-power-failure-i/index.html": "876e6f4b4fb5d0d2",
+"curated_resources/practical-considerations-for-navigating/index.html": "da5636d95942aeb3",
+"curated_resources/practical-guides-on-open-science-for-res/index.html": "e09103349a7504e6",
+"curated_resources/practical-solutions-for-sharing-data-and/index.html": "204ef2da83ad0a84",
+"curated_resources/practical-steps-for-increasing-opennes-a/index.html": "da981dd9fecb037d",
+"curated_resources/pre-analysis-plans-a-stocktaking/index.html": "08633863f03a1023",
+"curated_resources/pre-analysis-plans-an-early-stocktaking/index.html": "dfbad3cdc10d2edb",
+"curated_resources/pre-analysis-plans-have-limited-upside-e/index.html": "f912ffb7376fa8d0",
+"curated_resources/pre-registration-and-results-free-review/index.html": "198ad016f8ff90a6",
+"curated_resources/pre-registration-in-social-psychology-a/index.html": "4c1cda6c6e8363bf",
+"curated_resources/pre-registration-in-the-undergraduate-di/index.html": "1b46335c8700608e",
+"curated_resources/pre-registration-of-clinical-trials-is-a/index.html": "eb532b5ada34b07d",
+"curated_resources/pre-registration-of-mathematical-models/index.html": "caf5390dc4093e9b",
+"curated_resources/pre-registration-weighing-costs-and-bene/index.html": "11507d19e579deb1",
+"curated_resources/pre-registration-why-and-how/index.html": "c7f0a339b61eb635",
+"curated_resources/pre-results-review-in-economics-lessons/index.html": "750282870625c8e8",
+"curated_resources/pre-self-what-fraction-of-a-journal-s-pa/index.html": "4145498af615cf37",
+"curated_resources/prediction-interval-what-to-expect-when/index.html": "ccde34b98a7f0019",
+"curated_resources/preliminary-analysis-of-covid-19-academi/index.html": "af2b40f8b689ef77",
+"curated_resources/premiering-pre-registration-at-plos-biol/index.html": "2bbb5d128be5882c",
+"curated_resources/preparing-code-and-data-for-computationa/index.html": "38ca5f96d8d5c80e",
+"curated_resources/preregister-your-ethical-redlines-vulner/index.html": "b607349b92aa8eaf",
+"curated_resources/preregistering-qualitative-research-a-de/index.html": "0e20422bcae4f96e",
+"curated_resources/preregistering-qualitative-research/index.html": "9862813f25ce1603",
+"curated_resources/preregistering-transparency-and-large-sa/index.html": "dcf302d34db72756",
+"curated_resources/preregistration-and-incentives/index.html": "9d2199d4a29efbaa",
+"curated_resources/preregistration-and-registered-reports-i/index.html": "870b091fee6f41f7",
+"curated_resources/preregistration-and-reproducibility/index.html": "5e2f9bd6bb32a4bd",
+"curated_resources/preregistration-as-a-way-to-limit-questi/index.html": "acb8d7efd4c0ba2b",
+"curated_resources/preregistration-becoming-the-norm-in-psy/index.html": "d5e877d62d01ef6b",
+"curated_resources/preregistration-definition-advantages-di/index.html": "20eab9863b170d8d",
+"curated_resources/preregistration-does-not-improve-the-tra/index.html": "5f6d68f82aa5c9b9",
+"curated_resources/preregistration-improve-research-rigor-r/index.html": "66be12fc1bc6d3ed",
+"curated_resources/preregistration-in-complex-contexts-a-pr/index.html": "7598e58bc8a032c2",
+"curated_resources/preregistration-in-diverse-contexts-a-pr/index.html": "eeef7dc866082042",
+"curated_resources/preregistration-in-experimental-linguist/index.html": "20617d0485a2226d",
+"curated_resources/preregistration-in-infant-research-a-pri/index.html": "0933847de230f561",
+"curated_resources/preregistration-in-single-case-design-re/index.html": "ca8de577c2537a32",
+"curated_resources/preregistration-is-hard-and-worthwhile/index.html": "f253859197b1f3bf",
+"curated_resources/preregistration-is-neither-sufficient-no/index.html": "c495086eab996213",
+"curated_resources/preregistration-is-not-a-panacea-but-why/index.html": "a01634945d395b73",
+"curated_resources/preregistration-of-analyses-of-preexisti/index.html": "f7b13c37284cd927",
+"curated_resources/preregistration-of-animal-research-proto/index.html": "f17945d8a3e2973e",
+"curated_resources/preregistration-of-epidemiologic-studies/index.html": "4bb38551b67a258c",
+"curated_resources/preregistration-of-epidemiology-protocol/index.html": "8095b510e2a29137",
+"curated_resources/preregistration-of-epidemiology-protocol_2/index.html": "b3c0727096206645",
+"curated_resources/preregistration-of-epidemiology-protocol_3/index.html": "ddde21879cf5aa36",
+"curated_resources/preregistration-of-exploratory-research/index.html": "e5b463f3a007ea79",
+"curated_resources/preregistration-of-information-systems-r/index.html": "6aad65c1a7a17c04",
+"curated_resources/preregistration-of-machine-learning-rese/index.html": "7f88a1f7ea79b520",
+"curated_resources/preregistration-of-modeling-exercises-ma/index.html": "5500ae994f7de91e",
+"curated_resources/preregistration-of-qualitative-research/index.html": "ebb4f99078cceec8",
+"curated_resources/preregistration-of-randomized-controlled/index.html": "4bdf32c46b584f5e",
+"curated_resources/preregistration-of-secondary-data-analys/index.html": "d650d47bec280316",
+"curated_resources/preregistration-of-studies-with-existing/index.html": "e5565e77bc366926",
+"curated_resources/preregistration-of-study-protocols-is-un/index.html": "5a5846a8e73d661a",
+"curated_resources/preregistration-overview-page/index.html": "68248067ad3a3320",
+"curated_resources/preregistration-practical-considerations/index.html": "6236aed275a8d32d",
+"curated_resources/preregistration-replication-and-nonexper/index.html": "5eba177e7188217e",
+"curated_resources/preregistration-specificity-adherence-a/index.html": "2028c292cf294b28",
+"curated_resources/preregistration-templates-as-a-new-addit/index.html": "1be3a04e12a3dacf",
+"curated_resources/preregistration-the-good-the-bad-and-the/index.html": "538533d110ac9f44",
+"curated_resources/presentations-given-by-center-for-open-s/index.html": "d7ed8c6630e726b0",
+"curated_resources/preserving-privacy-in-the-era-of-opennes/index.html": "a57c5372ea1830fd",
+"curated_resources/primer-on-reproducible-research-in-r-enh/index.html": "cdc7451af8a23413",
+"curated_resources/priming-replication-and-the-hardest-scie/index.html": "046a73c57f644ba6",
+"curated_resources/principles-of-instruction-research-based/index.html": "b1cee4ab0fd9ebe2",
+"curated_resources/prioritizing-open-science-in-space-medic/index.html": "0bc28f5cce98fb45",
+"curated_resources/privacy-and-data-based-research/index.html": "3aa72ecf71cf3a45",
+"curated_resources/probing-birth-order-effects-on-narrow-tr/index.html": "5d7cb92b8c0149cc",
+"curated_resources/problems-in-using-p-curve-analysis-and-t/index.html": "4a444fff57aa05b3",
+"curated_resources/procedimentos-para-investigacao-cientifi/index.html": "cf016112d0fd97b9",
+"curated_resources/processes-and-lessons-learned-in-establi/index.html": "6d3477946a83ef9f",
+"curated_resources/programming-psychological-experiments-us/index.html": "b2f44f494769d557",
+"curated_resources/programming-with-matlab/index.html": "623b47b9e4460d81",
+"curated_resources/programming-with-python/index.html": "faf1a3772bd0875d",
+"curated_resources/programming-with-r/index.html": "32853d28ecdcb37a",
+"curated_resources/project-organization-and-management-for/index.html": "1ba3829612921480",
+"curated_resources/project-teaching-integrity-in-empirical/index.html": "e269debcad02f0da",
+"curated_resources/promises-and-perils-of-pre-analysis-plan/index.html": "1e2f9ad77b2c0149",
+"curated_resources/promoting-an-open-research-culture/index.html": "4154aa524ac1d1a5",
+"curated_resources/promoting-civility-in-formal-and-informa/index.html": "f8bbcf0765ff16c2",
+"curated_resources/promoting-transparency-in-social-science/index.html": "d0bbb041140af7cf",
+"curated_resources/promotion-tenure-aligning-incentives-wit/index.html": "e25783c9168c9c9c",
+"curated_resources/psychological-testing-and-psychological/index.html": "c8b345362adeef51",
+"curated_resources/psychologists-are-open-to-change-yet-war/index.html": "699ddcf192d38787",
+"curated_resources/psychology-as-a-robust-science/index.html": "3b50708b5dbd8f5c",
+"curated_resources/psychology-s-credibility-revolution/index.html": "d9c00a0045747176",
+"curated_resources/psychology-s-renaissance/index.html": "ee56530f2ffa76bf",
+"curated_resources/psychology-s-replication-crisis-and-the/index.html": "c6338bce175536a9",
+"curated_resources/psychology-science-and-knowledge-constru/index.html": "261b0d0e43e56a30",
+"curated_resources/psyteachr/index.html": "fcf63d5aef84ee82",
+"curated_resources/pubcompare-the-largest-database-of-trust/index.html": "5bd3f5a576ecc048",
+"curated_resources/public-availability-of-published-researc/index.html": "566a1d77b45fcd7c",
+"curated_resources/public-data-archiving-in-ecology-and-evo/index.html": "451263c3f931817e",
+"curated_resources/publication-bias-and-the-canonization-of/index.html": "7f6396ad5e10080f",
+"curated_resources/publication-bias-and-the-limited-strengt/index.html": "5e9a582c6a1db8db",
+"curated_resources/publication-bias-in-clinical-research/index.html": "d9210b0cb414c379",
+"curated_resources/publication-bias-in-psychology-a-diagnos/index.html": "d39c4ef14a138e9b",
+"curated_resources/publication-bias-in-the-social-sciences/index.html": "77d5fe3b69233bc5",
+"curated_resources/publication-decisions-and-their-possible/index.html": "e7cdd997919df845",
+"curated_resources/publication-of-nih-funded-trials-registe/index.html": "4295ea4cc87f9153",
+"curated_resources/publication-prejudices-an-experimental-s/index.html": "c986419e74fdf2d4",
+"curated_resources/publication-pressure-and-scientific-misc/index.html": "4587272aac46c585",
+"curated_resources/publication-rate-in-preclinical-research/index.html": "5f5391b8d904097f",
+"curated_resources/publishing-in-the-open-access-and-open-s/index.html": "717c41ae12a9a2ef",
+"curated_resources/python-for-harvesting-data-on-the-web/index.html": "668380fd79d66422",
+"curated_resources/python-for-humanities/index.html": "9cb040c571d6c691",
+"curated_resources/qdr-data-for-teaching/index.html": "cdda096daef1433d",
+"curated_resources/qualitative-open-science-practices/index.html": "9e1bd22a8bb222c4",
+"curated_resources/qualitative-research-using-open-tools/index.html": "ed365b839a15ff24",
+"curated_resources/quality-indicators-of-secondary-data-ana/index.html": "e838c4daad90e702",
+"curated_resources/quality-uncertainty-erodes-trust-in-scie/index.html": "932fd14cbeb1b0a7",
+"curated_resources/quantitative-emerging-practices-and-meth/index.html": "b9526c8ed39e196d",
+"curated_resources/questionable-and-open-research-practices/index.html": "5e708dbe20f2ca66",
+"curated_resources/questionable-metascience-practices/index.html": "7b76b15e7053fb13",
+"curated_resources/questionable-research-practices-among-it/index.html": "c137aac1cb4fb9ad",
+"curated_resources/questionable-research-practices-among-re/index.html": "811d03efde83d94d",
+"curated_resources/questionable-research-practices-followin/index.html": "d32a68cc7674703e",
+"curated_resources/questionable-research-practices-in-ecolo/index.html": "471836831d85b58d",
+"curated_resources/questionable-research-practices-revisite/index.html": "649db779b9c0e225",
+"curated_resources/r-for-reproducible-scientific-analysis/index.html": "0afc79244a371072",
+"curated_resources/r-for-social-scientists/index.html": "4b6c2593cfafa0e9",
+"curated_resources/r-graphics-cookbook-practical-recipes-fo/index.html": "77f9f316f6a23c8b",
+"curated_resources/r-para-analisis-cientificos-reproducible/index.html": "2b23aaac776e5324",
+"curated_resources/race-to-the-bottom-competition-and-quali/index.html": "53648250f8ae3c09",
+"curated_resources/raiders-of-the-lost-hark-a-reproducible/index.html": "4abc4cde11485fc4",
+"curated_resources/raise-standards-for-preclinical-cancer-r/index.html": "6c29307e282476c6",
+"curated_resources/raising-awareness-of-uncertain-choices-i/index.html": "9a71e61074babe20",
+"curated_resources/randomization-does-not-help-much-compara/index.html": "6633bba33c49515c",
+"curated_resources/rate-and-success-of-study-replication-in/index.html": "593afc5bce45de69",
+"curated_resources/rationalizing-pre-analysis-plans-statist/index.html": "8d8c158e1f4cb5c5",
+"curated_resources/re-run-repeat-reproduce-reuse-replicate/index.html": "3df6f8d01a6f504f",
+"curated_resources/recommendations-for-empowering-early-car/index.html": "f8c7aba22af8601b",
+"curated_resources/recommendations-for-increasing-replicabi/index.html": "285d1bd600b38f28",
+"curated_resources/reconceptualizing-replication-as-a-seque/index.html": "b288ad11bff23905",
+"curated_resources/redefine-statistical-signifcance/index.html": "426b321e8d95a4a2",
+"curated_resources/reducing-bias-increasing-transparency-an/index.html": "34c00477973fff64",
+"curated_resources/reflection-over-compliance-critiquing-ma/index.html": "cccf05c26e197f61",
+"curated_resources/reflections-on-preregistration-core-crit/index.html": "56d363337fbd894d",
+"curated_resources/reflections-on-the-unintended-consequenc/index.html": "88760ca40a31e505",
+"curated_resources/reflections-on-the-unintended-consequenc_2/index.html": "90c7521b7033defd",
+"curated_resources/registered-replication-report-hart-albar/index.html": "1a68ca09e43796d0",
+"curated_resources/registered-replication-report-rand-green/index.html": "85550316a1029a34",
+"curated_resources/registered-replication-report-schooler-a/index.html": "5aa7eed5e7e3a9b5",
+"curated_resources/registered-replication-report-strack-mar/index.html": "1c914d3f4572f427",
+"curated_resources/registered-replication-report-study-1-fr/index.html": "3bf75255d7eb0615",
+"curated_resources/registered-replication-reports-in-the-cl/index.html": "ffc4ce4419420ef0",
+"curated_resources/registered-report-adoption-in-academic-j/index.html": "a8eba12d411907ac",
+"curated_resources/registered-report-protocol-survey-on-att/index.html": "dba1803a2addaccd",
+"curated_resources/registered-report-stage-1-manuscript-tem/index.html": "c0dd3e090174b1d8",
+"curated_resources/registered-reports-a-method-to-increase/index.html": "8704f6a87024d09d",
+"curated_resources/registered-reports-a-new-publishing-init/index.html": "7a550cc9d3b8a68e",
+"curated_resources/registered-reports-an-early-example-and/index.html": "d75d910043e9e50a",
+"curated_resources/registered-reports-and-replications-an-o/index.html": "b705155a4aa39333",
+"curated_resources/registered-reports-factsheet-for-editors/index.html": "fe1f60b7845ced06",
+"curated_resources/registered-reports-faq/index.html": "8a59a7dae141d67f",
+"curated_resources/registered-reports-q-a/index.html": "f489ac4194614ea0",
+"curated_resources/reimagining-peer-review-the-emergence-of/index.html": "89cb4b2b32b31876",
+"curated_resources/releasing-a-preprint-is-associated-with/index.html": "dcbe3312f0c58d31",
+"curated_resources/renovating-the-theatre-of-persuasion-man/index.html": "23745eb229719370",
+"curated_resources/repetitive-research-a-conceptual-space-a/index.html": "5134c4a9d2a24984",
+"curated_resources/replacing-p-values-with-bayes-factors-a/index.html": "3cc20ee84da99302",
+"curated_resources/replicability-and-reproducibility-in-com/index.html": "d8be615ffe89a3b0",
+"curated_resources/replicability-and-reproducibility/index.html": "89f9fb640eea324b",
+"curated_resources/replicability-syllabus-2018/index.html": "966da59e60ee212a",
+"curated_resources/replicability-syllabus-2020/index.html": "9faa1624753b7860",
+"curated_resources/replicating-and-extending-soroka-fournie/index.html": "8a43f07b3ed54592",
+"curated_resources/replicating-studies-in-which-samples-of/index.html": "e10ee4bc77f205ee",
+"curated_resources/replication-and-bias-in-special-educatio/index.html": "302e1f563f880ecb",
+"curated_resources/replication-and-open-science-for-undergr/index.html": "d7418b7416f27c46",
+"curated_resources/replication-and-robustness-in-developmen/index.html": "6302cd35c81bbfc9",
+"curated_resources/replication-and-the-manufacture-of-scien/index.html": "d43628bdeace0168",
+"curated_resources/replication-communication-and-the-popula/index.html": "ab4c27fbcb61a9fa",
+"curated_resources/replication-is-relevant-in-qualitative-r/index.html": "4abfd563c6e76ad5",
+"curated_resources/replications-in-psychology-research-how/index.html": "ededbd852b671c28",
+"curated_resources/repligate-reliability-and-reproducibilit/index.html": "03d087cc83cef67e",
+"curated_resources/reply-to-ledgerwood-predictions-without/index.html": "698c539cdee3225d",
+"curated_resources/reporting-effect-sizes-in-original-psych/index.html": "9d14593328c0681f",
+"curated_resources/reporting-in-experimental-philosophy-cur/index.html": "bc17d1d7ec09e7fb",
+"curated_resources/reporting-standards-for-complication-stu/index.html": "a2cff0deda50a683",
+"curated_resources/repository-of-psychological-instruments/index.html": "113e561a22977686",
+"curated_resources/representing-epistemic-and-disciplinary/index.html": "f8fbdd6653bd47d1",
+"curated_resources/reproducibilitea-introductory-reading-li/index.html": "63fe0502040cde0b",
+"curated_resources/reproducibilitea/index.html": "518646f3e53041e2",
+"curated_resources/reproducibility-and-replicability-of-qua/index.html": "8faccd69167c6a0a",
+"curated_resources/reproducibility-and-research-integrity-s/index.html": "0df9cbddab062baf",
+"curated_resources/reproducibility-for-everyone/index.html": "44d1094b20d01204",
+"curated_resources/reproducibility-immersive-course/index.html": "1d680ef74368a49f",
+"curated_resources/reproducibility-in-cancer-biology-the-ch/index.html": "05a5228f6de52447",
+"curated_resources/reproducibility-in-psychology-syllabus/index.html": "f5dbe2ce1ee8692c",
+"curated_resources/reproducibility-in-the-psychological-sci/index.html": "39e624dd8c143fcd",
+"curated_resources/reproducibility-librarianship-in-practic/index.html": "31376b36cf2f20d4",
+"curated_resources/reproducibility-open-science-and-clinica/index.html": "b460f87aa68a1c5f",
+"curated_resources/reproducibility-preservation-and-access/index.html": "06a486b06e1dd62a",
+"curated_resources/reproducible-and-reusable-research-are-j/index.html": "a80d8932ab9afa3e",
+"curated_resources/reproducible-and-transparent-research-pr/index.html": "888f7323202d488b",
+"curated_resources/reproducible-research-in-sport-and-exerc/index.html": "f44a2cbdfcb35243",
+"curated_resources/reproducible-research-methods/index.html": "92674a8a5ce8e9c4",
+"curated_resources/reproducible-research-practices-transpar/index.html": "57dba1b8d6a6e3fa",
+"curated_resources/reproducible-research-true-or-false/index.html": "e50591f99570a1cd",
+"curated_resources/reproducible-research-walking-the-walk/index.html": "c966d2ce4c08cd3a",
+"curated_resources/reproducible-research/index.html": "ff0950a4672b9dde",
+"curated_resources/reproducible-science-curriculum-lesson-f/index.html": "0f5e1b4bc1e90351",
+"curated_resources/reproducible-science-curriculum-lesson-f_2/index.html": "5aa3719159f0f575",
+"curated_resources/reproducible-science-curriculum-lesson-f_3/index.html": "c2495b62a1faf45a",
+"curated_resources/reproducible-science-curriculum-lesson-f_4/index.html": "192a9157115df29f",
+"curated_resources/reproducible-science-curriculum-lesson-f_5/index.html": "bae871b5cbe2c869",
+"curated_resources/reproducible-science-workshop/index.html": "8588e56f596afe8a",
+"curated_resources/reproducible-statistics-for-psychologist/index.html": "f8fd5d4a993fa2f3",
+"curated_resources/reputation-without-practice-a-dynamic-co/index.html": "6b74d23ffd71ad4a",
+"curated_resources/research-and-data-lessons-from-a-non-aca/index.html": "106a428011077a3f",
+"curated_resources/research-assessment-using-a-narrow-defin/index.html": "e36221a0f244a00a",
+"curated_resources/research-culture-is-broken-open-science/index.html": "6406c3290ba0b454",
+"curated_resources/research-integrity-and-open-science-i-ps/index.html": "a3d4231b0e367072",
+"curated_resources/research-integrity-and-responsible-schol/index.html": "5a7845848d6cec4c",
+"curated_resources/research-integrity-definitions-and-chall/index.html": "4f616444a886f97b",
+"curated_resources/research-methods-2020/index.html": "9bae423d0223a4a1",
+"curated_resources/research-methods-in-psychology-syllabus/index.html": "b1b4f65194cc8f40",
+"curated_resources/research-methods-in-psychology/index.html": "48def7872711580f",
+"curated_resources/research-methods-in-social-psychology/index.html": "dc4170b55a4d6ca3",
+"curated_resources/research-methods-in-social-psychology_2/index.html": "0c3d98f3c58c7b0a",
+"curated_resources/research-methods-psychology-summer-2021/index.html": "1654ee86b6c2ac97",
+"curated_resources/research-methods-syllabi/index.html": "e3b4d50e6502ed10",
+"curated_resources/research-misconduct/index.html": "54eb1c1df17fc155",
+"curated_resources/research-practices-and-statistical-repor/index.html": "123a332dd09f9660",
+"curated_resources/research-practices-for-a-robust-psycholo/index.html": "5c5c8691377dd991",
+"curated_resources/research-practices-that-can-prevent-an-i/index.html": "f809ce248c82f290",
+"curated_resources/research-preregistration-101/index.html": "ff036b00b2647b6c",
+"curated_resources/research-preregistration-as-a-teaching-a/index.html": "d306c9561ddb93ed",
+"curated_resources/research-preregistration-in-political-sc/index.html": "73ab7703e9124a3d",
+"curated_resources/research-project-initialization-and-orga/index.html": "197f14d0c8dabda4",
+"curated_resources/research-project-management-using-the-op/index.html": "3c341ac633f0c085",
+"curated_resources/research-support-games-list/index.html": "cb50d7d319f10ef8",
+"curated_resources/research-transparency-and-reproducibilit/index.html": "633f995b01c132b1",
+"curated_resources/researchers-intuitions-about-power-in-ps/index.html": "55807e831406d5b4",
+"curated_resources/reshaping-the-training-landscape-by-addr/index.html": "56dca84f23cc10e3",
+"curated_resources/resolving-the-tension-between-exploratio/index.html": "e906066347d638b1",
+"curated_resources/resource-lists-overview-for-working-with/index.html": "5f5c99f4c492d758",
+"curated_resources/resources-for-practicing-open-science-wi/index.html": "2f4e976d79b813c9",
+"curated_resources/resources-tutorials-papers-analysis-scri/index.html": "d327ad1d077bd451",
+"curated_resources/response-to-comment-on-estimating-the-re/index.html": "252262526b132066",
+"curated_resources/responsible-assessment-of-what-research/index.html": "ddc55f16dc62763c",
+"curated_resources/responsible-data-sharing-identifying-and/index.html": "987d412b8bedf50a",
+"curated_resources/responsible-research-assessment-should-p/index.html": "dfc8812dea60d872",
+"curated_resources/responsible-scholarship/index.html": "df7ad74229ed2fd2",
+"curated_resources/rethinking-research-assessment-addressin/index.html": "10534b9d348942ab",
+"curated_resources/rethinking-transparency-and-rigor-from-a/index.html": "28616dd40791a48f",
+"curated_resources/retiring-popper-critical-realism-falsifi/index.html": "d4de0d1307a23d33",
+"curated_resources/retraction-watch-michael-lacour-archives/index.html": "a07039c661acf6c6",
+"curated_resources/review-of-four-preregistration-registrie/index.html": "ac625aa3537a6059",
+"curated_resources/reviewer-bias-against-replication-resear/index.html": "3aba2130ade28f0d",
+"curated_resources/revisiting-the-replication-crisis-withou/index.html": "12231ed9ed37e65b",
+"curated_resources/rewarding-replications-a-sure-and-simple/index.html": "f901e8cd3a820fcb",
+"curated_resources/richard-mcelreath/index.html": "0c74d0f8fe56b4de",
+"curated_resources/rigor-and-reproducibility/index.html": "9a38ecc873272c2d",
+"curated_resources/rigor-champions-and-resources/index.html": "99794bd3cef00c53",
+"curated_resources/rigorous-exploration-in-a-model-centric/index.html": "0f7d546f97c27a5b",
+"curated_resources/rigorous-reproducible-research-practices/index.html": "d2e1c5b064caf183",
+"curated_resources/riot-science-club/index.html": "32f0fd6050c3eb31",
+"curated_resources/riposte-a-framework-for-improving-the-de/index.html": "9adde03edf06c691",
+"curated_resources/risk-of-bias-in-reports-of-in-vivo-resea/index.html": "5ecf48580dbb30d7",
+"curated_resources/rluk22-keynote-kaitlin-thaney-invest-in/index.html": "18d97a47069f697a",
+"curated_resources/robust-modeling-in-cognitive-science/index.html": "378a98ef1278fc00",
+"curated_resources/rpm-an-open-source-rotation-platform-for/index.html": "b6d09bced41d90fa",
+"curated_resources/rstudio-cheatsheets/index.html": "665f113521ca72d8",
+"curated_resources/safeguard-power-as-a-protection-against/index.html": "fd3e2ec04647a267",
+"curated_resources/sailing-from-the-seas-of-chaos-into-the/index.html": "babb7b07f661b279",
+"curated_resources/sample-size-in-psychological-research-ov/index.html": "f675daa30862bb2b",
+"curated_resources/sample-size-justification-shiny-app/index.html": "d85c031d376c697f",
+"curated_resources/sample-size-planning-for-more-accurate-s/index.html": "38df3c2994e8e6de",
+"curated_resources/sample-size-planning-for-statistical-pow/index.html": "6e2510c47fb802f6",
+"curated_resources/sample-size-planning-for-the-standardize/index.html": "601b7b09b2ae6417",
+"curated_resources/samply/index.html": "8f102b1d146de5d8",
+"curated_resources/sanctions-list-data-dates-of-birth-names/index.html": "84464ced45e0d393",
+"curated_resources/scandal-in-scientific-reform-the-breakin/index.html": "8c3d683b0d96ea2c",
+"curated_resources/scanning-the-horizon-towards-transparent/index.html": "8478323f70833a21",
+"curated_resources/scholarly-publishing-as-a-global-endeavo/index.html": "f14196a0acbfaf86",
+"curated_resources/school-psychology-annual-journal-update/index.html": "170f59f1a3d5a76f",
+"curated_resources/schools-should-teach-children-how-to-spo/index.html": "c6266f9e2e3a2d37",
+"curated_resources/science-and-pseudoscience-bbc-radio-talk/index.html": "1aa483a3089dccb7",
+"curated_resources/science-for-progress-initiative/index.html": "2c95470e98774b9e",
+"curated_resources/science-isn-t-broken/index.html": "42549a8605d1600f",
+"curated_resources/science-literacy/index.html": "cedce5a765d862e1",
+"curated_resources/science-of-psychological-phenomena-and-t/index.html": "57d690e7f7b1ff90",
+"curated_resources/science-or-art-how-aesthetic-standards-g/index.html": "d4d1c117ddbe4a64",
+"curated_resources/scientific-apophenia-in-strategic-manage/index.html": "9a2fea12b5bcc0c5",
+"curated_resources/scientific-reform-citation-politics-and/index.html": "9c799e3b9ec2354d",
+"curated_resources/scientific-utopia-i-opening-scientific-c/index.html": "19d1b116d43037e8",
+"curated_resources/scientific-utopia-ii-restructuring-incen/index.html": "b3868410327208b2",
+"curated_resources/scientific-utopia-ii-restructuring-incen_2/index.html": "118337fefe532de0",
+"curated_resources/scientists-reputations-are-based-on-gett/index.html": "128c8e28cbb52abb",
+"curated_resources/secondary-data-preregistration/index.html": "20f5207c0c38d16c",
+"curated_resources/seek-and-you-may-not-find-a-multi-instit/index.html": "9e3b1afa21595950",
+"curated_resources/selective-and-mis-leading-economics-jour/index.html": "3dbdaa17e9018d66",
+"curated_resources/self-reported-checklists-and-quality-sco/index.html": "2d61213c8500e320",
+"curated_resources/shall-we-really-do-it-again-the-powerful/index.html": "7b4ed255a8280f75",
+"curated_resources/sharestats-the-open-statistics-assessmen/index.html": "8b876eb2b8324c4c",
+"curated_resources/sharing-brain-imaging-data-in-the-open-s/index.html": "1f1967a021b6065f",
+"curated_resources/sharing-detailed-research-data-is-associ/index.html": "dab7f55db58ac7f9",
+"curated_resources/shifting-medical-education-the-impact-of/index.html": "c18664cb97a2c99c",
+"curated_resources/shifting-the-culture-of-peer-review-with/index.html": "fa3fcf12be051ec5",
+"curated_resources/short-r-script-to-plot-effect-sizes-cohe/index.html": "5ecef9ac3c34103f",
+"curated_resources/short-sweet-and-problematic-the-rise-of/index.html": "88d553093c3abda5",
+"curated_resources/should-preregistration-of-epidemiologic/index.html": "296963e8e050e71d",
+"curated_resources/signaling-the-trustworthiness-of-science/index.html": "ffc092c10cb4e278",
+"curated_resources/significance-tests-have-their-place/index.html": "5a1301b0b78a4456",
+"curated_resources/significance/index.html": "9ece9e719869ff57",
+"curated_resources/simple-heuristics-to-run-a-research-grou/index.html": "07973928e2d024a9",
+"curated_resources/sips-2016-what-does-diversity-mean-for-o/index.html": "e7656e45d949e805",
+"curated_resources/smaat/index.html": "ab42b28de3973a94",
+"curated_resources/small-telescopes-detectability-and-the-e/index.html": "4904f2c0862e5f12",
+"curated_resources/snapshot-reporting-practices-for-publish/index.html": "0a967198d4df7a3b",
+"curated_resources/sneaked-references-cooked-reference-meta/index.html": "61e505dc2eb3ef39",
+"curated_resources/social-behavioral-and-economic-sciences/index.html": "a713d1b079c58714",
+"curated_resources/social-identity-and-morality-lab-teachin/index.html": "e272cd719be7a862",
+"curated_resources/social-science-workshop-overview/index.html": "26b60edb7b342d9b",
+"curated_resources/social-sciences-research-methods-centre/index.html": "77a55e99aa21daa6",
+"curated_resources/software-carpentry/index.html": "d3060ee2b65a39b7",
+"curated_resources/sorry-we-re-open-come-in-we-re-closed-di/index.html": "d3f543184261f705",
+"curated_resources/sources-of-nonreplicability-in-aging-eth/index.html": "6fabedc6702bdeb1",
+"curated_resources/sparc-popular-resources/index.html": "f40ad9cef8cf897c",
+"curated_resources/special-issue-innovation-in-aging/index.html": "174aec0cced47089",
+"curated_resources/special-issue-preregistered-studies-of-p/index.html": "5d7da742663ccf20",
+"curated_resources/spiro-the-automated-petri-plate-imaging/index.html": "d8e425e9d3cf17ac",
+"curated_resources/springer-nature-announces-unified-open-c/index.html": "acd0f6577b63dcd7",
+"curated_resources/spsp-experts-open-science/index.html": "6a5a827c084652b7",
+"curated_resources/spurious-correlations/index.html": "348b7e7e8bb8148e",
+"curated_resources/standard-operating-procedures-a-safety-n/index.html": "a002562a5b62bd70",
+"curated_resources/star-wars-the-empirics-strike-back/index.html": "93a39c2ad62adef3",
+"curated_resources/stat-545/index.html": "42e3b0ac51b35d15",
+"curated_resources/statcheck/index.html": "bfb196b309247bda",
+"curated_resources/state-of-open-science-in-cancer-research/index.html": "0f9ce38a1eee3ebd",
+"curated_resources/statements-on-open-science-for-sustainab/index.html": "b7d04a212936699c",
+"curated_resources/statistical-errors-p-values-the-gold-sta/index.html": "0c7dc426c5da4653",
+"curated_resources/statistical-evidence-a-likelihood-paradi/index.html": "bbb9714b80e247db",
+"curated_resources/statistical-methods-in-psychological-res/index.html": "ed3141e863f763cf",
+"curated_resources/statistical-methods-in-psychology-journa/index.html": "1975362e3a52c804",
+"curated_resources/statistical-modeling-causal-inference-an/index.html": "3dd75f857de69f1e",
+"curated_resources/statistical-power-analysis/index.html": "f93fd1b6605d4251",
+"curated_resources/statistical-power-and-optimal-design-in/index.html": "2debed2e10d03ea3",
+"curated_resources/statistical-power-and-the-testing-of-nul/index.html": "65c9ea9b575eb67f",
+"curated_resources/statistical-power-in-operations-manageme/index.html": "be99eb22a5f86bd0",
+"curated_resources/statistical-power-of-psychological-resea/index.html": "c7aecbf5a395cd10",
+"curated_resources/statistical-power-problems-with-moderate/index.html": "ed5027acb1c4b863",
+"curated_resources/statistical-power-sample-size-and-their/index.html": "2dd79dee48082f6f",
+"curated_resources/statistical-procedures-and-the-justifica/index.html": "6a1c0562e7bd1908",
+"curated_resources/statistical-reporting-errors-and-collabo/index.html": "88a40426e483933a",
+"curated_resources/statistical-rethinking-winter-2015/index.html": "ccb6b8462ce463d6",
+"curated_resources/statistical-significance-and-the-dichoto/index.html": "cfeb1a90df805fcb",
+"curated_resources/statistical-significance-in-psychologica/index.html": "693b8bd9a9ab97a0",
+"curated_resources/statistical-significance-testing-and-cum/index.html": "2fb905d9ed62f08d",
+"curated_resources/statistical-tests-p-values-confidence-in/index.html": "cec4f7e7046b4b68",
+"curated_resources/statistics-and-quantitative-methods-exam/index.html": "ba58f3f2dcd2cbb4",
+"curated_resources/statistics-of-doom/index.html": "ef09bce801d83155",
+"curated_resources/statistics-with-jasp-and-the-open-scienc/index.html": "fc9bc3b44d7a0dd4",
+"curated_resources/stereotype-threat/index.html": "78d584c1859ffc54",
+"curated_resources/strong-inference/index.html": "81db339e22d69b5f",
+"curated_resources/study-preregistration-an-evaluation-of-a/index.html": "f080dae36dced644",
+"curated_resources/studying-the-association-between-lonelin/index.html": "519ee6d551154eca",
+"curated_resources/supporting-open-science-data-curation-pr/index.html": "e95b930963fcb80d",
+"curated_resources/supporting-robust-research-on-adult-emot/index.html": "6ea221499f026a3b",
+"curated_resources/supporting-study-registration-to-reduce/index.html": "e0c95cc5999d8f67",
+"curated_resources/supporting-the-next-generation-of-psycho/index.html": "d8343f1f71412828",
+"curated_resources/surrogate-science-the-idol-of-a-universa/index.html": "27b4fe0bde98a2a7",
+"curated_resources/swirl/index.html": "72563c1aea1a147e",
+"curated_resources/syllabus-replicability/index.html": "f876057196a75e19",
+"curated_resources/symposium-qualitative-open-science-chall/index.html": "d33503043362ebb8",
+"curated_resources/systematic-review-of-the-empirical-evide/index.html": "91237c3d396d2be5",
+"curated_resources/systematic-reviews-and-meta-analysis/index.html": "a0b5904a7fcf4040",
+"curated_resources/taking-stock-of-the-credibility-revoluti/index.html": "77685ad18312adff",
+"curated_resources/taking-stock-of-the-credibility-revoluti_2/index.html": "3ff4494267f3797a",
+"curated_resources/taxonomia-da-ciencia-aberta-revisada-e-a/index.html": "089346f12ae85822",
+"curated_resources/teaching-and-mentoring-open-science/index.html": "06af438fea3967af",
+"curated_resources/teaching-open-and-reproducible-scholarsh/index.html": "f756bbad2381b582",
+"curated_resources/teaching-psych-science/index.html": "cda5195523112240",
+"curated_resources/teaching-replicable-and-reproducible-sci/index.html": "2b97b6aaa4a58d22",
+"curated_resources/teaching-replication-in-psychology-a-gui/index.html": "dea7545992d2b13e",
+"curated_resources/teaching-replication-in-social-sciences/index.html": "ba8992acd3f79be3",
+"curated_resources/teaching-replication-to-graduate-student/index.html": "cdfc2e76cbb184d9",
+"curated_resources/teaching-replication/index.html": "9a706cf2fe32e609",
+"curated_resources/teaching-resources-spreadsheet/index.html": "9dcb1e613ab881c5",
+"curated_resources/teaching-the-why-and-how-of-replication/index.html": "e5bf75a45ec2c277",
+"curated_resources/team-neurodiversity/index.html": "69510a2f97f4172c",
+"curated_resources/template-preregistration-registered-repo/index.html": "2eb4ef5775874078",
+"curated_resources/ten-quick-tips-for-building-fair-workflo/index.html": "26f34e5683cd2f84",
+"curated_resources/ten-simple-rules-for-effective-statistic/index.html": "346938e0463f3a59",
+"curated_resources/ten-simple-rules-for-pushing-boundaries/index.html": "78d21e54805438ac",
+"curated_resources/ten-simple-rules-for-reproducible-comput/index.html": "f7c62c9ee92eebeb",
+"curated_resources/ten-simple-rules-for-the-care-and-feedin/index.html": "24dcfad218e597c4",
+"curated_resources/ten-strategies-to-foster-open-science-in/index.html": "96b7e7d6565af3b6",
+"curated_resources/tension-between-theory-and-practice-of-r/index.html": "fa1cc18d22b7ba92",
+"curated_resources/the-52-symptoms-of-major-depression-lack/index.html": "7d8e705fbded6255",
+"curated_resources/the-academic-impact-of-open-science-a-sc/index.html": "6e3dde5817f56e13",
+"curated_resources/the-amazing-significo-why-researchers-ne/index.html": "22d91605e8998ca8",
+"curated_resources/the-appropriate-use-of-null-hypothesis-t/index.html": "9bf32d31c1a701b8",
+"curated_resources/the-asa-statement-on-p-values-context-pr/index.html": "8dac4b5f3bc5a64e",
+"curated_resources/the-baby-factory-difficult-research-obje/index.html": "95a0e1060a7b68b1",
+"curated_resources/the-bayes-factor/index.html": "531a7635936c52c7",
+"curated_resources/the-bayesfactor-blog/index.html": "1c485cd7a7052cbd",
+"curated_resources/the-bayesian-reproducibility-project/index.html": "3f7b47bcaff655a5",
+"curated_resources/the-benefits-of-preregistration-and-regi/index.html": "3a5ea015ca44bf3e",
+"curated_resources/the-benefits-of-preregistration-for-hypo/index.html": "431f505f2e8d9830",
+"curated_resources/the-black-goat/index.html": "ec23a9d60c73a7fa",
+"curated_resources/the-buffet-approach-to-open-science/index.html": "8edfac08a7082168",
+"curated_resources/the-case-against-statistical-significanc/index.html": "cd3f50e4f468a39f",
+"curated_resources/the-case-for-formal-methodology-in-scien/index.html": "4cfdaf1978dba1c5",
+"curated_resources/the-case-for-using-educational-scholarsh/index.html": "319cdb4f0819827f",
+"curated_resources/the-challenges-of-open-data-sharing-for/index.html": "be4570cbef0c267c",
+"curated_resources/the-chinese-open-science-network-cosn-bu/index.html": "e84fa8d3d058abf8",
+"curated_resources/the-chrysalis-effect-how-ugly-initial-re/index.html": "4be61eeaec683e6a",
+"curated_resources/the-citation-advantage-of-linking-public/index.html": "47f84ce290a754e8",
+"curated_resources/the-clinicaltrials-gov-results-database/index.html": "bff54a0b93cf81cf",
+"curated_resources/the-corpus-of-language-discrimination-in/index.html": "2adf9bb152bfe963",
+"curated_resources/the-costs-of-competition-in-distributing/index.html": "743740882e17315e",
+"curated_resources/the-costs-of-harking/index.html": "6100a71bed55fbcb",
+"curated_resources/the-crisis-of-confidence-in-social-psych/index.html": "bf874413e629cf1b",
+"curated_resources/the-cumulative-effect-of-reporting-and-c/index.html": "9135044b424866d7",
+"curated_resources/the-default-bayesian-test-is-prejudiced/index.html": "99bdfa1a75f96dd9",
+"curated_resources/the-earth-is-flat-p-0-05-significance-th/index.html": "76997f26e49bc998",
+"curated_resources/the-earth-is-round-p-05/index.html": "4e82285fa1d1db72",
+"curated_resources/the-economics-of-reproducibility-in-prec/index.html": "28f6b43bcbdb6106",
+"curated_resources/the-effect-of-horizontal-eye-movements-o/index.html": "a928509017506a4d",
+"curated_resources/the-effect-of-preregistration-on-trust-i/index.html": "10a9fae647dabb7a",
+"curated_resources/the-effect-of-publishing-peer-review-rep/index.html": "c742c17428d1ee99",
+"curated_resources/the-empirical-benefits-of-conceptual-rig/index.html": "5d8e0726ed236210",
+"curated_resources/the-empirical-march-making-science-bette/index.html": "05512148c7272af6",
+"curated_resources/the-existence-of-publication-bias-and-ri/index.html": "189ae617eba5c61d",
+"curated_resources/the-experiment-experiment/index.html": "0fb0084963839945",
+"curated_resources/the-extent-and-consequences-of-p-hacking/index.html": "351736b915b7c9bf",
+"curated_resources/the-fickle-p-value-generates-irreproduci/index.html": "9fb0f66b5294f826",
+"curated_resources/the-file-drawer-problem-and-tolerance-fo/index.html": "774524b1c2bc179d",
+"curated_resources/the-frequency-of-excess-success-for-arti/index.html": "ffb846791ba86e11",
+"curated_resources/the-garden-of-forking-paths-why-multiple/index.html": "bbd5be77adaa75e2",
+"curated_resources/the-general-linear-model-semester-2/index.html": "59376c5c28ca6f65",
+"curated_resources/the-generalizability-of-survey-experimen/index.html": "fa78c7057d011cb1",
+"curated_resources/the-go-fair-foundation-s-fair-capacity-b/index.html": "2ed9b7267ad3b59c",
+"curated_resources/the-grim-test-a-simple-technique-detects/index.html": "b34f030858177203",
+"curated_resources/the-hardest-science/index.html": "2a44cb207ed821a9",
+"curated_resources/the-harm-done-by-tests-of-significance/index.html": "17963fc6eeae39ea",
+"curated_resources/the-influence-of-journal-submission-guid/index.html": "8cecf38244e68437",
+"curated_resources/the-invisible-workload-of-open-research/index.html": "8707034667bb4cb9",
+"curated_resources/the-ironic-effect-of-significant-results/index.html": "7cff39dc33509348",
+"curated_resources/the-landscape-of-open-science-in-behavio/index.html": "96da36405404dbfd",
+"curated_resources/the-logical-structure-of-experiments-lay/index.html": "a203b78d4e7e0996",
+"curated_resources/the-meaning-of-significance-for-differen/index.html": "de381908a4ddb4ce",
+"curated_resources/the-meaningfulness-of-effect-sizes-in-ps/index.html": "372a285023c5770e",
+"curated_resources/the-mis-reporting-of-statistical-results/index.html": "f93d8a44fad1978d",
+"curated_resources/the-missing-semester-of-your-cs-educatio/index.html": "c8c969b1b04863c2",
+"curated_resources/the-n-pact-factor-evaluating-the-quality/index.html": "4b80a1e0c863bca0",
+"curated_resources/the-natural-selection-of-bad-science/index.html": "0e41681ea95a0f81",
+"curated_resources/the-need-for-public-opinion-and-survey-m/index.html": "9b91a51d489825d6",
+"curated_resources/the-needed-link-between-open-science-and/index.html": "acf1f282dba63527",
+"curated_resources/the-new-statistics-confidence-intervals/index.html": "09ef1cff75600cb7",
+"curated_resources/the-new-statistics-effect-sizes-and-conf/index.html": "1b21a6bcd48c87ac",
+"curated_resources/the-new-statistics-meta-analysis-and-met/index.html": "c9bba1dae891de70",
+"curated_resources/the-new-statistics-planning-power-and-pr/index.html": "94a1e33bd10b3f9a",
+"curated_resources/the-new-statistics-research-integrity-th/index.html": "db63c93844c35d40",
+"curated_resources/the-new-statistics-the-new-statistics-in/index.html": "b77f841bd9136471",
+"curated_resources/the-new-statistics-why-and-how/index.html": "6ffa7607048411c9",
+"curated_resources/the-null-hypothesis-significance-testing/index.html": "c019716a7d96c34c",
+"curated_resources/the-null-ritual-what-you-always-wanted-t/index.html": "1db94b759ae451a6",
+"curated_resources/the-o3-guidelines-open-data-open-code-an/index.html": "dfa0ba5e68c3b1b3",
+"curated_resources/the-open-research-lifecycle/index.html": "6b20113a8985cf3d",
+"curated_resources/the-open-research-toolkit/index.html": "1bb964975fed9274",
+"curated_resources/the-open-science-training-handbook/index.html": "b785d01c9bfb894b",
+"curated_resources/the-p-value-misconception-eradication-ch/index.html": "996fd812158e1028",
+"curated_resources/the-papor-trail-course-principles-and-pr/index.html": "7e601b6a415068a5",
+"curated_resources/the-past-present-and-future-of-registere/index.html": "792a5ad6cba67e0d",
+"curated_resources/the-peer-reviewers-openness-initiative-i/index.html": "4e11b0f527f606d4",
+"curated_resources/the-persistence-of-underpowered-studies/index.html": "d045d39043eed0a8",
+"curated_resources/the-pipeline-project-pre-publication-ind/index.html": "453ebf2c441899db",
+"curated_resources/the-poor-availability-of-psychological-r/index.html": "59f22a5fd0a3e95a",
+"curated_resources/the-poor-availability-of-syntaxes-of-str/index.html": "398af989c90653f5",
+"curated_resources/the-post-embargo-open-access-citation-ad/index.html": "29c7316df67d60ab",
+"curated_resources/the-power-of-many-brains-catalyzing-neur/index.html": "62c0fda0bb48ea7d",
+"curated_resources/the-preregistration-challenge-a-how-to-g/index.html": "595f62127adb59fd",
+"curated_resources/the-preregistration-prescriptiveness-tra/index.html": "ff019dde1d149495",
+"curated_resources/the-preregistration-revolution-needs-to/index.html": "3c7515baa79c392b",
+"curated_resources/the-preregistration-revolution/index.html": "8c47e4fecba8b646",
+"curated_resources/the-prevalence-of-statistical-reporting/index.html": "cfb67800d7f379ee",
+"curated_resources/the-problem-of-new-evidence-p-hacking-an/index.html": "e830c0f1e77e2909",
+"curated_resources/the-promises-and-pitfalls-of-preregistra/index.html": "c3a48524f4235d6d",
+"curated_resources/the-promises-and-pitfalls-of-preregistra_2/index.html": "a754cef44b9be55a",
+"curated_resources/the-psychological-reality-of-the-learned/index.html": "69c4e74a3bcec8a4",
+"curated_resources/the-psychological-reality-of-the-learned_2/index.html": "aac5e78ae9c10d8f",
+"curated_resources/the-psychology-of-experimental-psycholog/index.html": "4988cb9a1c987ba8",
+"curated_resources/the-quantitative-paradigm-and-the-nature/index.html": "8b979e28146c65de",
+"curated_resources/the-race-in-academia-collective/index.html": "8484c1bacfcc04ab",
+"curated_resources/the-relation-between-statistical-power-a/index.html": "6cbeb70ca54b7f64",
+"curated_resources/the-replication-crisis-in-psychology/index.html": "c8205dc1eb33ec5c",
+"curated_resources/the-replication-crisis-is-less-of-a-cris/index.html": "3ac0bca834b1cd11",
+"curated_resources/the-replication-crisis-is-less-of-a-cris_2/index.html": "646f93ab82bea82e",
+"curated_resources/the-replication-database-documenting-the/index.html": "70aa1583f1b65a93",
+"curated_resources/the-replication-recipe-what-makes-for-a/index.html": "981f9882d5e89586",
+"curated_resources/the-reporting-completeness-and-transpare/index.html": "16613d908bcea3ba",
+"curated_resources/the-reputational-consequences-of-failed/index.html": "ac6ce11b1bce9ba6",
+"curated_resources/the-role-of-libraries-in-the-age-of-comp/index.html": "f45fb0d5ba0db870",
+"curated_resources/the-role-of-replication-research-in-adva/index.html": "cc5b420607c2fcc9",
+"curated_resources/the-rules-of-the-game-called-psychologic/index.html": "6942ecd88553a2e8",
+"curated_resources/the-secret-to-writing-a-great-nasa-propo/index.html": "615ee6bf7b161396",
+"curated_resources/the-societal-impact-of-open-science-a-sc/index.html": "7cd8223a82b38b9e",
+"curated_resources/the-societal-impact-of-open-science-a-sc_2/index.html": "1c0f8840a303c713",
+"curated_resources/the-state-of-play-of-reproducibility-in/index.html": "7c7b00a2bcfca456",
+"curated_resources/the-state-of-social-and-personality-scie/index.html": "d41162738a83870e",
+"curated_resources/the-state-of-the-science-address/index.html": "60596bd712eda744",
+"curated_resources/the-statistical-power-of-abnormal-social/index.html": "dc010ff89d061104",
+"curated_resources/the-stem-education-hub-helps-your-resear/index.html": "76428e79470307de",
+"curated_resources/the-superego-the-ego-and-the-id-in-stati/index.html": "dce7181a7d963663",
+"curated_resources/the-t-distritbution-and-its-normal-appro/index.html": "bdc5818ba48cfb60",
+"curated_resources/the-test-of-insufficient-variance-tiva-a/index.html": "5d3248a121d025a7",
+"curated_resources/the-tone-debate-knowledge-self-and-socia/index.html": "dd579694b2e00499",
+"curated_resources/the-transparency-of-quantitative-empiric/index.html": "34baf69db070e156",
+"curated_resources/the-trustworthiness-of-the-cumulative-kn/index.html": "d4b9c491faa72134",
+"curated_resources/the-unix-shell/index.html": "66de2d88c8beedea",
+"curated_resources/the-value-of-direct-replication/index.html": "f06ec1355d469fc0",
+"curated_resources/the-value-of-openness-in-open-science/index.html": "e007e370781baafb",
+"curated_resources/the-value-of-preregistration-for-psychol/index.html": "d098222d7af090e5",
+"curated_resources/the-values-and-practice-of-science/index.html": "703b3efd16fc021a",
+"curated_resources/the-weak-spots-in-contemporary-science-a/index.html": "c18dee8ecad6eef8",
+"curated_resources/the-web-of-schizotypal-personality-trait/index.html": "4688f55ef8e1fe04",
+"curated_resources/the-what-why-and-how-of-born-open-data/index.html": "6cabd04bd08536ef",
+"curated_resources/the-what-why-and-how-of-preregistration/index.html": "fa31bb156848aac3",
+"curated_resources/theoretical-risks-and-tabular-asterisks/index.html": "e9a295d20e5e5870",
+"curated_resources/theory-construction-and-model-building-s/index.html": "6b02bfc2036958c3",
+"curated_resources/theory-testing-in-psychology-and-physics/index.html": "726900e9d298def5",
+"curated_resources/there-is-no-theory-crisis-in-psychologic/index.html": "2fcc01a07ce2932b",
+"curated_resources/things-i-have-learned-so-far/index.html": "519ab31e7cde46d8",
+"curated_resources/three-ways-to-recognize-hidden-labour-in/index.html": "346977d33ffc1b5a",
+"curated_resources/tie-my-hands-loosely-pre-analysis-plans/index.html": "9a9846a59f48a096",
+"curated_resources/too-true-to-be-bad-when-sets-of-studies/index.html": "b90701055822970b",
+"curated_resources/toolkit-for-aligning-incentives-2-0/index.html": "7bf5fef2af0eda6b",
+"curated_resources/tools-for-reproducible-research/index.html": "34fe99d16a743c8c",
+"curated_resources/top-guidelines/index.html": "fd0151239d1a2663",
+"curated_resources/top-tips-for-navigating-your-career-the/index.html": "8282a6831fed4d0b",
+"curated_resources/topicos-especiais-em-biotecnologia-plane/index.html": "71404c553094af83",
+"curated_resources/topics-in-social-psychology-and-personal/index.html": "b8bb5b3c56b3b2c6",
+"curated_resources/toward-a-21st-century-national-data-infr/index.html": "37614d615e6918dc",
+"curated_resources/toward-a-more-accurate-notion-of-explora/index.html": "9f2a9813d040c5e7",
+"curated_resources/toward-a-more-credible-assessment-of-the/index.html": "27c6a18d8c575d8e",
+"curated_resources/toward-reproducible-computational-resear/index.html": "400cb29c24c0780d",
+"curated_resources/towards-a-culture-of-open-scholarship-th/index.html": "2ab5e6f87a35e608",
+"curated_resources/towards-building-a-trustworthy-pipeline/index.html": "f008b551528e03cf",
+"curated_resources/towards-inclusive-funding-practices-for/index.html": "8ee344f15ad1da86",
+"curated_resources/towards-inclusive-mentoring-in-academic/index.html": "1659e6d695eead90",
+"curated_resources/towards-reproducible-radiomics-research/index.html": "31a7fab889f2f349",
+"curated_resources/tracking-replicability-as-a-method-of-po/index.html": "2400498e10ed3b19",
+"curated_resources/trainer-space-for-the-introduction-to-op/index.html": "5c40fd4d236c1456",
+"curated_resources/transdisciplinary-global-health-challeng/index.html": "45173db420c7830a",
+"curated_resources/transform-to-open-science/index.html": "591d70c489d20370",
+"curated_resources/transparency-and-open-science-symposium/index.html": "e9b53f627ec6a0bf",
+"curated_resources/transparency-of-chi-research-artifacts-r/index.html": "25d45d7fd7a8fa55",
+"curated_resources/transparency-replicability-and-discovery/index.html": "1eb42f4de1aa674b",
+"curated_resources/transparent-and-open-social-science-rese/index.html": "43f98707bd349507",
+"curated_resources/transparent-reproducible-and-open-scienc/index.html": "59cb50594218f32b",
+"curated_resources/transparent-science-a-more-credible-repr/index.html": "f0c8035ee9143ae6",
+"curated_resources/trial-publication-after-registration-in/index.html": "e9bd702b7c97c4a6",
+"curated_resources/trial-registration-10-years-on/index.html": "be9d133d75f3b73d",
+"curated_resources/trust-your-science-open-your-data-and-co/index.html": "5ae41d3c4d981941",
+"curated_resources/turtle-and-hare-workshops-exchanging-sof/index.html": "69f6101d35d6b673",
+"curated_resources/tutorial-r-code-for-creating-funnel-fore/index.html": "b3485b8f19cd64f9",
+"curated_resources/tutorial-r-code-for-creating-plots-for-2/index.html": "67a8e0241bfba870",
+"curated_resources/tutorial-r-code-for-creating-scree-paral/index.html": "6089cefb61f089ff",
+"curated_resources/two-years-later-journals-are-not-yet-enf/index.html": "e92732d752d70e43",
+"curated_resources/type-i-error-rates-are-not-usually-infla/index.html": "54d81e4904688237",
+"curated_resources/ukrn-open-research-primers/index.html": "00640581ab8f94e1",
+"curated_resources/ukrn/index.html": "910b765d79c9982c",
+"curated_resources/ulysses-pact-or-ulysses-raft-using-pre-a/index.html": "c81924b8f9555a0d",
+"curated_resources/uncertainty-is-science-s-superpower-make/index.html": "7a0d5c94425293e0",
+"curated_resources/underreporting-in-psychology-experiments/index.html": "5741544fe607d00d",
+"curated_resources/understanding-bayes-a-look-at-the-likeli/index.html": "4f0d758a1afb1dea",
+"curated_resources/understanding-bayes-visualization-of-the/index.html": "85abc462a6baa4e3",
+"curated_resources/understanding-psychology-as-a-science-an/index.html": "e973fe4ad34e3e90",
+"curated_resources/understanding-statistical-power-and-sign/index.html": "988463ee6f2faa84",
+"curated_resources/understanding-the-provenance-and-quality/index.html": "e2d4c154c20b640d",
+"curated_resources/understanding-the-value-of-curation-a-su/index.html": "43a3a81d674ec8ad",
+"curated_resources/unesco-recommendation-on-open-science/index.html": "6bc917cea757aeac",
+"curated_resources/universities-should-put-educational-mate/index.html": "2894e38c923f964f",
+"curated_resources/unlikely-results/index.html": "91a44c5280e14a8b",
+"curated_resources/up-front-and-open-shrouded-in-secrecy-or/index.html": "e64d9507ee198e5e",
+"curated_resources/update-on-the-endorsement-of-consort-by/index.html": "e7107abec612b337",
+"curated_resources/update-on-trial-registration-11-years-af/index.html": "950a959f9d4836c9",
+"curated_resources/us-project-seeks-standard-way-to-communi/index.html": "c9cdcd347f8c6c81",
+"curated_resources/use-of-the-journal-impact-factor-in-acad/index.html": "330b3e40c444077d",
+"curated_resources/using-artificial-intelligence-to-create/index.html": "4115720fe4841f12",
+"curated_resources/using-osf-to-share-data-a-step-by-step-g/index.html": "7c891cf0a9d235ad",
+"curated_resources/using-pre-analysis-plans-in-qualitative/index.html": "a228d2d639e7404f",
+"curated_resources/using-prediction-markets-to-estimate-the/index.html": "6593d0564721c70d",
+"curated_resources/using-r-and-lme-lmer-to-fit-different-tw/index.html": "513f2d48f9d5d7b0",
+"curated_resources/using-science-and-psychology-to-improve/index.html": "e731f6fc6cf335c2",
+"curated_resources/using-the-transparency-checklist-guideli/index.html": "b043ba4aed6bbae8",
+"curated_resources/va-big-data-science-a-model-for-improved/index.html": "2e0d0c4770672355",
+"curated_resources/version-control-with-the-osf/index.html": "855b197b8ec96912",
+"curated_resources/visualizing-a-one-way-anova-using-d3-js/index.html": "a22cd5bcfddf95d7",
+"curated_resources/volunteerism-has-gone-too-far/index.html": "d217106d21d86040",
+"curated_resources/want-to-speed-up-scientific-progress-fir/index.html": "516067c8a129b87a",
+"curated_resources/we-built-this-culture-so-we-can-change-i/index.html": "9a6621a9261d2cde",
+"curated_resources/we-have-to-break-up/index.html": "1455ff90c4658012",
+"curated_resources/we-knew-the-future-all-along-scientific/index.html": "fceac8b6b16bcb7e",
+"curated_resources/welcoming-quality-in-non-significance-an/index.html": "c92f7c8bc033e33d",
+"curated_resources/what-does-open-science-mean-for-educatio/index.html": "c3f183536cfcc78c",
+"curated_resources/what-does-research-reproducibility-mean/index.html": "ab5fc243dd1b5b87",
+"curated_resources/what-incentives-increase-data-sharing-in/index.html": "f3fc6aa5d96d294c",
+"curated_resources/what-is-a-p-value/index.html": "1a8c8c6897e305e7",
+"curated_resources/what-is-replication/index.html": "7402054e8d0ea477",
+"curated_resources/what-is-statistical-power/index.html": "6710c9557751edc5",
+"curated_resources/what-is-the-replication-crisis-a-crisis/index.html": "cc7dcb794c75312d",
+"curated_resources/what-is-this-thing-called-open-science/index.html": "f615eba7980b5d3d",
+"curated_resources/what-is-universal-design-for-learning-ud/index.html": "bf1d5fa5ea473ff3",
+"curated_resources/what-makes-a-good-theory-and-how-do-we-m/index.html": "7beb989d2803f9c4",
+"curated_resources/what-s-new-in-neuro/index.html": "03d900c8a0f18b02",
+"curated_resources/what-s-wrong-with-psychology-anyway/index.html": "dc46b38ec5046b4c",
+"curated_resources/what-s-wrong-with-statistical-tests-and/index.html": "6dda7667022debe5",
+"curated_resources/what-should-a-preregistration-contain/index.html": "98f0c3f2b992fbb5",
+"curated_resources/what-you-see-is-what-you-get-enhancing-m/index.html": "46099fce0be66c84",
+"curated_resources/when-does-harking-hurt-identifying-when/index.html": "1bcff6400ff92f7d",
+"curated_resources/when-great-minds-think-unalike-inside-sc/index.html": "966baec51da260f0",
+"curated_resources/when-is-science-un-reliable/index.html": "49844b3372961e20",
+"curated_resources/when-power-analyses-based-on-pilot-data/index.html": "58ea066138830547",
+"curated_resources/which-is-the-correct-statistical-test-to/index.html": "ad39d754337f98df",
+"curated_resources/who-re-uses-data-a-bibliometric-analysis/index.html": "b6e3589202904de1",
+"curated_resources/who-would-have-thought-that-we-needed-an/index.html": "7d213b79b7db4a52",
+"curated_resources/why-an-entire-field-of-psychology-is-in/index.html": "25d8d84205ef193c",
+"curated_resources/why-and-how-to-use-pre-analysis-plans/index.html": "138a6ea8ab7b8ccb",
+"curated_resources/why-hypothesis-testers-should-spend-less/index.html": "d992403dc45d9ae9",
+"curated_resources/why-most-discovered-true-associations-ar/index.html": "eff12e8465c593bf",
+"curated_resources/why-most-of-psychology-is-statistically/index.html": "7689658ec7d78b8e",
+"curated_resources/why-most-published-research-findings-are/index.html": "5eb18711434962a9",
+"curated_resources/why-nasa-and-federal-agencies-are-declar/index.html": "d5930e684bb711ab",
+"curated_resources/why-p-048-should-be-rare-and-why-this-fe/index.html": "61671495e9e9da1c",
+"curated_resources/why-preregistration-makes-me-nervous/index.html": "30e23e1c8862f128",
+"curated_resources/why-psychologists-food-fight-matters/index.html": "ffe6d806b15da383",
+"curated_resources/why-psychologists-must-change-the-way-th/index.html": "27049061aa70d6f0",
+"curated_resources/why-summaries-of-research-on-psychologic/index.html": "325a4914f45c7e2a",
+"curated_resources/wide-open-accelerating-public-data-relea/index.html": "a3aaaf43c9b37779",
+"curated_resources/will-funders-have-the-patience-to-reform/index.html": "aae344e36a541df4",
+"curated_resources/willingness-to-share-research-data-is-re/index.html": "d0ea2bbd16373b50",
+"curated_resources/with-low-power-comes-low-credibility-tow/index.html": "f69679cc0302cd29",
+"curated_resources/workflow-for-awarding-badges/index.html": "3123401b34a94904",
+"curated_resources/writing-a-data-management-plan-for-grant/index.html": "110092247c441438",
+"curated_resources/writing-reproducible-geoscience-papers-u/index.html": "8c83738ff0f82daf",
+"curated_resources/you-are-not-so-smart/index.html": "ec642396e8eb5531",
+"curated_resources/you-cannot-step-into-the-same-river-twic/index.html": "8681653b93e62b32",
+"curated_resources/your-questions-answered-how-to-retain-co/index.html": "c1a65de2617c6de6",
+"curated_resources/zootraits-an-r-shiny-app-for-exploring-a/index.html": "aa60effd2a24e226",
+"cv/index.html": "cfa57f77ab708053",
+"dei/index.html": "8b4acddfd02101bc",
+"disciplines/index.html": "029028198534eeb4",
+"educators-corner/001-representation-heatherurry/index.html": "7dedae496d226b53",
+"educators-corner/002-transparencychecklist-balazsaczel/index.html": "de8ab7e3d67dc5b8",
+"educators-corner/003-developing-tools/index.html": "e6bd99d156d6229b",
+"educators-corner/004-teaching-why-how-replication/index.html": "f7a9aafc47614728",
+"educators-corner/005-remote-teaching-platform/index.html": "15e0ed287a6c7a4a",
+"educators-corner/006-qualitative-os-practices/index.html": "a4d199d772961507",
+"educators-corner/007-easy-steps-to-elevate-your-mentoring/index.html": "77cc35292d8aee17",
+"educators-corner/008-open-research-toolkit/index.html": "1fa09652449b9313",
+"educators-corner/009-papor-trail/index.html": "bb85a8634535759c",
+"educators-corner/010-neurodiversity/index.html": "0733a6849e9c36d6",
+"educators-corner/011-intersectionality-open-science/index.html": "0a9454826e04d96e",
+"educators-corner/012-lessons-from-non-academic-jobs/index.html": "fead0e66dce0a249",
+"educators-corner/013-introducing-nowhere-lab/index.html": "bca8ffbc97e6470f",
+"educators-corner/014-students-guide-to-open-science/index.html": "2da8a3adca14e917",
+"educators-corner/015-academic-jobs-us-vs-uk/index.html": "8df3df53be87a171",
+"educators-corner/016-reviewer-zero/index.html": "40df215a502205be",
+"educators-corner/017-teaching-os-to-undergraduates/index.html": "443b006b5cc01715",
+"educators-corner/018-accessible-feedback-in-research/index.html": "8f9ca81f0b63cff8",
+"educators-corner/019-being-a-minoritized-early-career-researcher-in-political-psychology/index.html": "d5d86c17a33c0de5",
+"educators-corner/020-community-augmented-meta-analyses-in-education/index.html": "d21d0c9caf4fd4a5",
+"educators-corner/021-lmu-forrt-train-the-trainer-program-press-release/index.html": "97bb1990d9981443",
+"educators-corner/022-repro-metrics-forrt-irise/index.html": "e3815f30bd0bf9e4",
+"educators-corner/023-forward-a-unesco-decade-of-science-programme/index.html": "4973b4bdae831659",
+"educators-corner/024-meaningful_results_for_meaningful_hypotheses/index.html": "cd9cab5744b31be7",
+"educators-corner/index.html": "7b282ca1852eea7b",
+"educators-corner/page/2/index.html": "7b282ca1852eea7b",
+"educators-corner/page/3/index.html": "7b282ca1852eea7b",
+"equityinos/index.html": "c46903a4b97398e0",
+"feedback/index.html": "24a8fd2007e651d4",
+"forrt_clusters/academic-life-and-culture/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/10/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/11/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/12/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/13/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/14/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/15/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/16/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/17/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/18/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/19/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/2/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/20/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/21/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/22/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/23/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/24/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/25/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/26/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/27/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/3/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/4/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/5/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/6/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/7/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/8/index.html": "361e328774818391",
+"forrt_clusters/academic-life-and-culture/page/9/index.html": "361e328774818391",
+"forrt_clusters/conceptual-and-statistical-knowledge/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/10/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/11/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/12/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/13/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/14/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/15/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/16/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/17/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/18/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/19/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/2/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/20/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/21/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/22/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/23/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/24/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/25/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/26/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/27/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/28/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/29/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/3/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/30/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/31/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/32/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/33/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/34/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/35/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/36/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/37/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/4/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/5/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/6/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/7/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/8/index.html": "a192abf81b3bd63f",
+"forrt_clusters/conceptual-and-statistical-knowledge/page/9/index.html": "a192abf81b3bd63f",
+"forrt_clusters/index.html": "6a0a8814b79dd082",
+"forrt_clusters/open-data-and-materials/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/10/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/11/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/12/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/13/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/14/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/15/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/16/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/17/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/18/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/19/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/2/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/20/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/21/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/22/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/23/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/24/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/25/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/26/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/27/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/28/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/29/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/3/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/30/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/31/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/32/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/33/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/4/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/5/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/6/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/7/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/8/index.html": "ea481d154aa71fda",
+"forrt_clusters/open-data-and-materials/page/9/index.html": "ea481d154aa71fda",
+"forrt_clusters/preregistration/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/10/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/11/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/12/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/13/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/14/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/15/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/16/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/17/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/18/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/19/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/2/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/20/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/21/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/22/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/23/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/24/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/25/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/26/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/27/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/3/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/4/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/5/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/6/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/7/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/8/index.html": "50c287007c768f92",
+"forrt_clusters/preregistration/page/9/index.html": "50c287007c768f92",
+"forrt_clusters/replication-research/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/10/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/11/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/12/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/13/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/14/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/15/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/16/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/17/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/18/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/19/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/2/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/20/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/21/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/22/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/23/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/24/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/25/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/26/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/27/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/28/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/29/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/3/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/30/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/31/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/32/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/33/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/4/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/5/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/6/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/7/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/8/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/replication-research/page/9/index.html": "ad87bb8ee31c4f2e",
+"forrt_clusters/reproducibility-and-replicability-knowledge/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/10/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/11/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/12/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/13/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/14/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/15/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/16/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/17/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/18/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/19/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/2/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/20/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/21/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/22/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/23/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/24/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/25/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/26/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/27/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/28/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/29/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/3/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/30/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/31/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/32/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/33/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/34/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/35/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/36/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/37/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/38/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/39/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/4/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/40/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/41/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/42/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/43/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/44/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/45/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/46/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/47/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/48/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/49/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/5/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/50/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/6/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/7/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/8/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducibility-and-replicability-knowledge/page/9/index.html": "a1d771b722f006ed",
+"forrt_clusters/reproducible-analyses/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/10/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/11/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/12/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/13/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/14/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/15/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/16/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/17/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/18/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/19/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/2/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/20/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/21/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/22/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/23/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/24/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/3/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/4/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/5/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/6/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/7/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/8/index.html": "9bfea2bcf77d8080",
+"forrt_clusters/reproducible-analyses/page/9/index.html": "9bfea2bcf77d8080",
+"games/index.html": "af5c18766f6ff93d",
+"glossary/arabic/aka_replicability_or_replication_crisis_ازمة_اعادة_الانتاج_او_ازمة_الت_كرار/index.html": "49d68ade35fe5d7a",
+"glossary/arabic/analyses_المتانة_في_التحليلات/index.html": "0ec309fadbb80206",
+"glossary/arabic/apc_رسوم_الن_شر/index.html": "36273f7198e5bd0d",
+"glossary/arabic/artificial_intelligence_علم_الوجود_الذ_كاء_الاصطناعي/index.html": "2810c263d1f5763b",
+"glossary/arabic/cc_license_رخصة_المشاع_الابداعي_/index.html": "40e2d3a0a0c53adb",
+"glossary/arabic/cobidas_لجنة_افضل_الممارسات_في_تحليل_البيانات_ومشاركتها/index.html": "78e54ec1a55bcdae",
+"glossary/arabic/cog_قيود_الت_عميم/index.html": "9b95a7f6d58472f9",
+"glossary/arabic/collaborative_commentary_الت_عليق_الت_عاوني_العدايي/index.html": "1bd86ee70828e4ac",
+"glossary/arabic/computational_الن_موذج_الحاسوبي_/index.html": "2c6315adb66dc924",
+"glossary/arabic/cos_مركز_العلم_المفتوح/index.html": "405ec3e6b6e0479e",
+"glossary/arabic/crep_مشروع_الت_كرار_والت_عليم_الت_عاوني/index.html": "207033c0c5b53ced",
+"glossary/arabic/da_rt_الوصول_للبيانات_وشفافي_ة_البحث/index.html": "d751143b6c678dca",
+"glossary/arabic/digital_object_identifier_معر_ف_الكاين_الر_قمي/index.html": "c80cec58412e16b8",
+"glossary/arabic/dmp_خطة_ادارة_البيانات/index.html": "754f8b2493a4beed",
+"glossary/arabic/ecrs_الباحثون_المبتديون/index.html": "9465060806f0714f",
+"glossary/arabic/file_drawer_problem_تحي_ز_الن_شر_مشكلة_درج_الملف_ات/index.html": "44ad53923bff91e6",
+"glossary/arabic/flae_مبدا_الت_اكيد_على_المولف_ين_الاول_والاخير/index.html": "9a29d2159206502a",
+"glossary/arabic/gdpr_لايحة_حماية_البيانات_العام_ة/index.html": "a2c94315c26901ea",
+"glossary/arabic/in_science_تاثير_ماثيو_في_العلوم/index.html": "db824b0063e50aac",
+"glossary/arabic/index.html": "769709b1b8d2db6c",
+"glossary/arabic/moocs_مقر_رات_الت_عل_م_الض_خمة_المفتوحة_عن_بعد/index.html": "e0c97448c08d3359",
+"glossary/arabic/moops_الاوراق_الضخمة_والمفتوحة_على_الانترنت/index.html": "01a9b8e334eb983d",
+"glossary/arabic/netanos_اخفاء_ه_وي_ة_الن_ص_المعتمد_على_الكيان_للعلم_المفتوح/index.html": "7a81a0c34a8ac3ce",
+"glossary/arabic/nhst_اختبار_دلالة_الفرضي_ة_الص_فري_ة/index.html": "0675b1f65e657a34",
+"glossary/arabic/niro_sr_المراجعات_المنهجي_ة_غير_الت_دخلي_ة_المفتوحة_والقابلة_للت_كرار/index.html": "8e221b55e732d7c4",
+"glossary/arabic/oer_commons_مصادر_التع_ل_م_المفتوحة_العام_ة/index.html": "73715d8709bf7c85",
+"glossary/arabic/oers_المصادر_الت_عليمي_ة_المفتوحة/index.html": "8c656a562adb20f2",
+"glossary/arabic/open_researcher_and_contributor_id_الاوركيد/index.html": "22b184f2a63ad52a",
+"glossary/arabic/open_science_الش_ارات_العلم_المفتوح/index.html": "df29983d389c26c7",
+"glossary/arabic/or_guest_authorship_الت_اليف_الم_هدى_او_المولف_الض_يف/index.html": "6efcb270ff579a6a",
+"glossary/arabic/p_مقياس_المساهمة_البحثي_ة_نشر/index.html": "31567b6272d12681",
+"glossary/arabic/peer_community_in_منظ_مة_الاقران/index.html": "305e6503a594bd9a",
+"glossary/arabic/peer_review_openness_initiative_مبادرة_انفتاح_تحكيم_الاقران/index.html": "26fbb228f72aca3d",
+"glossary/arabic/philosophy_الن_موذج_الفلسفي_/index.html": "8f31b57be9639884",
+"glossary/arabic/ppi_عي_نة_ومجتمع_الد_راسة_المساهمين/index.html": "4195e28c06e2b9cb",
+"glossary/arabic/qmp_ممارسات_القياس_المشكوك_فيها/index.html": "c057a871fa34cf9f",
+"glossary/arabic/qrps_ممارسات_البحث_المشكوك_فيها_او_ممارسات_اعداد_الت_قارير_المشكوك_فيها/index.html": "5c505e3c48f4a8ba",
+"glossary/arabic/sdc_نهج_الت_سلسل_الذي_يحد_د_المساهمة/index.html": "6c7355339175b648",
+"glossary/arabic/sips_جمعية_تطويرالعلوم_الن_فسي_ة/index.html": "038bfeb74f8ce3e5",
+"glossary/arabic/sortee_جمعي_ة_علم_البيية_والبيولوجيا_الت_طوري_ة_المنفتحة_والموثوقة_والش_فافة/index.html": "c7199adb7da9c3f5",
+"glossary/arabic/statistical_الن_موذج_الاحصايي_/index.html": "d5f80d3139eb5486",
+"glossary/arabic/the_system_الت_لاعب_بالن_ظام/index.html": "25496da4a5cd7f28",
+"glossary/arabic/to_open_scholarship_الن_هج_الت_صاعدي_/index.html": "934e9f6a1a26e366",
+"glossary/arabic/udl_الت_صميم_الش_امل_للت_عل_م/index.html": "4030bd80d2dd7f49",
+"glossary/arabic/اختبار_الت_كافو/index.html": "2cac314419ed4e4e",
+"glossary/arabic/ادارة_بيانات_البحث/index.html": "b8309b17266337f9",
+"glossary/arabic/ارشادات_ارايف/index.html": "4af1844f2e102d17",
+"glossary/arabic/ارشادات_الاعداد/index.html": "1b3f8a24cee6d523",
+"glossary/arabic/اسواق_الت_كرار/index.html": "1e8bc076dd7ffcbf",
+"glossary/arabic/اشباه_البيانات/index.html": "14375623cb54d861",
+"glossary/arabic/اطار_العلوم_المفتوحة/index.html": "695e418d6e5f05e4",
+"glossary/arabic/اعلان_سان_فرانسيسكو_بشان_تقييم_البحوث/index.html": "47c647f370b03dd0",
+"glossary/arabic/اكتساب_المعرفة/index.html": "83f191ddd67cea8e",
+"glossary/arabic/اكتشاف_الاخطاء/index.html": "006833e5670b6f57",
+"glossary/arabic/الاثر_الاقتصادي_والاجتماعي/index.html": "b1baec5d8a1fc7cd",
+"glossary/arabic/الاحتمال_العشوايي/index.html": "cf2bb4cdafc7ce11",
+"glossary/arabic/الاستدلال_البايزي/index.html": "fdc9143bbc5ca3d0",
+"glossary/arabic/الاستقراء/index.html": "4d2ccbee4d8fcf97",
+"glossary/arabic/الاستنساخ_الحسابي/index.html": "9e5674ac0bc37d67",
+"glossary/arabic/الاسهام/index.html": "ab6c6392dd2a1c9b",
+"glossary/arabic/الاطار_المجتمعي_للممارسات_الجي_دة_في_المستودعات/index.html": "d757d2c3ed3a8162",
+"glossary/arabic/الافتراض_بعد_معرفة_الن_تايج/index.html": "a8832435f2dceb6b",
+"glossary/arabic/الافتراضات_الاحصايي_ة/index.html": "1668ab84e4efb7f8",
+"glossary/arabic/الانتاج_المشترك/index.html": "178f0ae57d758935",
+"glossary/arabic/الاندماج_الاجتماعي_/index.html": "54f35cbf27575ee5",
+"glossary/arabic/الانعكاسي_ة/index.html": "a2cb71a64f8e0cd2",
+"glossary/arabic/الايقاف_الاختياري/index.html": "2afe8881afe0945b",
+"glossary/arabic/البحث_الجماعي/index.html": "4ee5853a4913c762",
+"glossary/arabic/البحث_الكمي_/index.html": "c44b24fbd62260cf",
+"glossary/arabic/البحث_الن_وعي/index.html": "e0ec4ba8f6009ae3",
+"glossary/arabic/البحث_والابتكار_المسوول/index.html": "59731ebe38106a1c",
+"glossary/arabic/البحوث_الت_شاركي_ة/index.html": "58b806ed1799adda",
+"glossary/arabic/البحوث_الحس_اسة/index.html": "1a0048810fb73dbf",
+"glossary/arabic/البيان_التصحيحي/index.html": "8eeb1b0d18765ace",
+"glossary/arabic/البيانات_المفتوحة/index.html": "050c1a14baf2ae04",
+"glossary/arabic/البيانات_الوصفي_ة/index.html": "5fa2610a545960c6",
+"glossary/arabic/الت_اثير_الاكاديمي_/index.html": "630474a6c5807af7",
+"glossary/arabic/الت_اليف/index.html": "f48776c686cc5974",
+"glossary/arabic/الت_حالف_الت_اليفي/index.html": "cffabc2d36394982",
+"glossary/arabic/الت_حكم_في_الاصدار/index.html": "dd441351bb9a4b44",
+"glossary/arabic/الت_حكيم_المفتوح/index.html": "af25c5b8d582594a",
+"glossary/arabic/الت_حكيم_ثلاثي_الت_عمية/index.html": "d02b724f96e275fb",
+"glossary/arabic/الت_حليل_البعدي/index.html": "8b4a9fe97502a422",
+"glossary/arabic/الت_حليل_البعدي_للمقاييس_الن_فسي_ة/index.html": "b3bf473f980c5d76",
+"glossary/arabic/الت_حليلات_الت_وكيدي_ة/index.html": "d0a4a38273128deb",
+"glossary/arabic/الت_حي_ز_الايديولوجي/index.html": "1b3b811296e7eb6f",
+"glossary/arabic/الت_راخيص_المفتوحة/index.html": "7029c9e47aa6180e",
+"glossary/arabic/الت_سجيل_المسبق/index.html": "31b8212a7179d4d7",
+"glossary/arabic/الت_سجيل_بعد_معرفة_الن_تايج/index.html": "638cbebc4e018c72",
+"glossary/arabic/الت_سمية_المستعارة/index.html": "79d9549bc64e394a",
+"glossary/arabic/الت_شابك/index.html": "9267eda1f36ef95b",
+"glossary/arabic/الت_شارك_العدايي/index.html": "9a2a3d9f71f1d009",
+"glossary/arabic/الت_شاركي_ة/index.html": "d8f0d71d874b8cd0",
+"glossary/arabic/الت_عددي_ة/index.html": "0b100eb941ebf477",
+"glossary/arabic/الت_عمية/index.html": "01377dd039237a80",
+"glossary/arabic/الت_قاطعي_ة/index.html": "3a7382c3c6acc4b4",
+"glossary/arabic/الت_قرير_المسج_ل/index.html": "52a5dcbf99ab225d",
+"glossary/arabic/الت_قطيع_غير_المبر_ر/index.html": "8ecccad9321e065b",
+"glossary/arabic/الت_كرار/index.html": "9a96c067b5353df7",
+"glossary/arabic/الت_كرار_الكاذب/index.html": "1bac58da8652e3fb",
+"glossary/arabic/الت_كرار_المباشر/index.html": "a7594e37da130a78",
+"glossary/arabic/الت_كرار_المفاهيمي/index.html": "2b931b254cd55896",
+"glossary/arabic/الت_نوع/index.html": "d9fd5e4580dafd9d",
+"glossary/arabic/الت_وزيع_الل_احق/index.html": "f465b28187f2e2e6",
+"glossary/arabic/الت_وزيع_المسبق/index.html": "33423589db047a0d",
+"glossary/arabic/التحكيم_احادي__الت_عمية/index.html": "7f0c14f993570fa8",
+"glossary/arabic/التحكيم_مزدوج_الت_عمية/index.html": "adf129ef1d64d9f7",
+"glossary/arabic/الث_بات/index.html": "af3f9b60d57947cc",
+"glossary/arabic/الث_لاثي_المقلق/index.html": "af6c192beb38e2cc",
+"glossary/arabic/الخطا_من_الن_وع_اس/index.html": "b669698c4cf43a6a",
+"glossary/arabic/الخطا_من_الن_وع_الاو_ل/index.html": "eeea8604991b3ca4",
+"glossary/arabic/الخطا_من_الن_وع_الث_اني/index.html": "1a8ec8e4c1e96205",
+"glossary/arabic/الخطا_من_الن_وع_ام/index.html": "77760a778ff64ff4",
+"glossary/arabic/الد_راسات_متعد_دة_المحل_لين/index.html": "19b2806c62fd9aec",
+"glossary/arabic/الد_لالة_الاحصايي_ة/index.html": "f85bc6f3f365d058",
+"glossary/arabic/الس_بق/index.html": "829b8d9d84c1ebf1",
+"glossary/arabic/الش_فافي_ة/index.html": "31b6eeb4b931083f",
+"glossary/arabic/الش_مول/index.html": "071f7b344fa4e1fe",
+"glossary/arabic/الص_دق/index.html": "014ecb6e2daf1691",
+"glossary/arabic/الص_دق_الاحصايي/index.html": "d7fd237a0b56dfa4",
+"glossary/arabic/الص_دق_البنايي/index.html": "b49e6babf4419958",
+"glossary/arabic/الص_دق_الخارجي/index.html": "6853e3776e04d60e",
+"glossary/arabic/الص_دق_الد_اخلي/index.html": "f9cd55555d9ada5c",
+"glossary/arabic/الص_دق_الظاهري/index.html": "8efe65aa0d44291c",
+"glossary/arabic/الض_ريبة_الث_قافي_ة/index.html": "4a4538f0f494fed2",
+"glossary/arabic/الط_باعة_الاولي_ة/index.html": "9baff9d513556cba",
+"glossary/arabic/الط_بقة_الاجتماعي_ة/index.html": "d0c0c558d6e066bd",
+"glossary/arabic/العدالة/index.html": "b21ae0dafe67dce1",
+"glossary/arabic/العديد_من_المول_فين/index.html": "83f0c4732a9bd7ae",
+"glossary/arabic/العلم_البطيء/index.html": "21a03bd51ad10c21",
+"glossary/arabic/العلم_الت_راكمي/index.html": "26d6491179d1f53b",
+"glossary/arabic/العلم_المفتوح/index.html": "1f42513c13c9202b",
+"glossary/arabic/العلوم_البعدي_ة_الت_لوية_او_البحث_البعدي_الت_لوي/index.html": "c5e1d4a618070931",
+"glossary/arabic/الغسل_المفتوح/index.html": "d5341986ed808688",
+"glossary/arabic/الفرضي_ة/index.html": "51e59aae9d5c7002",
+"glossary/arabic/الفرضية_المساعدة/index.html": "1a1a8c2cd9f5a413",
+"glossary/arabic/الفرق_الحمراء/index.html": "4d6ccc0709b581b9",
+"glossary/arabic/القابلي_ة_للت_عميم/index.html": "43b927b6fa5f5673",
+"glossary/arabic/القرصنة_العكسي_ة_للقيمة_الاحتمالي_ة/index.html": "b4316f9932c74276",
+"glossary/arabic/القو_ة_الاحصايي_ة/index.html": "09ae05fcac1ae785",
+"glossary/arabic/القياسات_الد_لالي_ة/index.html": "01d424b57ec29bc3",
+"glossary/arabic/القيمة_الاحتمالي_ة/index.html": "7105221761d674df",
+"glossary/arabic/الل_جنة_الذ_كوري_ة/index.html": "a975742d8fea22f2",
+"glossary/arabic/اللايقين_المعرفي/index.html": "1a766ac58241b79d",
+"glossary/arabic/المتغي_رات_الوسيطة_الخفي_ة/index.html": "9a19ebd7ab5147b6",
+"glossary/arabic/المجل_ات_الت_ركيبي_ة/index.html": "4b5b2c6db6b8d082",
+"glossary/arabic/المراجعة_المنهجي_ة/index.html": "9b1e80d9da50042b",
+"glossary/arabic/المرونة_الت_حليلي_ة/index.html": "f093dc154dd2d2be",
+"glossary/arabic/المشاريع_المجتمعي_ة/index.html": "8859abbc509fabe7",
+"glossary/arabic/المعامل_المتعد_دة/index.html": "e62a04b448a64c5e",
+"glossary/arabic/المعرفة_المفتوحة/index.html": "387f32a1f8747dc7",
+"glossary/arabic/المقاييس_البديلة/index.html": "96ee481209d2f4a9",
+"glossary/arabic/المنص_ة_العصبي_ة_المفتوحة/index.html": "f3f0fb6d0512405a",
+"glossary/arabic/المواد_المفتوحة/index.html": "2c3f1bcc6325fb37",
+"glossary/arabic/الموضعي_ة/index.html": "6fbe3818a2f5023b",
+"glossary/arabic/الموضوعي_ة/index.html": "3a34274f2074fe68",
+"glossary/arabic/الن_شر_المفترس_الاستغلالي_/index.html": "977c468f2a8d45c6",
+"glossary/arabic/الن_شر_او_الفناء/index.html": "cc7e9362378fe545",
+"glossary/arabic/الن_ص_البرمجي_المفتوح/index.html": "9d90085a1d6362e7",
+"glossary/arabic/الن_ظري_ة/index.html": "e9fe91b70bf13951",
+"glossary/arabic/النقد_بعد_معرفة_النتايج/index.html": "d1d31937484b0a6f",
+"glossary/arabic/الوصول_المفتوح/index.html": "8b35e22db35ea1ae",
+"glossary/arabic/الوعي_المزدوج/index.html": "207686e55234acf7",
+"glossary/arabic/امكاني_ة_الوصول/index.html": "e0b5cc09d88451ce",
+"glossary/arabic/امنيجا/index.html": "1f48a660a9a9ae75",
+"glossary/arabic/انحياز_المستخلص/index.html": "dc9ffb91efb70a1d",
+"glossary/arabic/انهاء_الاستعمار/index.html": "e8c3bc28163b3e56",
+"glossary/arabic/بايثون/index.html": "23d9fbaad01fecdf",
+"glossary/arabic/برنامج_جاب_ريف/index.html": "108329e2c3a9a8cd",
+"glossary/arabic/برنامج_جاسب/index.html": "2bdcc84822bbeaff",
+"glossary/arabic/برنامج_قوة_جي/index.html": "ed056a071e223e26",
+"glossary/arabic/برنامج_مفتوح_المصدر/index.html": "666607e0b15bc33a",
+"glossary/arabic/بروبنساينس/index.html": "260309f99ae97e29",
+"glossary/arabic/بناء_الن_ظري_ة/index.html": "fb4716060a81b392",
+"glossary/arabic/بنية_بيانات_تصوير_الد_ماغ/index.html": "ef58aeb6b0e6a656",
+"glossary/arabic/بيان_تنو_ع_الاستشهادات/index.html": "4519e341dd65df25",
+"glossary/arabic/بيزار/index.html": "96acc746f89dc5db",
+"glossary/arabic/ت_عهد_الت_سجيل_المسبق/index.html": "f3c78ebcf836a2f3",
+"glossary/arabic/تاطير_المقابلات/index.html": "ca49887eaeaacd88",
+"glossary/arabic/تحليل_الاكوان_المتعد_دة/index.html": "39b5db1e50bb62c6",
+"glossary/arabic/تحليل_البيانات_الاستكشافي_/index.html": "353c6a6862b21d83",
+"glossary/arabic/تحليل_منحنى_المواصفات/index.html": "8692a35a7dc88b0c",
+"glossary/arabic/تحي_ز_الاستشهاد/index.html": "e04c841f608c5b97",
+"glossary/arabic/تحي_ز_الانتماء/index.html": "1b51391f4d102638",
+"glossary/arabic/تحي_ز_الش_خصنة/index.html": "100ff84f3cef5c9f",
+"glossary/arabic/تصنيف_ادوار_المول_فين/index.html": "c2cdf6c4efcb0c3a",
+"glossary/arabic/تصوير_البيانات/index.html": "3e70c008e280c8fe",
+"glossary/arabic/تعارض_المصالح/index.html": "52aeb3c6d2beac5c",
+"glossary/arabic/تقدير_المعاملات_باستخدام_الن_هج_البايزي/index.html": "da3f3ff6df287b5f",
+"glossary/arabic/توليف_الادلة/index.html": "44e2b008edb6a3f4",
+"glossary/arabic/تينزينج/index.html": "646f024c08cb3b67",
+"glossary/arabic/ثقة_الجمهور_في_العلوم/index.html": "4cee2ab521ca5865",
+"glossary/arabic/ثورة_المصداقي_ة/index.html": "5664dfd17b41a019",
+"glossary/arabic/جاموفي/index.html": "727b5221321c18ed",
+"glossary/arabic/حاجز_مالي/index.html": "8357e957bc0669c8",
+"glossary/arabic/حديقة_المسارات_المتشعبة/index.html": "ec2135ad46b0be0c",
+"glossary/arabic/خريطة_الموضعية/index.html": "ea32787d5eb1dbd2",
+"glossary/arabic/خطة_الص_دمة/index.html": "8001629aea09882c",
+"glossary/arabic/خلاصة_وافية/index.html": "1da153862cd9da33",
+"glossary/arabic/دالة_الاحتمالي_ة/index.html": "955cc6d92544fd7f",
+"glossary/arabic/درجات_حر_ي_ة_الباحث/index.html": "c8e3a5161fbd7124",
+"glossary/arabic/دليل_اعداد_الت_قارير/index.html": "e6788cb3f53b0067",
+"glossary/arabic/دليل_الر_موز/index.html": "f6d1617713e2f6af",
+"glossary/arabic/دورة_البحث/index.html": "888ae44fa050086b",
+"glossary/arabic/زينودو/index.html": "9099fd2c18c0e509",
+"glossary/arabic/سترينج_الخلفي_ة_الاجتماعي_ة_والقابلي_ة_للت_تبع_والاختيار_الذ_اتي_وتاريخ_الت_ربية_والت_اقلم_والت_عود/index.html": "07071d6175beac6f",
+"glossary/arabic/سج_ل_مستودعات_بيانات_البحث/index.html": "c98d20761fab73b5",
+"glossary/arabic/شبكة_ارشيف_المعرفة_الش_املة/index.html": "8e7e9f6bdc871997",
+"glossary/arabic/شبكة_التكرار/index.html": "a7ae9592616f370c",
+"glossary/arabic/شيربا_روميو/index.html": "4c2a328322ac7f8b",
+"glossary/arabic/صدق_المحتوى/index.html": "c05ea4f523f6055f",
+"glossary/arabic/صدق_المحك/index.html": "8845eea89c5d3152",
+"glossary/arabic/طريقة_الت_قليم_والت_عبية/index.html": "803dccf8d9085813",
+"glossary/arabic/علم_المواطن/index.html": "9aa50a65a2400731",
+"glossary/arabic/علم_الن_فس_الن_سوي/index.html": "22776d808d53389d",
+"glossary/arabic/فترة_الحظر/index.html": "bad8a2cd6b0c532b",
+"glossary/arabic/فورت/index.html": "585f6fb332684ad9",
+"glossary/arabic/قابلي_ة_اعادة_الانتاج/index.html": "eb0b7d9bd43d6cfb",
+"glossary/arabic/قابلي_ة_الت_كرار/index.html": "c33b1bc6a9619511",
+"glossary/arabic/قاعدة_المعرفة_للمنح_الد_راسي_ة_المفتوحة/index.html": "6f0b3630924c7319",
+"glossary/arabic/قانون_قودهارت/index.html": "569cb04faf1af3ae",
+"glossary/arabic/قايمة_مراجعة_الش_فافي_ة/index.html": "4631d82631c4fd93",
+"glossary/arabic/قرصنة_القيمة_الاحتمالي_ة/index.html": "8a9f0c3f786a2086",
+"glossary/arabic/قياسات_الويب/index.html": "fb26b7ebe6bbeaf4",
+"glossary/arabic/لغة_الار/index.html": "6aaa7fd1b4f0cde9",
+"glossary/arabic/مبادلة_الد_راسات/index.html": "a263b84d9d233b9c",
+"glossary/arabic/مبادي_الث_قة/index.html": "8085e074113de84b",
+"glossary/arabic/مبادي_فير/index.html": "114a93a17deca8c5",
+"glossary/arabic/مبدا_الاحتمالي_ة/index.html": "dcf4eaf50089c431",
+"glossary/arabic/مجتمع_الاقران_للت_قارير_المسج_لة/index.html": "323d073086fa8151",
+"glossary/arabic/مراجعة_الادبي_ات/index.html": "fa4b17e5f5453b63",
+"glossary/arabic/مراجعة_الاقران_بعد_الن_شر/index.html": "d7f5de4f15f581f0",
+"glossary/arabic/مراجعة_الن_ص_البرمجي/index.html": "753524c2e1c7566a",
+"glossary/arabic/مراسم_البحث/index.html": "c8e9ea0067762d51",
+"glossary/arabic/مسار_البحث_العلمي_/index.html": "6819667e2d3bd826",
+"glossary/arabic/مستودع_البيانات/index.html": "666e678245117096",
+"glossary/arabic/مشاركة_البيانات/index.html": "8ae70af3cce75d76",
+"glossary/arabic/مشروع_الت_كرار/index.html": "198b70b0aafa5208",
+"glossary/arabic/مشكلة_ازدواجية_الاسم/index.html": "0005904df5470a4e",
+"glossary/arabic/مصانع_الورق/index.html": "0ba7854eeec2f73d",
+"glossary/arabic/معامل_بايز/index.html": "ecf133322e3db30b",
+"glossary/arabic/معامل_تاثير_المج_لة/index.html": "ae9aeb777b68f30e",
+"glossary/arabic/معيار_الت_مييز/index.html": "46ced1c3ea2fdc0a",
+"glossary/arabic/مغالطة_الت_فاعل/index.html": "4e470c7787acad43",
+"glossary/arabic/ملفات_جي_سون/index.html": "2b464f829ddbbe8b",
+"glossary/arabic/منتدى_العلوم_المتعد_د_القابلة_للت_كرار_والقابلة_للت_فسير_والمفتوحة_والش_فافة_نادي_رايوت_للعلوم/index.html": "d799e79904926e19",
+"glossary/arabic/منحنى_القيم_الاحتمالي_ة/index.html": "6bf1d532a07641eb",
+"glossary/arabic/منحنى_زد/index.html": "a31ec48f2506d9bb",
+"glossary/arabic/منص_ة_حر_ر_معرفتنا/index.html": "008c817e5b7361bf",
+"glossary/arabic/منصة_باب_ير_pubpeer/index.html": "b1fd337c83d4e170",
+"glossary/arabic/موشر_i10/index.html": "90cd4e93760ca112",
+"glossary/arabic/موشر_اتش/index.html": "c76fad368df87da6",
+"glossary/arabic/نزاهة_البحث/index.html": "5e286abea94265a6",
+"glossary/arabic/نظري_ة_المعرفة/index.html": "ad06493da3b37bcf",
+"glossary/arabic/نقص_الت_مثيل/index.html": "1fcc6e974eced3b0",
+"glossary/arabic/نهج_الت_دمير_الابداعي_للت_كرار/index.html": "546580a34c4a2d9e",
+"glossary/arabic/نوادي_الابحاث_الت_كراري_ة/index.html": "82ac74c0ec6e4acf",
+"glossary/arabic/هاكثون/index.html": "3ff99e6e8977173e",
+"glossary/arabic/هيكل_الحوافز/index.html": "0a86bcae8c7c7ee2",
+"glossary/arabic/و_يرد/index.html": "17efb1b62bf2e177",
+"glossary/chinese/_兄弟_式开放科学/index.html": "7ccdd5f6f2e79abf",
+"glossary/chinese/amnesia/index.html": "2c9650c2e9671dd9",
+"glossary/chinese/arrive指南/index.html": "239da9751c8aba6e",
+"glossary/chinese/bizarre/index.html": "3497f9e03de0e953",
+"glossary/chinese/coar存储库良好实践社区框架/index.html": "7af2717733370ef5",
+"glossary/chinese/fair原则/index.html": "204ec716448bfba8",
+"glossary/chinese/g_power/index.html": "b451c9d297800882",
+"glossary/chinese/git/index.html": "cc667cea60bb11a7",
+"glossary/chinese/h指数/index.html": "3b24d6050d4709b0",
+"glossary/chinese/i10指数/index.html": "e024514bfeff3646",
+"glossary/chinese/index.html": "11e4f35e698fe30f",
+"glossary/chinese/jabref/index.html": "882d507bab2a1c7b",
+"glossary/chinese/jamovi/index.html": "a30bec2a6ccc5ab4",
+"glossary/chinese/jasp/index.html": "dd288373b5ef7c10",
+"glossary/chinese/json_文件/index.html": "33fc51d44961ba3e",
+"glossary/chinese/manel/index.html": "4d9b60c742f4fb2e",
+"glossary/chinese/m类错误/index.html": "a7b54b805445a4b3",
+"glossary/chinese/openneuro/index.html": "12c38caba1159066",
+"glossary/chinese/p_曲线/index.html": "333e2a63f16036f6",
+"glossary/chinese/pci_注册报告/index.html": "67f8e7f47a711637",
+"glossary/chinese/prepare_指南/index.html": "9f3db69d756c3503",
+"glossary/chinese/pubpeer/index.html": "d9b2f0f43f71304d",
+"glossary/chinese/python/index.html": "72925ebae3cae948",
+"glossary/chinese/p值/index.html": "4e59d628e00e7ea3",
+"glossary/chinese/p值操纵/index.html": "7e08fcf0c22dce93",
+"glossary/chinese/r/index.html": "27dc09a65cded989",
+"glossary/chinese/replicats项目/index.html": "ca515f1040ecd7b7",
+"glossary/chinese/reproducibilitea/index.html": "ffddf10bd034f822",
+"glossary/chinese/riot科学俱乐部/index.html": "268717a8470178df",
+"glossary/chinese/sherpa_romeo/index.html": "8b9e8704bc68dcd9",
+"glossary/chinese/strange/index.html": "52e40b2cbb3a7682",
+"glossary/chinese/studyswap/index.html": "df6af203275dd808",
+"glossary/chinese/s类错误/index.html": "ed8ebfaad85062e7",
+"glossary/chinese/s计划/index.html": "a3a8a3d9e261b786",
+"glossary/chinese/tenzing/index.html": "706169aace06faba",
+"glossary/chinese/trust原则/index.html": "2b139b5250bf5b4d",
+"glossary/chinese/zenodo/index.html": "3f9d31e644c21caa",
+"glossary/chinese/z曲线/index.html": "48b13e06660a980c",
+"glossary/chinese/一类错误/index.html": "7f5db1e7aa573e95",
+"glossary/chinese/三大隐患/index.html": "ea4c6cb844e33985",
+"glossary/chinese/三盲同行评审/index.html": "eb6346131b6635e7",
+"glossary/chinese/不当测量行为/index.html": "93881f31630e596e",
+"glossary/chinese/不当研究行为或不当报告行为/index.html": "92192753e7ba5b38",
+"glossary/chinese/事后/index.html": "7eafc4e83590adbb",
+"glossary/chinese/二类错误/index.html": "1962f77ce465d801",
+"glossary/chinese/交互谬误/index.html": "e4e82e7c1372b25d",
+"glossary/chinese/交叉性/index.html": "1ad096672cec54fc",
+"glossary/chinese/人身偏见/index.html": "0ab22ac0393cba5f",
+"glossary/chinese/从属偏见/index.html": "3ed352935c2cdbc4",
+"glossary/chinese/付费墙/index.html": "dc6b016d6bddd8d9",
+"glossary/chinese/代码审查/index.html": "83d22285c05375c0",
+"glossary/chinese/代表性不足/index.html": "56e1d9b6ae0c230a",
+"glossary/chinese/众包研究/index.html": "f826516650a98130",
+"glossary/chinese/伪重复/index.html": "4c202979a9c9bca0",
+"glossary/chinese/似然函数/index.html": "2fbd29d24c297c81",
+"glossary/chinese/似然原理/index.html": "d58e1bd95edc00f8",
+"glossary/chinese/作者署名/index.html": "61da340de318642c",
+"glossary/chinese/信度/index.html": "d98aece500c937fc",
+"glossary/chinese/假名化/index.html": "08da159315589ae9",
+"glossary/chinese/假设/index.html": "5cfb47ced7950adf",
+"glossary/chinese/元分析/index.html": "b3ddcc78d99473cf",
+"glossary/chinese/元数据/index.html": "21f2e9f275c4defe",
+"glossary/chinese/元科学或元研究/index.html": "af3c8508a28b8ed6",
+"glossary/chinese/先验分布/index.html": "209d80cbf97e879b",
+"glossary/chinese/公众对科学的信任/index.html": "77d1f1c81bccd3fa",
+"glossary/chinese/公众科学/index.html": "2c61a8e455c6401d",
+"glossary/chinese/公平/index.html": "426d8d78fe88a8ab",
+"glossary/chinese/共同生产/index.html": "eb870521fa149d9e",
+"glossary/chinese/共有性/index.html": "4df1d1ae977d7cdd",
+"glossary/chinese/内容效度/index.html": "43ab1bf8ddb8a76a",
+"glossary/chinese/内部效度/index.html": "32ddc82e658e9cff",
+"glossary/chinese/分析灵活性/index.html": "db4ba64d308b0d05",
+"glossary/chinese/切香肠式发表/index.html": "f6e38bb7b8f37a27",
+"glossary/chinese/划界标准/index.html": "5b5747f24534b5ca",
+"glossary/chinese/创造性破坏式的复现方法/index.html": "26958edda117edb0",
+"glossary/chinese/利益冲突/index.html": "31f638a727f6c96b",
+"glossary/chinese/剪补法/index.html": "8a164077d951aa36",
+"glossary/chinese/勘误表/index.html": "78d5782569f18dd2",
+"glossary/chinese/包容性/index.html": "7b8baf3185898cbf",
+"glossary/chinese/匿名性/index.html": "4a841a0ff4beadd4",
+"glossary/chinese/协作式复现与教育项目/index.html": "1b427f0b0947c758",
+"glossary/chinese/单盲同行评审/index.html": "93ec52821d422df7",
+"glossary/chinese/去殖民化/index.html": "0ccecc3894afb242",
+"glossary/chinese/参与式研究/index.html": "ed10408138bb7d1a",
+"glossary/chinese/参与者和公众参与/index.html": "4093f85804be96c1",
+"glossary/chinese/双盲同行评审/index.html": "b6361bf3dfa09e2d",
+"glossary/chinese/双重意识/index.html": "f2a50275035ec508",
+"glossary/chinese/反向p值操纵/index.html": "fa792af53bbd1fd7",
+"glossary/chinese/反身性/index.html": "4c7ba21e6f18d6d0",
+"glossary/chinese/发表偏倚_文件抽屉问题/index.html": "4d45b6f5a4e94355",
+"glossary/chinese/发表后同行评审/index.html": "6c2dc6b9632c65fd",
+"glossary/chinese/发表或灭亡/index.html": "9e4e17f506885990",
+"glossary/chinese/叠加期刊/index.html": "7b3fcaafcf66a612",
+"glossary/chinese/古德哈特定律/index.html": "9ac7adaf8f532a63",
+"glossary/chinese/可信度革命/index.html": "25983d5f5f153429",
+"glossary/chinese/可复现性/index.html": "eedbb4eb89f90925",
+"glossary/chinese/可推广性/index.html": "5f4f7e049e64ab82",
+"glossary/chinese/可访问性/index.html": "2577e5e2e839abd9",
+"glossary/chinese/可重复性/index.html": "13a84a30fec1eef7",
+"glossary/chinese/可重复性危机_又称可复现性或复现危机_/index.html": "ae0f825c6b590626",
+"glossary/chinese/可重复性网络/index.html": "1a577e744f281900",
+"glossary/chinese/同行评审开放性倡议/index.html": "f6c16d496d5f9a12",
+"glossary/chinese/同辈社区/index.html": "e11516ca34f9f87a",
+"glossary/chinese/后验分布/index.html": "32b7b16a3ab8f405",
+"glossary/chinese/团体项目/index.html": "3f9f89a1eabcf2ce",
+"glossary/chinese/复现市场/index.html": "9bd08bf3e4b0b4fd",
+"glossary/chinese/外部效度/index.html": "ea5291ce2f20920e",
+"glossary/chinese/多作者参与/index.html": "c9da474ed5325d7a",
+"glossary/chinese/多分析者研究/index.html": "2fe4867a1f7a2918",
+"glossary/chinese/多实验室协作/index.html": "3c946c14289cdd7e",
+"glossary/chinese/多样性/index.html": "3c45bdaac2ebf859",
+"glossary/chinese/多重分析/index.html": "261ca3d98ceaf0e3",
+"glossary/chinese/多重性/index.html": "dde3d7a8e0a87f3d",
+"glossary/chinese/大型开放式在线论文/index.html": "f3e49874cfa3c255",
+"glossary/chinese/大型开放式在线课程/index.html": "6e03b7c73e968b07",
+"glossary/chinese/女性主义心理学/index.html": "b29562a104e5fab2",
+"glossary/chinese/姓名歧义问题/index.html": "f5d930f948aa13f7",
+"glossary/chinese/存储库/index.html": "eee49d71979ca1a8",
+"glossary/chinese/学术影响/index.html": "399fd78deb8de2d3",
+"glossary/chinese/定性研究/index.html": "c438dbdde4b24789",
+"glossary/chinese/定量研究/index.html": "2a1a76cb1e207160",
+"glossary/chinese/客观性/index.html": "8dbb22d4509329c1",
+"glossary/chinese/对抗性_合作性_评论/index.html": "b1d2793f5b086843",
+"glossary/chinese/对抗性合作/index.html": "5f29a3249e1a3670",
+"glossary/chinese/尽责的研究与创新/index.html": "3d30946b7401ed10",
+"glossary/chinese/开放_可靠_透明的生态与进化生物学学会/index.html": "2e177b30e189852b",
+"glossary/chinese/开放代码/index.html": "b2625e29c10f475a",
+"glossary/chinese/开放可重复研究与教学框架/index.html": "d1d07c9a82fa7036",
+"glossary/chinese/开放同行评审/index.html": "43a4a0592200d7ca",
+"glossary/chinese/开放学术/index.html": "e0354db13587dbc2",
+"glossary/chinese/开放学术知识库/index.html": "25e41a7523ae4365",
+"glossary/chinese/开放教育资源/index.html": "862692400b8bd93b",
+"glossary/chinese/开放教育资源在线库/index.html": "6fb384544fdd1366",
+"glossary/chinese/开放数据/index.html": "30be52bc9adf8bcf",
+"glossary/chinese/开放材料/index.html": "1d23dcadf5492c9c",
+"glossary/chinese/开放漂白/index.html": "5f44d75b060d4f84",
+"glossary/chinese/开放研究者和贡献者id/index.html": "09394c6506968c5f",
+"glossary/chinese/开放科学/index.html": "5693d8ce459c1a00",
+"glossary/chinese/开放科学中心/index.html": "771a8b25c3e2b17a",
+"glossary/chinese/开放科学框架/index.html": "93376223f8f31611",
+"glossary/chinese/开放科学的命名实体文本匿名化工具/index.html": "5d4a7f91e810350f",
+"glossary/chinese/开放获取/index.html": "a0cefec588999e3c",
+"glossary/chinese/开放许可/index.html": "84ae01991ade6d5c",
+"glossary/chinese/开源软件/index.html": "bc8f59e27ccebf4b",
+"glossary/chinese/引用偏见/index.html": "f8c80fa677e97c92",
+"glossary/chinese/引用多样性声明/index.html": "b1a49fe95fd309ea",
+"glossary/chinese/归纳/index.html": "d3a9df1c8811fec5",
+"glossary/chinese/徽章_开放科学_/index.html": "b30e88fbe662e712",
+"glossary/chinese/心理测量元分析/index.html": "5db4f6bc261d2961",
+"glossary/chinese/心理科学改进学会/index.html": "daa75246c2fe83d3",
+"glossary/chinese/意识形态偏见/index.html": "1773887d6afaa52e",
+"glossary/chinese/慢科学/index.html": "b9ff606d77debba4",
+"glossary/chinese/抢发/index.html": "3ef18856390cddca",
+"glossary/chinese/报告指南/index.html": "9eb4be07738b6ef1",
+"glossary/chinese/括号式访谈/index.html": "8a8b1a6716f7db1f",
+"glossary/chinese/掠夺性出版/index.html": "cfb6615de81fc3ee",
+"glossary/chinese/探索性数据分析/index.html": "616800975f57f7b7",
+"glossary/chinese/摘要偏倚/index.html": "f138903d65cdde9d",
+"glossary/chinese/效度/index.html": "6c829bdffa8a6ded",
+"glossary/chinese/效标效度/index.html": "c14bde0dfb8ae745",
+"glossary/chinese/敏感研究/index.html": "b184dda17efaa3b7",
+"glossary/chinese/数字对象唯一标识符/index.html": "585ab451c615ada0",
+"glossary/chinese/数据共享/index.html": "af791eb651150610",
+"glossary/chinese/数据分析与共享最佳实践委员会/index.html": "7cc2811db039aa8a",
+"glossary/chinese/数据可视化/index.html": "af51b328e02b1912",
+"glossary/chinese/数据管理计划/index.html": "12bc96589dc12d4e",
+"glossary/chinese/数据获取与研究透明度/index.html": "e4a8b53b50aa7feb",
+"glossary/chinese/文化税负/index.html": "5fc96f90d9fd3761",
+"glossary/chinese/文献综述/index.html": "edab1b1b8022e3fb",
+"glossary/chinese/早期职业研究人员/index.html": "3548108d6055e010",
+"glossary/chinese/普遍性限制/index.html": "8834e4287ebc8bff",
+"glossary/chinese/替代计量/index.html": "f7111f72f93faccc",
+"glossary/chinese/期刊影响因子/index.html": "a2dbb1031f353f60",
+"glossary/chinese/本体论_人工智能_/index.html": "ebc7f1e035d9a12f",
+"glossary/chinese/构念效度/index.html": "d4db0ecf570f7aed",
+"glossary/chinese/概念复现/index.html": "361b5deea27d9f23",
+"glossary/chinese/歧路花园/index.html": "8fe54e451bdc9905",
+"glossary/chinese/汇编/index.html": "41541e07ddaafd7b",
+"glossary/chinese/注册报告/index.html": "c080edf5f4ac722b",
+"glossary/chinese/激励机制/index.html": "0d6cd7cc5c3a4c03",
+"glossary/chinese/版本控制/index.html": "dc2f2cefb34e42e4",
+"glossary/chinese/版面费/index.html": "f85012eca4681d13",
+"glossary/chinese/理论/index.html": "118b9fa37923f09b",
+"glossary/chinese/理论建构/index.html": "19f9a58e1f4dd570",
+"glossary/chinese/理论模型/index.html": "264bbae15ce82a55",
+"glossary/chinese/直接复现/index.html": "9a5e8548d1aa9a35",
+"glossary/chinese/知识共享许可协议/index.html": "0a9324066b71931d",
+"glossary/chinese/知识获取/index.html": "00a7c8c9ed91e290",
+"glossary/chinese/研究人员自由度/index.html": "e3963f454aee4475",
+"glossary/chinese/研究工作流程/index.html": "b4a6ed6be2d70220",
+"glossary/chinese/研究循环/index.html": "9df62bfed9752c7a",
+"glossary/chinese/研究数据存储库注册系统/index.html": "fa4c0de29e65e7c5",
+"glossary/chinese/研究数据管理/index.html": "fc158b6eeddbca1d",
+"glossary/chinese/研究方案/index.html": "92f154f246da7ade",
+"glossary/chinese/研究诚信/index.html": "47c65444bd12d85d",
+"glossary/chinese/研究贡献指标_p_/index.html": "5c78ad35a39ef83b",
+"glossary/chinese/确认偏误/index.html": "1c5dd09710de45b1",
+"glossary/chinese/社会融合/index.html": "cd6c37b9501b1b8a",
+"glossary/chinese/社会阶层/index.html": "44c1cc4b5a80fa9f",
+"glossary/chinese/禁运期/index.html": "4ea4300e2a6f8862",
+"glossary/chinese/稳健性_分析_/index.html": "8bd68b768a6d32b2",
+"glossary/chinese/立场性/index.html": "873e2d1831458fdd",
+"glossary/chinese/立场性图谱/index.html": "ffa6781c07b1b8c6",
+"glossary/chinese/等效性检验/index.html": "0f7d3bb492cf9704",
+"glossary/chinese/系统综述/index.html": "94a8931509928532",
+"glossary/chinese/累积性科学/index.html": "dbd63262b4aafdea",
+"glossary/chinese/红队/index.html": "874930dedc7ce0db",
+"glossary/chinese/经济和社会影响/index.html": "bbe9d54331c49420",
+"glossary/chinese/结果已知后假设/index.html": "9f3091a59334b57b",
+"glossary/chinese/结果已知后批评/index.html": "ca9a43c5f1eb32b1",
+"glossary/chinese/结果已知后预注册/index.html": "2ca18d4114aeb1a3",
+"glossary/chinese/统计假设/index.html": "1531536e4a402358",
+"glossary/chinese/统计功效/index.html": "7ef371ef53920b9b",
+"glossary/chinese/统计效度/index.html": "bdfc3dba0f5f7afb",
+"glossary/chinese/统计显著性/index.html": "9d0dd33c85f199ce",
+"glossary/chinese/统计模型/index.html": "17dd7084d57b9eb6",
+"glossary/chinese/综合知识档案网络/index.html": "da016496d1ca372a",
+"glossary/chinese/编码表/index.html": "f2ea07496ee71a8f",
+"glossary/chinese/网络计量学/index.html": "f4cd45ddd3be5c48",
+"glossary/chinese/署名顺序决定贡献法/index.html": "2d33666c35681416",
+"glossary/chinese/联合作者署名/index.html": "4cdfa27792502013",
+"glossary/chinese/联锁/index.html": "9781c84e0f60d505",
+"glossary/chinese/脑成像数据结构/index.html": "3a0c82c5b863385c",
+"glossary/chinese/自下而上的方法_用于开放学术_/index.html": "2bf37c4644112f8f",
+"glossary/chinese/表面效度/index.html": "b1741c94f31b07fc",
+"glossary/chinese/西方的_受过教育的_工业化的_富裕的_民主的社会/index.html": "d5095b3b6bd066c2",
+"glossary/chinese/规范曲线分析/index.html": "88831d0e26152f8a",
+"glossary/chinese/解放我们的知识平台/index.html": "a81a9f00a36e1177",
+"glossary/chinese/计算可重复性/index.html": "eb13f9ef4ed6ea7c",
+"glossary/chinese/计算模型/index.html": "213b618192d7ce0b",
+"glossary/chinese/认识不确定性/index.html": "b19a4cb40553f72f",
+"glossary/chinese/认识论/index.html": "ead85f360b96f232",
+"glossary/chinese/论文工厂/index.html": "6442de9bb2197cc9",
+"glossary/chinese/证据综合/index.html": "4517ae4bbf48a009",
+"glossary/chinese/语义计量/index.html": "af2f4c02e5067f1f",
+"glossary/chinese/贝叶斯参数估计/index.html": "a49726105d1ad596",
+"glossary/chinese/贝叶斯因子/index.html": "220c53e6d5f7e2ae",
+"glossary/chinese/贝叶斯推断/index.html": "b898ab446086581d",
+"glossary/chinese/贡献/index.html": "c81c707baebcf37c",
+"glossary/chinese/贡献者角色分类法/index.html": "4fc144f4234d3885",
+"glossary/chinese/赠予_或客座_署名权/index.html": "0665d5bf59b53b65",
+"glossary/chinese/辅助假设/index.html": "d879f26134143ebc",
+"glossary/chinese/辅助数据/index.html": "3f2017f96a2feedd",
+"glossary/chinese/选择性终止/index.html": "0777d3a5eec8599f",
+"glossary/chinese/透明度/index.html": "b30f8502d124be6c",
+"glossary/chinese/透明度清单/index.html": "6f0eba62a786b2ed",
+"glossary/chinese/通用学习设计/index.html": "aa5569d31f1b6853",
+"glossary/chinese/通用数据保护条例/index.html": "444fdcd52e556290",
+"glossary/chinese/重复性/index.html": "73a74e0369f03708",
+"glossary/chinese/钻_系统_空子/index.html": "f31df27cf1c778f1",
+"glossary/chinese/错误检测/index.html": "f5e935010cdcfa13",
+"glossary/chinese/随机不确定性/index.html": "97d6822fe962aa2e",
+"glossary/chinese/隐性调节变量/index.html": "c4eb222f0efa706a",
+"glossary/chinese/零假设显著性检验方法/index.html": "0afced2c703a40a1",
+"glossary/chinese/非干预_可重复_开放的系统综述/index.html": "c4ef2abe2cef60f2",
+"glossary/chinese/预印本/index.html": "a2954e3763b2f01e",
+"glossary/chinese/预注册/index.html": "998ff7bf78289788",
+"glossary/chinese/预注册承诺/index.html": "8cdf729c77091bce",
+"glossary/chinese/首末作者强调规范/index.html": "bed48e3981f30890",
+"glossary/chinese/马太效应_科学领域_/index.html": "05847707a1cbbbbb",
+"glossary/chinese/验证性分析/index.html": "18e3b12048e27575",
+"glossary/chinese/黑客马拉松/index.html": "ba8c929555531dd8",
+"glossary/english/abstract_bias/index.html": "0aae057798fd44e0",
+"glossary/english/academic_impact/index.html": "117ed004a0c76e80",
+"glossary/english/accessibility/index.html": "5f57d1d74a218476",
+"glossary/english/ad_hominem_bias/index.html": "ce8429127d8f909c",
+"glossary/english/adversarial_collaboration/index.html": "99469da4e4741810",
+"glossary/english/adversarial_collaborative_commentary/index.html": "9e75dcaa804a6d26",
+"glossary/english/affiliation_bias/index.html": "ef645e8fa8bc682c",
+"glossary/english/aleatoric_uncertainty/index.html": "1923b086ade23bac",
+"glossary/english/altmetrics/index.html": "9ec2cd086219255d",
+"glossary/english/amnesia/index.html": "78b32b0d685362fa",
+"glossary/english/analytic_flexibility/index.html": "eb384cbd580826cd",
+"glossary/english/anonymity/index.html": "4896547d15fbfc39",
+"glossary/english/arrive_guidelines/index.html": "fa4ae16869cf5e14",
+"glossary/english/article_processing_charge_apc_/index.html": "5d3da1970e7a571c",
+"glossary/english/authorship/index.html": "a7d2135f711eb33b",
+"glossary/english/auxiliary_hypothesis/index.html": "1d0ab90474f56fb9",
+"glossary/english/badges_open_science_/index.html": "9405d2e00d2d8c29",
+"glossary/english/bayes_factor/index.html": "a7d071ce4ee92287",
+"glossary/english/bayesian_inference/index.html": "5dde291660bec592",
+"glossary/english/bayesian_parameter_estimation/index.html": "d28a5f01138e831d",
+"glossary/english/bids_data_structure/index.html": "7686ff65e59e51ba",
+"glossary/english/bizarre/index.html": "c979c708b8a31c98",
+"glossary/english/bottom_up_approach_to_open_scholarship_/index.html": "9c67485d3ec342ef",
+"glossary/english/bracketing_interviews/index.html": "029e1bfbdcb4a2d5",
+"glossary/english/bropenscience/index.html": "557e51d96f2b573e",
+"glossary/english/carking/index.html": "d799ad52b15973c8",
+"glossary/english/center_for_open_science_cos_/index.html": "59517e9afbc65663",
+"glossary/english/citation_bias/index.html": "19e47c2850b8681d",
+"glossary/english/citation_diversity_statement/index.html": "761f6e516bf835c2",
+"glossary/english/citizen_science/index.html": "c5312053bb43ba3c",
+"glossary/english/ckan/index.html": "e31d8ef1ca84a060",
+"glossary/english/co_production/index.html": "a3d9e8de5d79f616",
+"glossary/english/coar_community_framework_for_good_practices_in_repositories/index.html": "53167088454ee7cd",
+"glossary/english/code_review/index.html": "ad81d065d764b04f",
+"glossary/english/codebook/index.html": "88790462f033f42a",
+"glossary/english/collaborative_replication_and_education_project_crep_/index.html": "ad3b08fe42277e08",
+"glossary/english/committee_on_best_practices_in_data_analysis_and_sharing_cobidas_/index.html": "34dd584a8ef36a83",
+"glossary/english/communality/index.html": "5e138ed438fca8c2",
+"glossary/english/community_projects/index.html": "e1cdcf5cc11ed1f5",
+"glossary/english/compendium/index.html": "ce717e1591200478",
+"glossary/english/computational_reproducibility/index.html": "c17bd39c789816de",
+"glossary/english/conceptual_replication/index.html": "b9b366eb25f9f296",
+"glossary/english/confirmation_bias/index.html": "f429024e5525d7d9",
+"glossary/english/confirmatory_analyses/index.html": "227482657831788f",
+"glossary/english/conflict_of_interest/index.html": "ac2cd4b1682b50a4",
+"glossary/english/consortium_authorship/index.html": "1ac8bc9167bd9630",
+"glossary/english/constraints_on_generality_cog_/index.html": "0303818d2f53a3b9",
+"glossary/english/construct_validity/index.html": "3803c08a431ce460",
+"glossary/english/content_validity/index.html": "7ee3cac8d5dbcdf3",
+"glossary/english/corrigendum/index.html": "c4409188fcdf3f16",
+"glossary/english/creative_commons_cc_license/index.html": "7474b88ee058dcc2",
+"glossary/english/creative_destruction_approach_to_replication/index.html": "9b278eaaab972582",
+"glossary/english/credibility_revolution/index.html": "60bd550603b47fee",
+"glossary/english/credit/index.html": "0765d6c895465eac",
+"glossary/english/criterion_validity/index.html": "b925b5a7e130fb02",
+"glossary/english/crowdsourced_research/index.html": "f0cff7b56961ba0e",
+"glossary/english/cultural_taxation/index.html": "611a2df1f2f79836",
+"glossary/english/cumulative_science/index.html": "baba3ac7ac6ee9ab",
+"glossary/english/data_access_and_research_transparency_da_rt_/index.html": "834e570ecbd5011b",
+"glossary/english/data_management_plan_dmp_/index.html": "822214a7a430a3a4",
+"glossary/english/data_sharing/index.html": "811682744cced047",
+"glossary/english/data_visualisation/index.html": "ce76b104db5f7a33",
+"glossary/english/decolonisation/index.html": "3e2d07a2108c7bfd",
+"glossary/english/demarcation_criterion/index.html": "a4232831e6ab06df",
+"glossary/english/direct_replication/index.html": "f92222e5e2fdb117",
+"glossary/english/diversity/index.html": "140ff9fc77b44922",
+"glossary/english/doi_digital_object_identifier_/index.html": "afdf77a793dc30f3",
+"glossary/english/dora/index.html": "47b5803ef01cb4be",
+"glossary/english/double_blind_peer_review/index.html": "2eeead075728ad5f",
+"glossary/english/double_consciousness/index.html": "a4834dae95e4dbbb",
+"glossary/english/early_career_researchers_ecrs_/index.html": "da3a8c937151492c",
+"glossary/english/economic_and_societal_impact/index.html": "d4bf46fd46976152",
+"glossary/english/embargo_period/index.html": "850ef5f78131d2fb",
+"glossary/english/epistemic_uncertainty/index.html": "74a4be2c34eabe05",
+"glossary/english/epistemology/index.html": "1c83d662140badfc",
+"glossary/english/equity/index.html": "f6e1da4dfb6c31b4",
+"glossary/english/equivalence_testing/index.html": "d4bf9e93c9fa3dce",
+"glossary/english/error_detection/index.html": "b7ceacaba74c58cc",
+"glossary/english/evidence_synthesis/index.html": "49a9605f5c19a789",
+"glossary/english/exploratory_data_analysis/index.html": "d7b67db40045273d",
+"glossary/english/external_validity/index.html": "ca2c073bcbff102a",
+"glossary/english/face_validity/index.html": "685a8ee179fbe462",
+"glossary/english/fair_principles/index.html": "73b91c8f551ec9b5",
+"glossary/english/feminist_psychology/index.html": "d37de44cfefe95f8",
+"glossary/english/first_last_author_emphasis_norm_flae_/index.html": "a167a78ab643c048",
+"glossary/english/forrt/index.html": "968a85adf78567d6",
+"glossary/english/free_our_knowledge_platform/index.html": "56739321f073b1d5",
+"glossary/english/gaming_the_system_/index.html": "3f18422250d8b290",
+"glossary/english/garden_of_forking_paths/index.html": "29564f7aabd52716",
+"glossary/english/general_data_protection_regulation_gdpr_/index.html": "0e7f01f7e2009ffb",
+"glossary/english/generalizability/index.html": "5450a42f8856d016",
+"glossary/english/gift_or_guest_authorship/index.html": "447b393136b2bf77",
+"glossary/english/git/index.html": "54e399b635114ae1",
+"glossary/english/goodhart_s_law/index.html": "363b698cfb093288",
+"glossary/english/gpower/index.html": "a3bdde8881ecf479",
+"glossary/english/h_index/index.html": "1b165e22ac080da2",
+"glossary/english/hackathon/index.html": "a3f5fdeda7783e56",
+"glossary/english/harking/index.html": "f6422b1de8a01ee6",
+"glossary/english/hidden_moderators/index.html": "5d1c9fe2b5f9e35a",
+"glossary/english/hypothesis/index.html": "f8e3b4899fa57c5e",
+"glossary/english/i10_index/index.html": "0e6e8a81e02da325",
+"glossary/english/ideological_bias/index.html": "da0864b05692433f",
+"glossary/english/incentive_structure/index.html": "4e53718a7b7a21f2",
+"glossary/english/inclusion/index.html": "41230abfbc3fa422",
+"glossary/english/index.html": "297c9d96c0e98aa9",
+"glossary/english/induction/index.html": "44c96b2deadd2f89",
+"glossary/english/interaction_fallacy/index.html": "3b6b83a85577be6a",
+"glossary/english/interlocking/index.html": "3c4f924f2c58949d",
+"glossary/english/internal_validity/index.html": "3254fc6c7a14a245",
+"glossary/english/intersectionality/index.html": "749dd2e5b38c2bd8",
+"glossary/english/jabref/index.html": "a3ab643fc4b7a075",
+"glossary/english/jamovi/index.html": "8c9471e043e911a0",
+"glossary/english/jasp/index.html": "72c66b6c2d8bced5",
+"glossary/english/journal_impact_factor_/index.html": "13ffdc3daecdcc1a",
+"glossary/english/json_file/index.html": "1d4b54c3fcfeef5f",
+"glossary/english/knowledge_acquisition/index.html": "470b0f7202bba427",
+"glossary/english/likelihood_function/index.html": "27675f6365e3c270",
+"glossary/english/likelihood_principle/index.html": "8a181a9c7b93ca73",
+"glossary/english/literature_review/index.html": "9f8ce3ef5a5becc8",
+"glossary/english/manel/index.html": "59e46a48727fd70c",
+"glossary/english/many_authors/index.html": "07456f6a361f4abe",
+"glossary/english/many_labs/index.html": "f8eedd118d9131db",
+"glossary/english/massive_open_online_courses_moocs_/index.html": "1463d205048b1ebd",
+"glossary/english/massively_open_online_papers_moops_/index.html": "1b8319cf250ac1b3",
+"glossary/english/matthew_effect_in_science_/index.html": "f938b106770ea2f7",
+"glossary/english/meta_analysis/index.html": "156d3dad689c6f1f",
+"glossary/english/meta_science_or_meta_research/index.html": "bd2e6fdaa39c71d1",
+"glossary/english/metadata/index.html": "19ef5f8ec39359b7",
+"glossary/english/model_computational_/index.html": "33ae8a33b6a3c4b7",
+"glossary/english/model_philosophy_/index.html": "c278a75a1e6d6ac2",
+"glossary/english/model_statistical_/index.html": "0fe8792b0a9bbbaa",
+"glossary/english/multi_analyst_studies/index.html": "e79e3fd25bc9688a",
+"glossary/english/multiplicity/index.html": "43140b6fe7a4c890",
+"glossary/english/multiverse_analysis/index.html": "16ee6fcd4c944872",
+"glossary/english/name_ambiguity_problem/index.html": "a6542d40a1da22a0",
+"glossary/english/named_entity_based_text_anonymization_for_open_science_netanos_/index.html": "fbc2d2339bd69460",
+"glossary/english/non_intervention_reproducible_and_open_systematic_reviews_niro_sr_/index.html": "5491df44920ba64a",
+"glossary/english/null_hypothesis_significance_testing_nhst_/index.html": "619858ce181dba90",
+"glossary/english/objectivity/index.html": "cf37993294ef299d",
+"glossary/english/ontology_artificial_intelligence_/index.html": "64b16c83389aa8d5",
+"glossary/english/open_access/index.html": "ff6f9b76d3941379",
+"glossary/english/open_code/index.html": "8a52aad5abc6c7d4",
+"glossary/english/open_data/index.html": "434595dd6ba0c120",
+"glossary/english/open_educational_resources_oer_commons/index.html": "b2c684c1685f7ed8",
+"glossary/english/open_educational_resources_oers_/index.html": "ec8119c0de332c68",
+"glossary/english/open_licenses/index.html": "252fa1b9d811dd9b",
+"glossary/english/open_material/index.html": "1bc8ea0591f0cddf",
+"glossary/english/open_peer_review/index.html": "97ce29d2eeebc3ff",
+"glossary/english/open_scholarship/index.html": "609779fc7ff3a862",
+"glossary/english/open_scholarship_knowledge_base/index.html": "4b07c50442444b15",
+"glossary/english/open_science/index.html": "955924196a129701",
+"glossary/english/open_science_framework/index.html": "2434c7635f83be1b",
+"glossary/english/open_source_software/index.html": "481d28e552f73037",
+"glossary/english/open_washing/index.html": "80b357b6cf4055af",
+"glossary/english/openneuro/index.html": "8932e835489f6997",
+"glossary/english/optional_stopping/index.html": "3d40c0f130a9347c",
+"glossary/english/orcid_open_researcher_and_contributor_id_/index.html": "222b4c34238709bc",
+"glossary/english/overlay_journal/index.html": "c5a34bdf28ce8db9",
+"glossary/english/p_curve/index.html": "40f7f30591278f37",
+"glossary/english/p_hacking/index.html": "493dd3747e284113",
+"glossary/english/p_value/index.html": "837243c6d090a79b",
+"glossary/english/papermill/index.html": "a3e8a9d57511dc77",
+"glossary/english/paradata/index.html": "3b4286bf59978f57",
+"glossary/english/parking/index.html": "d0fe6ae2e8b542a1",
+"glossary/english/participatory_research/index.html": "3f47dfec179f27cf",
+"glossary/english/patient_and_public_involvement_ppi_/index.html": "9fabf0104484d3c2",
+"glossary/english/paywall/index.html": "220d95ab95870a2f",
+"glossary/english/pci_peer_community_in_/index.html": "d6f6fe607276a73d",
+"glossary/english/pci_registered_reports/index.html": "259653907a7cb12e",
+"glossary/english/plan_s/index.html": "35b0f18bab310794",
+"glossary/english/positionality/index.html": "bddd2e5dc7c71c31",
+"glossary/english/positionality_map/index.html": "db55c1ef4918b680",
+"glossary/english/post_hoc/index.html": "9cb1a74b66b60f08",
+"glossary/english/post_publication_peer_review/index.html": "c84a4de7fda45e8e",
+"glossary/english/posterior_distribution/index.html": "86ff7688ddd23892",
+"glossary/english/predatory_publishing/index.html": "016fbd920409ac1b",
+"glossary/english/prepare_guidelines/index.html": "a78583d85d8a9d45",
+"glossary/english/preprint/index.html": "ddec39eab3c8f19d",
+"glossary/english/preregistration/index.html": "f845a2c5c567b0ac",
+"glossary/english/preregistration_pledge/index.html": "f30587473c388803",
+"glossary/english/prior_distribution/index.html": "4e8accde705faac5",
+"glossary/english/pro_peer_review_openness_initiative/index.html": "5f5e2a29852defd3",
+"glossary/english/pseudonymisation/index.html": "f4085d4c092e224c",
+"glossary/english/pseudoreplication/index.html": "80b767be2ea49340",
+"glossary/english/psychometric_meta_analysis/index.html": "10aa9f00d0962121",
+"glossary/english/public_trust_in_science/index.html": "55a5f7f0805cf8b0",
+"glossary/english/publication_bias_file_drawer_problem_/index.html": "416dc5920ca4d435",
+"glossary/english/publish_or_perish/index.html": "3c5d51d5cba2cee1",
+"glossary/english/pubpeer/index.html": "c64d529d7fc8c87d",
+"glossary/english/python/index.html": "eee2d3f43b028419",
+"glossary/english/qualitative_research/index.html": "49abcfd3f02304dd",
+"glossary/english/quantitative_research/index.html": "e1e0c2253d7fd4f3",
+"glossary/english/questionable_measurement_practices_qmp_/index.html": "44cef2c95006ce32",
+"glossary/english/questionable_research_practices_or_questionable_reporting_practices_qrps_/index.html": "d1161bee50ab859a",
+"glossary/english/r/index.html": "733acb309117c76a",
+"glossary/english/red_teams/index.html": "aa52ac8894d4af9e",
+"glossary/english/reflexivity/index.html": "273a610ec70a08f0",
+"glossary/english/registered_report/index.html": "3dc35b1b417b85a9",
+"glossary/english/registry_of_research_data_repositories/index.html": "5fc74931d585e3a6",
+"glossary/english/reliability/index.html": "d5513a76f15bda69",
+"glossary/english/repeatability/index.html": "06243ad52513f96f",
+"glossary/english/replicability/index.html": "b24dc53240da6ecc",
+"glossary/english/replication_markets/index.html": "1d6cab1fd9b7f203",
+"glossary/english/replicats_project/index.html": "6d54af720778a9ef",
+"glossary/english/reporting_guideline/index.html": "197f31c8fc347bae",
+"glossary/english/repository/index.html": "2ef914e9bddedb11",
+"glossary/english/reproducibilitea/index.html": "dc74c420bc987bce",
+"glossary/english/reproducibility/index.html": "27804220a60eb656",
+"glossary/english/reproducibility_crisis_aka_replicability_or_replication_crisis_/index.html": "57d35ef76e7dcab5",
+"glossary/english/reproducibility_network/index.html": "9522550704de3307",
+"glossary/english/research_contribution_metric__p_/index.html": "f59befb5ae784ec3",
+"glossary/english/research_cycle/index.html": "ab43bcaca2461a30",
+"glossary/english/research_data_management/index.html": "148b2d6cd76e7c7a",
+"glossary/english/research_integrity/index.html": "f1937ba24d65e0dd",
+"glossary/english/research_protocol/index.html": "2af3fc61c0503014",
+"glossary/english/research_workflow/index.html": "179e64cacb7cfac8",
+"glossary/english/researcher_degrees_of_freedom/index.html": "b0a0bf757aca2fd0",
+"glossary/english/responsible_research_and_innovation/index.html": "0ad204723f9a3d58",
+"glossary/english/reverse_p_hacking/index.html": "9d5cc11b28749626",
+"glossary/english/riot_science_club/index.html": "62606acde77859a3",
+"glossary/english/robustness_analyses_/index.html": "5b4b4e2e056d166c",
+"glossary/english/salami_slicing/index.html": "17456b97834ba0dc",
+"glossary/english/scooping/index.html": "db294988332b251a",
+"glossary/english/semantometrics/index.html": "c99fed4b92a058cf",
+"glossary/english/sensitive_research/index.html": "d57a786786b2000c",
+"glossary/english/sequence_determines_credit_approach_sdc_/index.html": "cdc61a16345047bb",
+"glossary/english/sherpa_romeo/index.html": "437a639aac585d40",
+"glossary/english/single_blind_peer_review/index.html": "6b38781f38c095cc",
+"glossary/english/slow_science/index.html": "abb9af78e7234dff",
+"glossary/english/social_class/index.html": "df8625dbac2e4002",
+"glossary/english/social_integration/index.html": "6e87b972acf8f924",
+"glossary/english/society_for_open_reliable_and_transparent_ecology_and_evolutionary_biology_sortee_/index.html": "dd1930494149989b",
+"glossary/english/society_for_the_improvement_of_psychological_science_sips_/index.html": "c1d583321abf7e5e",
+"glossary/english/specification_curve_analysis/index.html": "e127c48e43b8ed4a",
+"glossary/english/statistical_assumptions/index.html": "81ba8202ab5d58b1",
+"glossary/english/statistical_power/index.html": "3cb5d931ed6bd604",
+"glossary/english/statistical_significance/index.html": "e3c3632bb88fc0b5",
+"glossary/english/statistical_validity/index.html": "234b0386929dcfd1",
+"glossary/english/strange/index.html": "d0e7402ba0e5da07",
+"glossary/english/studyswap/index.html": "7be2a7e0c1274094",
+"glossary/english/systematic_review/index.html": "0726847fb33d7985",
+"glossary/english/tenzing/index.html": "40ede35ae20e409e",
+"glossary/english/the_troubling_trio/index.html": "46cf9095493d5db3",
+"glossary/english/theory/index.html": "4d89ef98b4f36868",
+"glossary/english/theory_building/index.html": "cfcee1a733b7fbc7",
+"glossary/english/transparency/index.html": "9699ba2ac95ed2aa",
+"glossary/english/transparency_checklist/index.html": "2576a2028f1256f4",
+"glossary/english/triple_blind_peer_review/index.html": "927766e18d69a510",
+"glossary/english/trust_principles/index.html": "f63cf49868fc17fc",
+"glossary/english/type_i_error/index.html": "d51c1fbc0f68957a",
+"glossary/english/type_ii_error/index.html": "56117ad8306c27f0",
+"glossary/english/type_m_error/index.html": "cfe61cdfa1fca37a",
+"glossary/english/type_s_error/index.html": "692b0956e0a57845",
+"glossary/english/under_representation/index.html": "d1d80d5828f3d15b",
+"glossary/english/universal_design_for_learning_udl_/index.html": "e97aa24383579a7b",
+"glossary/english/validity/index.html": "427033a8cb3c3fe4",
+"glossary/english/version_control/index.html": "f7291f2d6fb72ef4",
+"glossary/english/webometrics/index.html": "efa0c0ab30899750",
+"glossary/english/z_curve/index.html": "904ed5c967c10391",
+"glossary/english/zenodo/index.html": "ebae16dc23329dcf",
+"glossary/german/a_priori_verteilung/index.html": "9545d7e3138202b6",
+"glossary/german/abstract_verzerrung/index.html": "b96dd21b19b72c40",
+"glossary/german/ad_hominem_verzerrung/index.html": "4861f6464357f05c",
+"glossary/german/affiliations_verzerrung/index.html": "c62c3859a2e54469",
+"glossary/german/aka_replicability_or_replication_crisis_reproduzierbarkeitskrise_auch_replizierbarkeitskrise_oder_replikationskrise/index.html": "aa83de408c77fa5e",
+"glossary/german/akademischer_einfluss/index.html": "f91c3e63c54b05c5",
+"glossary/german/aleatorische_unsicherheit/index.html": "974b613c36976fb9",
+"glossary/german/altmetrics/index.html": "efa229ddfa333a78",
+"glossary/german/amnesia/index.html": "be981e59636c363c",
+"glossary/german/analyses_robustheit_sanalysen/index.html": "d24888a600457fd8",
+"glossary/german/analytische_flexibilitat/index.html": "e16a733b67153a11",
+"glossary/german/anonymitat/index.html": "12d8c8fc96c30f45",
+"glossary/german/anreizsystem/index.html": "dfb21a6526cc8939",
+"glossary/german/aquivalenztesten/index.html": "a15dadb2133aebf7",
+"glossary/german/arrive_leitlinien/index.html": "e59a769c45e0fe0e",
+"glossary/german/artificial_intelligence_ontologie_in_der_kunstlichen_intelligenz/index.html": "39245df6863e8b47",
+"glossary/german/artikelverarbeitungsgebuhr/index.html": "ef671268ffd11481",
+"glossary/german/augenscheinvaliditat/index.html": "61efd355d488ea96",
+"glossary/german/autor_innenschaft/index.html": "748f4eccc5053b0c",
+"glossary/german/barrierefreiheit/index.html": "418bfe57451b54f2",
+"glossary/german/bayes_faktor/index.html": "9a6de7eec6b611bf",
+"glossary/german/bayes_sche_parameter_schatzung/index.html": "bfdc638d6b332b0d",
+"glossary/german/bayessche_inferenz/index.html": "11a6810773bcf4e7",
+"glossary/german/beitrag/index.html": "60e4347156f8ce9a",
+"glossary/german/berichtleitlinien/index.html": "19506dab3785f930",
+"glossary/german/bestatigungsverzerrung/index.html": "a3e106aa169dbb11",
+"glossary/german/bezahlschranke/index.html": "1743ad5796ed31bb",
+"glossary/german/bids_datenstruktur/index.html": "88e74e86adebd584",
+"glossary/german/bizarre/index.html": "1ce2fdb7bfba8bdf",
+"glossary/german/bropenscience/index.html": "4d9b7e67c4967e93",
+"glossary/german/burger_innenwissenschaft/index.html": "e92f829c2e733a67",
+"glossary/german/carking/index.html": "4ee6ef923e3c1f52",
+"glossary/german/cc/index.html": "ff8caaf49084b327",
+"glossary/german/ckan/index.html": "5f63ba7370c37429",
+"glossary/german/coar_community_framework_for_good_practices_in_repositories/index.html": "604c89db7ef9c82c",
+"glossary/german/cobidas/index.html": "c0fc96efb7567abd",
+"glossary/german/code_uberprufung/index.html": "6c97fa6adcd2ca10",
+"glossary/german/codebuch/index.html": "257c961d395c8b55",
+"glossary/german/cog_beschrankungen_der_generalisierbarkeit/index.html": "119fa8ee804aa680",
+"glossary/german/collaborative_commentary_gegnerischer_kollaborativer_kommentar/index.html": "5133e5a158e9ad13",
+"glossary/german/computational_rechenmodell/index.html": "be026bc6ea030b49",
+"glossary/german/cos/index.html": "f82f732e2c62373b",
+"glossary/german/credit/index.html": "dae99625f7c8772b",
+"glossary/german/crep/index.html": "3f520083c378099b",
+"glossary/german/crowdsourcing_forschung/index.html": "c2d9e821a1bd75dd",
+"glossary/german/da_rt/index.html": "d2c739857b7ee9e7",
+"glossary/german/data_sharing/index.html": "ddc3059705419ece",
+"glossary/german/datenvisualisierung/index.html": "f130516b7b9fbe95",
+"glossary/german/dekolonialisierung/index.html": "1b62c637ce04fbc4",
+"glossary/german/demarkationskriterium/index.html": "fff63bb50957bf30",
+"glossary/german/die_dreisten_drei/index.html": "9e5be8e17b3f8d02",
+"glossary/german/digital_object_identifier/index.html": "8475ef04ce0f3964",
+"glossary/german/direkte_replikation/index.html": "e54c01863ac94761",
+"glossary/german/diversity/index.html": "4598d5c3c49121ea",
+"glossary/german/dmp_datenmanagementplan/index.html": "de267f84efd6a8d4",
+"glossary/german/doppelblinde_begutachtung/index.html": "ee7bbf9a42a88005",
+"glossary/german/doppeltes_bewusstsein/index.html": "05e9b28c8d16bc55",
+"glossary/german/dora/index.html": "b8520d338e53aebf",
+"glossary/german/dreifach_blindes_peer_review/index.html": "bd176805d13a3d09",
+"glossary/german/economic_and_societal_impact/index.html": "dcc5d5c4046ac089",
+"glossary/german/ecrs_nachwuchswissenschaftler_innen/index.html": "5c3413e4ae607315",
+"glossary/german/einfachblinde_peer_begutachtung/index.html": "3518964d4b1208ca",
+"glossary/german/epistemiologie__erkenntnistheorie/index.html": "be610cde0785d3ed",
+"glossary/german/epistemische_unsicherheit/index.html": "c701c3c3bf2ef885",
+"glossary/german/evidenzsynthese/index.html": "a69237df51a6be6f",
+"glossary/german/explorative_datenanalyse/index.html": "95f3f2e82256e9d8",
+"glossary/german/externe_validitat/index.html": "917a3ab26f877246",
+"glossary/german/fair_prinzipien/index.html": "9e8c98cc392dabac",
+"glossary/german/fehlererfassung/index.html": "614ee723cff9069a",
+"glossary/german/feministische_psychologie/index.html": "dfa37472077618dc",
+"glossary/german/file_drawer_problem_publikationsverzerrung_aktenschubladenproblem/index.html": "e51902a54436d9a7",
+"glossary/german/flae_norm_der_betonung_der_erst_und_letztautor_innenschaft/index.html": "24f1f6e53efd2b3a",
+"glossary/german/forrt/index.html": "580a2c301ef775fd",
+"glossary/german/forschungs_arbeitsablauf/index.html": "4bcd32947ff7239d",
+"glossary/german/forschungsdatenmanagement/index.html": "0a6462c153be557f",
+"glossary/german/forschungsintegritat/index.html": "7bf20b2dedeaef7f",
+"glossary/german/forschungsprotokoll/index.html": "024c436884e68a01",
+"glossary/german/forschungszyklus/index.html": "75f93c6e8f62d4ee",
+"glossary/german/free_our_knowledge_platform/index.html": "cadf4ccbea4d9851",
+"glossary/german/freiheitsgrade_von_forschenden/index.html": "7448b1ab4b3be05a",
+"glossary/german/garten_der_weggabelungen/index.html": "e6489a4d09f0c200",
+"glossary/german/gdpr_dt_datenschutzgrundverordnung_dsgvo/index.html": "351e0bb3f7659faa",
+"glossary/german/gegnerische_kollaboration/index.html": "d6c849b4cc63898e",
+"glossary/german/gemeinschaftsprojekte/index.html": "e5837d05618bb2b2",
+"glossary/german/generalisierbarkeit/index.html": "ba78d2006dbdd0c8",
+"glossary/german/git/index.html": "958d72f2f3fb11d3",
+"glossary/german/glaubhaftigkeitsrevolution/index.html": "00e55c3f473f2250",
+"glossary/german/gleichstellung/index.html": "8cb1ae16f909da7d",
+"glossary/german/goodharts_gesetz/index.html": "ea39e541f8d15378",
+"glossary/german/gpower/index.html": "765284d0c78e8483",
+"glossary/german/h_index_hirsch_index/index.html": "1d82b98d8e5dbdcd",
+"glossary/german/hackathon/index.html": "d1b2453735d535d6",
+"glossary/german/handbuch/index.html": "75547f463dca2bad",
+"glossary/german/harking/index.html": "78516df93792e451",
+"glossary/german/hilfshypothese/index.html": "14152988e142d478",
+"glossary/german/hypothese/index.html": "dc2b0d81be58093a",
+"glossary/german/i10_index/index.html": "228493825abf559c",
+"glossary/german/ideologische_verzerrung/index.html": "c063072d3c2d6469",
+"glossary/german/im_nachhinein/index.html": "fd797fb0f7f71aa2",
+"glossary/german/in_science_matthew_effekt_in_der_wissenschaft/index.html": "4fd79a05a269a827",
+"glossary/german/index.html": "47d5a4efd29b4bec",
+"glossary/german/induktion/index.html": "5de064e5c975683e",
+"glossary/german/inhaltsvaliditat/index.html": "4b05990364b73fc7",
+"glossary/german/inklusion_inklusivitat/index.html": "31bbb79d824a358a",
+"glossary/german/interaktionsfehlschluss/index.html": "152cde73faf75e4c",
+"glossary/german/interessenkonflikt/index.html": "fcf1b76369303e85",
+"glossary/german/interne_validitat/index.html": "046b20a9d22cf3eb",
+"glossary/german/intersektionalitat/index.html": "bbe179070a3b2120",
+"glossary/german/jabref/index.html": "41347d94ea0716e7",
+"glossary/german/jamovi/index.html": "486d2f3706018ef5",
+"glossary/german/jasp/index.html": "322d92ebdd429dca",
+"glossary/german/json_file/index.html": "210a51bf9b46b752",
+"glossary/german/klammer_interviews/index.html": "25f66d08ff79c171",
+"glossary/german/knowledge_acquisition/index.html": "59e314072fc0ca0c",
+"glossary/german/ko_produktion/index.html": "6176477add630ca1",
+"glossary/german/kommunalitat/index.html": "1f4f38ba0e7302b0",
+"glossary/german/konfirmatorische_analysen/index.html": "93cb09505dccd5a3",
+"glossary/german/konsortium_autor_innenschaft/index.html": "6a6a0526d57f4b9f",
+"glossary/german/konstruktvaliditat/index.html": "27d34aceef798449",
+"glossary/german/konzeptionelle_replikation/index.html": "743836e728aca3a6",
+"glossary/german/korrigendum/index.html": "bb43f92ce64b9545",
+"glossary/german/kriteriumsvaliditat/index.html": "019661ecc1bb2cff",
+"glossary/german/kulturelle_taxierung/index.html": "70cbba3d5402a416",
+"glossary/german/kumulative_wissenschaft/index.html": "6f5a39c9aadba14a",
+"glossary/german/langsame_forschung/index.html": "bbde1eda0140bb25",
+"glossary/german/likelihood_funktion/index.html": "34401c7c8e6f19c3",
+"glossary/german/likelihood_prinzip/index.html": "d5be03dca4e649c8",
+"glossary/german/literaturzusammenfassung/index.html": "1127fb84682c4950",
+"glossary/german/manel/index.html": "dc0d1a658892975c",
+"glossary/german/many_authors/index.html": "2198c005b3f4d8f4",
+"glossary/german/many_labs/index.html": "efdb0347492f374f",
+"glossary/german/meta_analyse/index.html": "1e5708fdaabb071b",
+"glossary/german/meta_wissenschaft_oder_meta_forschung/index.html": "8fdf49c5b3e3fd1f",
+"glossary/german/metadaten/index.html": "95b149b044418c6e",
+"glossary/german/moocs/index.html": "abc38eddeb73468f",
+"glossary/german/moops/index.html": "cfd3adf543628222",
+"glossary/german/multi_analytiker_innen_studien/index.html": "4dc09e0e010ce8c9",
+"glossary/german/multiplizitat/index.html": "27306dea3afbc922",
+"glossary/german/multiversumsanalyse/index.html": "f339a3720d1969ac",
+"glossary/german/netanos/index.html": "33dd9cb250b1ae1e",
+"glossary/german/nhst_nullhypothesen_signifikanztestung/index.html": "3f2023af6a24634e",
+"glossary/german/niro_sr/index.html": "959637605b62f90c",
+"glossary/german/objektivitat/index.html": "7c37147b3b42e6fe",
+"glossary/german/oer/index.html": "10d1c63897f3bcdb",
+"glossary/german/oers_offene_bildungsressourcen/index.html": "20c7ec2cd65a6a67",
+"glossary/german/offene_begutachtung/index.html": "aa3fb38bfc33486c",
+"glossary/german/offene_daten/index.html": "379339ff5d96173e",
+"glossary/german/offene_forschung/index.html": "2bb91b19ba23a4cb",
+"glossary/german/offene_lizenzen/index.html": "e0a1e12d6732bdc6",
+"glossary/german/offene_materialien/index.html": "87157fe140adf32e",
+"glossary/german/offener_code/index.html": "59ea0ada49e8006f",
+"glossary/german/offentliches_vertrauen_in_die_wissenschaft/index.html": "f247dcd922eaa600",
+"glossary/german/open_access/index.html": "405d02505dae1f0e",
+"glossary/german/open_researcher_and_contributor_id/index.html": "8445b37d33d09a78",
+"glossary/german/open_scholarship/index.html": "9db61f031b7078b4",
+"glossary/german/open_scholarship_knowledge_base/index.html": "03a0eecc53437b58",
+"glossary/german/open_science_framework/index.html": "b11fb1ad7b1338bc",
+"glossary/german/open_science_open_science_abzeichen/index.html": "ac116a22fde7b3d6",
+"glossary/german/open_washing/index.html": "8dfa17a178fdc8d1",
+"glossary/german/openneuro/index.html": "675a7f12d3693724",
+"glossary/german/optionales_stoppen/index.html": "e2bcc3747d918b55",
+"glossary/german/or_guest_authorship_geschenkte_autor_innenschaft__gastautor_innenschaft/index.html": "7fbff1312c0281ef",
+"glossary/german/overlay_zeitschrift/index.html": "7b5ce8781f348fa3",
+"glossary/german/p/index.html": "ba86a688fa4e2def",
+"glossary/german/p_hacking/index.html": "7732cc6810378401",
+"glossary/german/p_kurve/index.html": "78810f35a9bd8e87",
+"glossary/german/p_wert/index.html": "6e4bf753afd60daa",
+"glossary/german/papierfabrik/index.html": "1530ba0b1e626b53",
+"glossary/german/paradaten/index.html": "7f9ff988d0cd5eb7",
+"glossary/german/parking/index.html": "ed2b22a2430eb085",
+"glossary/german/partizipative_forschung/index.html": "d72554fb5efc226b",
+"glossary/german/pci_registered_reports/index.html": "ff33d2234e61f322",
+"glossary/german/peer_community_in/index.html": "21baac3e9cc950e8",
+"glossary/german/peer_review_nach_der_veroffentlichung/index.html": "f1cf8a3b4437106c",
+"glossary/german/peer_review_openness_initiative_pro_initiative/index.html": "b8dabc5339f50878",
+"glossary/german/philosophy/index.html": "ac967bbfc082ddc4",
+"glossary/german/plan_s/index.html": "0cc0a4dc853d9063",
+"glossary/german/positionalitat/index.html": "1949410e46455829",
+"glossary/german/positionalitatskarte/index.html": "d0de463f7b51b87c",
+"glossary/german/posterior_distribution/index.html": "b065cb139bba08a8",
+"glossary/german/ppi_einbindung_von_patient_innen_und_offentlichkeit/index.html": "f065566899b13f21",
+"glossary/german/praregistrierung/index.html": "50916477d54dff92",
+"glossary/german/praregistrierungs_versprechen/index.html": "47b0ca8d584bc534",
+"glossary/german/predatory_verlagswesen/index.html": "122b2208458792ab",
+"glossary/german/prepare_leitlinien/index.html": "fc87787eda12c546",
+"glossary/german/problem_mehrdeutiger_namen/index.html": "0dfb35cfcc9cd79d",
+"glossary/german/pseudonymisierung/index.html": "18c793d3365fd671",
+"glossary/german/pseudoreplikation/index.html": "ce9b9d9973bef129",
+"glossary/german/psychometrische_metaanalyse/index.html": "dfe3b078905fc22a",
+"glossary/german/publizieren_oder_untergehen/index.html": "74392ca12a045071",
+"glossary/german/pubpeer/index.html": "49f2aef9294cb869",
+"glossary/german/python/index.html": "12770721ec0cd93c",
+"glossary/german/qmp_fragwurdige_forschungspraktiken/index.html": "22449b213d180041",
+"glossary/german/qrps_fragwurdige_forschungs_oder_veroffentlichungspraktiken/index.html": "9e8f6db6ed6a34cb",
+"glossary/german/qualitative_forschung/index.html": "9d98768bb9cb51df",
+"glossary/german/quantitative_forschung_translated_reviewed/index.html": "02fccd18760ef74e",
+"glossary/german/r/index.html": "62f46076943d234d",
+"glossary/german/rechnerische_reproduzierbarkeit/index.html": "b8be8a5f044da102",
+"glossary/german/reflexivitat/index.html": "65f58eefad9701b0",
+"glossary/german/registered_report/index.html": "91fd39db7dbdc34f",
+"glossary/german/registry_of_research_data_repositories/index.html": "67ab1a1b54d3fd67",
+"glossary/german/reliabilitat/index.html": "ce1afa86fe9b9135",
+"glossary/german/replicats_project/index.html": "8adc3c370bd26291",
+"glossary/german/replikabilitat/index.html": "653446611d8d1234",
+"glossary/german/replikationsmarkte/index.html": "1407bb9a3a970c7e",
+"glossary/german/repositorium/index.html": "3cbe16b34cd6a187",
+"glossary/german/reproducibilitea/index.html": "30d26a3b8ab56fab",
+"glossary/german/reproduzierbarkeit/index.html": "5c9b0c1cfd24a70e",
+"glossary/german/reproduzierbarkeitsnetzwerk/index.html": "b8de8d5503a0b06f",
+"glossary/german/reverse_p_hacking/index.html": "6c33a673bac33a0d",
+"glossary/german/riot_science_club/index.html": "9641603d08b16a37",
+"glossary/german/rote_teams/index.html": "aff4aeba32dca981",
+"glossary/german/salamischneiden/index.html": "46d4c28579fa7ef9",
+"glossary/german/schopferische_zerstorung_als_herangehensweise_an_replikationen/index.html": "4bf9aa58e3e4525a",
+"glossary/german/sdc/index.html": "8340d85ecbf12ae0",
+"glossary/german/semantometrie/index.html": "1684c8586dbf9ef3",
+"glossary/german/sensitive_forschung/index.html": "b0954e9d4ce99659",
+"glossary/german/sherpa_romeo/index.html": "c3807bda79fb55b9",
+"glossary/german/sips/index.html": "49b6a43abed0142f",
+"glossary/german/software_mit_offenem_quellcode/index.html": "75d9c853434c1c3e",
+"glossary/german/sortee/index.html": "b3abd27e0c7dafd2",
+"glossary/german/soziale_integration/index.html": "71ebf284fe9581f8",
+"glossary/german/soziale_schicht/index.html": "59ad3d58125ff7e9",
+"glossary/german/sperrfrist/index.html": "100a912668d06f13",
+"glossary/german/spezifikationskurvenanalyse/index.html": "7d451ce4120de08e",
+"glossary/german/statistical_statistisches_modell/index.html": "7ad1c6dcf194eb40",
+"glossary/german/statistische_signifikanz/index.html": "c081bca61d0b2ae2",
+"glossary/german/statistische_teststarke/index.html": "422e7f2418c0c3f8",
+"glossary/german/statistische_validitat/index.html": "663b8a7f5efb9fe8",
+"glossary/german/statistische_vorannahmen/index.html": "e72af3e1e0a51906",
+"glossary/german/strange/index.html": "6c49afa84336652d",
+"glossary/german/studyswap/index.html": "37f24ed4267d7506",
+"glossary/german/systematisches_review/index.html": "fca748c5580543b6",
+"glossary/german/tenzing/index.html": "cd3ebc26ea5cbb83",
+"glossary/german/the_system_das_system_uberlisten/index.html": "821d1812af6d30d3",
+"glossary/german/theorie/index.html": "54fb41e1c310e8b1",
+"glossary/german/theoriebildung/index.html": "b7d5775849c3c63b",
+"glossary/german/to_open_scholarship_bottom_up_ansatz/index.html": "6e0a93eb96b31f20",
+"glossary/german/transparenz/index.html": "a5ecaeac0969e3f7",
+"glossary/german/transparenz_checkliste/index.html": "e23d3e18335b119f",
+"glossary/german/trim_and_fill_method/index.html": "917495f80e0f0c03",
+"glossary/german/trust_prinzipien/index.html": "efa8ad9da5911b14",
+"glossary/german/typ_i_fehler/index.html": "272af2676f09b639",
+"glossary/german/typ_ii_fehler/index.html": "e95542eb02af81e2",
+"glossary/german/typ_m_fehler/index.html": "8672b36b1a8e6b6f",
+"glossary/german/typ_s_fehler/index.html": "d99503c18953f32f",
+"glossary/german/udl/index.html": "7fb9a33ca3933bc1",
+"glossary/german/untergrabung/index.html": "bed0aebb4053f38d",
+"glossary/german/unterreprasentation/index.html": "8f62ac78bb8763ec",
+"glossary/german/validitat/index.html": "cf3a25ea3b93116c",
+"glossary/german/verantwortungsvolle_forschung_und_innovation/index.html": "53811b8fa79d4fde",
+"glossary/german/versionskontrolle/index.html": "8109295fe1c84887",
+"glossary/german/versteckte_moderatoren/index.html": "a6ba3905a342b2e8",
+"glossary/german/verzahnung/index.html": "9b389dabd76c3ea8",
+"glossary/german/vorabdruck/index.html": "7cb6e24f23f914bb",
+"glossary/german/webometrie/index.html": "49d798dd15b0d9ef",
+"glossary/german/weird/index.html": "0dcfce382baeb012",
+"glossary/german/wiederholbarkeit/index.html": "6d3eb880d529ff7f",
+"glossary/german/z_kurve/index.html": "f49a021ab32f063f",
+"glossary/german/zeitschriften_impact_faktor/index.html": "a5fb908b91d09d01",
+"glossary/german/zenodo/index.html": "e4330ea4f1a78057",
+"glossary/german/zitations_diversitats_erklarung/index.html": "e0c70d95acea8f6b",
+"glossary/german/zitations_verzerrung/index.html": "46f575811daec447",
+"glossary/references/index.html": "56be18f58e1eb956",
+"glossary/turkish/acık_akademi/index.html": "907920c97af3330d",
+"glossary/turkish/acık_akademi_bilgi_tabanı_oskb_open_scholarship_knowledge_base_/index.html": "7818eb1f513c664b",
+"glossary/turkish/acık_aklama/index.html": "af53804bc71ffa99",
+"glossary/turkish/acık_arastırmacı_ve_katkı_saglayıcı_kimligi_orcid_open_researcher_and_contributor_id_/index.html": "a5c78621b436f32e",
+"glossary/turkish/acık_bilim/index.html": "8ef9ffd0c5021959",
+"glossary/turkish/acık_bilim_icin_adlandırılmıs_varlık_tabanlı_metin_anonimlestirme_netanos_named_entity_based_text_anonymization_for_open_science_/index.html": "04c46b0a0ca0ecf5",
+"glossary/turkish/acık_bilim_merkezi/index.html": "cec3ffb26297006e",
+"glossary/turkish/acık_bilim_platformu_osf_open_science_framework_/index.html": "3b769080aeab4c17",
+"glossary/turkish/acık_egitim_kaynakları_platformu/index.html": "7a5f45b65c4fec87",
+"glossary/turkish/acık_erisim/index.html": "aa39836e803003b4",
+"glossary/turkish/acık_guvenilir_ve_seffaf_ekoloji_ve_evrimsel_biyoloji_dernegi/index.html": "c38aac515a29736d",
+"glossary/turkish/acık_hakem_degerlendirmesi/index.html": "1834fdfdd3302106",
+"glossary/turkish/acık_kaynaklı_yazılım/index.html": "60adb87d5546a258",
+"glossary/turkish/acık_kod/index.html": "8d7ab1b944170da0",
+"glossary/turkish/acık_lisanslar/index.html": "f7b09ccffc67b825",
+"glossary/turkish/acık_materyal/index.html": "555988699426cf67",
+"glossary/turkish/acık_veri/index.html": "dad63d7a0099ef6e",
+"glossary/turkish/ad_hominem_safsatası/index.html": "e78b2d0d4c95b4bf",
+"glossary/turkish/agacık_bilim/index.html": "a47f515c37004607",
+"glossary/turkish/akademik_etki/index.html": "ca8af7f0436fafa7",
+"glossary/turkish/akran_toplulugu_icinde_degerlendirme_sistemi_pci_peer_community_in_/index.html": "fb05a014daa36c21",
+"glossary/turkish/aleatorik_seckisiz_belirsizlik/index.html": "730914e711e97ecf",
+"glossary/turkish/altmetriler/index.html": "5127436ba1b5b3ec",
+"glossary/turkish/ambargo_suresi/index.html": "46ae108375d11762",
+"glossary/turkish/amnesia/index.html": "f11959ecaca3e191",
+"glossary/turkish/analitik_esneklik/index.html": "b4a1142804dd163f",
+"glossary/turkish/anonimlik/index.html": "e9be68316420f165",
+"glossary/turkish/arastırma_dongusu/index.html": "6d95ba51e3763ba1",
+"glossary/turkish/arastırma_is_akısı/index.html": "1c4bbf9e82ca96b4",
+"glossary/turkish/arastırma_protokolu/index.html": "112c86aafa6f930d",
+"glossary/turkish/arastırma_veri_deposu_kayıtları/index.html": "4909971653a4dad4",
+"glossary/turkish/arastırma_verisi_yonetimi_avy_/index.html": "4991166cd5f3c82e",
+"glossary/turkish/arastırmacının_serbestlik_derecesi/index.html": "1600b18bfc6a7a0a",
+"glossary/turkish/arastırmada_etik_butunluk/index.html": "2bea9c1b803e9851",
+"glossary/turkish/arrive_kılavuzu/index.html": "c28cba35bad96d64",
+"glossary/turkish/asagıdan_yukarıya_yaklasım_acık_akademiye_yonelik_/index.html": "4d38728312eada17",
+"glossary/turkish/atıf_cesitliligi_beyanı/index.html": "2dab894662bf1a56",
+"glossary/turkish/atıf_yanlılıgı/index.html": "47e85e92b4853923",
+"glossary/turkish/baglantı_yanlılıgı/index.html": "72651d70857d3a9b",
+"glossary/turkish/bayes_faktoru/index.html": "b5706b8395152a49",
+"glossary/turkish/bayesyen_cıkarım/index.html": "dc07c44e7e32cc00",
+"glossary/turkish/bayesyen_parametre_tahmini/index.html": "83cbbc0c65d84faa",
+"glossary/turkish/bela_uclu/index.html": "563d387db12efd62",
+"glossary/turkish/bids_veri_yapısı/index.html": "496dee1537774098",
+"glossary/turkish/bilgi_edinme/index.html": "6adbb5f19c8aa27a",
+"glossary/turkish/bilgimizi_ozgurlestirelim_platformu/index.html": "5005ab3d935d6bd1",
+"glossary/turkish/bilime_duyulan_toplumsal_guven/index.html": "7de5514ec10a8f87",
+"glossary/turkish/bilimsel_katkı_olcutu_p_/index.html": "40705a896517b2df",
+"glossary/turkish/bizarre/index.html": "47c776f0cbf61315",
+"glossary/turkish/carking/index.html": "b2feade3431c2dfd",
+"glossary/turkish/cesitlilik/index.html": "d19223d2119f29db",
+"glossary/turkish/cift_bilinclilik/index.html": "2adf2d6c639c9c69",
+"glossary/turkish/cift_kor_hakem_degerlendirmesi/index.html": "7fc51e4b2edd1351",
+"glossary/turkish/coar_repolardaki_iyi_uygulamalar_icin_topluluk_platformu/index.html": "ac8dc6dfb8e76cc2",
+"glossary/turkish/cok_yazarlı/index.html": "dc70ad7fbbb9bc3a",
+"glossary/turkish/coklu_analist_calısmaları/index.html": "66f05bc8dac7538d",
+"glossary/turkish/coklu_evren_analizi/index.html": "29ad78e95681fe06",
+"glossary/turkish/coklu_laboratuvarlı/index.html": "8e1dbd9bbb3ae969",
+"glossary/turkish/cokluluk/index.html": "9b9a2d8195cdda7f",
+"glossary/turkish/creative_commons_cc_lisansı/index.html": "8d9a06dcfdec9877",
+"glossary/turkish/credit_katkı_rolleri_taksonomisi_/index.html": "daf5d0a00fce72e0",
+"glossary/turkish/cıkar_catısması/index.html": "5d7ae19bf608232b",
+"glossary/turkish/dekolonizasyon/index.html": "33dd25f461edd2d4",
+"glossary/turkish/dergi_etki_faktoru/index.html": "2e53bdd9d2fee114",
+"glossary/turkish/dogrudan_replikasyon/index.html": "5f814552676912a5",
+"glossary/turkish/dogrulama_yanlılıgı/index.html": "661700d360846dc2",
+"glossary/turkish/dogrulayıcı_analizler/index.html": "8bf9095c352588f2",
+"glossary/turkish/doi_dijital_nesne_tanımlayıcısı_/index.html": "f05803879d95ea53",
+"glossary/turkish/dora/index.html": "61441e19da7ba988",
+"glossary/turkish/dusmanca_is_birligi/index.html": "ecbb38346f6c78a2",
+"glossary/turkish/dusmanca_is_birlikci_yorumlama/index.html": "f5478b3102817299",
+"glossary/turkish/dusunumsellik/index.html": "2c462aa3f56c27c5",
+"glossary/turkish/duzeltme/index.html": "865271a18ee22269",
+"glossary/turkish/dıs_gecerlilik/index.html": "d7a8d10339ae1ef4",
+"glossary/turkish/ekonomik_ve_toplumsal_etki/index.html": "b63a6351d705eb33",
+"glossary/turkish/epistemik_belirsizlik/index.html": "16d4ed7be11421f2",
+"glossary/turkish/epistemoloji/index.html": "c28d4c9c26f786dc",
+"glossary/turkish/erisilebilirlik/index.html": "283f54b94be857de",
+"glossary/turkish/erken_kariyer_arastırmacıları_eka_/index.html": "19561910581ef821",
+"glossary/turkish/esdegerlik_testi/index.html": "e7b2ebe90e452871",
+"glossary/turkish/etkilesim_yanılgısı/index.html": "e0f6c522bfa4410e",
+"glossary/turkish/fair_ilkeleri/index.html": "28aa988e412fb7ba",
+"glossary/turkish/feminist_psikoloji/index.html": "af28b9e1a607eb2d",
+"glossary/turkish/forrt/index.html": "181019b925e3e181",
+"glossary/turkish/g_power/index.html": "04e938c3b36e6ece",
+"glossary/turkish/gecerlilik/index.html": "01486232c74e5ebc",
+"glossary/turkish/genel_veri_koruma_tuzugu_gdpr_/index.html": "a6c7c3b466e96b6f",
+"glossary/turkish/genellenebilirlik/index.html": "31d7e6faaa9d5db9",
+"glossary/turkish/genellige_iliskin_kısıtlamalar/index.html": "b324a57b5154b3de",
+"glossary/turkish/git/index.html": "1ae4400548842a51",
+"glossary/turkish/gizli_moderatorler/index.html": "777291f0500de423",
+"glossary/turkish/goodhart_yasası/index.html": "c8c3c5085a1ca114",
+"glossary/turkish/guvenilirlik/index.html": "79599c887771f524",
+"glossary/turkish/h_indeksi/index.html": "acd69fccc3c40b53",
+"glossary/turkish/hackathon/index.html": "32cb8710e3913ddf",
+"glossary/turkish/hakem_degerlendirmesi_seffaflıgı_girisimi_pro_girisimi_/index.html": "7569aad696301f65",
+"glossary/turkish/hakkaniyet/index.html": "90c1c69d1d769ff7",
+"glossary/turkish/harking/index.html": "70478b7bd19ac332",
+"glossary/turkish/hassas_arastırma/index.html": "a2313ec13338ab10",
+"glossary/turkish/hasta_ve_topluluk_katılımı_ppi_patient_and_public_involvement_/index.html": "ed3d6e4e358cc7fc",
+"glossary/turkish/hata_tespiti/index.html": "a9696654a38bc2e6",
+"glossary/turkish/hediye_veya_misafir_yazarlık/index.html": "2917839500b10030",
+"glossary/turkish/hesaplamalı_yeniden_uretilebilirlik/index.html": "3a75d9aea25a47f3",
+"glossary/turkish/hipotez/index.html": "269dac25f3114f51",
+"glossary/turkish/i_10_indeksi/index.html": "dd4818e2b6742d38",
+"glossary/turkish/ic_gecerlilik/index.html": "e37bc53d4170a541",
+"glossary/turkish/ic_icelik_interlocking_/index.html": "996b00bf4a386815",
+"glossary/turkish/icerik_gecerliligi/index.html": "85c3a901e979d3c2",
+"glossary/turkish/ideolojik_yanlılık/index.html": "e2e5a31eb9250f2d",
+"glossary/turkish/ilk_son_yazar_vurgusu_normu/index.html": "704328eb0c1e5160",
+"glossary/turkish/index.html": "640fd82ffc7b3d3a",
+"glossary/turkish/is_birligine_dayalı_replikasyon_ve_egitim_projesi_crep_/index.html": "e471010d4497b8d5",
+"glossary/turkish/isim_belirsizligi_sorunu/index.html": "5535b5530706736e",
+"glossary/turkish/istatistiksel_anlamlılık/index.html": "be3b4ceff71955c5",
+"glossary/turkish/istatistiksel_gecerlilik/index.html": "5e51b517c30e3e21",
+"glossary/turkish/istatistiksel_guc/index.html": "c06a1ddcb0b57578",
+"glossary/turkish/istatistiksel_varsayımlar/index.html": "dad7eac7f1ced970",
+"glossary/turkish/itibar_devrimi/index.html": "8c6c2b315c9393b7",
+"glossary/turkish/jabref/index.html": "6f07c8bbc4f47f66",
+"glossary/turkish/jamovi/index.html": "5cd885dd658ee6f8",
+"glossary/turkish/jasp/index.html": "5329cecf6a7d8631",
+"glossary/turkish/json_dosyası/index.html": "dd276a3a0e9baf76",
+"glossary/turkish/kanıt_sentezi/index.html": "21f66c8465b73b57",
+"glossary/turkish/kapsamlı_bilgi_arsivi_agı/index.html": "b19800c293446a7c",
+"glossary/turkish/kapsayıcılık/index.html": "634daba678beeace",
+"glossary/turkish/katılımlı_arastırma/index.html": "5fed5b06a41b2d82",
+"glossary/turkish/kavramsal_replikasyon/index.html": "e484fcb06f5326c5",
+"glossary/turkish/kayıtlı_rapor/index.html": "00f7bb561e00e706",
+"glossary/turkish/kesifsel_veri_analizi/index.html": "0119895c5026797e",
+"glossary/turkish/kesisimsellik/index.html": "3de070e898223b8f",
+"glossary/turkish/kitle_kaynaklı_arastırma/index.html": "8d77cc12ec71c9ed",
+"glossary/turkish/kitlesel_acık_cevrim_ici_dersler_massive_open_online_courses_moocs_/index.html": "c4719789ab39cf1b",
+"glossary/turkish/kitlesel_acık_cevrim_ici_makaleler_moops_massively_open_online_papers_/index.html": "0dce1a5f4f9b1375",
+"glossary/turkish/kod_degerlendirmesi/index.html": "09f9bef7329a6b36",
+"glossary/turkish/kod_kitabı/index.html": "a08c0adfde5064ad",
+"glossary/turkish/kompendiyum/index.html": "075f11e987bad6f2",
+"glossary/turkish/komunalite/index.html": "231bb18144caf61c",
+"glossary/turkish/konsorsiyum_yazarlıgı/index.html": "bcd236c38b5379d4",
+"glossary/turkish/konumsallık/index.html": "91236dc8fc40963c",
+"glossary/turkish/konumsallık_haritası/index.html": "45e2b7d7af7d4a9b",
+"glossary/turkish/kriter_gecerliligi/index.html": "1dd9998027f33a35",
+"glossary/turkish/kulturel_vergilendirme/index.html": "b77e0903fb3aa123",
+"glossary/turkish/kumulatif_bilim/index.html": "51be2d43797662c0",
+"glossary/turkish/kızıl_ekipler/index.html": "8ef11ecedfb4097e",
+"glossary/turkish/literatur_taraması/index.html": "df66394acead41a8",
+"glossary/turkish/makale_fabrikası/index.html": "d11c918b85b7b1a9",
+"glossary/turkish/makale_islem_ucreti_apc_/index.html": "1a54e3de117571b6",
+"glossary/turkish/manel/index.html": "e34731abfa86605a",
+"glossary/turkish/matthew_etkisi_bilimde_/index.html": "d463a169e8291eaf",
+"glossary/turkish/meta_analiz/index.html": "b656c7b48c1b1d24",
+"glossary/turkish/meta_bilim_ya_da_meta_arastırma/index.html": "44b1025fcc833636",
+"glossary/turkish/metaveri/index.html": "ac85a711b082d5f3",
+"glossary/turkish/model_felsefe_/index.html": "ad5057e3270e219c",
+"glossary/turkish/mudahalesiz_yeniden_uretilebilir_ve_acık_sistematik_derlemeler_niro_sr_non_intervention_reproducible_and_open_systematic_reviews_/index.html": "764f5e40dfd919e5",
+"glossary/turkish/nesnellik/index.html": "1d8e0fcbb1ef3479",
+"glossary/turkish/nicel_arastırma/index.html": "e1465fb2691feb52",
+"glossary/turkish/nitel_arastırma/index.html": "7d72a057f9dbea6f",
+"glossary/turkish/odeme_duvarı_paywall_/index.html": "016a564cc5753b32",
+"glossary/turkish/ogrenmede_evrensel_tasarım_oet_/index.html": "e29612b941a2992e",
+"glossary/turkish/olasılık_fonksiyonu/index.html": "e7fd80c3e62d9284",
+"glossary/turkish/olasılık_ilkesi/index.html": "c7765139594b266a",
+"glossary/turkish/on_baskı/index.html": "71409cc86d42e990",
+"glossary/turkish/on_baskı_tabanlı_dergi/index.html": "794a276643aeeaea",
+"glossary/turkish/on_kayıt/index.html": "56993818829c1c2e",
+"glossary/turkish/on_kayıt_taahhudu/index.html": "6712819c26a2b351",
+"glossary/turkish/onceligi_kapma/index.html": "040e7391d449e496",
+"glossary/turkish/onsel_dagılım/index.html": "65f7e48072100b19",
+"glossary/turkish/ontoloji_yapay_zeka_/index.html": "2677ae508d676d74",
+"glossary/turkish/openneuro/index.html": "9a3c122f536bef53",
+"glossary/turkish/opsiyonel_durdurma/index.html": "b4b0af82fc2ff648",
+"glossary/turkish/ortak_uretim/index.html": "f48cf4237bd139de",
+"glossary/turkish/ozet_yanlılıgı/index.html": "aa7087561f97cb4e",
+"glossary/turkish/p_degeri/index.html": "a6fbe0748de5ff0b",
+"glossary/turkish/p_egrisi/index.html": "c7781e51dda4f374",
+"glossary/turkish/p_hackleme/index.html": "042405d430bfb713",
+"glossary/turkish/paradata/index.html": "1b3521032d322a77",
+"glossary/turkish/paranteze_alma_epoche_gorusmeleri/index.html": "54fa42454230a62f",
+"glossary/turkish/parking/index.html": "0438d0fa4cc99a8b",
+"glossary/turkish/pci_kayıtlı_raporlar/index.html": "2fd788f501a57413",
+"glossary/turkish/plan_s/index.html": "ff92f54cf03f2111",
+"glossary/turkish/post_hoc/index.html": "1353743e8ca7e740",
+"glossary/turkish/prepare_rehberi/index.html": "fa6e1f8acad8931c",
+"glossary/turkish/psikoloji_biliminin_gelistirilmesi_dernegi/index.html": "0b82d3e15095aa14",
+"glossary/turkish/psikometrik_meta_analiz/index.html": "b601cd99b953e879",
+"glossary/turkish/psodonimlestirme/index.html": "74fc76c75c8a9fdc",
+"glossary/turkish/psodoreplikasyon/index.html": "892edc9dd02fd3a3",
+"glossary/turkish/pubpeer/index.html": "6f955b82e7761b56",
+"glossary/turkish/python/index.html": "41b187b6795bce4c",
+"glossary/turkish/r/index.html": "4d5ed5ba636deeb1",
+"glossary/turkish/raporlama_kılavuzu/index.html": "9f91944ffb379129",
+"glossary/turkish/replikasyonda_yaratıcı_yıkım_yaklasımı/index.html": "ceea3ce7949c84ad",
+"glossary/turkish/repo/index.html": "c8817fe0ecdbaaff",
+"glossary/turkish/reproducibilitea/index.html": "1f09338cf4c003d1",
+"glossary/turkish/riot_bilim_kulubu/index.html": "721c514e6824761d",
+"glossary/turkish/rozetler_acık_bilim_/index.html": "703767ebc2cf6c36",
+"glossary/turkish/saglamlık_analizleri_/index.html": "856599279baeea9f",
+"glossary/turkish/seffaflık/index.html": "a35e5bef9d37a502",
+"glossary/turkish/seffaflık_kontrol_listesi/index.html": "b0100675145f9f2c",
+"glossary/turkish/semantometriler/index.html": "b5cdfda5ff761de1",
+"glossary/turkish/sistematik_derleme/index.html": "e5eab54178c9c103",
+"glossary/turkish/sistemi_oyuna_getirme/index.html": "f198ab366fc01555",
+"glossary/turkish/sonsal_dagılım/index.html": "e01e3cf927cb1904",
+"glossary/turkish/sorumlu_arastırma_ve_inovasyon/index.html": "7c15e3720091b9be",
+"glossary/turkish/sosyal_entegrasyon/index.html": "0757f82beaa304f1",
+"glossary/turkish/sosyal_sınıf/index.html": "e4e0290284a61053",
+"glossary/turkish/spesifikasyon_egrisi_analizi/index.html": "a1719a07a316954d",
+"glossary/turkish/strange/index.html": "91801a08f9bbdf51",
+"glossary/turkish/studyswap/index.html": "f9d2a62abf531418",
+"glossary/turkish/supheli_arastırma_uygulamaları_veya_supheli_raporlama_uygulamaları/index.html": "64ff21e1b739559e",
+"glossary/turkish/supheli_olcme_uygulamaları/index.html": "f4e846153a0d8e8b",
+"glossary/turkish/sıfır_hipotez_anlamlılık_testi_nhst_null_hypothesis_significance_testing_/index.html": "7bb129d64a1512c2",
+"glossary/turkish/sınırlandırma_olcutu/index.html": "6b5624e5536ed4be",
+"glossary/turkish/tek_kor_hakemlik/index.html": "3f6518c6bbd2d75e",
+"glossary/turkish/tekrarlanabilirlik/index.html": "ad70e99823172e9c",
+"glossary/turkish/tenzing/index.html": "f7a8cce745bcb201",
+"glossary/turkish/teori/index.html": "3e65c423e88813d8",
+"glossary/turkish/teori_insası/index.html": "980f014378616275",
+"glossary/turkish/tersine_p_hackleme/index.html": "b1e3d769d5f3c30b",
+"glossary/turkish/tesvik_yapısı/index.html": "115dea8149f00676",
+"glossary/turkish/tip_i_hata/index.html": "27b221e0c7624a99",
+"glossary/turkish/tip_ii_hata/index.html": "0e2f167ee198f3e1",
+"glossary/turkish/tip_m_hata/index.html": "5c1cc9f5803187e9",
+"glossary/turkish/tip_s_hata/index.html": "3a8ff5a5e26ca624",
+"glossary/turkish/topluluk_projeleri/index.html": "b0fc7f12535edba3",
+"glossary/turkish/trust_ilkeleri/index.html": "582849cb19865b8f",
+"glossary/turkish/tumevarım/index.html": "1bae5138712115ce",
+"glossary/turkish/uclu_kor_hakemlik/index.html": "27cd2b1a84335f09",
+"glossary/turkish/veri_analizi_ve_paylasımında_en_iyi_uygulamalar_komitesi/index.html": "a7a3eec1f82b5802",
+"glossary/turkish/veri_dilimleme/index.html": "62858ad50cab4b36",
+"glossary/turkish/veri_gorsellestirme/index.html": "4dca7fd962617b65",
+"glossary/turkish/veri_paylasımı/index.html": "8a03776d80b52a39",
+"glossary/turkish/veri_yonetim_planı_dmp_/index.html": "fb8b592e4a51f2ae",
+"glossary/turkish/veriye_erisim_ve_arastırma_seffaflıgı_da_rt_/index.html": "1ef92f27d8ec9e91",
+"glossary/turkish/versiyon_kontrolu/index.html": "53218f04306dd4d5",
+"glossary/turkish/webometriler/index.html": "82f82a98b3242f3d",
+"glossary/turkish/yagmacı_yayın/index.html": "c900ce42f4d2bf1d",
+"glossary/turkish/yapı_gecerliligi/index.html": "77588fb73de43017",
+"glossary/turkish/yardımcı_hipotez/index.html": "c0ef61442c01ee0b",
+"glossary/turkish/yavas_bilim/index.html": "9257e2269b37e527",
+"glossary/turkish/yayımla_ya_da_yok_ol/index.html": "cd13d8fe7b174f84",
+"glossary/turkish/yayın_sonrası_hakem_degerlendirmesi/index.html": "ff5e0c8392e64953",
+"glossary/turkish/yayın_yanlılıgı_dosya_cekmecesi_problemi_/index.html": "0b4951a2ae70c6bf",
+"glossary/turkish/yazar_sırası_krediyi_belirler_yaklasımı/index.html": "2947d30bc50722fc",
+"glossary/turkish/yazarlık/index.html": "d83cd526bd181e60",
+"glossary/turkish/yeniden_uretilebilirlik/index.html": "b9c13c57e3511c21",
+"glossary/turkish/yeniden_uretilebilirlik_agı/index.html": "0b9562fdccdf858b",
+"glossary/turkish/yeniden_uretilebilirlik_krizi_diger_adıyla_tekrarlanabilirlik_veya_tekrarlama_krizi_/index.html": "64add4f176573b3c",
+"glossary/turkish/yetersiz_temsil/index.html": "c8c516935f799a48",
+"glossary/turkish/yinelenebilirlik/index.html": "d6c13e50f4613f1a",
+"glossary/turkish/yolları_catallanan_bahce/index.html": "d04d0a127e4b4306",
+"glossary/turkish/yurttas_bilimi/index.html": "18d04526476cc3c0",
+"glossary/turkish/yuzey_gecerliligi/index.html": "950d28b982a807f1",
+"glossary/turkish/z_egrisi/index.html": "fc35e565ffccaef6",
+"glossary/turkish/zenodo/index.html": "3c5fa7f92c9e8fdb",
+"impact/index.html": "b7da4f778b02d48f",
+"imprint/index.html": "69ad60d879e5fd9e",
+"index.html": "3f2dae956d000c38",
+"just_os_chatbot/index.html": "e3063feec9aea6a7",
+"lesson-plans/index.html": "2f3e8a00a464a9d2",
+"manuscript/index.html": "ad64d01027dc9023",
+"mapping_os/index.html": "d35842e8cdea02cf",
+"neurodiversity-lessonbank/community-psychology-diversity/index.html": "41fdee0f24d5061c",
+"neurodiversity-lessonbank/diversity-and-research/index.html": "da374ec4640ecd92",
+"neurodiversity-lessonbank/generalizability/index.html": "4a5a79001daba78d",
+"neurodiversity-lessonbank/implicit_bias/index.html": "6c90ab96fa335213",
+"neurodiversity-lessonbank/index.html": "5e98d30074bff28a",
+"neurodiversity-lessonbank/masterstools/index.html": "941b128295105a2e",
+"neurodiversity/index.html": "041435d50d6b90ca",
+"newsletters/index.html": "e2c4b4820c9aab9c",
+"nexus/index.html": "012dff646ed58412",
+"nowherelab/index.html": "a6b0e01365d40258",
+"nowherelab/phd-survival-guide/index.html": "dfa2407b605d9b54",
+"os-developing-world/index.html": "7fdb23cd0920bf9a",
+"pedagogies/001-julia-strand/index.html": "c72ea53ac06e0bf6",
+"pedagogies/002-gilad-feldman/index.html": "db8acf20ea09201f",
+"pedagogies/003-crep/index.html": "1d1a4bf0c4893d51",
+"pedagogies/004-thomas-rhys-evans/index.html": "dff5fbde0534178c",
+"pedagogies/index.html": "1409cbcb441e9294",
+"positive-changes-replication-crisis/index.html": "2122a35abb6c0e63",
+"post/2026-01-newsletter/index.html": "3f3f718847a3d5f0",
+"post/2026-02-newsletter/index.html": "2173b8f220f5e675",
+"post/2026-03-newsletter/index.html": "d01aee7a11204144",
+"post/2026-04-newsletter/index.html": "13664a5fb7acb8cb",
+"post/2026-05-chinese-glossary/index.html": "6bac5c68bea864fa",
+"post/2026-05-get-involved-page/index.html": "e9fcd30314fc3078",
+"post/2026-05-just-os-chatbot/index.html": "6c70e0b2e71c0d01",
+"post/2026-05-newsletter/index.html": "fb8681280adbea18",
+"post/2026-05-nowhere-lab/index.html": "84ac23f626ec11cd",
+"post/2026-06-ai-metascience-call/index.html": "a11097b1caf8e72a",
+"post/2026-06-peer-community-in-partner/index.html": "0be1aa33828ce714",
+"post/2026-10-ai-in-metascience-recordings/index.html": "8cc3fe5a82b45430",
+"post/2026-10-nwo-award/index.html": "e063481d3323e438",
+"post/2026-10-presentations/index.html": "5c7d526892056f23",
+"post/2026-9-registrations-are-now-open-for-the-ai-in-metascience-online-conference/index.html": "4d98910dbe203274",
+"post/index.html": "2f9f0ca6d4313464",
+"publication_types/index.html": "5a914759bec160ed",
+"publications/index.html": "263abea643c11ea5",
+"replication-hub/flora/index.html": "bb5ec9f3c65c24f0",
+"replication-hub/index.html": "f02f497bf9f788ab",
+"replication-hub/large-scale-replication-projects/index.html": "cd91d760961eb5dd",
+"replication-hub/submit/index.html": "8edd65f9c9180b5a",
+"resources/index.html": "6d770174e5fe488c",
+"reversals/index.html": "2c20efa9d9ac0bef",
+"summaries/diversity-equity-inclusion/index.html": "638b46ad87c2a3ed",
+"summaries/index.html": "d03b046ec3e9e99c",
+"summaries/open-reproducible/index.html": "102e8381e1555c2f",
+"syllabus/index.html": "db3fd2afa5f81db9",
+"tags/index.html": "bac9d6ce365e1673",
+"teaching_os/index.html": "1637996b0e7bfdca",
+"testimonials/index.html": "0f28cce288ba4c19",
+"welcome/index.html": "3b13cc9f5af941e0"
+}
diff --git a/scripts/rebrand/baseline/structured_data.json b/scripts/rebrand/baseline/structured_data.json
new file mode 100644
index 00000000000..f632f49d3d9
--- /dev/null
+++ b/scripts/rebrand/baseline/structured_data.json
@@ -0,0 +1,75 @@
+{
+ "404": {
+  "BreadcrumbList": 1,
+  "pages": 1
+ },
+ "article": {
+  "Article": 24,
+  "BlogPosting": 15,
+  "BreadcrumbList": 44,
+  "pages": 44
+ },
+ "author profile": {
+  "BreadcrumbList": 119,
+  "CollectionPage": 119,
+  "Person": 58,
+  "pages": 119
+ },
+ "clusters and disciplines": {
+  "BreadcrumbList": 12,
+  "CollectionPage": 2,
+  "ItemList": 2,
+  "WebPage": 13,
+  "pages": 13
+ },
+ "generated list": {
+  "BreadcrumbList": 391,
+  "CollectionPage": 391,
+  "pages": 391
+ },
+ "glossary list": {
+  "BreadcrumbList": 5,
+  "CollectionPage": 5,
+  "pages": 5
+ },
+ "glossary term": {
+  "BreadcrumbList": 1295,
+  "DefinedTerm": 1294,
+  "pages": 1295
+ },
+ "home": {
+  "EducationalOrganization": 1,
+  "WebSite": 1,
+  "pages": 1
+ },
+ "news and section list": {
+  "BreadcrumbList": 5,
+  "CollectionPage": 4,
+  "pages": 5
+ },
+ "redirect stub": {
+  "pages": 1988
+ },
+ "resource detail": {
+  "BreadcrumbList": 1485,
+  "pages": 1485
+ },
+ "section or plain page": {
+  "BreadcrumbList": 53,
+  "CollectionPage": 7,
+  "pages": 56
+ },
+ "standalone": {
+  "pages": 10
+ },
+ "summaries": {
+  "BreadcrumbList": 3,
+  "CollectionPage": 3,
+  "pages": 3
+ },
+ "tags browser": {
+  "BreadcrumbList": 1,
+  "CollectionPage": 1,
+  "pages": 1
+ }
+}
diff --git a/scripts/rebrand/baseline/weights.json b/scripts/rebrand/baseline/weights.json
new file mode 100644
index 00000000000..6d21306dc28
--- /dev/null
+++ b/scripts/rebrand/baseline/weights.json
@@ -0,0 +1,1517 @@
+{
+ "home": {
+  "requests": 83,
+  "own_kb": 645,
+  "third_party_kb": 2399,
+  "by_kind_kb": {
+   "document": 122,
+   "font": 465,
+   "image": 596,
+   "other": 1,
+   "script": 1694,
+   "stylesheet": 166
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "eocampaign1.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "forrt.org",
+   "gallery.eo.page",
+   "googleads.g.doubleclick.net",
+   "i.ytimg.com",
+   "jnn-pa.googleapis.com",
+   "licensebuttons.net",
+   "static.doubleclick.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.google.com",
+   "www.googletagmanager.com",
+   "www.gstatic.com",
+   "www.youtube.com"
+  ],
+  "dom_elements": 765,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709298092&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1014837732.1793709299"
+  ],
+  "url": "/",
+  "overflow_px": {
+   "390": 15,
+   "1024": 15,
+   "1440": 15
+  }
+ },
+ "replication hub": {
+  "requests": 32,
+  "own_kb": 270,
+  "third_party_kb": 662,
+  "by_kind_kb": {
+   "document": 10,
+   "font": 345,
+   "image": 187,
+   "other": 1,
+   "script": 322,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 395,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709313212&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1150893721.1793709314"
+  ],
+  "url": "/replication-hub/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "resources directory": {
+  "requests": 73,
+  "own_kb": 998,
+  "third_party_kb": 1642,
+  "by_kind_kb": {
+   "document": 869,
+   "font": 557,
+   "image": 123,
+   "other": 286,
+   "script": 569,
+   "stylesheet": 236
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "docs.google.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "play.google.com",
+   "ssl.gstatic.com",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com",
+   "www.gstatic.com"
+  ],
+  "dom_elements": 28680,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709326776&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=417965014.1793709328&"
+  ],
+  "url": "/resources/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "article (post)": {
+  "requests": 34,
+  "own_kb": 581,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 10,
+   "font": 394,
+   "image": 461,
+   "other": 1,
+   "script": 322,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 361,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709348452&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1992875460.1793709349"
+  ],
+  "url": "/post/2026-01-newsletter/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "article (educators' corner)": {
+  "requests": 37,
+  "own_kb": 1528,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 13,
+   "font": 393,
+   "image": 1404,
+   "other": 1,
+   "script": 323,
+   "stylesheet": 66
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 394,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709359453&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1129181014.1793709360"
+  ],
+  "url": "/educators-corner/001-representation-heatherurry/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "article (pedagogies)": {
+  "requests": 65,
+  "own_kb": 223,
+  "third_party_kb": 1944,
+  "by_kind_kb": {
+   "document": 160,
+   "font": 390,
+   "image": 186,
+   "other": 2,
+   "script": 1299,
+   "stylesheet": 130
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "googleads.g.doubleclick.net",
+   "i.ytimg.com",
+   "jnn-pa.googleapis.com",
+   "licensebuttons.net",
+   "static.doubleclick.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.google.com",
+   "www.googletagmanager.com",
+   "www.gstatic.com",
+   "www.youtube.com",
+   "yt3.ggpht.com"
+  ],
+  "dom_elements": 458,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709373318&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1310391736.1793709374"
+  ],
+  "url": "/pedagogies/001-julia-strand/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "section page (about)": {
+  "requests": 79,
+  "own_kb": 182,
+  "third_party_kb": 2896,
+  "by_kind_kb": {
+   "document": 190,
+   "font": 427,
+   "image": 172,
+   "other": 2,
+   "script": 2121,
+   "stylesheet": 166
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "eocampaign1.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "gallery.eo.page",
+   "googleads.g.doubleclick.net",
+   "i.ytimg.com",
+   "jnn-pa.googleapis.com",
+   "licensebuttons.net",
+   "static.doubleclick.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.google.com",
+   "www.googletagmanager.com",
+   "www.gstatic.com",
+   "www.youtube.com",
+   "yt3.ggpht.com"
+  ],
+  "dom_elements": 483,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709392478&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1384261774.1793709399"
+  ],
+  "url": "/about/us/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "section page (get involved)": {
+  "requests": 70,
+  "own_kb": 182,
+  "third_party_kb": 1847,
+  "by_kind_kb": {
+   "document": 60,
+   "font": 482,
+   "image": 102,
+   "other": 5,
+   "script": 1231,
+   "stylesheet": 148
+  },
+  "hosts": [
+   "(this site)",
+   "apis.google.com",
+   "calendar.google.com",
+   "cdnjs.cloudflare.com",
+   "clients6.google.com",
+   "eocampaign1.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "gallery.eo.page",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.google.com",
+   "www.googletagmanager.com",
+   "www.gstatic.com"
+  ],
+  "dom_elements": 558,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709419053&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=146193196.1793709427&"
+  ],
+  "url": "/about/get-involved/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "section page (awop)": {
+  "requests": 33,
+  "own_kb": 276,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 12,
+   "font": 355,
+   "image": 192,
+   "other": 1,
+   "script": 322,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 393,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709443170&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=605763641.1793709443&"
+  ],
+  "url": "/awop/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "section page (reversals)": {
+  "requests": 32,
+  "own_kb": 405,
+  "third_party_kb": 689,
+  "by_kind_kb": {
+   "document": 235,
+   "font": 371,
+   "image": 97,
+   "other": 1,
+   "script": 324,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 13553,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709455895&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=728305254.1793709456&"
+  ],
+  "url": "/reversals/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "section page (publications)": {
+  "requests": 100,
+  "own_kb": 210,
+  "third_party_kb": 2573,
+  "by_kind_kb": {
+   "document": 54,
+   "font": 427,
+   "image": 1430,
+   "other": 1,
+   "script": 767,
+   "stylesheet": 105
+  },
+  "hosts": [
+   "(this site)",
+   "api.altmetric.com",
+   "badges.altmetric.com",
+   "cdnjs.cloudflare.com",
+   "d1bxh8uas1mnw7.cloudfront.net",
+   "embed.altmetric.com",
+   "eocampaign1.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "gallery.eo.page",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.google.com",
+   "www.googletagmanager.com",
+   "www.gstatic.com"
+  ],
+  "dom_elements": 1472,
+  "js_errors": [],
+  "failed_requests": [
+   "https://api.altmetric.com/v1/internal-556fdf0f/doi/10.17879/replicationresearch-2025-9022?callback=_altmetric.embed_callback&domain=127.0.0.1&cache_until=12-3",
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709470444&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1537986060.1793709471",
+   "https://api.altmetric.com/v1/internal-556fdf0f/doi/10.31234/osf.io/c4jqr_v1?callback=_altmetric.embed_callback&domain=127.0.0.1&cache_until=12-3"
+  ],
+  "url": "/publications/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "section page (contributors)": {
+  "requests": 33,
+  "own_kb": 222,
+  "third_party_kb": 688,
+  "by_kind_kb": {
+   "document": 51,
+   "font": 370,
+   "image": 97,
+   "other": 1,
+   "script": 325,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 8707,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709505256&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1391968329.1793709509"
+  ],
+  "url": "/contributors/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "section page (lesson plans)": {
+  "requests": 85,
+  "own_kb": 182,
+  "third_party_kb": 1668,
+  "by_kind_kb": {
+   "document": 111,
+   "font": 521,
+   "image": 123,
+   "other": 284,
+   "script": 574,
+   "stylesheet": 237
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "docs.google.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "play.google.com",
+   "ssl.gstatic.com",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com",
+   "www.gstatic.com"
+  ],
+  "dom_elements": 413,
+  "js_errors": [
+   "DOCS_timing is not defined",
+   "DOCS_timing is not defined"
+  ],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709520683&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1297544943.1793709521",
+   "filesystem:https://docs.google.com/persistent/docs/fonts/HTxxL3A_ID2an4clN7OG5Om-denKlH3T2lv0tKk.woff2",
+   "filesystem:https://docs.google.com/persistent/docs/fonts/HTxzL3A_ID2an4clN7OG5Om-denKlH3j3VHzlqsLag.woff2",
+   "filesystem:https://docs.google.com/persistent/docs/fonts/HTxyL3A_ID2an4clN7OG5Om-denKlH3rY3TWuYMBYro.woff2",
+   "filesystem:https://docs.google.com/persistent/docs/fonts/HTx8L3A_ID2an4clN7OG5Om-denKlH3j3WlKuYkGQLhExw.woff2",
+   "filesystem:https://docs.google.com/persistent/docs/fonts/HTxxL3A_ID2an4clN7OG5Om-denKlH3T2lv0tKk.woff2",
+   "filesystem:https://docs.google.com/persistent/docs/fonts/HTxzL3A_ID2an4clN7OG5Om-denKlH3j3VHzlqsLag.woff2",
+   "filesystem:https://docs.google.com/persistent/docs/fonts/HTxyL3A_ID2an4clN7OG5Om-denKlH3rY3TWuYMBYro.woff2",
+   "filesystem:https://docs.google.com/persistent/docs/fonts/HTx8L3A_ID2an4clN7OG5Om-denKlH3j3WlKuYkGQLhExw.woff2",
+   "filesystem:https://docs.google.com/persistent/docs/fonts/HTxxL3A_ID2an4clN7OG5Om-denKlH3T2lv0tKk.woff2",
+   "filesystem:https://docs.google.com/persistent/docs/fonts/HTxzL3A_ID2an4clN7OG5Om-denKlH3j3VHzlqsLag.woff2",
+   "filesystem:https://docs.google.com/persistent/docs/fonts/HTxyL3A_ID2an4clN7OG5Om-denKlH3rY3TWuYMBYro.woff2",
+   "filesystem:https://docs.google.com/persistent/docs/fonts/HTx8L3A_ID2an4clN7OG5Om-denKlH3j3WlKuYkGQLhExw.woff2"
+  ],
+  "url": "/lesson-plans/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "resource detail": {
+  "requests": 31,
+  "own_kb": 179,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 9,
+   "font": 355,
+   "image": 97,
+   "other": 1,
+   "script": 323,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 346,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709541662&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1260537850.1793709542"
+  ],
+  "url": "/curated_resources/milgram-obedience-experiment-an-agent-ba/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "glossary term (english)": {
+  "requests": 32,
+  "own_kb": 188,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 17,
+   "font": 356,
+   "image": 97,
+   "other": 1,
+   "script": 324,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 905,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709553678&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=701992881.1793709554&"
+  ],
+  "url": "/glossary/english/abstract_bias/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "glossary term (arabic)": {
+  "requests": 32,
+  "own_kb": 171,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "font": 356,
+   "image": 97,
+   "other": 1,
+   "script": 324,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 916,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709568359&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=153403985.1793709569&"
+  ],
+  "url": "/glossary/arabic/aka_replicability_or_replication_crisis_ازمة_اعادة_الانتاج_او_ازمة_الت_كرار/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "glossary term (chinese)": {
+  "requests": 32,
+  "own_kb": 171,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "font": 356,
+   "image": 97,
+   "other": 1,
+   "script": 324,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 920,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709579145&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1715932582.1793709580"
+  ],
+  "url": "/glossary/chinese/_兄弟_式开放科学/",
+  "overflow_px": {
+   "390": 91,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "glossary references": {
+  "requests": 33,
+  "own_kb": 238,
+  "third_party_kb": 688,
+  "by_kind_kb": {
+   "document": 67,
+   "font": 371,
+   "image": 97,
+   "other": 1,
+   "script": 324,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 2770,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709593583&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=543207468.1793709594&"
+  ],
+  "url": "/glossary/references/",
+  "overflow_px": {
+   "390": 561,
+   "1024": 347,
+   "1440": 259
+  }
+ },
+ "glossary hub": {
+  "requests": 33,
+  "own_kb": 0,
+  "third_party_kb": 882,
+  "by_kind_kb": {
+   "document": 23,
+   "font": 356,
+   "image": 111,
+   "other": 1,
+   "script": 323,
+   "stylesheet": 69
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "forrt.org",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 1037,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1h1v884251387za208zd884251387xf1&_p=1793709608550&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=922953646.179370961"
+  ],
+  "url": "/glossary/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "glossary language index": {
+  "requests": 32,
+  "own_kb": 192,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 22,
+   "font": 356,
+   "image": 97,
+   "other": 1,
+   "script": 323,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 1037,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709616847&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=856268944.1793709617&"
+  ],
+  "url": "/glossary/english/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "clusters": {
+  "requests": 35,
+  "own_kb": 1997,
+  "third_party_kb": 689,
+  "by_kind_kb": {
+   "document": 859,
+   "font": 371,
+   "image": 1049,
+   "other": 1,
+   "script": 341,
+   "stylesheet": 66
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 24468,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709630122&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1646586897.1793709631"
+  ],
+  "url": "/clusters/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "cluster": {
+  "requests": 33,
+  "own_kb": 813,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 627,
+   "font": 356,
+   "image": 97,
+   "other": 1,
+   "script": 339,
+   "stylesheet": 66
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 3644,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709649274&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=997157047.1793709650&"
+  ],
+  "url": "/clusters/cluster-1/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "disciplines": {
+  "requests": 35,
+  "own_kb": 285,
+  "third_party_kb": 688,
+  "by_kind_kb": {
+   "document": 73,
+   "font": 371,
+   "image": 132,
+   "other": 1,
+   "script": 330,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 3438,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709660259&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=922727536.1793709661&"
+  ],
+  "url": "/disciplines/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "author profile": {
+  "requests": 32,
+  "own_kb": 211,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 9,
+   "font": 356,
+   "image": 129,
+   "other": 1,
+   "script": 322,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 321,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709673269&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=575956464.1793709674&"
+  ],
+  "url": "/authors/lukas-wallrich/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "generated list (cluster)": {
+  "requests": 31,
+  "own_kb": 181,
+  "third_party_kb": 672,
+  "by_kind_kb": {
+   "document": 11,
+   "font": 355,
+   "image": 97,
+   "other": 1,
+   "script": 322,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 350,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6b20h2v884251387za208zd884251387xf1&_p=1793709684488&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=593249187.179370968"
+  ],
+  "url": "/forrt_clusters/academic-life-and-culture/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "generated list (category)": {
+  "requests": 31,
+  "own_kb": 178,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 9,
+   "font": 356,
+   "image": 97,
+   "other": 1,
+   "script": 322,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 310,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709695567&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1262554380.1793709696"
+  ],
+  "url": "/category/event/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "tags browser": {
+  "requests": 32,
+  "own_kb": 203,
+  "third_party_kb": 662,
+  "by_kind_kb": {
+   "document": 32,
+   "font": 345,
+   "image": 97,
+   "other": 1,
+   "script": 324,
+   "stylesheet": 66
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 3720,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709708451&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1663520011.1793709711"
+  ],
+  "url": "/tags/",
+  "overflow_px": {
+   "390": 20,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "news list": {
+  "requests": 46,
+  "own_kb": 2529,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 12,
+   "font": 356,
+   "image": 2444,
+   "other": 1,
+   "script": 322,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 543,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709738502&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=751672424.1793709739&"
+  ],
+  "url": "/post/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "educators' corner list": {
+  "requests": 41,
+  "own_kb": 260,
+  "third_party_kb": 688,
+  "by_kind_kb": {
+   "document": 11,
+   "font": 371,
+   "image": 176,
+   "other": 1,
+   "script": 323,
+   "stylesheet": 66
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 460,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709757761&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=435400156.1793709758&"
+  ],
+  "url": "/educators-corner/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "nowhere lab list": {
+  "requests": 43,
+  "own_kb": 210,
+  "third_party_kb": 2456,
+  "by_kind_kb": {
+   "document": 10,
+   "font": 405,
+   "image": 127,
+   "other": 1334,
+   "script": 721,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "datawrapper.dwcdn.net",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "pt.dwcdn.net",
+   "static.dwcdn.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 352,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6b20h2v884251387za208zd884251387xf1&_p=1793709781398&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1891834113.17937097"
+  ],
+  "url": "/nowherelab/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "newsletters": {
+  "requests": 47,
+  "own_kb": 180,
+  "third_party_kb": 1211,
+  "by_kind_kb": {
+   "document": 42,
+   "font": 427,
+   "image": 101,
+   "other": 1,
+   "script": 718,
+   "stylesheet": 103
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "eocampaign1.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "gallery.eo.page",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.google.com",
+   "www.googletagmanager.com",
+   "www.gstatic.com"
+  ],
+  "dom_elements": 584,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1h1v884251387za208zd884251387xf1&_p=1793709795851&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=332661745.179370979",
+   "https://csp.withgoogle.com/csp/frame-ancestors/38fac9d5b82543fc4729580d18ff2d3d"
+  ],
+  "url": "/newsletters/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "summaries": {
+  "requests": 32,
+  "own_kb": 180,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 11,
+   "font": 355,
+   "image": 95,
+   "other": 1,
+   "script": 325,
+   "stylesheet": 66
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 351,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709809081&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1543310683.1793709810"
+  ],
+  "url": "/summaries/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "summary": {
+  "requests": 33,
+  "own_kb": 235,
+  "third_party_kb": 675,
+  "by_kind_kb": {
+   "document": 65,
+   "font": 356,
+   "image": 97,
+   "other": 1,
+   "script": 325,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 1940,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1h1v884251387za208zd884251387xf1&_p=1793709819853&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=2134146524.17937098"
+  ],
+  "url": "/summaries/diversity-equity-inclusion/",
+  "overflow_px": {
+   "390": 137,
+   "1024": 0,
+   "1440": 83
+  }
+ },
+ "one-off (ai metascience)": {
+  "requests": 32,
+  "own_kb": 259,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 41,
+   "font": 356,
+   "image": 146,
+   "other": 1,
+   "script": 322,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 812,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709834090&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=576200269.1793709835&"
+  ],
+  "url": "/ai-metascience/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "one-off (citation politics)": {
+  "requests": 46,
+  "own_kb": 182,
+  "third_party_kb": 1938,
+  "by_kind_kb": {
+   "document": 85,
+   "font": 390,
+   "image": 214,
+   "other": 1,
+   "script": 1299,
+   "stylesheet": 130
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "googleads.g.doubleclick.net",
+   "i.ytimg.com",
+   "jnn-pa.googleapis.com",
+   "licensebuttons.net",
+   "static.doubleclick.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.google.com",
+   "www.googletagmanager.com",
+   "www.youtube.com"
+  ],
+  "dom_elements": 391,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6b20h2v884251387za208zd884251387xf1&_p=1793709847477&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1482937318.17937098"
+  ],
+  "url": "/citation-politics/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "one-off (contributor analysis)": {
+  "requests": 47,
+  "own_kb": 917,
+  "third_party_kb": 983,
+  "by_kind_kb": {
+   "document": 578,
+   "font": 355,
+   "image": 266,
+   "other": 1,
+   "script": 633,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "mathjax.rstudio.com",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 315,
+  "js_errors": [
+   "network.on is not a function"
+  ],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709863738&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=805714847.1793709865&"
+  ],
+  "url": "/contributor-analysis/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 6,
+   "1440": 0
+  }
+ },
+ "one-off (community map)": {
+  "requests": 57,
+  "own_kb": 986,
+  "third_party_kb": 760,
+  "by_kind_kb": {
+   "document": 816,
+   "font": 356,
+   "image": 185,
+   "other": 1,
+   "script": 322,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "server.arcgisonline.com",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 308,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709881826&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1092187220.1793709882"
+  ],
+  "url": "/community-map/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "one-off (welcome)": {
+  "requests": 34,
+  "own_kb": 182,
+  "third_party_kb": 762,
+  "by_kind_kb": {
+   "document": 10,
+   "font": 429,
+   "image": 97,
+   "other": 1,
+   "script": 322,
+   "stylesheet": 85
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 492,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709895531&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=652888883.1793709896&"
+  ],
+  "url": "/welcome/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "games": {
+  "requests": 31,
+  "own_kb": 179,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 10,
+   "font": 356,
+   "image": 97,
+   "other": 1,
+   "script": 322,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 322,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709911383&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1466791634.1793709912"
+  ],
+  "url": "/games/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "booklet": {
+  "requests": 50,
+  "own_kb": 3560,
+  "third_party_kb": 676,
+  "by_kind_kb": {
+   "document": 10,
+   "font": 355,
+   "image": 99,
+   "other": 3070,
+   "script": 627,
+   "stylesheet": 75
+  },
+  "hosts": [
+   "(this site)",
+   "cdn.jsdelivr.net",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 375,
+  "js_errors": [],
+  "failed_requests": [
+   "404 http://127.0.0.1:62822/lib/dflip/css/custom.css",
+   "http://127.0.0.1:62822/lib/dflip/css/custom.css",
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1h1v884251387za208zd884251387xf1&_p=1793709925882&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1964004640.17937099"
+  ],
+  "url": "/booklet/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "chatbot": {
+  "requests": 39,
+  "own_kb": 555,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 10,
+   "font": 355,
+   "image": 472,
+   "other": 1,
+   "script": 322,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 366,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709938776&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=981931414.1793709940&"
+  ],
+  "url": "/just_os_chatbot/",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ },
+ "404": {
+  "requests": 32,
+  "own_kb": 179,
+  "third_party_kb": 673,
+  "by_kind_kb": {
+   "document": 9,
+   "font": 355,
+   "image": 97,
+   "other": 1,
+   "script": 322,
+   "stylesheet": 67
+  },
+  "hosts": [
+   "(this site)",
+   "cdnjs.cloudflare.com",
+   "fonts.googleapis.com",
+   "fonts.gstatic.com",
+   "licensebuttons.net",
+   "stats.g.doubleclick.net",
+   "www.google.co.uk",
+   "www.googletagmanager.com"
+  ],
+  "dom_elements": 331,
+  "js_errors": [],
+  "failed_requests": [
+   "https://region1.analytics.google.com/g/collect?v=2&tid=G-2BTFVS6SPM&gtm=45je6au1v884251387za208zd884251387xf1&_p=1793709955259&_gaz=1&gcd=13l3l3l3l1l1&npa=0&dma=0&_eu=AAAAAGA&cid=1065231210.1793709958"
+  ],
+  "url": "/404.html",
+  "overflow_px": {
+   "390": 0,
+   "1024": 0,
+   "1440": 0
+  }
+ }
+}
diff --git a/scripts/rebrand/build_fonts.py b/scripts/rebrand/build_fonts.py
new file mode 100644
index 00000000000..4aec9158473
--- /dev/null
+++ b/scripts/rebrand/build_fonts.py
@@ -0,0 +1,127 @@
+#!/usr/bin/env python3
+"""Rebuild the self-hosted WOFF2 fonts in static/fonts/doors/ from Google's sources.
+
+Run: python3 scripts/rebrand/build_fonts.py <dir-with-source-ttfs> static/fonts/doors
+
+     python3 scripts/rebrand/build_fonts.py --icons <dir-with-font-awesome-files> static/fonts/doors assets/css/doors/icons.css
+
+Needs `pip install fonttools brotli`. Sources are the OFL files in github.com/google/fonts
+(ofl/newsreader, ofl/sourcesans3). Keeps Latin and Latin Extended-A, which cover every letter in
+the site's English, German and Turkish; Arabic and Chinese use system fonts (decision D18). Other
+scripts fall back to system fonts, as they did with the wider subset. Newsreader is only ever set
+at weight 500, so it keeps only its optical-size axis.
+
+--icons takes fa-solid-900.woff2, fa-brands-400.woff2, fa-regular-400.woff2 and all.min.css from
+Font Awesome Free 6.7.2 (cdnjs) and subsets them to the icons in ICONS. Pages download an icon font
+only if they show one of its icons. check_design.py fails if a build uses an icon not listed here.
+"""
+
+import os
+import re
+import sys
+
+from fontTools import subset
+from fontTools.ttLib import TTFont
+from fontTools.varLib import instancer
+
+UNICODES = (
+    "U+0000-017F,U+0218-021B,U+0259,U+02BB-02BC,U+02C6,U+02DA,U+02DC,U+0300-0308,U+030A-030C,"
+    "U+0327-0328,U+2000-206F,U+20AC,U+2113,U+2122,U+2190-2193,U+2212,U+2248,U+2260,U+2264-2265,U+FFFD"
+)
+FONTS = [
+    # source, axis limits, output
+    ("Newsreader[opsz,wght].ttf", {"wght": 500, "opsz": (16, 72)}, "newsreader-var.woff2"),
+    ("SourceSans3[wght].ttf", {"wght": (400, 700)}, "source-sans-3-var.woff2"),
+    # Only reference lists use italics (decision D15), and those are in the text face.
+    ("SourceSans3-Italic[wght].ttf", {"wght": 400}, "source-sans-3-italic.woff2"),
+]
+
+
+# Every Font Awesome icon in templates and content, by style. Keep sorted.
+ICONS = {
+    "brands": ["bluesky", "facebook", "github", "instagram", "linkedin", "mastodon", "orcid",
+               "slack", "twitter", "youtube"],
+    "solid": ["angle-right", "arrow-alt-circle-right", "arrow-right", "arrow-up", "bars", "book", "book-open",
+              "brain", "chart-line", "chevron-down", "chevron-right", "envelope", "external-link-alt",
+              "file-alt", "file-pdf", "flask", "folder", "globe", "graduation-cap", "heart", "layer-group",
+              "lightbulb", "link", "play", "project-diagram", "redo", "search", "share-alt", "star", "times",
+              "times-circle", "user", "users"],
+    "regular": ["envelope", "file-alt", "folder", "user"],
+}
+ICON_FILES = {"brands": "fa-brands-400.woff2", "solid": "fa-solid-900.woff2", "regular": "fa-regular-400.woff2"}
+ICON_STYLES = {
+    "brands": (".fab,.fa-brands", 400),
+    "solid": (".fa,.fas,.fa-solid", 900),
+    "regular": (".far,.fa-regular", 400),
+}
+
+
+def build_icons(source, output, css_path):
+    sheet = open(os.path.join(source, "all.min.css"), encoding="utf-8").read()
+    code = {}
+    for match in re.finditer(r'((?:\.fa-[a-z0-9-]+,?)+)\{--fa:"\\([0-9a-f]+)', sheet):
+        for name in re.findall(r"\.fa-([a-z0-9-]+)", match.group(1)):
+            code[name] = match.group(2)
+    lines = [
+        "/* Generated by scripts/rebrand/build_fonts.py --icons: Font Awesome Free 6.7.2 (fonts OFL 1.1,",
+        "   code MIT), subset to the icons the site uses. */",
+    ]
+    bases = []
+    for style, names in ICONS.items():
+        font = TTFont(os.path.join(source, ICON_FILES[style]))
+        options = subset.Options()
+        options.flavor = "woff2"
+        options.layout_features = []
+        subsetter = subset.Subsetter(options)
+        subsetter.populate(unicodes=[int(code[name], 16) for name in names])
+        subsetter.subset(font)
+        font.flavor = "woff2"
+        font.save(os.path.join(output, f"icons-{style}.woff2"))
+        selector, weight = ICON_STYLES[style]
+        lines.append(f"@font-face{{font-family:'Doors Icons {style}';src:url(../fonts/doors/icons-{style}.woff2) format('woff2');font-weight:{weight};font-display:block}}")
+        lines.append(f"{selector}{{font-family:'Doors Icons {style}';font-weight:{weight}}}")
+        bases.append(selector)
+    lines.append(f"{','.join(bases)}{{display:inline-block;line-height:1;-webkit-font-smoothing:antialiased;text-rendering:auto}}")
+    names = sorted({name for group in ICONS.values() for name in group})
+    lines.append("".join(f'.fa-{name}::before{{content:"\\{code[name]}"}}' for name in names))
+    with open(css_path, "w", encoding="utf-8") as handle:
+        handle.write("\n".join(lines) + "\n")
+
+
+def build(source, limits, output):
+    font = TTFont(source)
+    font = instancer.instantiateVariableFont(font, limits)
+    # The instancer drops glyphs left with no variation, such as spaces, and the subsetter
+    # then fails looking them up.
+    if "gvar" in font:
+        kept = font["gvar"].variations
+        font["gvar"].variations = {
+            name: kept[name] if name in kept else [] for name in font.getGlyphOrder()
+        }
+    options = subset.Options()
+    options.flavor = "woff2"
+    options.hinting = False
+    options.desubroutinize = True
+    options.notdef_outline = True
+    options.name_IDs = [1, 2, 3, 4, 6, 13, 14]
+    subsetter = subset.Subsetter(options)
+    subsetter.populate(unicodes=subset.parse_unicodes(UNICODES))
+    subsetter.subset(font)
+    font.flavor = "woff2"
+    font.save(output)
+    print(f"{output}: {os.path.getsize(output) / 1000:.0f} KB")
+
+
+def main():
+    if sys.argv[1] == "--icons":
+        os.makedirs(sys.argv[3], exist_ok=True)
+        build_icons(*sys.argv[2:5])
+        return
+    source_dir, out_dir = sys.argv[1:3]
+    os.makedirs(out_dir, exist_ok=True)
+    for source, limits, output in FONTS:
+        build(os.path.join(source_dir, source), limits, os.path.join(out_dir, output))
+
+
+if __name__ == "__main__":
+    main()
diff --git a/scripts/rebrand/capture_pages.py b/scripts/rebrand/capture_pages.py
new file mode 100644
index 00000000000..c4acf16c540
--- /dev/null
+++ b/scripts/rebrand/capture_pages.py
@@ -0,0 +1,178 @@
+#!/usr/bin/env python3
+"""Screenshot and weigh the sample pages of a built site, one per template.
+
+Run: python3 scripts/rebrand/capture_pages.py <public-dir> --out <dir> [--base /]
+     [--widths 390,1024,1440] [--no-shots] [--pages "home,cluster"]
+
+Needs Playwright (`pip install playwright pillow`, `playwright install chromium`). Serves
+the build locally and writes weights.json plus WebP screenshots. Our own files are counted
+at their gzip size, as GitHub Pages serves them, and third-party files at their transfer
+size. Analytics and other third parties load as normal for weighing and are blocked for
+screenshots, so a slow script cannot change the picture. Each page is also checked for
+console errors, failed requests and sideways overflow.
+"""
+
+import argparse
+import functools
+import gzip
+import http.server
+import io
+import json
+import os
+import re
+import threading
+from urllib.parse import urlsplit
+
+from PIL import Image
+from playwright.sync_api import sync_playwright
+
+HERE = os.path.dirname(os.path.abspath(__file__))
+SHOT_MAX_HEIGHT = 6000
+KINDS = {"document", "stylesheet", "script", "image", "font"}
+
+
+class QuietHandler(http.server.SimpleHTTPRequestHandler):
+    def log_message(self, *args):
+        pass
+
+
+def serve(root):
+    handler = functools.partial(QuietHandler, directory=root)
+    server = http.server.ThreadingHTTPServer(("127.0.0.1", 0), handler)
+    threading.Thread(target=server.serve_forever, daemon=True).start()
+    return server, server.server_address[1]
+
+
+def slug(name):
+    return re.sub(r"[^a-z0-9]+", "-", name.lower()).strip("-")
+
+
+def weigh(browser, origin, url, root, base):
+    context = browser.new_context(viewport={"width": 1440, "height": 900})
+    page = context.new_page()
+    cdp = context.new_cdp_session(page)
+    cdp.send("Network.enable")
+    encoded, kinds, urls = {}, {}, {}
+    cdp.on("Network.requestWillBeSent", lambda e: urls.update({e["requestId"]: e["request"]["url"]}))
+    cdp.on("Network.responseReceived", lambda e: kinds.update({e["requestId"]: e["type"].lower()}))
+    cdp.on("Network.loadingFinished", lambda e: encoded.update({e["requestId"]: e["encodedDataLength"]}))
+    errors, failed = [], []
+    page.on("pageerror", lambda e: errors.append(str(e)[:300]))
+    page.on("requestfailed", lambda r: failed.append(r.url[:200]))
+    page.on("response", lambda r: failed.append(f"{r.status} {r.url[:200]}") if r.status >= 400 else None)
+    page.goto(origin + url, wait_until="load", timeout=120000)
+    page.wait_for_timeout(2500)
+    page.wait_for_load_state("load")
+    domain_bytes = {"own": 0, "third_party": 0}
+    by_kind = {}
+    hosts = set()
+    for rid, size in encoded.items():
+        address = urls.get(rid, "")
+        if not address.startswith("http"):
+            continue
+        parts = urlsplit(address)
+        hosts.add(parts.hostname)
+        if address.startswith(origin):
+            rel = parts.path[len(base):] if parts.path.startswith(base) else parts.path.lstrip("/")
+            local = os.path.join(root, rel or "index.html")
+            if os.path.isdir(local):
+                local = os.path.join(local, "index.html")
+            try:
+                with open(local, "rb") as handle:
+                    size = len(gzip.compress(handle.read(), 6))
+            except OSError:
+                continue
+            domain_bytes["own"] += size
+        else:
+            domain_bytes["third_party"] += size
+        kind = kinds.get(rid, "other")
+        kind = kind if kind in KINDS else "other"
+        by_kind[kind] = by_kind.get(kind, 0) + size
+    dom = page.evaluate("document.getElementsByTagName('*').length")
+    context.close()
+    return {
+        "requests": len(encoded),
+        "own_kb": round(domain_bytes["own"] / 1000),
+        "third_party_kb": round(domain_bytes["third_party"] / 1000),
+        "by_kind_kb": {key: round(value / 1000) for key, value in sorted(by_kind.items())},
+        "hosts": sorted(host.replace("127.0.0.1", "(this site)") for host in hosts if host),
+        "dom_elements": dom,
+        "js_errors": errors,
+        "failed_requests": failed[:20],
+    }
+
+
+def screenshot(browser, origin, url, widths, out, name):
+    overflow = {}
+    for width in widths:
+        context = browser.new_context(viewport={"width": width, "height": 900}, reduced_motion="reduce")
+        page = context.new_page()
+        page.route("**/*", lambda route: route.abort() if re.search(
+            r"googletagmanager|google-analytics|doubleclick|youtube|eocampaign|eo\.page|docs\.google",
+            route.request.url) else route.continue_())
+        page.goto(origin + url, wait_until="load", timeout=120000)
+        page.wait_for_timeout(1200)
+        # Some pages forward themselves by script, so let any navigation finish first.
+        page.wait_for_load_state("load")
+        overflow[str(width)] = page.evaluate(
+            "document.documentElement.scrollWidth - document.documentElement.clientWidth")
+        height = min(page.evaluate("document.documentElement.scrollHeight"), SHOT_MAX_HEIGHT)
+        raw = page.screenshot(clip={"x": 0, "y": 0, "width": width, "height": height}, full_page=True)
+        Image.open(io.BytesIO(raw)).convert("RGB").save(
+            os.path.join(out, f"{name}-{width}.webp"), "WEBP", quality=60, method=4)
+        context.close()
+    return overflow
+
+
+def main():
+    parser = argparse.ArgumentParser(description=__doc__)
+    parser.add_argument("public")
+    parser.add_argument("--out", required=True)
+    parser.add_argument("--base", default="/", help="subfolder the build expects to be served from")
+    parser.add_argument("--widths", default="390,1024,1440")
+    parser.add_argument("--no-shots", action="store_true")
+    parser.add_argument("--pages", help="comma-separated names from sample_pages.json")
+    args = parser.parse_args()
+
+    with open(os.path.join(HERE, "sample_pages.json"), encoding="utf-8") as handle:
+        samples = json.load(handle)
+    if args.pages:
+        wanted = args.pages.split(",")
+        samples = {key: value for key, value in samples.items() if key in wanted}
+    widths = [int(width) for width in args.widths.split(",")]
+    os.makedirs(args.out, exist_ok=True)
+
+    # A subfolder build is served from a parent directory that links to it.
+    root = os.path.abspath(args.public)
+    base = "/" + args.base.strip("/") + "/" if args.base.strip("/") else "/"
+    serve_root = root
+    if base != "/":
+        serve_root = os.path.join(args.out, ".serve")
+        os.makedirs(serve_root, exist_ok=True)
+        link = os.path.join(serve_root, base.strip("/"))
+        if not os.path.islink(link):
+            os.symlink(root, link)
+    server, port = serve(serve_root)
+    origin = f"http://127.0.0.1:{port}"
+
+    results = {}
+    with sync_playwright() as playwright:
+        browser = playwright.chromium.launch()
+        for name, url in samples.items():
+            full = base + url.lstrip("/")
+            entry = weigh(browser, origin, full, root, base)
+            entry["url"] = url
+            if not args.no_shots:
+                entry["overflow_px"] = screenshot(browser, origin, full, widths, args.out, slug(name))
+            results[name] = entry
+            print(f"{name}: {entry['own_kb']} KB own + {entry['third_party_kb']} KB third-party, "
+                  f"{entry['requests']} requests, {len(entry['js_errors'])} JS errors", flush=True)
+        browser.close()
+    server.shutdown()
+    with open(os.path.join(args.out, "weights.json"), "w", encoding="utf-8") as handle:
+        json.dump(results, handle, indent=1, ensure_ascii=False)
+        handle.write("\n")
+
+
+if __name__ == "__main__":
+    main()
diff --git a/scripts/rebrand/check_axe.py b/scripts/rebrand/check_axe.py
new file mode 100644
index 00000000000..30f8b9be0dc
--- /dev/null
+++ b/scripts/rebrand/check_axe.py
@@ -0,0 +1,95 @@
+#!/usr/bin/env python3
+"""Run axe-core on a built site's sample pages, by WCAG level.
+
+Run: python3 scripts/rebrand/check_axe.py <public> --base /rebrand-doors/ --axe <axe.min.js>
+Or against the preview: python3 scripts/rebrand/check_axe.py --url https://forrt.org/rebrand-doors/ --axe <axe.min.js>
+
+Needs Playwright, and axe-core's axe.min.js from npm. Fails on Level A and AA findings, apart from
+those in KNOWN, which come from other sites' markup. Prints best-practice findings only as counts.
+"""
+
+import argparse
+import collections
+import json
+import os
+import sys
+from urllib.parse import quote
+
+from playwright.sync_api import sync_playwright
+
+HERE = os.path.dirname(os.path.abspath(__file__))
+sys.path.insert(0, HERE)
+from check_design import serve  # noqa: E402
+
+LEVEL_A = {"wcag2a", "wcag21a", "wcag22a"}
+LEVEL_AA = {"wcag2aa", "wcag21aa", "wcag22aa"}
+EXTRA = {
+    "privacy": "/privacy/",
+    "syllabus": "/syllabus/",
+    "lesson bank": "/neurodiversity-lessonbank/implicit_bias/",
+}
+# Datawrapper's own chart markup on this page.
+KNOWN = {("nowhere lab list", "aria-hidden-focus"), ("nowhere lab list", "nested-interactive"), ("nowhere lab list", "role-img-alt")}
+RUN = """async () => {
+  const result = await axe.run(document, {runOnly: {type: 'tag', values: ['wcag2a', 'wcag21a', 'wcag22a', 'wcag2aa', 'wcag21aa', 'wcag22aa', 'best-practice']}, iframes: false});
+  return result.violations.map((v) => ({id: v.id, impact: v.impact, tags: v.tags, count: v.nodes.length, sample: v.nodes[0].html.slice(0, 140)}));
+}"""
+
+
+def level(tags):
+    tags = set(tags)
+    return "A" if tags & LEVEL_A else "AA" if tags & LEVEL_AA else "best-practice"
+
+
+def main():
+    parser = argparse.ArgumentParser(description=__doc__)
+    parser.add_argument("public", nargs="?")
+    parser.add_argument("--url")
+    parser.add_argument("--base", default="/")
+    parser.add_argument("--axe", required=True, help="path to axe.min.js")
+    parser.add_argument("--out", help="write every finding to this JSON file")
+    args = parser.parse_args()
+    base = args.url.rstrip("/") + "/" if args.url else serve(os.path.abspath(args.public), args.base)
+    with open(os.path.join(HERE, "sample_pages.json"), encoding="utf-8") as handle:
+        sample = {**json.load(handle), **EXTRA}
+    sample.pop("404", None)
+    with open(args.axe, encoding="utf-8") as handle:
+        axe = handle.read()
+    findings, failures, practice = [], [], collections.Counter()
+    with sync_playwright() as playwright:
+        browser = playwright.chromium.launch()
+        for width in (390, 1440):
+            context = browser.new_context(viewport={"width": width, "height": 900}, reduced_motion="reduce")
+            for name, path in sample.items():
+                page = context.new_page()
+                response = page.goto(base + quote(path.lstrip("/"), safe="/%"), wait_until="load", timeout=120000)
+                if not response or not response.ok:
+                    failures.append(f"{name} at {width}: {path} did not load")
+                    page.close()
+                    continue
+                page.wait_for_timeout(800)
+                if base not in page.url:
+                    page.close()
+                    continue
+                page.evaluate(axe)
+                for violation in page.evaluate(RUN):
+                    grade = level(violation["tags"])
+                    findings.append({"page": name, "width": width, "level": grade, **{k: violation[k] for k in ("id", "impact", "count", "sample")}})
+                    if grade == "best-practice":
+                        practice[violation["id"]] += 1
+                    elif (name, violation["id"]) not in KNOWN:
+                        failures.append(f"{name} at {width}: Level {grade} {violation['id']} ({violation['count']}): {violation['sample']}")
+                page.close()
+            context.close()
+        browser.close()
+    if args.out:
+        with open(args.out, "w", encoding="utf-8") as handle:
+            json.dump(findings, handle, indent=1, ensure_ascii=False)
+    print(f"Pages: {len(sample)}, at 390 and 1440 px")
+    print("Best practice, report only:", dict(practice))
+    print(json.dumps({"failures": failures}, indent=1, ensure_ascii=False))
+    sys.exit(1 if failures else 0)
+
+
+if __name__ == "__main__":
+    main()
diff --git a/scripts/rebrand/check_design.py b/scripts/rebrand/check_design.py
new file mode 100644
index 00000000000..81ebfa2631b
--- /dev/null
+++ b/scripts/rebrand/check_design.py
@@ -0,0 +1,1516 @@
+#!/usr/bin/env python3
+"""Check the designed screens in a browser, against the Doors acceptance checklist.
+
+Run: python3 scripts/rebrand/check_design.py <public-dir> [--base /]
+     python3 scripts/rebrand/check_design.py --url https://forrt.org/rebrand-doors/
+
+Needs Playwright. Covers what a build comparison cannot: nothing runs wider than the screen,
+no italic type outside references, reading lines under 80 characters, no page's own button
+hidden, the sample pages' width as well as the designed screens', the home page's topic
+buttons within their position limit (checklist A14), its layout shift on a slow phone, the pause
+control over the castle and the quotes, the layout of the /clusters/ illustration, and the behaviour of the resources directory. On a local build it also weighs the designed screens against the migration
+plan's budgets. Those lines are a report and do not fail the check, because the theme's Bootstrap,
+jQuery and Font Awesome stay until Phase 3.
+"""
+
+import argparse
+import functools
+import http.server
+import json
+import os
+import re
+import sys
+import tempfile
+import threading
+from urllib.parse import urlsplit
+
+from playwright.sync_api import Error as PlaywrightError, sync_playwright
+
+WIDTHS = {390: 844, 1024: 768, 1440: 900}
+SCREENS = {
+    "home": "",
+    "replication hub": "replication-hub/",
+    "resources": "resources/",
+    "resources page 2": "resources/page/2/",
+    "article": "post/2026-01-newsletter/",
+    "contributor analysis": "contributor-analysis/",
+}
+BLOCK = re.compile(r"googletagmanager|google-analytics|doubleclick|youtube|docs\.google")
+A14_LIMIT = {390: 2.5, 1440: 1.6}
+SHIFT_LIMIT = 0.1
+# A page's own button must not vanish: shell rules on a bare class name have hidden one. Bootstrap's
+# d-*-none classes hide buttons on purpose, such as a menu toggle meant only for phones.
+HIDDEN_BUTTONS = """(root) => {
+  const onPurpose = (el) => {
+    for (let e = el; e; e = e.parentElement) {
+      if (getComputedStyle(e).display === 'none' && /(^|\\s)d-(\\w+-)?none(\\s|$)/.test(e.getAttribute('class') || '')) return true;
+    }
+    return false;
+  };
+  return [...root.querySelectorAll(':is(a,button).btn')]
+    .filter((a) => !a.getClientRects().length && !a.closest('[hidden],.collapse,.modal,.tab-pane,details') && !onPurpose(a) && !(innerWidth <= 760 && a.closest('.click-to-load[style*="absolute"]:not([data-embed-src*="youtube"])')))
+    .map((a) => a.textContent.trim().slice(0, 40));
+}"""
+AUDIT = """() => {
+  const main = document.querySelector('main');
+  const italic = [];
+  const contrast = [];
+  const small = [];
+  const channel = (v) => { v /= 255; return v <= .03928 ? v / 12.92 : ((v + .055) / 1.055) ** 2.4; };
+  const lum = (c) => .2126 * channel(c[0]) + .7152 * channel(c[1]) + .0722 * channel(c[2]);
+  const parse = (s) => { const n = (s.match(/[\\d.]+/g) || []).map(Number); return n.length < 3 ? null : [n[0], n[1], n[2], n[3] ?? 1]; };
+  // Walks up to the nearest solid background. Text over an image or gradient would be measured
+  // against the wrong colour, but the designed screens set none.
+  const background = (el) => {
+    for (let e = el; e; e = e.parentElement) {
+      const b = parse(getComputedStyle(e).backgroundColor);
+      if (b && b[3] > .9) return b;
+    }
+    return [255, 255, 255, 1];
+  };
+  for (const el of main.querySelectorAll('*')) {
+    if (!el.getClientRects().length || !el.textContent.trim()) continue;
+    // The flipbook library draws its own controls.
+    if (el.closest('.df-container,._df_book')) continue;
+    const style = getComputedStyle(el);
+    // Decision D15: real italics only inside references. Same selector as base.css.
+    const reference = el.closest('.references-list,.csl-bib-body') || el.matches(':is(h2,h3,h4)[id^=references i]~:is(ul,ol,p) *');
+    if (style.fontStyle !== 'normal' && !reference) {
+      italic.push(el.textContent.trim().slice(0, 40));
+    }
+    if (style.visibility === 'hidden' || !parseFloat(style.opacity)) continue;
+    if (![...el.childNodes].some((n) => n.nodeType === 3 && n.textContent.trim())) continue;
+    const text = el.textContent.trim().slice(0, 40);
+    const size = parseFloat(style.fontSize);
+    if (size < 15 && !el.closest('.mastfoot,.leaflet-container,sup,sub')) small.push(`${size}: ${text}`);
+    const fg = parse(style.color);
+    if (fg) {
+      const a = lum(fg), b = lum(background(el));
+      const ratio = (Math.max(a, b) + .05) / (Math.min(a, b) + .05);
+      const large = size >= 24 || (size >= 18.66 && Number(style.fontWeight) >= 700);
+      if (ratio < (large ? 3 : 4.5)) contrast.push(`${ratio.toFixed(2)} ${style.color}: ${text}`);
+    }
+  }
+  const lineChars = (el) => {
+    const walker = document.createTreeWalker(el, NodeFilter.SHOW_TEXT);
+    const lines = {};
+    let node;
+    while ((node = walker.nextNode())) {
+      // Text no one can see is not a line: inside a closed disclosure, or cut off by a box that clips it
+      // (a description shortened to its first lines).
+      const parent = node.parentElement;
+      if (parent.closest('details:not([open])') && !parent.closest('summary')) continue;
+      const clips = [];
+      for (let up = parent; up && up !== el.parentElement; up = up.parentElement) {
+        if (getComputedStyle(up).overflowY !== 'visible') clips.push(up.getBoundingClientRect());
+      }
+      for (const match of node.textContent.matchAll(/\\S+\\s*/g)) {
+        const range = document.createRange();
+        range.setStart(node, match.index);
+        range.setEnd(node, match.index + match[0].length);
+        // A long address can break across lines, so share its characters out by rendered width.
+        // The share is taken over all of the word's boxes, then only the visible ones count.
+        const all = [...range.getClientRects()].filter((box) => box.width > 0);
+        const total = all.reduce((sum, box) => sum + box.width, 0);
+        const boxes = all.filter((box) => clips.every((clip) => box.top < clip.bottom - 1 && box.bottom > clip.top + 1
+          && box.left < clip.right - 1 && box.right > clip.left + 1));
+        for (const box of boxes) {
+          const key = Math.round(box.top / 6);
+          // Arabic vowel marks and other combining marks take up no column of their own.
+          const letters = match[0].replace(/\\p{M}/gu, '').length;
+          lines[key] = (lines[key] || 0) + letters * box.width / total;
+        }
+      }
+    }
+    return Math.round(Math.max(0, ...Object.values(lines)));
+  };
+  const long = [...main.querySelectorAll('.reading p,.reading li,.lede,.about-statement p,.forward p')]
+    .filter((el) => el.getClientRects().length && lineChars(el) >= 80)
+    .map((el) => lineChars(el) + ': ' + el.textContent.trim().slice(0, 40));
+  return {
+    overflow: document.documentElement.scrollWidth - document.documentElement.clientWidth,
+    italic: italic.slice(0, 5),
+    contrast: contrast.slice(0, 5),
+    small: small.slice(0, 5),
+    long: long.slice(0, 5),
+    h1: document.querySelectorAll('h1').length,
+    hidden: (""" + HIDDEN_BUTTONS + """)(main),
+    broken: [...document.images].filter((i) => i.complete && i.getClientRects().length && !i.naturalWidth).map((i) => i.src),
+  };
+}"""
+
+
+def serve(root, subfolder):
+    """Serve a build, from the subfolder it expects if it has been through preview_paths.py."""
+    class Quiet(http.server.SimpleHTTPRequestHandler):
+        def log_message(self, *args):
+            pass
+
+    folder = subfolder.strip("/")
+    directory = root
+    if folder:
+        directory = tempfile.mkdtemp(prefix="scratch-design-")
+        os.symlink(root, os.path.join(directory, folder))
+    server = http.server.ThreadingHTTPServer(("127.0.0.1", 0), functools.partial(Quiet, directory=directory))
+    threading.Thread(target=server.serve_forever, daemon=True).start()
+    return f"http://127.0.0.1:{server.server_address[1]}/" + (f"{folder}/" if folder else "")
+
+
+def new_page(browser, width, errors=None, **options):
+    phone = {"has_touch": True} if width < 500 else {}
+    if width < 500 and browser.browser_type.name != "firefox":  # Firefox has no mobile mode in Playwright.
+        phone["is_mobile"] = True
+    context = browser.new_context(viewport={"width": width, "height": WIDTHS.get(width, 900)}, **phone, **options)
+    page = context.new_page()
+    page.route("**/*", lambda route: route.abort() if BLOCK.search(route.request.url) else route.continue_())
+    if errors is not None:
+        page.on("pageerror", lambda error: errors.append(str(error)[:200]))
+    return page
+
+
+def check_screens(browser, base, failures):
+    for name, path in SCREENS.items():
+        for width in WIDTHS:
+            errors = []
+            page = new_page(browser, width, errors)
+            page.goto(base + path, wait_until="load", timeout=120000)
+            page.evaluate("document.fonts.ready")
+            page.wait_for_timeout(600)
+            found = page.evaluate(AUDIT)
+            print(f"  {name} at {width}: overflow {found['overflow']}, h1 {found['h1']}")
+            if found["overflow"] > 0:
+                failures.append(f"{name} at {width}: {found['overflow']} px wider than the screen")
+            if found["h1"] != 1:
+                failures.append(f"{name} at {width}: {found['h1']} h1 elements")
+            for key, label in (("italic", "italic type"), ("contrast", "low contrast"), ("small", "text under 15 px"),
+                               ("long", "lines of 80 characters or more"), ("broken", "broken images"), ("hidden", "hidden buttons")):
+                if found[key]:
+                    failures.append(f"{name} at {width}: {label}: {found[key]}")
+            if errors:
+                failures.append(f"{name} at {width}: script errors: {errors[:2]}")
+            page.context.close()
+
+
+def article_paths(root):
+    """Pages drawn on the reading layout, from the build."""
+    paths = []
+    for directory, _, files in os.walk(root):
+        if "index.html" in files:
+            with open(os.path.join(directory, "index.html"), encoding="utf-8", errors="replace") as handle:
+                if re.search(r'class="?article-layout', handle.read()):
+                    paths.append(os.path.relpath(directory, root).replace(os.sep, "/") + "/")
+    # The two generated collections have over a thousand pages from one template, so take a sample.
+    chosen = []
+    seen = {}
+    for path in sorted(paths):
+        section = path.split("/")[0]
+        seen[section] = seen.get(section, 0) + 1
+        if section not in ("curated_resources", "glossary", "authors") or seen[section] % 40 == 1:
+            chosen.append(path)
+    return chosen
+
+
+def check_articles(browser, base, root, failures):
+    """The reading layout across its pages: content varies more than the layout does."""
+    paths = article_paths(root)
+    print(f"  {len(paths)} pages")
+    for width in WIDTHS:
+        page = new_page(browser, width)
+        for path in paths:
+            page.goto(base + path, wait_until="load", timeout=120000)
+            # Line lengths mean little until the real fonts have arrived.
+            page.wait_for_function("document.fonts.check('18px \"Source Sans 3\"')", timeout=30000)
+            page.evaluate("document.fonts.ready.then(() => null)")
+            page.wait_for_timeout(100)
+            found = page.evaluate(AUDIT)
+            if found["overflow"] > 0:
+                failures.append(f"{path} at {width}: {found['overflow']} px wider than the screen")
+            for key, label in (("italic", "italic type"), ("contrast", "low contrast"), ("small", "text under 15 px"),
+                               ("long", "lines of 80 characters or more"), ("broken", "broken images"), ("hidden", "hidden buttons")):
+                if found[key]:
+                    failures.append(f"{path} at {width}: {label}: {found[key][:2]}")
+            gap = page.evaluate(CARD_GAP)
+            if gap > CARD_GAP_LIMIT:
+                failures.append(f"{path} at {width}: {round(gap)} px of empty space between the text and its card")
+        page.context.close()
+
+
+def check_callouts(browser, base, root, failures):
+    """Call-outs sit in the right-hand column from 1240px, clear of each other, and in the text below that."""
+    paths = []
+    for directory, _, files in os.walk(root):
+        if "index.html" in files:
+            with open(os.path.join(directory, "index.html"), encoding="utf-8", errors="replace") as handle:
+                if re.search(r'<aside class="?callout', handle.read()):  # A minified build drops the quote.
+                    paths.append(os.path.relpath(directory, root).replace(os.sep, "/") + "/")
+    print(f"  {len(paths)} pages")
+    if not paths:
+        failures.append("no page uses a call-out, so the call-out check tested nothing")
+    for width in WIDTHS:
+        page = new_page(browser, width)
+        for path in sorted(paths):
+            page.goto(base + path, wait_until="load", timeout=120000)
+            page.wait_for_function("document.fonts.check('18px \"Source Sans 3\"')", timeout=30000)
+            page.evaluate("document.fonts.ready.then(() => null)")
+            found = page.evaluate(CALLOUTS)
+            for problem in found:
+                failures.append(f"{path} at {width}: call-out {problem}")
+        page.context.close()
+
+
+CALLOUTS = """() => {
+  const reading = document.querySelector('.article-layout>.reading');
+  if (!reading || reading.parentElement.classList.contains('article-layout-wide')) return [];
+  const area = reading.getBoundingClientRect();
+  const notes = [...reading.querySelectorAll('.callout')].map((el) => el.getBoundingClientRect());
+  const card = document.querySelector('.article-layout>.article-card')?.getBoundingClientRect();
+  const problems = [];
+  if (innerWidth >= 1240) {
+    const boxes = card ? [card, ...notes] : notes;
+    if (notes.some((box) => box.left < area.right)) problems.push('over the text');
+    if (notes.some((box) => box.right > innerWidth)) problems.push('off the screen');
+    if (boxes.some((a, i) => boxes.slice(i + 1).some((b) => a.left < b.right && b.left < a.right && a.top < b.bottom && b.top < a.bottom))) problems.push('overlaps the card or another call-out');
+  } else {
+    if (notes.some((box) => box.left < area.left - 1 || box.right > area.right + 1)) problems.push('outside the text column');
+    if (innerWidth <= 1000 && card && card.height && card.top < area.bottom) problems.push('card comes before the text');
+  }
+  return problems;
+}"""
+
+
+# Between a page's text and the card beside it, when they are side by side.
+CARD_GAP = """() => {
+  const reading = document.querySelector('.article-layout>.reading');
+  const card = document.querySelector('.article-layout>.article-card');
+  if (!reading || !card) return 0;
+  const box = card.getBoundingClientRect();
+  const text = reading.getBoundingClientRect();
+  if (box.top > text.bottom) return 0;
+  // The card sits left of the text on a desktop (right in right-to-left pages).
+  if (box.right <= text.left) return text.left - box.right;
+  const lines = [...reading.querySelectorAll('.article-style p')].filter((p) => p.getClientRects().length);
+  const right = Math.max(...(lines.length ? lines : [reading]).map((el) => el.getBoundingClientRect().right));
+  return box.left < right ? 0 : box.left - right;
+}"""
+CARD_GAP_LIMIT = 80
+
+
+def press_tab(page):
+    """Tab, or in WebKit Option-Tab, because Safari's Tab skips buttons and links by default."""
+    page.keyboard.press("Alt+Tab" if page.context.browser.browser_type.name == "webkit" else "Tab")
+
+
+def read_settled(page, expression):
+    """Read a page that may be redirecting, as /glossary/ does, by reading again once it has landed."""
+    for _ in range(4):
+        try:
+            return page.evaluate(expression)
+        except PlaywrightError:
+            page.wait_for_timeout(500)
+            page.wait_for_load_state("load")
+    return page.evaluate(expression)
+
+
+def check_samples(browser, base, failures):
+    """Nothing runs wider than the screen or hides a button on the sample pages, with their retained
+    templates too."""
+    with open(os.path.join(os.path.dirname(os.path.abspath(__file__)), "sample_pages.json"), encoding="utf-8") as handle:
+        samples = json.load(handle)
+    wider = "document.documentElement.scrollWidth - document.documentElement.clientWidth"
+    for width in WIDTHS:
+        page = new_page(browser, width)
+        for name, path in samples.items():
+            page.goto(base + path.lstrip("/"), wait_until="load", timeout=120000)
+            page.wait_for_timeout(300)
+            over = read_settled(page, wider)
+            if over > 0:
+                failures.append(f"{name} at {width}: {over} px wider than the screen")
+            hidden = read_settled(page, f"({HIDDEN_BUTTONS})(document.querySelector('main') || document.body)")
+            if hidden:
+                failures.append(f"{name} at {width}: hidden buttons: {hidden[:2]}")
+        page.context.close()
+
+
+def check_other_widths(browser, base, failures):
+    """No overflow at the layout's breakpoints, or with text enlarged to 200% (checklist C6, C9)."""
+    enlarge = """() => {
+      const sizes = [...document.querySelectorAll('body *')].map((el) => [el, parseFloat(getComputedStyle(el).fontSize)]);
+      sizes.forEach(([el, size]) => { el.style.fontSize = size * 2 + 'px'; });
+    }"""
+    wider = "document.documentElement.scrollWidth - document.documentElement.clientWidth"
+    for name, path in SCREENS.items():
+        for width in (761, 1000, 1001, 1240, 1241):
+            page = new_page(browser, width)
+            page.goto(base + path, wait_until="load", timeout=120000)
+            page.wait_for_timeout(200)
+            over = page.evaluate(wider)
+            if over > 0:
+                failures.append(f"{name} at {width}: {over} px wider than the screen")
+            page.context.close()
+        for width in (390, 760, 1024, 1440):
+            page = new_page(browser, width)
+            page.goto(base + path, wait_until="load", timeout=120000)
+            page.wait_for_timeout(200)
+            page.evaluate(enlarge)
+            page.wait_for_timeout(100)
+            over = page.evaluate(wider)
+            print(f"  {name} at {width}, text 200%: overflow {over}")
+            if over > 0:
+                failures.append(f"{name} at {width} with text at 200%: {over} px wider than the screen")
+            page.context.close()
+
+
+def expectation(failures, area):
+    def expect(condition, message):
+        print(f"  {'ok ' if condition else 'BAD'} {message}")
+        if not condition:
+            failures.append(f"{area}: {message}")
+
+    return expect
+
+
+def layout_shift(browser, url):
+    """Layout shift on a cold load at 390 px, over a slow connection on a slow phone."""
+    page = new_page(browser, 390)
+    page.add_init_script(
+        "window.__shift=0;new PerformanceObserver(l=>{for(const e of l.getEntries())"
+        "if(!e.hadRecentInput)window.__shift+=e.value}).observe({type:'layout-shift',buffered:true});"
+    )
+    cdp = page.context.new_cdp_session(page)
+    cdp.send("Network.enable")
+    cdp.send("Network.setCacheDisabled", {"cacheDisabled": True})
+    cdp.send("Network.emulateNetworkConditions", {
+        "offline": False, "latency": 150, "downloadThroughput": 200000, "uploadThroughput": 90000,
+    })
+    cdp.send("Emulation.setCPUThrottlingRate", {"rate": 4})
+    page.goto(url, wait_until="load", timeout=180000)
+    page.wait_for_timeout(4000)
+    shift = page.evaluate("window.__shift")
+    page.context.close()
+    return shift
+
+
+def check_home(browser, base, failures):
+    expect = expectation(failures, "home")
+    for width, limit in A14_LIMIT.items():
+        page = new_page(browser, width)
+        page.goto(base, wait_until="load")
+        page.evaluate("document.fonts.ready")
+        position = page.evaluate("(document.querySelector('.topics').getBoundingClientRect().top + scrollY) / innerHeight")
+        expect(position <= limit, f"topics start at {position:.2f} viewports at {width} px, limit {limit}")
+        page.context.close()
+    if browser.browser_type.name == "chromium":  # The throttling is Chrome's own.
+        shift = layout_shift(browser, base)
+        expect(shift <= SHIFT_LIMIT, f"layout shift on a slow phone is {shift:.3f}, limit {SHIFT_LIMIT}")
+
+    page = new_page(browser, 1440)
+    requests = []
+    page.on("request", lambda request: requests.append(request.url))
+    page.goto(base, wait_until="load")
+    current = "[...document.querySelectorAll('.quote')].findIndex(q => q.classList.contains('is-active'))"
+    expect(page.evaluate("document.querySelector('.tower .motion-toggle').getBoundingClientRect().width") <= 1,
+           "the castle's pause button is out of sight at rest")
+    page.evaluate("document.querySelector('.quotes').scrollIntoView({block:'center'})")
+    page.mouse.move(2, 2)
+    first = page.evaluate(current)
+    page.wait_for_timeout(6500)
+    expect(page.evaluate(current) != first, "the quotes change on their own")
+    held = page.evaluate(current)
+    page.hover(".quote.is-active")
+    page.wait_for_timeout(6500)
+    expect(page.evaluate(current) == held, "a pointer on the quotes holds them")
+    page.mouse.move(2, 2)
+    page.evaluate("scrollTo(0, 0)")
+    page.wait_for_timeout(6500)
+    expect(page.evaluate(current) == held, "the quotes stay put off screen")
+    page.evaluate("document.querySelector('.quotes').scrollIntoView({block:'center'})")
+    page.wait_for_timeout(6500)
+    expect(page.evaluate(current) != held, "the quotes resume when seen again")
+    # A real Tab from the heading above, so that the browser counts it as keyboard focus.
+    page.evaluate("document.querySelector('.quotes').previousElementSibling.setAttribute('tabindex', '-1')")
+    page.evaluate("document.querySelector('.quotes').previousElementSibling.focus()")
+    press_tab(page)
+    button = page.locator(".quotes .motion-toggle")
+    expect(page.evaluate("document.activeElement.closest('.quotes') !== null"), "Tab reaches the quotes' pause button")
+    held = page.evaluate(current)
+    page.wait_for_timeout(6500)
+    expect(page.evaluate(current) == held, "keyboard focus on the quotes holds them")
+    expect(page.evaluate("document.querySelector('.quotes .motion-toggle').getBoundingClientRect().width") >= 36,
+           "the quotes' pause button appears on keyboard focus")
+    page.keyboard.press("Enter")
+    expect(button.text_content() == "Play animation", "pressing it pauses, and it says so")
+    expect(page.locator(".tower .motion-toggle").text_content() == "Play animation", "the castle's button shows the same state")
+    page.evaluate("document.activeElement.blur()")
+    page.mouse.move(2, 2)
+    held = page.evaluate(current)
+    page.wait_for_timeout(6500)
+    expect(page.evaluate(current) == held, "paused quotes stay put")
+    requests.clear()
+    page.reload(wait_until="load")
+    page.wait_for_timeout(3000)
+    expect(page.locator(".quotes .motion-toggle").text_content() == "Play animation", "the pause is remembered on the next visit")
+    expect(not any("castle." in url and "controller" not in url for url in requests), "a paused visit does not load the 3D bundle")
+    page.locator(".tower .motion-toggle").focus()
+    page.keyboard.press("Enter")
+    page.wait_for_timeout(3000)
+    expect(any("castle." in url for url in requests), "pressing play loads the castle")
+    page.context.close()
+
+    page = new_page(browser, 1440, reduced_motion="reduce")
+    requests = []
+    page.on("request", lambda request: requests.append(request.url))
+    page.goto(base, wait_until="load")
+    page.evaluate("document.querySelector('.quotes').scrollIntoView({block:'center'})")
+    page.wait_for_timeout(6500)
+    expect(page.evaluate(current) == 0, "reduced motion keeps the first quote")
+    expect(not any("/js/castle." in url for url in requests), "reduced motion does not load the 3D bundle")
+    expect(page.locator(".motion-toggle:visible").count() == 0, "reduced motion shows no pause button")
+    page.hover(".castle-stage")
+    expect(page.locator(".tower-entry").is_visible(), "reduced motion still offers the game on hover")
+    page.context.close()
+
+    check_tower_game(browser, base, expect)
+
+
+def check_tower_game(browser, base, expect):
+    box = "document.querySelector('.tower-entry').getBoundingClientRect().width"
+    page = new_page(browser, 1440)
+    requests = []
+    page.on("request", lambda request: requests.append(request.url))
+    page.goto(base, wait_until="load")
+    page.wait_for_timeout(1500)
+    expect(page.evaluate(box) <= 1, "'Build it yourself' is out of sight at rest")
+    expect(not any("/js/tower/" in url for url in requests), "nobody downloads the game before asking for it")
+    page.locator(".tower .motion-toggle").focus()
+    press_tab(page)
+    expect(page.evaluate("document.activeElement.className") == "tower-entry", "Tab goes from pause to 'Build it yourself'")
+    expect(page.locator(".tower .motion-toggle").is_visible() and page.evaluate(box) > 100,
+           "keyboard focus shows both buttons")
+    page.keyboard.press("Enter")
+    page.wait_for_function("document.querySelector('#tower-game')?.open === true", timeout=20000)
+    expect(any("/js/tower/game.bundle.js" in url for url in requests), "pressing the button loads the game")
+    expect(not any("/js/tower/physics" in url for url in requests), "the physics waits for the first wobble warning")
+    page.keyboard.press("Escape")
+    page.keyboard.press("Escape")
+    page.wait_for_function("document.querySelector('#tower-game')?.open === false")
+    page.context.close()
+
+    # A first tap exactly where the button will appear reveals it. It must not open the game.
+    page = new_page(browser, 390)
+    requests = []
+    page.on("request", lambda request: requests.append(request.url))
+    page.goto(base, wait_until="load")
+    page.wait_for_timeout(1500)
+    page.locator(".tower").scroll_into_view_if_needed()
+    expect(page.evaluate(box) <= 1, "'Build it yourself' stays out of sight on a phone until a tap")
+    at = page.evaluate("""() => {
+      const figure = document.querySelector('.tower');
+      figure.classList.add('show-motion-control');
+      const b = document.querySelector('.tower-entry').getBoundingClientRect();
+      figure.classList.remove('show-motion-control');
+      return {x: b.x + b.width / 2, y: b.y + b.height / 2, height: b.height};
+    }""")
+    expect(at["height"] >= 44, f"'Build it yourself' is {at['height']:.0f} px tall on a phone, limit 44")
+    page.touchscreen.tap(at["x"], at["y"])
+    page.wait_for_timeout(600)
+    expect(not any("/js/tower/" in url for url in requests), "a tap on the hidden button's spot does not start the game")
+    expect(page.evaluate(box) <= 1, "that tap does not reveal the button either")
+    page.locator(".castle-stage").tap()
+    page.wait_for_timeout(500)
+    expect(page.evaluate(box) > 100, "a tap on the tower reveals the button")
+    page.touchscreen.tap(at["x"], at["y"])
+    page.wait_for_function("document.querySelector('#tower-game')?.open === true", timeout=20000)
+    page.context.close()
+
+    page = new_page(browser, 1440)
+    page.add_init_script("""
+      const getContext = HTMLCanvasElement.prototype.getContext;
+      HTMLCanvasElement.prototype.getContext = function (type, ...rest) {
+        return /webgl/.test(type) ? null : getContext.call(this, type, ...rest);
+      };
+    """)
+    page.goto(base, wait_until="load")
+    page.hover(".castle-stage")
+    expect(not page.locator(".tower-entry").is_visible(), "without WebGL the game is not offered")
+    page.context.close()
+
+
+def check_phone_reading(browser, base, failures):
+    """On a phone the chat launcher is a small button in the bottom corner, and an embed's panel is not clipped."""
+    expect = expectation(failures, "phone reading")
+    page = new_page(browser, 390)
+    page.goto(base + "glossary/english/abstract_bias/", wait_until="load")
+    page.wait_for_timeout(300)
+    page.evaluate("scrollBy(0, 500)")
+    page.wait_for_timeout(500)
+    box = page.evaluate("(() => { const r = document.getElementById('just-os-btn').getBoundingClientRect();"
+                        " const banner = parseFloat(getComputedStyle(document.documentElement).getPropertyValue('--banner')) || 0;"
+                        " return {w: r.width, h: r.height, right: innerWidth - r.right, bottom: innerHeight - r.bottom - banner}; })()")
+    # It rises above the cookie banner while that shows (--banner), so the corner is measured from the banner.
+    expect(0 < box["w"] <= 64 and box["h"] > 0 and 0 <= box["right"] <= 24 and 0 <= box["bottom"] <= 40,
+           f"the launcher is a button of at most 64 px in the bottom corner ({box['w']:.0f} px wide, "
+           f"{box['right']:.0f} px from the side, {box['bottom']:.0f} px from the bottom)")
+    page.locator("#just-os-btn").tap()
+    page.wait_for_timeout(3000)
+    expect(page.evaluate("document.getElementById('just-os-window')?.style.display === 'flex'"), "tapping the launcher opens the chat")
+    page.goto(base + "neurodiversity-lessonbank/implicit_bias/", wait_until="load")
+    page.wait_for_timeout(300)
+    panels = page.locator(".click-to-load").count()
+    expect(panels > 0, f"the lesson page has embed panels ({panels})")
+    clipped = page.evaluate("""[...document.querySelectorAll('.click-to-load')].filter((panel) =>
+      panel.parentElement && getComputedStyle(panel.parentElement).overflow === 'hidden'
+      && panel.getBoundingClientRect().height > panel.parentElement.getBoundingClientRect().height + 1).length""")
+    expect(clipped == 0, f"{clipped} embed panels clipped by their box")
+    page.context.close()
+    for width in (390, 1024, 1440):
+        page = new_page(browser, width)
+        page.context.add_cookies([{"name": "forrt_analytics_choice", "value": "deny", "url": base}])  # Banner shut.
+        page.goto(base + "clusters/cluster-1/", wait_until="load")
+        page.wait_for_timeout(800)
+        page.evaluate("scrollBy(0, 1500)")
+        page.wait_for_timeout(800)
+        hit = page.evaluate("""() => {
+          const box = document.getElementById('just-os-btn').getBoundingClientRect();
+          return !!document.elementFromPoint(box.left + box.width / 2, box.top + box.height / 2)?.closest('#just-os-btn');
+        }""")
+        # When back to top shows is check_floating_controls' job (only beside the fields or clusters,
+        # so not over this page's foot at a fixed scroll); here it must not sit on the launcher.
+        clash = page.evaluate("""() => {
+          const top = document.querySelector('.clusters-back-to-top.is-visible');
+          if (!top) return false;
+          const a = top.getBoundingClientRect(), b = document.getElementById('just-os-btn').getBoundingClientRect();
+          return a.left < b.right && b.left < a.right && a.top < b.bottom && b.top < a.bottom;
+        }""")
+        expect(not clash, f"back to top does not sit on the chat launcher on a cluster page at {width} px")
+        expect(hit, f"the chat launcher can be clicked on a cluster page at {width} px")
+        if width > 760:
+            past = page.evaluate("""() => {
+              const style = getComputedStyle(document.querySelector('.clusters-sidebar-inner'));
+              return parseFloat(style.top) + parseFloat(style.maxHeight) - innerHeight;
+            }""")
+            expect(past <= 0, f"the longest side list fits the window at {width} px ({past:.0f} px past the foot)")
+            page.context.clear_cookies()
+            page.reload(wait_until="load")
+            page.wait_for_selector(".cc-window", timeout=10000)
+            page.wait_for_timeout(1200)
+            past = page.evaluate("""() => {
+              const style = getComputedStyle(document.querySelector('.clusters-sidebar-inner'));
+              const banner = document.querySelector('.cc-window').offsetHeight;
+              return parseFloat(style.top) + parseFloat(style.maxHeight) - (innerHeight - banner);
+            }""")
+            expect(past <= 0, f"it also clears the open banner at {width} px ({past:.0f} px)")
+        page.context.close()
+
+
+CLUSTERS_MAP_LAYOUT = """() => {
+  const art = document.querySelector('.clusters-map__art');
+  if (!art) return {missing: true};
+  const boxes = [...art.querySelectorAll('.clusters-map__pill, .clusters-map__label')].map((link) => {
+    const rect = link.querySelector('rect').getBBox();
+    const pad = link.classList.contains('clusters-map__pill') ? 14 : 16;  // padX and lpadX in map.html
+    const over = [...link.querySelectorAll('tspan')].filter((t) => t.getComputedTextLength() > rect.width - 2 * pad + 0.5);
+    return {rect, own: link.closest('g'), label: link.classList.contains('clusters-map__label'),
+      text: link.textContent.trim().slice(0, 40),
+      over: over.map((t) => `${t.textContent} (${t.getComputedTextLength().toFixed(1)} in ${(rect.width - 2 * pad).toFixed(1)})`)};
+  });
+  const meets = (a, b, gap) => a.x < b.x + b.width + gap && b.x < a.x + a.width + gap && a.y < b.y + b.height + gap && b.y < a.y + a.height + gap;
+  const overlaps = [];
+  boxes.forEach((a, i) => boxes.slice(i + 1).forEach((b) => { if (meets(a.rect, b.rect, 4)) overlaps.push(a.text + ' / ' + b.text); }));
+  const crossings = [];
+  art.querySelectorAll('.clusters-map__line').forEach((line) => {
+    const own = boxes.find((b) => b.label && b.own === line.closest('g'));
+    for (let at = 0; at < line.getTotalLength(); at += 3) {
+      const p = line.getPointAtLength(at);
+      const inside = (r, gap) => p.x >= r.x - gap && p.x <= r.x + r.width + gap && p.y >= r.y - gap && p.y <= r.y + r.height + gap;
+      if (own && inside(own.rect, 0)) break;
+      const hit = boxes.find((b) => b !== own && inside(b.rect, 3));
+      if (hit) { crossings.push(own.text + ' crosses ' + hit.text); break; }
+    }
+  });
+  const list = document.querySelector('.clusters-map__list > ol');
+  return {overflow: boxes.filter((b) => b.over.length).map((b) => b.over[0]), overlaps, crossings,
+    fonts: [...document.fonts].filter((f) => f.status === 'loaded').map((f) => `${f.family} ${f.weight}`),
+    pills: boxes.filter((b) => !b.label).length, labels: boxes.filter((b) => b.label).length,
+    listed: list ? [list.children.length, list.querySelectorAll('ul > li').length] : [0, 0]};
+}"""
+
+CLUSTERS_MAP_PHONE = """() => {
+  const shown = (el) => !!el && el.getClientRects().length > 0;
+  return {frame: shown(document.querySelector('.clusters-map__frame')),
+    hub: shown(document.querySelector('.clusters-map__hub')),
+    chips: [...document.querySelectorAll('.clusters-map__chips a')].filter(shown).length,
+    clusters: document.querySelectorAll('.clusters-map__list > ol > li').length};
+}"""
+
+
+def check_clusters_map(browser, base, failures):
+    """The /clusters/ illustration, laid out at build time: text fits its pill, nothing overlaps,
+    and no line runs through another box. Rerun when the Clusters Doc changes."""
+    expect = expectation(failures, "clusters map")
+    page = new_page(browser, 1440)
+    page.goto(base + "clusters/", wait_until="load")
+    page.evaluate("document.fonts.ready")
+    found = page.evaluate(CLUSTERS_MAP_LAYOUT)
+    expect(not found.get("missing"), "/clusters/ has the illustration")
+    if not found.get("missing"):
+        print(f"  {found['labels']} cluster labels, {found['pills']} sub-cluster pills; fonts loaded: {found['fonts']}")
+        listed = lambda items: f": {items[:3]}" if items else ""
+        expect(not found["overflow"], "text fits its pill or label" + listed(found["overflow"]))
+        expect(not found["overlaps"], "no pill or label overlaps another" + listed(found["overlaps"]))
+        expect(not found["crossings"], "no line runs through a pill or label" + listed(found["crossings"]))
+        expect(found["listed"][0] > 0 and [found["labels"], found["pills"]] == found["listed"],
+               f"the drawing has every cluster and sub-cluster in the list ({found['listed']})")
+    page.context.close()
+    page = new_page(browser, 390)
+    page.goto(base + "clusters/", wait_until="load")
+    phone = page.evaluate(CLUSTERS_MAP_PHONE)
+    expect(not phone["frame"] and phone["hub"], "at 390 px the hub shows instead of the full drawing")
+    expect(phone["clusters"] > 0 and phone["chips"] == phone["clusters"],
+           f"at 390 px every cluster has a label ({phone['chips']} of {phone['clusters']})")
+    page.context.close()
+
+
+SPECIALIST_SHOWN = """() => {
+  const cards = [...document.querySelectorAll('.clusters-content [data-specificity=narrow]')];
+  return [cards.length, cards.filter((card) => getComputedStyle(card).display !== 'none').length];
+}"""
+
+
+def check_specialist_cards(browser, base, failures):
+    """A cluster page hides its specialist resources until their checkbox is ticked, as the box shows."""
+    expect = expectation(failures, "specialist resources")
+    page = new_page(browser, 1440)
+    page.context.add_cookies([{"name": "forrt_analytics_choice", "value": "deny", "url": base}])  # Banner shut.
+    for number in range(1, 12):
+        page.goto(base + f"clusters/cluster-{number}/", wait_until="load")
+        page.wait_for_timeout(500)
+        total, shown = page.evaluate(SPECIALIST_SHOWN)
+        if total:
+            break
+    expect(total > 0, "a cluster page has specialist resources to test")
+    if total:
+        box = page.locator("#fr-global-specificity-checkbox")
+        expect(not box.is_checked(), f"cluster {number}: the box starts unticked")
+        expect(shown == 0, f"cluster {number}: {shown} of {total} specialist resources shown on load")
+        box.check()
+        page.wait_for_timeout(200)
+        shown = page.evaluate(SPECIALIST_SHOWN)[1]
+        expect(shown == total, f"cluster {number}: {shown} of {total} shown after ticking the box")
+        box.uncheck()
+        page.wait_for_timeout(200)
+        shown = page.evaluate(SPECIALIST_SHOWN)[1]
+        expect(shown == 0, f"cluster {number}: {shown} of {total} still shown after unticking it")
+    page.context.close()
+
+
+# What of the page's own a floating control covers: text, a control, an image or a card (anything with its own
+# background, shadow or side borders that does not span the screen; a rule along one edge is not a card). Each overlap is confirmed by hit testing,
+# so that content scrolled out of its box or under another layer does not count. It is independent of
+# site.js's own test for empty space, and a control counts as covering only while it is shown.
+FLOATING_OVER = """(selector) => {
+  const floating = document.querySelector(selector);
+  if (!floating) return [];
+  const own = floating.closest('#just-os-widget') || floating;
+  const style = getComputedStyle(floating);
+  const rect = floating.getBoundingClientRect();
+  // A focus ring drawn outside the box covers the page as much as the box does.
+  const ring = style.outlineStyle !== 'none' ? Math.max(0, parseFloat(style.outlineWidth) + parseFloat(style.outlineOffset)) : 0;
+  const box = {left: rect.left - ring, right: rect.right + ring, top: rect.top - ring, bottom: rect.bottom + ring,
+               width: rect.width + 2 * ring, height: rect.height + 2 * ring};
+  if (style.visibility === 'hidden' || parseFloat(style.opacity) < 0.5 || !box.width || !box.height) return [];
+  const meets = (r) => r.width > 0 && r.height > 0 && r.left < box.right - 0.5 && box.left < r.right - 0.5 && r.top < box.bottom - 0.5 && box.top < r.bottom - 0.5;
+  const shown = (el, r) => {
+    const left = Math.max(r.left, box.left), right = Math.min(r.right, box.right);
+    const top = Math.max(r.top, box.top), bottom = Math.min(r.bottom, box.bottom);
+    for (const fx of [0.2, 0.5, 0.8]) for (const fy of [0.2, 0.5, 0.8]) {
+      const hit = document.elementsFromPoint(left + (right - left) * fx, top + (bottom - top) * fy).find((e) => !own.contains(e));
+      if (hit && (hit === el || el.contains(hit))) return true;
+    }
+    return false;
+  };
+  const name = (el) => el.tagName.toLowerCase() + (el.id ? '#' + el.id : el.classList[0] ? '.' + el.classList[0] : '');
+  const found = new Set();
+  const screen = document.documentElement.clientWidth;
+  const range = document.createRange();
+  const walker = document.createTreeWalker(document.body, NodeFilter.SHOW_TEXT);
+  for (let node = walker.nextNode(); node; node = walker.nextNode()) {
+    const parent = node.parentElement;
+    if (!node.data.trim() || !parent || own.contains(parent) || !meets(parent.getBoundingClientRect())) continue;
+    range.selectNodeContents(node);
+    if ([...range.getClientRects()].some((r) => meets(r) && shown(parent, r))) found.add(`text "${node.data.trim().slice(0, 30)}"`);
+  }
+  for (const el of document.body.querySelectorAll('*')) {
+    if (own.contains(el) || el.contains(own)) continue;
+    const r = el.getBoundingClientRect();
+    if (!meets(r)) continue;
+    const control = el.matches('a[href],button,input,select,textarea,summary,[role=button],[tabindex]:not([tabindex="-1"]),img,svg,video,iframe,canvas');
+    const look = getComputedStyle(el);
+    const painted = look.backgroundColor !== 'rgba(0, 0, 0, 0)' || look.backgroundImage !== 'none' || look.boxShadow !== 'none'
+      || ['Left', 'Right'].every((side) => look[`border${side}Style`] !== 'none' && parseFloat(look[`border${side}Width`]));
+    const card = painted && (r.left > 1 || r.right < screen - 1);
+    if ((control || card) && shown(el, r)) found.add(`${control ? 'control' : 'card'} ${name(el)}`);
+  }
+  return [...found];
+}"""
+
+BUBBLE_SHOWN = "() => parseFloat(getComputedStyle(document.getElementById('just-os-bubble')).opacity) >= 0.5"
+BACK_TO_TOP_SHOWN = """() => { const el = document.querySelector('.clusters-back-to-top');
+  return !!el && getComputedStyle(el).visibility === 'visible' && el.getBoundingClientRect().width > 0; }"""
+
+# Where the floating controls are checked: long pages of text, cards and lists, the pages with back to top,
+# and a page on the reading layout, whose empty margin the invitation may use.
+FLOATING_PAGES = ("contributors/", "citation-politics/toolkit/", "disciplines/", "clusters/", "clusters/cluster-1/",
+                  "publications/", "about/teams/", "about/", "contributor-analysis/")
+FLOATING_WIDTHS = (390, 1024, 1280, 1440, 1800)  # From 1800 px the launcher has its hover and focus label.
+
+
+def check_floating_controls(browser, base, failures):
+    """The chat launcher, its invitation and label, and back to top cover nothing of the page, wherever it is scrolled.
+    Below 1440 px the launcher and back to top float in the bottom corner, so mid-page they need only keep off each
+    other; at the end of the page, which the footer pads for them, they still cover nothing.
+
+    The launcher is checked closed, hovered, focused from the keyboard and inviting (on a fake clock, so that its
+    ten-second cycle runs at once), at the top, a third and two thirds of the way down, and at the end of each page.
+    The disciplines page has a field open, cluster 1 has every sub-cluster open, and the clusters page on a phone has its navigation drawer open at the end.
+    The invitation is to stay (decision D19), so it must also show somewhere, and back to top must show beside
+    the fields or clusters and hide while the drawer is open.
+    """
+    expect = expectation(failures, "floating controls")
+    invited = set()
+    for width in FLOATING_WIDTHS:
+        page = new_page(browser, width)
+        page.context.add_cookies([{"name": "forrt_analytics_choice", "value": "deny", "url": base}])  # Banner shut.
+        page.clock.install()
+        for path in FLOATING_PAGES:
+            covered = {}
+
+            def look(state, selector="#just-os-bubble", floating=False):
+                for item in page.evaluate(FLOATING_OVER, selector):
+                    # Below 1440 px the chat button and back to top float over the page as it scrolls by;
+                    # there they must only keep off each other, and cover nothing once the page is at its end.
+                    if floating and not re.search(r"just-os|back-to-top", item):
+                        continue
+                    covered.setdefault(state, []).append(item)
+                if state.startswith("invitation") and page.evaluate(BUBBLE_SHOWN):
+                    invited.add(f"{path} at {width} px")
+
+            back_to_top = False
+            page.goto(base + path, wait_until="load", timeout=120000)
+            page.wait_for_timeout(300)
+            if path == "disciplines/":
+                page.locator(".acc-trigger", has_text="Psychology").first.click()
+            if path == "clusters/cluster-1/":
+                page.locator(".acc-toggle-all").first.click()  # Every sub-cluster open: the page a reader scrolls.
+            page.clock.run_for(10500)  # The invitation's first turn, at the top of the page.
+            page.wait_for_timeout(400)
+            look("invitation at the top")
+            end = page.evaluate("document.documentElement.scrollHeight - innerHeight")
+            for y in sorted({0, end // 3, 2 * end // 3, end}):
+                where = f"scrolled {y} px"
+                page.mouse.move(1, 1)
+                page.evaluate(f"scrollTo(0, {y}); dispatchEvent(new Event('scroll'))")
+                page.wait_for_timeout(400)
+                floating = width < 1440 and y != end
+                look(f"launcher at {where}", "#just-os-btn", floating)
+                look(f"back to top at {where}", ".clusters-back-to-top", floating)
+                back_to_top = back_to_top or page.evaluate(BACK_TO_TOP_SHOWN)
+                for turn in range(2):  # One of two turns of its cycle shows the invitation, where it may show.
+                    page.clock.run_for(10000)
+                    page.wait_for_timeout(400)
+                    look(f"invitation at {where}")
+                page.hover("#just-os-btn")
+                page.wait_for_timeout(400)
+                look(f"hover label at {where}")
+                page.mouse.move(1, 1)
+                page.keyboard.press("Tab")  # Keyboard use first, so that the launcher's focus shows as it would.
+                page.focus("#just-os-btn")
+                page.wait_for_timeout(400)
+                look(f"focus label at {where}")
+                page.evaluate("document.activeElement.blur()")
+            if path == "clusters/" and width < 992:
+                toggle = page.locator("#clusters-mobile-toggle")
+                toggle.scroll_into_view_if_needed()
+                toggle.click()
+                page.evaluate("scrollBy(0, 600)")
+                page.wait_for_timeout(400)
+                look("back to top over the open drawer", ".clusters-back-to-top")
+                look("launcher over the open drawer", "#just-os-btn")
+                expect(not page.evaluate(BACK_TO_TOP_SHOWN), f"{path} at {width} px: back to top hides while the drawer is open")
+            if path in ("disciplines/", "clusters/", "clusters/cluster-1/"):
+                expect(back_to_top, f"{path} at {width} px: back to top shows beside the fields or clusters")
+            for state, items in covered.items():
+                expect(False, f"{path} at {width} px, {state}: covers {', '.join(sorted(set(items))[:3])}")
+            if not covered:
+                expect(True, f"{path} at {width} px covers nothing")
+        page.context.close()
+    expect(invited, f"the invitation shows where there is room for it ({', '.join(sorted(invited)[:3]) or 'nowhere'})")
+
+
+# Pages of cards or lists, with the element that holds them: a wide screen is not to leave them in the reading column.
+DIRECTORIES = {
+    "publications/": ".pub-list",
+    "about/partnerships/": ".partner-list",
+    "contributors/": "#contributor-list",
+    "about/community/": ".people-wall",
+    "about/teams/": ".feature-rows",
+    "educators-corner/": ".list-items",
+    "pedagogies/": ".list-items",
+    "forrt_clusters/academic-life-and-culture/": ".cluster-resources",
+    "syllabus/": ".catalogue",
+    "neurodiversity-lessonbank/": ".lesson-grid",
+    "citation-politics/toolkit/": ".cpt-items",
+}
+# Tool pages lead with their tool: the main action is in the first view, above the page's own text.
+TOOL_PAGES = ("awop/", "citation-politics/", "replication-hub/flora/", "nowherelab/")
+DIRECTORY_MIN_WIDTH = 900
+FIRST_VIEW_IMAGE_LIMIT = 0.3
+CHART_WIDTH_LIMIT = 340
+WHEEL_WIDTH_LIMIT = 420
+TOOLKIT_SEARCH = """async () => {
+  const input = document.querySelector('#cpt-search-input');
+  const shown = () => [...document.querySelectorAll('[data-cpt-item]')].filter((el) => el.getClientRects().length).length;
+  const type = (value) => { input.value = value; input.dispatchEvent(new Event('input')); };
+  const before = shown();
+  type('zzqx');
+  const none = shown(), empty = document.querySelector('.cpt-result').classList.contains('is-empty') && Boolean(document.querySelector('.cpt-clear').getClientRects().length);
+  type('gender');
+  const some = shown();
+  type('zzqx');
+  document.querySelector('.cpt-clear').click();
+  return {before, none, empty, some, after: shown(), cleared: input.value === ''};
+}"""
+
+
+def check_directory_widths(browser, base, failures):
+    """At 1440 px directories use the width, the chart on Publications and the toolkit's wheel do not take over
+    the first view, and the toolkit's search empties, narrows and restores its entries."""
+    expect = expectation(failures, "directory widths")
+    page = new_page(browser, 1440)
+    page.context.add_cookies([{"name": "forrt_analytics_choice", "value": "deny", "url": base}])  # Banner shut.
+    for path, selector in DIRECTORIES.items():
+        page.goto(base + path, wait_until="load")
+        width = page.evaluate("(s) => document.querySelector(s)?.getBoundingClientRect().width || 0", selector)
+        expect(width >= DIRECTORY_MIN_WIDTH, f"{path}: {selector} is {width:.0f} px wide, at least {DIRECTORY_MIN_WIDTH}")
+    for path in TOOL_PAGES:
+        page.goto(base + path, wait_until="load")
+        page.evaluate("document.fonts.ready.then(() => null)")
+        bottom = page.evaluate("document.querySelector('.page-actions .btn-primary')?.getBoundingClientRect().bottom ?? Infinity")
+        expect(bottom <= page.viewport_size["height"], f"{path}: the main action ends {bottom:.0f} px down, within the first view")
+    page.goto(base + "post/2026-01-newsletter/", wait_until="load")
+    order = page.evaluate("""() => {
+      const link = [...document.querySelectorAll('.article-style a')].find((a) => /newsletter/i.test(a.textContent));
+      const image = document.querySelector('.reading .article-image');
+      return !!link && !!image && !!(link.compareDocumentPosition(image) & Node.DOCUMENT_POSITION_FOLLOWING);
+    }""")
+    expect(order, "a short news post keeps its image, after its link")
+    page.goto(base + "publications/", wait_until="load")
+    chart_width, share = page.evaluate("""() => {
+      const box = document.querySelector('.citation-container img').getBoundingClientRect();
+      const seen = Math.max(0, Math.min(box.bottom, innerHeight) - Math.max(box.top, 0));
+      return [box.width, seen * box.width / (innerWidth * innerHeight)];
+    }""")
+    expect(chart_width <= CHART_WIDTH_LIMIT, f"the citation chart is {chart_width:.0f} px wide, limit {CHART_WIDTH_LIMIT}")
+    expect(share <= FIRST_VIEW_IMAGE_LIMIT, f"the citation chart takes {share:.0%} of the first view, limit {FIRST_VIEW_IMAGE_LIMIT:.0%}")
+    page.goto(base + "citation-politics/toolkit/", wait_until="load")
+    wheel_width, share = page.evaluate("""() => {
+      const box = document.querySelector('.cpt-wheel img').getBoundingClientRect();
+      const seen = Math.max(0, Math.min(box.bottom, innerHeight) - Math.max(box.top, 0));
+      return [box.width, seen * box.width / (innerWidth * innerHeight)];
+    }""")
+    expect(wheel_width <= WHEEL_WIDTH_LIMIT, f"the toolkit's wheel is {wheel_width:.0f} px wide, limit {WHEEL_WIDTH_LIMIT}")
+    expect(share <= FIRST_VIEW_IMAGE_LIMIT, f"the toolkit's wheel takes {share:.0%} of the first view, limit {FIRST_VIEW_IMAGE_LIMIT:.0%}")
+    found = page.evaluate(TOOLKIT_SEARCH)
+    expect(found["before"] > 0 and found["none"] == 0 and found["empty"], f"a toolkit search with no match hides every entry and says so: {found}")
+    expect(0 < found["some"] < found["before"], f"a toolkit search for 'gender' narrows the entries: {found}")
+    expect(found["after"] == found["before"] and found["cleared"], f"clearing the toolkit search shows every entry again: {found}")
+    page.goto(base + "just_os_chatbot/", wait_until="load")
+    page.wait_for_selector(".just-os-input")
+    bottom = page.evaluate("document.querySelector('.just-os-input').getBoundingClientRect().bottom - innerHeight")
+    expect(bottom <= 0, f"the chatbot page's input ends {bottom:.0f} px below the first view")
+    page.goto(base + "booklet/", wait_until="load")
+    frame = page.evaluate("(() => { const box = document.querySelector('._df_book').getBoundingClientRect(); return box.width / box.height; })()")
+    expect(frame <= 1.4, f"the booklet's frame is {frame:.2f} times as wide as it is high, so a spread would be clipped; limit 1.4")
+    page.goto(base + "about/steering-committee/", wait_until="load")
+    tops = page.evaluate("[...document.querySelectorAll('.sc-team')].map((team) => Math.round(team.getBoundingClientRect().top))")
+    expect(len(set(tops)) < len(tops), "no small Steering Committee team sits beside another")
+    page.context.close()
+
+
+def check_directory(browser, base, failures):
+    expect = expectation(failures, "directory")
+    topics = new_page(browser, 1440)
+    topics.goto(base, wait_until="load")
+    wanted = topics.evaluate("[...document.querySelectorAll('.topic')].map(a => new URL(a.href).searchParams.get('cluster'))")
+    topics.goto(base + "resources/", wait_until="load")
+    known = topics.evaluate("[...document.querySelectorAll('.facet[data-facet=cluster] .chip')].map(c => c.dataset.value)")
+    expect(wanted and set(wanted) <= set(known), f"every topic button names a real cluster: {sorted(set(wanted) - set(known))}")
+    topics.context.close()
+    page = new_page(browser, 1440)
+    requests = []
+    page.on("request", lambda request: requests.append(request.url))
+    page.goto(base + "resources/", wait_until="load")
+    page.wait_for_function("document.querySelector('.chip') !== null")
+    page.wait_for_timeout(500)
+    expect(page.locator(".res").count() == 24, "the first page has 24 cards as HTML")
+    expect(not any("search.json" in url for url in requests), "search data waits for the first search")
+    total = int(page.get_attribute("#directory", "data-total"))
+    pager = page.locator("#pager")
+    expect(pager.is_visible(), "the page links show when nothing is chosen")
+
+    page.click('.facet[data-facet=cluster] .chip[data-value=pre-analysis-planning]')
+    page.wait_for_function("location.search.includes('cluster=pre-analysis-planning')")
+    count = page.text_content("#resultCount")
+    expect("matching" in count, f"choosing a cluster filters the list: {count}")
+    expect(not pager.is_visible(), "the page links hide while filtering")
+    first = page.text_content(".res-title")
+    page.click("#clientPager a[rel=next]")
+    expect(page.text_content(".res-title") != first and "page=2" in page.url, f"the filtered list's page links turn the page: {page.url}")
+    expect(page.evaluate("document.activeElement.closest('.res') !== null"), "a page link moves focus to the new cards")
+    page.go_back()
+    page.wait_for_function("!location.search.includes('page=')")
+    expect(page.text_content(".res-title") == first, "Back returns to the first page of results")
+    page.select_option("#sortOrder", "newest")
+    page.wait_for_function("location.search.includes('sort=newest')")
+    expect("newest first" in page.text_content("#resultCount"), "Newest added re-sorts and says so")
+    page.select_option("#perPage", "48")
+    page.wait_for_function("location.search.includes('per=48')")
+    matches = int(re.search(r"of ([\d,]+)", page.text_content("#resultCount")).group(1).replace(",", ""))
+    expect(page.locator(".res").count() == min(48, matches), f"Per page sets the page size: {page.text_content('#resultCount')}")
+    page.select_option("#sortOrder", "title")
+    page.select_option("#perPage", "24")
+
+    address = page.url
+    fresh = new_page(browser, 390)
+    fresh.goto(address, wait_until="load")
+    fresh.wait_for_function("document.getElementById('resultCount').textContent.includes('matching')", timeout=30000)
+    expect(fresh.get_attribute('.chip[data-value=pre-analysis-planning]', "aria-pressed") == "true", "a shared address restores the filter")
+    fresh.goto(base + "resources/?search=replication", wait_until="load")
+    fresh.wait_for_function("document.getElementById('resultCount').textContent.includes('matching')", timeout=30000)
+    expect(fresh.input_value("#resource-search") == "replication", "a shared address restores the search")
+    expect(not fresh.locator("#search").is_visible(), "the site search overlay stays shut")
+    fresh.context.close()
+
+    page.fill("#resource-search", "zzzzqqqq")
+    page.wait_for_function("!document.getElementById('empty').hidden")
+    expect(page.locator("#empty").is_visible(), "no matches shows the empty message")
+    page.click("#emptyReset")
+    page.wait_for_function("location.search === ''")
+    expect(page.locator(".res").count() == 24, "reset brings back the first page")
+    expect(total == int(page.get_attribute("#directory", "data-total")), "the total stays the same")
+
+    # Search reaches fields beyond the title, once the fuller data has arrived.
+    page.fill("#resource-search", "ioannidis")
+    page.wait_for_function("document.getElementById('resultCount').textContent.includes('matching')")
+    page.wait_for_timeout(2500)
+    expect(any("search.json" in url for url in requests), "the first search fetches the search data")
+    hits = page.text_content("#resultCount")
+    titles = page.evaluate("[...document.querySelectorAll('.res-title')].map(t => t.textContent.toLowerCase())")
+    expect(any("ioannidis" not in title for title in titles), f"search finds authors, not only titles: {hits}")
+    page.context.close()
+
+    # The pages reach the whole collection without JavaScript.
+    plain = browser.new_context(java_script_enabled=False).new_page()
+    plain.route("**/*", lambda route: route.abort() if BLOCK.search(route.request.url) else route.continue_())
+    plain.goto(base + "resources/", wait_until="load")
+    plain.locator("#pager a[aria-label]").last.click()
+    plain.wait_for_load_state("load")
+    seen_last = plain.locator(".res").count()
+    expect(seen_last >= 1, f"the last page of results opens without JavaScript, with {seen_last} cards")
+    plain.context.close()
+
+
+NETWORK_PATH = "contributor-analysis/"
+NETWORK_MIN_SPAN = 0.65
+NETWORK_MAX_LEAN = 0.2
+NETWORK_MIN_CORE = 0.28
+CHARTS_ENLARGED = """() => {
+  const clashes = [];
+  for (const row of document.querySelectorAll('.bar,.share-list li')) {
+    const parts = [...row.children].filter((part) => part.textContent.trim()).map((part) => [part, part.getBoundingClientRect()]);
+    parts.forEach(([a, x], i) => parts.slice(i + 1).forEach(([b, y]) => {
+      if (x.left < y.right - 1 && y.left < x.right - 1 && x.top < y.bottom - 1 && y.top < x.bottom - 1) clashes.push(a.textContent + ' / ' + b.textContent);
+    }));
+  }
+  const width = (selector) => Math.min(...[...document.querySelectorAll(selector)].map((el) => el.getBoundingClientRect().width));
+  return {bars: document.querySelectorAll('.bar').length, bar: width('.bar-track'), label: width('.share-label'), clashes};
+}"""
+NETWORK_INK = """() => {
+  const canvas = document.querySelector('[data-network-canvas]');
+  const {width, height} = canvas;
+  const pixels = canvas.getContext('2d').getImageData(0, 0, width, height).data;
+  let left = width, right = -1, top = height, bottom = -1, solid = 0;
+  const columns = new Array(width).fill(0);
+  const rows = new Array(height).fill(0);
+  for (let y = 0; y < height; y += 1) {
+    for (let x = 0; x < width; x += 1) {
+      if (pixels[(y * width + x) * 4 + 3] > 200) {
+        if (x < left) left = x;
+        if (x > right) right = x;
+        if (y < top) top = y;
+        if (y > bottom) bottom = y;
+        columns[x] += 1;
+        rows[y] += 1;
+        solid += 1;
+      }
+    }
+  }
+  // How far the middle 80% of what is drawn spreads, which a few far-out dots cannot stretch.
+  const middle = (counts) => {
+    let seen = 0, first = 0, last = 0;
+    counts.forEach((count, i) => {
+      if (seen < solid * .1) first = i;
+      seen += count;
+      if (seen <= solid * .9) last = i;
+    });
+    return (last - first) / counts.length;
+  };
+  return {left, right, top, bottom, width, height, core_across: middle(columns), core_down: middle(rows)};
+}"""
+
+
+def framing_problems(ink):
+    """What is wrong with where the drawn network sits on its canvas, from the box its solid pixels fill."""
+    width, height = ink["width"], ink["height"]
+    if not width or not height or ink["right"] < 0:
+        return ["nothing is drawn"]
+    problems = []
+    across = (ink["right"] - ink["left"]) / width
+    down = (ink["bottom"] - ink["top"]) / height
+    if max(across, down) < NETWORK_MIN_SPAN:
+        problems.append(f"fills only {across:.0%} of the width and {down:.0%} of the height")
+    lean_x = abs(ink["left"] - (width - 1 - ink["right"])) / width
+    lean_y = abs(ink["top"] - (height - 1 - ink["bottom"])) / height
+    if max(lean_x, lean_y) > NETWORK_MAX_LEAN:
+        problems.append(f"sits off centre by {lean_x:.0%} across and {lean_y:.0%} down")
+    if ink["core_across"] < NETWORK_MIN_CORE or ink["core_down"] < NETWORK_MIN_CORE:
+        problems.append(f"bunches up: most of it spans {ink['core_across']:.0%} of the width and {ink['core_down']:.0%} of the height")
+    return problems
+
+
+def check_contributor_network(browser, base, failures):
+    """The network is framed, reaches nothing outside the site, and answers to pointer and keyboard."""
+    expect = expectation(failures, "contributor network")
+    host = urlsplit(base).netloc
+    for width, height in WIDTHS.items():
+        page = new_page(browser, width)
+        page.context.add_cookies([{"name": "forrt_analytics_choice", "value": "deny", "url": base}])
+        asked = []
+        page.on("request", lambda request: asked.append(request.url))
+        page.goto(base + NETWORK_PATH, wait_until="load")
+        page.wait_for_selector("[data-network-panel]:not([hidden])")
+        page.wait_for_timeout(300)
+        for problem in framing_problems(page.evaluate(NETWORK_INK)):
+            expect(False, f"at {width} the network {problem}")
+        outside = [url for url in asked if url.startswith("http") and urlsplit(url).netloc != host]
+        expect(not outside, f"at {width} the page asks no other site for anything: {outside[:3]}")
+        expect(page.locator("main iframe").count() == 0, f"at {width} the page embeds no iframe")
+        if width >= 1024:
+            panel = page.evaluate("document.querySelector('[data-network-panel]').getBoundingClientRect().height")
+            expect(panel <= height, f"at {width} the network panel, {panel:.0f} px high, fits a {height} px screen")
+        else:
+            touch = page.evaluate("getComputedStyle(document.querySelector('[data-network-canvas]')).touchAction")
+            expect(touch == "auto", f"at {width} the drawing leaves touch to the page: {touch}")
+            described = page.evaluate("document.querySelector('[data-network-canvas]').getAttribute('aria-describedby')")
+            expect(not described, f"at {width} the drawing does not describe controls that are hidden: {described}")
+        # An open list of matches stays on the screen, however the page has scrolled.
+        field = page.locator("#network-project")
+        field.scroll_into_view_if_needed()
+        page.evaluate("""() => {
+          const box = document.querySelector('#network-project').getBoundingClientRect();
+          scrollBy(0, box.bottom - innerHeight + 30);
+        }""")
+        page.wait_for_timeout(100)
+        field.click()
+        page.wait_for_timeout(100)
+        reach = page.evaluate("""() => {
+          const box = document.querySelector('#network-project-list').getBoundingClientRect();
+          return [box.top, box.bottom, innerHeight, box.height];
+        }""")
+        expect(reach[0] >= 0 and reach[1] <= reach[2] and reach[3] >= 120,
+               f"at {width} an open list of matches stays on the screen: {reach[0]:.0f} to {reach[1]:.0f} of {reach[2]}, {reach[3]:.0f} px high")
+        page.context.close()
+
+    page = new_page(browser, 1440)
+    page.context.add_cookies([{"name": "forrt_analytics_choice", "value": "deny", "url": base}])
+    page.goto(base + NETWORK_PATH, wait_until="load")
+    page.wait_for_selector("[data-network-panel]:not([hidden])")
+    status = page.locator("[data-network-status]")
+    canvas = page.locator("[data-network-canvas]")
+    canvas.scroll_into_view_if_needed()
+    position = "(name) => document.querySelector('[data-analysis-network]').networkPosition(name)"
+    data = page.evaluate("JSON.parse(document.getElementById('network-data').textContent)")
+    person = max(data["people"], key=lambda row: len(row[4]))[0]
+    project = data["projects"][0][0]
+    box = canvas.bounding_box()
+
+    # Filtering by keyboard: type, take the first match, take it off again.
+    page.locator("#network-project").focus()
+    page.keyboard.type(project)
+    expect(page.locator("#network-project-list").is_visible(), "typing a project opens its list")
+    page.keyboard.press("ArrowDown")
+    page.keyboard.press("Enter")
+    expect(project in status.inner_text(), f"choosing a project says so: {status.inner_text()!r}")
+    expect(page.locator(".network-chip").count() == 1, "a chosen project gets a chip")
+    expect(page.locator("[data-network-detail] .network-link").count() > 1, "a chosen project lists its people")
+    page.locator(".network-chip").click()
+    expect("Showing everyone" in status.inner_text(), "taking the chip off shows everyone again")
+    page.wait_for_timeout(400)
+
+    # Keyboard use through the text: focus lands somewhere after each rebuild, and Escape still works.
+    focused = "document.activeElement.tagName + ':' + (document.activeElement.id || document.activeElement.className)"
+    page.locator("#network-person").focus()
+    page.keyboard.type(person)
+    page.keyboard.press("Enter")
+    page.locator("[data-network-detail] .network-link:not(.network-clear)").first.focus()
+    page.keyboard.press("Enter")
+    expect(page.evaluate("document.activeElement.tagName") == "H3", f"following a link in the text moves focus to its heading: {page.evaluate(focused)}")
+    page.locator(".network-chip").first.focus()
+    page.keyboard.press("Enter")
+    expect(page.evaluate("document.activeElement.id") == "network-project", f"taking off the last chip moves focus to its search box: {page.evaluate(focused)}")
+    page.locator("#network-person").focus()
+    page.keyboard.type(person)
+    page.keyboard.press("Enter")
+    page.locator("[data-network-detail] .network-link:not(.network-clear)").first.focus()
+    page.keyboard.press("Enter")
+    page.keyboard.press("Escape")
+    expect("Showing everyone" in status.inner_text(), "Escape clears a selection reached by following a link")
+    page.wait_for_timeout(400)
+
+    # Hovering names a node, and clicking selects it.
+    point = page.evaluate(position, person)
+    page.mouse.move(box["x"] + point["x"], box["y"] + point["y"])
+    tip = page.locator("[data-network-tip]")
+    expect(tip.is_visible() and person in tip.inner_text(), f"hovering {person} names them")
+    page.keyboard.press("Escape")
+    expect(not tip.is_visible(), "Escape dismisses the name shown by hovering")
+    page.mouse.move(box["x"] + 40, box["y"] + 40)
+    page.mouse.move(box["x"] + point["x"], box["y"] + point["y"])
+    tip_box = tip.bounding_box()
+    page.mouse.move(tip_box["x"] + 5, tip_box["y"] + 5)
+    page.wait_for_timeout(500)
+    expect(tip.is_visible(), "the name stays while the pointer is on it")
+    page.mouse.move(box["x"] + point["x"], box["y"] + point["y"])
+    page.mouse.click(box["x"] + point["x"], box["y"] + point["y"])
+    expect(person in status.inner_text(), f"clicking {person} selects them: {status.inner_text()!r}")
+    expect(page.locator("[data-network-detail] h3").inner_text() == person, "the selection is described in text")
+    # With a long list beside it, an open list of matches goes with its box or shuts.
+    page.locator("#network-project").click()
+    page.locator(".network-controls").evaluate("(side) => { side.scrollTop += 250; }")
+    page.wait_for_timeout(100)
+    options = page.locator("#network-project-list")
+    gap = page.evaluate("""() => {
+      const list = document.querySelector('#network-project-list');
+      return list.hidden ? 0 : Math.abs(list.getBoundingClientRect().top - document.querySelector('#network-project').getBoundingClientRect().bottom);
+    }""")
+    expect(not options.is_visible() or gap < 12, f"a list of matches follows its box when the side panel scrolls: {gap:.0f} px")
+    page.locator("#network-person").focus()
+    page.keyboard.press("Escape")
+    page.keyboard.press("Escape")
+    canvas.focus()
+    page.wait_for_timeout(400)
+
+    # The person's search box, then the arrow keys on the drawing.
+    page.locator("#network-person").focus()
+    page.keyboard.type(person[:6])
+    page.keyboard.press("Enter")
+    expect("project" in status.inner_text() and "Showing everyone" not in status.inner_text(), "Enter takes the first match")
+    page.locator("#network-person").press("Escape")
+    expect("Showing everyone" in status.inner_text(), "Escape clears the selection")
+    page.wait_for_timeout(400)
+    canvas.focus()
+    before = page.evaluate(position, person)
+    page.keyboard.press("ArrowLeft")
+    page.wait_for_timeout(50)
+    after = page.evaluate(position, person)
+    expect(after["x"] != before["x"], "the arrow keys move the drawing")
+    page.keyboard.press("0")
+    page.wait_for_timeout(400)
+
+    # Scrolling over the drawing scrolls the page and leaves the drawing alone.
+    before = page.evaluate(position, person)
+    top = page.evaluate("scrollY")
+    page.mouse.move(box["x"] + 40, box["y"] + 40)
+    page.mouse.wheel(0, 200)
+    page.wait_for_timeout(200)
+    expect(page.evaluate("scrollY") > top, "the wheel scrolls the page over the drawing")
+    expect(page.evaluate(position, person) == before, "the wheel alone does not zoom the drawing")
+    page.context.close()
+
+    # Enlarged text keeps the charts readable as well as inside the screen.
+    for width in (390, 1024):
+        page = new_page(browser, width)
+        page.goto(base + NETWORK_PATH, wait_until="load")
+        page.evaluate("""() => {
+          const sizes = [...document.querySelectorAll('body *')].map((el) => [el, parseFloat(getComputedStyle(el).fontSize)]);
+          sizes.forEach(([el, size]) => { el.style.fontSize = size * 2 + 'px'; });
+        }""")
+        page.wait_for_timeout(100)
+        found = page.evaluate(CHARTS_ENLARGED)
+        expect(found["bar"] >= 80 or not found["bars"], f"at {width} with text at 200% the bars keep their length: {found['bar']:.0f} px")
+        expect(not found["clashes"], f"at {width} with text at 200% chart labels do not run together: {found['clashes'][:2]}")
+        expect(found["label"] >= 50 or not found["bars"], f"at {width} with text at 200% chart labels keep their width: {found['label']:.0f} px")
+        page.context.close()
+
+    # Selecting does not animate for those who ask for less motion.
+    page = new_page(browser, 1440, reduced_motion="reduce")
+    page.context.add_cookies([{"name": "forrt_analytics_choice", "value": "deny", "url": base}])
+    page.goto(base + NETWORK_PATH, wait_until="load")
+    page.wait_for_selector("[data-network-panel]:not([hidden])")
+    page.locator("#network-project").focus()
+    page.keyboard.type(project)
+    page.keyboard.press("Enter")
+    first = page.evaluate(position, person)
+    page.wait_for_timeout(400)
+    expect(page.evaluate(position, person) == first, "with reduced motion the drawing does not glide")
+    page.context.close()
+
+
+CONFERENCE = "ai-metascience/"
+CONFERENCE_MIN_WIDTH = 900
+
+
+def check_conference(browser, base, failures):
+    """The conference programme: day tabs that keep every day reachable, the width used, and the abstract dialog."""
+    expect = expectation(failures, "conference programme")
+    # Without JavaScript every day shows, so the audit reaches the days the tabs hide.
+    for width in WIDTHS:
+        page = new_page(browser, width, java_script_enabled=False)
+        page.goto(base + CONFERENCE, wait_until="load")
+        shown = page.evaluate("[...document.querySelectorAll('.am-prog-day')].filter((d) => d.getClientRects().length).length")
+        expect(shown == 3, f"without JavaScript {shown} of 3 days show at {width}")
+        found = page.evaluate(AUDIT)
+        for key in ("overflow", "contrast", "small", "long"):
+            expect(not found[key], f"without JavaScript at {width}, {key}: {found[key] if found[key] else 'none'}")
+        page.context.close()
+    page = new_page(browser, 1440)
+    page.context.add_cookies([{"name": "forrt_analytics_choice", "value": "deny", "url": base}])  # Banner shut.
+    page.goto(base + CONFERENCE, wait_until="load")
+    width = page.evaluate("document.querySelector('.am-prog').getBoundingClientRect().width")
+    expect(width >= CONFERENCE_MIN_WIDTH, f"the programme is {width:.0f} px wide, at least {CONFERENCE_MIN_WIDTH}")
+    visible = "[...document.querySelectorAll('.am-prog-day')].filter((d) => !d.hidden).map((d) => d.id)"
+    expect(page.evaluate(visible) == ["am-day-mon"], "with JavaScript only Monday shows at first")
+    if not page.locator(".am-tab[aria-selected=true]").count():
+        expect(False, "the days have tabs")
+        page.context.close()
+        return
+    page.focus(".am-tab[aria-selected=true]")
+    page.keyboard.press("ArrowRight")
+    focused = page.evaluate("document.activeElement.id")
+    expect(page.evaluate(visible) == ["am-day-tue"] and focused == "am-tab-tue", "the right arrow moves to Tuesday's tab and shows its day")
+    talk = page.locator("#am-day-tue button.am-prog-item:not(.am-prog-item-plain)").first
+    talk.focus()
+    page.keyboard.press("Enter")
+    inside = page.evaluate("document.getElementById('am-prog-dialog').open && document.getElementById('am-prog-dialog').contains(document.activeElement)")
+    expect(inside, "Enter on a talk opens its abstract with the focus inside")
+    page.keyboard.press("Escape")
+    back = page.evaluate("!document.getElementById('am-prog-dialog').open && document.activeElement.matches('#am-day-tue .am-prog-item')")
+    expect(back, "Escape closes the abstract and hands the focus back to the talk")
+    page.goto(base + CONFERENCE + "#am-day-wed", wait_until="load")
+    expect(page.evaluate(visible) == ["am-day-wed"], "a link to #am-day-wed opens on Wednesday")
+    page.wait_for_timeout(300)
+    tabs_top, cover = page.evaluate("""() => {
+      const bar = document.getElementById('navbar-main');
+      const fixed = bar && ['fixed', 'sticky'].includes(getComputedStyle(bar).position);
+      return [document.querySelector('.am-switch').getBoundingClientRect().top, fixed ? bar.getBoundingClientRect().bottom : 0];
+    }""")
+    expect(tabs_top >= max(cover, 0), f"after a link to a day its tabs are in view, {tabs_top:.0f} px from the top, below the navbar at {cover:.0f}")
+    page.context.close()
+
+
+# The explanations inside cluster and discipline panels keep to the reading measure (.article-style).
+PANEL_MEASURE = 580
+PANEL_TEXT = """() => [...document.querySelectorAll('.cluster-description, .acc-body:not(.acc-collapsed) .sc-description')]
+  .filter((el) => el.getClientRects().length).map((el) => Math.round(el.getBoundingClientRect().width))"""
+
+
+def check_review_pages(browser, base, failures):
+    """Fixes from the final design review: the abstract toggle says what it does, panel text keeps to
+    the reading measure on a wide screen, the booklet turns one page at a time on a phone whatever its
+    browser calls itself, and the community map opens on its members and can zoom out on a phone."""
+    expect = expectation(failures, "review fixes")
+    page = new_page(browser, 1440)
+    page.goto(base + "publications/", wait_until="load", timeout=120000)
+    toggle = page.locator(".btn-toggle-abstract").first
+    state = "(el) => [el.textContent.trim(), el.getAttribute('aria-expanded')]"
+    expect(toggle.evaluate(state) == ["Show Abstract", "false"], f"a closed abstract offers Show Abstract: {toggle.evaluate(state)}")
+    toggle.click()
+    expect(toggle.evaluate(state) == ["Hide Abstract", "true"], f"an open abstract offers Hide Abstract: {toggle.evaluate(state)}")
+    toggle.click()
+    expect(toggle.evaluate(state) == ["Show Abstract", "false"], "closing it again offers Show Abstract")
+    for path in ("clusters/", "disciplines/"):
+        page.goto(base + path, wait_until="load", timeout=120000)
+        page.evaluate("document.querySelectorAll('.acc-toggle-all').forEach((b) => b.click())")
+        page.wait_for_timeout(300)
+        widths = page.evaluate(PANEL_TEXT)
+        expect(widths and max(widths) <= PANEL_MEASURE, f"{path} panel text at most {PANEL_MEASURE} px wide at 1440: widest {max(widths or [0])}")
+    page.context.close()
+
+    page = new_page(browser, 390)
+    page.goto(base + "booklet/", wait_until="load", timeout=120000)
+    page.wait_for_selector(".df-ui-next:not(.df-ui-alt)", timeout=60000)
+    page.wait_for_timeout(1500)
+    page.locator(".df-ui-next:not(.df-ui-alt)").first.click()
+    page.wait_for_timeout(1500)
+    turned = page.evaluate("document.querySelector('#df_book_page_number')?.value")
+    expect(turned == "2", f"one turn of the booklet at 390 shows page 2, not a spread: page {turned}")
+    page.goto(base + "community-map/", wait_until="load", timeout=120000)
+    frame = "iframe[title='FORRT Community Map']"
+    page.locator(frame).scroll_into_view_if_needed()
+    try:
+        page.wait_for_function(f"""() => {{ const w = document.querySelector("{frame}").contentWindow;
+          const m = w && w.HTMLWidgets && w.HTMLWidgets.find('.leaflet')?.getMap(); return m && m.getMinZoom() < 2; }}""", timeout=30000)
+        ready = True
+    except PlaywrightError:
+        ready = False
+    expect(ready, "the community map is ready, with a minimum zoom below 2, within 30 s at 390")
+    if ready:
+        found = page.frame_locator(frame).locator("body").evaluate("""() => {
+          const m = HTMLWidgets.find('.leaflet').getMap(), b = m.getBounds();
+          return {span: b.getEast() - b.getWest(), zoomOut: m.getZoom() > m.getMinZoom()};
+        }""")
+        expect(found["span"] >= 300, f"the community map opens on its members from America to New Zealand at 390: {found['span']:.0f} degrees across")
+        expect(found["zoomOut"], "the community map can zoom out from its first view at 390")
+    page.context.close()
+
+
+def report_budgets(browser, base, root, subfolder):
+    from capture_pages import weigh
+
+    parts = urlsplit(base)
+    origin = f"{parts.scheme}://{parts.netloc}"
+    subfolder = "/" + subfolder.strip("/") + "/" if subfolder.strip("/") else "/"
+    for name, path, own, third in (
+        ("home", "", 550, 190),
+        ("resources", "resources/", 300, 190),
+        ("replication hub", "replication-hub/", None, 190),
+        ("article", "post/2026-01-newsletter/", None, 190),
+        ("contributor analysis", "contributor-analysis/", 360, 0),  # About 190 once a data run replaces its images.
+    ):
+        weight = weigh(browser, origin, f"{subfolder}{path}", root, subfolder)
+        own_budget = f" (budget {own})" if own else ""
+        print(
+            f"  {name}: {weight['own_kb']} KB own{own_budget}, {weight['third_party_kb']} KB third-party (budget {third}), "
+            f"{len(weight['hosts'])} hosts (budget 6), first HTML {weight['by_kind_kb'].get('document', 0)} KB"
+        )
+
+
+def check_icons(root, failures):
+    """Every Font Awesome class in the build must be in the subset, or its icon shows nothing."""
+    here = os.path.dirname(os.path.abspath(__file__))
+    with open(os.path.join(here, "..", "..", "assets", "css", "doors", "icons.css"), encoding="utf-8") as handle:
+        known = set(re.findall(r"\.(fa-[a-z0-9-]+)::before", handle.read()))
+    used = {}
+    # The class pattern and sizing modifiers are the same for pages and for scripts that add icons.
+    classes = re.compile(r"""["'](?:[^"']* )?((?:fa[srb]?|fa-solid|fa-regular|fa-brands) [^"']*)["']""")
+    icon = re.compile(r"\bfa-(?!solid\b|regular\b|brands\b|lg\b|fw\b|[0-9.]+x\b)[a-z0-9.-]+")
+
+    def scan(path, where):
+        with open(path, encoding="utf-8", errors="ignore") as handle:
+            for found in classes.findall(handle.read()):
+                for name in icon.findall(found):
+                    if name not in known:
+                        used.setdefault(name, where)
+
+    for folder in ("static/js", "assets/js/doors"):
+        for name in os.listdir(os.path.join(here, "..", "..", folder)):
+            if name.endswith(".js"):
+                scan(os.path.join(here, "..", "..", folder, name), folder)
+    for folder, _, files in os.walk(root):
+        for name in files:
+            if name.endswith(".html"):
+                scan(os.path.join(folder, name), os.path.relpath(folder, root))
+    for name, where in sorted(used.items()):
+        failures.append(f"icon {name} in {where} is missing from assets/css/doors/icons.css (build_fonts.py --icons)")
+    print(f"  {len(known)} icons in the subset, {len(used)} used but missing", flush=True)
+
+
+def check_on_request(root, failures):
+    """Video posters, forms, calendars and the newsletter embed load only when a visitor asks."""
+    pattern = re.compile(r"""i\.ytimg\.com|<iframe[^>]*\ssrc\s*=\s*["']?https?://(?:www\.)?(?:youtube|youtube-nocookie|calendar\.google|docs\.google)"""
+                         r"""|<script[^>]*\ssrc\s*=\s*["']?https?://eocampaign1\.com|fonts\.(?:googleapis|gstatic)\.com|googletagmanager\.com/gtag/js\?id=G-""", re.I)
+    found = []
+    for folder, _, files in os.walk(root):
+        if "index.html" in files and os.path.relpath(folder, root) != "admin":
+            with open(os.path.join(folder, "index.html"), encoding="utf-8", errors="ignore") as handle:
+                match = pattern.search(handle.read())
+            if match:
+                found.append((os.path.relpath(folder, root), match.group(0)[:60]))
+    for where, what in found[:10]:
+        failures.append(f"/{where}/ loads {what} before anyone asks")
+    print(f"  pages loading these before anyone asks: {len(found)}", flush=True)
+
+
+def check_no_theme(root, failures):
+    """No page loads the theme's stylesheet, Font Awesome's CDN sheet or jQuery from the CDN."""
+    found = {}
+    for folder, _, files in os.walk(root):
+        if "index.html" in files:
+            with open(os.path.join(folder, "index.html"), encoding="utf-8", errors="ignore") as handle:
+                text = handle.read()
+            for pattern, label in ((r"css/academic\.", "stylesheet"), (r"font-awesome/", "Font Awesome"), (r"ajax/libs/jquery/", "jQuery")):
+                if re.search(pattern, text):
+                    found.setdefault(label, os.path.relpath(folder, root))
+    for mark, where in found.items():
+        failures.append(f"/{where}/ still loads the theme's {mark}")
+    print(f"  pages still loading theme assets: {len(found)} kinds", flush=True)
+
+
+def main():
+    parser = argparse.ArgumentParser(description=__doc__)
+    parser.add_argument("public", nargs="?")
+    parser.add_argument("--url")
+    parser.add_argument("--base", default="/", help="subfolder the build expects to be served from")
+    parser.add_argument("--browser", default="chromium", choices=("chromium", "firefox", "webkit"),
+                        help="engine to run in; the throttled layout-shift test and the budgets need Chromium")
+    args = parser.parse_args()
+    base = args.url.rstrip("/") + "/" if args.url else serve(os.path.abspath(args.public), args.base)
+    failures = []
+    if args.public:
+        print("Icons")
+        check_icons(os.path.abspath(args.public), failures)
+        print("Theme assets")
+        check_no_theme(os.path.abspath(args.public), failures)
+        print("Embeds load on request")
+        check_on_request(os.path.abspath(args.public), failures)
+    with sync_playwright() as playwright:
+        browser = getattr(playwright, args.browser).launch()
+        print("Screens")
+        check_screens(browser, base, failures)
+        print("Breakpoints and enlarged text")
+        check_other_widths(browser, base, failures)
+        if args.public:
+            print("Every article page")
+            check_articles(browser, base, os.path.abspath(args.public), failures)
+            print("Call-outs")
+            check_callouts(browser, base, os.path.abspath(args.public), failures)
+        print("Sample pages")
+        check_samples(browser, base, failures)
+        print("Home page")
+        check_home(browser, base, failures)
+        print("Reading on a phone")
+        check_phone_reading(browser, base, failures)
+        print("Floating controls")
+        check_floating_controls(browser, base, failures)
+        check_directory_widths(browser, base, failures)
+        print("Specialist resources on cluster pages")
+        check_specialist_cards(browser, base, failures)
+        print("Clusters map")
+        check_clusters_map(browser, base, failures)
+        print("Conference programme")
+        check_conference(browser, base, failures)
+        print("Final review fixes")
+        check_review_pages(browser, base, failures)
+        print("Contributor network")
+        check_contributor_network(browser, base, failures)
+        print("Resources directory")
+        check_directory(browser, base, failures)
+        if args.public and args.browser == "chromium":
+            print("Budgets, report only")
+            report_budgets(browser, base, os.path.abspath(args.public), args.base)
+        browser.close()
+    print(json.dumps({"failures": failures}, indent=1))
+    sys.exit(1 if failures else 0)
+
+
+if __name__ == "__main__":
+    main()
diff --git a/scripts/rebrand/check_internal_links.py b/scripts/rebrand/check_internal_links.py
new file mode 100644
index 00000000000..7034cfa37e3
--- /dev/null
+++ b/scripts/rebrand/check_internal_links.py
@@ -0,0 +1,126 @@
+#!/usr/bin/env python3
+"""Check that every internal link in a build maps to a file in that build.
+
+Run: python3 scripts/rebrand/check_internal_links.py public [--base /rebrand-doors/]
+     [--reference public-main]
+
+Lychee excludes forrt.org, so nothing else covers these links. Links into sister sites
+(sister_sites.txt) are allowed, and retired paths the 404 page redirects can be listed in
+link_allowlist.txt. With --reference, only links broken here and not in the reference fail,
+and older ones are listed for clean-up.
+"""
+
+import argparse
+import os
+import re
+import sys
+from collections import defaultdict
+from urllib.parse import urljoin, urlsplit
+
+HERE = os.path.dirname(os.path.abspath(__file__))
+sys.path.insert(0, HERE)
+from preview_paths import load_sister_sites, resolves  # noqa: E402
+from site_inventory import list_paths  # noqa: E402
+
+MAX_LISTED = 40
+# The lookbehind also skips ?src= and &amp;src= inside another attribute's URL, which are not links here.
+_ATTR = re.compile(r"(?<![\w?;&-])(?:href|src|action|poster)=(?:\"([^\"]*)\"|'([^']*)'|([^\s>]+))", re.I)
+_OPAQUE = re.compile(r"<(script|style|template|textarea|pre|code)\b.*?</\1>", re.I | re.S)
+_SKIP_SCHEMES = ("mailto:", "tel:", "javascript:", "data:", "#", "sms:", "blob:", "about:")
+FORRT_HOSTS = ("forrt.org", "www.forrt.org")
+# Standalone apps bring their own relative assets; templates and content are what we check.
+SKIP_PAGES = ("js/vendor/", "lib/", "admin/", "partials/")
+
+
+def load_allowlist(path=os.path.join(HERE, "link_allowlist.txt")):
+    if not os.path.exists(path):
+        return []
+    with open(path, encoding="utf-8") as handle:
+        lines = (line.split("#", 1)[0].strip() for line in handle)
+        return [re.compile(line) for line in lines if line]
+
+
+def page_url(path, base):
+    """The site-relative address a file is served from."""
+    if path.endswith("/index.html"):
+        path = path[: -len("index.html")]
+    elif path == "index.html":
+        path = ""
+    return base + path
+
+
+def extract_links(text):
+    text = _OPAQUE.sub("", text)
+    for match in _ATTR.finditer(text):
+        value = match.group(1) or match.group(2) or match.group(3) or ""
+        value = value.strip().replace("&amp;", "&")
+        if value and not value.startswith(_SKIP_SCHEMES) and "{{" not in value and "${" not in value:
+            yield value
+
+
+def broken_target(link, page, base, files, sisters, allow):
+    """Return the broken site path for a link, or None if it is fine or external."""
+    absolute = urljoin("https://forrt.org" + page, link)
+    parts = urlsplit(absolute)
+    if parts.scheme not in ("http", "https") or parts.hostname not in FORRT_HOSTS:
+        return None
+    path = parts.path
+    top = path.strip("/").split("/", 1)[0]
+    if top in sisters and not (base != "/" and path.startswith(base)):
+        return None
+    if any(pattern.search(path) for pattern in allow):
+        return None
+    if base != "/":
+        # In a subfolder build, a link that leaves the subfolder lands on the live site.
+        if not path.startswith(base):
+            return path
+        path = "/" + path[len(base):]
+    if resolves(path, files) or any(pattern.search(path) for pattern in allow):
+        return None
+    return path
+
+
+def find_broken(root, base="/"):
+    files = set(list_paths(root))
+    sisters = load_sister_sites()
+    allow = load_allowlist()
+    broken = defaultdict(set)
+    for path in sorted(files):
+        if not path.endswith(".html") or path.startswith(SKIP_PAGES):
+            continue
+        with open(os.path.join(root, path), encoding="utf-8", errors="replace") as handle:
+            text = handle.read()
+        page = page_url(path, base)
+        for link in set(extract_links(text)):
+            target = broken_target(link, page, base, files, sisters, allow)
+            if target:
+                broken[target].add(path)
+    return broken
+
+
+def main():
+    parser = argparse.ArgumentParser(description=__doc__)
+    parser.add_argument("public", help="built site directory")
+    parser.add_argument("--base", default="/", help="subfolder the build is served from")
+    parser.add_argument("--reference", help="build of main to separate old breakage from new")
+    args = parser.parse_args()
+
+    broken = find_broken(args.public, args.base)
+    older = find_broken(args.reference, args.base) if args.reference else {}
+    new = {target: pages for target, pages in broken.items() if target not in older}
+    old = {target: pages for target, pages in broken.items() if target in older}
+
+    print(f"Broken internal targets: {len(broken)} ({len(new)} new, {len(old)} also on main)")
+    for label, group in (("New", new), ("Also on main", old)):
+        if group:
+            print(f"\n{label}:")
+        for target in sorted(group)[:MAX_LISTED]:
+            pages = sorted(group[target])
+            print(f"  {target}  <- {pages[0]} ({len(pages)} page{'s' if len(pages) != 1 else ''})")
+        if len(group) > MAX_LISTED:
+            print(f"  ... and {len(group) - MAX_LISTED} more")
+    sys.exit(1 if new else 0)
+
+
+if __name__ == "__main__":
+    main()
diff --git a/scripts/rebrand/check_preview.py b/scripts/rebrand/check_preview.py
new file mode 100644
index 00000000000..a78544c3390
--- /dev/null
+++ b/scripts/rebrand/check_preview.py
@@ -0,0 +1,322 @@
+#!/usr/bin/env python3
+"""Check the deployed preview in a browser: redirects, links, search, noindex and fonts.
+
+Run: python3 scripts/rebrand/check_preview.py [--url https://forrt.org/rebrand-doors/]
+After launch: python3 scripts/rebrand/check_preview.py --production [--url https://forrt.org/]
+
+Needs Playwright. Reads the live preview, so run it after a deploy has finished. It visits
+one URL per rule in the 404 page's redirect table, follows a sample of links and assets, runs
+a search, and confirms that nothing the preview loads comes from the live site outside the
+subfolder and the sister sites, or from Google Fonts. Pages make no request to the newsletter
+embed or its dependencies until a visitor opens the form, and then the form works.
+
+With --production it checks the launched site instead: the base must be a site root (forrt.org by
+default), sampled pages must carry no noindex, and their canonical URL must sit on that root and
+not under /rebrand-doors/. The redirect, link, asset, search and newsletter checks are the same.
+"""
+
+import argparse
+import json
+import os
+import re
+import sys
+from urllib.parse import urlsplit
+
+HERE = os.path.dirname(os.path.abspath(__file__))
+sys.path.insert(0, HERE)
+from preview_paths import load_sister_sites  # noqa: E402
+
+# Retired path under the preview -> where it should land. A leading "//" names a path at the
+# domain root, for the repo renames, whose sites live outside the preview.
+REDIRECTS = {
+    "glossary/vbeta/abstract_bias/": "glossary/english/abstract_bias",
+    "glossary/vbeta/no-such-term/": "glossary/english/",
+    "glossary/vbeta/": "glossary/english/",
+    "curated_resources/no-such-resource/": "resources/",
+    "curated_resources/page/3/": "resources/",
+    "forrt_clusters/academic-life-and-culture/page/2/": "forrt_clusters/academic-life-and-culture/",
+    "tag/": "tags/",
+    "tag/open-science/": "tags/?tag=open-science",
+    "glossary/english/no-such-term/": "glossary/english/",
+    "author/someone/": "contributors/",
+    "summaries/no-such-summary/": "",
+    "reversals/no-such-reversal/": "",
+    "re-searchterms": "apps/re-searchterms.html",
+    "FReD/": "//fred",
+    "FReD-apps/": "//fred-apps",
+    "flora_zotero/": "//flora-zotero",
+    "LoveReplicationsWeek/": "//love-replications-week",
+    "plugin_notification_dummy/": "//plugin-notification-dummy",
+    "replication_handbook/": "//replication-handbook",
+    "TenureRun/": "//tenure-run",
+    "Transform-to-Open-Science-Book/": "//transform-to-open-science-book",
+}
+PREVIEW_URL = "https://forrt.org/rebrand-doors/"
+SITE_URL = "https://forrt.org/"
+BLOCK = re.compile(r"googletagmanager|google-analytics|doubleclick|youtube")
+# The newsletter's third-party services. None of these may load until a visitor subscribes.
+EMBED_HOSTS = ("eocampaign1.com", "eo.page", "fonts.googleapis.com", "fonts.gstatic.com")
+EMBED_URLS = re.compile(r"https://www\.(google\.com|gstatic\.com)/recaptcha/")
+
+
+def embed_request(request, frame):
+    """True for a main-frame request to the newsletter embed or a dependency of it."""
+    # Embedded third-party frames, such as Google Forms, load their own fonts and captchas.
+    if request.frame != frame:
+        return False
+    host = urlsplit(request.url).hostname or ""
+    return any(host == name or host.endswith("." + name) for name in EMBED_HOSTS) or bool(EMBED_URLS.match(request.url))
+
+
+def resolve_base(url, production):
+    """The base URL with one trailing slash. Production defaults to the site and must be a root."""
+    base = (url or (SITE_URL if production else PREVIEW_URL)).rstrip("/") + "/"
+    if production and urlsplit(base).path != "/":
+        raise ValueError(f"--production checks a site root, not {base}")
+    return base
+
+
+def robots_problem(sample, robots, production):
+    """The preview must carry noindex; the launched site must not."""
+    if production:
+        return f"{sample} has noindex ({robots})" if "noindex" in robots else None
+    return None if "noindex" in robots else f"{sample} has no noindex"
+
+
+def canonical_problem(sample, canonical, base):
+    """Production only: the canonical URL sits on the site root and outside the preview."""
+    if not canonical:
+        return f"{sample} has no canonical URL"
+    if not canonical.startswith(base) or "/rebrand-doors/" in canonical:
+        return f"{sample} has canonical {canonical}, outside {base}"
+    return None
+
+
+def redirect_target(base, expected):
+    """The path a retired URL should land on. A leading "//" names a path at the domain root."""
+    return expected[1:] if expected.startswith("//") else urlsplit(base).path + expected
+
+
+def production_expectation(path, expected, sisters):
+    """On forrt.org a sister site's own repository answers before the 404 page, so a retired path
+    that starts with a sister site's name lands on that site rather than on the preview's rule."""
+    first = path.strip("/").split("/")[0]
+    return "//" + first if first in sisters else expected
+
+
+def off_origin(url, base):
+    """True for an absolute URL on another scheme or host than the base. Relative URLs stay on it."""
+    parts, root = urlsplit(url), urlsplit(base)
+    return bool(parts.netloc) and (parts.scheme, parts.netloc) != (root.scheme, root.netloc)
+
+
+def redirect_ok(landed, want, expected):
+    ok = landed.rstrip("/") == want.rstrip("/")
+    # A sister site may forward within itself once it has been reached.
+    if expected.startswith("//"):
+        ok = ok or landed.startswith(want.rstrip("/") + "/")
+    return ok
+
+
+def check_redirects(browser, base, failures, production=False):
+    sisters = load_sister_sites()
+    context = browser.new_context()
+    page = context.new_page()
+    page.route("**/*", lambda route: route.abort() if BLOCK.search(route.request.url) else route.continue_())
+    for path, expected in REDIRECTS.items():
+        if production:
+            expected = production_expectation(path, expected, sisters)
+        page.goto(base + path, wait_until="load", timeout=60000)
+        try:
+            page.wait_for_url(lambda url: not url.rstrip("/").endswith(path.rstrip("/")), timeout=6000)
+        except Exception:
+            pass
+        landed = urlsplit(page.url).path
+        if "?" in expected:
+            landed += "?" + urlsplit(page.url).query
+        want = redirect_target(base, expected)
+        ok = redirect_ok(landed, want, expected)
+        if production and off_origin(page.url, base):
+            ok, landed = False, page.url
+        print(f"  {'ok ' if ok else 'BAD'} {path} -> {landed}")
+        if not ok:
+            failures.append(f"redirect {path} landed on {landed}, wanted {want}")
+    context.close()
+
+
+def check_links_assets(browser, base, failures, production=False):
+    sisters = load_sister_sites()
+    root = urlsplit(base).path
+    context = browser.new_context(viewport={"width": 1440, "height": 900})
+    page = context.new_page()
+    outside, embed = [], []
+
+    def note(request):
+        parts = urlsplit(request.url)
+        if embed_request(request, page.main_frame):
+            embed.append(request.url)
+        if parts.hostname in ("forrt.org", "www.forrt.org") and not parts.path.startswith(root):
+            if parts.path.strip("/").split("/")[0] not in sisters:
+                outside.append(request.url)
+
+    page.on("request", note)
+    page.route("**/*", lambda route: route.abort() if BLOCK.search(route.request.url) else route.continue_())
+    samples = ["", "about/us/", "glossary/english/abstract_bias/", "resources/", "clusters/", "publications/",
+               "newsletters/", "about/get-involved/", "nexus/"]
+    for sample in samples:
+        response = page.goto(base + sample, wait_until="load", timeout=120000)
+        page.wait_for_timeout(800)
+        robots = page.evaluate("document.querySelector('meta[name=robots]')?.content || ''")
+        canonical = page.evaluate("document.querySelector('link[rel=canonical]')?.href || ''")
+        broken_images = page.evaluate(
+            "[...document.images].filter(i=>i.complete&&!i.naturalWidth&&i.src.includes('forrt.org')).map(i=>i.src)"
+        )
+        print(f"  {sample or '(home)'}: {response.status}, robots={robots!r}, broken images {len(broken_images)}"
+              + (f", canonical {canonical}" if production else ""))
+        if response.status != 200:
+            failures.append(f"{sample} returned {response.status}")
+        problems = [robots_problem(sample, robots, production)]
+        if production:
+            problems.append(canonical_problem(sample, canonical, base))
+        failures.extend(problem for problem in problems if problem)
+        failures.extend(f"{sample}: broken image {src}" for src in broken_images)
+    if embed:
+        failures.append(f"newsletter embed or Google Fonts requests before any click: {sorted(set(embed))[:3]}")
+    if outside:
+        failures.append(f"requests to the live site: {sorted(set(outside))[:5]}")
+
+    # A sample of links from the home page's header, footer and body.
+    page.goto(base, wait_until="load")
+    links = page.evaluate(
+        "[...new Set([...document.querySelectorAll('a[href]')].map(a=>a.href))]"
+        ".filter(h=>h.startsWith(location.origin)).slice(0,250)"
+    )
+    print(f"  Same-site links on the home page: {len(links)}")
+    live = [link for link in links if not urlsplit(link).path.startswith(root)
+            and urlsplit(link).path.strip("/").split("/")[0] not in sisters]
+    if live:
+        failures.append(f"home page links to the live site: {live[:5]}")
+    bad = []
+    for link in links:
+        if not urlsplit(link).path.startswith(root):
+            continue
+        status = page.request.head(link.split("#")[0], max_redirects=5).status
+        if status >= 400:
+            bad.append(f"{status} {link}")
+    print(f"  Checked {len(links)} links, {len(bad)} failed")
+    failures.extend(f"home page link {item}" for item in bad)
+    context.close()
+
+
+def check_newsletter(browser, base, failures):
+    """The native form contacts reCAPTCHA and EmailOctopus only on a valid submit. EmailOctopus's
+    endpoint is stubbed, so the check exercises the submit handler without adding a contact."""
+    context = browser.new_context(viewport={"width": 1440, "height": 900})
+    page = context.new_page()
+    page.route("**/*", lambda route: route.abort() if BLOCK.search(route.request.url) else route.continue_())
+    posted = []
+
+    def stub_signup(route):
+        posted.append(route.request.url)
+        route.fulfill(status=200, content_type="application/json", headers={"Access-Control-Allow-Origin": "*"},
+                      body='{"success":true,"contact":{"status":"SUBSCRIBED"}}')
+
+    page.route("https://eocampaign1.com/form/*", stub_signup)
+    seen = []
+    page.on("request", lambda request: seen.append(request.url) if embed_request(request, page.main_frame) else None)
+    page.goto(base + "newsletters/", wait_until="load", timeout=120000)
+    page.wait_for_timeout(1500)
+    if seen:
+        failures.append(f"newsletter page loaded a third-party service before Subscribe: {seen[:3]}")
+    try:
+        form = page.locator("form.newsletter-form")
+        email = form.locator("input[type=email]")
+        if not email.is_visible() or not form.locator(".newsletter-submit").is_visible():
+            failures.append("newsletter form: the email field or Subscribe button is not visible")
+        if not form.locator('.newsletter-note a[href*="policies.google.com/terms"]').count():
+            failures.append("newsletter form: the note lacks Google's reCAPTCHA terms link")
+        before = len(seen)
+        email.fill("not-an-address")
+        form.locator(".newsletter-submit").click()
+        page.wait_for_timeout(1500)
+        if len(seen) > before:
+            failures.append(f"newsletter form contacted a third party on an invalid address: {seen[before:][:3]}")
+        email.fill("smoke-test@example.invalid")
+        form.locator(".newsletter-submit").click()
+        if not any("recaptcha" in url for url in seen[before:]):
+            page.wait_for_timeout(5000)
+        if not any("recaptcha" in url for url in seen[before:]):
+            failures.append("newsletter form: Subscribe did not load reCAPTCHA")
+        # A headless browser may get a reCAPTCHA picture challenge, so a missing post is reported, not failed.
+        try:
+            page.wait_for_selector("form.newsletter-form.is-done", timeout=20000)
+            print("  Valid submit loaded reCAPTCHA, posted to the stubbed endpoint and showed the thanks")
+        except Exception:
+            print(f"  Valid submit loaded reCAPTCHA; no post within 20 s (posts: {len(posted)}), likely a challenge")
+    except Exception as error:
+        failures.append(f"newsletter form check failed: {str(error)[:200]}")
+    context.close()
+
+
+def check_search(browser, base, failures, production=False):
+    context = browser.new_context(viewport={"width": 1440, "height": 900})
+    page = context.new_page()
+    page.route("**/*", lambda route: route.abort() if BLOCK.search(route.request.url) else route.continue_())
+    index_requests = []
+    page.on("request", lambda request: index_requests.append(request.url) if "index.json" in request.url else None)
+    page.goto(base, wait_until="load")
+    page.wait_for_timeout(1500)
+    if index_requests:
+        failures.append("search index loaded before search was used")
+    page.fill("#site-search", "preregistration")
+    page.keyboard.press("Enter")
+    page.wait_for_selector(".search-hit", timeout=60000)
+    first = page.locator(".search-hit a").first.get_attribute("href")
+    count = page.locator(".search-hit").count()
+    print(f"  Search: {count} hits, first {first}")
+    if not first or not urlsplit(first).path.startswith(urlsplit(base).path) or (production and off_origin(first, base)):
+        failures.append(f"search result outside the preview: {first}")
+    if page.request.get(page.url.split("?")[0]).status != 200:
+        failures.append("search page did not load")
+    context.close()
+
+
+def main():
+    parser = argparse.ArgumentParser(description=__doc__)
+    parser.add_argument("--url", help=f"base URL (default {PREVIEW_URL}, or {SITE_URL} with --production)")
+    parser.add_argument("--production", action="store_true",
+                        help="check the launched site: a site root, no noindex, canonical URLs on that root")
+    args = parser.parse_args()
+    try:
+        base = resolve_base(args.url, args.production)
+    except ValueError as error:
+        parser.error(str(error))
+    failures = []
+    from playwright.sync_api import sync_playwright
+
+    checks = [
+        ("Redirects", lambda browser: check_redirects(browser, base, failures, args.production)),
+        ("Links, assets, noindex" + (", canonical" if args.production else ""),
+         lambda browser: check_links_assets(browser, base, failures, args.production)),
+        ("Newsletter", lambda browser: check_newsletter(browser, base, failures)),
+        ("Search", lambda browser: check_search(browser, base, failures, args.production)),
+    ]
+    with sync_playwright() as playwright:
+        browser = playwright.chromium.launch()
+        for title, check in checks:
+            print(title)
+            try:
+                check(browser)
+            except Exception as error:
+                # On launch day one missing element should not hide the other results.
+                if not args.production:
+                    raise
+                message = (str(error).splitlines() or [type(error).__name__])[0]
+                failures.append(f"{title} stopped: {message[:200]}")
+        browser.close()
+    print(json.dumps({"failures": failures}, indent=1))
+    sys.exit(1 if failures else 0)
+
+
+if __name__ == "__main__":
+    main()
diff --git a/scripts/rebrand/check_source_rules.py b/scripts/rebrand/check_source_rules.py
new file mode 100644
index 00000000000..9abeca303a5
--- /dev/null
+++ b/scripts/rebrand/check_source_rules.py
@@ -0,0 +1,98 @@
+#!/usr/bin/env python3
+"""Source rules for the redesign branch: template links and generated content.
+
+Run: python3 scripts/rebrand/check_source_rules.py [--base origin/main]
+
+1. Templates and menus must not hard-code forrt.org URLs for this site's own pages:
+   use relref in templates, which fails the build when a page is missing, and a site path
+   in menus. Links to sister sites are fine, as is FORRT's address in structured data.
+2. Generated paths (CONTRIBUTING.md) must not change on the branch, as a hand edit is
+   lost when the generator next runs. Compared with the merge base, so main's own updates
+   arriving through a merge do not count.
+"""
+
+import argparse
+import os
+import re
+import subprocess
+import sys
+
+HERE = os.path.dirname(os.path.abspath(__file__))
+sys.path.insert(0, HERE)
+from preview_paths import load_sister_sites  # noqa: E402
+
+ABSOLUTE = re.compile(r"https?://(?:www\.)?forrt\.org(/[^\s\"'<>)}]*)?")
+SCANNED = ("layouts", "config/_default/menus.toml")
+# Generated paths from CONTRIBUTING.md and AGENTS.md, including announcement bundles.
+GENERATED = re.compile(
+    r"^(content/curated_resources/(?!_index\.md$)"
+    r"|content/glossary/"
+    r"|content/post/[^/]+/"
+    r"|content/contributors/tenzing\.md$"
+    r"|content/contributor-analysis/"
+    r"|content/publications/citation_chart\.webp$"
+    r"|content/replication-hub/flora/_index\.md$"
+    r"|content/clusters/cluster-\d+/index\.md$"
+    r"|content/about/steering-committee/index\.md$"
+    r"|static/data/"
+    r"|static/partials/"
+    r"|scripts/forrt_contribs/contributors_cache\.csv$"
+    r"|data/(?!partners\.json$|publications\.yaml$|themes/|fonts/)[^/]+$)"
+)
+
+
+def repo_files(root="."):
+    for entry in SCANNED:
+        path = os.path.join(root, entry)
+        if os.path.isfile(path):
+            yield path
+        for directory, _, names in os.walk(path):
+            for name in names:
+                yield os.path.join(directory, name)
+
+
+def absolute_url_findings(root=".", sisters=None):
+    sisters = load_sister_sites() if sisters is None else sisters
+    findings = []
+    for path in repo_files(root):
+        with open(path, encoding="utf-8", errors="replace") as handle:
+            for number, line in enumerate(handle, 1):
+                for match in ABSOLUTE.finditer(line):
+                    tail = (match.group(1) or "").strip("/")
+                    if tail.split("/", 1)[0] in sisters:
+                        continue
+                    # An organisation's identity in schema.org records is its address.
+                    if not tail and re.search(r"\"url\"", line):
+                        continue
+                    findings.append(f"{path}:{number}: {match.group(0)}")
+    return findings
+
+
+def generated_edits(base):
+    merge_base = subprocess.check_output(["git", "merge-base", base, "HEAD"], text=True).strip()
+    changed = subprocess.check_output(
+        ["git", "-c", "core.quotepath=false", "diff", "--name-only", merge_base, "HEAD"], text=True
+    ).splitlines()
+    return [path for path in changed if GENERATED.match(path)]
+
+
+def main():
+    parser = argparse.ArgumentParser(description=__doc__)
+    parser.add_argument("--base", default="origin/main")
+    args = parser.parse_args()
+
+    absolute = absolute_url_findings()
+    print(f"Hard-coded forrt.org URLs in templates and menus: {len(absolute)}")
+    for finding in absolute:
+        print(f"  {finding[:200]}")
+
+    edits = generated_edits(args.base)
+    print(f"Generated paths changed on this branch: {len(edits)}")
+    for path in edits:
+        print(f"  {path}")
+
+    sys.exit(1 if absolute or edits else 0)
+
+
+if __name__ == "__main__":
+    main()
diff --git a/scripts/rebrand/compare_builds.py b/scripts/rebrand/compare_builds.py
new file mode 100644
index 00000000000..0e408054194
--- /dev/null
+++ b/scripts/rebrand/compare_builds.py
@@ -0,0 +1,181 @@
+#!/usr/bin/env python3
+"""Compare a redesign build with a reference build, made from the same data.
+
+Run: python3 scripts/rebrand/compare_builds.py <reference-dir> <candidate-dir>
+
+Fails if an address changes (a page, feed, sitemap or data file appears or goes),
+if a structured-data count falls, or if a page's SEO tags change (except same-image
+WebP-to-PNG/JPEG social derivatives and their size/type tags). New assets such as
+fonts and bundles are listed and allowed. Agreed exceptions go in allowed_changes.txt
+beside this script, one normalised path or glob per line, with a comment saying why. A glob
+suits a collection whose size changes with the data, such as numbered pages.
+
+Pass --paths-only to compare against a stored paths.txt from the baseline instead of a
+build. Generated collections keep changing, so this is for records and local checks.
+"""
+
+import argparse
+import os
+import re
+import sys
+from urllib.parse import unquote, urlsplit
+
+sys.path.insert(0, os.path.dirname(os.path.abspath(__file__)))
+from site_inventory import PAGE_SUFFIXES, inventory, normalise_path  # noqa: E402
+
+MAX_LISTED = 40
+HERE = os.path.dirname(os.path.abspath(__file__))
+
+
+def load_allowed(path=os.path.join(HERE, "allowed_changes.txt")):
+    if not os.path.exists(path):
+        return set()
+    with open(path, encoding="utf-8") as handle:
+        lines = (line.split("#", 1)[0].strip() for line in handle)
+        return {line for line in lines if line}
+
+
+def is_allowed(path, allowed):
+    """Exact paths and globs. `*` stops at a slash, so a glob cannot hide a deeper route."""
+    return path in allowed or any(
+        re.fullmatch(re.escape(pattern).replace(r"\*", "[^/]*"), path) for pattern in allowed if "*" in pattern
+    )
+
+
+def compare_paths(reference, candidate, allowed=frozenset()):
+    """Return (removed, added_addresses, added_assets) as sorted lists."""
+    before = {normalise_path(path) for path in reference}
+    after = {normalise_path(path) for path in candidate}
+    removed = sorted(path for path in before - after if not is_allowed(path, allowed))
+    added = sorted(path for path in after - before if not is_allowed(path, allowed))
+    addresses = [path for path in added if path.endswith(PAGE_SUFFIXES)]
+    assets = [path for path in added if not path.endswith(PAGE_SUFFIXES)]
+    return removed, addresses, assets
+
+
+def compare_structured(reference, candidate):
+    """Return a list of (group, type, before, after) where a count fell."""
+    drops = []
+    for group, counts in reference.items():
+        for kind, count in counts.items():
+            now = candidate.get(group, {}).get(kind, 0)
+            if now < count:
+                drops.append((group, kind, count, now))
+    return drops
+
+
+def _without_edit_date(tags):
+    return [re.sub(r'"dateModified":\s*"[^"]*",?', "", tag) for tag in tags if not tag.startswith("article:modified_time")]
+
+
+def _social_derivative(original, derivative):
+    """A format-only Hugo derivative of the same WebP, including static imports."""
+    before, after = urlsplit(original), urlsplit(derivative)
+    if (before.scheme, before.netloc, before.query, before.fragment) != (after.scheme, after.netloc, after.query, after.fragment):
+        return False
+    if not before.path.lower().endswith(".webp") or not after.path.lower().endswith((".png", ".jpg", ".jpeg")):
+        return False
+    if not re.search(r"_hu_?[0-9a-f]{8,}$", os.path.splitext(unquote(after.path))[0]):
+        return False
+    # Hugo retains the source basename and adds a processing hash. Static sources
+    # enter the pipeline under social/; preview prefixes and all other path parts stay.
+    def stem(path):
+        return re.sub(r"_hu_?[0-9a-f]{8,}$", "", unquote(os.path.splitext(path)[0]))
+
+    source, target = stem(before.path), stem(after.path)
+    return target == source or target.replace("/social/", "/", 1) == source
+
+
+def _equivalent_social_images(before, after):
+    """Normalize only recognized WebP conversions and their size/type companions.
+
+    Alt text, every other tag, and PNG/JPEG-to-PNG/JPEG changes still compare exactly.
+    Duplicate image tags are deliberately left for the ordinary comparison.
+    """
+    for key in ("og:image", "twitter:image"):
+        old = [tag[len(key) + 1:] for tag in before if tag.startswith(key + "=")]
+        new = [tag[len(key) + 1:] for tag in after if tag.startswith(key + "=")]
+        if len(old) != 1 or len(new) != 1 or not _social_derivative(old[0], new[0]):
+            continue
+        companions = {key + ":" + name for name in ("width", "height", "type")}
+        old_keys = [tag.partition("=")[0] for tag in before if tag.partition("=")[0] in companions]
+        new_keys = [tag.partition("=")[0] for tag in after if tag.partition("=")[0] in companions]
+        # Open Graph needs all three fields. Twitter emits none, but any supplied
+        # companions must remain present exactly once on both sides.
+        if (sorted(old_keys) != sorted(new_keys) or len(set(old_keys)) != len(old_keys)
+                or (key == "og:image" and set(old_keys) != companions)):
+            continue
+        before = [tag for tag in before if tag.partition("=")[0] not in companions]
+        after = [key + "=" + old[0] if tag.startswith(key + "=") else tag
+                 for tag in after if tag.partition("=")[0] not in companions]
+    return before, after
+
+
+def compare_heads(reference, candidate, allowed=frozenset()):
+    """Return {path: (only_before, only_after)} for pages whose SEO tags differ."""
+    changes = {}
+    for path, tags in reference.items():
+        if path not in candidate or is_allowed(path, allowed):
+            continue
+        # A page's modified date follows its last edit, which is the sitemap check's concern.
+        before = _without_edit_date(tags)
+        after = _without_edit_date(candidate[path])
+        before, after = _equivalent_social_images(before, after)
+        if before != after:
+            before, after = set(before), set(after)
+            changes[path] = (sorted(before - after), sorted(after - before))
+    return changes
+
+
+def _show(title, items):
+    print(f"\n{title}: {len(items)}")
+    for item in items[:MAX_LISTED]:
+        print(f"  {item}")
+    if len(items) > MAX_LISTED:
+        print(f"  ... and {len(items) - MAX_LISTED} more")
+
+
+def main():
+    parser = argparse.ArgumentParser(description=__doc__)
+    parser.add_argument("reference", help="reference build, or paths.txt with --paths-only")
+    parser.add_argument("candidate", help="redesign build")
+    parser.add_argument("--paths-only", action="store_true")
+    args = parser.parse_args()
+
+    allowed = load_allowed()
+    # Agreed exceptions do not count towards structured data on either side.
+    skip = lambda path: is_allowed(path, allowed)  # noqa: E731
+    candidate = inventory(args.candidate, skip)
+    if args.paths_only:
+        with open(args.reference, encoding="utf-8") as handle:
+            reference = {"paths": handle.read().split("\n"), "structured_data": {}, "seo_heads": {}}
+        reference["paths"] = [path for path in reference["paths"] if path]
+    else:
+        reference = inventory(args.reference, skip)
+
+    removed, addresses, assets = compare_paths(reference["paths"], candidate["paths"], allowed)
+    drops = compare_structured(reference["structured_data"], candidate["structured_data"])
+    heads = compare_heads(reference["seo_heads"], candidate["seo_heads"], allowed)
+
+    print(f"Reference: {len(reference['paths'])} files. Candidate: {len(candidate['paths'])} files.")
+    _show("Removed paths", removed)
+    _show("Added addresses", addresses)
+    _show("Added assets (allowed)", assets)
+    _show("Structured-data counts that fell", [f"{g} / {k}: {a} -> {b}" for g, k, a, b in drops])
+    _show("Invalid JSON-LD", candidate["invalid_json_ld"])
+    _show("Pages whose SEO tags changed", sorted(heads))
+    for path in sorted(heads)[:5]:
+        only_before, only_after = heads[path]
+        print(f"\n  {path}")
+        for tag in only_before[:6]:
+            print(f"    - {tag[:160]}")
+        for tag in only_after[:6]:
+            print(f"    + {tag[:160]}")
+
+    failed = removed or addresses or drops or heads or candidate["invalid_json_ld"]
+    print("\nFAILED" if failed else "\nOK: the URL list, structured data and SEO tags match.")
+    sys.exit(1 if failed else 0)
+
+
+if __name__ == "__main__":
+    main()
diff --git a/scripts/rebrand/preview_paths.py b/scripts/rebrand/preview_paths.py
new file mode 100644
index 00000000000..00efba8ade5
--- /dev/null
+++ b/scripts/rebrand/preview_paths.py
@@ -0,0 +1,178 @@
+#!/usr/bin/env python3
+"""Make a built site work from a subfolder, and keep search engines out of it.
+
+Run after `hugo --baseURL https://forrt.org/rebrand-doors/`:
+    python3 scripts/rebrand/preview_paths.py public --base /rebrand-doors/
+
+Hugo prefixes what its own functions emit, but Markdown, shortcodes, static files and
+hard-coded template paths say `/about/us`, which would land on the live site. This
+prefixes those, along with absolute forrt.org links whose target exists in this build.
+Links to sister sites stay as they are, because forrt.org/<name>/ is where they live.
+Every HTML file also gets a noindex tag, including standalone pages Hugo did not template.
+"""
+
+import argparse
+import os
+import re
+import sys
+
+HERE = os.path.dirname(os.path.abspath(__file__))
+sys.path.insert(0, HERE)
+from site_inventory import list_paths  # noqa: E402
+
+ATTRIBUTES = r"(?:href|src|action|poster|data|source|data-[\w-]+)"
+ROBOTS = re.compile(r"<meta[^>]+name=[\"']?robots[\"']?[^>]*noindex", re.I)
+# Bundled libraries and apps carry their own paths and are not ours to change.
+SKIP_JS = ("lib/", "js/vendor/", "admin/", "explorer/", "annotator/", "awop_app/",
+           "open-research-games-portal/")
+
+
+def load_sister_sites(path=os.path.join(HERE, "sister_sites.txt")):
+    with open(path, encoding="utf-8") as handle:
+        lines = (line.split("#", 1)[0].strip() for line in handle)
+        return {line for line in lines if line}
+
+
+def resolves(url_path, files):
+    """Whether a root-relative path, without query or fragment, maps to a built file.
+
+    GitHub Pages serves /x from x, x.html or x/index.html. Case matters there, so
+    this looks the path up in the file list and never asks the filesystem.
+    """
+    path = re.split(r"[?#]", url_path, maxsplit=1)[0].strip("/")
+    path = re.sub(r"%([0-9A-Fa-f]{2})", lambda m: chr(int(m.group(1), 16)), path)
+    try:
+        path = path.encode("latin-1").decode("utf-8")
+    except (UnicodeEncodeError, UnicodeDecodeError):
+        pass
+    if not path:
+        return "index.html" in files
+    return path in files or f"{path}.html" in files or f"{path}/index.html" in files
+
+
+class Rewriter:
+    def __init__(self, base, files, sister_sites):
+        self.base = "/" + base.strip("/") + "/"
+        self.files = files
+        self.sisters = sister_sites
+        self.tops = {path.split("/", 1)[0] for path in files}
+        prefix = re.escape(self.base.strip("/"))
+        not_rebased = rf"(?!/)(?!{prefix}(?:[/\"'\s>]|$))"
+        self._attr = re.compile(rf"(?<![\w-])({ATTRIBUTES}=[\"']?)/{not_rebased}", re.I)
+        self._absolute = re.compile(
+            rf"(?<![\w-])({ATTRIBUTES}=[\"']?)https?://(?:www\.)?forrt\.org(/[^\"'\s>]*)?(?=[\"'\s>])",
+            re.I,
+        )
+        self._climbing = re.compile(
+            rf"(?<![\w-])({ATTRIBUTES}=[\"']?)((?:\./)?(?:\.\./)*\.\.(?:/|(?=[\"'\s>?#])))", re.I
+        )
+        self._srcset = re.compile(r"(?<![\w-])(srcset=)([\"'])(.*?)\2", re.I | re.S)
+        self._css_url = re.compile(rf"(url\(\s*[\"']?)/{not_rebased}", re.I)
+        self._script = re.compile(r"(<script\b[^>]*>)(.*?)(</script>)", re.I | re.S)
+        self._js_literal = re.compile(rf"([\"'`])/{not_rebased}([\w.-]+)")
+
+    def _attribute(self, match):
+        rest = match.string[match.end():]
+        path = re.match(r"[^\"'\s>]*", rest).group(0)
+        top = re.split(r"[/?#]", path, maxsplit=1)[0]
+        if top in self.sisters and top not in self.tops:
+            return match.group(0)
+        return f"{match.group(1)}{self.base}"
+
+    def _absolute_link(self, match):
+        path = match.group(2) or "/"
+        if resolves(path, self.files):
+            return f"{match.group(1)}{self.base}{path.lstrip('/')}"
+        return match.group(0)
+
+    def _climbs_out(self, depth):
+        # At the domain root, the browser stops `../` at the root. In a subfolder it carries on
+        # up to the live site, so keep anything that climbs past the top inside the preview.
+        def replace(match):
+            if match.group(2).count("..") <= depth:
+                return match.group(0)
+            rest = re.match(r"[^\"'\s>]*", match.string[match.end():]).group(0)
+            top = re.split(r"[/?#]", rest, maxsplit=1)[0]
+            # A sister site lives at the domain root, which is where this link already lands.
+            if top in self.sisters and top not in self.tops:
+                return match.group(0)
+            return f"{match.group(1)}{self.base}"
+        return replace
+
+    def _srcset_value(self, match):
+        candidates = []
+        for candidate in match.group(3).split(","):
+            stripped = candidate.strip()
+            if stripped.startswith("/") and not stripped.startswith(("//", self.base)):
+                stripped = self.base + stripped[1:]
+            candidates.append(stripped)
+        return f"{match.group(1)}{match.group(2)}{', '.join(candidates)}{match.group(2)}"
+
+    def _js_path(self, match):
+        # Only string literals naming something this build publishes at its root.
+        if match.group(2) in self.tops:
+            return f"{match.group(1)}{self.base}{match.group(2)}"
+        return match.group(0)
+
+    def javascript(self, text):
+        return self._js_literal.sub(self._js_path, text)
+
+    def css(self, text):
+        return self._css_url.sub(lambda m: f"{m.group(1)}{self.base}", text)
+
+    def _inline_script(self, match):
+        if "ld+json" in match.group(1):
+            return match.group(0)
+        return match.group(1) + self.javascript(match.group(2)) + match.group(3)
+
+    def html(self, text, is_404=False, depth=0):
+        text = self._climbing.sub(self._climbs_out(depth), text)
+        text = self._absolute.sub(self._absolute_link, text)
+        text = self._attr.sub(self._attribute, text)
+        text = self._srcset.sub(self._srcset_value, text)
+        text = self.css(text)
+        # The 404 script handles its own base: its regexes match paths, not links.
+        if not is_404:
+            text = self._script.sub(self._inline_script, text)
+        if not ROBOTS.search(text):
+            tag = '<meta name="robots" content="noindex, nofollow">'
+            text, count = re.subn(r"(<head\b[^>]*>)", rf"\1{tag}", text, count=1, flags=re.I)
+            if not count:
+                text = tag + text
+        return text
+
+
+def rewrite_tree(root, base):
+    all_files = list_paths(root)
+    rewriter = Rewriter(base, set(all_files), load_sister_sites())
+    changed = 0
+    for path in all_files:
+        if path.endswith(".html"):
+            transform = lambda text, page=path: rewriter.html(text, page == "404.html", page.count("/"))
+        elif path.endswith(".css"):
+            transform = rewriter.css
+        elif path.endswith(".js") and not path.startswith(SKIP_JS):
+            transform = rewriter.javascript
+        else:
+            continue
+        full = os.path.join(root, path)
+        with open(full, encoding="utf-8", errors="surrogateescape", newline="") as handle:
+            text = handle.read()
+        updated = transform(text)
+        if updated != text:
+            with open(full, "w", encoding="utf-8", errors="surrogateescape", newline="") as handle:
+                handle.write(updated)
+            changed += 1
+    return changed
+
+
+def main():
+    parser = argparse.ArgumentParser(description=__doc__)
+    parser.add_argument("public", help="built site directory")
+    parser.add_argument("--base", required=True, help="subfolder, for example /rebrand-doors/")
+    args = parser.parse_args()
+    print(f"Rewrote {rewrite_tree(args.public, args.base)} files for {args.base}")
+
+
+if __name__ == "__main__":
+    main()
diff --git a/scripts/rebrand/rehearse_launch.py b/scripts/rebrand/rehearse_launch.py
new file mode 100644
index 00000000000..efa3fa256b8
--- /dev/null
+++ b/scripts/rebrand/rehearse_launch.py
@@ -0,0 +1,530 @@
+#!/usr/bin/env python3
+"""Rehearse the Doors launch locally: merge the branch into main and build it as deploy.yaml does.
+
+Run from the repository root (needs gh, git and network access; Playwright is optional):
+
+    python3 scripts/rebrand/rehearse_launch.py --work /tmp/doors-rehearsal [--doors-ref origin/rebrand-doors]
+
+Nothing is pushed and no workflow is dispatched. The script
+
+1. merges the Doors branch into a throwaway branch from main with `git merge --no-ff`, in its own
+   worktree, and stops on a conflict;
+2. downloads the newest unexpired `data-artifact` (data-processing.yml) and
+   `announcements-artifact` (create_announcements.yml) from successful runs on main, and Hugo
+   0.158.0 extended;
+3. applies them to that merge and to plain main as deploy.yaml does (clear the curated-resource
+   seed, unpack the data artifact over the checkout, replace the post bundles if a tarball exists),
+   and builds both with `HUGO_ENV=production hugo --gc --minify --cleanDestinationDir`;
+4. runs deploy.yaml's checks on both builds, in its order and with its arguments, then
+   compare_builds.py against main and against baseline/paths.txt;
+5. checks what only production shows: noindex, canonical and og:url hosts, sitemap size,
+   robots.txt and any `/rebrand-doors` left in the output;
+6. sorts the data artifact's files by how they differ from the launch merge and, if any would
+   revert or resurrect a file there, builds the merge again without them and lists the output that
+   changes;
+7. serves the build on localhost and loads sample pages in Chromium, listing every request to
+   another host before any choice is made on a banner.
+
+Results go to <work>/logs and <work>/summary.json. The worktrees, branch, artifacts, builds and
+Hugo are deleted at the end, also after a failure, unless --keep is given. Exit status 1 means a hard check failed.
+"""
+
+import argparse
+import filecmp
+import functools
+import hashlib
+import http.server
+import json
+import os
+import platform
+import re
+import shutil
+import subprocess
+import sys
+import tarfile
+import threading
+from pathlib import Path
+from urllib.parse import unquote, urlsplit
+
+HERE = Path(__file__).resolve().parent
+sys.path.insert(0, str(HERE))
+from site_inventory import _REDIRECT, inventory, seo_head  # noqa: E402
+
+REPO = HERE.parents[1]
+HUGO_VERSION = "0.158.0"
+SITE = "https://forrt.org/"
+BRANCH = "scratch-launch-rehearsal"
+# deploy.yaml lets Git report non-ASCII paths unquoted with `git config core.quotepath false`. The
+# worktrees share the main checkout's config, so set it for these processes only.
+GIT_ENV = {"GIT_CONFIG_COUNT": "1", "GIT_CONFIG_KEY_0": "core.quotepath", "GIT_CONFIG_VALUE_0": "false"}
+TEXT_SUFFIXES = (".html", ".xml", ".json", ".js", ".css", ".txt", ".webmanifest", ".svg")
+GOOGLE_FONTS = re.compile(r"fonts\.(googleapis|gstatic)\.com")
+# The Academic theme's stylesheet (css/academic.css, or academic.min.<hash>.css in production) and
+# Domine, the font data/fonts/forrt.toml selects. Academicons, the scholarly icon font, stays.
+OLD_THEME = re.compile(r"/css/academic(\.min)?(\.[0-9a-f]{16,})?\.css|\bDomine\b")
+STYLESHEET = re.compile(r"<link[^>]+rel=[\"']?stylesheet[^>]*?href=[\"']?([^\"' >]+)")
+
+
+def run(cmd, cwd=REPO, env=None, log=None, check=True):
+    """Run a command, optionally teeing its output to a log file. Returns the CompletedProcess."""
+    full_env = {**os.environ, **GIT_ENV, **(env or {})}
+    result = subprocess.run(cmd, cwd=cwd, env=full_env, text=True, capture_output=True)
+    if log:
+        Path(log).write_text(f"$ {' '.join(map(str, cmd))}\n{result.stdout}{result.stderr}", encoding="utf-8")
+    if check and result.returncode:
+        sys.exit(f"Failed ({result.returncode}): {' '.join(map(str, cmd))}\n{result.stdout[-2000:]}{result.stderr[-2000:]}")
+    return result
+
+
+def git(*args, cwd=REPO, check=True):
+    return run(["git", *args], cwd=cwd, check=check).stdout.strip()
+
+
+# ---------------------------------------------------------------- Hugo and artifacts
+
+
+def get_hugo(work):
+    """Download Hugo extended at the version deploy.yaml pins, and confirm the version."""
+    target = work / "hugo"
+    binary = target / "hugo"
+    if not binary.exists():
+        target.mkdir(parents=True, exist_ok=True)
+        system = platform.system().lower()
+        if system == "darwin":
+            pattern = f"hugo_extended_{HUGO_VERSION}_darwin-universal.pkg"
+        else:
+            arch = "arm64" if platform.machine() in ("arm64", "aarch64") else "amd64"
+            pattern = f"hugo_extended_{HUGO_VERSION}_linux-{arch}.tar.gz"
+        run(["gh", "release", "download", f"v{HUGO_VERSION}", "-R", "gohugoio/hugo", "-p", pattern, "-D", target])
+        package = target / pattern
+        if pattern.endswith(".pkg"):
+            run(["pkgutil", "--expand-full", package, target / "pkg"])
+            shutil.copy2(target / "pkg" / "Payload" / "hugo", binary)
+        else:
+            with tarfile.open(package) as archive:
+                archive.extract("hugo", target, filter="data")
+    version = run([binary, "version"]).stdout
+    if f"v{HUGO_VERSION}-" not in version or "+extended" not in version:
+        sys.exit(f"Wrong Hugo: {version}")
+    return binary, version.strip()
+
+
+def newest_artifact(name, branch):
+    """The newest unexpired artifact of this name from a successful run on `branch`."""
+    listing = json.loads(run(["gh", "api", f"repos/{{owner}}/{{repo}}/actions/artifacts?name={name}&per_page=30"]).stdout)
+    for artifact in listing["artifacts"]:
+        if artifact["expired"] or artifact["workflow_run"]["head_branch"] != branch:
+            continue
+        run_id = artifact["workflow_run"]["id"]
+        conclusion = run(["gh", "api", f"repos/{{owner}}/{{repo}}/actions/runs/{run_id}", "--jq", ".conclusion"]).stdout.strip()
+        if conclusion == "success":
+            return run_id, artifact["created_at"]
+    sys.exit(f"No unexpired {name} from a successful run on {branch}")
+
+
+def download(name, run_id, artifacts):
+    """Download once per run id, so a reused --work never builds from another run's artifact."""
+    dest = artifacts / f"{name}-{run_id}"
+    if not dest.exists() or not any(dest.iterdir()):
+        dest.mkdir(parents=True, exist_ok=True)
+        run(["gh", "run", "download", str(run_id), "-n", name, "-D", dest])
+    return dest
+
+
+# ---------------------------------------------------------------- checkouts and builds
+
+
+def make_checkouts(work, main_ref, doors_ref):
+    main_dir, launch_dir = work / "main", work / "launch"
+    for path in (main_dir, launch_dir):
+        if path.exists():
+            git("worktree", "remove", "--force", str(path))
+    git("worktree", "prune")
+    if git("branch", "--list", BRANCH):
+        git("branch", "-D", BRANCH)
+    git("worktree", "add", "--detach", str(main_dir), main_ref)
+    git("worktree", "add", "-b", BRANCH, str(launch_dir), main_ref)
+    merged = run(["git", "merge", "--no-ff", "--no-edit", doors_ref], cwd=launch_dir, check=False)
+    if merged.returncode:
+        conflicts = git("diff", "--name-only", "--diff-filter=U", cwd=launch_dir, check=False)
+        git("merge", "--abort", cwd=launch_dir, check=False)
+        sys.exit(f"The launch merge conflicts:\n{conflicts}\n{merged.stdout[-1500:]}")
+    same_tree = git("rev-parse", "HEAD^{tree}", cwd=launch_dir) == git("rev-parse", f"{doors_ref}^{{tree}}")
+    return main_dir, launch_dir, same_tree
+
+
+def apply_artifacts(checkout, data_dir, announcements_dir):
+    """deploy.yaml's steps, in its order: clear the seed, unpack the data artifact over the checkout
+    (adds and overwrites, never deletes), then replace the post bundles if a tarball exists."""
+    for path in (checkout / "content/curated_resources").iterdir():
+        if path.is_file() and path.name != "_index.md":
+            path.unlink()
+    shutil.copytree(data_dir, checkout, dirs_exist_ok=True)
+    tarball = announcements_dir / "announcements.tar.gz"
+    if tarball.exists():
+        for path in (checkout / "content/post").iterdir():
+            if path.is_dir():
+                shutil.rmtree(path)
+        run(["tar", "xzf", tarball], cwd=checkout)
+    else:
+        print("::warning:: No announcements tarball; keeping the committed posts.")
+
+
+def build(checkout, hugo, logs, label):
+    result = run([hugo, "--gc", "--minify", "--cleanDestinationDir", "--destination", "public"],
+                 cwd=checkout, env={"HUGO_ENV": "production"}, log=logs / f"build-{label}.log", check=False)
+    if result.returncode:
+        sys.exit(f"Hugo failed for {label}; see {logs / f'build-{label}.log'}")
+    return checkout / "public"
+
+
+def deploy_checks(checkout, logs, label):
+    """deploy.yaml's checks, in its order, run from the checkout's own copies of the scripts."""
+    checks = [
+        ("check_sitemap_lastmod.py --compare-source --sample 200 (warns only)",
+         ["python3", "scripts/check_sitemap_lastmod.py", "public/sitemap.xml", "--compare-source", "--sample", "200"], False),
+        ("check_seo_html.py", ["python3", "scripts/check_seo_html.py", "public"], True),
+    ]
+    results = []
+    for name, cmd, blocking in checks:
+        log = logs / f"{label}-{Path(cmd[1]).stem}.log"
+        code = run(cmd, cwd=checkout, log=log, check=False).returncode
+        results.append({"check": name, "exit": code, "blocking": blocking, "log": str(log)})
+    return results
+
+
+# ---------------------------------------------------------------- production-only checks
+
+
+def html_files(public):
+    return sorted(p for p in public.rglob("*.html"))
+
+
+def head_facts(public):
+    """Per page: robots, canonical, og:url, stylesheets, and whether it is an alias redirect stub."""
+    facts = {}
+    for path in html_files(public):
+        text = path.read_text(encoding="utf-8", errors="replace")
+        head = text.split("</head>", 1)[0]
+        tags = seo_head(text)
+        value = lambda prefix: next((t.split("=", 1)[1] for t in tags if t.startswith(prefix)), None)  # noqa: E731
+        facts[str(path.relative_to(public))] = {
+            "robots": value("robots=") or "",
+            "canonical": value("canonical:="),
+            "og_url": value("og:url="),
+            "stub": bool(_REDIRECT.search(head)),
+            "sheets": STYLESHEET.findall(head),
+        }
+    return facts
+
+
+def stylesheet_text(public, facts):
+    """The text of every local stylesheet some page links to."""
+    sheets = {href for f in facts.values() for href in f["sheets"] if href.startswith("/") and not href.startswith("//")}
+    return {href: (public / href.lstrip("/")).read_text(encoding="utf-8", errors="replace")
+            for href in sorted(sheets) if (public / href.lstrip("/")).is_file()}
+
+
+def sitemap_urls(public):
+    """All <loc> entries, following a sitemap index into its child sitemaps."""
+    text = (public / "sitemap.xml").read_text(encoding="utf-8")
+    locs = re.findall(r"<loc>([^<]+)</loc>", text)
+    if "<sitemapindex" not in text:
+        return locs
+    urls = []
+    for loc in locs:
+        child = public / urlsplit(loc).path.lstrip("/")
+        urls.extend(re.findall(r"<loc>([^<]+)</loc>", child.read_text(encoding="utf-8")))
+    return urls
+
+
+def unresolved(public, urls):
+    """Sitemap URLs on the site with no built file behind them."""
+    missing = []
+    for url in urls:
+        path = unquote(urlsplit(url).path).lstrip("/")
+        if url.startswith(SITE) and not ((public / path).is_file() or (public / path / "index.html").is_file()):
+            missing.append(url)
+    return missing
+
+
+def grep_outputs(public, pattern):
+    hits = []
+    for path in public.rglob("*"):
+        if path.is_file() and path.suffix in TEXT_SUFFIXES:
+            if pattern.search(path.read_text(encoding="utf-8", errors="replace")):
+                hits.append(str(path.relative_to(public)))
+    return sorted(hits)
+
+
+def production_checks(main_public, launch_public):
+    main_facts, launch_facts = head_facts(main_public), head_facts(launch_public)
+    noindexed = lambda facts: {p for p, f in facts.items() if "noindex" in f["robots"] and not f["stub"]}  # noqa: E731
+    main_noindex, launch_noindex = noindexed(main_facts), noindexed(launch_facts)
+    off_site = lambda facts, key: {  # noqa: E731
+        p for p, f in facts.items() if f[key] and (not f[key].startswith(SITE) or "/rebrand-doors" in f[key])}
+    canonical_off = off_site(launch_facts, "canonical")
+    canonical_off_main = off_site(main_facts, "canonical")
+    # Pages main styled with the theme must now load a Doors stylesheet.
+    themed = {p for p, f in main_facts.items() if any(OLD_THEME.search(h) for h in f["sheets"])}
+    undoored = sorted(p for p in themed & launch_facts.keys()
+                      if not any("/css/doors" in h for h in launch_facts[p]["sheets"]))
+    sheets = stylesheet_text(launch_public, launch_facts)
+    old_refs = sorted({p for p, f in launch_facts.items() if any(OLD_THEME.search(h) for h in f["sheets"])}
+                      | {h for h, text in sheets.items() if OLD_THEME.search(text) or GOOGLE_FONTS.search(text)})
+    missing = lambda facts: {p for p, f in facts.items() if not f["canonical"] and not f["stub"]}  # noqa: E731
+    main_urls, launch_urls = sitemap_urls(main_public), sitemap_urls(launch_public)
+    robots = [(p / "robots.txt").read_text(encoding="utf-8") if (p / "robots.txt").exists() else None
+              for p in (main_public, launch_public)]
+    result = {
+        "noindex_pages": {"main": len(main_noindex), "launch": len(launch_noindex),
+                          "launch_only": sorted(launch_noindex - main_noindex),
+                          "main_only": sorted(main_noindex - launch_noindex)},
+        "redirect_stubs": {"main": sum(f["stub"] for f in main_facts.values()),
+                           "launch": sum(f["stub"] for f in launch_facts.values())},
+        "canonical_off_site": {"launch_only": sorted(canonical_off - canonical_off_main),
+                               "same_on_main": sorted(canonical_off & canonical_off_main)},
+        "og_url_off_site": sorted(off_site(launch_facts, "og_url")),
+        "themed_pages_without_doors_css": {"main_themed": len(themed), "missing": undoored},
+        "old_theme_or_google_fonts_referenced": old_refs,
+        "missing_canonical": {"main": len(missing(main_facts)), "launch": len(missing(launch_facts)),
+                              "launch_only": sorted(missing(launch_facts) - missing(main_facts))},
+        "sitemap_urls": {"main": len(main_urls), "launch": len(launch_urls),
+                         "off_site": sorted(u for u in launch_urls if not u.startswith(SITE) or "/rebrand-doors" in u),
+                         "only_main": sorted(set(main_urls) - set(launch_urls)),
+                         "only_launch": sorted(set(launch_urls) - set(main_urls)),
+                         "no_built_file": unresolved(launch_public, launch_urls)},
+        "robots_txt_same": robots[0] == robots[1],
+        "rebrand_doors_in_output": grep_outputs(launch_public, re.compile(r"/rebrand-doors")),
+        "google_fonts_in_output": grep_outputs(launch_public, GOOGLE_FONTS),
+        # Files that mention the old theme, linked or not: a leftover asset shows here and not above.
+        "old_theme_files_in_output": grep_outputs(launch_public, OLD_THEME),
+    }
+    hard = (result["noindex_pages"]["launch_only"] or result["canonical_off_site"]["launch_only"]
+            or result["og_url_off_site"] or undoored or old_refs
+            or result["sitemap_urls"]["off_site"] or result["sitemap_urls"]["no_built_file"]
+            or result["sitemap_urls"]["only_main"] or result["sitemap_urls"]["only_launch"]
+            or result["rebrand_doors_in_output"]
+            or result["google_fonts_in_output"]
+            or abs(len(launch_urls) - len(main_urls)) > 0.02 * max(len(main_urls), 1))
+    return result, bool(hard)
+
+
+# ---------------------------------------------------------------- the data artifact against Doors
+
+
+def blob(ref, path):
+    """The file's bytes at a ref."""
+    return subprocess.run(["git", "show", f"{ref}:{path}"], cwd=REPO, capture_output=True, check=True).stdout
+
+
+def blob_ids(ref):
+    """{path: Git blob id} for every file at a ref, with paths unquoted."""
+    listing = subprocess.run(["git", "ls-tree", "-r", "-z", ref], cwd=REPO, capture_output=True, check=True).stdout
+    ids = {}
+    for entry in listing.decode("utf-8", errors="surrogateescape").split("\0"):
+        if entry:
+            meta, path = entry.split("\t", 1)
+            ids[path] = meta.split()[2]
+    return ids
+
+
+def classify_artifact(data_dir, main_ref, doors_ref):
+    """Sort each artifact file by how it relates to the launch merge (`doors_ref`) and main.
+
+    unchanged: same as the merge. fresh: differs from the merge, which matches main (new data, as on
+    main). reverted: the merge changed it and the artifact restores main's copy. overridden: the
+    merge changed it and the artifact replaces it with something else. resurrected: the merge
+    deleted it, main has it. new: in neither checkout (generated only).
+    """
+    doors_blobs, main_blobs = blob_ids(doors_ref), blob_ids(main_ref)
+    groups = {key: [] for key in ("unchanged", "fresh", "reverted", "overridden", "resurrected", "new")}
+    for path in sorted(p for p in data_dir.rglob("*") if p.is_file()):
+        rel = str(path.relative_to(data_dir))
+        content = path.read_bytes()
+        data = hashlib.sha1(b"blob %d\0" % len(content) + content).hexdigest()
+        doors, main = doors_blobs.get(rel), main_blobs.get(rel)
+        if doors == data:
+            groups["unchanged"].append(rel)
+        elif doors is None:
+            groups["resurrected" if main is not None else "new"].append(rel)
+        elif doors == main:
+            groups["fresh"].append(rel)
+        else:
+            groups["reverted" if data == main else "overridden"].append(rel)
+    return groups
+
+
+def diff_trees(a, b):
+    """Relative paths that differ between two directories, or exist in only one."""
+    changed = []
+
+    def walk(cmp, prefix=""):
+        changed.extend(prefix + name for name in cmp.left_only + cmp.right_only + cmp.diff_files + cmp.funny_files)
+        for name, sub in cmp.subdirs.items():
+            walk(sub, f"{prefix}{name}/")
+
+    walk(filecmp.dircmp(a, b, ignore=[]))
+    return sorted(changed)
+
+
+def artifact_ab(launch_dir, groups, doors_ref, hugo, logs):
+    """Rebuild the launch with reverted and resurrected files set back to the merge (`doors_ref`),
+    and list the output that changes. An empty list means the stale files do not reach the site."""
+    suspects = groups["reverted"] + groups["overridden"] + groups["resurrected"]
+    if not suspects:
+        return []
+    first = launch_dir / "public"
+    kept = launch_dir.parent / "public-launch-with-artifact"
+    if kept.exists():
+        shutil.rmtree(kept)
+    shutil.copytree(first, kept, symlinks=True)
+    for rel in groups["resurrected"]:
+        (launch_dir / rel).unlink()
+    for rel in groups["reverted"] + groups["overridden"]:
+        (launch_dir / rel).write_bytes(blob(doors_ref, rel))
+    second = build(launch_dir, hugo, logs, "launch-without-stale-files")
+    return diff_trees(kept, second)
+
+
+# ---------------------------------------------------------------- localhost-only requests
+
+
+class QuietHandler(http.server.SimpleHTTPRequestHandler):
+    def log_message(self, *args):
+        pass
+
+
+def third_party_requests(public, sample_count=10):
+    """Load sample pages from a local server; return {page: [requests to other hosts]}."""
+    try:
+        from playwright.sync_api import sync_playwright
+    except ImportError:
+        return {"skipped": "playwright is not installed"}
+    samples = list(json.loads((HERE / "sample_pages.json").read_text(encoding="utf-8")).values())[:sample_count]
+    server = http.server.ThreadingHTTPServer(("127.0.0.1", 0), functools.partial(QuietHandler, directory=str(public)))
+    threading.Thread(target=server.serve_forever, daemon=True).start()
+    origin = f"http://127.0.0.1:{server.server_address[1]}"
+    found = {}
+    with sync_playwright() as playwright:
+        browser = playwright.chromium.launch()
+        for sample in samples:
+            # A fresh context per page: no stored consent, no cache, and every frame and worker counted.
+            context = browser.new_context(viewport={"width": 1440, "height": 900})
+            seen = []
+            context.on("request", lambda request: seen.append(request.url))
+            page = context.new_page()
+            try:
+                page.goto(origin + sample, wait_until="networkidle", timeout=60000)
+            except Exception as error:  # a page that never settles still shows what it asked for
+                seen.append(f"(load error: {str(error)[:80]})")
+            page.wait_for_timeout(3000)
+            found[sample] = sorted({url for url in seen if urlsplit(url).hostname not in ("127.0.0.1", "localhost")})
+            context.close()
+        browser.close()
+    server.shutdown()
+    return found
+
+
+# ---------------------------------------------------------------- main
+
+
+def main():
+    parser = argparse.ArgumentParser(description=__doc__, formatter_class=argparse.RawDescriptionHelpFormatter)
+    parser.add_argument("--work", required=True, type=Path, help="scratch directory outside the repository")
+    parser.add_argument("--doors-ref", default="origin/rebrand-doors")
+    parser.add_argument("--main-ref", default="origin/main")
+    parser.add_argument("--data-run", help="data-processing.yml run id (default: newest on main)")
+    parser.add_argument("--announcements-run", help="create_announcements.yml run id (default: newest on main)")
+    parser.add_argument("--skip-browser", action="store_true", help="leave out the localhost request check")
+    parser.add_argument("--keep", action="store_true", help="keep worktrees, builds, artifacts and Hugo")
+    args = parser.parse_args()
+
+    work = args.work.resolve()
+    if work == REPO or REPO in work.parents:
+        sys.exit("--work must be outside the repository")
+    logs = work / "logs"
+    logs.mkdir(parents=True, exist_ok=True)
+    try:
+        failed = rehearse(args, work, logs)
+    finally:
+        # Also after a failure part-way, so no worktree, branch or download is left behind.
+        if not args.keep:
+            for name in ("main", "launch"):
+                if (work / name).exists():
+                    git("worktree", "remove", "--force", str(work / name), check=False)
+            git("worktree", "prune", check=False)
+            git("branch", "-D", BRANCH, check=False)
+            for name in ("artifacts", "hugo", "public-launch-with-artifact"):
+                shutil.rmtree(work / name, ignore_errors=True)
+    print("FAILED: " + "; ".join(failed) if failed else "OK: nothing would fail or regress at launch.")
+    sys.exit(1 if failed else 0)
+
+
+def rehearse(args, work, logs):
+    """Run every step; return the list of hard failures."""
+    git("fetch", "origin", "--quiet")
+    summary = {"main_ref": git("rev-parse", args.main_ref), "doors_ref": git("rev-parse", args.doors_ref)}
+    failed = []
+    # Hugo's Git calls inherit GIT_ENV; confirm Git reads it as deploy.yaml's setting.
+    summary["git_core_quotepath"] = git("config", "core.quotepath")
+    if summary["git_core_quotepath"] != "false":
+        sys.exit("core.quotepath is not false for this run")
+
+    hugo, summary["hugo"] = get_hugo(work)
+    data_run, data_date = (args.data_run, None) if args.data_run else newest_artifact("data-artifact", "main")
+    ann_run, ann_date = (args.announcements_run, None) if args.announcements_run else newest_artifact("announcements-artifact", "main")
+    summary["artifacts"] = {"data": {"run": data_run, "created": data_date},
+                            "announcements": {"run": ann_run, "created": ann_date}}
+    data_dir = download("data-artifact", data_run, work / "artifacts")
+    ann_dir = download("announcements-artifact", ann_run, work / "artifacts")
+
+    print("Merging and building ...", flush=True)
+    main_dir, launch_dir, same_tree = make_checkouts(work, args.main_ref, args.doors_ref)
+    merge_head = git("rev-parse", "HEAD", cwd=launch_dir)
+    summary["merge"] = {"head": merge_head, "tree_equals_doors": same_tree}
+    # Judge the artifact against the merge that will be deployed, not the branch alone.
+    groups = classify_artifact(data_dir, args.main_ref, merge_head)
+    summary["artifact_files"] = {key: (len(value) if key in ("unchanged", "fresh", "new") else value)
+                                 for key, value in groups.items()}
+    publics = {}
+    for label, checkout in (("main", main_dir), ("launch", launch_dir)):
+        apply_artifacts(checkout, data_dir, ann_dir)
+        publics[label] = build(checkout, hugo, logs, label)
+
+    print("Running deploy.yaml's checks ...", flush=True)
+    summary["deploy_checks"] = {label: deploy_checks(checkout, logs, label)
+                                for label, checkout in (("main", main_dir), ("launch", launch_dir))}
+    failed += [f"launch: {c['check']}" for c in summary["deploy_checks"]["launch"] if c["exit"] and c["blocking"]]
+
+    compare = launch_dir / "scripts/rebrand/compare_builds.py"
+    for label, reference, extra in (("compare-main", publics["main"], []),
+                                    ("compare-baseline", launch_dir / "scripts/rebrand/baseline/paths.txt", ["--paths-only"])):
+        result = run(["python3", compare, *extra, reference, publics["launch"]], log=logs / f"{label}.log", check=False)
+        summary[label] = {"exit": result.returncode, "log": str(logs / f"{label}.log")}
+    # The baseline is a fixed record of 3 November; main has changed since, so it is reported, not judged.
+    failed += ["compare_builds against main"] if summary["compare-main"]["exit"] else []
+
+    summary["structured_data"] = {label: inventory(public)["structured_data"] for label, public in publics.items()}
+
+    print("Checking production-only output ...", flush=True)
+    summary["production"], hard = production_checks(publics["main"], publics["launch"])
+    failed += ["production output (noindex, canonical, sitemap, stray paths or old theme)"] if hard else []
+
+    if not args.skip_browser:
+        print("Loading sample pages on localhost ...", flush=True)
+        summary["third_party_before_consent"] = third_party_requests(publics["launch"])
+
+    print("Rebuilding without stale artifact files ...", flush=True)
+    summary["stale_artifact_output_changes"] = artifact_ab(launch_dir, groups, merge_head, hugo, logs)
+    failed += ["stale artifact files change the output"] if summary["stale_artifact_output_changes"] else []
+
+    summary["failed"] = failed
+    (work / "summary.json").write_text(json.dumps(summary, indent=1, ensure_ascii=False), encoding="utf-8")
+    print(json.dumps({k: v for k, v in summary.items() if k != "production"}, indent=1, ensure_ascii=False)[:6000])
+    print(f"\nFull results: {work / 'summary.json'}; logs in {logs}")
+    return failed
+
+
+if __name__ == "__main__":
+    main()
diff --git a/scripts/rebrand/render_castle_still.py b/scripts/rebrand/render_castle_still.py
new file mode 100644
index 00000000000..dafe3947827
--- /dev/null
+++ b/scripts/rebrand/render_castle_still.py
@@ -0,0 +1,48 @@
+#!/usr/bin/env python3
+"""Render the castle's still image from the same bundle the home page loads.
+
+Run after a build: python3 scripts/rebrand/render_castle_still.py <public-dir> assets/images/doors/castle-still.webp
+
+Needs Playwright and Pillow. Renders the finished stone tower on a wide transparent canvas.
+The home page crops it with `object-fit: cover`, and the scene scales by height, so the still
+lines up with the running castle when the bundle takes over.
+"""
+
+import glob
+import io
+import os
+import sys
+
+from PIL import Image
+from playwright.sync_api import sync_playwright
+
+WIDTH, HEIGHT = 1360, 800
+
+
+def main():
+    public, output = sys.argv[1:3]
+    # The newest, in case the build directory still holds an older bundle.
+    bundle = max(glob.glob(os.path.join(public, "js", "castle.*.js")), key=os.path.getmtime)
+    page_html = (
+        "<!doctype html><style>html,body{margin:0;background:transparent}"
+        f".castle-stage{{position:relative;width:{WIDTH}px;height:{HEIGHT}px}}canvas{{display:block;width:100%;height:100%}}"
+        '</style><div class="castle-stage"><canvas id="castle-canvas"></canvas></div>'
+    )
+    with sync_playwright() as playwright:
+        browser = playwright.chromium.launch(args=["--use-angle=swiftshader", "--enable-unsafe-swiftshader"])
+        page = browser.new_page(viewport={"width": WIDTH, "height": HEIGHT}, device_scale_factor=1)
+        page.set_content(page_html)
+        page.add_script_tag(path=bundle)
+        page.wait_for_function("window.forrtCastle")
+        page.evaluate(
+            "const c=window.forrtCastle;c.setVariant('stone');c.setProgress(1);c.resize();c.render(6,0,0);"
+        )
+        page.wait_for_timeout(500)
+        raw = page.screenshot(omit_background=True)
+        browser.close()
+    Image.open(io.BytesIO(raw)).save(output, "WEBP", quality=80, method=6, alpha_quality=85)
+    print(f"{output}: {os.path.getsize(output) / 1000:.0f} KB")
+
+
+if __name__ == "__main__":
+    main()
diff --git a/scripts/rebrand/sample_pages.json b/scripts/rebrand/sample_pages.json
new file mode 100644
index 00000000000..db645557333
--- /dev/null
+++ b/scripts/rebrand/sample_pages.json
@@ -0,0 +1,45 @@
+{
+  "home": "/",
+  "replication hub": "/replication-hub/",
+  "resources directory": "/resources/",
+  "resources directory (page 2)": "/resources/page/2/",
+  "article (post)": "/post/2026-01-newsletter/",
+  "article (educators' corner)": "/educators-corner/001-representation-heatherurry/",
+  "article (pedagogies)": "/pedagogies/001-julia-strand/",
+  "section page (about)": "/about/us/",
+  "section page (get involved)": "/about/get-involved/",
+  "section page (awop)": "/awop/",
+  "section page (reversals)": "/reversals/",
+  "section page (publications)": "/publications/",
+  "section page (contributors)": "/contributors/",
+  "section page (lesson plans)": "/lesson-plans/",
+  "resource detail": "/curated_resources/milgram-obedience-experiment-an-agent-ba/",
+  "glossary term (english)": "/glossary/english/abstract_bias/",
+  "glossary term (arabic)": "/glossary/arabic/aka_replicability_or_replication_crisis_ازمة_اعادة_الانتاج_او_ازمة_الت_كرار/",
+  "glossary term (chinese)": "/glossary/chinese/_兄弟_式开放科学/",
+  "glossary references": "/glossary/references/",
+  "glossary hub": "/glossary/",
+  "glossary language index": "/glossary/english/",
+  "clusters": "/clusters/",
+  "cluster": "/clusters/cluster-1/",
+  "disciplines": "/disciplines/",
+  "author profile": "/authors/lukas-wallrich/",
+  "generated list (cluster)": "/forrt_clusters/academic-life-and-culture/",
+  "generated list (category)": "/category/event/",
+  "tags browser": "/tags/",
+  "news list": "/post/",
+  "educators' corner list": "/educators-corner/",
+  "nowhere lab list": "/nowherelab/",
+  "newsletters": "/newsletters/",
+  "summaries": "/summaries/",
+  "summary": "/summaries/diversity-equity-inclusion/",
+  "one-off (ai metascience)": "/ai-metascience/",
+  "one-off (citation politics)": "/citation-politics/",
+  "one-off (contributor analysis)": "/contributor-analysis/",
+  "one-off (community map)": "/community-map/",
+  "one-off (welcome)": "/welcome/",
+  "games": "/games/",
+  "booklet": "/booklet/",
+  "chatbot": "/just_os_chatbot/",
+  "404": "/404.html"
+}
diff --git a/scripts/rebrand/screenshot_pages.py b/scripts/rebrand/screenshot_pages.py
new file mode 100644
index 00000000000..5181c709c4f
--- /dev/null
+++ b/scripts/rebrand/screenshot_pages.py
@@ -0,0 +1,196 @@
+#!/usr/bin/env python3
+"""Screenshot pages at phone and desktop size for design review.
+
+Run: python3 scripts/rebrand/screenshot_pages.py <public-dir | http(s)://site/> --out <dir>
+     [--pages "home,cluster" | --paths /about/us/,/glossary/ | --list pages.json]
+     [--max-height 7200]
+
+The first argument is either a built site, which is served locally (with its links and redirects to
+https://forrt.org/ answered from the build), or the address of a
+running site such as `hugo server` or the preview (https://forrt.org/rebrand-doors/).
+Pages default to `sample_pages.json`. Each page is shot at 390 x 844 (phone, at 2x) and
+1440 x 900 (desktop), with reduced motion, analytics blocked and the cookie banner
+already answered (`--cookie-banner` shows it). The shot runs to the end of
+the page, up to `--max-height` CSS pixels, and is cut into tiles about two screens tall so that
+a reviewer, human or model, sees the text at full size. Tiles are JPEGs named
+`<page>-<mobile|desktop>-<n>.jpg`; `manifest.json` lists them with each page's address,
+height and sideways overflow.
+
+Needs Playwright and Pillow (`pip install playwright pillow`, `playwright install chromium`).
+"""
+
+import argparse
+import functools
+import http.server
+import io
+import json
+import os
+import re
+import threading
+
+from PIL import Image
+from playwright.sync_api import Error as PlaywrightError, sync_playwright
+
+HERE = os.path.dirname(os.path.abspath(__file__))
+SIZES = {
+    "mobile": {"width": 390, "height": 844, "scale": 2},
+    "desktop": {"width": 1440, "height": 900, "scale": 1},
+}
+PRODUCTION = "https://forrt.org/"
+BLOCKED = re.compile(r"googletagmanager|google-analytics|doubleclick|youtube|eocampaign|eo\.page|docs\.google")
+
+
+class QuietHandler(http.server.SimpleHTTPRequestHandler):
+    def log_message(self, *args):
+        pass
+
+
+def serve(root):
+    handler = functools.partial(QuietHandler, directory=root)
+    server = http.server.ThreadingHTTPServer(("127.0.0.1", 0), handler)
+    threading.Thread(target=server.serve_forever, daemon=True).start()
+    return server, f"http://127.0.0.1:{server.server_address[1]}/"
+
+
+def slug(name):
+    return re.sub(r"[^a-z0-9]+", "-", name.lower()).strip("-") or "page"
+
+
+def shoot(browser, url, size, max_height, banner, local=None):
+    context = browser.new_context(
+        viewport={"width": size["width"], "height": size["height"]},
+        device_scale_factor=size["scale"], reduced_motion="reduce",
+        is_mobile=size["width"] < 600, has_touch=size["width"] < 600)
+    if not banner:  # answer the cookie banner as a returning visitor would have
+        context.add_cookies([{"name": "forrt_analytics_choice", "value": "deny", "url": address}
+                             for address in (url, PRODUCTION)])
+    page = context.new_page()
+
+    def handle(route):
+        address = route.request.url
+        if BLOCKED.search(address):
+            route.abort()
+        elif local and address.startswith(PRODUCTION):
+            # A local build's redirects and aliases name the production address; serve them here.
+            route.fulfill(response=route.fetch(url=local + address[len(PRODUCTION):]))
+        else:
+            route.continue_()
+
+    page.route("**/*", handle)
+    page.goto(url, wait_until="load", timeout=120000)
+    # Some pages forward themselves by script, which destroys the page mid-call; try again
+    # on the page it forwarded to.
+    for attempt in range(3):
+        try:
+            page.wait_for_load_state("load")
+            page.evaluate("document.fonts.ready")
+            page.wait_for_timeout(800)
+            # Scroll through once so lazy images load, then back to the top.
+            page.evaluate("""async () => {
+                for (let y = 0; y < document.documentElement.scrollHeight; y += innerHeight) {
+                    scrollTo(0, y); await new Promise(r => setTimeout(r, 60));
+                }
+                scrollTo(0, 0);
+            }""")
+            break
+        except PlaywrightError:
+            if attempt == 2:
+                raise
+    page.wait_for_timeout(400)
+    overflow = page.evaluate("document.documentElement.scrollWidth - document.documentElement.clientWidth")
+    height = page.evaluate("document.documentElement.scrollHeight")
+    clip_height = min(height, max_height)
+    raw = page.screenshot(full_page=True, clip={"x": 0, "y": 0, "width": size["width"], "height": clip_height})
+    context.close()
+    return Image.open(io.BytesIO(raw)).convert("RGB"), height, overflow
+
+
+def tiles(image, tile_px):
+    """Cut a tall image into tiles; a short last piece joins the one before it."""
+    bounds, top = [], 0
+    while top < image.height:
+        bottom = top + tile_px
+        if image.height - bottom < tile_px // 3:
+            bottom = image.height
+        bounds.append((top, bottom))
+        top = bottom
+    return [image.crop((0, a, image.width, b)) for a, b in bounds]
+
+
+def main():
+    parser = argparse.ArgumentParser(description=__doc__, formatter_class=argparse.RawDescriptionHelpFormatter)
+    parser.add_argument("site", help="built site directory, or the address of a running site")
+    parser.add_argument("--out", required=True)
+    parser.add_argument("--pages", help="comma-separated names from sample_pages.json")
+    parser.add_argument("--paths", help="comma-separated paths to shoot instead of sample_pages.json")
+    parser.add_argument("--list", help="a JSON file of {name: path} to shoot instead of sample_pages.json")
+    parser.add_argument("--sizes", default="mobile,desktop", help="mobile, desktop, or both (mobile,desktop)")
+    parser.add_argument("--max-height", type=int, default=7200, help="CSS pixels shot per page")
+    parser.add_argument("--quality", type=int, default=78)
+    parser.add_argument("--cookie-banner", action="store_true", help="show the cookie banner")
+    args = parser.parse_args()
+
+    if args.list:
+        with open(args.list, encoding="utf-8") as handle:
+            samples = json.load(handle)
+    elif args.paths:
+        samples = {path.strip("/") or "home": path for path in args.paths.split(",")}
+    else:
+        with open(os.path.join(HERE, "sample_pages.json"), encoding="utf-8") as handle:
+            samples = json.load(handle)
+        if args.pages:
+            wanted = [name.strip() for name in args.pages.split(",")]
+            missing = [name for name in wanted if name not in samples]
+            if missing:
+                parser.error(f"not in sample_pages.json: {', '.join(missing)}")
+            samples = {name: samples[name] for name in wanted}
+
+    sizes = list(SIZES) if args.sizes == "both" else [size.strip() for size in args.sizes.split(",")]
+    unknown = [size for size in sizes if size not in SIZES]
+    if unknown:
+        parser.error(f"unknown size: {', '.join(unknown)}")
+    # Tiles are named after the page's slug, so two names with one slug would overwrite each other.
+    slugs = {}
+    for name in samples:
+        slugs.setdefault(slug(name), []).append(name)
+    clashes = [" and ".join(names) for names in slugs.values() if len(names) > 1]
+    if clashes:
+        parser.error(f"page names that share a file name: {'; '.join(clashes)}")
+
+    server = None
+    if re.match(r"https?://", args.site):
+        origin = args.site.rstrip("/") + "/"
+    else:
+        server, origin = serve(os.path.abspath(args.site))
+    local = None if server is None else origin
+    os.makedirs(args.out, exist_ok=True)
+
+    manifest = {}
+    with sync_playwright() as playwright:
+        browser = playwright.chromium.launch()
+        for name, path in samples.items():
+            entry = {"path": path}
+            for size_name in sizes:
+                size = SIZES[size_name]
+                image, height, overflow = shoot(browser, origin + path.lstrip("/"), size, args.max_height,
+                                                args.cookie_banner, local)
+                files = []
+                for number, tile in enumerate(tiles(image, 2 * size["height"] * size["scale"]), 1):
+                    filename = f"{slug(name)}-{size_name}-{number}.jpg"
+                    tile.save(os.path.join(args.out, filename), "JPEG", quality=args.quality, optimize=True)
+                    files.append(filename)
+                entry[size_name] = {"height": height, "cut_off": height > args.max_height,
+                                    "overflow_px": overflow, "tiles": files}
+            manifest[name] = entry
+            print(f"{name}: " + ", ".join(
+                f"{key} {len(entry[key]['tiles'])} tiles" for key in SIZES if key in entry), flush=True)
+        browser.close()
+    if server:
+        server.shutdown()
+    with open(os.path.join(args.out, "manifest.json"), "w", encoding="utf-8") as handle:
+        json.dump(manifest, handle, indent=1, ensure_ascii=False)
+        handle.write("\n")
+
+
+if __name__ == "__main__":
+    main()
diff --git a/scripts/rebrand/sister_sites.txt b/scripts/rebrand/sister_sites.txt
new file mode 100644
index 00000000000..9de358e17a6
--- /dev/null
+++ b/scripts/rebrand/sister_sites.txt
@@ -0,0 +1,31 @@
+# Other FORRT repositories that GitHub Pages serves at forrt.org/<name>/.
+# From: gh api --paginate orgs/forrtproject/repos --jq '.[]|select(.has_pages)|.name'
+# The redesign must not claim these paths. Links to them are allowed to leave the build.
+Transform-to-Open-Science-Book-jupyter
+best-practices-psychology
+chromium-extension
+diamond-reviewer
+flora-explorer
+flora-pubpeer
+flora-replication-atlas
+flora-validation
+flora-zotero
+fred
+fred-apps
+handbook
+journalranking
+love-replications-week
+map-community
+marco
+merch-design-vote
+open-research-course
+open-social-psychology
+plugin-notification-dummy
+re-searchterms
+replicate-this
+replicatethis
+replication-handbook
+reprocrowd
+rjf
+tenure-run
+transform-to-open-science-book
diff --git a/scripts/rebrand/site_inventory.py b/scripts/rebrand/site_inventory.py
new file mode 100644
index 00000000000..2b366888a18
--- /dev/null
+++ b/scripts/rebrand/site_inventory.py
@@ -0,0 +1,209 @@
+#!/usr/bin/env python3
+"""Describe a built site: its output paths, structured data and SEO head tags.
+
+Run: python3 scripts/rebrand/site_inventory.py public --out scripts/rebrand/baseline
+
+Writes paths.txt (every output file), structured_data.json (JSON-LD records by
+type and template group) and seo_heads.json (a digest of each page's SEO tags).
+compare_builds.py compares two of these. Importing this module gives the same data
+without writing files.
+"""
+
+import argparse
+import hashlib
+import json
+import os
+import re
+import sys
+from collections import Counter, defaultdict
+from html.parser import HTMLParser
+
+# Build-specific names: Hugo's processed-image hashes and fingerprinted bundles.
+_HASHES = [
+    (re.compile(r"_hu_?[0-9a-f]{8,}(?=[._])"), "_hu"),
+    (re.compile(r"\.[0-9a-f]{32,64}(?=\.(?:css|js)$)"), ".FINGERPRINT"),
+]
+# File types that are addresses people or crawlers use, not build assets.
+PAGE_SUFFIXES = (".html", ".xml", ".json", ".webmanifest", ".txt")
+_LD_JSON = re.compile(
+    r"<script[^>]*type=[\"']?application/ld\+json[\"']?[^>]*>(.*?)</script>", re.S
+)
+_REDIRECT = re.compile(r"<meta[^>]+http-equiv=[\"']?refresh", re.I)
+
+
+def normalise_path(path):
+    for pattern, replacement in _HASHES:
+        path = pattern.sub(replacement, path)
+    return path
+
+
+def list_paths(root):
+    paths = []
+    for directory, _, files in os.walk(root):
+        for name in files:
+            full = os.path.join(directory, name)
+            rel = os.path.relpath(full, root).replace(os.sep, "/")
+            if rel in ("CNAME", ".nojekyll") or rel.endswith(".gitkeep"):
+                continue
+            paths.append(rel)
+    return sorted(paths)
+
+
+def template_group(path, text=""):
+    """The template family that produced a page, as far as its path and text show.
+
+    Follows the groups in the migration plan's inventory. Widget and plain pages
+    share no path pattern, so they fall into "section or plain page".
+    """
+    if text and _REDIRECT.search(text[:2000]):
+        return "redirect stub"
+    parts = path.split("/")[:-1]
+    if not parts:
+        return {"index.html": "home", "404.html": "404"}.get(path, "standalone")
+    head, depth = parts[0], len(parts)
+    if "page" in parts and parts[-2:-1] == ["page"]:
+        return "generated list"
+    if head == "curated_resources":
+        return "resource detail" if depth == 2 else "generated list"
+    if head == "glossary":
+        if depth >= 3 or parts[1:] == ["references"]:
+            return "glossary term"
+        return "glossary list"
+    if head == "authors":
+        return "author profile"
+    if head in ("clusters", "disciplines"):
+        return "clusters and disciplines"
+    if head in ("forrt_clusters", "category", "categories", "publication_types"):
+        return "generated list"
+    if head == "tags":
+        return "tags browser"
+    if head in ("post", "educators-corner", "pedagogies", "nowherelab", "newsletters"):
+        return "article" if depth >= 2 else "news and section list"
+    if head == "summaries":
+        return "summaries"
+    if head in ("admin", "apps", "explorer", "annotator", "awop_app", "partials", "js",
+                "open-research-games-portal"):
+        return "standalone"
+    return "section or plain page"
+
+
+def _ld_types(node):
+    if isinstance(node, list):
+        for item in node:
+            yield from _ld_types(item)
+    elif isinstance(node, dict):
+        if "@graph" in node:
+            yield from _ld_types(node["@graph"])
+        elif "@type" in node:
+            kind = node["@type"]
+            yield kind if isinstance(kind, str) else "+".join(kind)
+
+
+class _HeadParser(HTMLParser):
+    """Collects the tags that search engines and link previews read."""
+
+    KEEP_META = re.compile(r"^(description|robots|og:|twitter:|article:|keywords)")
+
+    def __init__(self):
+        super().__init__(convert_charrefs=True)
+        self.tags = []
+        self.title = []
+        self._in_title = False
+
+    def handle_starttag(self, tag, attrs):
+        attrs = dict(attrs)
+        if tag == "title":
+            self._in_title = True
+        elif tag == "meta":
+            key = attrs.get("property") or attrs.get("name") or ""
+            if self.KEEP_META.match(key):
+                self.tags.append(f"{key}={attrs.get('content', '')}")
+        elif tag == "link" and attrs.get("rel") in ("canonical", "alternate"):
+            if attrs.get("rel") == "canonical" or "hreflang" in attrs or "type" in attrs:
+                self.tags.append(
+                    f"{attrs.get('rel')}:{attrs.get('hreflang', attrs.get('type', ''))}"
+                    f"={attrs.get('href', '')}"
+                )
+
+    def handle_endtag(self, tag):
+        if tag == "title":
+            self._in_title = False
+
+    def handle_data(self, data):
+        if self._in_title:
+            self.title.append(data)
+
+
+def seo_head(text):
+    """The sorted SEO tags from a page's head, plus each JSON-LD block."""
+    head = text.split("</head>", 1)[0]
+    parser = _HeadParser()
+    parser.feed(re.sub(r"<script.*?</script>", "", head, flags=re.S))
+    tags = sorted(parser.tags)
+    tags.append("title=" + "".join(parser.title).strip())
+    tags.extend(sorted(_LD_JSON.findall(text)))
+    return tags
+
+
+def inventory(root, skip=None):
+    """Paths, JSON-LD counts by template group, and per-page SEO tags. `skip` leaves pages out of the
+    counts, for agreed removals."""
+    paths = list_paths(root)
+    structured = defaultdict(Counter)
+    heads = {}
+    bad_json = []
+    for path in paths:
+        if not path.endswith(".html"):
+            continue
+        with open(os.path.join(root, path), encoding="utf-8", errors="replace") as handle:
+            text = handle.read()
+        group = template_group(path, text)
+        counted = not (skip and skip(path))
+        if counted:
+            structured[group]["pages"] += 1
+        for block in _LD_JSON.findall(text):
+            try:
+                data = json.loads(block)
+            except ValueError:
+                bad_json.append(path)
+                continue
+            if counted:
+                structured[group].update(_ld_types(data))
+        if group not in ("redirect stub", "standalone"):
+            heads[path] = seo_head(text)
+    return {
+        "paths": paths,
+        "structured_data": {key: dict(value) for key, value in sorted(structured.items())},
+        "seo_heads": heads,
+        "invalid_json_ld": bad_json,
+    }
+
+
+def digest(tags):
+    return hashlib.sha256("\n".join(tags).encode("utf-8")).hexdigest()[:16]
+
+
+def main():
+    parser = argparse.ArgumentParser(description=__doc__)
+    parser.add_argument("public", help="built site directory")
+    parser.add_argument("--out", required=True, help="directory for the inventory files")
+    args = parser.parse_args()
+
+    data = inventory(args.public)
+    os.makedirs(args.out, exist_ok=True)
+    with open(os.path.join(args.out, "paths.txt"), "w", encoding="utf-8") as handle:
+        handle.write("\n".join(normalise_path(path) for path in data["paths"]) + "\n")
+    with open(os.path.join(args.out, "structured_data.json"), "w", encoding="utf-8") as handle:
+        json.dump(data["structured_data"], handle, indent=1, sort_keys=True)
+        handle.write("\n")
+    with open(os.path.join(args.out, "seo_heads.json"), "w", encoding="utf-8") as handle:
+        json.dump({path: digest(tags) for path, tags in data["seo_heads"].items()}, handle,
+                  indent=0, sort_keys=True, ensure_ascii=False)
+        handle.write("\n")
+    print(f"{len(data['paths'])} files; {sum(g['pages'] for g in data['structured_data'].values())} HTML")
+    if data["invalid_json_ld"]:
+        print(f"Invalid JSON-LD on {len(data['invalid_json_ld'])} pages", file=sys.stderr)
+
+
+if __name__ == "__main__":
+    main()
diff --git a/scripts/render_clusters_share_image.py b/scripts/render_clusters_share_image.py
new file mode 100644
index 00000000000..cd5820748ca
--- /dev/null
+++ b/scripts/render_clusters_share_image.py
@@ -0,0 +1,73 @@
+#!/usr/bin/env python3
+"""Render the clusters illustration (layouts/partials/clusters/map.html) as the /clusters/ share image.
+
+Run after the clusters change: build the site, then
+    python3 scripts/render_clusters_share_image.py <build-dir>
+It writes content/clusters/FORRT_Clusters.webp (1200x630), the page's sharing_image_resource;
+the build turns it into a PNG for social previews.
+
+Needs Playwright and Pillow: `pip install playwright pillow`, then `python3 -m playwright install chromium`.
+"""
+import functools
+import http.server
+import sys
+import threading
+from io import BytesIO
+from pathlib import Path
+
+from PIL import Image
+from playwright.sync_api import sync_playwright
+
+ROOT = Path(__file__).resolve().parents[1]
+OUT = ROOT / "content/clusters/FORRT_Clusters.webp"
+
+ISOLATE = """() => {
+  const art = document.querySelector('.clusters-map__art').cloneNode(true);
+  const clusters = art.querySelectorAll('.clusters-map__cluster').length;
+  const pills = art.querySelectorAll('.clusters-map__pill').length;
+  const head = document.createElement('div');
+  head.className = 'clusters-head';  // keeps the page's heading style
+  const h1 = document.querySelector('h1').cloneNode(true);
+  h1.style.margin = '0 0 16px';
+  const line = document.createElement('p');
+  line.textContent = `${clusters} clusters, ${pills} sub-clusters`;
+  line.style.cssText = 'margin:0;font-size:26px;color:var(--soft)';
+  head.append(h1, line);
+  head.style.cssText = 'flex:0 0 300px';
+  art.removeAttribute('width');
+  art.removeAttribute('height');
+  art.style.cssText = 'height:600px;width:auto;flex:none;margin-left:auto';
+  document.body.innerHTML = '';
+  const main = document.createElement('main');
+  main.style.cssText = 'display:flex;align-items:center;gap:24px;padding:15px 30px 15px 50px;width:1200px;height:630px;box-sizing:border-box;overflow:hidden';
+  main.append(head, art);
+  document.body.append(main);
+  return Promise.all([document.fonts.ready, ...[...art.querySelectorAll('image')].map((img) =>
+    new Promise((done) => { const probe = new Image(); probe.onload = probe.onerror = done; probe.src = img.href.baseVal; }))]);
+}"""
+
+
+def main(build):
+    handler = functools.partial(http.server.SimpleHTTPRequestHandler, directory=build)
+    server = http.server.ThreadingHTTPServer(("127.0.0.1", 0), handler)
+    threading.Thread(target=server.serve_forever, daemon=True).start()
+    try:
+        with sync_playwright() as p:
+            browser = p.chromium.launch()
+            page = browser.new_page(viewport={"width": 1200, "height": 630}, device_scale_factor=2)  # drawn at twice the size, then scaled down
+            page.goto(f"http://127.0.0.1:{server.server_port}/clusters/", wait_until="networkidle")
+            page.evaluate(ISOLATE)
+            page.wait_for_timeout(300)
+            png = page.screenshot(clip={"x": 0, "y": 0, "width": 1200, "height": 630})
+            browser.close()
+    finally:
+        server.shutdown()
+    image = Image.open(BytesIO(png)).convert("RGB").resize((1200, 630), Image.LANCZOS)
+    image.save(OUT, "WEBP", quality=90, method=6)
+    print("wrote", OUT.relative_to(ROOT))
+
+
+if __name__ == "__main__":
+    if len(sys.argv) != 2:
+        sys.exit(__doc__)
+    main(sys.argv[1])
diff --git a/scripts/tests/test_404_redirects.py b/scripts/tests/test_404_redirects.py
new file mode 100644
index 00000000000..da2f20d0c08
--- /dev/null
+++ b/scripts/tests/test_404_redirects.py
@@ -0,0 +1,52 @@
+"""Run the 404 page's redirect script in Node.js and check where it sends old URLs (#1035)."""
+
+import json
+from pathlib import Path
+import re
+import shutil
+import subprocess
+import unittest
+
+ROOT = Path(__file__).resolve().parents[2]
+BASE_TEMPLATE = '{{ strings.TrimSuffix "/" (urls.Parse site.BaseURL).Path }}'
+# Runs the script once per URL with a stub window.location and prints each redirect target.
+RUNNER = """
+const vm = require('node:vm');
+const { script, urls } = JSON.parse(require('node:fs').readFileSync(0, 'utf8'));
+const targets = urls.map(url => {
+  const u = new URL(url, 'https://example.org');
+  let target = null;
+  vm.runInNewContext(script, { window: { location: {
+    pathname: u.pathname, search: u.search, hash: u.hash, replace: t => { target = t; } } } });
+  return target;
+});
+process.stdout.write(JSON.stringify(targets));
+"""
+
+
+@unittest.skipUnless(shutil.which("node"), "Node.js is required to run the redirect script")
+class RedirectTests(unittest.TestCase):
+    def redirects(self, base, urls):
+        template = (ROOT / "layouts/404.html").read_text(encoding="utf-8")
+        script = re.search(r"<script>(.*?)</script>", template, re.S).group(1)
+        self.assertIn(BASE_TEMPLATE, script, "The 404 page's base expression changed; update this test")
+        result = subprocess.run(["node", "-e", RUNNER], check=True, capture_output=True, text=True,
+                                input=json.dumps({"script": script.replace(BASE_TEMPLATE, base), "urls": urls}))
+        return json.loads(result.stdout)
+
+    def test_query_and_fragment_survive_the_redirect(self):
+        for base in ("", "/rebrand-doors"):
+            with self.subTest(base=base):
+                self.assertEqual(self.redirects(base, [
+                    base + "/replication_handbook/chapter.html?view=full#section-2",
+                    base + "/FReD#top",
+                    base + "/curated_resources/old/?q=a%20b",
+                ]), [
+                    "/replication-handbook/chapter.html?view=full#section-2",  # sister sites: domain root
+                    "/fred#top",
+                    base + "/resources/?q=a%20b",
+                ])
+
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/scripts/tests/test_bundle_exclusions.py b/scripts/tests/test_bundle_exclusions.py
new file mode 100644
index 00000000000..8f21c0a5cca
--- /dev/null
+++ b/scripts/tests/test_bundle_exclusions.py
@@ -0,0 +1,33 @@
+"""Hugo's ignoreFiles keeps generator scripts and drafts in content/ out of the site (#976).
+
+Run: python3 -m unittest discover -s scripts/tests -p test_bundle_exclusions.py
+"""
+
+from pathlib import Path
+import re
+import tomllib
+import unittest
+
+ROOT = Path(__file__).resolve().parents[2]
+CONFIG = tomllib.loads((ROOT / "config/_default/config.toml").read_text(encoding="utf-8"))
+
+
+def ignored(path):
+    return any(re.search(pattern, path) for pattern in CONFIG["ignoreFiles"])
+
+
+class BundleExclusionTests(unittest.TestCase):
+    def test_generator_scripts_and_drafts_are_ignored(self):
+        for path in sorted(ROOT.glob("content/**/*.py")) + sorted(ROOT.glob("content/**/*.mdOUT")):
+            with self.subTest(path=path):
+                self.assertTrue(ignored(str(path.relative_to(ROOT))))
+
+    def test_pages_and_bundle_assets_are_not_ignored(self):
+        for path in ("content/summaries/_index.md", "content/summaries/FORRT_O&R_101_Syllabus.pdf",
+                     "content/glossary/apa_lookup.json", "content/clusters/FORRT_Clusters.webp"):
+            with self.subTest(path=path):
+                self.assertFalse(ignored(path))
+
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/scripts/tests/test_check_seo_html.py b/scripts/tests/test_check_seo_html.py
index 5c1328a37cc..2870e77b306 100644
--- a/scripts/tests/test_check_seo_html.py
+++ b/scripts/tests/test_check_seo_html.py
@@ -1,5 +1,9 @@
 """Run with python3 -m unittest discover -s scripts/tests -p test_check_seo_html.py."""
 from pathlib import Path
+import json
+from contextlib import redirect_stdout
+from io import StringIO
+from html import escape
 import sys
 import tempfile
 import unittest
@@ -36,8 +40,263 @@ def test_double_escaped_entities_fail(self):
                 self.assertIn(entity, failures[0])
 
 
+def page_from_html(text, path="index.html"):
+    parser = seo.PageParser()
+    parser.feed(text)
+    return seo.Page(path, parser)
+
+
+class DescriptionURLReport(unittest.TestCase):
+    def test_plain_domain_and_visitors_summary_pass(self):
+        for text in ("Visit forrt.org", "Where forrt.org's visitors come from and which pages they read, over the past 30 days and the past year."):
+            self.assertEqual(seo.check_description_urls([
+                page_from_html('<meta name="description" content="%s">' % escape(text))]), [])
+
+    def test_raw_urls_and_bare_site_paths_fail(self):
+        for text in ("See https://example.org", "See HTTP://example.org", "Read forrt.org/resources/", "www.forrt.org/about/"):
+            with self.subTest(text=text):
+                page = page_from_html('<meta name="description" content="%s">' % escape(text))
+                self.assertEqual(seo.check_description_urls([page]), ["index.html"])
+
+    def test_raw_url_report_does_not_fail_otherwise_valid_build(self):
+        with tempfile.TemporaryDirectory() as public:
+            html = ("<meta name='description' content='See https://example.org'>"
+                    "<meta property='og:image' content='https://example.org/share.png'>"
+                    "<meta name='twitter:image' content='https://example.org/share.png'>"
+                    "<meta property='og:image:type' content='image/png'>"
+                    "<meta property='og:image:width' content='1200'>"
+                    "<meta property='og:image:height' content='630'>"
+                    "<meta name='twitter:card' content='summary_large_image'>")
+            (Path(public) / "index.html").write_text(html, encoding="utf-8")
+            cluster = Path(public) / "clusters" / "cluster-1" / "index.html"
+            cluster.parent.mkdir(parents=True)
+            cluster.write_text("<meta name='description' content='Cluster 1'><h1>Cluster 1</h1>", encoding="utf-8")
+            flora = Path(public) / seo.FLORA_PAGE
+            flora.parent.mkdir(parents=True)
+            flora.write_text("<meta name='description' content='FLoRA'><h1>FLoRA</h1><p>https://doi.org/10.17605/OSF.IO/9R62X</p>", encoding="utf-8")
+            output = StringIO()
+            with redirect_stdout(output):
+                self.assertEqual(seo.main(public), 0)
+            self.assertIn("pages whose meta description contains a raw URL: 1", output.getvalue())
+
+    def test_nonindexable_descriptions_are_not_reported(self):
+        for exclusion in ("<meta name='robots' content='noindex'>",
+                          "<meta http-equiv='refresh' content='0;url=/other/'>",
+                          "<link rel='canonical' href='https://example.org/other/'>"):
+            with self.subTest(exclusion=exclusion):
+                page = page_from_html("<meta name='description' content='See https://example.org'>" + exclusion)
+                self.assertFalse(page.indexable)
+                self.assertEqual(seo.check_description_urls([page]), [])
+
+
+class ShareImageMetadataCheck(unittest.TestCase):
+    def page(self, **overrides):
+        meta = {"og:image": "https://example.org/preview/social/test.png",
+                "twitter:image": "https://example.org/preview/social/test.png",
+                "og:image:type": "image/png", "og:image:width": "7", "og:image:height": "5"}
+        meta.update(overrides)
+        return page_from_html("".join('<meta property="%s" content="%s">' % (k, v) for k, v in meta.items()))
+
+    def test_matching_png_metadata_passes(self):
+        self.assertEqual(seo.check_share_image_metadata([self.page()]), [])
+
+    def test_incorrect_type_dimensions_or_twitter_url_fail(self):
+        for change in ({"og:image:type": "image/webp"}, {"og:image:width": "0"},
+                       {"og:image:height": "unknown"}, {"twitter:image": "original.webp"}):
+            with self.subTest(change=change):
+                self.assertTrue(seo.check_share_image_metadata([self.page(**change)]))
+
+    def test_undecodable_original_remains_report_only(self):
+        self.assertEqual(seo.check_share_image_metadata([self.page(**{"og:image": "original.webp"})]), [])
+
+
+class ResourcePaginationCheck(unittest.TestCase):
+    def pages(self, prefix=""):
+        pages = []
+        for number in (1, 2, 3):
+            relative = "resources/" + ("page/%d/" % number if number > 1 else "")
+            url = "https://example.org" + prefix + "/" + relative
+            name = "Resources" + (" – Page %d" % number if number > 1 else "")
+            resource = prefix + "/curated_resources/item-%d/" % number
+            data = {"@type": "CollectionPage", "@id": url + "#collection", "url": url, "name": name,
+                    "mainEntity": {"numberOfItems": 1, "itemListElement": [{"url": "https://example.org" + resource}]}}
+            text = ('<title>%s | FORRT</title><link rel="canonical" href="%s">'
+                    '<meta property="og:url" content="%s"><meta property="og:title" content="%s | FORRT">'
+                    '<meta name="description" content="Resources, page %d of 3">'
+                    '<script type="application/ld+json">%s</script>'
+                    '<h2 class="res-title"><a href="%s">Resource</a></h2>') % (name, url, url, name, number, json.dumps(data), resource)
+            pages.append(page_from_html(text, relative + "index.html"))
+        return pages
+
+    def test_self_canonical_numbered_subsets_pass_with_preview_prefix(self):
+        for prefix in ("", "/rebrand-doors"):
+            with self.subTest(prefix=prefix):
+                self.assertEqual(seo.check_resource_pagination(self.pages(prefix)), [])
+
+    def test_staging_noindex_applies_to_directory_and_subsets(self):
+        pages = self.pages("/rebrand-doors")
+        for page in pages:
+            page.noindex = True
+        self.assertEqual(seo.check_resource_pagination(pages), [])
+
+    def test_repeated_first_page_metadata_fails(self):
+        pages = self.pages()
+        pages[1].canonical = pages[0].canonical
+        pages[1].title = pages[0].title
+        pages[1].descriptions = pages[0].descriptions
+        failures = seo.check_resource_pagination(pages)
+        self.assertEqual(len(failures), 1)
+        for text in ("not self-canonical", "repeated title", "repeated description", "omits page number"):
+            self.assertIn(text, failures[0])
+
+    def test_wrong_structured_subset_fails(self):
+        pages = self.pages()
+        pages[1].resource_links = pages[0].resource_links
+        self.assertIn("subset does not match HTML cards", seo.check_resource_pagination(pages)[0])
+
+    def test_query_canonical_is_never_used_for_subsets(self):
+        pages = self.pages()
+        pages[1].canonical += "?type=reading"
+        self.assertIn("not self-canonical", seo.check_resource_pagination(pages)[0])
+
+
+class InlineScriptCheck(unittest.TestCase):
+    def failures(self, body):
+        with tempfile.TemporaryDirectory() as public:
+            (Path(public) / "index.html").write_text("<html><body>%s</body></html>" % body, encoding="utf-8")
+            return seo.check_inline_scripts(seo.load_pages(public))
+
+    def test_small_inline_and_external_scripts_pass(self):
+        self.assertEqual(self.failures("<script>var a = 1;</script><script src='big.js'></script>"), [])
+
+    def test_inline_data_over_the_limit_fails(self):
+        data = "x" * (seo.MAX_INLINE_SCRIPT + 1)
+        self.assertEqual(self.failures("<script>window.DATA = '%s';</script>" % data), ["index.html (200 KB)"])
+
+    def test_unclosed_inline_data_fails(self):
+        data = "x" * (seo.MAX_INLINE_SCRIPT + 1)
+        self.assertEqual(self.failures("<script>window.DATA = '%s';" % data), ["index.html (200 KB)"])
+
+
+class CitationTargetCheck(unittest.TestCase):
+    def check(self, html):
+        parser = seo.PageParser()
+        parser.feed(html)
+        return seo.check_citation_targets([seo.Page("example/index.html", parser)])
+
+    def test_reference_after_citation(self):
+        self.assertEqual(self.check('<a class="cite" href="#ref-Key">Author, 2020</a>'
+                                    '<li id="ref-Key">Reference</li>'), [])
+
+    def test_missing_reference_or_nonlocal_link(self):
+        for href in ('#ref-Unknown', '/other/#ref-Key', '#Key', ''):
+            with self.subTest(href):
+                self.assertTrue(self.check('<a class="other cite" href="%s">Citation</a>'
+                                           '<li id="ref-Key">Reference</li>' % href))
+
+    def test_other_links_are_ignored(self):
+        self.assertEqual(self.check('<a href="#elsewhere">Link</a>'), [])
+
+
+class GlossaryTitleMarkdownCheck(unittest.TestCase):
+    def check(self, title, h1, path="glossary/english/term/index.html"):
+        html = "<title>%s</title><h1>%s</h1>" % (title, h1)
+        return seo.check_glossary_title_markdown([page_from_html(html, path)])
+
+    def test_rendered_emphasis_and_lone_asterisk_pass(self):
+        self.assertEqual(self.check("Research Contribution Metric (p) | FORRT",
+                                    "Research Contribution Metric (<em>p</em>)"), [])
+        self.assertEqual(self.check("G*Power | FORRT", "G*Power"), [])
+        self.assertEqual(self.check("G*Power and P*Hack | FORRT", "G*Power and P*Hack"), [])
+
+    def test_literal_emphasis_fails_on_glossary_pages_only(self):
+        self.assertEqual(len(self.check("Research Contribution Metric (*p*) | FORRT", "x")), 1)
+        self.assertEqual(len(self.check("x", "Research Contribution Metric (*p*)")), 1)
+        self.assertEqual(len(self.check("x", "*p*-value")), 1)
+        self.assertEqual(self.check("x", "*p*", path="post/x/index.html"), [])
+
+
+class GlossaryLinkCheck(unittest.TestCase):
+    def check_links(self, hrefs, base="https://forrt.org/"):
+        with tempfile.TemporaryDirectory() as public:
+            root = Path(public)
+            term = root / "glossary/english/preregistration/index.html"
+            term.parent.mkdir(parents=True)
+            term.write_text('<link rel="canonical" href="%sglossary/english/preregistration/">' % base)
+            links = "".join('<a class="other gloss-term" href="%s">term</a>' % href for href in hrefs)
+            (root / "index.html").write_text('<link rel="canonical" href="%s">%s' % (base, links))
+            return seo.check_glossary_links(seo.load_pages(public))
+
+    def test_existing_term_and_preview_base_pass(self):
+        for base in ("https://forrt.org/", "https://forrt.org/rebrand-doors/"):
+            with self.subTest(base=base):
+                self.assertEqual(self.check_links([
+                    base + "glossary/english/preregistration/",
+                    "glossary/english/preregistration/#definition",
+                ], base), [])
+
+    def test_missing_non_english_external_and_empty_links_fail(self):
+        links = ["/glossary/english/missing/", "/glossary/german/preregistration/",
+                 "https://example.org/glossary/english/preregistration/", ""]
+        self.assertEqual(len(self.check_links(links)), len(links))
+
+
+class BreadcrumbLinks(unittest.TestCase):
+    def test_crumb_links_need_a_target(self):
+        good = page_from_html('<nav class="crumbs"><a href="/">Home</a> <a href="/about/">About</a></nav>')
+        bad = page_from_html('<nav class="crumbs"><a href="/">Home</a> <a href>About</a></nav><a href>x</a>')
+        self.assertEqual(good.crumb_links, ["/", "/about/"])
+        self.assertEqual(bad.crumb_links, ["/", ""])
+
+
+class ClusterTitleMarkupCheck(unittest.TestCase):
+    def check(self, body):
+        with tempfile.TemporaryDirectory() as public:
+            page = Path(public) / "clusters" / "cluster-1" / "index.html"
+            page.parent.mkdir(parents=True)
+            page.write_text("<div class=fc-title>%s</div>" % body, encoding="utf-8")
+            return seo.check_cluster_title_markup(public)
+
+    def test_rendered_markup_passes(self):
+        self.assertEqual(self.check("In <span class=scp>A</span>frica at <i>Cognition</i> (p &lt; .05)"), [])
+
+    def test_literal_or_unrendered_markup_fails(self):
+        for body in ("at &lt;i&gt;Cognition&lt;/i&gt;", "in <scp>A</scp>frica", "&lt;em&gt;AIMS&lt;/em&gt;",
+                     "at &amp;lt;i&amp;gt;Cognition&amp;lt;/i&amp;gt;"):
+            self.assertEqual(self.check(body), ["clusters/cluster-1/index.html"], body)
+
+    def test_missing_cluster_pages_fail(self):
+        with tempfile.TemporaryDirectory() as public:
+            self.assertEqual(seo.check_cluster_title_markup(public), ["clusters/ (no cluster pages found)"])
+
+
+def clusters_map_failures(page):
+    with tempfile.TemporaryDirectory() as public:
+        (Path(public) / "clusters").mkdir()
+        (Path(public) / "clusters" / "index.html").write_text(page, encoding="utf-8")
+        return seo.check_clusters_map(public)
+
+
+class ClustersMapCheck(unittest.TestCase):
+    MAP = ('<figure class="clusters-map"><svg class="clusters-map__art" aria-hidden="true">'
+           '<g><a href="#cluster-1" tabindex="-1"><rect></rect><text><tspan>One</tspan></text></a></g></svg>'
+           '<details><summary>List</summary><ol><li><a href="#c1-a">A</a></li></ol></details></figure>'
+           '<section id="cluster-1"><div id="c1-a"></div></section><a href="#elsewhere">not in the map</a>')
+
+    def test_hidden_drawing_with_targets_passes(self):
+        self.assertEqual(clusters_map_failures(self.MAP), [])
+
+    def test_tab_stop_visible_drawing_or_missing_target_fails(self):
+        for change in (('tabindex="-1"', ""), ('aria-hidden="true"', ""), ('id="c1-a"', 'id="c1-b"')):
+            with self.subTest(change):
+                self.assertEqual(len(clusters_map_failures(self.MAP.replace(*change))), 1)
+
+    def test_page_without_the_drawing_fails(self):
+        self.assertTrue(clusters_map_failures("<p>No map</p>"))
+
+
 def flora_failures(html):
-    """Check 11 on a FLoRA page with this HTML (None: no page)."""
+    """Check 22 on a FLoRA page with this HTML (None: no page)."""
     with tempfile.TemporaryDirectory() as public:
         if html is not None:
             page = Path(public) / seo.FLORA_PAGE
diff --git a/scripts/tests/test_citation_matches.py b/scripts/tests/test_citation_matches.py
new file mode 100644
index 00000000000..3500fa14b60
--- /dev/null
+++ b/scripts/tests/test_citation_matches.py
@@ -0,0 +1,47 @@
+"""Exercise the browser's pure matching module with Node, without building Hugo."""
+from pathlib import Path
+import shutil
+import subprocess
+import unittest
+
+
+@unittest.skipUnless(shutil.which("node"), "Node is needed for the pure JavaScript matcher")
+class CitationMatches(unittest.TestCase):
+    def test_conservative_author_year_matching(self):
+        result = subprocess.run(["node", "--input-type=module", "-"], cwd=Path(__file__).resolve().parents[2],
+                                text=True, capture_output=True, input=r"""
+import assert from 'node:assert/strict';
+import { readFileSync } from 'node:fs';
+const source = readFileSync('./assets/js/doors/citation-matches.js');
+const { citationMatches } = await import(`data:text/javascript;base64,${source.toString('base64')}`);
+const refs = [
+  {key: 'duval', first: 'Duval', year: '2000', authors: ['Duval', 'Tweedie']},
+  {key: 'nosek', first: 'Nosek', year: '2018', authors: ['Nosek', 'Ebersole', 'DeHaven', 'Mellor'], etal: true},
+  {key: 'cessda', first: 'CESSDA', year: 'n.d.'},
+];
+const keys = (text, listed = refs) => citationMatches(text, listed).map((m) => m.key);
+assert.deepEqual(keys('(Duval & Tweedie, 2000; Nosek et al., 2018)'), ['duval', 'nosek']);
+assert.deepEqual(keys('Duval and Tweedie (2000); Nosek et al. (2018)'), ['duval', 'nosek']);
+assert.deepEqual(keys('(Duval & Tweedie 2000; Nosek et al. 2018)'), ['duval', 'nosek']);
+assert.deepEqual(keys('Nosek et al. 2018a; Unknown et al. 2099'), []);
+assert.deepEqual(keys('Smith and Jones 2020', [{key: 's', first: 'Smith', year: '2020'}]), []);
+assert.deepEqual(keys('(Example Collaboration et al. 2019)', [{key: 'c', first: 'Example Collaboration', year: '2019', authors: ['Example Collaboration'], etal: true}]), ['c']);
+assert.deepEqual(keys('(Duval, Tweedie, and Smith, 2000)'), []);
+assert.deepEqual(keys('(Duval, Tweedie, and Smith, 2000)', [{...refs[0], authors: ['Duval', 'Tweedie', 'Smith'], etal: true}]), ['duval']);
+assert.deepEqual(keys('(Duval & Other, 2000; Duval et al., 2000)'), []);
+assert.deepEqual(keys('Smith and Jones (2020)', [{key: 's', first: 'Smith', year: '2020'}]), []);
+assert.deepEqual(keys('(CESSDA, n.d.)'), ['cessda']);
+assert.deepEqual(keys('(Unknown, 2000; Duval, 2001; Nosek, 2018a)'), []);
+assert.deepEqual(keys('(NotDuval, 2000; Duval, 20000)'), []);
+assert.deepEqual(keys('(Duval & Tweedie, 2000)', [...refs, {...refs[0], key: 'other'}]), []);
+assert.deepEqual(keys('(Smith & Duval, 2000)'), []);
+assert.deepEqual(keys('(Smith, Duval, 2000)'), []);
+assert.deepEqual(keys('(van Duval, 2000)'), []);
+assert.deepEqual(keys('(van den Berg, 2020)', [{key: 'berg', first: 'Berg', year: '2020'}]), []);
+const accents = [{key: 'm', first: 'Munafò', year: '2017', etal: true}];
+assert.deepEqual(keys('(Munafò et al., 2017)', accents), ['m']);
+const text = '(Duval & Tweedie, 2000; Nosek et al., 2018)';
+assert.deepEqual(citationMatches(text, refs).map((m) => text.slice(m.start, m.end)),
+                 ['Duval & Tweedie, 2000', 'Nosek et al., 2018']);
+""")
+        self.assertEqual(result.returncode, 0, result.stderr)
diff --git a/scripts/tests/test_generate_sc_profiles.py b/scripts/tests/test_generate_sc_profiles.py
new file mode 100644
index 00000000000..c7c03e09f82
--- /dev/null
+++ b/scripts/tests/test_generate_sc_profiles.py
@@ -0,0 +1,40 @@
+#!/usr/bin/env python3
+"""The steering committee generator keeps each person's existing author folder."""
+import sys
+import tempfile
+import types
+import unittest
+from pathlib import Path
+
+sys.path.insert(0, str(Path(__file__).resolve().parents[1]))
+
+import generate_sc_profiles as sc  # noqa: E402
+
+if sc.pd is None:  # pandas is optional here, and only isna is used.
+    sc.pd = types.SimpleNamespace(isna=lambda value: value is None)
+
+
+class ExistingAuthorDir(unittest.TestCase):
+    def found(self, name, folders):
+        with tempfile.TemporaryDirectory() as authors:
+            for folder in folders:
+                (Path(authors) / folder).mkdir()
+            return sc.find_existing_author_dir(name, Path(authors))
+
+    def test_folder_without_separators(self):
+        self.assertEqual(self.found("Ruth Van der Hallen, PhD ", ["ruthvanderhallenphd"]), "ruthvanderhallenphd")
+
+    def test_hyphenated_folder(self):
+        self.assertEqual(self.found("Dr Ana Marinho", ["ana-marinho"]), "ana-marinho")
+
+    def test_two_folders_for_one_name_leave_it_to_similarity(self):
+        # "ana-marinho" is the closer spelling of this name, and sorts first only by luck.
+        self.assertEqual(self.found("Ana Marinho", ["ana-marinho", "anamarinho"]), "ana-marinho")
+        self.assertEqual(self.found("Ana-Marinho", ["ana-marinho", "ana-marin-ho"]), "ana-marinho")
+
+    def test_other_people_do_not_match(self):
+        self.assertIsNone(self.found("Ruth Van der Hallen, PhD", ["ruth-vander-berg", "ana-marinho"]))
+
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/scripts/tests/test_rebrand_checks.py b/scripts/tests/test_rebrand_checks.py
new file mode 100644
index 00000000000..0b77a5453ea
--- /dev/null
+++ b/scripts/tests/test_rebrand_checks.py
@@ -0,0 +1,462 @@
+"""Tests for the Doors redesign's preview rewriter and build checks."""
+
+import os
+import re
+import sys
+import tempfile
+import unittest
+from pathlib import Path
+
+sys.path.insert(0, str(Path(__file__).resolve().parents[1] / "rebrand"))
+
+from check_design import framing_problems  # noqa: E402
+from check_internal_links import broken_target, extract_links, find_broken  # noqa: E402
+from check_preview import (  # noqa: E402
+    canonical_problem, off_origin, production_expectation, redirect_ok, redirect_target, resolve_base, robots_problem,
+)
+from check_source_rules import GENERATED, absolute_url_findings  # noqa: E402
+from compare_builds import compare_heads, compare_paths, compare_structured  # noqa: E402
+from preview_paths import Rewriter, resolves  # noqa: E402
+from site_inventory import normalise_path, seo_head, template_group  # noqa: E402
+
+FILES = {
+    "index.html",
+    "about/us/index.html",
+    "css/site.css",
+    "img/a.webp",
+    "apps/tool.html",
+    "explorer/index.html",
+    "glossary/english/térm/index.html",
+}
+SISTERS = {"flora-zotero", "fred"}
+
+
+def rewriter():
+    return Rewriter("/rebrand-doors/", FILES, SISTERS)
+
+
+class ResolvesTests(unittest.TestCase):
+    def test_pages_serves_directories_and_html_files(self):
+        self.assertTrue(resolves("/about/us", FILES))
+        self.assertTrue(resolves("/about/us/?x=1#top", FILES))
+        self.assertTrue(resolves("/apps/tool", FILES))
+        self.assertTrue(resolves("/", FILES))
+        self.assertFalse(resolves("/about/them/", FILES))
+
+    def test_percent_encoded_paths_match(self):
+        self.assertTrue(resolves("/glossary/english/t%C3%A9rm/", FILES))
+
+    def test_case_matters_as_it_does_on_github_pages(self):
+        self.assertFalse(resolves("/About/us/", FILES))
+
+
+class RewriteHtmlTests(unittest.TestCase):
+    def test_quoted_and_minified_attributes(self):
+        html = rewriter().html('<head></head><a href="/about/us/">x</a><a href=/about/us>y</a><img src=/img/a.webp>')
+        self.assertIn('href="/rebrand-doors/about/us/"', html)
+        self.assertIn("href=/rebrand-doors/about/us>", html)
+        self.assertIn("src=/rebrand-doors/img/a.webp", html)
+
+    def test_home_link(self):
+        self.assertIn("href=/rebrand-doors/>", rewriter().html("<head></head><a href=/>x</a>"))
+
+    def test_rewriting_twice_changes_nothing(self):
+        once = rewriter().html('<head></head><a href="/about/us/">x</a><a href=https://forrt.org/about/us/>y</a>')
+        self.assertEqual(rewriter().html(once), once)
+
+    def test_protocol_relative_and_external_links_stay(self):
+        source = '<head><meta name=robots content=noindex></head><a href="//cdn.example/x">a</a><a href="https://example.org/about/us">b</a>'
+        self.assertEqual(rewriter().html(source), source)
+
+    def test_sister_sites_keep_their_root_paths(self):
+        html = rewriter().html('<head></head><a href="/flora-zotero/">a</a><a href="https://forrt.org/fred/index.html">b</a>')
+        self.assertIn('href="/flora-zotero/"', html)
+        self.assertIn('href="https://forrt.org/fred/index.html"', html)
+
+    def test_absolute_links_to_this_site_move_to_the_preview(self):
+        html = rewriter().html('<head></head><a href="https://forrt.org/explorer">a</a><a href="https://www.forrt.org/">b</a>')
+        self.assertIn('href="/rebrand-doors/explorer"', html)
+        self.assertIn('href="/rebrand-doors/"', html)
+
+    def test_absolute_link_outside_the_build_stays(self):
+        self.assertIn(
+            'href="https://forrt.org/retired/"',
+            rewriter().html('<head></head><a href="https://forrt.org/retired/">a</a>'),
+        )
+
+    def test_links_climbing_past_the_top_stay_in_the_preview(self):
+        html = rewriter().html('<head></head><a href=../about/us/>a</a><img src="../../img/a.webp">', depth=1)
+        self.assertIn("href=../about/us/>", html)
+        self.assertIn('src="/rebrand-doors/img/a.webp"', html)
+        self.assertIn("href=/rebrand-doors/about/us/>", rewriter().html("<head></head><a href=../about/us/>a</a>"))
+
+    def test_climbing_covers_dot_segments_and_spares_sister_sites(self):
+        self.assertIn("href=/rebrand-doors/>", rewriter().html("<head></head><a href=..>a</a>"))
+        self.assertIn('href="/rebrand-doors/img/a.webp"', rewriter().html('<head></head><a href="./../img/a.webp">a</a>'))
+        self.assertIn('href="/rebrand-doors/#top"', rewriter().html('<head></head><a href="..#top">a</a>'))
+        self.assertIn('href="../../fred/"', rewriter().html('<head></head><a href="../../fred/">a</a>', depth=1))
+
+    def test_unrelated_attribute_is_left_alone(self):
+        self.assertIn('content="/about/us/"', rewriter().html('<head><meta content="/about/us/"></head>'))
+
+    def test_srcset_and_inline_styles(self):
+        html = rewriter().html(
+            '<head></head><img srcset="/img/a.webp 1x, /img/a.webp 2x"><div style="background:url(/img/a.webp)"></div>'
+        )
+        self.assertIn('srcset="/rebrand-doors/img/a.webp 1x, /rebrand-doors/img/a.webp 2x"', html)
+        self.assertIn("url(/rebrand-doors/img/a.webp)", html)
+
+    def test_inline_script_paths_only_when_they_name_built_content(self):
+        html = rewriter().html("<head></head><script>fetch('/img/a.webp');var x='/not/here';</script>")
+        self.assertIn("fetch('/rebrand-doors/img/a.webp')", html)
+        self.assertIn("'/not/here'", html)
+
+    def test_json_ld_is_untouched(self):
+        source = '<head><script type="application/ld+json">{"u":"/img/a.webp"}</script></head>'
+        self.assertIn('{"u":"/img/a.webp"}', rewriter().html(source))
+
+    def test_404_script_keeps_its_own_paths(self):
+        html = rewriter().html("<head></head><script>location.replace('/img/a.webp')</script>", is_404=True)
+        self.assertIn("'/img/a.webp'", html)
+
+    def test_noindex_added_once(self):
+        html = rewriter().html("<html><head><title>x</title></head></html>")
+        self.assertIn('name="robots" content="noindex, nofollow"', html)
+        self.assertEqual(rewriter().html(html), html)
+
+    def test_existing_noindex_kept(self):
+        source = '<head><meta name=robots content="noindex, nofollow"></head>'
+        self.assertEqual(rewriter().html(source), source)
+
+
+class LinkCheckTests(unittest.TestCase):
+    def check(self, link, page="/rebrand-doors/about/us/", base="/rebrand-doors/"):
+        return broken_target(link, page, base, FILES, SISTERS, [])
+
+    def test_rewritten_link_resolves(self):
+        self.assertIsNone(self.check("/rebrand-doors/about/us/"))
+
+    def test_broken_link_reports_the_site_path(self):
+        self.assertEqual(self.check("/rebrand-doors/about/them/"), "/about/them/")
+
+    def test_relative_links_resolve_from_the_page(self):
+        self.assertIsNone(self.check("../../img/a.webp"))
+        self.assertEqual(self.check("missing.webp"), "/about/us/missing.webp")
+
+    def test_sister_sites_and_external_sites_pass(self):
+        self.assertIsNone(self.check("https://forrt.org/fred/index.html"))
+        self.assertIsNone(self.check("/flora-zotero/"))
+        self.assertIsNone(self.check("https://example.org/nope"))
+
+    def test_stray_live_site_link_fails(self):
+        self.assertEqual(self.check("https://forrt.org/retired/"), "/retired/")
+
+    def test_link_leaving_the_subfolder_fails_even_if_the_page_exists(self):
+        self.assertEqual(self.check("/about/us/"), "/about/us/")
+        self.assertEqual(self.check("../about/us/", page="/rebrand-doors/"), "/about/us/")
+
+    def test_allowlist_covers_links_leaving_the_subfolder(self):
+        target = broken_target(
+            "https://forrt.org/retired/", "/rebrand-doors/", "/rebrand-doors/", FILES, SISTERS, [re.compile("^/retired/")]
+        )
+        self.assertIsNone(target)
+
+    def test_extract_skips_scripts_templates_and_placeholders(self):
+        links = list(
+            extract_links(
+                '<a href=/a>x</a><script>"<a href=/b>"</script><a href="#top">t</a>'
+                '<a href="{{relpermalink}}">u</a><a href="mailto:x@y.z">m</a><img src=c.webp>'
+            )
+        )
+        self.assertEqual(links, ["/a", "c.webp"])
+
+    def test_extract_skips_src_in_another_attributes_query(self):
+        links = list(extract_links('<div data-u="/a?src=/b"></div><div data-u="x&amp;src=/c"></div><img src=d.webp>'))
+        self.assertEqual(links, ["d.webp"])
+
+    def test_find_broken_walks_a_build(self):
+        with tempfile.TemporaryDirectory() as root:
+            Path(root, "about").mkdir()
+            Path(root, "index.html").write_text('<a href="/about/">ok</a><a href="/gone/">bad</a>')
+            Path(root, "about", "index.html").write_text("<a href=/>home</a>")
+            broken = find_broken(root)
+        self.assertEqual(set(broken), {"/gone/"})
+        self.assertEqual(broken["/gone/"], {"index.html"})
+
+
+class CompareTests(unittest.TestCase):
+    def test_fingerprints_and_image_hashes_normalise(self):
+        self.assertEqual(
+            normalise_path("css/doors.0123456789abcdef0123456789abcdef.css"), "css/doors.FINGERPRINT.css"
+        )
+        self.assertEqual(normalise_path("authors/a/avatar_hu_929e020daed93c74.webp"), "authors/a/avatar_hu.webp")
+
+    def test_removed_page_fails_and_new_asset_does_not(self):
+        removed, addresses, assets = compare_paths(
+            ["a/index.html", "b/index.html", "index.xml"],
+            ["a/index.html", "index.xml", "fonts/x.woff2", "c/index.html"],
+        )
+        self.assertEqual(removed, ["b/index.html"])
+        self.assertEqual(addresses, ["c/index.html"])
+        self.assertEqual(assets, ["fonts/x.woff2"])
+
+    def test_allowed_changes_are_exempt(self):
+        removed, _, _ = compare_paths(["a/index.html"], [], allowed={"a/index.html"})
+        self.assertEqual(removed, [])
+
+    def test_a_glob_covers_a_collection_that_grows(self):
+        _, addresses, _ = compare_paths(
+            [], ["resources/page/2/index.html", "resources/page/61/index.html", "other/page/2/index.html"],
+            allowed={"resources/page/*/index.html"},
+        )
+        self.assertEqual(addresses, ["other/page/2/index.html"])
+
+    def test_a_glob_stops_at_a_slash(self):
+        _, addresses, _ = compare_paths(
+            [], ["resources/page/2/nested/index.html"], allowed={"resources/page/*/index.html"}
+        )
+        self.assertEqual(addresses, ["resources/page/2/nested/index.html"])
+
+    def test_an_allowed_page_may_change_its_seo_tags(self):
+        self.assertEqual(compare_heads({"a.html": ["x"]}, {"a.html": ["y"]}, allowed={"a.html"}), {})
+
+    def test_structured_data_falls_but_may_rise(self):
+        drops = compare_structured(
+            {"term": {"DefinedTerm": 5, "BreadcrumbList": 5}},
+            {"term": {"DefinedTerm": 4, "BreadcrumbList": 9}},
+        )
+        self.assertEqual(drops, [("term", "DefinedTerm", 5, 4)])
+
+    def test_heads_report_only_differences(self):
+        changes = compare_heads({"a": ["x", "y"], "b": ["z"]}, {"a": ["x", "w"], "b": ["z"]})
+        self.assertEqual(changes, {"a": (["y"], ["w"])})
+
+
+    def social_tags(self, image, image_type="image/webp", width="100", height="50"):
+        return sorted(["og:image=" + image, "twitter:image=" + image,
+                       "og:image:type=" + image_type, "og:image:width=" + width,
+                       "og:image:height=" + height, "og:image:alt=Same image",
+                       "twitter:image:alt=Same image", "title=Page", "description=Description",
+                       "canonical:=https://example.org/page/"])
+
+    def test_same_bundle_and_static_social_derivatives_are_equivalent(self):
+        for before, after in (
+            ("https://example.org/post/example/featured.webp", "https://example.org/post/example/featured_hu_0123456789abcdef.png"),
+            ("https://example.org/img/toolkit.webp", "https://example.org/social/img/toolkit_hu_0123456789abcdef.jpg"),
+            ("https://example.org/rebrand-doors/img/toolkit.webp", "https://example.org/rebrand-doors/social/img/toolkit_hu_0123456789abcdef.jpeg"),
+            ("https://example.org/a/avatar_hu_0123456789abcdef.webp", "https://example.org/a/avatar_hu_fedcba9876543210.png"),
+        ):
+            with self.subTest(after=after):
+                new_type = "image/png" if after.endswith(".png") else "image/jpeg"
+                self.assertEqual(compare_heads({"a": self.social_tags(before)},
+                                               {"a": self.social_tags(after, new_type, "200", "100")}), {})
+
+    def test_unrelated_social_images_and_other_metadata_still_fail(self):
+        before = self.social_tags("https://example.org/post/example/featured.webp")
+        derivative = "https://example.org/post/example/featured_hu_0123456789abcdef.png"
+        for url in (
+            derivative.replace("featured", "unrelated"),
+            derivative.replace("/example/", "/another/"),
+            derivative.replace("example.org", "another.org"),
+            derivative + "?different=1",
+        ):
+            with self.subTest(url=url):
+                self.assertIn("a", compare_heads({"a": before}, {"a": self.social_tags(url, "image/png")}))
+        after = self.social_tags(derivative, "image/png")
+        for old in ("title=Page", "description=Description", "og:image:alt=Same image",
+                    "twitter:image:alt=Same image", "canonical:=https://example.org/page/"):
+            with self.subTest(tag=old):
+                changed = sorted("changed=" + tag if tag == old else tag for tag in after)
+                self.assertIn("a", compare_heads({"a": before}, {"a": changed}))
+        self.assertIn("a", compare_heads({"a": before}, {"a": sorted(after + ['{"@type":"Changed"}'])}))
+
+    def test_png_jpeg_comparisons_and_unconverted_companions_stay_exact(self):
+        for suffix, image_type in (("png", "image/png"), ("jpg", "image/jpeg"), ("webp", "image/webp")):
+            image = "https://example.org/img/source." + suffix
+            before = self.social_tags(image, image_type)
+            for after in (self.social_tags(image, image_type, width="200"),
+                          self.social_tags(image.replace("source", "other"), image_type),
+                          self.social_tags(image.replace("source", "source_hu_0123456789abcdef"), image_type),
+                          self.social_tags(image, "image/incorrect")):
+                with self.subTest(suffix=suffix):
+                    self.assertIn("a", compare_heads({"a": before}, {"a": after}))
+
+    def test_duplicate_image_tags_are_not_normalized(self):
+        original = "https://example.org/img/source.webp"
+        before = sorted(self.social_tags(original) + ["og:image=" + original])
+        after = self.social_tags("https://example.org/social/img/source_hu_0123456789abcdef.png", "image/png")
+        self.assertIn("a", compare_heads({"a": before}, {"a": after}))
+
+    def test_social_derivatives_require_processing_hash(self):
+        before = self.social_tags("https://example.org/img/source.webp")
+        for image in ("https://example.org/img/source.png", "https://example.org/social/img/source.png"):
+            with self.subTest(image=image):
+                self.assertIn("a", compare_heads({"a": before}, {"a": self.social_tags(image, "image/png")}))
+
+    def test_social_derivative_companions_cannot_disappear(self):
+        before = self.social_tags("https://example.org/img/source.webp")
+        after = self.social_tags("https://example.org/social/img/source_hu_0123456789abcdef.png", "image/png")
+        for key in ("og:image:width", "og:image:height", "og:image:type"):
+            for side in ("before", "after"):
+                with self.subTest(key=key, side=side):
+                    old = [tag for tag in before if side != "before" or not tag.startswith(key + "=")]
+                    new = [tag for tag in after if side != "after" or not tag.startswith(key + "=")]
+                    self.assertIn("a", compare_heads({"a": old}, {"a": new}))
+        self.assertIn("a", compare_heads({"a": before + ["twitter:image:width=100"]}, {"a": after}))
+
+
+class InventoryTests(unittest.TestCase):
+    def test_template_groups(self):
+        cases = {
+            "index.html": "home",
+            "404.html": "404",
+            "glossary/english/abstract_bias/index.html": "glossary term",
+            "glossary/references/index.html": "glossary term",
+            "glossary/english/index.html": "glossary list",
+            "curated_resources/x/index.html": "resource detail",
+            "curated_resources/page/2/index.html": "generated list",
+            "post/index.html": "news and section list",
+            "post/x/index.html": "article",
+            "about/us/index.html": "section or plain page",
+            "apps/os_map.html": "standalone",
+        }
+        for path, group in cases.items():
+            self.assertEqual(template_group(path), group, path)
+
+    def test_redirect_stub_is_recognised_by_its_content(self):
+        text = '<head><meta http-equiv="refresh" content="0; url=https://forrt.org/"></head>'
+        self.assertEqual(template_group("tag/x/index.html", text), "redirect stub")
+
+    def test_seo_head_collects_the_tags_that_matter(self):
+        tags = seo_head(
+            '<head><title>T</title><meta name=description content=D><meta name=viewport content=v>'
+            '<link rel=canonical href=/c><link rel=stylesheet href=/s.css>'
+            '<link rel=alternate hreflang=de href=/de>'
+            '<script type=application/ld+json>{"@type":"X"}</script></head><body></body>'
+        )
+        self.assertIn("title=T", tags)
+        self.assertIn("description=D", tags)
+        self.assertIn("canonical:=/c", tags)
+        self.assertIn("alternate:de=/de", tags)
+        self.assertIn('{"@type":"X"}', tags)
+        self.assertFalse([tag for tag in tags if "s.css" in tag or tag.startswith("viewport")])
+
+
+class NetworkFramingTests(unittest.TestCase):
+    def ink(self, left, right, top, bottom, core=0.4):
+        return {"left": left, "right": right, "top": top, "bottom": bottom, "width": 1000, "height": 700,
+                "core_across": core, "core_down": core}
+
+    def test_a_centred_network_that_fills_its_panel_passes(self):
+        self.assertEqual(framing_problems(self.ink(40, 960, 60, 640)), [])
+
+    def test_the_network_pressed_into_a_corner_fails(self):
+        problems = framing_problems(self.ink(650, 999, 450, 699))
+        self.assertTrue(any("fills only" in problem for problem in problems))
+        self.assertTrue(any("off centre" in problem for problem in problems))
+
+    def test_outliers_at_the_edges_do_not_hide_a_dense_lump(self):
+        problems = framing_problems(self.ink(40, 960, 60, 640, core=0.2))
+        self.assertTrue(any("bunches up" in problem for problem in problems))
+
+    def test_a_blank_canvas_fails(self):
+        self.assertEqual(framing_problems({"left": 1000, "right": -1, "top": 700, "bottom": -1, "width": 1000, "height": 700}),
+                         ["nothing is drawn"])
+
+
+class SourceRuleTests(unittest.TestCase):
+    def test_generated_paths(self):
+        for path in [
+            "content/glossary/english/x.md",
+            "content/curated_resources/x.md",
+            "content/contributors/tenzing.md",
+            "data/ga_data.json",
+            "static/data/fred_citation.txt",
+            "static/data/other.json",
+            "static/partials/network-graph.html",
+            "content/post/2026-01-newsletter/index.md",
+            "scripts/forrt_contribs/contributors_cache.csv",
+        ]:
+            self.assertTrue(GENERATED.match(path), path)
+        for path in [
+            "content/curated_resources/_index.md",
+            "content/post/_index.md",
+            "data/partners.json",
+            "data/publications.yaml",
+            "data/themes/doors.toml",
+            "layouts/index.html",
+            "content/home/1-hero.md",
+        ]:
+            self.assertFalse(GENERATED.match(path), path)
+
+    def test_absolute_urls_in_templates(self):
+        with tempfile.TemporaryDirectory() as root:
+            os.makedirs(os.path.join(root, "layouts"))
+            Path(root, "layouts", "a.html").write_text(
+                '<a href="https://forrt.org/about/us">own page</a>\n'
+                '<a href="https://forrt.org/fred/">sister site</a>\n'
+                '"url": "https://forrt.org"\n'
+                '<a href="https://example.org/">elsewhere</a>\n'
+            )
+            findings = absolute_url_findings(root, sisters={"fred"})
+        self.assertEqual(len(findings), 1)
+        self.assertIn("forrt.org/about/us", findings[0])
+
+
+class PreviewCheckModeTests(unittest.TestCase):
+    def test_default_base_is_the_preview(self):
+        self.assertEqual(resolve_base(None, False), "https://forrt.org/rebrand-doors/")
+        self.assertEqual(resolve_base("https://forrt.org/rebrand-doors", False), "https://forrt.org/rebrand-doors/")
+
+    def test_production_base_is_the_site_root(self):
+        self.assertEqual(resolve_base(None, True), "https://forrt.org/")
+        self.assertEqual(resolve_base("https://forrt.org", True), "https://forrt.org/")
+        with self.assertRaises(ValueError):
+            resolve_base("https://forrt.org/rebrand-doors/", True)
+
+    def test_preview_needs_noindex(self):
+        self.assertIsNone(robots_problem("about/us/", "noindex, nofollow", False))
+        self.assertEqual(robots_problem("about/us/", "", False), "about/us/ has no noindex")
+
+    def test_production_forbids_noindex(self):
+        self.assertIsNone(robots_problem("about/us/", "", True))
+        self.assertIsNone(robots_problem("about/us/", "index, follow", True))
+        self.assertIn("has noindex", robots_problem("about/us/", "noindex", True))
+
+    def test_canonical_on_the_root(self):
+        base = "https://forrt.org/"
+        self.assertIsNone(canonical_problem("about/us/", "https://forrt.org/about/us/", base))
+        self.assertIn("no canonical", canonical_problem("about/us/", "", base))
+        self.assertIn("outside", canonical_problem("about/us/", "https://forrt.org/rebrand-doors/about/us/", base))
+        self.assertIn("outside", canonical_problem("about/us/", "https://staging.forrt.org/about/us/", base))
+        self.assertIn("outside", canonical_problem("about/us/", "http://forrt.org/about/us/", base))
+
+    def test_redirect_targets_follow_the_base(self):
+        self.assertEqual(redirect_target("https://forrt.org/rebrand-doors/", "resources/"), "/rebrand-doors/resources/")
+        self.assertEqual(redirect_target("https://forrt.org/", "resources/"), "/resources/")
+        self.assertEqual(redirect_target("https://forrt.org/rebrand-doors/", "//fred"), "/fred")
+        self.assertEqual(redirect_target("https://forrt.org/", "//fred"), "/fred")
+
+    def test_sister_sites_answer_first_in_production(self):
+        sisters = {"re-searchterms", "fred"}
+        self.assertEqual(production_expectation("re-searchterms", "apps/re-searchterms.html", sisters), "//re-searchterms")
+        self.assertEqual(production_expectation("tag/", "tags/", sisters), "tags/")
+        # Sister-site names are case-sensitive paths, as on GitHub Pages.
+        self.assertEqual(production_expectation("FReD/", "//fred", sisters), "//fred")
+
+    def test_off_origin(self):
+        base = "https://forrt.org/"
+        self.assertFalse(off_origin("https://forrt.org/resources/", base))
+        self.assertFalse(off_origin("/glossary/english/preregistration/", base))
+        self.assertTrue(off_origin("https://example.org/resources/", base))
+        self.assertTrue(off_origin("http://forrt.org/resources/", base))
+
+    def test_redirect_ok(self):
+        self.assertTrue(redirect_ok("/resources", "/resources/", "resources/"))
+        self.assertFalse(redirect_ok("/resources/page/2/", "/resources/", "resources/"))
+        self.assertTrue(redirect_ok("/fred/explorer/", "/fred", "//fred"))
+        self.assertFalse(redirect_ok("/fredx/", "/fred", "//fred"))
+
+
+if __name__ == "__main__":
+    unittest.main()
diff --git a/static/css/steering-committee.css b/static/css/steering-committee.css
index 72a6d53363a..cc7576954a7 100644
--- a/static/css/steering-committee.css
+++ b/static/css/steering-committee.css
@@ -576,3 +576,28 @@ article.article .article-container .article-title {
     font-weight: 700;
     font-size: 1.25rem;
 }
+
+/* Doors: one colour per section from the site's palette, readable labels, and a closed profile that
+   no keyboard can reach. The inline --team-color comes from the generated page. */
+#strategic .sc-card,#strategic .sc-title-card{--team-color:var(--edu)!important}
+#operations .sc-card,#operations .sc-title-card{--team-color:var(--res)!important}
+#steering .sc-card,#steering .sc-title-card{--team-color:var(--jus)!important}
+#guidance .sc-card,#guidance .sc-title-card{--team-color:var(--com)!important}
+.sc-title-label{opacity:1;color:#fff;font-size:15px;letter-spacing:0;text-transform:none}
+.sc-section-desc{color:var(--ink);font-size:16px}
+.sc-section-title{font-size:15px;letter-spacing:0;text-transform:none}
+.sc-nav{justify-content:flex-start;flex-wrap:wrap;gap:6px 14px;padding:0 0 18px;margin:0 0 18px;white-space:normal;overflow:visible}
+.sc-nav a{font-size:15px;color:var(--link);text-decoration:underline}
+.sc-nav a::after{content:none!important}
+#sc-container>div{padding:0;max-width:none}
+.sc-section{scroll-margin-top:16px}
+.sc-modal-backdrop{visibility:hidden;transition:opacity .3s ease,visibility .3s}
+.sc-modal-backdrop.active{visibility:visible}
+.sc-card:focus-visible{outline:3px solid var(--ink);outline-offset:2px}
+@media(max-width:639px){
+  .sc-grid{display:grid;grid-template-columns:repeat(2,minmax(0,1fr));gap:10px}
+  .sc-card,.sc-title-card{width:auto!important;max-width:none}
+  .sc-cbar{display:none}
+}
+#sc-container{width:auto;max-width:none;margin:0;padding:0;position:static}
+.sc-section-desc a{color:var(--link);text-decoration:underline;text-underline-offset:3px}
diff --git a/static/fonts/doors/FontAwesome-LICENSE.txt b/static/fonts/doors/FontAwesome-LICENSE.txt
new file mode 100644
index 00000000000..e69c5e39a30
--- /dev/null
+++ b/static/fonts/doors/FontAwesome-LICENSE.txt
@@ -0,0 +1,165 @@
+Fonticons, Inc. (https://fontawesome.com)
+
+--------------------------------------------------------------------------------
+
+Font Awesome Free License
+
+Font Awesome Free is free, open source, and GPL friendly. You can use it for
+commercial projects, open source projects, or really almost whatever you want.
+Full Font Awesome Free license: https://fontawesome.com/license/free.
+
+--------------------------------------------------------------------------------
+
+# Icons: CC BY 4.0 License (https://creativecommons.org/licenses/by/4.0/)
+
+The Font Awesome Free download is licensed under a Creative Commons
+Attribution 4.0 International License and applies to all icons packaged
+as SVG and JS file types.
+
+--------------------------------------------------------------------------------
+
+# Fonts: SIL OFL 1.1 License
+
+In the Font Awesome Free download, the SIL OFL license applies to all icons
+packaged as web and desktop font files.
+
+Copyright (c) 2024 Fonticons, Inc. (https://fontawesome.com)
+with Reserved Font Name: "Font Awesome".
+
+This Font Software is licensed under the SIL Open Font License, Version 1.1.
+This license is copied below, and is also available with a FAQ at:
+http://scripts.sil.org/OFL
+
+SIL OPEN FONT LICENSE
+Version 1.1 - 26 February 2007
+
+PREAMBLE
+The goals of the Open Font License (OFL) are to stimulate worldwide
+development of collaborative font projects, to support the font creation
+efforts of academic and linguistic communities, and to provide a free and
+open framework in which fonts may be shared and improved in partnership
+with others.
+
+The OFL allows the licensed fonts to be used, studied, modified and
+redistributed freely as long as they are not sold by themselves. The
+fonts, including any derivative works, can be bundled, embedded,
+redistributed and/or sold with any software provided that any reserved
+names are not used by derivative works. The fonts and derivatives,
+however, cannot be released under any other type of license. The
+requirement for fonts to remain under this license does not apply
+to any document created using the fonts or their derivatives.
+
+DEFINITIONS
+"Font Software" refers to the set of files released by the Copyright
+Holder(s) under this license and clearly marked as such. This may
+include source files, build scripts and documentation.
+
+"Reserved Font Name" refers to any names specified as such after the
+copyright statement(s).
+
+"Original Version" refers to the collection of Font Software components as
+distributed by the Copyright Holder(s).
+
+"Modified Version" refers to any derivative made by adding to, deleting,
+or substituting — in part or in whole — any of the components of the
+Original Version, by changing formats or by porting the Font Software to a
+new environment.
+
+"Author" refers to any designer, engineer, programmer, technical
+writer or other person who contributed to the Font Software.
+
+PERMISSION & CONDITIONS
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of the Font Software, to use, study, copy, merge, embed, modify,
+redistribute, and sell modified and unmodified copies of the Font
+Software, subject to the following conditions:
+
+1) Neither the Font Software nor any of its individual components,
+in Original or Modified Versions, may be sold by itself.
+
+2) Original or Modified Versions of the Font Software may be bundled,
+redistributed and/or sold with any software, provided that each copy
+contains the above copyright notice and this license. These can be
+included either as stand-alone text files, human-readable headers or
+in the appropriate machine-readable metadata fields within text or
+binary files as long as those fields can be easily viewed by the user.
+
+3) No Modified Version of the Font Software may use the Reserved Font
+Name(s) unless explicit written permission is granted by the corresponding
+Copyright Holder. This restriction only applies to the primary font name as
+presented to the users.
+
+4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
+Software shall not be used to promote, endorse or advertise any
+Modified Version, except to acknowledge the contribution(s) of the
+Copyright Holder(s) and the Author(s) or with their explicit written
+permission.
+
+5) The Font Software, modified or unmodified, in part or in whole,
+must be distributed entirely under this license, and must not be
+distributed under any other license. The requirement for fonts to
+remain under this license does not apply to any document created
+using the Font Software.
+
+TERMINATION
+This license becomes null and void if any of the above conditions are
+not met.
+
+DISCLAIMER
+THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
+OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE
+COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL
+DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM
+OTHER DEALINGS IN THE FONT SOFTWARE.
+
+--------------------------------------------------------------------------------
+
+# Code: MIT License (https://opensource.org/licenses/MIT)
+
+In the Font Awesome Free download, the MIT license applies to all non-font and
+non-icon files.
+
+Copyright 2024 Fonticons, Inc.
+
+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.
+
+--------------------------------------------------------------------------------
+
+# Attribution
+
+Attribution is required by MIT, SIL OFL, and CC BY licenses. Downloaded Font
+Awesome Free files already contain embedded comments with sufficient
+attribution, so you shouldn't need to do anything additional when using these
+files normally.
+
+We've kept attribution comments terse, so we ask that you do not actively work
+to remove them from files, especially code. They're a great way for folks to
+learn about Font Awesome.
+
+--------------------------------------------------------------------------------
+
+# Brand Icons
+
+All brand icons are trademarks of their respective owners. The use of these
+trademarks does not indicate endorsement of the trademark holder by Font
+Awesome, nor vice versa. **Please do not use brand logos for any purpose except
+to represent the company, product, or service to which they refer.**
diff --git a/static/fonts/doors/Newsreader-OFL.txt b/static/fonts/doors/Newsreader-OFL.txt
new file mode 100644
index 00000000000..d2d4f407109
--- /dev/null
+++ b/static/fonts/doors/Newsreader-OFL.txt
@@ -0,0 +1,93 @@
+Copyright 2020 The Newsreader Project Authors (http://github.com/productiontype/Newsreader)
+
+This Font Software is licensed under the SIL Open Font License, Version 1.1.
+This license is copied below, and is also available with a FAQ at:
+http://scripts.sil.org/OFL
+
+
+-----------------------------------------------------------
+SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007
+-----------------------------------------------------------
+
+PREAMBLE
+The goals of the Open Font License (OFL) are to stimulate worldwide
+development of collaborative font projects, to support the font creation
+efforts of academic and linguistic communities, and to provide a free and
+open framework in which fonts may be shared and improved in partnership
+with others.
+
+The OFL allows the licensed fonts to be used, studied, modified and
+redistributed freely as long as they are not sold by themselves. The
+fonts, including any derivative works, can be bundled, embedded, 
+redistributed and/or sold with any software provided that any reserved
+names are not used by derivative works. The fonts and derivatives,
+however, cannot be released under any other type of license. The
+requirement for fonts to remain under this license does not apply
+to any document created using the fonts or their derivatives.
+
+DEFINITIONS
+"Font Software" refers to the set of files released by the Copyright
+Holder(s) under this license and clearly marked as such. This may
+include source files, build scripts and documentation.
+
+"Reserved Font Name" refers to any names specified as such after the
+copyright statement(s).
+
+"Original Version" refers to the collection of Font Software components as
+distributed by the Copyright Holder(s).
+
+"Modified Version" refers to any derivative made by adding to, deleting,
+or substituting -- in part or in whole -- any of the components of the
+Original Version, by changing formats or by porting the Font Software to a
+new environment.
+
+"Author" refers to any designer, engineer, programmer, technical
+writer or other person who contributed to the Font Software.
+
+PERMISSION & CONDITIONS
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of the Font Software, to use, study, copy, merge, embed, modify,
+redistribute, and sell modified and unmodified copies of the Font
+Software, subject to the following conditions:
+
+1) Neither the Font Software nor any of its individual components,
+in Original or Modified Versions, may be sold by itself.
+
+2) Original or Modified Versions of the Font Software may be bundled,
+redistributed and/or sold with any software, provided that each copy
+contains the above copyright notice and this license. These can be
+included either as stand-alone text files, human-readable headers or
+in the appropriate machine-readable metadata fields within text or
+binary files as long as those fields can be easily viewed by the user.
+
+3) No Modified Version of the Font Software may use the Reserved Font
+Name(s) unless explicit written permission is granted by the corresponding
+Copyright Holder. This restriction only applies to the primary font name as
+presented to the users.
+
+4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
+Software shall not be used to promote, endorse or advertise any
+Modified Version, except to acknowledge the contribution(s) of the
+Copyright Holder(s) and the Author(s) or with their explicit written
+permission.
+
+5) The Font Software, modified or unmodified, in part or in whole,
+must be distributed entirely under this license, and must not be
+distributed under any other license. The requirement for fonts to
+remain under this license does not apply to any document created
+using the Font Software.
+
+TERMINATION
+This license becomes null and void if any of the above conditions are
+not met.
+
+DISCLAIMER
+THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
+OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE
+COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL
+DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM
+OTHER DEALINGS IN THE FONT SOFTWARE.
\ No newline at end of file
diff --git a/static/fonts/doors/SourceSans3-OFL.txt b/static/fonts/doors/SourceSans3-OFL.txt
new file mode 100644
index 00000000000..80b9a8b6e7e
--- /dev/null
+++ b/static/fonts/doors/SourceSans3-OFL.txt
@@ -0,0 +1,93 @@
+Copyright 2010-2020 Adobe (http://www.adobe.com/), with Reserved Font Name 'Source'. All Rights Reserved. Source is a trademark of Adobe in the United States and/or other countries.
+
+This Font Software is licensed under the SIL Open Font License, Version 1.1.
+
+This license is copied below, and is also available with a FAQ at: http://scripts.sil.org/OFL
+
+
+-----------------------------------------------------------
+SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007
+-----------------------------------------------------------
+
+PREAMBLE
+The goals of the Open Font License (OFL) are to stimulate worldwide
+development of collaborative font projects, to support the font creation
+efforts of academic and linguistic communities, and to provide a free and
+open framework in which fonts may be shared and improved in partnership
+with others.
+
+The OFL allows the licensed fonts to be used, studied, modified and
+redistributed freely as long as they are not sold by themselves. The
+fonts, including any derivative works, can be bundled, embedded, 
+redistributed and/or sold with any software provided that any reserved
+names are not used by derivative works. The fonts and derivatives,
+however, cannot be released under any other type of license. The
+requirement for fonts to remain under this license does not apply
+to any document created using the fonts or their derivatives.
+
+DEFINITIONS
+"Font Software" refers to the set of files released by the Copyright
+Holder(s) under this license and clearly marked as such. This may
+include source files, build scripts and documentation.
+
+"Reserved Font Name" refers to any names specified as such after the
+copyright statement(s).
+
+"Original Version" refers to the collection of Font Software components as
+distributed by the Copyright Holder(s).
+
+"Modified Version" refers to any derivative made by adding to, deleting,
+or substituting -- in part or in whole -- any of the components of the
+Original Version, by changing formats or by porting the Font Software to a
+new environment.
+
+"Author" refers to any designer, engineer, programmer, technical
+writer or other person who contributed to the Font Software.
+
+PERMISSION & CONDITIONS
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of the Font Software, to use, study, copy, merge, embed, modify,
+redistribute, and sell modified and unmodified copies of the Font
+Software, subject to the following conditions:
+
+1) Neither the Font Software nor any of its individual components,
+in Original or Modified Versions, may be sold by itself.
+
+2) Original or Modified Versions of the Font Software may be bundled,
+redistributed and/or sold with any software, provided that each copy
+contains the above copyright notice and this license. These can be
+included either as stand-alone text files, human-readable headers or
+in the appropriate machine-readable metadata fields within text or
+binary files as long as those fields can be easily viewed by the user.
+
+3) No Modified Version of the Font Software may use the Reserved Font
+Name(s) unless explicit written permission is granted by the corresponding
+Copyright Holder. This restriction only applies to the primary font name as
+presented to the users.
+
+4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
+Software shall not be used to promote, endorse or advertise any
+Modified Version, except to acknowledge the contribution(s) of the
+Copyright Holder(s) and the Author(s) or with their explicit written
+permission.
+
+5) The Font Software, modified or unmodified, in part or in whole,
+must be distributed entirely under this license, and must not be
+distributed under any other license. The requirement for fonts to
+remain under this license does not apply to any document created
+using the Font Software.
+
+TERMINATION
+This license becomes null and void if any of the above conditions are
+not met.
+
+DISCLAIMER
+THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
+OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE
+COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL
+DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM
+OTHER DEALINGS IN THE FONT SOFTWARE.
diff --git a/static/fonts/doors/icons-brands.woff2 b/static/fonts/doors/icons-brands.woff2
new file mode 100644
index 00000000000..a45be81834e
Binary files /dev/null and b/static/fonts/doors/icons-brands.woff2 differ
diff --git a/static/fonts/doors/icons-regular.woff2 b/static/fonts/doors/icons-regular.woff2
new file mode 100644
index 00000000000..5f26c41ccee
Binary files /dev/null and b/static/fonts/doors/icons-regular.woff2 differ
diff --git a/static/fonts/doors/icons-solid.woff2 b/static/fonts/doors/icons-solid.woff2
new file mode 100644
index 00000000000..660b3eb89b6
Binary files /dev/null and b/static/fonts/doors/icons-solid.woff2 differ
diff --git a/static/fonts/doors/newsreader-var.woff2 b/static/fonts/doors/newsreader-var.woff2
new file mode 100644
index 00000000000..fe602119bd0
Binary files /dev/null and b/static/fonts/doors/newsreader-var.woff2 differ
diff --git a/static/fonts/doors/source-sans-3-italic.woff2 b/static/fonts/doors/source-sans-3-italic.woff2
new file mode 100644
index 00000000000..7312d8fbe34
Binary files /dev/null and b/static/fonts/doors/source-sans-3-italic.woff2 differ
diff --git a/static/fonts/doors/source-sans-3-var.woff2 b/static/fonts/doors/source-sans-3-var.woff2
new file mode 100644
index 00000000000..3ec31af538e
Binary files /dev/null and b/static/fonts/doors/source-sans-3-var.woff2 differ
diff --git a/static/img/video-thumbnails/-X06JloHL-U.webp b/static/img/video-thumbnails/-X06JloHL-U.webp
new file mode 100644
index 00000000000..819666f3a9c
Binary files /dev/null and b/static/img/video-thumbnails/-X06JloHL-U.webp differ
diff --git a/static/img/video-thumbnails/0dKmxrGrtE4.webp b/static/img/video-thumbnails/0dKmxrGrtE4.webp
new file mode 100644
index 00000000000..a1c0d6ec925
Binary files /dev/null and b/static/img/video-thumbnails/0dKmxrGrtE4.webp differ
diff --git a/static/img/video-thumbnails/1kG7dWuUS6c.webp b/static/img/video-thumbnails/1kG7dWuUS6c.webp
new file mode 100644
index 00000000000..68aad7dfb80
Binary files /dev/null and b/static/img/video-thumbnails/1kG7dWuUS6c.webp differ
diff --git a/static/img/video-thumbnails/5kyjnPFSmog.webp b/static/img/video-thumbnails/5kyjnPFSmog.webp
new file mode 100644
index 00000000000..820bdaeb641
Binary files /dev/null and b/static/img/video-thumbnails/5kyjnPFSmog.webp differ
diff --git a/static/img/video-thumbnails/9ywi-SKLj64.webp b/static/img/video-thumbnails/9ywi-SKLj64.webp
new file mode 100644
index 00000000000..d2fc233e49b
Binary files /dev/null and b/static/img/video-thumbnails/9ywi-SKLj64.webp differ
diff --git a/static/img/video-thumbnails/ATXd9PynTxw.webp b/static/img/video-thumbnails/ATXd9PynTxw.webp
new file mode 100644
index 00000000000..2bc0d60c51c
Binary files /dev/null and b/static/img/video-thumbnails/ATXd9PynTxw.webp differ
diff --git a/static/img/video-thumbnails/DPWsfWBZB-s.webp b/static/img/video-thumbnails/DPWsfWBZB-s.webp
new file mode 100644
index 00000000000..1b9b945d444
Binary files /dev/null and b/static/img/video-thumbnails/DPWsfWBZB-s.webp differ
diff --git a/static/img/video-thumbnails/HuQEmrME6uk.webp b/static/img/video-thumbnails/HuQEmrME6uk.webp
new file mode 100644
index 00000000000..7120687a74b
Binary files /dev/null and b/static/img/video-thumbnails/HuQEmrME6uk.webp differ
diff --git a/static/img/video-thumbnails/Il-O4vFy0Vw.webp b/static/img/video-thumbnails/Il-O4vFy0Vw.webp
new file mode 100644
index 00000000000..fd4f18eebc8
Binary files /dev/null and b/static/img/video-thumbnails/Il-O4vFy0Vw.webp differ
diff --git a/static/img/video-thumbnails/L-B8YasT-UE.webp b/static/img/video-thumbnails/L-B8YasT-UE.webp
new file mode 100644
index 00000000000..122714c92e5
Binary files /dev/null and b/static/img/video-thumbnails/L-B8YasT-UE.webp differ
diff --git a/static/img/video-thumbnails/LT69vcWpFeU.webp b/static/img/video-thumbnails/LT69vcWpFeU.webp
new file mode 100644
index 00000000000..692ab7528f7
Binary files /dev/null and b/static/img/video-thumbnails/LT69vcWpFeU.webp differ
diff --git a/static/img/video-thumbnails/MKOhY381gxg.webp b/static/img/video-thumbnails/MKOhY381gxg.webp
new file mode 100644
index 00000000000..0e787634b73
Binary files /dev/null and b/static/img/video-thumbnails/MKOhY381gxg.webp differ
diff --git a/static/img/video-thumbnails/OLI_2UAapSc.webp b/static/img/video-thumbnails/OLI_2UAapSc.webp
new file mode 100644
index 00000000000..a4a59976716
Binary files /dev/null and b/static/img/video-thumbnails/OLI_2UAapSc.webp differ
diff --git a/static/img/video-thumbnails/Sn0A4dxTyDA.webp b/static/img/video-thumbnails/Sn0A4dxTyDA.webp
new file mode 100644
index 00000000000..ea112142d73
Binary files /dev/null and b/static/img/video-thumbnails/Sn0A4dxTyDA.webp differ
diff --git a/static/img/video-thumbnails/_cIbCSyMQSo.webp b/static/img/video-thumbnails/_cIbCSyMQSo.webp
new file mode 100644
index 00000000000..739cbbd14df
Binary files /dev/null and b/static/img/video-thumbnails/_cIbCSyMQSo.webp differ
diff --git a/static/img/video-thumbnails/_kzp53FdX8A.webp b/static/img/video-thumbnails/_kzp53FdX8A.webp
new file mode 100644
index 00000000000..6a6a08deb25
Binary files /dev/null and b/static/img/video-thumbnails/_kzp53FdX8A.webp differ
diff --git a/static/img/video-thumbnails/i8cL3Q6A3HE.webp b/static/img/video-thumbnails/i8cL3Q6A3HE.webp
new file mode 100644
index 00000000000..ebf89ebae83
Binary files /dev/null and b/static/img/video-thumbnails/i8cL3Q6A3HE.webp differ
diff --git a/static/img/video-thumbnails/jAVGsRDzA1A.webp b/static/img/video-thumbnails/jAVGsRDzA1A.webp
new file mode 100644
index 00000000000..126d1b052e2
Binary files /dev/null and b/static/img/video-thumbnails/jAVGsRDzA1A.webp differ
diff --git a/static/img/video-thumbnails/k4MJkLR-rvw.webp b/static/img/video-thumbnails/k4MJkLR-rvw.webp
new file mode 100644
index 00000000000..4878717aa90
Binary files /dev/null and b/static/img/video-thumbnails/k4MJkLR-rvw.webp differ
diff --git a/static/img/video-thumbnails/kDEGwrz4V-E.webp b/static/img/video-thumbnails/kDEGwrz4V-E.webp
new file mode 100644
index 00000000000..a7890164678
Binary files /dev/null and b/static/img/video-thumbnails/kDEGwrz4V-E.webp differ
diff --git a/static/img/video-thumbnails/oMkF8DiAolQ.webp b/static/img/video-thumbnails/oMkF8DiAolQ.webp
new file mode 100644
index 00000000000..870a1a3fe1f
Binary files /dev/null and b/static/img/video-thumbnails/oMkF8DiAolQ.webp differ
diff --git a/static/img/video-thumbnails/qYejqrtquzc.webp b/static/img/video-thumbnails/qYejqrtquzc.webp
new file mode 100644
index 00000000000..4b497fec096
Binary files /dev/null and b/static/img/video-thumbnails/qYejqrtquzc.webp differ
diff --git a/static/img/video-thumbnails/uNolNQNiloM.webp b/static/img/video-thumbnails/uNolNQNiloM.webp
new file mode 100644
index 00000000000..4bf15fc5aa1
Binary files /dev/null and b/static/img/video-thumbnails/uNolNQNiloM.webp differ
diff --git a/static/img/video-thumbnails/vi1BxZ1MIaE.webp b/static/img/video-thumbnails/vi1BxZ1MIaE.webp
new file mode 100644
index 00000000000..d2068ea75be
Binary files /dev/null and b/static/img/video-thumbnails/vi1BxZ1MIaE.webp differ
diff --git a/static/js/clusters-page.js b/static/js/clusters-page.js
index bcb6c5268d5..bf424702cf5 100644
--- a/static/js/clusters-page.js
+++ b/static/js/clusters-page.js
@@ -70,14 +70,6 @@
     }
   }
 
-  function getNavbarStickyOffsetPx() {
-    var bodyTop = parseFloat(window.getComputedStyle(document.body).marginTop) || 0;
-    var navbar = document.getElementById('navbar-main');
-    if (!navbar) return bodyTop;
-    var bottom = Math.ceil(navbar.getBoundingClientRect().bottom);
-    return Math.max(bottom, bodyTop);
-  }
-
   function escapeHtml(s) {
     var d = document.createElement('div');
     d.textContent = s;
@@ -159,6 +151,17 @@
   /** Click/keyboard toggling for .acc-header sections and "Expand all" buttons.
    *  Shared by clusters and disciplines - both render the same accordion markup. */
   function initAccordionToggle() {
+    /* Whichever code opens or closes a section, its button reports it. */
+    var expanded = new MutationObserver(function (changes) {
+      changes.forEach(function (change) {
+        var trigger = change.target.previousElementSibling && change.target.previousElementSibling.querySelector('.acc-trigger');
+        if (trigger) trigger.setAttribute('aria-expanded', String(!change.target.classList.contains('acc-collapsed')));
+      });
+    });
+    document.querySelectorAll('.acc-body').forEach(function (body) {
+      expanded.observe(body, { attributes: true, attributeFilter: ['class'] });
+    });
+
     function toggleSection(header) {
       if (header.classList.contains('acc-disabled')) return;
       var body = header.nextElementSibling;
@@ -188,15 +191,6 @@
       if (toggleBtn) { toggleAllSections(toggleBtn); }
     });
 
-    document.addEventListener('keydown', function (e) {
-      if (e.key !== 'Enter' && e.key !== ' ') return;
-      if (e.target.closest('.acc-copy-link')) return;
-      var header = e.target.closest('.acc-header');
-      if (!header) return;
-      e.preventDefault();
-      toggleSection(header);
-    });
-
     function toggleAllSections(btn) {
       var clusterId = btn.getAttribute('data-cluster');
       var section = clusterId ? document.getElementById(clusterId) : null;
@@ -433,7 +427,6 @@
     }
 
     function updateStickyLayoutMetrics() {
-      root.style.setProperty('--clusters-sticky-offset', getNavbarStickyOffsetPx() + 'px');
       root.style.setProperty(
         '--clusters-controls-height',
         controls ? controls.offsetHeight + 'px' : '0px'
@@ -510,6 +503,14 @@
       }, 80);
     }
 
+    /* The open drawer fills a phone's screen, so it carries its own way out. */
+    var sidebarClose = sidebar ? sidebar.querySelector('.sidebar-close') : null;
+    if (sidebarClose && mobileToggle) {
+      sidebarClose.addEventListener('click', function () {
+        mobileToggle.click();
+        mobileToggle.focus();
+      });
+    }
     if (mobileToggle && sidebar) {
       mobileToggle.addEventListener('click', function () {
         sidebar.classList.toggle('sidebar-open');
@@ -815,10 +816,16 @@
     }
 
     if (backToTopBtn) {
+      // Only beside the fields or clusters, whose margin holds it (clusters.css); elsewhere it would cover the page.
+      var backToTopBeside = document.querySelector('.cluster-full-width');
       function toggleBackToTop() {
-        backToTopBtn.classList.toggle('is-visible', window.scrollY > 500);
+        var section = backToTopBeside ? backToTopBeside.getBoundingClientRect() : null;
+        var button = backToTopBtn.getBoundingClientRect();
+        backToTopBtn.classList.toggle('is-visible', window.scrollY > 500 && !!section &&
+          section.top < button.top - 8 && section.bottom > button.bottom + 8);
       }
       window.addEventListener('scroll', toggleBackToTop, { passive: true });
+      window.addEventListener('resize', toggleBackToTop);
       toggleBackToTop();
       backToTopBtn.addEventListener('click', function () {
         window.scrollTo({ top: 0, behavior: 'smooth' });
diff --git a/static/js/featured-resources.js b/static/js/featured-resources.js
index 2c58e824415..131f0cc400b 100644
--- a/static/js/featured-resources.js
+++ b/static/js/featured-resources.js
@@ -1,6 +1,8 @@
 /**
  * Featured Resources: reference popup, reading list, voting, filtering.
- * Depends on window.FORRT_FEATURED being set by featured_global.html.
+ * Depends on window.FORRT_FEATURED being set by featured_global.html. The publication
+ * cards (window.FORRT_PUB_CARDS_URL, about 2 MB) are fetched only when a reference or the
+ * reading list needs an entry the featured data doesn't have.
  */
 (function () {
   'use strict';
@@ -20,6 +22,26 @@
     return d.innerHTML;
   }
 
+  /** Decode HTML entities without parsing markup (a textarea's content is text only). */
+  function decodeEntities(s) {
+    var t = document.createElement('textarea');
+    t.innerHTML = s || '';
+    return t.value;
+  }
+
+  /** Titles and references from Crossref carry <i>, <em> and <scp>: escape, then restore those.
+      Same rule as layouts/partials/clusters/rich_text.html. */
+  function richText(s) {
+    return escHtml(decodeEntities(s).replace(/\s+/g, ' ').trim())
+      .replace(/&lt;(i|em)&gt;([\s\S]*?)&lt;\/\1&gt;/g, '<i>$2</i>')
+      .replace(/&lt;scp&gt;([\s\S]*?)&lt;\/scp&gt;/g, '<span class="scp">$1</span>');
+  }
+
+  /** The same text without markup, for copying and the PDF. */
+  function plainText(s) {
+    return decodeEntities(s).replace(/<\/?(?:i|em|scp)>/gi, '').replace(/\s+/g, ' ').trim();
+  }
+
   /** Flat lookup: DOI → resource object across all clusters. */
   function buildResourceIndex(data) {
     var idx = {};
@@ -32,31 +54,64 @@
     return idx;
   }
 
+  /** Returns a function that fetches the publication cards once and merges them into idx
+   *  (featured entries take precedence). It always resolves; after a failed fetch the
+   *  next call tries again. */
+  function pubCardLoader(idx, url) {
+    var pending = null;
+    return function () {
+      if (!pending) {
+        pending = !url ? Promise.resolve() : fetch(url)
+          .then(function (res) {
+            if (!res.ok) throw new Error('HTTP ' + res.status);
+            return res.json();
+          })
+          .then(function (cards) {
+            Object.keys(cards || {}).forEach(function (doi) {
+              if (!idx[doi]) idx[doi] = cards[doi];
+            });
+          })
+          .catch(function () { pending = null; });
+      }
+      return pending;
+    };
+  }
+
   /* ================================================================
      REFERENCE POPUP
      ================================================================ */
-  function initReferencePopup(resourceIdx) {
+  function initReferencePopup(resourceIdx, loadPubCards) {
     var backdrop = document.getElementById('fr-ref-popup-backdrop');
     var body = document.getElementById('fr-ref-popup-body');
     var closeBtn = backdrop ? backdrop.querySelector('.ref-popup-close') : null;
     if (!backdrop || !body) return;
 
-    function open(doi) {
+    var latest = null;  // the reference asked for last, so a slow fetch can't open an older one
+
+    function open(doi, trigger) {
+      latest = doi;
       var r = resourceIdx[doi];
-      if (!r) return;
+      if (!r) {
+        if (trigger) trigger.setAttribute('aria-busy', 'true');
+        loadPubCards().then(function () {
+          if (trigger) trigger.removeAttribute('aria-busy');
+          if (latest === doi && resourceIdx[doi]) open(doi);
+        });
+        return;
+      }
       var html = '';
       // Tags + title
       html += '<div class="ref-popup-tags">';
       if (r.focus) html += '<span class="tag tag-focus">' + escHtml(r.focus) + '</span>';
       if (r.resource_type) html += '<span class="tag tag-type">' + escHtml(r.resource_type) + '</span>';
       html += '</div>';
-      html += '<div class="ref-popup-title">' + escHtml(r.title) + '</div>';
+      html += '<div class="ref-popup-title">' + richText(r.title) + '</div>';
 
       // APA
       if (r.apa) {
         html += '<div class="ref-section">';
         html += '<div class="ref-section-label">APA Reference</div>';
-        html += '<div class="ref-apa">' + escHtml(r.apa) + '</div>';
+        html += '<div class="ref-apa">' + richText(r.apa) + '</div>';
         html += '<div class="ref-copy-row">';
         html += '<button class="ref-copy-btn" data-copy="apa" data-doi="' + escHtml(doi) + '">' +
           '<svg viewBox="0 0 16 16" fill="none" stroke="currentColor" stroke-width="1.5"><rect x="3" y="3" width="8" height="10" rx="1"/><path d="M5 3V2a1 1 0 011-1h5a1 1 0 011 1v9a1 1 0 01-1 1h-1"/></svg>' +
@@ -108,7 +163,7 @@
       var trigger = e.target.closest('.fr-ref-trigger[data-doi]');
       if (trigger) {
         e.preventDefault();
-        open(trigger.getAttribute('data-doi'));
+        open(trigger.getAttribute('data-doi'), trigger);
         return;
       }
       // Copy buttons inside popup
@@ -119,7 +174,7 @@
         var d = copyBtn.getAttribute('data-doi');
         var res = resourceIdx[d];
         if (!res) return;
-        var text = type === 'bibtex' ? res.bibtex : res.apa;
+        var text = type === 'bibtex' ? res.bibtex : plainText(res.apa);
         navigator.clipboard.writeText(text).then(function () {
           copyBtn.classList.add('copied');
           var orig = copyBtn.innerHTML;
@@ -147,7 +202,7 @@
   /* ================================================================
      READING LIST
      ================================================================ */
-  function initReadingList(resourceIdx) {
+  function initReadingList(resourceIdx, loadPubCards) {
     var LS_KEY = 'forrt-reading-list';
     var LS_TOOLTIP_KEY = 'forrt-rl-tooltip-shown';
     var pill = document.getElementById('fr-rl-pill');
@@ -223,7 +278,7 @@
         html += '<svg viewBox="0 0 16 16" fill="none" stroke="currentColor" stroke-width="2"><path d="M4 6l4 4 4-4"/></svg>';
         html += '</button>';
         html += '<div class="rl-panel-item-info">';
-        html += '<div class="rl-panel-item-title">' + escHtml(r.title || doi) + '</div>';
+        html += '<div class="rl-panel-item-title">' + (r.title ? richText(r.title) : escHtml(doi)) + '</div>';
         html += '<div class="rl-panel-item-ref">' + escHtml(r.short_ref || '') + '</div>';
         html += '</div>';
         html += '<button class="rl-panel-item-remove" data-doi="' + escHtml(doi) + '" aria-label="Remove">&times;</button>';
@@ -233,7 +288,7 @@
         html += '<div class="rl-panel-item-details">';
         if (r.apa) {
           html += '<div class="rl-detail-ref-row">';
-          html += '<div class="rl-detail-apa">' + escHtml(r.apa) + '</div>';
+          html += '<div class="rl-detail-apa">' + richText(r.apa) + '</div>';
           html += '<button class="rl-detail-copy" data-copy-apa="' + escHtml(doi) + '" title="Copy APA reference">';
           html += '<svg viewBox="0 0 16 16" fill="none" stroke="currentColor" stroke-width="1.5"><rect x="3" y="3" width="8" height="10" rx="1"/><path d="M5 3V2a1 1 0 011-1h5a1 1 0 011 1v9a1 1 0 01-1 1h-1"/></svg>';
           html += '</button>';
@@ -262,6 +317,9 @@
 
     function openPanel() {
       renderPanel();
+      if (getList().some(function (doi) { return !resourceIdx[doi]; })) {
+        loadPubCards().then(renderPanel);
+      }
       if (backdrop) backdrop.classList.add('open');
       if (panel) panel.classList.add('open');
       document.body.style.overflow = 'hidden';
@@ -327,7 +385,7 @@
         var d = copyBtn.getAttribute('data-copy-apa');
         var res = resourceIdx[d];
         if (res && res.apa) {
-          navigator.clipboard.writeText(res.apa).then(function () {
+          navigator.clipboard.writeText(plainText(res.apa)).then(function () {
             copyBtn.classList.add('copied');
             setTimeout(function () { copyBtn.classList.remove('copied'); }, 1500);
           });
@@ -359,18 +417,20 @@
 
     // Export BibTeX
     if (exportBtn) exportBtn.addEventListener('click', function () {
-      var list = getList();
-      var bibtex = list.map(function (doi) {
-        var r = resourceIdx[doi];
-        return r && r.bibtex ? r.bibtex : '% No BibTeX available for DOI: ' + doi;
-      }).join('\n\n');
-      var blob = new Blob([bibtex], { type: 'text/plain;charset=utf-8' });
-      var url = URL.createObjectURL(blob);
-      var a = document.createElement('a');
-      a.href = url;
-      a.download = 'forrt-reading-list.bib';
-      a.click();
-      URL.revokeObjectURL(url);
+      loadPubCards().then(function () {
+        var list = getList();
+        var bibtex = list.map(function (doi) {
+          var r = resourceIdx[doi];
+          return r && r.bibtex ? r.bibtex : '% No BibTeX available for DOI: ' + doi;
+        }).join('\n\n');
+        var blob = new Blob([bibtex], { type: 'text/plain;charset=utf-8' });
+        var url = URL.createObjectURL(blob);
+        var a = document.createElement('a');
+        a.href = url;
+        a.download = 'forrt-reading-list.bib';
+        a.click();
+        URL.revokeObjectURL(url);
+      });
     });
 
     // Download PDF
@@ -427,7 +487,7 @@
           doc.setFont('helvetica', 'bold');
           doc.setFontSize(11);
           doc.setTextColor(34, 34, 34);
-          var titleLines = doc.splitTextToSize(r.title || doi, contentW);
+          var titleLines = doc.splitTextToSize(r.title ? plainText(r.title) : doi, contentW);
           doc.text(titleLines, margin, y);
           y += titleLines.length * 5 + 2;
 
@@ -437,7 +497,7 @@
             doc.setFont('times', 'normal');
             doc.setFontSize(9);
             doc.setTextColor(68, 68, 68);
-            var apaLines = doc.splitTextToSize(r.apa, contentW - 10);
+            var apaLines = doc.splitTextToSize(plainText(r.apa), contentW - 10);
             // Hanging indent: first line at margin, rest indented
             apaLines.forEach(function (line, li) {
               checkPage(4);
@@ -494,20 +554,22 @@
         pdfBtn.innerHTML = origHTML;
       }
 
-      // Load jsPDF from CDN if not already loaded
-      if (window.jspdf) {
-        generatePDF();
-      } else {
-        var script = document.createElement('script');
-        script.src = '/vendor/assets/jspdf/2.5.1/jspdf.umd.min.js';
-        script.onload = generatePDF;
-        script.onerror = function () {
-          pdfBtn.disabled = false;
-          pdfBtn.innerHTML = origHTML;
-          alert('Could not load PDF library. Please check your internet connection.');
-        };
-        document.head.appendChild(script);
-      }
+      // Load jsPDF if not already loaded, once the publication cards are in
+      loadPubCards().then(function () {
+        if (window.jspdf) {
+          generatePDF();
+        } else {
+          var script = document.createElement('script');
+          script.src = '/vendor/assets/jspdf/2.5.1/jspdf.umd.min.js';
+          script.onload = generatePDF;
+          script.onerror = function () {
+            pdfBtn.disabled = false;
+            pdfBtn.innerHTML = origHTML;
+            alert('Could not load PDF library. Please check your internet connection.');
+          };
+          document.head.appendChild(script);
+        }
+      });
     });
 
     // Initial state
@@ -850,18 +912,24 @@
      ================================================================ */
   onReady(function () {
     var data = window.FORRT_FEATURED;
-    var pubCards = window.FORRT_PUB_CARDS;
-    if (!data && !pubCards) return;
+    var pubCardsUrl = window.FORRT_PUB_CARDS_URL;
+    if (!data && !pubCardsUrl) return;
     var resourceIdx = buildResourceIndex(data);
-    // Merge pub_cards into resource index (featured entries take precedence)
-    if (pubCards) {
-      Object.keys(pubCards).forEach(function (doi) {
-        if (!resourceIdx[doi]) resourceIdx[doi] = pubCards[doi];
-      });
+    var loadPubCards = pubCardLoader(resourceIdx, pubCardsUrl);
+    // Start the fetch as soon as a visitor points at, touches or tabs to a reference or
+    // save control, so the popup is usually ready by the time they click.
+    var intents = ['pointerover', 'touchstart', 'focusin'];
+    function onIntent(e) {
+      if (!e.target.closest || !e.target.closest('.fr-ref-trigger, .fr-bookmark-btn, #fr-rl-pill')) return;
+      loadPubCards();
+      intents.forEach(function (type) { document.removeEventListener(type, onIntent, true); });
     }
+    intents.forEach(function (type) {
+      document.addEventListener(type, onIntent, { capture: true, passive: true });
+    });
 
-    initReferencePopup(resourceIdx);
-    initReadingList(resourceIdx);
+    initReferencePopup(resourceIdx, loadPubCards);
+    initReadingList(resourceIdx, loadPubCards);
     initVoting();
     initCarousels();
     sortCardsByFocus();
diff --git a/static/js/just-os-chat.js b/static/js/just-os-chat.js
index abfa11f9ad8..e96c9096629 100644
--- a/static/js/just-os-chat.js
+++ b/static/js/just-os-chat.js
@@ -166,6 +166,7 @@
 
     const bubble = document.createElement('div');
     bubble.className = 'just-os-bubble-content';
+    bubble.dir = 'auto';
 
     if (msg.role === 'user') {
       bubble.textContent = msg.content;
@@ -531,12 +532,19 @@
 
   function openHistoryPanel(container) {
     renderHistoryList(container);
-    getHistoryPanel(container).style.display = 'flex';
+    const panel = getHistoryPanel(container);
+    panel.style.display = 'flex';
+    const back = panel.querySelector('.just-os-history-back');
+    if (back) back.focus();
   }
 
   function closeHistoryPanel(container) {
     const panel = container.querySelector('.just-os-history-panel');
-    if (panel) panel.style.display = 'none';
+    if (!panel) return;
+    const hadFocus = panel.contains(document.activeElement);
+    panel.style.display = 'none';
+    const opener = container.querySelector('.just-os-history-btn');
+    if (hadFocus && opener) opener.focus();
   }
 
   /* -------------------------------------------------- */
@@ -1065,7 +1073,6 @@
 
     if (win.style.display === 'flex') {
       win.style.display = 'none';
-      bubble.classList.add('bubble-visible');
       win.classList.remove('floating');
       // Reset any drag-resize inline styles
       win.style.width = '';
@@ -1079,6 +1086,47 @@
     }
   };
 
+  // Escape closes the history panel and then the chat. Tab stays inside the history panel while it
+  // covers the chat, and inside the chat where it fills the screen.
+  document.addEventListener('keydown', function (event) {
+    const container = getContainer();
+    const history = container && container.querySelector('.just-os-history-panel');
+    const historyOpen = history && history.style.display === 'flex';
+    const win = document.getElementById('just-os-window');
+    const chatOpen = win && win.style.display === 'flex';
+    if (event.key === 'Escape') {
+      if (activeTooltipTeardown) return;
+      if (historyOpen) {
+        closeHistoryPanel(container);
+      } else if (chatOpen) {
+        window.toggleJustOS();
+        const launcher = document.getElementById('just-os-btn');
+        if (launcher) {
+          launcher.setAttribute('aria-expanded', 'false');
+          launcher.focus();
+        }
+      }
+      return;
+    }
+    if (event.key !== 'Tab' || !(historyOpen || (chatOpen && win.offsetWidth >= window.innerWidth))) return;
+    const scope = historyOpen ? history : win;
+    const stops = Array.from(scope.querySelectorAll('button,textarea,a[href]')).filter(function (el) {
+      return el.getClientRects().length > 0 && !el.disabled;
+    });
+    const first = stops[0];
+    const last = stops[stops.length - 1];
+    if (!scope.contains(document.activeElement)) {
+      event.preventDefault();
+      (event.shiftKey ? last : first).focus();
+    } else if (event.shiftKey && document.activeElement === first) {
+      event.preventDefault();
+      last.focus();
+    } else if (!event.shiftKey && document.activeElement === last) {
+      event.preventDefault();
+      first.focus();
+    }
+  });
+
   function updateFloatIcon(win) {
     var btn = document.getElementById('just-os-float-btn');
     if (!btn) return;
@@ -1112,12 +1160,6 @@
     }
   };
 
-  window.dismissJustOS = function () {
-    var widget = document.getElementById('just-os-widget');
-    if (widget) widget.style.display = 'none';
-    sessionStorage.setItem('just-os-dismissed', '1');
-  };
-
   /* -------------------------------------------------- */
   /*  Custom drag-resize (bottom-left handle)            */
   /* -------------------------------------------------- */
@@ -1177,14 +1219,6 @@
   /* -------------------------------------------------- */
 
   function init() {
-    // Hide widget if dismissed this session
-    if (sessionStorage.getItem('just-os-dismissed')) {
-      var widget = document.getElementById('just-os-widget');
-      if (widget) widget.style.display = 'none';
-      // The standalone page has its own container, so keep initializing there.
-      if (!document.getElementById('just-os-fullpage')) return;
-    }
-
     const container = getContainer();
     if (!container) return;
 
@@ -1204,19 +1238,6 @@
   // Save state before leaving
   window.addEventListener('beforeunload', saveState);
 
-  // Auto-toggle helper bubble every 10 seconds (widget only)
-  var bubbleInterval = setInterval(function () {
-    if (sessionStorage.getItem('just-os-dismissed')) {
-      clearInterval(bubbleInterval);
-      return;
-    }
-    const bubble = document.getElementById('just-os-bubble');
-    const win = document.getElementById('just-os-window');
-    if (bubble && win && win.style.display !== 'flex') {
-      bubble.classList.toggle('bubble-visible');
-    }
-  }, 10000);
-
   // Init on DOM ready
   if (document.readyState === 'loading') {
     document.addEventListener('DOMContentLoaded', init);
diff --git a/static/js/newsletter.js b/static/js/newsletter.js
deleted file mode 100644
index 8cc401e5cb6..00000000000
--- a/static/js/newsletter.js
+++ /dev/null
@@ -1,94 +0,0 @@
-// Newsletter sign-up (layouts/partials/newsletter_form.html). Nothing loads from elsewhere until
-// a visitor presses Subscribe. Then Google reCAPTCHA loads, as EmailOctopus requires, and the form
-// posts the address to EmailOctopus the way its own embed does.
-(() => {
-  let recaptcha;
-  let recaptchaTries = 0;
-  const loadRecaptcha = () => {
-    recaptcha ??= new Promise((resolve, reject) => {
-      const script = document.createElement('script');
-      // A failed or stalled load clears the cache, so the next Subscribe tries again. Each retry
-      // gets its own URL; otherwise the browser waits on the stalled request again.
-      const fail = () => {
-        clearTimeout(timer);
-        recaptcha = null;
-        script.remove();
-        reject(new Error('reCAPTCHA did not load'));
-      };
-      const timer = setTimeout(fail, 120000);
-      window.forrtRecaptchaReady = () => { clearTimeout(timer); resolve(window.grecaptcha); };
-      script.src = 'https://www.google.com/recaptcha/api.js?onload=forrtRecaptchaReady&render=explicit'
-        + (recaptchaTries ? `&retry=${recaptchaTries}` : '');
-      recaptchaTries += 1;
-      script.async = true;
-      script.onerror = fail;
-      document.head.append(script);
-    });
-    return recaptcha;
-  };
-
-  document.querySelectorAll('.newsletter-form').forEach((form) => {
-    const button = form.querySelector('.newsletter-submit');
-    const status = form.querySelector('.newsletter-status');
-    const email = form.querySelector('input[type=email]');
-    let widget;
-    let solved;
-    const say = (text, error) => {
-      status.textContent = text;
-      status.classList.toggle('is-error', Boolean(error));
-    };
-    const token = async () => {
-      const grecaptcha = await loadRecaptcha();
-      if (widget === undefined) {
-        const holder = document.createElement('div');
-        form.append(holder);
-        widget = grecaptcha.render(holder, {
-          sitekey: form.dataset.newsletterSitekey, size: 'invisible', badge: 'inline', isolated: true,
-          callback: (value) => solved?.resolve(value),
-          'error-callback': () => solved?.reject(new Error('reCAPTCHA failed')),
-        });
-        holder.hidden = true;
-      }
-      return new Promise((resolve, reject) => {
-        solved = { resolve, reject };
-        grecaptcha.execute(widget);
-      });
-    };
-
-    form.addEventListener('submit', async (event) => {
-      event.preventDefault();
-      if (!form.reportValidity()) return;
-      button.disabled = true;
-      say('Subscribing…');
-      try {
-        const body = new URLSearchParams();
-        form.querySelectorAll('input[name]').forEach((input) => body.set(input.name, input.value.trim()));
-        // Covers a reCAPTCHA script that stalls as well as a challenge the visitor closes.
-        body.set('recaptcha-response', await Promise.race([
-          token(),
-          new Promise((resolve, reject) => setTimeout(() => reject(new Error('reCAPTCHA timed out')), 120000)),
-        ]));
-        const reply = await (await fetch(form.action, { method: 'POST', mode: 'cors', cache: 'no-cache', body })).json();
-        if (reply.success) {
-          form.classList.add('is-done');
-          const pending = reply.contact?.status === 'PENDING';
-          say(pending
-            ? 'Almost there! Click the link in the confirmation email to finish subscribing.'
-            : 'Thanks for subscribing! Look out for FORRT news in your inbox.');
-          status.focus();
-          return;
-        }
-        const code = reply.error?.code;
-        say(code === 'INVALID_PARAMETERS'
-          ? 'That email address does not look right. Please check it and try again.'
-          : 'Sorry, that did not work. Please try again, or ask to join at info@forrt.org.', true);
-        if (code === 'INVALID_PARAMETERS') email.focus();
-      } catch {
-        say('Sorry, that did not work. Please try again, or ask to join at info@forrt.org.', true);
-      } finally {
-        button.disabled = false;
-        if (widget !== undefined) window.grecaptcha?.reset(widget);
-      }
-    });
-  });
-})();
diff --git a/static/js/tag-browser.js b/static/js/tag-browser.js
index 1c35de3be6f..ffb93875115 100644
--- a/static/js/tag-browser.js
+++ b/static/js/tag-browser.js
@@ -8,6 +8,63 @@
  * With no parameter, or with JavaScript off, the page is the server-rendered
  * tag cloud and nothing here runs.
  */
+/** The search over every tag: while it has a query, the most-used row steps aside and the A to Z list shows only matches. */
+(function () {
+  "use strict";
+  var box = document.querySelector(".tag-find");
+  var input = document.getElementById("tag-filter");
+  // A selected tag replaces the list this searches, so the search stays hidden with it.
+  if (!box || !input || new URLSearchParams(window.location.search).get("tag")) return;
+  box.hidden = false;
+  var top = document.querySelector(".tag-top");
+  var letters = document.querySelector(".tag-letters");
+  var groups = Array.prototype.slice.call(document.querySelectorAll(".tag-group"));
+  var count = box.querySelector(".tag-filter-count");
+  // Each letter shows its most used tags (twelve on a phone, sixteen otherwise) and a button for the rest, so the list stays walkable.
+  var FIRST = window.matchMedia("(max-width: 760px)").matches ? 12 : 16;
+  {
+    groups.forEach(function (group) {
+      var items = group.querySelectorAll("li");
+      if (items.length < FIRST + 5) return;
+      // The preview shows the letter's most used tags, in their alphabetical places.
+      var ranked = Array.prototype.slice.call(items).sort(function (a, b) {
+        return Number(b.querySelector(".tag-count").textContent) - Number(a.querySelector(".tag-count").textContent);
+      });
+      ranked.slice(0, FIRST).forEach(function (item) { item.classList.add("is-top"); });
+      group.classList.add("is-short");
+      var more = document.createElement("button");
+      more.type = "button";
+      more.className = "tag-group-more";
+      more.textContent = "All " + items.length + " tags under " + group.querySelector("h3").textContent;
+      more.addEventListener("click", function () {
+        // Focus moves to the first tag the button revealed, so keyboard users carry on from there.
+        var next = group.querySelector("li:not(.is-top) a");
+        group.classList.remove("is-short");
+        more.remove();
+        if (next) next.focus();
+      });
+      group.appendChild(more);
+    });
+  }
+  input.addEventListener("input", function () {
+    var query = input.value.trim().toLowerCase();
+    document.querySelector(".tag-all").classList.toggle("is-searching", Boolean(query));
+    var shown = 0;
+    groups.forEach(function (group) {
+      var any = false;
+      Array.prototype.forEach.call(group.querySelectorAll("li"), function (item) {
+        var match = !query || item.firstChild.firstChild.textContent.toLowerCase().indexOf(query) !== -1;
+        item.hidden = !match;
+        if (match) { any = true; shown += 1; }
+      });
+      group.hidden = !any;
+    });
+    if (top) top.hidden = Boolean(query);
+    if (letters) letters.hidden = Boolean(query);
+    count.textContent = !query ? "" : shown ? shown + (shown === 1 ? " tag matches" : " tags match") : "No tag matches.";
+  });
+})();
+
 (function () {
   "use strict";
 
@@ -15,6 +72,12 @@
   if (!tag) return;
 
   var needle = tag.toLowerCase();
+  var label = tag;
+
+  /** The address form of a term, as the old /tag/<slug>/ pages had it: /tag/open-science/ arrives here as a slug. */
+  function slug(term) {
+    return term.replace(/[^\p{L}\p{N}\s.#_+~/-]/gu, "").trim().replace(/\s/g, "-");
+  }
 
   /** "neurodiversity-lessonbank" reads better as "Neurodiversity lessonbank". */
   function sectionLabel(section) {
@@ -30,13 +93,14 @@
     if (!results || !heading || !list) return;
 
     heading.textContent = pages.length
-      ? pages.length + (pages.length === 1 ? " page tagged " : " pages tagged ") + "“" + tag + "”"
-      : "No pages are tagged “" + tag + "”";
+      ? pages.length + (pages.length === 1 ? " page tagged " : " pages tagged ") + "“" + label + "”"
+      : "No pages are tagged “" + label + "”";
 
-    pages.forEach(function (page) {
+    var STEP = 50;
+    pages.forEach(function (page, index) {
       var item = document.createElement("li");
-      item.className = "mb-2";
-
+      item.hidden = index >= STEP;
+      
       var link = document.createElement("a");
       link.href = page.u;
       link.textContent = page.t;
@@ -45,15 +109,32 @@
       var label = sectionLabel(page.s);
       if (label) {
         var badge = document.createElement("span");
-        badge.className = "badge badge-light ml-2";
+        badge.className = "tag-section";
         badge.textContent = label;
         item.appendChild(badge);
       }
       list.appendChild(item);
     });
 
+    if (pages.length > STEP) {
+      var more = document.createElement("button");
+      more.type = "button";
+      more.className = "btn tag-show-more";
+      more.textContent = "Show more";
+      list.after(more);
+      more.addEventListener("click", function () {
+        var waiting = list.querySelectorAll("li[hidden]");
+        for (var i = 0; i < STEP && i < waiting.length; i += 1) waiting[i].hidden = false;
+        var link = waiting[0].querySelector("a");
+        if (link) link.focus();
+        if (waiting.length <= STEP) more.remove();
+      });
+    }
+
     results.hidden = false;
-    // The cloud stays available below the results, so no need to hide it.
+    // The results have a link back to every tag, so the cloud would only push the footer away.
+    var cloud = document.getElementById("tag-cloud");
+    if (cloud) cloud.hidden = true;
     results.scrollIntoView({ block: "nearest" });
   }
 
@@ -65,9 +146,15 @@
         return response.json();
       })
       .then(function (rows) {
+        // A slug that only an address could have produced reads better with spaces.
+        if (!rows.some(function (row) { return row.g && row.g.indexOf(needle) !== -1; })) {
+          label = tag.replace(/-/g, " ");
+        }
         render(
           rows.filter(function (row) {
-            return row.g && row.g.indexOf(needle) !== -1;
+            return row.g && row.g.some(function (term) {
+              return term === needle || slug(term) === needle;
+            });
           })
         );
       })
diff --git a/static/js/tower/game.bundle.js b/static/js/tower/game.bundle.js
new file mode 100644
index 00000000000..b6093e6185d
--- /dev/null
+++ b/static/js/tower/game.bundle.js
@@ -0,0 +1,4313 @@
+(()=>{var qh=0,uc=1,Yh=2;var Ur=1,xa=2,Gs=3,Bi=0,je=1,ei=2,ni=0,Hs=1,dc=2,fc=3,pc=4,Zh=5;var os=100,$h=101,Jh=102,Kh=103,jh=104,Qh=200,tu=201,eu=202,nu=203,mc=204,gc=205,iu=206,su=207,ru=208,ou=209,au=210,lu=211,cu=212,hu=213,uu=214,Io=0,Po=1,Lo=2,Cs=3,Do=4,No=5,Uo=6,Fo=7,xc=0,du=1,fu=2,kn=0,_c=1,yc=2,vc=3,Fr=4,Mc=5,Sc=6,bc=7;var wc=300,zi=301,as=302,_a=303,ya=304,Or=306,Oo=1e3,Yn=1001,Bo=1002,Ze=1003,pu=1004;var Br=1005;var Je=1006,va=1007;var ki=1008;var xn=1009,Tc=1010,Ec=1011,Ws=1012,Ma=1013,Vn=1014,Gn=1015,Hn=1016,Sa=1017,ba=1018,Xs=1020,Ac=35902,Cc=35899,Rc=1021,Ic=1022,In=1023,Zn=1026,Vi=1027,Pc=1028,wa=1029,Gi=1030,Ta=1031;var Ea=1033,zr=33776,kr=33777,Vr=33778,Gr=33779,Aa=35840,Ca=35841,Ra=35842,Ia=35843,Pa=36196,La=37492,Da=37496,Na=37488,Ua=37489,Hr=37490,Fa=37491,Oa=37808,Ba=37809,za=37810,ka=37811,Va=37812,Ga=37813,Ha=37814,Wa=37815,Xa=37816,qa=37817,Ya=37818,Za=37819,$a=37820,Ja=37821,Ka=36492,ja=36494,Qa=36495,tl=36283,el=36284,Wr=36285,nl=36286;var ur=2300,zo=2301,Ao=2302,Ql=2303,tc=2400,ec=2401,nc=2402;var mu=3200;var il=0,gu=1,gi="",ln="srgb",dr="srgb-linear",fr="linear",Me="srgb";var Co=7680,Lc=7681;var Dc=517;var sl=519,xu=512,_u=513,yu=514,rl=515,vu=516,Mu=517,ol=518,Su=519,bu=35044;var Nc="300 es",zn=2e3,Rs=2001;function Dd(i){for(let t=i.length-1;t>=0;--t)if(i[t]>=65535)return!0;return!1}function Nd(i){return ArrayBuffer.isView(i)&&!(i instanceof DataView)}function pr(i){return document.createElementNS("http://www.w3.org/1999/xhtml",i)}function wu(){let i=pr("canvas");return i.style.display="block",i}var fh={},Is=null;function Uc(...i){let t="THREE."+i.shift();Is?Is("log",t,...i):console.log(t,...i)}function Tu(i){let t=i[0];if(typeof t=="string"&&t.startsWith("TSL:")){let e=i[1];e&&e.isStackTrace?i[0]+=" "+e.getLocation():i[1]='Stack trace not available. Enable "THREE.Node.captureStackTrace" to capture stack traces.'}return i}function Jt(...i){i=Tu(i);let t="THREE."+i.shift();if(Is)Is("warn",t,...i);else{let e=i[0];e&&e.isStackTrace?console.warn(e.getError(t)):console.warn(t,...i)}}function jt(...i){i=Tu(i);let t="THREE."+i.shift();if(Is)Is("error",t,...i);else{let e=i[0];e&&e.isStackTrace?console.error(e.getError(t)):console.error(t,...i)}}function es(...i){let t=i.join(" ");t in fh||(fh[t]=!0,Jt(...i))}function Eu(i,t,e){return new Promise(function(n,s){function r(){switch(i.clientWaitSync(t,i.SYNC_FLUSH_COMMANDS_BIT,0)){case i.WAIT_FAILED:s();break;case i.TIMEOUT_EXPIRED:setTimeout(r,e);break;default:n()}}setTimeout(r,e)})}var Au={[Io]:Po,[Lo]:Uo,[Do]:Fo,[Cs]:No,[Po]:Io,[Uo]:Lo,[Fo]:Do,[No]:Cs},$n=class{addEventListener(t,e){this._listeners===void 0&&(this._listeners={});let n=this._listeners;n[t]===void 0&&(n[t]=[]),n[t].indexOf(e)===-1&&n[t].push(e)}hasEventListener(t,e){let n=this._listeners;return n===void 0?!1:n[t]!==void 0&&n[t].indexOf(e)!==-1}removeEventListener(t,e){let n=this._listeners;if(n===void 0)return;let s=n[t];if(s!==void 0){let r=s.indexOf(e);r!==-1&&s.splice(r,1)}}dispatchEvent(t){let e=this._listeners;if(e===void 0)return;let n=e[t.type];if(n!==void 0){t.target=this;let s=n.slice(0);for(let r=0,o=s.length;r<o;r++)s[r].call(this,t);t.target=null}}},en=["00","01","02","03","04","05","06","07","08","09","0a","0b","0c","0d","0e","0f","10","11","12","13","14","15","16","17","18","19","1a","1b","1c","1d","1e","1f","20","21","22","23","24","25","26","27","28","29","2a","2b","2c","2d","2e","2f","30","31","32","33","34","35","36","37","38","39","3a","3b","3c","3d","3e","3f","40","41","42","43","44","45","46","47","48","49","4a","4b","4c","4d","4e","4f","50","51","52","53","54","55","56","57","58","59","5a","5b","5c","5d","5e","5f","60","61","62","63","64","65","66","67","68","69","6a","6b","6c","6d","6e","6f","70","71","72","73","74","75","76","77","78","79","7a","7b","7c","7d","7e","7f","80","81","82","83","84","85","86","87","88","89","8a","8b","8c","8d","8e","8f","90","91","92","93","94","95","96","97","98","99","9a","9b","9c","9d","9e","9f","a0","a1","a2","a3","a4","a5","a6","a7","a8","a9","aa","ab","ac","ad","ae","af","b0","b1","b2","b3","b4","b5","b6","b7","b8","b9","ba","bb","bc","bd","be","bf","c0","c1","c2","c3","c4","c5","c6","c7","c8","c9","ca","cb","cc","cd","ce","cf","d0","d1","d2","d3","d4","d5","d6","d7","d8","d9","da","db","dc","dd","de","df","e0","e1","e2","e3","e4","e5","e6","e7","e8","e9","ea","eb","ec","ed","ee","ef","f0","f1","f2","f3","f4","f5","f6","f7","f8","f9","fa","fb","fc","fd","fe","ff"];var Ro=Math.PI/180,ko=180/Math.PI;function qs(){let i=Math.random()*4294967295|0,t=Math.random()*4294967295|0,e=Math.random()*4294967295|0,n=Math.random()*4294967295|0;return(en[i&255]+en[i>>8&255]+en[i>>16&255]+en[i>>24&255]+"-"+en[t&255]+en[t>>8&255]+"-"+en[t>>16&15|64]+en[t>>24&255]+"-"+en[e&63|128]+en[e>>8&255]+"-"+en[e>>16&255]+en[e>>24&255]+en[n&255]+en[n>>8&255]+en[n>>16&255]+en[n>>24&255]).toLowerCase()}function ce(i,t,e){return Math.max(t,Math.min(e,i))}function Ud(i,t){return(i%t+t)%t}function El(i,t,e){return(1-e)*i+e*t}function nr(i,t){switch(t.constructor){case Float32Array:return i;case Uint32Array:return i/4294967295;case Uint16Array:return i/65535;case Uint8Array:case Uint8ClampedArray:return i/255;case Int32Array:return Math.max(i/2147483647,-1);case Int16Array:return Math.max(i/32767,-1);case Int8Array:return Math.max(i/127,-1);default:throw new Error("THREE.MathUtils: Invalid component type.")}}function dn(i,t){switch(t.constructor){case Float32Array:return i;case Uint32Array:return Math.round(i*4294967295);case Uint16Array:return Math.round(i*65535);case Uint8Array:case Uint8ClampedArray:return Math.round(i*255);case Int32Array:return Math.round(i*2147483647);case Int16Array:return Math.round(i*32767);case Int8Array:return Math.round(i*127);default:throw new Error("THREE.MathUtils: Invalid component type.")}}var xt=class i{static{i.prototype.isVector2=!0}constructor(t=0,e=0){this.x=t,this.y=e}get width(){return this.x}set width(t){this.x=t}get height(){return this.y}set height(t){this.y=t}set(t,e){return this.x=t,this.y=e,this}setScalar(t){return this.x=t,this.y=t,this}setX(t){return this.x=t,this}setY(t){return this.y=t,this}setComponent(t,e){switch(t){case 0:this.x=e;break;case 1:this.y=e;break;default:throw new Error("THREE.Vector2: index is out of range: "+t)}return this}getComponent(t){switch(t){case 0:return this.x;case 1:return this.y;default:throw new Error("THREE.Vector2: index is out of range: "+t)}}clone(){return new this.constructor(this.x,this.y)}copy(t){return this.x=t.x,this.y=t.y,this}add(t){return this.x+=t.x,this.y+=t.y,this}addScalar(t){return this.x+=t,this.y+=t,this}addVectors(t,e){return this.x=t.x+e.x,this.y=t.y+e.y,this}addScaledVector(t,e){return this.x+=t.x*e,this.y+=t.y*e,this}sub(t){return this.x-=t.x,this.y-=t.y,this}subScalar(t){return this.x-=t,this.y-=t,this}subVectors(t,e){return this.x=t.x-e.x,this.y=t.y-e.y,this}multiply(t){return this.x*=t.x,this.y*=t.y,this}multiplyScalar(t){return this.x*=t,this.y*=t,this}divide(t){return this.x/=t.x,this.y/=t.y,this}divideScalar(t){return this.multiplyScalar(1/t)}applyMatrix3(t){let e=this.x,n=this.y,s=t.elements;return this.x=s[0]*e+s[3]*n+s[6],this.y=s[1]*e+s[4]*n+s[7],this}min(t){return this.x=Math.min(this.x,t.x),this.y=Math.min(this.y,t.y),this}max(t){return this.x=Math.max(this.x,t.x),this.y=Math.max(this.y,t.y),this}clamp(t,e){return this.x=ce(this.x,t.x,e.x),this.y=ce(this.y,t.y,e.y),this}clampScalar(t,e){return this.x=ce(this.x,t,e),this.y=ce(this.y,t,e),this}clampLength(t,e){let n=this.length();return this.divideScalar(n||1).multiplyScalar(ce(n,t,e))}floor(){return this.x=Math.floor(this.x),this.y=Math.floor(this.y),this}ceil(){return this.x=Math.ceil(this.x),this.y=Math.ceil(this.y),this}round(){return this.x=Math.round(this.x),this.y=Math.round(this.y),this}roundToZero(){return this.x=Math.trunc(this.x),this.y=Math.trunc(this.y),this}negate(){return this.x=-this.x,this.y=-this.y,this}dot(t){return this.x*t.x+this.y*t.y}cross(t){return this.x*t.y-this.y*t.x}lengthSq(){return this.x*this.x+this.y*this.y}length(){return Math.sqrt(this.x*this.x+this.y*this.y)}manhattanLength(){return Math.abs(this.x)+Math.abs(this.y)}normalize(){return this.divideScalar(this.length()||1)}angle(){return Math.atan2(-this.y,-this.x)+Math.PI}angleTo(t){let e=Math.sqrt(this.lengthSq()*t.lengthSq());if(e===0)return Math.PI/2;let n=this.dot(t)/e;return Math.acos(ce(n,-1,1))}distanceTo(t){return Math.sqrt(this.distanceToSquared(t))}distanceToSquared(t){let e=this.x-t.x,n=this.y-t.y;return e*e+n*n}manhattanDistanceTo(t){return Math.abs(this.x-t.x)+Math.abs(this.y-t.y)}setLength(t){return this.normalize().multiplyScalar(t)}lerp(t,e){return this.x+=(t.x-this.x)*e,this.y+=(t.y-this.y)*e,this}lerpVectors(t,e,n){return this.x=t.x+(e.x-t.x)*n,this.y=t.y+(e.y-t.y)*n,this}equals(t){return t.x===this.x&&t.y===this.y}fromArray(t,e=0){return this.x=t[e],this.y=t[e+1],this}toArray(t=[],e=0){return t[e]=this.x,t[e+1]=this.y,t}fromBufferAttribute(t,e){return this.x=t.getX(e),this.y=t.getY(e),this}rotateAround(t,e){let n=Math.cos(e),s=Math.sin(e),r=this.x-t.x,o=this.y-t.y;return this.x=r*n-o*s+t.x,this.y=r*s+o*n+t.y,this}random(){return this.x=Math.random(),this.y=Math.random(),this}*[Symbol.iterator](){yield this.x,yield this.y}},Jn=class{constructor(t=0,e=0,n=0,s=1){this.isQuaternion=!0,this._x=t,this._y=e,this._z=n,this._w=s}static slerpFlat(t,e,n,s,r,o,a){let l=n[s+0],c=n[s+1],h=n[s+2],f=n[s+3],u=r[o+0],d=r[o+1],g=r[o+2],M=r[o+3];if(f!==M||l!==u||c!==d||h!==g){let m=l*u+c*d+h*g+f*M;m<0&&(u=-u,d=-d,g=-g,M=-M,m=-m);let p=1-a;if(m<.9995){let T=Math.acos(m),P=Math.sin(T);p=Math.sin(p*T)/P,a=Math.sin(a*T)/P,l=l*p+u*a,c=c*p+d*a,h=h*p+g*a,f=f*p+M*a}else{l=l*p+u*a,c=c*p+d*a,h=h*p+g*a,f=f*p+M*a;let T=1/Math.sqrt(l*l+c*c+h*h+f*f);l*=T,c*=T,h*=T,f*=T}}t[e]=l,t[e+1]=c,t[e+2]=h,t[e+3]=f}static multiplyQuaternionsFlat(t,e,n,s,r,o){let a=n[s],l=n[s+1],c=n[s+2],h=n[s+3],f=r[o],u=r[o+1],d=r[o+2],g=r[o+3];return t[e]=a*g+h*f+l*d-c*u,t[e+1]=l*g+h*u+c*f-a*d,t[e+2]=c*g+h*d+a*u-l*f,t[e+3]=h*g-a*f-l*u-c*d,t}get x(){return this._x}set x(t){this._x=t,this._onChangeCallback()}get y(){return this._y}set y(t){this._y=t,this._onChangeCallback()}get z(){return this._z}set z(t){this._z=t,this._onChangeCallback()}get w(){return this._w}set w(t){this._w=t,this._onChangeCallback()}set(t,e,n,s){return this._x=t,this._y=e,this._z=n,this._w=s,this._onChangeCallback(),this}clone(){return new this.constructor(this._x,this._y,this._z,this._w)}copy(t){return this._x=t.x,this._y=t.y,this._z=t.z,this._w=t.w,this._onChangeCallback(),this}setFromEuler(t,e=!0){let n=t._x,s=t._y,r=t._z,o=t._order,a=Math.cos,l=Math.sin,c=a(n/2),h=a(s/2),f=a(r/2),u=l(n/2),d=l(s/2),g=l(r/2);switch(o){case"XYZ":this._x=u*h*f+c*d*g,this._y=c*d*f-u*h*g,this._z=c*h*g+u*d*f,this._w=c*h*f-u*d*g;break;case"YXZ":this._x=u*h*f+c*d*g,this._y=c*d*f-u*h*g,this._z=c*h*g-u*d*f,this._w=c*h*f+u*d*g;break;case"ZXY":this._x=u*h*f-c*d*g,this._y=c*d*f+u*h*g,this._z=c*h*g+u*d*f,this._w=c*h*f-u*d*g;break;case"ZYX":this._x=u*h*f-c*d*g,this._y=c*d*f+u*h*g,this._z=c*h*g-u*d*f,this._w=c*h*f+u*d*g;break;case"YZX":this._x=u*h*f+c*d*g,this._y=c*d*f+u*h*g,this._z=c*h*g-u*d*f,this._w=c*h*f-u*d*g;break;case"XZY":this._x=u*h*f-c*d*g,this._y=c*d*f-u*h*g,this._z=c*h*g+u*d*f,this._w=c*h*f+u*d*g;break;default:Jt("Quaternion: .setFromEuler() encountered an unknown order: "+o)}return e===!0&&this._onChangeCallback(),this}setFromAxisAngle(t,e){let n=e/2,s=Math.sin(n);return this._x=t.x*s,this._y=t.y*s,this._z=t.z*s,this._w=Math.cos(n),this._onChangeCallback(),this}setFromRotationMatrix(t){let e=t.elements,n=e[0],s=e[4],r=e[8],o=e[1],a=e[5],l=e[9],c=e[2],h=e[6],f=e[10],u=n+a+f;if(u>0){let d=.5/Math.sqrt(u+1);this._w=.25/d,this._x=(h-l)*d,this._y=(r-c)*d,this._z=(o-s)*d}else if(n>a&&n>f){let d=2*Math.sqrt(1+n-a-f);this._w=(h-l)/d,this._x=.25*d,this._y=(s+o)/d,this._z=(r+c)/d}else if(a>f){let d=2*Math.sqrt(1+a-n-f);this._w=(r-c)/d,this._x=(s+o)/d,this._y=.25*d,this._z=(l+h)/d}else{let d=2*Math.sqrt(1+f-n-a);this._w=(o-s)/d,this._x=(r+c)/d,this._y=(l+h)/d,this._z=.25*d}return this._onChangeCallback(),this}setFromUnitVectors(t,e){let n=t.dot(e)+1;return n<1e-8?(n=0,Math.abs(t.x)>Math.abs(t.z)?(this._x=-t.y,this._y=t.x,this._z=0,this._w=n):(this._x=0,this._y=-t.z,this._z=t.y,this._w=n)):(this._x=t.y*e.z-t.z*e.y,this._y=t.z*e.x-t.x*e.z,this._z=t.x*e.y-t.y*e.x,this._w=n),this.normalize()}angleTo(t){return 2*Math.acos(Math.abs(ce(this.dot(t),-1,1)))}rotateTowards(t,e){let n=this.angleTo(t);if(n===0)return this;let s=Math.min(1,e/n);return this.slerp(t,s),this}identity(){return this.set(0,0,0,1)}invert(){return this.conjugate()}conjugate(){return this._x*=-1,this._y*=-1,this._z*=-1,this._onChangeCallback(),this}dot(t){return this._x*t._x+this._y*t._y+this._z*t._z+this._w*t._w}lengthSq(){return this._x*this._x+this._y*this._y+this._z*this._z+this._w*this._w}length(){return Math.sqrt(this._x*this._x+this._y*this._y+this._z*this._z+this._w*this._w)}normalize(){let t=this.length();return t===0?(this._x=0,this._y=0,this._z=0,this._w=1):(t=1/t,this._x=this._x*t,this._y=this._y*t,this._z=this._z*t,this._w=this._w*t),this._onChangeCallback(),this}multiply(t){return this.multiplyQuaternions(this,t)}premultiply(t){return this.multiplyQuaternions(t,this)}multiplyQuaternions(t,e){let n=t._x,s=t._y,r=t._z,o=t._w,a=e._x,l=e._y,c=e._z,h=e._w;return this._x=n*h+o*a+s*c-r*l,this._y=s*h+o*l+r*a-n*c,this._z=r*h+o*c+n*l-s*a,this._w=o*h-n*a-s*l-r*c,this._onChangeCallback(),this}slerp(t,e){let n=t._x,s=t._y,r=t._z,o=t._w,a=this.dot(t);a<0&&(n=-n,s=-s,r=-r,o=-o,a=-a);let l=1-e;if(a<.9995){let c=Math.acos(a),h=Math.sin(c);l=Math.sin(l*c)/h,e=Math.sin(e*c)/h,this._x=this._x*l+n*e,this._y=this._y*l+s*e,this._z=this._z*l+r*e,this._w=this._w*l+o*e,this._onChangeCallback()}else this._x=this._x*l+n*e,this._y=this._y*l+s*e,this._z=this._z*l+r*e,this._w=this._w*l+o*e,this.normalize();return this}slerpQuaternions(t,e,n){return this.copy(t).slerp(e,n)}random(){let t=2*Math.PI*Math.random(),e=2*Math.PI*Math.random(),n=Math.random(),s=Math.sqrt(1-n),r=Math.sqrt(n);return this.set(s*Math.sin(t),s*Math.cos(t),r*Math.sin(e),r*Math.cos(e))}equals(t){return t._x===this._x&&t._y===this._y&&t._z===this._z&&t._w===this._w}fromArray(t,e=0){return this._x=t[e],this._y=t[e+1],this._z=t[e+2],this._w=t[e+3],this._onChangeCallback(),this}toArray(t=[],e=0){return t[e]=this._x,t[e+1]=this._y,t[e+2]=this._z,t[e+3]=this._w,t}fromBufferAttribute(t,e){return this._x=t.getX(e),this._y=t.getY(e),this._z=t.getZ(e),this._w=t.getW(e),this._onChangeCallback(),this}toJSON(){return this.toArray()}_onChange(t){return this._onChangeCallback=t,this}_onChangeCallback(){}*[Symbol.iterator](){yield this._x,yield this._y,yield this._z,yield this._w}},O=class i{static{i.prototype.isVector3=!0}constructor(t=0,e=0,n=0){this.x=t,this.y=e,this.z=n}set(t,e,n){return n===void 0&&(n=this.z),this.x=t,this.y=e,this.z=n,this}setScalar(t){return this.x=t,this.y=t,this.z=t,this}setX(t){return this.x=t,this}setY(t){return this.y=t,this}setZ(t){return this.z=t,this}setComponent(t,e){switch(t){case 0:this.x=e;break;case 1:this.y=e;break;case 2:this.z=e;break;default:throw new Error("THREE.Vector3: index is out of range: "+t)}return this}getComponent(t){switch(t){case 0:return this.x;case 1:return this.y;case 2:return this.z;default:throw new Error("THREE.Vector3: index is out of range: "+t)}}clone(){return new this.constructor(this.x,this.y,this.z)}copy(t){return this.x=t.x,this.y=t.y,this.z=t.z,this}add(t){return this.x+=t.x,this.y+=t.y,this.z+=t.z,this}addScalar(t){return this.x+=t,this.y+=t,this.z+=t,this}addVectors(t,e){return this.x=t.x+e.x,this.y=t.y+e.y,this.z=t.z+e.z,this}addScaledVector(t,e){return this.x+=t.x*e,this.y+=t.y*e,this.z+=t.z*e,this}sub(t){return this.x-=t.x,this.y-=t.y,this.z-=t.z,this}subScalar(t){return this.x-=t,this.y-=t,this.z-=t,this}subVectors(t,e){return this.x=t.x-e.x,this.y=t.y-e.y,this.z=t.z-e.z,this}multiply(t){return this.x*=t.x,this.y*=t.y,this.z*=t.z,this}multiplyScalar(t){return this.x*=t,this.y*=t,this.z*=t,this}multiplyVectors(t,e){return this.x=t.x*e.x,this.y=t.y*e.y,this.z=t.z*e.z,this}applyEuler(t){return this.applyQuaternion(ph.setFromEuler(t))}applyAxisAngle(t,e){return this.applyQuaternion(ph.setFromAxisAngle(t,e))}applyMatrix3(t){let e=this.x,n=this.y,s=this.z,r=t.elements;return this.x=r[0]*e+r[3]*n+r[6]*s,this.y=r[1]*e+r[4]*n+r[7]*s,this.z=r[2]*e+r[5]*n+r[8]*s,this}applyNormalMatrix(t){return this.applyMatrix3(t).normalize()}applyMatrix4(t){let e=this.x,n=this.y,s=this.z,r=t.elements,o=1/(r[3]*e+r[7]*n+r[11]*s+r[15]);return this.x=(r[0]*e+r[4]*n+r[8]*s+r[12])*o,this.y=(r[1]*e+r[5]*n+r[9]*s+r[13])*o,this.z=(r[2]*e+r[6]*n+r[10]*s+r[14])*o,this}applyQuaternion(t){let e=this.x,n=this.y,s=this.z,r=t.x,o=t.y,a=t.z,l=t.w,c=2*(o*s-a*n),h=2*(a*e-r*s),f=2*(r*n-o*e);return this.x=e+l*c+o*f-a*h,this.y=n+l*h+a*c-r*f,this.z=s+l*f+r*h-o*c,this}project(t){return this.applyMatrix4(t.matrixWorldInverse).applyMatrix4(t.projectionMatrix)}unproject(t){return this.applyMatrix4(t.projectionMatrixInverse).applyMatrix4(t.matrixWorld)}transformDirection(t){let e=this.x,n=this.y,s=this.z,r=t.elements;return this.x=r[0]*e+r[4]*n+r[8]*s,this.y=r[1]*e+r[5]*n+r[9]*s,this.z=r[2]*e+r[6]*n+r[10]*s,this.normalize()}divide(t){return this.x/=t.x,this.y/=t.y,this.z/=t.z,this}divideScalar(t){return this.multiplyScalar(1/t)}min(t){return this.x=Math.min(this.x,t.x),this.y=Math.min(this.y,t.y),this.z=Math.min(this.z,t.z),this}max(t){return this.x=Math.max(this.x,t.x),this.y=Math.max(this.y,t.y),this.z=Math.max(this.z,t.z),this}clamp(t,e){return this.x=ce(this.x,t.x,e.x),this.y=ce(this.y,t.y,e.y),this.z=ce(this.z,t.z,e.z),this}clampScalar(t,e){return this.x=ce(this.x,t,e),this.y=ce(this.y,t,e),this.z=ce(this.z,t,e),this}clampLength(t,e){let n=this.length();return this.divideScalar(n||1).multiplyScalar(ce(n,t,e))}floor(){return this.x=Math.floor(this.x),this.y=Math.floor(this.y),this.z=Math.floor(this.z),this}ceil(){return this.x=Math.ceil(this.x),this.y=Math.ceil(this.y),this.z=Math.ceil(this.z),this}round(){return this.x=Math.round(this.x),this.y=Math.round(this.y),this.z=Math.round(this.z),this}roundToZero(){return this.x=Math.trunc(this.x),this.y=Math.trunc(this.y),this.z=Math.trunc(this.z),this}negate(){return this.x=-this.x,this.y=-this.y,this.z=-this.z,this}dot(t){return this.x*t.x+this.y*t.y+this.z*t.z}lengthSq(){return this.x*this.x+this.y*this.y+this.z*this.z}length(){return Math.sqrt(this.x*this.x+this.y*this.y+this.z*this.z)}manhattanLength(){return Math.abs(this.x)+Math.abs(this.y)+Math.abs(this.z)}normalize(){return this.divideScalar(this.length()||1)}setLength(t){return this.normalize().multiplyScalar(t)}lerp(t,e){return this.x+=(t.x-this.x)*e,this.y+=(t.y-this.y)*e,this.z+=(t.z-this.z)*e,this}lerpVectors(t,e,n){return this.x=t.x+(e.x-t.x)*n,this.y=t.y+(e.y-t.y)*n,this.z=t.z+(e.z-t.z)*n,this}cross(t){return this.crossVectors(this,t)}crossVectors(t,e){let n=t.x,s=t.y,r=t.z,o=e.x,a=e.y,l=e.z;return this.x=s*l-r*a,this.y=r*o-n*l,this.z=n*a-s*o,this}projectOnVector(t){let e=t.lengthSq();if(e===0)return this.set(0,0,0);let n=t.dot(this)/e;return this.copy(t).multiplyScalar(n)}projectOnPlane(t){return Al.copy(this).projectOnVector(t),this.sub(Al)}reflect(t){return this.sub(Al.copy(t).multiplyScalar(2*this.dot(t)))}angleTo(t){let e=Math.sqrt(this.lengthSq()*t.lengthSq());if(e===0)return Math.PI/2;let n=this.dot(t)/e;return Math.acos(ce(n,-1,1))}distanceTo(t){return Math.sqrt(this.distanceToSquared(t))}distanceToSquared(t){let e=this.x-t.x,n=this.y-t.y,s=this.z-t.z;return e*e+n*n+s*s}manhattanDistanceTo(t){return Math.abs(this.x-t.x)+Math.abs(this.y-t.y)+Math.abs(this.z-t.z)}setFromSpherical(t){return this.setFromSphericalCoords(t.radius,t.phi,t.theta)}setFromSphericalCoords(t,e,n){let s=Math.sin(e)*t;return this.x=s*Math.sin(n),this.y=Math.cos(e)*t,this.z=s*Math.cos(n),this}setFromCylindrical(t){return this.setFromCylindricalCoords(t.radius,t.theta,t.y)}setFromCylindricalCoords(t,e,n){return this.x=t*Math.sin(e),this.y=n,this.z=t*Math.cos(e),this}setFromMatrixPosition(t){let e=t.elements;return this.x=e[12],this.y=e[13],this.z=e[14],this}setFromMatrixScale(t){let e=this.setFromMatrixColumn(t,0).length(),n=this.setFromMatrixColumn(t,1).length(),s=this.setFromMatrixColumn(t,2).length();return this.x=e,this.y=n,this.z=s,this}setFromMatrixColumn(t,e){return this.fromArray(t.elements,e*4)}setFromMatrix3Column(t,e){return this.fromArray(t.elements,e*3)}setFromEuler(t){return this.x=t._x,this.y=t._y,this.z=t._z,this}setFromColor(t){return this.x=t.r,this.y=t.g,this.z=t.b,this}equals(t){return t.x===this.x&&t.y===this.y&&t.z===this.z}fromArray(t,e=0){return this.x=t[e],this.y=t[e+1],this.z=t[e+2],this}toArray(t=[],e=0){return t[e]=this.x,t[e+1]=this.y,t[e+2]=this.z,t}fromBufferAttribute(t,e){return this.x=t.getX(e),this.y=t.getY(e),this.z=t.getZ(e),this}random(){return this.x=Math.random(),this.y=Math.random(),this.z=Math.random(),this}randomDirection(){let t=Math.random()*Math.PI*2,e=Math.random()*2-1,n=Math.sqrt(1-e*e);return this.x=n*Math.cos(t),this.y=e,this.z=n*Math.sin(t),this}*[Symbol.iterator](){yield this.x,yield this.y,yield this.z}},Al=new O,ph=new Jn,ie=class i{static{i.prototype.isMatrix3=!0}constructor(t,e,n,s,r,o,a,l,c){this.elements=[1,0,0,0,1,0,0,0,1],t!==void 0&&this.set(t,e,n,s,r,o,a,l,c)}set(t,e,n,s,r,o,a,l,c){let h=this.elements;return h[0]=t,h[1]=s,h[2]=a,h[3]=e,h[4]=r,h[5]=l,h[6]=n,h[7]=o,h[8]=c,this}identity(){return this.set(1,0,0,0,1,0,0,0,1),this}copy(t){let e=this.elements,n=t.elements;return e[0]=n[0],e[1]=n[1],e[2]=n[2],e[3]=n[3],e[4]=n[4],e[5]=n[5],e[6]=n[6],e[7]=n[7],e[8]=n[8],this}extractBasis(t,e,n){return t.setFromMatrix3Column(this,0),e.setFromMatrix3Column(this,1),n.setFromMatrix3Column(this,2),this}setFromMatrix4(t){let e=t.elements;return this.set(e[0],e[4],e[8],e[1],e[5],e[9],e[2],e[6],e[10]),this}multiply(t){return this.multiplyMatrices(this,t)}premultiply(t){return this.multiplyMatrices(t,this)}multiplyMatrices(t,e){let n=t.elements,s=e.elements,r=this.elements,o=n[0],a=n[3],l=n[6],c=n[1],h=n[4],f=n[7],u=n[2],d=n[5],g=n[8],M=s[0],m=s[3],p=s[6],T=s[1],P=s[4],S=s[7],A=s[2],b=s[5],R=s[8];return r[0]=o*M+a*T+l*A,r[3]=o*m+a*P+l*b,r[6]=o*p+a*S+l*R,r[1]=c*M+h*T+f*A,r[4]=c*m+h*P+f*b,r[7]=c*p+h*S+f*R,r[2]=u*M+d*T+g*A,r[5]=u*m+d*P+g*b,r[8]=u*p+d*S+g*R,this}multiplyScalar(t){let e=this.elements;return e[0]*=t,e[3]*=t,e[6]*=t,e[1]*=t,e[4]*=t,e[7]*=t,e[2]*=t,e[5]*=t,e[8]*=t,this}determinant(){let t=this.elements,e=t[0],n=t[1],s=t[2],r=t[3],o=t[4],a=t[5],l=t[6],c=t[7],h=t[8];return e*o*h-e*a*c-n*r*h+n*a*l+s*r*c-s*o*l}invert(){let t=this.elements,e=t[0],n=t[1],s=t[2],r=t[3],o=t[4],a=t[5],l=t[6],c=t[7],h=t[8],f=h*o-a*c,u=a*l-h*r,d=c*r-o*l,g=e*f+n*u+s*d;if(g===0)return this.set(0,0,0,0,0,0,0,0,0);let M=1/g;return t[0]=f*M,t[1]=(s*c-h*n)*M,t[2]=(a*n-s*o)*M,t[3]=u*M,t[4]=(h*e-s*l)*M,t[5]=(s*r-a*e)*M,t[6]=d*M,t[7]=(n*l-c*e)*M,t[8]=(o*e-n*r)*M,this}transpose(){let t,e=this.elements;return t=e[1],e[1]=e[3],e[3]=t,t=e[2],e[2]=e[6],e[6]=t,t=e[5],e[5]=e[7],e[7]=t,this}getNormalMatrix(t){return this.setFromMatrix4(t).invert().transpose()}transposeIntoArray(t){let e=this.elements;return t[0]=e[0],t[1]=e[3],t[2]=e[6],t[3]=e[1],t[4]=e[4],t[5]=e[7],t[6]=e[2],t[7]=e[5],t[8]=e[8],this}setUvTransform(t,e,n,s,r,o,a){let l=Math.cos(r),c=Math.sin(r);return this.set(n*l,n*c,-n*(l*o+c*a)+o+t,-s*c,s*l,-s*(-c*o+l*a)+a+e,0,0,1),this}scale(t,e){return es("Matrix3: .scale() is deprecated. Use .makeScale() instead."),this.premultiply(Cl.makeScale(t,e)),this}rotate(t){return es("Matrix3: .rotate() is deprecated. Use .makeRotation() instead."),this.premultiply(Cl.makeRotation(-t)),this}translate(t,e){return es("Matrix3: .translate() is deprecated. Use .makeTranslation() instead."),this.premultiply(Cl.makeTranslation(t,e)),this}makeTranslation(t,e){return t.isVector2?this.set(1,0,t.x,0,1,t.y,0,0,1):this.set(1,0,t,0,1,e,0,0,1),this}makeRotation(t){let e=Math.cos(t),n=Math.sin(t);return this.set(e,-n,0,n,e,0,0,0,1),this}makeScale(t,e){return this.set(t,0,0,0,e,0,0,0,1),this}equals(t){let e=this.elements,n=t.elements;for(let s=0;s<9;s++)if(e[s]!==n[s])return!1;return!0}fromArray(t,e=0){for(let n=0;n<9;n++)this.elements[n]=t[n+e];return this}toArray(t=[],e=0){let n=this.elements;return t[e]=n[0],t[e+1]=n[1],t[e+2]=n[2],t[e+3]=n[3],t[e+4]=n[4],t[e+5]=n[5],t[e+6]=n[6],t[e+7]=n[7],t[e+8]=n[8],t}clone(){return new this.constructor().fromArray(this.elements)}},Cl=new ie,mh=new ie().set(.4123908,.3575843,.1804808,.212639,.7151687,.0721923,.0193308,.1191948,.9505322),gh=new ie().set(3.2409699,-1.5373832,-.4986108,-.9692436,1.8759675,.0415551,.0556301,-.203977,1.0569715);function Fd(){let i={enabled:!0,workingColorSpace:dr,spaces:{},convert:function(s,r,o){return this.enabled===!1||r===o||!r||!o||(this.spaces[r].transfer===Me&&(s.r=fi(s.r),s.g=fi(s.g),s.b=fi(s.b)),this.spaces[r].primaries!==this.spaces[o].primaries&&(s.applyMatrix3(this.spaces[r].toXYZ),s.applyMatrix3(this.spaces[o].fromXYZ)),this.spaces[o].transfer===Me&&(s.r=As(s.r),s.g=As(s.g),s.b=As(s.b))),s},workingToColorSpace:function(s,r){return this.convert(s,this.workingColorSpace,r)},colorSpaceToWorking:function(s,r){return this.convert(s,r,this.workingColorSpace)},getPrimaries:function(s){return this.spaces[s].primaries},getTransfer:function(s){return s===gi?fr:this.spaces[s].transfer},getToneMappingMode:function(s){return this.spaces[s].outputColorSpaceConfig.toneMappingMode||"standard"},getLuminanceCoefficients:function(s,r=this.workingColorSpace){return s.fromArray(this.spaces[r].luminanceCoefficients)},define:function(s){Object.assign(this.spaces,s)},_getMatrix:function(s,r,o){return s.copy(this.spaces[r].toXYZ).multiply(this.spaces[o].fromXYZ)},_getDrawingBufferColorSpace:function(s){return this.spaces[s].outputColorSpaceConfig.drawingBufferColorSpace},_getUnpackColorSpace:function(s=this.workingColorSpace){return this.spaces[s].workingColorSpaceConfig.unpackColorSpace},fromWorkingColorSpace:function(s,r){return es("ColorManagement: .fromWorkingColorSpace() has been renamed to .workingToColorSpace()."),i.workingToColorSpace(s,r)},toWorkingColorSpace:function(s,r){return es("ColorManagement: .toWorkingColorSpace() has been renamed to .colorSpaceToWorking()."),i.colorSpaceToWorking(s,r)}},t=[.64,.33,.3,.6,.15,.06],e=[.2126,.7152,.0722],n=[.3127,.329];return i.define({[dr]:{primaries:t,whitePoint:n,transfer:fr,toXYZ:mh,fromXYZ:gh,luminanceCoefficients:e,workingColorSpaceConfig:{unpackColorSpace:ln},outputColorSpaceConfig:{drawingBufferColorSpace:ln}},[ln]:{primaries:t,whitePoint:n,transfer:Me,toXYZ:mh,fromXYZ:gh,luminanceCoefficients:e,outputColorSpaceConfig:{drawingBufferColorSpace:ln}}}),i}var pe=Fd();function fi(i){return i<.04045?i*.0773993808:Math.pow(i*.9478672986+.0521327014,2.4)}function As(i){return i<.0031308?i*12.92:1.055*Math.pow(i,.41666)-.055}var ps,Vo=class{static getDataURL(t,e="image/png"){if(/^data:/i.test(t.src)||typeof HTMLCanvasElement>"u")return t.src;let n;if(t instanceof HTMLCanvasElement)n=t;else{ps===void 0&&(ps=pr("canvas")),ps.width=t.width,ps.height=t.height;let s=ps.getContext("2d");t instanceof ImageData?s.putImageData(t,0,0):s.drawImage(t,0,0,t.width,t.height),n=ps}return n.toDataURL(e)}static sRGBToLinear(t){if(typeof HTMLImageElement<"u"&&t instanceof HTMLImageElement||typeof HTMLCanvasElement<"u"&&t instanceof HTMLCanvasElement||typeof ImageBitmap<"u"&&t instanceof ImageBitmap){let e=pr("canvas");e.width=t.width,e.height=t.height;let n=e.getContext("2d");n.drawImage(t,0,0,t.width,t.height);let s=n.getImageData(0,0,t.width,t.height),r=s.data;for(let o=0;o<r.length;o++)r[o]=fi(r[o]/255)*255;return n.putImageData(s,0,0),e}else if(t.data){let e=t.data.slice(0);for(let n=0;n<e.length;n++)e instanceof Uint8Array||e instanceof Uint8ClampedArray?e[n]=Math.floor(fi(e[n]/255)*255):e[n]=fi(e[n]);return{data:e,width:t.width,height:t.height}}else return Jt("ImageUtils.sRGBToLinear(): Unsupported image type. No color space conversion applied."),t}},Od=0,Ps=class{constructor(t=null){this.isTextureSource=!0,Object.defineProperty(this,"id",{value:Od++}),this.uuid=qs(),this.data=t,this.dataReady=!0,this.version=0}getSize(t){let e=this.data;return typeof HTMLVideoElement<"u"&&e instanceof HTMLVideoElement?t.set(e.videoWidth,e.videoHeight,0):typeof VideoFrame<"u"&&e instanceof VideoFrame?t.set(e.displayWidth,e.displayHeight,0):e!==null?t.set(e.width,e.height,e.depth||0):t.set(0,0,0),t}set needsUpdate(t){t===!0&&this.version++}toJSON(t){let e=t===void 0||typeof t=="string";if(!e&&t.images[this.uuid]!==void 0)return t.images[this.uuid];let n={uuid:this.uuid,url:""},s=this.data;if(s!==null){let r;if(Array.isArray(s)){r=[];for(let o=0,a=s.length;o<a;o++)s[o].isDataTexture?r.push(Rl(s[o].image)):r.push(Rl(s[o]))}else r=Rl(s);n.url=r}return e||(t.images[this.uuid]=n),n}};function Rl(i){return typeof HTMLImageElement<"u"&&i instanceof HTMLImageElement||typeof HTMLCanvasElement<"u"&&i instanceof HTMLCanvasElement||typeof ImageBitmap<"u"&&i instanceof ImageBitmap?Vo.getDataURL(i):i.data?{data:Array.from(i.data),width:i.width,height:i.height,type:i.data.constructor.name}:(Jt("Texture: Unable to serialize Texture."),{})}var Bd=0,Il=new O,mn=class i extends $n{constructor(t=i.DEFAULT_IMAGE,e=i.DEFAULT_MAPPING,n=Yn,s=Yn,r=Je,o=ki,a=In,l=xn,c=i.DEFAULT_ANISOTROPY,h=gi){super(),this.isTexture=!0,Object.defineProperty(this,"id",{value:Bd++}),this.uuid=qs(),this.name="",this.source=new Ps(t),this.mipmaps=[],this.mapping=e,this.channel=0,this.wrapS=n,this.wrapT=s,this.magFilter=r,this.minFilter=o,this.anisotropy=c,this.format=a,this.internalFormat=null,this.type=l,this.offset=new xt(0,0),this.repeat=new xt(1,1),this.center=new xt(0,0),this.rotation=0,this.matrixAutoUpdate=!0,this.matrix=new ie,this.generateMipmaps=!0,this.premultiplyAlpha=!1,this.flipY=!0,this.unpackAlignment=4,this.colorSpace=h,this.userData={},this.updateRanges=[],this.version=0,this.onUpdate=null,this.renderTarget=null,this.isRenderTargetTexture=!1,this.isArrayTexture=!!(t&&t.depth&&t.depth>1),this.pmremVersion=0,this.normalized=!1}get width(){return this.source.getSize(Il).x}get height(){return this.source.getSize(Il).y}get depth(){return this.source.getSize(Il).z}get image(){return this.source.data}set image(t){this.source.data=t}updateMatrix(){this.matrix.setUvTransform(this.offset.x,this.offset.y,this.repeat.x,this.repeat.y,this.rotation,this.center.x,this.center.y)}addUpdateRange(t,e){this.updateRanges.push({start:t,count:e})}clearUpdateRanges(){this.updateRanges.length=0}clone(){return new this.constructor().copy(this)}copy(t){return this.name=t.name,this.source=t.source,this.mipmaps=t.mipmaps.slice(0),this.mapping=t.mapping,this.channel=t.channel,this.wrapS=t.wrapS,this.wrapT=t.wrapT,this.magFilter=t.magFilter,this.minFilter=t.minFilter,this.anisotropy=t.anisotropy,this.format=t.format,this.internalFormat=t.internalFormat,this.type=t.type,this.normalized=t.normalized,this.offset.copy(t.offset),this.repeat.copy(t.repeat),this.center.copy(t.center),this.rotation=t.rotation,this.matrixAutoUpdate=t.matrixAutoUpdate,this.matrix.copy(t.matrix),this.generateMipmaps=t.generateMipmaps,this.premultiplyAlpha=t.premultiplyAlpha,this.flipY=t.flipY,this.unpackAlignment=t.unpackAlignment,this.colorSpace=t.colorSpace,this.renderTarget=t.renderTarget,this.isRenderTargetTexture=t.isRenderTargetTexture,this.isArrayTexture=t.isArrayTexture,this.userData=JSON.parse(JSON.stringify(t.userData)),this.needsUpdate=!0,this}setValues(t){for(let e in t){let n=t[e];if(n===void 0){Jt(`Texture.setValues(): parameter '${e}' has value of undefined.`);continue}let s=this[e];if(s===void 0){Jt(`Texture.setValues(): property '${e}' does not exist.`);continue}s&&n&&s.isVector2&&n.isVector2||s&&n&&s.isVector3&&n.isVector3||s&&n&&s.isMatrix3&&n.isMatrix3?s.copy(n):this[e]=n}}toJSON(t){let e=t===void 0||typeof t=="string";if(!e&&t.textures[this.uuid]!==void 0)return t.textures[this.uuid];let n={metadata:{version:4.7,type:"Texture",generator:"Texture.toJSON"},uuid:this.uuid,name:this.name,image:this.source.toJSON(t).uuid,mapping:this.mapping,channel:this.channel,repeat:[this.repeat.x,this.repeat.y],offset:[this.offset.x,this.offset.y],center:[this.center.x,this.center.y],rotation:this.rotation,wrap:[this.wrapS,this.wrapT],format:this.format,internalFormat:this.internalFormat,type:this.type,normalized:this.normalized,colorSpace:this.colorSpace,minFilter:this.minFilter,magFilter:this.magFilter,anisotropy:this.anisotropy,flipY:this.flipY,generateMipmaps:this.generateMipmaps,premultiplyAlpha:this.premultiplyAlpha,unpackAlignment:this.unpackAlignment};return Object.keys(this.userData).length>0&&(n.userData=this.userData),e||(t.textures[this.uuid]=n),n}dispose(){this.dispatchEvent({type:"dispose"})}transformUv(t){if(this.mapping!==wc)return t;if(t.applyMatrix3(this.matrix),t.x<0||t.x>1)switch(this.wrapS){case Oo:t.x=t.x-Math.floor(t.x);break;case Yn:t.x=t.x<0?0:1;break;case Bo:Math.abs(Math.floor(t.x)%2)===1?t.x=Math.ceil(t.x)-t.x:t.x=t.x-Math.floor(t.x);break}if(t.y<0||t.y>1)switch(this.wrapT){case Oo:t.y=t.y-Math.floor(t.y);break;case Yn:t.y=t.y<0?0:1;break;case Bo:Math.abs(Math.floor(t.y)%2)===1?t.y=Math.ceil(t.y)-t.y:t.y=t.y-Math.floor(t.y);break}return this.flipY&&(t.y=1-t.y),t}set needsUpdate(t){t===!0&&(this.version++,this.source.needsUpdate=!0)}set needsPMREMUpdate(t){t===!0&&this.pmremVersion++}};mn.DEFAULT_IMAGE=null;mn.DEFAULT_MAPPING=wc;mn.DEFAULT_ANISOTROPY=1;var Le=class i{static{i.prototype.isVector4=!0}constructor(t=0,e=0,n=0,s=1){this.x=t,this.y=e,this.z=n,this.w=s}get width(){return this.z}set width(t){this.z=t}get height(){return this.w}set height(t){this.w=t}set(t,e,n,s){return this.x=t,this.y=e,this.z=n,this.w=s,this}setScalar(t){return this.x=t,this.y=t,this.z=t,this.w=t,this}setX(t){return this.x=t,this}setY(t){return this.y=t,this}setZ(t){return this.z=t,this}setW(t){return this.w=t,this}setComponent(t,e){switch(t){case 0:this.x=e;break;case 1:this.y=e;break;case 2:this.z=e;break;case 3:this.w=e;break;default:throw new Error("THREE.Vector4: index is out of range: "+t)}return this}getComponent(t){switch(t){case 0:return this.x;case 1:return this.y;case 2:return this.z;case 3:return this.w;default:throw new Error("THREE.Vector4: index is out of range: "+t)}}clone(){return new this.constructor(this.x,this.y,this.z,this.w)}copy(t){return this.x=t.x,this.y=t.y,this.z=t.z,this.w=t.w!==void 0?t.w:1,this}add(t){return this.x+=t.x,this.y+=t.y,this.z+=t.z,this.w+=t.w,this}addScalar(t){return this.x+=t,this.y+=t,this.z+=t,this.w+=t,this}addVectors(t,e){return this.x=t.x+e.x,this.y=t.y+e.y,this.z=t.z+e.z,this.w=t.w+e.w,this}addScaledVector(t,e){return this.x+=t.x*e,this.y+=t.y*e,this.z+=t.z*e,this.w+=t.w*e,this}sub(t){return this.x-=t.x,this.y-=t.y,this.z-=t.z,this.w-=t.w,this}subScalar(t){return this.x-=t,this.y-=t,this.z-=t,this.w-=t,this}subVectors(t,e){return this.x=t.x-e.x,this.y=t.y-e.y,this.z=t.z-e.z,this.w=t.w-e.w,this}multiply(t){return this.x*=t.x,this.y*=t.y,this.z*=t.z,this.w*=t.w,this}multiplyScalar(t){return this.x*=t,this.y*=t,this.z*=t,this.w*=t,this}applyMatrix4(t){let e=this.x,n=this.y,s=this.z,r=this.w,o=t.elements;return this.x=o[0]*e+o[4]*n+o[8]*s+o[12]*r,this.y=o[1]*e+o[5]*n+o[9]*s+o[13]*r,this.z=o[2]*e+o[6]*n+o[10]*s+o[14]*r,this.w=o[3]*e+o[7]*n+o[11]*s+o[15]*r,this}divide(t){return this.x/=t.x,this.y/=t.y,this.z/=t.z,this.w/=t.w,this}divideScalar(t){return this.multiplyScalar(1/t)}setAxisAngleFromQuaternion(t){this.w=2*Math.acos(t.w);let e=Math.sqrt(1-t.w*t.w);return e<1e-4?(this.x=1,this.y=0,this.z=0):(this.x=t.x/e,this.y=t.y/e,this.z=t.z/e),this}setAxisAngleFromRotationMatrix(t){let e,n,s,r,l=t.elements,c=l[0],h=l[4],f=l[8],u=l[1],d=l[5],g=l[9],M=l[2],m=l[6],p=l[10];if(Math.abs(h-u)<.01&&Math.abs(f-M)<.01&&Math.abs(g-m)<.01){if(Math.abs(h+u)<.1&&Math.abs(f+M)<.1&&Math.abs(g+m)<.1&&Math.abs(c+d+p-3)<.1)return this.set(1,0,0,0),this;e=Math.PI;let P=(c+1)/2,S=(d+1)/2,A=(p+1)/2,b=(h+u)/4,R=(f+M)/4,_=(g+m)/4;return P>S&&P>A?P<.01?(n=0,s=.707106781,r=.707106781):(n=Math.sqrt(P),s=b/n,r=R/n):S>A?S<.01?(n=.707106781,s=0,r=.707106781):(s=Math.sqrt(S),n=b/s,r=_/s):A<.01?(n=.707106781,s=.707106781,r=0):(r=Math.sqrt(A),n=R/r,s=_/r),this.set(n,s,r,e),this}let T=Math.sqrt((m-g)*(m-g)+(f-M)*(f-M)+(u-h)*(u-h));return Math.abs(T)<.001&&(T=1),this.x=(m-g)/T,this.y=(f-M)/T,this.z=(u-h)/T,this.w=Math.acos((c+d+p-1)/2),this}setFromMatrixPosition(t){let e=t.elements;return this.x=e[12],this.y=e[13],this.z=e[14],this.w=e[15],this}min(t){return this.x=Math.min(this.x,t.x),this.y=Math.min(this.y,t.y),this.z=Math.min(this.z,t.z),this.w=Math.min(this.w,t.w),this}max(t){return this.x=Math.max(this.x,t.x),this.y=Math.max(this.y,t.y),this.z=Math.max(this.z,t.z),this.w=Math.max(this.w,t.w),this}clamp(t,e){return this.x=ce(this.x,t.x,e.x),this.y=ce(this.y,t.y,e.y),this.z=ce(this.z,t.z,e.z),this.w=ce(this.w,t.w,e.w),this}clampScalar(t,e){return this.x=ce(this.x,t,e),this.y=ce(this.y,t,e),this.z=ce(this.z,t,e),this.w=ce(this.w,t,e),this}clampLength(t,e){let n=this.length();return this.divideScalar(n||1).multiplyScalar(ce(n,t,e))}floor(){return this.x=Math.floor(this.x),this.y=Math.floor(this.y),this.z=Math.floor(this.z),this.w=Math.floor(this.w),this}ceil(){return this.x=Math.ceil(this.x),this.y=Math.ceil(this.y),this.z=Math.ceil(this.z),this.w=Math.ceil(this.w),this}round(){return this.x=Math.round(this.x),this.y=Math.round(this.y),this.z=Math.round(this.z),this.w=Math.round(this.w),this}roundToZero(){return this.x=Math.trunc(this.x),this.y=Math.trunc(this.y),this.z=Math.trunc(this.z),this.w=Math.trunc(this.w),this}negate(){return this.x=-this.x,this.y=-this.y,this.z=-this.z,this.w=-this.w,this}dot(t){return this.x*t.x+this.y*t.y+this.z*t.z+this.w*t.w}lengthSq(){return this.x*this.x+this.y*this.y+this.z*this.z+this.w*this.w}length(){return Math.sqrt(this.x*this.x+this.y*this.y+this.z*this.z+this.w*this.w)}manhattanLength(){return Math.abs(this.x)+Math.abs(this.y)+Math.abs(this.z)+Math.abs(this.w)}normalize(){return this.divideScalar(this.length()||1)}setLength(t){return this.normalize().multiplyScalar(t)}lerp(t,e){return this.x+=(t.x-this.x)*e,this.y+=(t.y-this.y)*e,this.z+=(t.z-this.z)*e,this.w+=(t.w-this.w)*e,this}lerpVectors(t,e,n){return this.x=t.x+(e.x-t.x)*n,this.y=t.y+(e.y-t.y)*n,this.z=t.z+(e.z-t.z)*n,this.w=t.w+(e.w-t.w)*n,this}equals(t){return t.x===this.x&&t.y===this.y&&t.z===this.z&&t.w===this.w}fromArray(t,e=0){return this.x=t[e],this.y=t[e+1],this.z=t[e+2],this.w=t[e+3],this}toArray(t=[],e=0){return t[e]=this.x,t[e+1]=this.y,t[e+2]=this.z,t[e+3]=this.w,t}fromBufferAttribute(t,e){return this.x=t.getX(e),this.y=t.getY(e),this.z=t.getZ(e),this.w=t.getW(e),this}random(){return this.x=Math.random(),this.y=Math.random(),this.z=Math.random(),this.w=Math.random(),this}*[Symbol.iterator](){yield this.x,yield this.y,yield this.z,yield this.w}},Go=class extends $n{constructor(t=1,e=1,n={}){super(),n=Object.assign({generateMipmaps:!1,internalFormat:null,minFilter:Je,depthBuffer:!0,stencilBuffer:!1,resolveColorBuffer:!0,resolveDepthBuffer:!0,resolveStencilBuffer:!0,storeMultisampledColorBuffer:!0,storeMultisampledDepthBuffer:!0,storeMultisampledStencilBuffer:!0,depthTexture:null,samples:0,count:1,depth:1,multiview:!1,useArrayDepthTexture:!1},n),this.isRenderTarget=!0,this.width=t,this.height=e,this.depth=n.depth,this.scissor=new Le(0,0,t,e),this.scissorTest=!1,this.viewport=new Le(0,0,t,e),this.textures=[];let s={width:t,height:e,depth:n.depth},r=new mn(s),o=n.count;for(let a=0;a<o;a++)this.textures[a]=r.clone(),this.textures[a].isRenderTargetTexture=!0,this.textures[a].renderTarget=this;this._setTextureOptions(n),this.depthBuffer=n.depthBuffer,this.stencilBuffer=n.stencilBuffer,this.resolveColorBuffer=n.resolveColorBuffer,this.resolveDepthBuffer=n.resolveDepthBuffer,this.resolveStencilBuffer=n.resolveStencilBuffer,this.storeMultisampledColorBuffer=n.storeMultisampledColorBuffer,this.storeMultisampledDepthBuffer=n.storeMultisampledDepthBuffer,this.storeMultisampledStencilBuffer=n.storeMultisampledStencilBuffer,this._depthTexture=null,this.depthTexture=n.depthTexture,this.samples=n.samples,this.multiview=n.multiview,this.useArrayDepthTexture=n.useArrayDepthTexture}_setTextureOptions(t={}){let e={minFilter:Je,generateMipmaps:!1,flipY:!1,internalFormat:null};t.mapping!==void 0&&(e.mapping=t.mapping),t.wrapS!==void 0&&(e.wrapS=t.wrapS),t.wrapT!==void 0&&(e.wrapT=t.wrapT),t.wrapR!==void 0&&(e.wrapR=t.wrapR),t.magFilter!==void 0&&(e.magFilter=t.magFilter),t.minFilter!==void 0&&(e.minFilter=t.minFilter),t.format!==void 0&&(e.format=t.format),t.type!==void 0&&(e.type=t.type),t.anisotropy!==void 0&&(e.anisotropy=t.anisotropy),t.colorSpace!==void 0&&(e.colorSpace=t.colorSpace),t.flipY!==void 0&&(e.flipY=t.flipY),t.generateMipmaps!==void 0&&(e.generateMipmaps=t.generateMipmaps),t.internalFormat!==void 0&&(e.internalFormat=t.internalFormat);for(let n=0;n<this.textures.length;n++)this.textures[n].setValues(e)}get texture(){return this.textures[0]}set texture(t){this.textures[0]=t}set depthTexture(t){this._depthTexture!==null&&this._depthTexture.renderTarget===this&&(this._depthTexture.renderTarget=null),t!==null&&t.renderTarget===null&&(t.renderTarget=this),this._depthTexture=t}get depthTexture(){return this._depthTexture}setSize(t,e,n=1){if(this.width!==t||this.height!==e||this.depth!==n){this.width=t,this.height=e,this.depth=n;for(let s=0,r=this.textures.length;s<r;s++)this.textures[s].image.width=t,this.textures[s].image.height=e,this.textures[s].image.depth=n,this.textures[s].isData3DTexture!==!0&&(this.textures[s].isArrayTexture=this.textures[s].image.depth>1);this.dispose()}this.viewport.set(0,0,t,e),this.scissor.set(0,0,t,e)}clone(){return new this.constructor().copy(this)}copy(t){this.width=t.width,this.height=t.height,this.depth=t.depth,this.scissor.copy(t.scissor),this.scissorTest=t.scissorTest,this.viewport.copy(t.viewport),this.textures.length=0;for(let e=0,n=t.textures.length;e<n;e++){this.textures[e]=t.textures[e].clone(),this.textures[e].isRenderTargetTexture=!0,this.textures[e].renderTarget=this;let s=Object.assign({},t.textures[e].image);this.textures[e].source=new Ps(s)}if(this.depthBuffer=t.depthBuffer,this.stencilBuffer=t.stencilBuffer,this.resolveColorBuffer=t.resolveColorBuffer,this.resolveDepthBuffer=t.resolveDepthBuffer,this.resolveStencilBuffer=t.resolveStencilBuffer,this.storeMultisampledColorBuffer=t.storeMultisampledColorBuffer,this.storeMultisampledDepthBuffer=t.storeMultisampledDepthBuffer,this.storeMultisampledStencilBuffer=t.storeMultisampledStencilBuffer,t.depthTexture!==null)if(t.depthTexture.renderTarget===t){let e=t.depthTexture.clone();e.renderTarget=null,this.depthTexture=e}else this.depthTexture=t.depthTexture;return this.samples=t.samples,this.multiview=t.multiview,this.useArrayDepthTexture=t.useArrayDepthTexture,this}dispose(){this.dispatchEvent({type:"dispose"})}},gn=class extends Go{constructor(t=1,e=1,n={}){super(t,e,n),this.isWebGLRenderTarget=!0}},mr=class extends mn{constructor(t=null,e=1,n=1,s=1){super(null),this.isDataArrayTexture=!0,this.image={data:t,width:e,height:n,depth:s},this.magFilter=Ze,this.minFilter=Ze,this.wrapR=Yn,this.generateMipmaps=!1,this.flipY=!1,this.unpackAlignment=1,this.layerUpdates=new Set}copy(t){return super.copy(t),this.wrapR=t.wrapR,this}addLayerUpdate(t){this.layerUpdates.add(t)}clearLayerUpdates(){this.layerUpdates.clear()}};var Ho=class extends mn{constructor(t=null,e=1,n=1,s=1){super(null),this.isData3DTexture=!0,this.image={data:t,width:e,height:n,depth:s},this.magFilter=Ze,this.minFilter=Ze,this.wrapR=Yn,this.generateMipmaps=!1,this.flipY=!1,this.unpackAlignment=1}copy(t){return super.copy(t),this.wrapR=t.wrapR,this}};var Ee=class i{static{i.prototype.isMatrix4=!0}constructor(t,e,n,s,r,o,a,l,c,h,f,u,d,g,M,m){this.elements=[1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1],t!==void 0&&this.set(t,e,n,s,r,o,a,l,c,h,f,u,d,g,M,m)}set(t,e,n,s,r,o,a,l,c,h,f,u,d,g,M,m){let p=this.elements;return p[0]=t,p[4]=e,p[8]=n,p[12]=s,p[1]=r,p[5]=o,p[9]=a,p[13]=l,p[2]=c,p[6]=h,p[10]=f,p[14]=u,p[3]=d,p[7]=g,p[11]=M,p[15]=m,this}identity(){return this.set(1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1),this}clone(){return new i().fromArray(this.elements)}copy(t){let e=this.elements,n=t.elements;return e[0]=n[0],e[1]=n[1],e[2]=n[2],e[3]=n[3],e[4]=n[4],e[5]=n[5],e[6]=n[6],e[7]=n[7],e[8]=n[8],e[9]=n[9],e[10]=n[10],e[11]=n[11],e[12]=n[12],e[13]=n[13],e[14]=n[14],e[15]=n[15],this}copyPosition(t){let e=this.elements,n=t.elements;return e[12]=n[12],e[13]=n[13],e[14]=n[14],this}setFromMatrix3(t){let e=t.elements;return this.set(e[0],e[3],e[6],0,e[1],e[4],e[7],0,e[2],e[5],e[8],0,0,0,0,1),this}extractBasis(t,e,n){return this.determinantAffine()===0?(t.set(1,0,0),e.set(0,1,0),n.set(0,0,1),this):(t.setFromMatrixColumn(this,0),e.setFromMatrixColumn(this,1),n.setFromMatrixColumn(this,2),this)}makeBasis(t,e,n){return this.set(t.x,e.x,n.x,0,t.y,e.y,n.y,0,t.z,e.z,n.z,0,0,0,0,1),this}extractRotation(t){if(t.determinantAffine()===0)return this.identity();let e=this.elements,n=t.elements,s=1/ms.setFromMatrixColumn(t,0).length(),r=1/ms.setFromMatrixColumn(t,1).length(),o=1/ms.setFromMatrixColumn(t,2).length();return e[0]=n[0]*s,e[1]=n[1]*s,e[2]=n[2]*s,e[3]=0,e[4]=n[4]*r,e[5]=n[5]*r,e[6]=n[6]*r,e[7]=0,e[8]=n[8]*o,e[9]=n[9]*o,e[10]=n[10]*o,e[11]=0,e[12]=0,e[13]=0,e[14]=0,e[15]=1,this}makeRotationFromEuler(t){let e=this.elements,n=t.x,s=t.y,r=t.z,o=Math.cos(n),a=Math.sin(n),l=Math.cos(s),c=Math.sin(s),h=Math.cos(r),f=Math.sin(r);if(t.order==="XYZ"){let u=o*h,d=o*f,g=a*h,M=a*f;e[0]=l*h,e[4]=-l*f,e[8]=c,e[1]=d+g*c,e[5]=u-M*c,e[9]=-a*l,e[2]=M-u*c,e[6]=g+d*c,e[10]=o*l}else if(t.order==="YXZ"){let u=l*h,d=l*f,g=c*h,M=c*f;e[0]=u+M*a,e[4]=g*a-d,e[8]=o*c,e[1]=o*f,e[5]=o*h,e[9]=-a,e[2]=d*a-g,e[6]=M+u*a,e[10]=o*l}else if(t.order==="ZXY"){let u=l*h,d=l*f,g=c*h,M=c*f;e[0]=u-M*a,e[4]=-o*f,e[8]=g+d*a,e[1]=d+g*a,e[5]=o*h,e[9]=M-u*a,e[2]=-o*c,e[6]=a,e[10]=o*l}else if(t.order==="ZYX"){let u=o*h,d=o*f,g=a*h,M=a*f;e[0]=l*h,e[4]=g*c-d,e[8]=u*c+M,e[1]=l*f,e[5]=M*c+u,e[9]=d*c-g,e[2]=-c,e[6]=a*l,e[10]=o*l}else if(t.order==="YZX"){let u=o*l,d=o*c,g=a*l,M=a*c;e[0]=l*h,e[4]=M-u*f,e[8]=g*f+d,e[1]=f,e[5]=o*h,e[9]=-a*h,e[2]=-c*h,e[6]=d*f+g,e[10]=u-M*f}else if(t.order==="XZY"){let u=o*l,d=o*c,g=a*l,M=a*c;e[0]=l*h,e[4]=-f,e[8]=c*h,e[1]=u*f+M,e[5]=o*h,e[9]=d*f-g,e[2]=g*f-d,e[6]=a*h,e[10]=M*f+u}return e[3]=0,e[7]=0,e[11]=0,e[12]=0,e[13]=0,e[14]=0,e[15]=1,this}makeRotationFromQuaternion(t){return this.compose(zd,t,kd)}lookAt(t,e,n){let s=this.elements;return Sn.subVectors(t,e),Sn.lengthSq()===0&&(Sn.z=1),Sn.normalize(),Ei.crossVectors(n,Sn),Ei.lengthSq()===0&&(Math.abs(n.z)===1?Sn.x+=1e-4:Sn.z+=1e-4,Sn.normalize(),Ei.crossVectors(n,Sn)),Ei.normalize(),to.crossVectors(Sn,Ei),s[0]=Ei.x,s[4]=to.x,s[8]=Sn.x,s[1]=Ei.y,s[5]=to.y,s[9]=Sn.y,s[2]=Ei.z,s[6]=to.z,s[10]=Sn.z,this}multiply(t){return this.multiplyMatrices(this,t)}premultiply(t){return this.multiplyMatrices(t,this)}multiplyMatrices(t,e){let n=t.elements,s=e.elements,r=this.elements,o=n[0],a=n[4],l=n[8],c=n[12],h=n[1],f=n[5],u=n[9],d=n[13],g=n[2],M=n[6],m=n[10],p=n[14],T=n[3],P=n[7],S=n[11],A=n[15],b=s[0],R=s[4],_=s[8],w=s[12],L=s[1],D=s[5],B=s[9],G=s[13],N=s[2],C=s[6],k=s[10],V=s[14],j=s[3],W=s[7],J=s[11],et=s[15];return r[0]=o*b+a*L+l*N+c*j,r[4]=o*R+a*D+l*C+c*W,r[8]=o*_+a*B+l*k+c*J,r[12]=o*w+a*G+l*V+c*et,r[1]=h*b+f*L+u*N+d*j,r[5]=h*R+f*D+u*C+d*W,r[9]=h*_+f*B+u*k+d*J,r[13]=h*w+f*G+u*V+d*et,r[2]=g*b+M*L+m*N+p*j,r[6]=g*R+M*D+m*C+p*W,r[10]=g*_+M*B+m*k+p*J,r[14]=g*w+M*G+m*V+p*et,r[3]=T*b+P*L+S*N+A*j,r[7]=T*R+P*D+S*C+A*W,r[11]=T*_+P*B+S*k+A*J,r[15]=T*w+P*G+S*V+A*et,this}multiplyScalar(t){let e=this.elements;return e[0]*=t,e[4]*=t,e[8]*=t,e[12]*=t,e[1]*=t,e[5]*=t,e[9]*=t,e[13]*=t,e[2]*=t,e[6]*=t,e[10]*=t,e[14]*=t,e[3]*=t,e[7]*=t,e[11]*=t,e[15]*=t,this}determinant(){let t=this.elements,e=t[0],n=t[4],s=t[8],r=t[12],o=t[1],a=t[5],l=t[9],c=t[13],h=t[2],f=t[6],u=t[10],d=t[14],g=t[3],M=t[7],m=t[11],p=t[15],T=l*d-c*u,P=a*d-c*f,S=a*u-l*f,A=o*d-c*h,b=o*u-l*h,R=o*f-a*h;return e*(M*T-m*P+p*S)-n*(g*T-m*A+p*b)+s*(g*P-M*A+p*R)-r*(g*S-M*b+m*R)}determinantAffine(){let t=this.elements,e=t[0],n=t[4],s=t[8],r=t[1],o=t[5],a=t[9],l=t[2],c=t[6],h=t[10];return e*(o*h-a*c)-n*(r*h-a*l)+s*(r*c-o*l)}transpose(){let t=this.elements,e;return e=t[1],t[1]=t[4],t[4]=e,e=t[2],t[2]=t[8],t[8]=e,e=t[6],t[6]=t[9],t[9]=e,e=t[3],t[3]=t[12],t[12]=e,e=t[7],t[7]=t[13],t[13]=e,e=t[11],t[11]=t[14],t[14]=e,this}setPosition(t,e,n){let s=this.elements;return t.isVector3?(s[12]=t.x,s[13]=t.y,s[14]=t.z):(s[12]=t,s[13]=e,s[14]=n),this}invert(){let t=this.elements,e=t[0],n=t[1],s=t[2],r=t[3],o=t[4],a=t[5],l=t[6],c=t[7],h=t[8],f=t[9],u=t[10],d=t[11],g=t[12],M=t[13],m=t[14],p=t[15],T=e*a-n*o,P=e*l-s*o,S=e*c-r*o,A=n*l-s*a,b=n*c-r*a,R=s*c-r*l,_=h*M-f*g,w=h*m-u*g,L=h*p-d*g,D=f*m-u*M,B=f*p-d*M,G=u*p-d*m,N=T*G-P*B+S*D+A*L-b*w+R*_;if(N===0)return this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0);let C=1/N;return t[0]=(a*G-l*B+c*D)*C,t[1]=(s*B-n*G-r*D)*C,t[2]=(M*R-m*b+p*A)*C,t[3]=(u*b-f*R-d*A)*C,t[4]=(l*L-o*G-c*w)*C,t[5]=(e*G-s*L+r*w)*C,t[6]=(m*S-g*R-p*P)*C,t[7]=(h*R-u*S+d*P)*C,t[8]=(o*B-a*L+c*_)*C,t[9]=(n*L-e*B-r*_)*C,t[10]=(g*b-M*S+p*T)*C,t[11]=(f*S-h*b-d*T)*C,t[12]=(a*w-o*D-l*_)*C,t[13]=(e*D-n*w+s*_)*C,t[14]=(M*P-g*A-m*T)*C,t[15]=(h*A-f*P+u*T)*C,this}scale(t){let e=this.elements,n=t.x,s=t.y,r=t.z;return e[0]*=n,e[4]*=s,e[8]*=r,e[1]*=n,e[5]*=s,e[9]*=r,e[2]*=n,e[6]*=s,e[10]*=r,e[3]*=n,e[7]*=s,e[11]*=r,this}getMaxScaleOnAxis(){let t=this.elements,e=t[0]*t[0]+t[1]*t[1]+t[2]*t[2],n=t[4]*t[4]+t[5]*t[5]+t[6]*t[6],s=t[8]*t[8]+t[9]*t[9]+t[10]*t[10];return Math.sqrt(Math.max(e,n,s))}makeTranslation(t,e,n){return t.isVector3?this.set(1,0,0,t.x,0,1,0,t.y,0,0,1,t.z,0,0,0,1):this.set(1,0,0,t,0,1,0,e,0,0,1,n,0,0,0,1),this}makeRotationX(t){let e=Math.cos(t),n=Math.sin(t);return this.set(1,0,0,0,0,e,-n,0,0,n,e,0,0,0,0,1),this}makeRotationY(t){let e=Math.cos(t),n=Math.sin(t);return this.set(e,0,n,0,0,1,0,0,-n,0,e,0,0,0,0,1),this}makeRotationZ(t){let e=Math.cos(t),n=Math.sin(t);return this.set(e,-n,0,0,n,e,0,0,0,0,1,0,0,0,0,1),this}makeRotationAxis(t,e){let n=Math.cos(e),s=Math.sin(e),r=1-n,o=t.x,a=t.y,l=t.z,c=r*o,h=r*a;return this.set(c*o+n,c*a-s*l,c*l+s*a,0,c*a+s*l,h*a+n,h*l-s*o,0,c*l-s*a,h*l+s*o,r*l*l+n,0,0,0,0,1),this}makeScale(t,e,n){return this.set(t,0,0,0,0,e,0,0,0,0,n,0,0,0,0,1),this}makeShear(t,e,n,s,r,o){return this.set(1,n,r,0,t,1,o,0,e,s,1,0,0,0,0,1),this}compose(t,e,n){let s=this.elements,r=e._x,o=e._y,a=e._z,l=e._w,c=r+r,h=o+o,f=a+a,u=r*c,d=r*h,g=r*f,M=o*h,m=o*f,p=a*f,T=l*c,P=l*h,S=l*f,A=n.x,b=n.y,R=n.z;return s[0]=(1-(M+p))*A,s[1]=(d+S)*A,s[2]=(g-P)*A,s[3]=0,s[4]=(d-S)*b,s[5]=(1-(u+p))*b,s[6]=(m+T)*b,s[7]=0,s[8]=(g+P)*R,s[9]=(m-T)*R,s[10]=(1-(u+M))*R,s[11]=0,s[12]=t.x,s[13]=t.y,s[14]=t.z,s[15]=1,this}decompose(t,e,n){let s=this.elements;t.x=s[12],t.y=s[13],t.z=s[14];let r=this.determinantAffine();if(r===0)return n.set(1,1,1),e.identity(),this;let o=ms.set(s[0],s[1],s[2]).length(),a=ms.set(s[4],s[5],s[6]).length(),l=ms.set(s[8],s[9],s[10]).length();r<0&&(o=-o),Un.copy(this);let c=1/o,h=1/a,f=1/l;return Un.elements[0]*=c,Un.elements[1]*=c,Un.elements[2]*=c,Un.elements[4]*=h,Un.elements[5]*=h,Un.elements[6]*=h,Un.elements[8]*=f,Un.elements[9]*=f,Un.elements[10]*=f,e.setFromRotationMatrix(Un),n.x=o,n.y=a,n.z=l,this}makePerspective(t,e,n,s,r,o,a=zn,l=!1){let c=this.elements,h=2*r/(e-t),f=2*r/(n-s),u=(e+t)/(e-t),d=(n+s)/(n-s),g,M;if(l)g=r/(o-r),M=o*r/(o-r);else if(a===zn)g=-(o+r)/(o-r),M=-2*o*r/(o-r);else if(a===Rs)g=-o/(o-r),M=-o*r/(o-r);else throw new Error("THREE.Matrix4.makePerspective(): Invalid coordinate system: "+a);return c[0]=h,c[4]=0,c[8]=u,c[12]=0,c[1]=0,c[5]=f,c[9]=d,c[13]=0,c[2]=0,c[6]=0,c[10]=g,c[14]=M,c[3]=0,c[7]=0,c[11]=-1,c[15]=0,this}makeOrthographic(t,e,n,s,r,o,a=zn,l=!1){let c=this.elements,h=2/(e-t),f=2/(n-s),u=-(e+t)/(e-t),d=-(n+s)/(n-s),g,M;if(l)g=1/(o-r),M=o/(o-r);else if(a===zn)g=-2/(o-r),M=-(o+r)/(o-r);else if(a===Rs)g=-1/(o-r),M=-r/(o-r);else throw new Error("THREE.Matrix4.makeOrthographic(): Invalid coordinate system: "+a);return c[0]=h,c[4]=0,c[8]=0,c[12]=u,c[1]=0,c[5]=f,c[9]=0,c[13]=d,c[2]=0,c[6]=0,c[10]=g,c[14]=M,c[3]=0,c[7]=0,c[11]=0,c[15]=1,this}equals(t){let e=this.elements,n=t.elements;for(let s=0;s<16;s++)if(e[s]!==n[s])return!1;return!0}fromArray(t,e=0){for(let n=0;n<16;n++)this.elements[n]=t[n+e];return this}toArray(t=[],e=0){let n=this.elements;return t[e]=n[0],t[e+1]=n[1],t[e+2]=n[2],t[e+3]=n[3],t[e+4]=n[4],t[e+5]=n[5],t[e+6]=n[6],t[e+7]=n[7],t[e+8]=n[8],t[e+9]=n[9],t[e+10]=n[10],t[e+11]=n[11],t[e+12]=n[12],t[e+13]=n[13],t[e+14]=n[14],t[e+15]=n[15],t}},ms=new O,Un=new Ee,zd=new O(0,0,0),kd=new O(1,1,1),Ei=new O,to=new O,Sn=new O,xh=new Ee,_h=new Jn,pi=class i{constructor(t=0,e=0,n=0,s=i.DEFAULT_ORDER){this.isEuler=!0,this._x=t,this._y=e,this._z=n,this._order=s}get x(){return this._x}set x(t){this._x=t,this._onChangeCallback()}get y(){return this._y}set y(t){this._y=t,this._onChangeCallback()}get z(){return this._z}set z(t){this._z=t,this._onChangeCallback()}get order(){return this._order}set order(t){this._order=t,this._onChangeCallback()}set(t,e,n,s=this._order){return this._x=t,this._y=e,this._z=n,this._order=s,this._onChangeCallback(),this}clone(){return new this.constructor(this._x,this._y,this._z,this._order)}copy(t){return this._x=t._x,this._y=t._y,this._z=t._z,this._order=t._order,this._onChangeCallback(),this}setFromRotationMatrix(t,e=this._order,n=!0){let s=t.elements,r=s[0],o=s[4],a=s[8],l=s[1],c=s[5],h=s[9],f=s[2],u=s[6],d=s[10];switch(e){case"XYZ":this._y=Math.asin(ce(a,-1,1)),Math.abs(a)<.9999999?(this._x=Math.atan2(-h,d),this._z=Math.atan2(-o,r)):(this._x=Math.atan2(u,c),this._z=0);break;case"YXZ":this._x=Math.asin(-ce(h,-1,1)),Math.abs(h)<.9999999?(this._y=Math.atan2(a,d),this._z=Math.atan2(l,c)):(this._y=Math.atan2(-f,r),this._z=0);break;case"ZXY":this._x=Math.asin(ce(u,-1,1)),Math.abs(u)<.9999999?(this._y=Math.atan2(-f,d),this._z=Math.atan2(-o,c)):(this._y=0,this._z=Math.atan2(l,r));break;case"ZYX":this._y=Math.asin(-ce(f,-1,1)),Math.abs(f)<.9999999?(this._x=Math.atan2(u,d),this._z=Math.atan2(l,r)):(this._x=0,this._z=Math.atan2(-o,c));break;case"YZX":this._z=Math.asin(ce(l,-1,1)),Math.abs(l)<.9999999?(this._x=Math.atan2(-h,c),this._y=Math.atan2(-f,r)):(this._x=0,this._y=Math.atan2(a,d));break;case"XZY":this._z=Math.asin(-ce(o,-1,1)),Math.abs(o)<.9999999?(this._x=Math.atan2(u,c),this._y=Math.atan2(a,r)):(this._x=Math.atan2(-h,d),this._y=0);break;default:Jt("Euler: .setFromRotationMatrix() encountered an unknown order: "+e)}return this._order=e,n===!0&&this._onChangeCallback(),this}setFromQuaternion(t,e,n){return xh.makeRotationFromQuaternion(t),this.setFromRotationMatrix(xh,e,n)}setFromVector3(t,e=this._order){return this.set(t.x,t.y,t.z,e)}reorder(t){return _h.setFromEuler(this),this.setFromQuaternion(_h,t)}equals(t){return t._x===this._x&&t._y===this._y&&t._z===this._z&&t._order===this._order}fromArray(t){return this._x=t[0],this._y=t[1],this._z=t[2],t[3]!==void 0&&(this._order=t[3]),this._onChangeCallback(),this}toArray(t=[],e=0){return t[e]=this._x,t[e+1]=this._y,t[e+2]=this._z,t[e+3]=this._order,t}_onChange(t){return this._onChangeCallback=t,this}_onChangeCallback(){}*[Symbol.iterator](){yield this._x,yield this._y,yield this._z,yield this._order}};pi.DEFAULT_ORDER="XYZ";var Ls=class{constructor(){this.mask=1}set(t){this.mask=(1<<t|0)>>>0}enable(t){this.mask|=1<<t|0}enableAll(){this.mask=-1}toggle(t){this.mask^=1<<t|0}disable(t){this.mask&=~(1<<t|0)}disableAll(){this.mask=0}test(t){return(this.mask&t.mask)!==0}isEnabled(t){return(this.mask&(1<<t|0))!==0}},Vd=0,yh=new O,gs=new Jn,ai=new Ee,eo=new O,ir=new O,Gd=new O,Hd=new Jn,vh=new O(1,0,0),Mh=new O(0,1,0),Sh=new O(0,0,1),bh={type:"added"},Wd={type:"removed"},xs={type:"childadded",child:null},Pl={type:"childremoved",child:null},Ke=class i extends $n{constructor(){super(),this.isObject3D=!0,Object.defineProperty(this,"id",{value:Vd++}),this.uuid=qs(),this.name="",this.type="Object3D",this.parent=null,this.children=[],this.up=i.DEFAULT_UP.clone();let t=new O,e=new pi,n=new Jn,s=new O(1,1,1);function r(){n.setFromEuler(e,!1)}function o(){e.setFromQuaternion(n,void 0,!1)}e._onChange(r),n._onChange(o),Object.defineProperties(this,{position:{configurable:!0,enumerable:!0,value:t},rotation:{configurable:!0,enumerable:!0,value:e},quaternion:{configurable:!0,enumerable:!0,value:n},scale:{configurable:!0,enumerable:!0,value:s},modelViewMatrix:{value:new Ee},normalMatrix:{value:new ie}}),this.matrix=new Ee,this.matrixWorld=new Ee,this.matrixAutoUpdate=i.DEFAULT_MATRIX_AUTO_UPDATE,this.matrixWorldAutoUpdate=i.DEFAULT_MATRIX_WORLD_AUTO_UPDATE,this.matrixWorldNeedsUpdate=!1,this.layers=new Ls,this.visible=!0,this.castShadow=!1,this.receiveShadow=!1,this.frustumCulled=!0,this.renderOrder=0,this.animations=[],this.customDepthMaterial=void 0,this.customDistanceMaterial=void 0,this.static=!1,this.userData={},this.pivot=null}onBeforeShadow(){}onAfterShadow(){}onBeforeRender(){}onAfterRender(){}applyMatrix4(t){this.matrixAutoUpdate&&this.updateMatrix(),this.matrix.premultiply(t),this.matrix.decompose(this.position,this.quaternion,this.scale)}applyQuaternion(t){return this.quaternion.premultiply(t),this}setRotationFromAxisAngle(t,e){this.quaternion.setFromAxisAngle(t,e)}setRotationFromEuler(t){this.quaternion.setFromEuler(t,!0)}setRotationFromMatrix(t){this.quaternion.setFromRotationMatrix(t)}setRotationFromQuaternion(t){this.quaternion.copy(t)}rotateOnAxis(t,e){return gs.setFromAxisAngle(t,e),this.quaternion.multiply(gs),this}rotateOnWorldAxis(t,e){return gs.setFromAxisAngle(t,e),this.quaternion.premultiply(gs),this}rotateX(t){return this.rotateOnAxis(vh,t)}rotateY(t){return this.rotateOnAxis(Mh,t)}rotateZ(t){return this.rotateOnAxis(Sh,t)}translateOnAxis(t,e){return yh.copy(t).applyQuaternion(this.quaternion),this.position.add(yh.multiplyScalar(e)),this}translateX(t){return this.translateOnAxis(vh,t)}translateY(t){return this.translateOnAxis(Mh,t)}translateZ(t){return this.translateOnAxis(Sh,t)}localToWorld(t){return this.updateWorldMatrix(!0,!1),t.applyMatrix4(this.matrixWorld)}worldToLocal(t){return this.updateWorldMatrix(!0,!1),t.applyMatrix4(ai.copy(this.matrixWorld).invert())}lookAt(t,e,n){t.isVector3?eo.copy(t):eo.set(t,e,n);let s=this.parent;this.updateWorldMatrix(!0,!1),ir.setFromMatrixPosition(this.matrixWorld),this.isCamera||this.isLight?ai.lookAt(ir,eo,this.up):ai.lookAt(eo,ir,this.up),this.quaternion.setFromRotationMatrix(ai),s&&(ai.extractRotation(s.matrixWorld),gs.setFromRotationMatrix(ai),this.quaternion.premultiply(gs.invert()))}add(t){if(arguments.length>1){for(let e=0;e<arguments.length;e++)this.add(arguments[e]);return this}return t===this?(jt("Object3D.add: object can't be added as a child of itself.",t),this):(t&&t.isObject3D?(t.removeFromParent(),t.parent=this,this.children.push(t),t.dispatchEvent(bh),xs.child=t,this.dispatchEvent(xs),xs.child=null):jt("Object3D.add: object not an instance of THREE.Object3D.",t),this)}remove(t){if(arguments.length>1){for(let n=0;n<arguments.length;n++)this.remove(arguments[n]);return this}let e=this.children.indexOf(t);return e!==-1&&(t.parent=null,this.children.splice(e,1),t.dispatchEvent(Wd),Pl.child=t,this.dispatchEvent(Pl),Pl.child=null),this}removeFromParent(){let t=this.parent;return t!==null&&t.remove(this),this}clear(){return this.remove(...this.children)}attach(t){return this.updateWorldMatrix(!0,!1),ai.copy(this.matrixWorld).invert(),t.parent!==null&&(t.parent.updateWorldMatrix(!0,!1),ai.multiply(t.parent.matrixWorld)),t.applyMatrix4(ai),t.removeFromParent(),t.parent=this,this.children.push(t),t.updateWorldMatrix(!1,!0),t.dispatchEvent(bh),xs.child=t,this.dispatchEvent(xs),xs.child=null,this}getObjectById(t){return this.getObjectByProperty("id",t)}getObjectByName(t){return this.getObjectByProperty("name",t)}getObjectByProperty(t,e){if(this[t]===e)return this;for(let n=0,s=this.children.length;n<s;n++){let o=this.children[n].getObjectByProperty(t,e);if(o!==void 0)return o}}getObjectsByProperty(t,e,n=[]){this[t]===e&&n.push(this);let s=this.children;for(let r=0,o=s.length;r<o;r++)s[r].getObjectsByProperty(t,e,n);return n}getWorldPosition(t){return this.updateWorldMatrix(!0,!1),t.setFromMatrixPosition(this.matrixWorld)}getWorldQuaternion(t){return this.updateWorldMatrix(!0,!1),this.matrixWorld.decompose(ir,t,Gd),t}getWorldScale(t){return this.updateWorldMatrix(!0,!1),this.matrixWorld.decompose(ir,Hd,t),t}getWorldDirection(t){this.updateWorldMatrix(!0,!1);let e=this.matrixWorld.elements;return t.set(e[8],e[9],e[10]).normalize()}raycast(){}intersectsFrustum(){}traverse(t){t(this);let e=this.children;for(let n=0,s=e.length;n<s;n++)e[n].traverse(t)}traverseVisible(t){if(this.visible===!1)return;t(this);let e=this.children;for(let n=0,s=e.length;n<s;n++)e[n].traverseVisible(t)}traverseAncestors(t){let e=this.parent;e!==null&&(t(e),e.traverseAncestors(t))}updateMatrix(){this.matrix.compose(this.position,this.quaternion,this.scale);let t=this.pivot;if(t!==null){let e=t.x,n=t.y,s=t.z,r=this.matrix.elements;r[12]+=e-r[0]*e-r[4]*n-r[8]*s,r[13]+=n-r[1]*e-r[5]*n-r[9]*s,r[14]+=s-r[2]*e-r[6]*n-r[10]*s}this.matrixWorldNeedsUpdate=!0}updateMatrixWorld(t){this.matrixAutoUpdate&&this.updateMatrix(),(this.matrixWorldNeedsUpdate||t)&&(this.matrixWorldAutoUpdate===!0&&(this.parent===null?this.matrixWorld.copy(this.matrix):this.matrixWorld.multiplyMatrices(this.parent.matrixWorld,this.matrix)),this.matrixWorldNeedsUpdate=!1,t=!0);let e=this.children;for(let n=0,s=e.length;n<s;n++)e[n].updateMatrixWorld(t)}updateWorldMatrix(t,e,n=!1){let s=this.parent;if(t===!0&&s!==null&&s.updateWorldMatrix(!0,!1),this.matrixAutoUpdate&&this.updateMatrix(),(this.matrixWorldNeedsUpdate||n)&&(this.matrixWorldAutoUpdate===!0&&(this.parent===null?this.matrixWorld.copy(this.matrix):this.matrixWorld.multiplyMatrices(this.parent.matrixWorld,this.matrix)),this.matrixWorldNeedsUpdate=!1,n=!0),e===!0){let r=this.children;for(let o=0,a=r.length;o<a;o++)r[o].updateWorldMatrix(!1,!0,n)}}toJSON(t){let e=t===void 0||typeof t=="string",n={};e&&(t={geometries:{},materials:{},textures:{},images:{},shapes:{},skeletons:{},animations:{},nodes:{}},n.metadata={version:4.7,type:"Object",generator:"Object3D.toJSON"});let s={};s.uuid=this.uuid,s.type=this.type,s.name=this.name,s.castShadow=this.castShadow,s.receiveShadow=this.receiveShadow,s.visible=this.visible,s.frustumCulled=this.frustumCulled,s.renderOrder=this.renderOrder,s.static=this.static,s.matrixAutoUpdate=this.matrixAutoUpdate,Object.keys(this.userData).length>0&&(s.userData=this.userData),s.layers=this.layers.mask,s.matrix=this.matrix.toArray(),s.up=this.up.toArray(),this.pivot!==null&&(s.pivot=this.pivot.toArray()),this.morphTargetDictionary!==void 0&&(s.morphTargetDictionary=Object.assign({},this.morphTargetDictionary)),this.morphTargetInfluences!==void 0&&(s.morphTargetInfluences=this.morphTargetInfluences.slice()),this.isInstancedMesh&&(s.type="InstancedMesh",s.count=this.count,s.instanceMatrix=this.instanceMatrix.toJSON(),this.instanceColor!==null&&(s.instanceColor=this.instanceColor.toJSON())),this.isBatchedMesh&&(s.type="BatchedMesh",s.perObjectFrustumCulled=this.perObjectFrustumCulled,s.sortObjects=this.sortObjects,s.drawRanges=this._drawRanges,s.reservedRanges=this._reservedRanges,s.geometryInfo=this._geometryInfo.map(a=>({...a,boundingBox:a.boundingBox?a.boundingBox.toJSON():void 0,boundingSphere:a.boundingSphere?a.boundingSphere.toJSON():void 0})),s.instanceInfo=this._instanceInfo.map(a=>({...a})),s.availableInstanceIds=this._availableInstanceIds.slice(),s.availableGeometryIds=this._availableGeometryIds.slice(),s.nextIndexStart=this._nextIndexStart,s.nextVertexStart=this._nextVertexStart,s.geometryCount=this._geometryCount,s.maxInstanceCount=this._maxInstanceCount,s.maxVertexCount=this._maxVertexCount,s.maxIndexCount=this._maxIndexCount,s.geometryInitialized=this._geometryInitialized,s.matricesTexture=this._matricesTexture.toJSON(t),s.indirectTexture=this._indirectTexture.toJSON(t),this._colorsTexture!==null&&(s.colorsTexture=this._colorsTexture.toJSON(t)),this.boundingSphere!==null&&(s.boundingSphere=this.boundingSphere.toJSON()),this.boundingBox!==null&&(s.boundingBox=this.boundingBox.toJSON()));function r(a,l){return a[l.uuid]===void 0&&(a[l.uuid]=l.toJSON(t)),l.uuid}if(this.isScene)this.background&&(this.background.isColor?s.background=this.background.toJSON():this.background.isTexture&&(s.background=this.background.toJSON(t).uuid)),this.environment&&this.environment.isTexture&&this.environment.isRenderTargetTexture!==!0&&(s.environment=this.environment.toJSON(t).uuid);else if(this.isMesh||this.isLine||this.isPoints){s.geometry=r(t.geometries,this.geometry);let a=this.geometry.parameters;if(a!==void 0&&a.shapes!==void 0){let l=a.shapes;if(Array.isArray(l))for(let c=0,h=l.length;c<h;c++){let f=l[c];r(t.shapes,f)}else r(t.shapes,l)}}if(this.isSkinnedMesh&&(s.bindMode=this.bindMode,s.bindMatrix=this.bindMatrix.toArray(),this.skeleton!==void 0&&(r(t.skeletons,this.skeleton),s.skeleton=this.skeleton.uuid)),this.material!==void 0)if(Array.isArray(this.material)){let a=[];for(let l=0,c=this.material.length;l<c;l++)a.push(r(t.materials,this.material[l]));s.material=a}else s.material=r(t.materials,this.material);if(this.children.length>0){s.children=[];for(let a=0;a<this.children.length;a++)s.children.push(this.children[a].toJSON(t).object)}if(this.animations.length>0){s.animations=[];for(let a=0;a<this.animations.length;a++){let l=this.animations[a];s.animations.push(r(t.animations,l))}}if(e){let a=o(t.geometries),l=o(t.materials),c=o(t.textures),h=o(t.images),f=o(t.shapes),u=o(t.skeletons),d=o(t.animations),g=o(t.nodes);a.length>0&&(n.geometries=a),l.length>0&&(n.materials=l),c.length>0&&(n.textures=c),h.length>0&&(n.images=h),f.length>0&&(n.shapes=f),u.length>0&&(n.skeletons=u),d.length>0&&(n.animations=d),g.length>0&&(n.nodes=g)}return n.object=s,n;function o(a){let l=[];for(let c in a){let h=a[c];delete h.metadata,l.push(h)}return l}}clone(t){return new this.constructor().copy(this,t)}copy(t,e=!0){if(this.name=t.name,this.up.copy(t.up),this.position.copy(t.position),this.rotation.order=t.rotation.order,this.quaternion.copy(t.quaternion),this.scale.copy(t.scale),this.pivot=t.pivot!==null?t.pivot.clone():null,this.matrix.copy(t.matrix),this.matrixWorld.copy(t.matrixWorld),this.matrixAutoUpdate=t.matrixAutoUpdate,this.matrixWorldAutoUpdate=t.matrixWorldAutoUpdate,this.matrixWorldNeedsUpdate=t.matrixWorldNeedsUpdate,this.layers.mask=t.layers.mask,this.visible=t.visible,this.castShadow=t.castShadow,this.receiveShadow=t.receiveShadow,this.frustumCulled=t.frustumCulled,this.renderOrder=t.renderOrder,this.static=t.static,this.animations=t.animations.slice(),this.userData=JSON.parse(JSON.stringify(t.userData)),e===!0)for(let n=0;n<t.children.length;n++){let s=t.children[n];this.add(s.clone())}return this}dispose(){this.dispatchEvent({type:"dispose"})}};Ke.DEFAULT_UP=new O(0,1,0);Ke.DEFAULT_MATRIX_AUTO_UPDATE=!0;Ke.DEFAULT_MATRIX_WORLD_AUTO_UPDATE=!0;var cn=class extends Ke{constructor(){super(),this.isGroup=!0,this.type="Group"}},Xd={type:"move"},Ds=class{constructor(){this._targetRay=null,this._grip=null,this._hand=null}getHandSpace(){return this._hand===null&&(this._hand=new cn,this._hand.matrixAutoUpdate=!1,this._hand.visible=!1,this._hand.joints={},this._hand.inputState={pinching:!1}),this._hand}getTargetRaySpace(){return this._targetRay===null&&(this._targetRay=new cn,this._targetRay.matrixAutoUpdate=!1,this._targetRay.visible=!1,this._targetRay.hasLinearVelocity=!1,this._targetRay.linearVelocity=new O,this._targetRay.hasAngularVelocity=!1,this._targetRay.angularVelocity=new O),this._targetRay}getGripSpace(){return this._grip===null&&(this._grip=new cn,this._grip.matrixAutoUpdate=!1,this._grip.visible=!1,this._grip.hasLinearVelocity=!1,this._grip.linearVelocity=new O,this._grip.hasAngularVelocity=!1,this._grip.angularVelocity=new O,this._grip.eventsEnabled=!1),this._grip}dispatchEvent(t){return this._targetRay!==null&&this._targetRay.dispatchEvent(t),this._grip!==null&&this._grip.dispatchEvent(t),this._hand!==null&&this._hand.dispatchEvent(t),this}connect(t){if(t&&t.hand){let e=this._hand;if(e)for(let n of t.hand.values())this._getHandJoint(e,n)}return this.dispatchEvent({type:"connected",data:t}),this}disconnect(t){return this.dispatchEvent({type:"disconnected",data:t}),this._targetRay!==null&&(this._targetRay.visible=!1),this._grip!==null&&(this._grip.visible=!1),this._hand!==null&&(this._hand.visible=!1),this}update(t,e,n){let s=null,r=null,o=null,a=this._targetRay,l=this._grip,c=this._hand;if(t&&e.session.visibilityState!=="visible-blurred"){if(c&&t.hand){o=!0;for(let M of t.hand.values()){let m=e.getJointPose(M,n),p=this._getHandJoint(c,M);m!==null&&(p.matrix.fromArray(m.transform.matrix),p.matrix.decompose(p.position,p.rotation,p.scale),p.matrixWorldNeedsUpdate=!0,p.jointRadius=m.radius),p.visible=m!==null}let h=c.joints["index-finger-tip"],f=c.joints["thumb-tip"],u=h.position.distanceTo(f.position),d=.02,g=.005;c.inputState.pinching&&u>d+g?(c.inputState.pinching=!1,this.dispatchEvent({type:"pinchend",handedness:t.handedness,target:this})):!c.inputState.pinching&&u<=d-g&&(c.inputState.pinching=!0,this.dispatchEvent({type:"pinchstart",handedness:t.handedness,target:this}))}else l!==null&&t.gripSpace&&(r=e.getPose(t.gripSpace,n),r!==null&&(l.matrix.fromArray(r.transform.matrix),l.matrix.decompose(l.position,l.rotation,l.scale),l.matrixWorldNeedsUpdate=!0,r.linearVelocity?(l.hasLinearVelocity=!0,l.linearVelocity.copy(r.linearVelocity)):l.hasLinearVelocity=!1,r.angularVelocity?(l.hasAngularVelocity=!0,l.angularVelocity.copy(r.angularVelocity)):l.hasAngularVelocity=!1,l.eventsEnabled&&l.dispatchEvent({type:"gripUpdated",data:t,target:this})));a!==null&&(s=e.getPose(t.targetRaySpace,n),s===null&&r!==null&&(s=r),s!==null&&(a.matrix.fromArray(s.transform.matrix),a.matrix.decompose(a.position,a.rotation,a.scale),a.matrixWorldNeedsUpdate=!0,s.linearVelocity?(a.hasLinearVelocity=!0,a.linearVelocity.copy(s.linearVelocity)):a.hasLinearVelocity=!1,s.angularVelocity?(a.hasAngularVelocity=!0,a.angularVelocity.copy(s.angularVelocity)):a.hasAngularVelocity=!1,this.dispatchEvent(Xd)))}return a!==null&&(a.visible=s!==null),l!==null&&(l.visible=r!==null),c!==null&&(c.visible=o!==null),this}_getHandJoint(t,e){if(t.joints[e.jointName]===void 0){let n=new cn;n.matrixAutoUpdate=!1,n.visible=!1,t.joints[e.jointName]=n,t.add(n)}return t.joints[e.jointName]}},Cu={aliceblue:15792383,antiquewhite:16444375,aqua:65535,aquamarine:8388564,azure:15794175,beige:16119260,bisque:16770244,black:0,blanchedalmond:16772045,blue:255,blueviolet:9055202,brown:10824234,burlywood:14596231,cadetblue:6266528,chartreuse:8388352,chocolate:13789470,coral:16744272,cornflowerblue:6591981,cornsilk:16775388,crimson:14423100,cyan:65535,darkblue:139,darkcyan:35723,darkgoldenrod:12092939,darkgray:11119017,darkgreen:25600,darkgrey:11119017,darkkhaki:12433259,darkmagenta:9109643,darkolivegreen:5597999,darkorange:16747520,darkorchid:10040012,darkred:9109504,darksalmon:15308410,darkseagreen:9419919,darkslateblue:4734347,darkslategray:3100495,darkslategrey:3100495,darkturquoise:52945,darkviolet:9699539,deeppink:16716947,deepskyblue:49151,dimgray:6908265,dimgrey:6908265,dodgerblue:2003199,firebrick:11674146,floralwhite:16775920,forestgreen:2263842,fuchsia:16711935,gainsboro:14474460,ghostwhite:16316671,gold:16766720,goldenrod:14329120,gray:8421504,green:32768,greenyellow:11403055,grey:8421504,honeydew:15794160,hotpink:16738740,indianred:13458524,indigo:4915330,ivory:16777200,khaki:15787660,lavender:15132410,lavenderblush:16773365,lawngreen:8190976,lemonchiffon:16775885,lightblue:11393254,lightcoral:15761536,lightcyan:14745599,lightgoldenrodyellow:16448210,lightgray:13882323,lightgreen:9498256,lightgrey:13882323,lightpink:16758465,lightsalmon:16752762,lightseagreen:2142890,lightskyblue:8900346,lightslategray:7833753,lightslategrey:7833753,lightsteelblue:11584734,lightyellow:16777184,lime:65280,limegreen:3329330,linen:16445670,magenta:16711935,maroon:8388608,mediumaquamarine:6737322,mediumblue:205,mediumorchid:12211667,mediumpurple:9662683,mediumseagreen:3978097,mediumslateblue:8087790,mediumspringgreen:64154,mediumturquoise:4772300,mediumvioletred:13047173,midnightblue:1644912,mintcream:16121850,mistyrose:16770273,moccasin:16770229,navajowhite:16768685,navy:128,oldlace:16643558,olive:8421376,olivedrab:7048739,orange:16753920,orangered:16729344,orchid:14315734,palegoldenrod:15657130,palegreen:10025880,paleturquoise:11529966,palevioletred:14381203,papayawhip:16773077,peachpuff:16767673,peru:13468991,pink:16761035,plum:14524637,powderblue:11591910,purple:8388736,rebeccapurple:6697881,red:16711680,rosybrown:12357519,royalblue:4286945,saddlebrown:9127187,salmon:16416882,sandybrown:16032864,seagreen:3050327,seashell:16774638,sienna:10506797,silver:12632256,skyblue:8900331,slateblue:6970061,slategray:7372944,slategrey:7372944,snow:16775930,springgreen:65407,steelblue:4620980,tan:13808780,teal:32896,thistle:14204888,tomato:16737095,turquoise:4251856,violet:15631086,wheat:16113331,white:16777215,whitesmoke:16119285,yellow:16776960,yellowgreen:10145074},Ai={h:0,s:0,l:0},no={h:0,s:0,l:0};function Ll(i,t,e){return e<0&&(e+=1),e>1&&(e-=1),e<1/6?i+(t-i)*6*e:e<1/2?t:e<2/3?i+(t-i)*6*(2/3-e):i}var se=class{constructor(t,e,n){return this.isColor=!0,this.r=1,this.g=1,this.b=1,this.set(t,e,n)}set(t,e,n){if(e===void 0&&n===void 0){let s=t;s&&s.isColor?this.copy(s):typeof s=="number"?this.setHex(s):typeof s=="string"&&this.setStyle(s)}else this.setRGB(t,e,n);return this}setScalar(t){return this.r=t,this.g=t,this.b=t,this}setHex(t,e=ln){return t=Math.floor(t),this.r=(t>>16&255)/255,this.g=(t>>8&255)/255,this.b=(t&255)/255,pe.colorSpaceToWorking(this,e),this}setRGB(t,e,n,s=pe.workingColorSpace){return this.r=t,this.g=e,this.b=n,pe.colorSpaceToWorking(this,s),this}setHSL(t,e,n,s=pe.workingColorSpace){if(t=Ud(t,1),e=ce(e,0,1),n=ce(n,0,1),e===0)this.r=this.g=this.b=n;else{let r=n<=.5?n*(1+e):n+e-n*e,o=2*n-r;this.r=Ll(o,r,t+1/3),this.g=Ll(o,r,t),this.b=Ll(o,r,t-1/3)}return pe.colorSpaceToWorking(this,s),this}setStyle(t,e=ln){function n(r){r!==void 0&&parseFloat(r)<1&&Jt("Color: Alpha component of "+t+" will be ignored.")}let s;if(s=/^(\w+)\(([^\)]*)\)/.exec(t)){let r,o=s[1],a=s[2];switch(o){case"rgb":case"rgba":if(r=/^\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+)\s*(?:,\s*(\d*\.?\d+)\s*)?$/.exec(a))return n(r[4]),this.setRGB(Math.min(255,parseInt(r[1],10))/255,Math.min(255,parseInt(r[2],10))/255,Math.min(255,parseInt(r[3],10))/255,e);if(r=/^\s*(\d+)\%\s*,\s*(\d+)\%\s*,\s*(\d+)\%\s*(?:,\s*(\d*\.?\d+)\s*)?$/.exec(a))return n(r[4]),this.setRGB(Math.min(100,parseInt(r[1],10))/100,Math.min(100,parseInt(r[2],10))/100,Math.min(100,parseInt(r[3],10))/100,e);break;case"hsl":case"hsla":if(r=/^\s*(\d*\.?\d+)\s*,\s*(\d*\.?\d+)\%\s*,\s*(\d*\.?\d+)\%\s*(?:,\s*(\d*\.?\d+)\s*)?$/.exec(a))return n(r[4]),this.setHSL(parseFloat(r[1])/360,parseFloat(r[2])/100,parseFloat(r[3])/100,e);break;default:Jt("Color: Unknown color model "+t)}}else if(s=/^\#([A-Fa-f\d]+)$/.exec(t)){let r=s[1],o=r.length;if(o===3)return this.setRGB(parseInt(r.charAt(0),16)/15,parseInt(r.charAt(1),16)/15,parseInt(r.charAt(2),16)/15,e);if(o===6)return this.setHex(parseInt(r,16),e);Jt("Color: Invalid hex color "+t)}else if(t&&t.length>0)return this.setColorName(t,e);return this}setColorName(t,e=ln){let n=Cu[t.toLowerCase()];return n!==void 0?this.setHex(n,e):Jt("Color: Unknown color "+t),this}clone(){return new this.constructor(this.r,this.g,this.b)}copy(t){return this.r=t.r,this.g=t.g,this.b=t.b,this}copySRGBToLinear(t){return this.r=fi(t.r),this.g=fi(t.g),this.b=fi(t.b),this}copyLinearToSRGB(t){return this.r=As(t.r),this.g=As(t.g),this.b=As(t.b),this}convertSRGBToLinear(){return this.copySRGBToLinear(this),this}convertLinearToSRGB(){return this.copyLinearToSRGB(this),this}getHex(t=ln){return pe.workingToColorSpace(nn.copy(this),t),Math.round(ce(nn.r*255,0,255))*65536+Math.round(ce(nn.g*255,0,255))*256+Math.round(ce(nn.b*255,0,255))}getHexString(t=ln){return("000000"+this.getHex(t).toString(16)).slice(-6)}getHSL(t,e=pe.workingColorSpace){pe.workingToColorSpace(nn.copy(this),e);let n=nn.r,s=nn.g,r=nn.b,o=Math.max(n,s,r),a=Math.min(n,s,r),l,c,h=(a+o)/2;if(a===o)l=0,c=0;else{let f=o-a;switch(c=h<=.5?f/(o+a):f/(2-o-a),o){case n:l=(s-r)/f+(s<r?6:0);break;case s:l=(r-n)/f+2;break;case r:l=(n-s)/f+4;break}l/=6}return t.h=l,t.s=c,t.l=h,t}getRGB(t,e=pe.workingColorSpace){return pe.workingToColorSpace(nn.copy(this),e),t.r=nn.r,t.g=nn.g,t.b=nn.b,t}getStyle(t=ln){pe.workingToColorSpace(nn.copy(this),t);let e=nn.r,n=nn.g,s=nn.b;return t!==ln?`color(${t} ${e.toFixed(3)} ${n.toFixed(3)} ${s.toFixed(3)})`:`rgb(${Math.round(e*255)},${Math.round(n*255)},${Math.round(s*255)})`}offsetHSL(t,e,n){return this.getHSL(Ai),this.setHSL(Ai.h+t,Ai.s+e,Ai.l+n)}add(t){return this.r+=t.r,this.g+=t.g,this.b+=t.b,this}addColors(t,e){return this.r=t.r+e.r,this.g=t.g+e.g,this.b=t.b+e.b,this}addScalar(t){return this.r+=t,this.g+=t,this.b+=t,this}sub(t){return this.r=Math.max(0,this.r-t.r),this.g=Math.max(0,this.g-t.g),this.b=Math.max(0,this.b-t.b),this}multiply(t){return this.r*=t.r,this.g*=t.g,this.b*=t.b,this}multiplyScalar(t){return this.r*=t,this.g*=t,this.b*=t,this}lerp(t,e){return this.r+=(t.r-this.r)*e,this.g+=(t.g-this.g)*e,this.b+=(t.b-this.b)*e,this}lerpColors(t,e,n){return this.r=t.r+(e.r-t.r)*n,this.g=t.g+(e.g-t.g)*n,this.b=t.b+(e.b-t.b)*n,this}lerpHSL(t,e){this.getHSL(Ai),t.getHSL(no);let n=El(Ai.h,no.h,e),s=El(Ai.s,no.s,e),r=El(Ai.l,no.l,e);return this.setHSL(n,s,r),this}setFromVector3(t){return this.r=t.x,this.g=t.y,this.b=t.z,this}applyMatrix3(t){let e=this.r,n=this.g,s=this.b,r=t.elements;return this.r=r[0]*e+r[3]*n+r[6]*s,this.g=r[1]*e+r[4]*n+r[7]*s,this.b=r[2]*e+r[5]*n+r[8]*s,this}equals(t){return t.r===this.r&&t.g===this.g&&t.b===this.b}fromArray(t,e=0){return this.r=t[e],this.g=t[e+1],this.b=t[e+2],this}toArray(t=[],e=0){return t[e]=this.r,t[e+1]=this.g,t[e+2]=this.b,t}fromBufferAttribute(t,e){return this.r=t.getX(e),this.g=t.getY(e),this.b=t.getZ(e),this}toJSON(){return this.getHex()}*[Symbol.iterator](){yield this.r,yield this.g,yield this.b}},nn=new se;se.NAMES=Cu;var Ns=class extends Ke{constructor(){super(),this.isScene=!0,this.type="Scene",this.background=null,this.environment=null,this.fog=null,this.backgroundBlurriness=0,this.backgroundIntensity=1,this.backgroundRotation=new pi,this.environmentIntensity=1,this.environmentRotation=new pi,this.overrideMaterial=null,typeof __THREE_DEVTOOLS__<"u"&&__THREE_DEVTOOLS__.dispatchEvent(new CustomEvent("observe",{detail:this}))}copy(t,e){return super.copy(t,e),t.background!==null&&(this.background=t.background.clone()),t.environment!==null&&(this.environment=t.environment.clone()),t.fog!==null&&(this.fog=t.fog.clone()),this.backgroundBlurriness=t.backgroundBlurriness,this.backgroundIntensity=t.backgroundIntensity,this.backgroundRotation.copy(t.backgroundRotation),this.environmentIntensity=t.environmentIntensity,this.environmentRotation.copy(t.environmentRotation),t.overrideMaterial!==null&&(this.overrideMaterial=t.overrideMaterial.clone()),this.matrixAutoUpdate=t.matrixAutoUpdate,this}toJSON(t){let e=super.toJSON(t);return this.fog!==null&&(e.object.fog=this.fog.toJSON()),e.object.backgroundBlurriness=this.backgroundBlurriness,e.object.backgroundIntensity=this.backgroundIntensity,e.object.backgroundRotation=this.backgroundRotation.toArray(),e.object.environmentIntensity=this.environmentIntensity,e.object.environmentRotation=this.environmentRotation.toArray(),e}},Fn=new O,li=new O,Dl=new O,ci=new O,_s=new O,ys=new O,wh=new O,Nl=new O,Ul=new O,Fl=new O,Ol=new Le,Bl=new Le,zl=new Le,di=class i{constructor(t=new O,e=new O,n=new O){this.a=t,this.b=e,this.c=n}static getNormal(t,e,n,s){s.subVectors(n,e),Fn.subVectors(t,e),s.cross(Fn);let r=s.lengthSq();return r>0?s.multiplyScalar(1/Math.sqrt(r)):s.set(0,0,0)}static getBarycoord(t,e,n,s,r){Fn.subVectors(s,e),li.subVectors(n,e),Dl.subVectors(t,e);let o=Fn.dot(Fn),a=Fn.dot(li),l=Fn.dot(Dl),c=li.dot(li),h=li.dot(Dl),f=o*c-a*a;if(f===0)return r.set(0,0,0),null;let u=1/f,d=(c*l-a*h)*u,g=(o*h-a*l)*u;return r.set(1-d-g,g,d)}static containsPoint(t,e,n,s){return this.getBarycoord(t,e,n,s,ci)===null?!1:ci.x>=0&&ci.y>=0&&ci.x+ci.y<=1}static getInterpolation(t,e,n,s,r,o,a,l){return this.getBarycoord(t,e,n,s,ci)===null?(l.x=0,l.y=0,"z"in l&&(l.z=0),"w"in l&&(l.w=0),null):(l.setScalar(0),l.addScaledVector(r,ci.x),l.addScaledVector(o,ci.y),l.addScaledVector(a,ci.z),l)}static getInterpolatedAttribute(t,e,n,s,r,o){return Ol.setScalar(0),Bl.setScalar(0),zl.setScalar(0),Ol.fromBufferAttribute(t,e),Bl.fromBufferAttribute(t,n),zl.fromBufferAttribute(t,s),o.setScalar(0),o.addScaledVector(Ol,r.x),o.addScaledVector(Bl,r.y),o.addScaledVector(zl,r.z),o}static isFrontFacing(t,e,n,s){return Fn.subVectors(n,e),li.subVectors(t,e),Fn.cross(li).dot(s)<0}set(t,e,n){return this.a.copy(t),this.b.copy(e),this.c.copy(n),this}setFromPointsAndIndices(t,e,n,s){return this.a.copy(t[e]),this.b.copy(t[n]),this.c.copy(t[s]),this}setFromAttributeAndIndices(t,e,n,s){return this.a.fromBufferAttribute(t,e),this.b.fromBufferAttribute(t,n),this.c.fromBufferAttribute(t,s),this}clone(){return new this.constructor().copy(this)}copy(t){return this.a.copy(t.a),this.b.copy(t.b),this.c.copy(t.c),this}getArea(){return Fn.subVectors(this.c,this.b),li.subVectors(this.a,this.b),Fn.cross(li).length()*.5}getMidpoint(t){return t.addVectors(this.a,this.b).add(this.c).multiplyScalar(1/3)}getNormal(t){return i.getNormal(this.a,this.b,this.c,t)}getPlane(t){return t.setFromCoplanarPoints(this.a,this.b,this.c)}getBarycoord(t,e){return i.getBarycoord(t,this.a,this.b,this.c,e)}getInterpolation(t,e,n,s,r){return i.getInterpolation(t,this.a,this.b,this.c,e,n,s,r)}containsPoint(t){return i.containsPoint(t,this.a,this.b,this.c)}isFrontFacing(t){return i.isFrontFacing(this.a,this.b,this.c,t)}intersectsBox(t){return t.intersectsTriangle(this)}closestPointToPoint(t,e){let n=this.a,s=this.b,r=this.c,o,a;_s.subVectors(s,n),ys.subVectors(r,n),Nl.subVectors(t,n);let l=_s.dot(Nl),c=ys.dot(Nl);if(l<=0&&c<=0)return e.copy(n);Ul.subVectors(t,s);let h=_s.dot(Ul),f=ys.dot(Ul);if(h>=0&&f<=h)return e.copy(s);let u=l*f-h*c;if(u<=0&&l>=0&&h<=0)return o=l/(l-h),e.copy(n).addScaledVector(_s,o);Fl.subVectors(t,r);let d=_s.dot(Fl),g=ys.dot(Fl);if(g>=0&&d<=g)return e.copy(r);let M=d*c-l*g;if(M<=0&&c>=0&&g<=0)return a=c/(c-g),e.copy(n).addScaledVector(ys,a);let m=h*g-d*f;if(m<=0&&f-h>=0&&d-g>=0)return wh.subVectors(r,s),a=(f-h)/(f-h+(d-g)),e.copy(s).addScaledVector(wh,a);let p=1/(m+M+u);return o=M*p,a=u*p,e.copy(n).addScaledVector(_s,o).addScaledVector(ys,a)}equals(t){return t.a.equals(this.a)&&t.b.equals(this.b)&&t.c.equals(this.c)}},Kn=class{constructor(t=new O(1/0,1/0,1/0),e=new O(-1/0,-1/0,-1/0)){this.isBox3=!0,this.min=t,this.max=e}set(t,e){return this.min.copy(t),this.max.copy(e),this}setFromArray(t){this.makeEmpty();for(let e=0,n=t.length;e<n;e+=3)this.expandByPoint(On.fromArray(t,e));return this}setFromBufferAttribute(t){this.makeEmpty();for(let e=0,n=t.count;e<n;e++)this.expandByPoint(On.fromBufferAttribute(t,e));return this}setFromPoints(t){this.makeEmpty();for(let e=0,n=t.length;e<n;e++)this.expandByPoint(t[e]);return this}setFromCenterAndSize(t,e){let n=On.copy(e).multiplyScalar(.5);return this.min.copy(t).sub(n),this.max.copy(t).add(n),this}setFromObject(t,e=!1){return this.makeEmpty(),this.expandByObject(t,e)}clone(){return new this.constructor().copy(this)}copy(t){return this.min.copy(t.min),this.max.copy(t.max),this}makeEmpty(){return this.min.x=this.min.y=this.min.z=1/0,this.max.x=this.max.y=this.max.z=-1/0,this}isEmpty(){return this.max.x<this.min.x||this.max.y<this.min.y||this.max.z<this.min.z}getCenter(t){return this.isEmpty()?t.set(0,0,0):t.addVectors(this.min,this.max).multiplyScalar(.5)}getSize(t){return this.isEmpty()?t.set(0,0,0):t.subVectors(this.max,this.min)}expandByPoint(t){return this.min.min(t),this.max.max(t),this}expandByVector(t){return this.min.sub(t),this.max.add(t),this}expandByScalar(t){return this.min.addScalar(-t),this.max.addScalar(t),this}expandByObject(t,e=!1){t.updateWorldMatrix(!1,!1);let n=t.geometry;if(n!==void 0){let r=n.getAttribute("position");if(e===!0&&r!==void 0&&t.isInstancedMesh!==!0)for(let o=0,a=r.count;o<a;o++)t.isMesh===!0?t.getVertexPosition(o,On):On.fromBufferAttribute(r,o),On.applyMatrix4(t.matrixWorld),this.expandByPoint(On);else t.boundingBox!==void 0?(t.boundingBox===null&&t.computeBoundingBox(),io.copy(t.boundingBox)):(n.boundingBox===null&&n.computeBoundingBox(),io.copy(n.boundingBox)),io.applyMatrix4(t.matrixWorld),this.union(io)}let s=t.children;for(let r=0,o=s.length;r<o;r++)this.expandByObject(s[r],e);return this}containsPoint(t){return t.x>=this.min.x&&t.x<=this.max.x&&t.y>=this.min.y&&t.y<=this.max.y&&t.z>=this.min.z&&t.z<=this.max.z}containsBox(t){return this.min.x<=t.min.x&&t.max.x<=this.max.x&&this.min.y<=t.min.y&&t.max.y<=this.max.y&&this.min.z<=t.min.z&&t.max.z<=this.max.z}getParameter(t,e){return e.set((t.x-this.min.x)/(this.max.x-this.min.x),(t.y-this.min.y)/(this.max.y-this.min.y),(t.z-this.min.z)/(this.max.z-this.min.z))}intersectsBox(t){return t.max.x>=this.min.x&&t.min.x<=this.max.x&&t.max.y>=this.min.y&&t.min.y<=this.max.y&&t.max.z>=this.min.z&&t.min.z<=this.max.z}intersectsSphere(t){return this.clampPoint(t.center,On),On.distanceToSquared(t.center)<=t.radius*t.radius}intersectsPlane(t){let e,n;return t.normal.x>0?(e=t.normal.x*this.min.x,n=t.normal.x*this.max.x):(e=t.normal.x*this.max.x,n=t.normal.x*this.min.x),t.normal.y>0?(e+=t.normal.y*this.min.y,n+=t.normal.y*this.max.y):(e+=t.normal.y*this.max.y,n+=t.normal.y*this.min.y),t.normal.z>0?(e+=t.normal.z*this.min.z,n+=t.normal.z*this.max.z):(e+=t.normal.z*this.max.z,n+=t.normal.z*this.min.z),e<=-t.constant&&n>=-t.constant}intersectsTriangle(t){if(this.isEmpty())return!1;this.getCenter(sr),so.subVectors(this.max,sr),vs.subVectors(t.a,sr),Ms.subVectors(t.b,sr),Ss.subVectors(t.c,sr),Ci.subVectors(Ms,vs),Ri.subVectors(Ss,Ms),Ji.subVectors(vs,Ss);let e=[0,-Ci.z,Ci.y,0,-Ri.z,Ri.y,0,-Ji.z,Ji.y,Ci.z,0,-Ci.x,Ri.z,0,-Ri.x,Ji.z,0,-Ji.x,-Ci.y,Ci.x,0,-Ri.y,Ri.x,0,-Ji.y,Ji.x,0];return!kl(e,vs,Ms,Ss,so)||(e=[1,0,0,0,1,0,0,0,1],!kl(e,vs,Ms,Ss,so))?!1:(ro.crossVectors(Ci,Ri),e=[ro.x,ro.y,ro.z],kl(e,vs,Ms,Ss,so))}clampPoint(t,e){return e.copy(t).clamp(this.min,this.max)}distanceToPoint(t){return this.clampPoint(t,On).distanceTo(t)}getBoundingSphere(t){return this.isEmpty()?t.makeEmpty():(this.getCenter(t.center),t.radius=this.getSize(On).length()*.5),t}intersect(t){return this.min.max(t.min),this.max.min(t.max),this.isEmpty()&&this.makeEmpty(),this}union(t){return this.min.min(t.min),this.max.max(t.max),this}applyMatrix4(t){return this.isEmpty()?this:(hi[0].set(this.min.x,this.min.y,this.min.z).applyMatrix4(t),hi[1].set(this.min.x,this.min.y,this.max.z).applyMatrix4(t),hi[2].set(this.min.x,this.max.y,this.min.z).applyMatrix4(t),hi[3].set(this.min.x,this.max.y,this.max.z).applyMatrix4(t),hi[4].set(this.max.x,this.min.y,this.min.z).applyMatrix4(t),hi[5].set(this.max.x,this.min.y,this.max.z).applyMatrix4(t),hi[6].set(this.max.x,this.max.y,this.min.z).applyMatrix4(t),hi[7].set(this.max.x,this.max.y,this.max.z).applyMatrix4(t),this.setFromPoints(hi),this)}translate(t){return this.min.add(t),this.max.add(t),this}equals(t){return t.min.equals(this.min)&&t.max.equals(this.max)}toJSON(){return{min:this.min.toArray(),max:this.max.toArray()}}fromJSON(t){return this.min.fromArray(t.min),this.max.fromArray(t.max),this}},hi=[new O,new O,new O,new O,new O,new O,new O,new O],On=new O,io=new Kn,vs=new O,Ms=new O,Ss=new O,Ci=new O,Ri=new O,Ji=new O,sr=new O,so=new O,ro=new O,Ki=new O;function kl(i,t,e,n,s){for(let r=0,o=i.length-3;r<=o;r+=3){Ki.fromArray(i,r);let a=s.x*Math.abs(Ki.x)+s.y*Math.abs(Ki.y)+s.z*Math.abs(Ki.z),l=t.dot(Ki),c=e.dot(Ki),h=n.dot(Ki);if(Math.max(-Math.max(l,c,h),Math.min(l,c,h))>a)return!1}return!0}var Ge=new O,oo=new xt,qd=0,pn=class extends $n{constructor(t,e,n=!1){if(super(),Array.isArray(t))throw new TypeError("THREE.BufferAttribute: array should be a Typed Array.");this.isBufferAttribute=!0,Object.defineProperty(this,"id",{value:qd++}),this.name="",this.array=t,this.itemSize=e,this.count=t!==void 0?t.length/e:0,this.normalized=n,this.usage=bu,this.updateRanges=[],this.gpuType=Gn,this.version=0}onUploadCallback(){}set needsUpdate(t){t===!0&&this.version++}setUsage(t){return this.usage=t,this}addUpdateRange(t,e){this.updateRanges.push({start:t,count:e})}clearUpdateRanges(){this.updateRanges.length=0}copy(t){return this.name=t.name,this.array=new t.array.constructor(t.array),this.itemSize=t.itemSize,this.count=t.count,this.normalized=t.normalized,this.usage=t.usage,this.gpuType=t.gpuType,this}copyAt(t,e,n){t*=this.itemSize,n*=e.itemSize;for(let s=0,r=this.itemSize;s<r;s++)this.array[t+s]=e.array[n+s];return this}copyArray(t){return this.array.set(t),this}applyMatrix3(t){if(this.itemSize===2)for(let e=0,n=this.count;e<n;e++)oo.fromBufferAttribute(this,e),oo.applyMatrix3(t),this.setXY(e,oo.x,oo.y);else if(this.itemSize===3)for(let e=0,n=this.count;e<n;e++)Ge.fromBufferAttribute(this,e),Ge.applyMatrix3(t),this.setXYZ(e,Ge.x,Ge.y,Ge.z);return this}applyMatrix4(t){for(let e=0,n=this.count;e<n;e++)Ge.fromBufferAttribute(this,e),Ge.applyMatrix4(t),this.setXYZ(e,Ge.x,Ge.y,Ge.z);return this}applyNormalMatrix(t){for(let e=0,n=this.count;e<n;e++)Ge.fromBufferAttribute(this,e),Ge.applyNormalMatrix(t),this.setXYZ(e,Ge.x,Ge.y,Ge.z);return this}transformDirection(t){for(let e=0,n=this.count;e<n;e++)Ge.fromBufferAttribute(this,e),Ge.transformDirection(t),this.setXYZ(e,Ge.x,Ge.y,Ge.z);return this}set(t,e=0){return this.array.set(t,e),this}getComponent(t,e){let n=this.array[t*this.itemSize+e];return this.normalized&&(n=nr(n,this.array)),n}setComponent(t,e,n){return this.normalized&&(n=dn(n,this.array)),this.array[t*this.itemSize+e]=n,this}getX(t){let e=this.array[t*this.itemSize];return this.normalized&&(e=nr(e,this.array)),e}setX(t,e){return this.normalized&&(e=dn(e,this.array)),this.array[t*this.itemSize]=e,this}getY(t){let e=this.array[t*this.itemSize+1];return this.normalized&&(e=nr(e,this.array)),e}setY(t,e){return this.normalized&&(e=dn(e,this.array)),this.array[t*this.itemSize+1]=e,this}getZ(t){let e=this.array[t*this.itemSize+2];return this.normalized&&(e=nr(e,this.array)),e}setZ(t,e){return this.normalized&&(e=dn(e,this.array)),this.array[t*this.itemSize+2]=e,this}getW(t){let e=this.array[t*this.itemSize+3];return this.normalized&&(e=nr(e,this.array)),e}setW(t,e){return this.normalized&&(e=dn(e,this.array)),this.array[t*this.itemSize+3]=e,this}setXY(t,e,n){return t*=this.itemSize,this.normalized&&(e=dn(e,this.array),n=dn(n,this.array)),this.array[t+0]=e,this.array[t+1]=n,this}setXYZ(t,e,n,s){return t*=this.itemSize,this.normalized&&(e=dn(e,this.array),n=dn(n,this.array),s=dn(s,this.array)),this.array[t+0]=e,this.array[t+1]=n,this.array[t+2]=s,this}setXYZW(t,e,n,s,r){return t*=this.itemSize,this.normalized&&(e=dn(e,this.array),n=dn(n,this.array),s=dn(s,this.array),r=dn(r,this.array)),this.array[t+0]=e,this.array[t+1]=n,this.array[t+2]=s,this.array[t+3]=r,this}onUpload(t){return this.onUploadCallback=t,this}clone(){return new this.constructor(this.array,this.itemSize).copy(this)}toJSON(){let t={itemSize:this.itemSize,type:this.array.constructor.name,array:Array.from(this.array),normalized:this.normalized};return t.name=this.name,t.usage=this.usage,t.gpuType=this.gpuType,t}dispose(){this.dispatchEvent({type:"dispose"})}};var gr=class extends pn{constructor(t,e,n){super(new Uint16Array(t),e,n)}};var xr=class extends pn{constructor(t,e,n){super(new Uint32Array(t),e,n)}};var Oe=class extends pn{constructor(t,e,n){super(new Float32Array(t),e,n)}},Yd=new Kn,rr=new O,Vl=new O,ns=class{constructor(t=new O,e=-1){this.isSphere=!0,this.center=t,this.radius=e}set(t,e){return this.center.copy(t),this.radius=e,this}setFromPoints(t,e){let n=this.center;e!==void 0?n.copy(e):Yd.setFromPoints(t).getCenter(n);let s=0;for(let r=0,o=t.length;r<o;r++)s=Math.max(s,n.distanceToSquared(t[r]));return this.radius=Math.sqrt(s),this}copy(t){return this.center.copy(t.center),this.radius=t.radius,this}isEmpty(){return this.radius<0}makeEmpty(){return this.center.set(0,0,0),this.radius=-1,this}containsPoint(t){return t.distanceToSquared(this.center)<=this.radius*this.radius}distanceToPoint(t){return t.distanceTo(this.center)-this.radius}intersectsSphere(t){let e=this.radius+t.radius;return t.center.distanceToSquared(this.center)<=e*e}intersectsBox(t){return t.intersectsSphere(this)}intersectsPlane(t){return Math.abs(t.distanceToPoint(this.center))<=this.radius}clampPoint(t,e){let n=this.center.distanceToSquared(t);return e.copy(t),n>this.radius*this.radius&&(e.sub(this.center).normalize(),e.multiplyScalar(this.radius).add(this.center)),e}getBoundingBox(t){return this.isEmpty()?(t.makeEmpty(),t):(t.set(this.center,this.center),t.expandByScalar(this.radius),t)}applyMatrix4(t){return this.center.applyMatrix4(t),this.radius=this.radius*t.getMaxScaleOnAxis(),this}translate(t){return this.center.add(t),this}expandByPoint(t){if(this.isEmpty())return this.center.copy(t),this.radius=0,this;rr.subVectors(t,this.center);let e=rr.lengthSq();if(e>this.radius*this.radius){let n=Math.sqrt(e),s=(n-this.radius)*.5;this.center.addScaledVector(rr,s/n),this.radius+=s}return this}union(t){return t.isEmpty()?this:this.isEmpty()?(this.copy(t),this):(this.center.equals(t.center)===!0?this.radius=Math.max(this.radius,t.radius):(Vl.subVectors(t.center,this.center).setLength(t.radius),this.expandByPoint(rr.copy(t.center).add(Vl)),this.expandByPoint(rr.copy(t.center).sub(Vl))),this)}equals(t){return t.center.equals(this.center)&&t.radius===this.radius}clone(){return new this.constructor().copy(this)}toJSON(){return{radius:this.radius,center:this.center.toArray()}}fromJSON(t){return this.radius=t.radius,this.center.fromArray(t.center),this}},Zd=0,Rn=new Ee,Gl=new Ke,bs=new O,bn=new Kn,or=new Kn,Ye=new O,sn=class i extends $n{constructor(){super(),this.isBufferGeometry=!0,Object.defineProperty(this,"id",{value:Zd++}),this.uuid=qs(),this.name="",this.type="BufferGeometry",this.index=null,this.indirect=null,this.indirectOffset=0,this.attributes={},this.morphAttributes={},this.morphTargetsRelative=!1,this.groups=[],this.boundingBox=null,this.boundingSphere=null,this.drawRange={start:0,count:1/0},this.userData={},this._transformed=!1}getIndex(){return this.index}setIndex(t){return Array.isArray(t)?this.index=new(Dd(t)?xr:gr)(t,1):this.index=t,this}setIndirect(t,e=0){return this.indirect=t,this.indirectOffset=e,this}getIndirect(){return this.indirect}getAttribute(t){return this.attributes[t]}setAttribute(t,e){return this.attributes[t]=e,this}deleteAttribute(t){return delete this.attributes[t],this}hasAttribute(t){return this.attributes[t]!==void 0}addGroup(t,e,n=0){this.groups.push({start:t,count:e,materialIndex:n})}clearGroups(){this.groups=[]}setDrawRange(t,e){this.drawRange.start=t,this.drawRange.count=e}applyMatrix4(t){let e=this.attributes.position;e!==void 0&&(e.applyMatrix4(t),e.needsUpdate=!0);let n=this.attributes.normal;if(n!==void 0){let r=new ie().getNormalMatrix(t);n.applyNormalMatrix(r),n.needsUpdate=!0}let s=this.attributes.tangent;return s!==void 0&&(s.transformDirection(t),s.needsUpdate=!0),this.boundingBox!==null&&this.computeBoundingBox(),this.boundingSphere!==null&&this.computeBoundingSphere(),this._transformed=!0,this}applyQuaternion(t){return Rn.makeRotationFromQuaternion(t),this.applyMatrix4(Rn),this}rotateX(t){return Rn.makeRotationX(t),this.applyMatrix4(Rn),this}rotateY(t){return Rn.makeRotationY(t),this.applyMatrix4(Rn),this}rotateZ(t){return Rn.makeRotationZ(t),this.applyMatrix4(Rn),this}translate(t,e,n){return Rn.makeTranslation(t,e,n),this.applyMatrix4(Rn),this}scale(t,e,n){return Rn.makeScale(t,e,n),this.applyMatrix4(Rn),this}lookAt(t){return Gl.lookAt(t),Gl.updateMatrix(),this.applyMatrix4(Gl.matrix),this}center(){return this.computeBoundingBox(),this.boundingBox.getCenter(bs).negate(),this.translate(bs.x,bs.y,bs.z),this}setFromPoints(t){let e=this.getAttribute("position");if(e===void 0){let n=[];for(let s=0,r=t.length;s<r;s++){let o=t[s];n.push(o.x,o.y,o.z||0)}this.setAttribute("position",new Oe(n,3))}else{let n=Math.min(t.length,e.count);for(let s=0;s<n;s++){let r=t[s];e.setXYZ(s,r.x,r.y,r.z||0)}t.length>e.count&&Jt("BufferGeometry: Buffer size too small for points data. Use .dispose() and create a new geometry."),e.needsUpdate=!0}return this}computeBoundingBox(){this.boundingBox===null&&(this.boundingBox=new Kn);let t=this.attributes.position,e=this.morphAttributes.position;if(t&&t.isGLBufferAttribute){jt("BufferGeometry.computeBoundingBox(): GLBufferAttribute requires a manual bounding box.",this),this.boundingBox.set(new O(-1/0,-1/0,-1/0),new O(1/0,1/0,1/0));return}if(t!==void 0){if(this.boundingBox.setFromBufferAttribute(t),e)for(let n=0,s=e.length;n<s;n++){let r=e[n];bn.setFromBufferAttribute(r),this.morphTargetsRelative?(Ye.addVectors(this.boundingBox.min,bn.min),this.boundingBox.expandByPoint(Ye),Ye.addVectors(this.boundingBox.max,bn.max),this.boundingBox.expandByPoint(Ye)):(this.boundingBox.expandByPoint(bn.min),this.boundingBox.expandByPoint(bn.max))}}else this.boundingBox.makeEmpty();(isNaN(this.boundingBox.min.x)||isNaN(this.boundingBox.min.y)||isNaN(this.boundingBox.min.z))&&jt('BufferGeometry.computeBoundingBox(): Computed min/max have NaN values. The "position" attribute is likely to have NaN values.',this)}computeBoundingSphere(){this.boundingSphere===null&&(this.boundingSphere=new ns);let t=this.attributes.position,e=this.morphAttributes.position;if(t&&t.isGLBufferAttribute){jt("BufferGeometry.computeBoundingSphere(): GLBufferAttribute requires a manual bounding sphere.",this),this.boundingSphere.set(new O,1/0);return}if(t){let n=this.boundingSphere.center;if(bn.setFromBufferAttribute(t),e)for(let r=0,o=e.length;r<o;r++){let a=e[r];or.setFromBufferAttribute(a),this.morphTargetsRelative?(Ye.addVectors(bn.min,or.min),bn.expandByPoint(Ye),Ye.addVectors(bn.max,or.max),bn.expandByPoint(Ye)):(bn.expandByPoint(or.min),bn.expandByPoint(or.max))}bn.getCenter(n);let s=0;for(let r=0,o=t.count;r<o;r++)Ye.fromBufferAttribute(t,r),s=Math.max(s,n.distanceToSquared(Ye));if(e)for(let r=0,o=e.length;r<o;r++){let a=e[r],l=this.morphTargetsRelative;for(let c=0,h=a.count;c<h;c++)Ye.fromBufferAttribute(a,c),l&&(bs.fromBufferAttribute(t,c),Ye.add(bs)),s=Math.max(s,n.distanceToSquared(Ye))}this.boundingSphere.radius=Math.sqrt(s),isNaN(this.boundingSphere.radius)&&jt('BufferGeometry.computeBoundingSphere(): Computed radius is NaN. The "position" attribute is likely to have NaN values.',this)}}computeTangents(){let t=this.index,e=this.attributes;if(t===null||e.position===void 0||e.normal===void 0||e.uv===void 0){jt("BufferGeometry: .computeTangents() failed. Missing required attributes (index, position, normal or uv)");return}let n=e.position,s=e.normal,r=e.uv,o=this.getAttribute("tangent");(o===void 0||o.count!==n.count)&&(o=new pn(new Float32Array(4*n.count),4),this.setAttribute("tangent",o));let a=[],l=[];for(let _=0;_<n.count;_++)a[_]=new O,l[_]=new O;let c=new O,h=new O,f=new O,u=new xt,d=new xt,g=new xt,M=new O,m=new O;function p(_,w,L){c.fromBufferAttribute(n,_),h.fromBufferAttribute(n,w),f.fromBufferAttribute(n,L),u.fromBufferAttribute(r,_),d.fromBufferAttribute(r,w),g.fromBufferAttribute(r,L),h.sub(c),f.sub(c),d.sub(u),g.sub(u);let D=1/(d.x*g.y-g.x*d.y);isFinite(D)&&(M.copy(h).multiplyScalar(g.y).addScaledVector(f,-d.y).multiplyScalar(D),m.copy(f).multiplyScalar(d.x).addScaledVector(h,-g.x).multiplyScalar(D),a[_].add(M),a[w].add(M),a[L].add(M),l[_].add(m),l[w].add(m),l[L].add(m))}let T=this.groups;T.length===0&&(T=[{start:0,count:t.count}]);for(let _=0,w=T.length;_<w;++_){let L=T[_],D=L.start,B=L.count;for(let G=D,N=D+B;G<N;G+=3)p(t.getX(G+0),t.getX(G+1),t.getX(G+2))}let P=new O,S=new O,A=new O,b=new O;function R(_){A.fromBufferAttribute(s,_),b.copy(A);let w=a[_];P.copy(w),P.sub(A.multiplyScalar(A.dot(w))).normalize(),S.crossVectors(b,w);let D=S.dot(l[_])<0?-1:1;o.setXYZW(_,P.x,P.y,P.z,D)}for(let _=0,w=T.length;_<w;++_){let L=T[_],D=L.start,B=L.count;for(let G=D,N=D+B;G<N;G+=3)R(t.getX(G+0)),R(t.getX(G+1)),R(t.getX(G+2))}this._transformed=!0}computeVertexNormals(){let t=this.index,e=this.getAttribute("position");if(e!==void 0){let n=this.getAttribute("normal");if(n===void 0||n.count!==e.count)n=new pn(new Float32Array(e.count*3),3),this.setAttribute("normal",n);else for(let u=0,d=n.count;u<d;u++)n.setXYZ(u,0,0,0);let s=new O,r=new O,o=new O,a=new O,l=new O,c=new O,h=new O,f=new O;if(t)for(let u=0,d=t.count;u<d;u+=3){let g=t.getX(u+0),M=t.getX(u+1),m=t.getX(u+2);s.fromBufferAttribute(e,g),r.fromBufferAttribute(e,M),o.fromBufferAttribute(e,m),h.subVectors(o,r),f.subVectors(s,r),h.cross(f),a.fromBufferAttribute(n,g),l.fromBufferAttribute(n,M),c.fromBufferAttribute(n,m),a.add(h),l.add(h),c.add(h),n.setXYZ(g,a.x,a.y,a.z),n.setXYZ(M,l.x,l.y,l.z),n.setXYZ(m,c.x,c.y,c.z)}else for(let u=0,d=e.count;u<d;u+=3)s.fromBufferAttribute(e,u+0),r.fromBufferAttribute(e,u+1),o.fromBufferAttribute(e,u+2),h.subVectors(o,r),f.subVectors(s,r),h.cross(f),n.setXYZ(u+0,h.x,h.y,h.z),n.setXYZ(u+1,h.x,h.y,h.z),n.setXYZ(u+2,h.x,h.y,h.z);this.normalizeNormals(),n.needsUpdate=!0}}normalizeNormals(){let t=this.attributes.normal;for(let e=0,n=t.count;e<n;e++)Ye.fromBufferAttribute(t,e),Ye.normalize(),t.setXYZ(e,Ye.x,Ye.y,Ye.z)}toNonIndexed(){function t(a,l){let c=a.array,h=a.itemSize,f=a.normalized,u=new c.constructor(l.length*h),d=0,g=0;for(let M=0,m=l.length;M<m;M++){a.isInterleavedBufferAttribute?d=l[M]*a.data.stride+a.offset:d=l[M]*h;for(let p=0;p<h;p++)u[g++]=c[d++]}return new pn(u,h,f)}if(this.index===null)return Jt("BufferGeometry.toNonIndexed(): BufferGeometry is already non-indexed."),this;let e=new i,n=this.index.array,s=this.attributes;for(let a in s){let l=s[a],c=t(l,n);e.setAttribute(a,c)}let r=this.morphAttributes;for(let a in r){let l=[],c=r[a];for(let h=0,f=c.length;h<f;h++){let u=c[h],d=t(u,n);l.push(d)}e.morphAttributes[a]=l}e.morphTargetsRelative=this.morphTargetsRelative;let o=this.groups;for(let a=0,l=o.length;a<l;a++){let c=o[a];e.addGroup(c.start,c.count,c.materialIndex)}return e}toJSON(){let t={metadata:{version:4.7,type:"BufferGeometry",generator:"BufferGeometry.toJSON"}};if(t.uuid=this.uuid,t.type=this.parameters!==void 0&&this._transformed===!0?"BufferGeometry":this.type,t.name=this.name,Object.keys(this.userData).length>0&&(t.userData=this.userData),this.parameters!==void 0&&this._transformed!==!0){let l=this.parameters;for(let c in l)l[c]!==void 0&&(t[c]=l[c]);return t}t.data={attributes:{}};let e=this.index;e!==null&&(t.data.index={type:e.array.constructor.name,array:Array.prototype.slice.call(e.array)});let n=this.attributes;for(let l in n){let c=n[l];t.data.attributes[l]=c.toJSON(t.data)}let s={},r=!1;for(let l in this.morphAttributes){let c=this.morphAttributes[l],h=[];for(let f=0,u=c.length;f<u;f++){let d=c[f];h.push(d.toJSON(t.data))}h.length>0&&(s[l]=h,r=!0)}r&&(t.data.morphAttributes=s,t.data.morphTargetsRelative=this.morphTargetsRelative);let o=this.groups;o.length>0&&(t.data.groups=JSON.parse(JSON.stringify(o)));let a=this.boundingSphere;return a!==null&&(t.data.boundingSphere=a.toJSON()),t}clone(){return new this.constructor().copy(this)}copy(t){this.index=null,this.attributes={},this.morphAttributes={},this.groups=[],this.boundingBox=null,this.boundingSphere=null;let e={};this.name=t.name;let n=t.index;n!==null&&this.setIndex(n.clone());let s=t.attributes;for(let c in s){let h=s[c];this.setAttribute(c,h.clone(e))}let r=t.morphAttributes;for(let c in r){let h=[],f=r[c];for(let u=0,d=f.length;u<d;u++)h.push(f[u].clone(e));this.morphAttributes[c]=h}this.morphTargetsRelative=t.morphTargetsRelative;let o=t.groups;for(let c=0,h=o.length;c<h;c++){let f=o[c];this.addGroup(f.start,f.count,f.materialIndex)}let a=t.boundingBox;a!==null&&(this.boundingBox=a.clone());let l=t.boundingSphere;return l!==null&&(this.boundingSphere=l.clone()),this.drawRange.start=t.drawRange.start,this.drawRange.count=t.drawRange.count,this.userData=t.userData,this._transformed=t._transformed,this}dispose(){this.dispatchEvent({type:"dispose"})}};var Hl=new O,$d=new O,Jd=new ie,Bn=class{constructor(t=new O(1,0,0),e=0){this.isPlane=!0,this.normal=t,this.constant=e}set(t,e){return this.normal.copy(t),this.constant=e,this}setComponents(t,e,n,s){return this.normal.set(t,e,n),this.constant=s,this}setFromNormalAndCoplanarPoint(t,e){return this.normal.copy(t),this.constant=-e.dot(this.normal),this}setFromCoplanarPoints(t,e,n){let s=Hl.subVectors(n,e).cross($d.subVectors(t,e)).normalize();return this.setFromNormalAndCoplanarPoint(s,t),this}copy(t){return this.normal.copy(t.normal),this.constant=t.constant,this}normalize(){let t=1/this.normal.length();return this.normal.multiplyScalar(t),this.constant*=t,this}negate(){return this.constant*=-1,this.normal.negate(),this}distanceToPoint(t){return this.normal.dot(t)+this.constant}distanceToSphere(t){return this.distanceToPoint(t.center)-t.radius}projectPoint(t,e){return e.copy(t).addScaledVector(this.normal,-this.distanceToPoint(t))}intersectLine(t,e,n=!0){let s=t.delta(Hl),r=this.normal.dot(s);if(r===0)return this.distanceToPoint(t.start)===0?e.copy(t.start):null;let o=-(t.start.dot(this.normal)+this.constant)/r;return n===!0&&(o<0||o>1)?null:e.copy(t.start).addScaledVector(s,o)}intersectsLine(t){let e=this.distanceToPoint(t.start),n=this.distanceToPoint(t.end);return e<0&&n>0||n<0&&e>0}intersectsBox(t){return t.intersectsPlane(this)}intersectsSphere(t){return t.intersectsPlane(this)}coplanarPoint(t){return t.copy(this.normal).multiplyScalar(-this.constant)}applyMatrix4(t,e){let n=e||Jd.getNormalMatrix(t),s=this.coplanarPoint(Hl).applyMatrix4(t),r=this.normal.applyMatrix3(n).normalize();return this.constant=-s.dot(r),this}translate(t){return this.constant-=t.dot(this.normal),this}equals(t){return t.normal.equals(this.normal)&&t.constant===this.constant}clone(){return new this.constructor().copy(this)}toJSON(){return{normal:this.normal.toArray(),constant:this.constant}}fromJSON(t){return this.normal.fromArray(t.normal),this.constant=t.constant,this}},Kd=0,jn=class extends $n{constructor(){super(),this.isMaterial=!0,Object.defineProperty(this,"id",{value:Kd++}),this.uuid=qs(),this.name="",this.type="Material",this.blending=Hs,this.side=Bi,this.vertexColors=!1,this.opacity=1,this.transparent=!1,this.alphaHash=!1,this.blendSrc=mc,this.blendDst=gc,this.blendEquation=os,this.blendSrcAlpha=null,this.blendDstAlpha=null,this.blendEquationAlpha=null,this.blendColor=new se(0,0,0),this.blendAlpha=0,this.depthFunc=Cs,this.depthTest=!0,this.depthWrite=!0,this.stencilWriteMask=255,this.stencilFunc=sl,this.stencilRef=0,this.stencilFuncMask=255,this.stencilFail=Co,this.stencilZFail=Co,this.stencilZPass=Co,this.stencilWrite=!1,this.clippingPlanes=null,this.clipIntersection=!1,this.clipShadows=!1,this.shadowSide=null,this.colorWrite=!0,this.precision=null,this.polygonOffset=!1,this.polygonOffsetFactor=0,this.polygonOffsetUnits=0,this.dithering=!1,this.alphaToCoverage=!1,this.premultipliedAlpha=!1,this.forceSinglePass=!1,this.allowOverride=!0,this.visible=!0,this.toneMapped=!0,this.userData={},this.version=0,this._alphaTest=0}get alphaTest(){return this._alphaTest}set alphaTest(t){this._alphaTest>0!=t>0&&this.version++,this._alphaTest=t}onBeforeRender(){}onBeforeCompile(){}customProgramCacheKey(){return this.onBeforeCompile.toString()}setValues(t){if(t!==void 0)for(let e in t){let n=t[e];if(n===void 0){Jt(`Material: parameter '${e}' has value of undefined.`);continue}let s=this[e];if(s===void 0){Jt(`Material: '${e}' is not a property of THREE.${this.type}.`);continue}s&&s.isColor?s.set(n):s&&s.isVector2&&n&&n.isVector2||s&&s.isEuler&&n&&n.isEuler||s&&s.isVector3&&n&&n.isVector3?s.copy(n):this[e]=n}}toJSON(t){let e=t===void 0||typeof t=="string";e&&(t={textures:{},images:{}});let n={metadata:{version:4.7,type:"Material",generator:"Material.toJSON"}};n.uuid=this.uuid,n.type=this.type,n.blending=this.blending,n.side=this.side,n.shadowSide=this.shadowSide,n.vertexColors=this.vertexColors,n.opacity=this.opacity,n.transparent=this.transparent,n.blendSrc=this.blendSrc,n.blendDst=this.blendDst,n.blendEquation=this.blendEquation,n.blendSrcAlpha=this.blendSrcAlpha,n.blendDstAlpha=this.blendDstAlpha,n.blendEquationAlpha=this.blendEquationAlpha,n.blendColor=this.blendColor.getHex(),n.blendAlpha=this.blendAlpha,n.depthFunc=this.depthFunc,n.depthTest=this.depthTest,n.depthWrite=this.depthWrite,n.colorWrite=this.colorWrite,n.clipIntersection=this.clipIntersection,n.clipShadows=this.clipShadows,n.stencilWriteMask=this.stencilWriteMask,n.stencilFunc=this.stencilFunc,n.stencilRef=this.stencilRef,n.stencilFuncMask=this.stencilFuncMask,n.stencilFail=this.stencilFail,n.stencilZFail=this.stencilZFail,n.stencilZPass=this.stencilZPass,n.stencilWrite=this.stencilWrite,n.polygonOffset=this.polygonOffset,n.polygonOffsetFactor=this.polygonOffsetFactor,n.polygonOffsetUnits=this.polygonOffsetUnits,n.dithering=this.dithering,n.alphaTest=this.alphaTest,n.alphaHash=this.alphaHash,n.alphaToCoverage=this.alphaToCoverage,n.premultipliedAlpha=this.premultipliedAlpha,n.forceSinglePass=this.forceSinglePass,n.allowOverride=this.allowOverride,n.visible=this.visible,n.toneMapped=this.toneMapped,n.name=this.name,this.color&&this.color.isColor&&(n.color=this.color.getHex()),this.roughness!==void 0&&(n.roughness=this.roughness),this.metalness!==void 0&&(n.metalness=this.metalness),this.sheen!==void 0&&(n.sheen=this.sheen),this.sheenColor&&this.sheenColor.isColor&&(n.sheenColor=this.sheenColor.getHex()),this.sheenRoughness!==void 0&&(n.sheenRoughness=this.sheenRoughness),this.emissive&&this.emissive.isColor&&(n.emissive=this.emissive.getHex()),this.emissiveIntensity!==void 0&&(n.emissiveIntensity=this.emissiveIntensity),this.specular&&this.specular.isColor&&(n.specular=this.specular.getHex()),this.specularIntensity!==void 0&&(n.specularIntensity=this.specularIntensity),this.specularColor&&this.specularColor.isColor&&(n.specularColor=this.specularColor.getHex()),this.shininess!==void 0&&(n.shininess=this.shininess),this.clearcoat!==void 0&&(n.clearcoat=this.clearcoat),this.clearcoatRoughness!==void 0&&(n.clearcoatRoughness=this.clearcoatRoughness),this.clearcoatMap&&this.clearcoatMap.isTexture&&(n.clearcoatMap=this.clearcoatMap.toJSON(t).uuid),this.clearcoatRoughnessMap&&this.clearcoatRoughnessMap.isTexture&&(n.clearcoatRoughnessMap=this.clearcoatRoughnessMap.toJSON(t).uuid),this.clearcoatNormalMap&&this.clearcoatNormalMap.isTexture&&(n.clearcoatNormalMap=this.clearcoatNormalMap.toJSON(t).uuid,n.clearcoatNormalScale=this.clearcoatNormalScale.toArray()),this.sheenColorMap&&this.sheenColorMap.isTexture&&(n.sheenColorMap=this.sheenColorMap.toJSON(t).uuid),this.sheenRoughnessMap&&this.sheenRoughnessMap.isTexture&&(n.sheenRoughnessMap=this.sheenRoughnessMap.toJSON(t).uuid),this.dispersion!==void 0&&(n.dispersion=this.dispersion),this.retroreflectivity!==void 0&&(n.retroreflectivity=this.retroreflectivity),this.iridescence!==void 0&&(n.iridescence=this.iridescence),this.iridescenceIOR!==void 0&&(n.iridescenceIOR=this.iridescenceIOR),this.iridescenceThicknessRange!==void 0&&(n.iridescenceThicknessRange=this.iridescenceThicknessRange),this.iridescenceMap&&this.iridescenceMap.isTexture&&(n.iridescenceMap=this.iridescenceMap.toJSON(t).uuid),this.iridescenceThicknessMap&&this.iridescenceThicknessMap.isTexture&&(n.iridescenceThicknessMap=this.iridescenceThicknessMap.toJSON(t).uuid),this.anisotropy!==void 0&&(n.anisotropy=this.anisotropy),this.anisotropyRotation!==void 0&&(n.anisotropyRotation=this.anisotropyRotation),this.anisotropyMap&&this.anisotropyMap.isTexture&&(n.anisotropyMap=this.anisotropyMap.toJSON(t).uuid),this.map&&this.map.isTexture&&(n.map=this.map.toJSON(t).uuid),this.matcap&&this.matcap.isTexture&&(n.matcap=this.matcap.toJSON(t).uuid),this.alphaMap&&this.alphaMap.isTexture&&(n.alphaMap=this.alphaMap.toJSON(t).uuid),this.lightMap&&this.lightMap.isTexture&&(n.lightMap=this.lightMap.toJSON(t).uuid,n.lightMapIntensity=this.lightMapIntensity),this.aoMap&&this.aoMap.isTexture&&(n.aoMap=this.aoMap.toJSON(t).uuid,n.aoMapIntensity=this.aoMapIntensity),this.bumpMap&&this.bumpMap.isTexture&&(n.bumpMap=this.bumpMap.toJSON(t).uuid,n.bumpScale=this.bumpScale),this.normalMap&&this.normalMap.isTexture&&(n.normalMap=this.normalMap.toJSON(t).uuid,n.normalMapType=this.normalMapType,n.normalScale=this.normalScale.toArray()),this.displacementMap&&this.displacementMap.isTexture&&(n.displacementMap=this.displacementMap.toJSON(t).uuid,n.displacementScale=this.displacementScale,n.displacementBias=this.displacementBias),this.roughnessMap&&this.roughnessMap.isTexture&&(n.roughnessMap=this.roughnessMap.toJSON(t).uuid),this.metalnessMap&&this.metalnessMap.isTexture&&(n.metalnessMap=this.metalnessMap.toJSON(t).uuid),this.emissiveMap&&this.emissiveMap.isTexture&&(n.emissiveMap=this.emissiveMap.toJSON(t).uuid),this.specularMap&&this.specularMap.isTexture&&(n.specularMap=this.specularMap.toJSON(t).uuid),this.specularIntensityMap&&this.specularIntensityMap.isTexture&&(n.specularIntensityMap=this.specularIntensityMap.toJSON(t).uuid),this.specularColorMap&&this.specularColorMap.isTexture&&(n.specularColorMap=this.specularColorMap.toJSON(t).uuid),this.envMap&&this.envMap.isTexture&&(n.envMap=this.envMap.toJSON(t).uuid,this.combine!==void 0&&(n.combine=this.combine)),this.envMapRotation!==void 0&&(n.envMapRotation=this.envMapRotation.toArray()),this.envMapIntensity!==void 0&&(n.envMapIntensity=this.envMapIntensity),this.reflectivity!==void 0&&(n.reflectivity=this.reflectivity),this.refractionRatio!==void 0&&(n.refractionRatio=this.refractionRatio),this.gradientMap&&this.gradientMap.isTexture&&(n.gradientMap=this.gradientMap.toJSON(t).uuid),this.transmission!==void 0&&(n.transmission=this.transmission),this.transmissionMap&&this.transmissionMap.isTexture&&(n.transmissionMap=this.transmissionMap.toJSON(t).uuid),this.thickness!==void 0&&(n.thickness=this.thickness),this.thicknessMap&&this.thicknessMap.isTexture&&(n.thicknessMap=this.thicknessMap.toJSON(t).uuid),this.attenuationDistance!==void 0&&(n.attenuationDistance=this.attenuationDistance),this.attenuationColor!==void 0&&(n.attenuationColor=this.attenuationColor.getHex()),this.size!==void 0&&(n.size=this.size),this.sizeAttenuation!==void 0&&(n.sizeAttenuation=this.sizeAttenuation),Array.isArray(this.clippingPlanes)&&this.clippingPlanes.length>0&&(n.clippingPlanes=this.clippingPlanes.map(r=>r.toJSON())),this.rotation!==void 0&&(n.rotation=this.rotation),this.depthPacking!==void 0&&(n.depthPacking=this.depthPacking),this.linewidth!==void 0&&(n.linewidth=this.linewidth),this.linecap!==void 0&&(n.linecap=this.linecap),this.linejoin!==void 0&&(n.linejoin=this.linejoin),this.dashSize!==void 0&&(n.dashSize=this.dashSize),this.gapSize!==void 0&&(n.gapSize=this.gapSize),this.scale!==void 0&&(n.scale=this.scale),this.wireframe!==void 0&&(n.wireframe=this.wireframe),this.wireframeLinewidth!==void 0&&(n.wireframeLinewidth=this.wireframeLinewidth),this.wireframeLinecap!==void 0&&(n.wireframeLinecap=this.wireframeLinecap),this.wireframeLinejoin!==void 0&&(n.wireframeLinejoin=this.wireframeLinejoin),this.flatShading!==void 0&&(n.flatShading=this.flatShading),this.fog!==void 0&&(n.fog=this.fog),Object.keys(this.userData).length>0&&(n.userData=this.userData);function s(r){let o=[];for(let a in r){let l=r[a];delete l.metadata,o.push(l)}return o}if(e){let r=s(t.textures),o=s(t.images);r.length>0&&(n.textures=r),o.length>0&&(n.images=o)}return n}fromJSON(t,e){if(t.uuid!==void 0&&(this.uuid=t.uuid),t.name!==void 0&&(this.name=t.name),t.color!==void 0&&this.color!==void 0&&this.color.setHex(t.color),t.roughness!==void 0&&(this.roughness=t.roughness),t.metalness!==void 0&&(this.metalness=t.metalness),t.sheen!==void 0&&(this.sheen=t.sheen),t.sheenColor!==void 0&&(this.sheenColor=new se().setHex(t.sheenColor)),t.sheenRoughness!==void 0&&(this.sheenRoughness=t.sheenRoughness),t.emissive!==void 0&&this.emissive!==void 0&&this.emissive.setHex(t.emissive),t.specular!==void 0&&this.specular!==void 0&&this.specular.setHex(t.specular),t.specularIntensity!==void 0&&(this.specularIntensity=t.specularIntensity),t.specularColor!==void 0&&this.specularColor!==void 0&&this.specularColor.setHex(t.specularColor),t.shininess!==void 0&&(this.shininess=t.shininess),t.clearcoat!==void 0&&(this.clearcoat=t.clearcoat),t.clearcoatRoughness!==void 0&&(this.clearcoatRoughness=t.clearcoatRoughness),t.dispersion!==void 0&&(this.dispersion=t.dispersion),t.retroreflectivity!==void 0&&(this.retroreflectivity=t.retroreflectivity),t.iridescence!==void 0&&(this.iridescence=t.iridescence),t.iridescenceIOR!==void 0&&(this.iridescenceIOR=t.iridescenceIOR),t.iridescenceThicknessRange!==void 0&&(this.iridescenceThicknessRange=t.iridescenceThicknessRange),t.transmission!==void 0&&(this.transmission=t.transmission),t.thickness!==void 0&&(this.thickness=t.thickness),t.attenuationDistance!==void 0&&(this.attenuationDistance=t.attenuationDistance),t.attenuationColor!==void 0&&this.attenuationColor!==void 0&&this.attenuationColor.setHex(t.attenuationColor),t.anisotropy!==void 0&&(this.anisotropy=t.anisotropy),t.anisotropyRotation!==void 0&&(this.anisotropyRotation=t.anisotropyRotation),t.fog!==void 0&&(this.fog=t.fog),t.flatShading!==void 0&&(this.flatShading=t.flatShading),t.blending!==void 0&&(this.blending=t.blending),t.combine!==void 0&&(this.combine=t.combine),t.side!==void 0&&(this.side=t.side),t.shadowSide!==void 0&&(this.shadowSide=t.shadowSide),t.opacity!==void 0&&(this.opacity=t.opacity),t.transparent!==void 0&&(this.transparent=t.transparent),t.alphaTest!==void 0&&(this.alphaTest=t.alphaTest),t.alphaHash!==void 0&&(this.alphaHash=t.alphaHash),t.depthFunc!==void 0&&(this.depthFunc=t.depthFunc),t.depthTest!==void 0&&(this.depthTest=t.depthTest),t.depthWrite!==void 0&&(this.depthWrite=t.depthWrite),t.colorWrite!==void 0&&(this.colorWrite=t.colorWrite),t.clippingPlanes!==void 0&&(this.clippingPlanes=t.clippingPlanes.map(n=>new Bn().fromJSON(n))),t.clipIntersection!==void 0&&(this.clipIntersection=t.clipIntersection),t.clipShadows!==void 0&&(this.clipShadows=t.clipShadows),t.depthPacking!==void 0&&(this.depthPacking=t.depthPacking),t.blendSrc!==void 0&&(this.blendSrc=t.blendSrc),t.blendDst!==void 0&&(this.blendDst=t.blendDst),t.blendEquation!==void 0&&(this.blendEquation=t.blendEquation),t.blendSrcAlpha!==void 0&&(this.blendSrcAlpha=t.blendSrcAlpha),t.blendDstAlpha!==void 0&&(this.blendDstAlpha=t.blendDstAlpha),t.blendEquationAlpha!==void 0&&(this.blendEquationAlpha=t.blendEquationAlpha),t.blendColor!==void 0&&this.blendColor!==void 0&&this.blendColor.setHex(t.blendColor),t.blendAlpha!==void 0&&(this.blendAlpha=t.blendAlpha),t.stencilWriteMask!==void 0&&(this.stencilWriteMask=t.stencilWriteMask),t.stencilFunc!==void 0&&(this.stencilFunc=t.stencilFunc),t.stencilRef!==void 0&&(this.stencilRef=t.stencilRef),t.stencilFuncMask!==void 0&&(this.stencilFuncMask=t.stencilFuncMask),t.stencilFail!==void 0&&(this.stencilFail=t.stencilFail),t.stencilZFail!==void 0&&(this.stencilZFail=t.stencilZFail),t.stencilZPass!==void 0&&(this.stencilZPass=t.stencilZPass),t.stencilWrite!==void 0&&(this.stencilWrite=t.stencilWrite),t.wireframe!==void 0&&(this.wireframe=t.wireframe),t.wireframeLinewidth!==void 0&&(this.wireframeLinewidth=t.wireframeLinewidth),t.wireframeLinecap!==void 0&&(this.wireframeLinecap=t.wireframeLinecap),t.wireframeLinejoin!==void 0&&(this.wireframeLinejoin=t.wireframeLinejoin),t.rotation!==void 0&&(this.rotation=t.rotation),t.linewidth!==void 0&&(this.linewidth=t.linewidth),t.linecap!==void 0&&(this.linecap=t.linecap),t.linejoin!==void 0&&(this.linejoin=t.linejoin),t.dashSize!==void 0&&(this.dashSize=t.dashSize),t.gapSize!==void 0&&(this.gapSize=t.gapSize),t.scale!==void 0&&(this.scale=t.scale),t.polygonOffset!==void 0&&(this.polygonOffset=t.polygonOffset),t.polygonOffsetFactor!==void 0&&(this.polygonOffsetFactor=t.polygonOffsetFactor),t.polygonOffsetUnits!==void 0&&(this.polygonOffsetUnits=t.polygonOffsetUnits),t.dithering!==void 0&&(this.dithering=t.dithering),t.alphaToCoverage!==void 0&&(this.alphaToCoverage=t.alphaToCoverage),t.premultipliedAlpha!==void 0&&(this.premultipliedAlpha=t.premultipliedAlpha),t.forceSinglePass!==void 0&&(this.forceSinglePass=t.forceSinglePass),t.allowOverride!==void 0&&(this.allowOverride=t.allowOverride),t.visible!==void 0&&(this.visible=t.visible),t.toneMapped!==void 0&&(this.toneMapped=t.toneMapped),t.userData!==void 0&&(this.userData=t.userData),t.vertexColors!==void 0&&(typeof t.vertexColors=="number"?this.vertexColors=t.vertexColors>0:this.vertexColors=t.vertexColors),t.size!==void 0&&(this.size=t.size),t.sizeAttenuation!==void 0&&(this.sizeAttenuation=t.sizeAttenuation),t.map!==void 0&&(this.map=e[t.map]||null),t.matcap!==void 0&&(this.matcap=e[t.matcap]||null),t.alphaMap!==void 0&&(this.alphaMap=e[t.alphaMap]||null),t.bumpMap!==void 0&&(this.bumpMap=e[t.bumpMap]||null),t.bumpScale!==void 0&&(this.bumpScale=t.bumpScale),t.normalMap!==void 0&&(this.normalMap=e[t.normalMap]||null),t.normalMapType!==void 0&&(this.normalMapType=t.normalMapType),t.normalScale!==void 0){let n=t.normalScale;Array.isArray(n)===!1&&(n=[n,n]),this.normalScale=new xt().fromArray(n)}return t.displacementMap!==void 0&&(this.displacementMap=e[t.displacementMap]||null),t.displacementScale!==void 0&&(this.displacementScale=t.displacementScale),t.displacementBias!==void 0&&(this.displacementBias=t.displacementBias),t.roughnessMap!==void 0&&(this.roughnessMap=e[t.roughnessMap]||null),t.metalnessMap!==void 0&&(this.metalnessMap=e[t.metalnessMap]||null),t.emissiveMap!==void 0&&(this.emissiveMap=e[t.emissiveMap]||null),t.emissiveIntensity!==void 0&&(this.emissiveIntensity=t.emissiveIntensity),t.specularMap!==void 0&&(this.specularMap=e[t.specularMap]||null),t.specularIntensityMap!==void 0&&(this.specularIntensityMap=e[t.specularIntensityMap]||null),t.specularColorMap!==void 0&&(this.specularColorMap=e[t.specularColorMap]||null),t.envMap!==void 0&&(this.envMap=e[t.envMap]||null),t.envMapRotation!==void 0&&this.envMapRotation.fromArray(t.envMapRotation),t.envMapIntensity!==void 0&&(this.envMapIntensity=t.envMapIntensity),t.reflectivity!==void 0&&(this.reflectivity=t.reflectivity),t.refractionRatio!==void 0&&(this.refractionRatio=t.refractionRatio),t.lightMap!==void 0&&(this.lightMap=e[t.lightMap]||null),t.lightMapIntensity!==void 0&&(this.lightMapIntensity=t.lightMapIntensity),t.aoMap!==void 0&&(this.aoMap=e[t.aoMap]||null),t.aoMapIntensity!==void 0&&(this.aoMapIntensity=t.aoMapIntensity),t.gradientMap!==void 0&&(this.gradientMap=e[t.gradientMap]||null),t.clearcoatMap!==void 0&&(this.clearcoatMap=e[t.clearcoatMap]||null),t.clearcoatRoughnessMap!==void 0&&(this.clearcoatRoughnessMap=e[t.clearcoatRoughnessMap]||null),t.clearcoatNormalMap!==void 0&&(this.clearcoatNormalMap=e[t.clearcoatNormalMap]||null),t.clearcoatNormalScale!==void 0&&(this.clearcoatNormalScale=new xt().fromArray(t.clearcoatNormalScale)),t.iridescenceMap!==void 0&&(this.iridescenceMap=e[t.iridescenceMap]||null),t.iridescenceThicknessMap!==void 0&&(this.iridescenceThicknessMap=e[t.iridescenceThicknessMap]||null),t.transmissionMap!==void 0&&(this.transmissionMap=e[t.transmissionMap]||null),t.thicknessMap!==void 0&&(this.thicknessMap=e[t.thicknessMap]||null),t.anisotropyMap!==void 0&&(this.anisotropyMap=e[t.anisotropyMap]||null),t.sheenColorMap!==void 0&&(this.sheenColorMap=e[t.sheenColorMap]||null),t.sheenRoughnessMap!==void 0&&(this.sheenRoughnessMap=e[t.sheenRoughnessMap]||null),this}clone(){return new this.constructor().copy(this)}copy(t){this.name=t.name,this.blending=t.blending,this.side=t.side,this.vertexColors=t.vertexColors,this.opacity=t.opacity,this.transparent=t.transparent,this.blendSrc=t.blendSrc,this.blendDst=t.blendDst,this.blendEquation=t.blendEquation,this.blendSrcAlpha=t.blendSrcAlpha,this.blendDstAlpha=t.blendDstAlpha,this.blendEquationAlpha=t.blendEquationAlpha,this.blendColor.copy(t.blendColor),this.blendAlpha=t.blendAlpha,this.depthFunc=t.depthFunc,this.depthTest=t.depthTest,this.depthWrite=t.depthWrite,this.stencilWriteMask=t.stencilWriteMask,this.stencilFunc=t.stencilFunc,this.stencilRef=t.stencilRef,this.stencilFuncMask=t.stencilFuncMask,this.stencilFail=t.stencilFail,this.stencilZFail=t.stencilZFail,this.stencilZPass=t.stencilZPass,this.stencilWrite=t.stencilWrite;let e=t.clippingPlanes,n=null;if(e!==null){let s=e.length;n=new Array(s);for(let r=0;r!==s;++r)n[r]=e[r].clone()}return this.clippingPlanes=n,this.clipIntersection=t.clipIntersection,this.clipShadows=t.clipShadows,this.shadowSide=t.shadowSide,this.colorWrite=t.colorWrite,this.precision=t.precision,this.polygonOffset=t.polygonOffset,this.polygonOffsetFactor=t.polygonOffsetFactor,this.polygonOffsetUnits=t.polygonOffsetUnits,this.dithering=t.dithering,this.alphaTest=t.alphaTest,this.alphaHash=t.alphaHash,this.alphaToCoverage=t.alphaToCoverage,this.premultipliedAlpha=t.premultipliedAlpha,this.forceSinglePass=t.forceSinglePass,this.allowOverride=t.allowOverride,this.visible=t.visible,this.toneMapped=t.toneMapped,this.userData=JSON.parse(JSON.stringify(t.userData)),this}dispose(){this.dispatchEvent({type:"dispose"})}set needsUpdate(t){t===!0&&this.version++}};var ui=new O,Wl=new O,ao=new O,lo=new O,Us=class{constructor(t=new O,e=new O(0,0,-1)){this.origin=t,this.direction=e}set(t,e){return this.origin.copy(t),this.direction.copy(e),this}copy(t){return this.origin.copy(t.origin),this.direction.copy(t.direction),this}at(t,e){return e.copy(this.origin).addScaledVector(this.direction,t)}lookAt(t){return this.direction.copy(t).sub(this.origin).normalize(),this}recast(t){return this.origin.copy(this.at(t,ui)),this}closestPointToPoint(t,e){e.subVectors(t,this.origin);let n=e.dot(this.direction);return n<0?e.copy(this.origin):e.copy(this.origin).addScaledVector(this.direction,n)}distanceToPoint(t){return Math.sqrt(this.distanceSqToPoint(t))}distanceSqToPoint(t){let e=ui.subVectors(t,this.origin).dot(this.direction);return e<0?this.origin.distanceToSquared(t):(ui.copy(this.origin).addScaledVector(this.direction,e),ui.distanceToSquared(t))}distanceSqToSegment(t,e,n,s){Wl.copy(t).add(e).multiplyScalar(.5),ao.copy(e).sub(t).normalize(),lo.copy(this.origin).sub(Wl);let r=t.distanceTo(e)*.5,o=-this.direction.dot(ao),a=lo.dot(this.direction),l=-lo.dot(ao),c=lo.lengthSq(),h=Math.abs(1-o*o),f,u,d,g;if(h>0)if(f=o*l-a,u=o*a-l,g=r*h,f>=0)if(u>=-g)if(u<=g){let M=1/h;f*=M,u*=M,d=f*(f+o*u+2*a)+u*(o*f+u+2*l)+c}else u=r,f=Math.max(0,-(o*u+a)),d=-f*f+u*(u+2*l)+c;else u=-r,f=Math.max(0,-(o*u+a)),d=-f*f+u*(u+2*l)+c;else u<=-g?(f=Math.max(0,-(-o*r+a)),u=f>0?-r:Math.min(Math.max(-r,-l),r),d=-f*f+u*(u+2*l)+c):u<=g?(f=0,u=Math.min(Math.max(-r,-l),r),d=u*(u+2*l)+c):(f=Math.max(0,-(o*r+a)),u=f>0?r:Math.min(Math.max(-r,-l),r),d=-f*f+u*(u+2*l)+c);else u=o>0?-r:r,f=Math.max(0,-(o*u+a)),d=-f*f+u*(u+2*l)+c;return n&&n.copy(this.origin).addScaledVector(this.direction,f),s&&s.copy(Wl).addScaledVector(ao,u),d}intersectSphere(t,e){if(t.radius<0)return null;ui.subVectors(t.center,this.origin);let n=ui.dot(this.direction),s=ui.dot(ui)-n*n,r=t.radius*t.radius;if(s>r)return null;let o=Math.sqrt(r-s),a=n-o,l=n+o;return l<0?null:a<0?this.at(l,e):this.at(a,e)}intersectsSphere(t){return t.radius<0?!1:this.distanceSqToPoint(t.center)<=t.radius*t.radius}distanceToPlane(t){let e=t.normal.dot(this.direction);if(e===0)return t.distanceToPoint(this.origin)===0?0:null;let n=-(this.origin.dot(t.normal)+t.constant)/e;return n>=0?n:null}intersectPlane(t,e){let n=this.distanceToPlane(t);return n===null?null:this.at(n,e)}intersectsPlane(t){let e=t.distanceToPoint(this.origin);return e===0||t.normal.dot(this.direction)*e<0}intersectBox(t,e){let n,s,r,o,a,l,c=1/this.direction.x,h=1/this.direction.y,f=1/this.direction.z,u=this.origin;return c>=0?(n=(t.min.x-u.x)*c,s=(t.max.x-u.x)*c):(n=(t.max.x-u.x)*c,s=(t.min.x-u.x)*c),h>=0?(r=(t.min.y-u.y)*h,o=(t.max.y-u.y)*h):(r=(t.max.y-u.y)*h,o=(t.min.y-u.y)*h),n>o||r>s||((r>n||isNaN(n))&&(n=r),(o<s||isNaN(s))&&(s=o),f>=0?(a=(t.min.z-u.z)*f,l=(t.max.z-u.z)*f):(a=(t.max.z-u.z)*f,l=(t.min.z-u.z)*f),n>l||a>s)||((a>n||n!==n)&&(n=a),(l<s||s!==s)&&(s=l),s<0)?null:this.at(n>=0?n:s,e)}intersectsBox(t){return this.intersectBox(t,ui)!==null}intersectTriangle(t,e,n,s,r){let o=this.origin,a=this.direction,l=a.x,c=a.y,h=a.z,f=t.x-o.x,u=t.y-o.y,d=t.z-o.z,g=e.x-o.x,M=e.y-o.y,m=e.z-o.z,p=n.x-o.x,T=n.y-o.y,P=n.z-o.z,S=Math.abs(l),A=Math.abs(c),b=Math.abs(h),R,_,w,L,D,B,G,N,C,k,V,j;if(S>=A&&S>=b?(w=l,B=f,C=g,j=p,l>=0?(R=c,_=h,L=u,D=d,G=M,N=m,k=T,V=P):(R=h,_=c,L=d,D=u,G=m,N=M,k=P,V=T)):A>=b?(w=c,B=u,C=M,j=T,c>=0?(R=h,_=l,L=d,D=f,G=m,N=g,k=P,V=p):(R=l,_=h,L=f,D=d,G=g,N=m,k=p,V=P)):(w=h,B=d,C=m,j=P,h>=0?(R=l,_=c,L=f,D=u,G=g,N=M,k=p,V=T):(R=c,_=l,L=u,D=f,G=M,N=g,k=T,V=p)),w===0)return null;let W=R/w,J=_/w,et=1/w,vt=L-W*B,rt=D-J*B,Zt=G-W*C,Nt=N-J*C,ne=k-W*j,tt=V-J*j,it=ne*Nt-tt*Zt,Mt=vt*tt-rt*ne,Dt=Zt*rt-Nt*vt;if(s){if(it<0||Mt<0||Dt<0)return null}else if((it<0||Mt<0||Dt<0)&&(it>0||Mt>0||Dt>0))return null;let It=it+Mt+Dt;if(It===0)return null;let Yt=et*(it*B+Mt*C+Dt*j);return(It>0?Yt<0:Yt>0)?null:this.at(Yt/It,r)}applyMatrix4(t){return this.origin.applyMatrix4(t),this.direction.transformDirection(t),this}equals(t){return t.origin.equals(this.origin)&&t.direction.equals(this.direction)}clone(){return new this.constructor().copy(this)}},Qn=class extends jn{constructor(t){super(),this.isMeshBasicMaterial=!0,this.type="MeshBasicMaterial",this.color=new se(16777215),this.map=null,this.lightMap=null,this.lightMapIntensity=1,this.aoMap=null,this.aoMapIntensity=1,this.specularMap=null,this.alphaMap=null,this.envMap=null,this.envMapRotation=new pi,this.combine=xc,this.reflectivity=1,this.refractionRatio=.98,this.wireframe=!1,this.wireframeLinewidth=1,this.wireframeLinecap="round",this.wireframeLinejoin="round",this.fog=!0,this.setValues(t)}copy(t){return super.copy(t),this.color.copy(t.color),this.map=t.map,this.lightMap=t.lightMap,this.lightMapIntensity=t.lightMapIntensity,this.aoMap=t.aoMap,this.aoMapIntensity=t.aoMapIntensity,this.specularMap=t.specularMap,this.alphaMap=t.alphaMap,this.envMap=t.envMap,this.envMapRotation.copy(t.envMapRotation),this.combine=t.combine,this.reflectivity=t.reflectivity,this.refractionRatio=t.refractionRatio,this.wireframe=t.wireframe,this.wireframeLinewidth=t.wireframeLinewidth,this.wireframeLinecap=t.wireframeLinecap,this.wireframeLinejoin=t.wireframeLinejoin,this.fog=t.fog,this}},Th=new Ee,ji=new Us,co=new ns,Eh=new O,ho=new O,uo=new O,fo=new O,Xl=new O,po=new O,Ah=new O,mo=new O,Ue=class extends Ke{constructor(t=new sn,e=new Qn){super(),this.isMesh=!0,this.type="Mesh",this.geometry=t,this.material=e,this.morphTargetDictionary=void 0,this.morphTargetInfluences=void 0,this.count=1,this.updateMorphTargets()}copy(t,e){return super.copy(t,e),t.morphTargetInfluences!==void 0&&(this.morphTargetInfluences=t.morphTargetInfluences.slice()),t.morphTargetDictionary!==void 0&&(this.morphTargetDictionary=Object.assign({},t.morphTargetDictionary)),this.material=Array.isArray(t.material)?t.material.slice():t.material,this.geometry=t.geometry,this}updateMorphTargets(){let e=this.geometry.morphAttributes,n=Object.keys(e);if(n.length>0){let s=e[n[0]];if(s!==void 0){this.morphTargetInfluences=[],this.morphTargetDictionary={};for(let r=0,o=s.length;r<o;r++){let a=s[r].name||String(r);this.morphTargetInfluences.push(0),this.morphTargetDictionary[a]=r}}}}getVertexPosition(t,e){let n=this.geometry,s=n.attributes.position,r=n.morphAttributes.position,o=n.morphTargetsRelative;e.fromBufferAttribute(s,t);let a=this.morphTargetInfluences;if(r&&a){po.set(0,0,0);for(let l=0,c=r.length;l<c;l++){let h=a[l],f=r[l];h!==0&&(Xl.fromBufferAttribute(f,t),o?po.addScaledVector(Xl,h):po.addScaledVector(Xl.sub(e),h))}e.add(po)}return e}intersectsFrustum(t){return t.intersectsObject(this)}raycast(t,e){let n=this.geometry,s=this.material,r=this.matrixWorld;s!==void 0&&(n.boundingSphere===null&&n.computeBoundingSphere(),co.copy(n.boundingSphere),co.applyMatrix4(r),ji.copy(t.ray).recast(t.near),!(co.containsPoint(ji.origin)===!1&&(ji.intersectSphere(co,Eh)===null||ji.origin.distanceToSquared(Eh)>(t.far-t.near)**2))&&(Th.copy(r).invert(),ji.copy(t.ray).applyMatrix4(Th),!(n.boundingBox!==null&&ji.intersectsBox(n.boundingBox)===!1)&&this._computeIntersections(t,e,ji)))}_computeIntersections(t,e,n){let s,r=this.geometry,o=this.material,a=r.index,l=r.attributes.position,c=r.attributes.uv,h=r.attributes.uv1,f=r.attributes.normal,u=r.groups,d=r.drawRange;if(a!==null)if(Array.isArray(o))for(let g=0,M=u.length;g<M;g++){let m=u[g],p=o[m.materialIndex],T=Math.max(m.start,d.start),P=Math.min(a.count,Math.min(m.start+m.count,d.start+d.count));for(let S=T,A=P;S<A;S+=3){let b=a.getX(S),R=a.getX(S+1),_=a.getX(S+2);s=go(this,p,t,n,c,h,f,b,R,_),s&&(s.faceIndex=Math.floor(S/3),s.face.materialIndex=m.materialIndex,e.push(s))}}else{let g=Math.max(0,d.start),M=Math.min(a.count,d.start+d.count);for(let m=g,p=M;m<p;m+=3){let T=a.getX(m),P=a.getX(m+1),S=a.getX(m+2);s=go(this,o,t,n,c,h,f,T,P,S),s&&(s.faceIndex=Math.floor(m/3),e.push(s))}}else if(l!==void 0)if(Array.isArray(o))for(let g=0,M=u.length;g<M;g++){let m=u[g],p=o[m.materialIndex],T=Math.max(m.start,d.start),P=Math.min(l.count,Math.min(m.start+m.count,d.start+d.count));for(let S=T,A=P;S<A;S+=3){let b=S,R=S+1,_=S+2;s=go(this,p,t,n,c,h,f,b,R,_),s&&(s.faceIndex=Math.floor(S/3),s.face.materialIndex=m.materialIndex,e.push(s))}}else{let g=Math.max(0,d.start),M=Math.min(l.count,d.start+d.count);for(let m=g,p=M;m<p;m+=3){let T=m,P=m+1,S=m+2;s=go(this,o,t,n,c,h,f,T,P,S),s&&(s.faceIndex=Math.floor(m/3),e.push(s))}}}};function jd(i,t,e,n,s,r,o,a){let l;if(t.side===je?l=n.intersectTriangle(o,r,s,!0,a):l=n.intersectTriangle(s,r,o,t.side===Bi,a),l===null)return null;mo.copy(a),mo.applyMatrix4(i.matrixWorld);let c=e.ray.origin.distanceTo(mo);return c<e.near||c>e.far?null:{distance:c,point:mo.clone(),object:i}}function go(i,t,e,n,s,r,o,a,l,c){i.getVertexPosition(a,ho),i.getVertexPosition(l,uo),i.getVertexPosition(c,fo);let h=jd(i,t,e,n,ho,uo,fo,Ah);if(h){let f=new O;di.getBarycoord(Ah,ho,uo,fo,f),s&&(h.uv=di.getInterpolatedAttribute(s,a,l,c,f,new xt)),r&&(h.uv1=di.getInterpolatedAttribute(r,a,l,c,f,new xt)),o&&(h.normal=di.getInterpolatedAttribute(o,a,l,c,f,new O),h.normal.dot(n.direction)>0&&h.normal.multiplyScalar(-1));let u={a,b:l,c,normal:new O,materialIndex:0};di.getNormal(ho,uo,fo,u.normal),h.face=u,h.barycoord=f}return h}var Wo=class extends mn{constructor(t=null,e=1,n=1,s,r,o,a,l,c=Ze,h=Ze,f,u){super(null,o,a,l,c,h,s,r,f,u),this.isDataTexture=!0,this.image={data:t,width:e,height:n},this.generateMipmaps=!1,this.flipY=!1,this.unpackAlignment=1}};var Qi=new ns,Qd=new xt(.5,.5),xo=new O,Fs=class{constructor(t=new Bn,e=new Bn,n=new Bn,s=new Bn,r=new Bn,o=new Bn){this.planes=[t,e,n,s,r,o]}set(t,e,n,s,r,o){let a=this.planes;return a[0].copy(t),a[1].copy(e),a[2].copy(n),a[3].copy(s),a[4].copy(r),a[5].copy(o),this}copy(t){let e=this.planes;for(let n=0;n<6;n++)e[n].copy(t.planes[n]);return this}setFromProjectionMatrix(t,e=zn,n=!1){let s=this.planes,r=t.elements,o=r[0],a=r[1],l=r[2],c=r[3],h=r[4],f=r[5],u=r[6],d=r[7],g=r[8],M=r[9],m=r[10],p=r[11],T=r[12],P=r[13],S=r[14],A=r[15];if(s[0].setComponents(c-o,d-h,p-g,A-T).normalize(),s[1].setComponents(c+o,d+h,p+g,A+T).normalize(),s[2].setComponents(c+a,d+f,p+M,A+P).normalize(),s[3].setComponents(c-a,d-f,p-M,A-P).normalize(),n)s[4].setComponents(l,u,m,S).normalize(),s[5].setComponents(c-l,d-u,p-m,A-S).normalize();else if(s[4].setComponents(c-l,d-u,p-m,A-S).normalize(),e===zn)s[5].setComponents(c+l,d+u,p+m,A+S).normalize();else if(e===Rs)s[5].setComponents(l,u,m,S).normalize();else throw new Error("THREE.Frustum.setFromProjectionMatrix(): Invalid coordinate system: "+e);return this}intersectsObject(t){if(t.boundingSphere!==void 0)t.boundingSphere===null&&t.computeBoundingSphere(),Qi.copy(t.boundingSphere).applyMatrix4(t.matrixWorld);else{let e=t.geometry;e.boundingSphere===null&&e.computeBoundingSphere(),Qi.copy(e.boundingSphere).applyMatrix4(t.matrixWorld)}return this.intersectsSphere(Qi)}intersectsSprite(t){Qi.center.set(0,0,0);let e=Qd.distanceTo(t.center);return Qi.radius=.7071067811865476+e,Qi.applyMatrix4(t.matrixWorld),this.intersectsSphere(Qi)}intersectsSphere(t){let e=this.planes,n=t.center,s=-t.radius;for(let r=0;r<6;r++)if(e[r].distanceToPoint(n)<s)return!1;return!0}intersectsBox(t){let e=this.planes;for(let n=0;n<6;n++){let s=e[n];if(xo.x=s.normal.x>0?t.max.x:t.min.x,xo.y=s.normal.y>0?t.max.y:t.min.y,xo.z=s.normal.z>0?t.max.z:t.min.z,s.distanceToPoint(xo)<0)return!1}return!0}containsPoint(t){let e=this.planes;for(let n=0;n<6;n++)if(e[n].distanceToPoint(t)<0)return!1;return!0}clone(){return new this.constructor().copy(this)}};var Pi=class extends jn{constructor(t){super(),this.isLineBasicMaterial=!0,this.type="LineBasicMaterial",this.color=new se(16777215),this.map=null,this.linewidth=1,this.linecap="round",this.linejoin="round",this.fog=!0,this.setValues(t)}copy(t){return super.copy(t),this.color.copy(t.color),this.map=t.map,this.linewidth=t.linewidth,this.linecap=t.linecap,this.linejoin=t.linejoin,this.fog=t.fog,this}},Xo=new O,qo=new O,Ch=new Ee,ar=new Us,_o=new ns,ql=new O,Rh=new O,Yo=class extends Ke{constructor(t=new sn,e=new Pi){super(),this.isLine=!0,this.type="Line",this.geometry=t,this.material=e,this.morphTargetDictionary=void 0,this.morphTargetInfluences=void 0,this.updateMorphTargets()}copy(t,e){return super.copy(t,e),this.material=Array.isArray(t.material)?t.material.slice():t.material,this.geometry=t.geometry,this}computeLineDistances(){let t=this.geometry;if(t.index===null){let e=t.attributes.position,n=[0];for(let s=1,r=e.count;s<r;s++)Xo.fromBufferAttribute(e,s-1),qo.fromBufferAttribute(e,s),n[s]=n[s-1],n[s]+=Xo.distanceTo(qo);t.setAttribute("lineDistance",new Oe(n,1))}else Jt("Line.computeLineDistances(): Computation only possible with non-indexed BufferGeometry.");return this}intersectsFrustum(t){return t.intersectsObject(this)}raycast(t,e){let n=this.geometry,s=this.matrixWorld,r=t.params.Line.threshold,o=n.drawRange;if(n.boundingSphere===null&&n.computeBoundingSphere(),_o.copy(n.boundingSphere),_o.applyMatrix4(s),_o.radius+=r,t.ray.intersectsSphere(_o)===!1)return;Ch.copy(s).invert(),ar.copy(t.ray).applyMatrix4(Ch);let a=r/((this.scale.x+this.scale.y+this.scale.z)/3),l=a*a,c=this.isLineSegments?2:1,h=n.index,u=n.attributes.position;if(h!==null){let d=Math.max(0,o.start),g=Math.min(h.count,o.start+o.count);for(let M=d,m=g-1;M<m;M+=c){let p=h.getX(M),T=h.getX(M+1),P=yo(this,t,ar,l,p,T,M);P&&e.push(P)}if(this.isLineLoop){let M=h.getX(g-1),m=h.getX(d),p=yo(this,t,ar,l,M,m,g-1);p&&e.push(p)}}else{let d=Math.max(0,o.start),g=Math.min(u.count,o.start+o.count);for(let M=d,m=g-1;M<m;M+=c){let p=yo(this,t,ar,l,M,M+1,M);p&&e.push(p)}if(this.isLineLoop){let M=yo(this,t,ar,l,g-1,d,g-1);M&&e.push(M)}}}updateMorphTargets(){let e=this.geometry.morphAttributes,n=Object.keys(e);if(n.length>0){let s=e[n[0]];if(s!==void 0){this.morphTargetInfluences=[],this.morphTargetDictionary={};for(let r=0,o=s.length;r<o;r++){let a=s[r].name||String(r);this.morphTargetInfluences.push(0),this.morphTargetDictionary[a]=r}}}}};function yo(i,t,e,n,s,r,o){let a=i.geometry.attributes.position;if(Xo.fromBufferAttribute(a,s),qo.fromBufferAttribute(a,r),e.distanceSqToSegment(Xo,qo,ql,Rh)>n)return;ql.applyMatrix4(i.matrixWorld);let c=t.ray.origin.distanceTo(ql);if(!(c<t.near||c>t.far))return{distance:c,point:Rh.clone().applyMatrix4(i.matrixWorld),index:o,face:null,faceIndex:null,barycoord:null,object:i}}var Ih=new O,Ph=new O,Os=class extends Yo{constructor(t,e){super(t,e),this.isLineSegments=!0,this.type="LineSegments"}computeLineDistances(){let t=this.geometry;if(t.index===null){let e=t.attributes.position,n=[];for(let s=0,r=e.count;s<r;s+=2)Ih.fromBufferAttribute(e,s),Ph.fromBufferAttribute(e,s+1),n[s]=s===0?0:n[s-1],n[s+1]=n[s]+Ih.distanceTo(Ph);t.setAttribute("lineDistance",new Oe(n,1))}else Jt("LineSegments.computeLineDistances(): Computation only possible with non-indexed BufferGeometry.");return this}};var _r=class extends mn{constructor(t=[],e=zi,n,s,r,o,a,l,c,h){super(t,e,n,s,r,o,a,l,c,h),this.isCubeTexture=!0,this.flipY=!1}get images(){return this.image}set images(t){this.image=t}};var Li=class extends mn{constructor(t,e,n=Vn,s,r,o,a=Ze,l=Ze,c,h=Zn,f=1){if(h!==Zn&&h!==Vi)throw new Error("THREE.DepthTexture: format must be either THREE.DepthFormat or THREE.DepthStencilFormat");let u={width:t,height:e,depth:f};super(u,s,r,o,a,l,h,n,c),this.isDepthTexture=!0,this.flipY=!1,this.generateMipmaps=!1,this.compareFunction=null}copy(t){return super.copy(t),this.source=new Ps(Object.assign({},t.image)),this.compareFunction=t.compareFunction,this}toJSON(t){let e=super.toJSON(t);return e.compareFunction=this.compareFunction,e}},Zo=class extends Li{constructor(t,e=Vn,n=zi,s,r,o=Ze,a=Ze,l,c=Zn){let h={width:t,height:t,depth:1},f=[h,h,h,h,h,h];super(t,t,e,n,s,r,o,a,l,c),this.image=f,this.isCubeDepthTexture=!0,this.isCubeTexture=!0}get images(){return this.image}set images(t){this.image=t}},yr=class extends mn{constructor(t=null){super(),this.sourceTexture=t,this.isExternalTexture=!0}copy(t){return super.copy(t),this.sourceTexture=t.sourceTexture,this}},ti=class i extends sn{constructor(t=1,e=1,n=1,s=1,r=1,o=1){super(),this.type="BoxGeometry",this.parameters={width:t,height:e,depth:n,widthSegments:s,heightSegments:r,depthSegments:o};let a=this;s=Math.floor(s),r=Math.floor(r),o=Math.floor(o);let l=[],c=[],h=[],f=[],u=0,d=0;g("z","y","x",-1,-1,n,e,t,o,r,0),g("z","y","x",1,-1,n,e,-t,o,r,1),g("x","z","y",1,1,t,n,e,s,o,2),g("x","z","y",1,-1,t,n,-e,s,o,3),g("x","y","z",1,-1,t,e,n,s,r,4),g("x","y","z",-1,-1,t,e,-n,s,r,5),this.setIndex(l),this.setAttribute("position",new Oe(c,3)),this.setAttribute("normal",new Oe(h,3)),this.setAttribute("uv",new Oe(f,2));function g(M,m,p,T,P,S,A,b,R,_,w){let L=S/R,D=A/_,B=S/2,G=A/2,N=b/2,C=R+1,k=_+1,V=0,j=0,W=new O;for(let J=0;J<k;J++){let et=J*D-G;for(let vt=0;vt<C;vt++){let rt=vt*L-B;W[M]=rt*T,W[m]=et*P,W[p]=N,c.push(W.x,W.y,W.z),W[M]=0,W[m]=0,W[p]=b>0?1:-1,h.push(W.x,W.y,W.z),f.push(vt/R),f.push(1-J/_),V+=1}}for(let J=0;J<_;J++)for(let et=0;et<R;et++){let vt=u+et+C*J,rt=u+et+C*(J+1),Zt=u+(et+1)+C*(J+1),Nt=u+(et+1)+C*J;l.push(vt,rt,Nt),l.push(rt,Zt,Nt),j+=6}a.addGroup(d,j,w),d+=j,u+=V}}copy(t){return super.copy(t),this.parameters=Object.assign({},t.parameters),this}static fromJSON(t){return new i(t.width,t.height,t.depth,t.widthSegments,t.heightSegments,t.depthSegments)}};var vo=new O,Mo=new O,Yl=new O,So=new di,vr=class extends sn{constructor(t=null,e=1){if(super(),this.type="EdgesGeometry",this.parameters={geometry:t,thresholdAngle:e},t!==null){let s=Math.pow(10,4),r=Math.cos(Ro*e),o=t.getIndex(),a=t.getAttribute("position"),l=o?o.count:a.count,c=[0,0,0],h=["a","b","c"],f=new Array(3),u={},d=[];for(let g=0;g<l;g+=3){o?(c[0]=o.getX(g),c[1]=o.getX(g+1),c[2]=o.getX(g+2)):(c[0]=g,c[1]=g+1,c[2]=g+2);let{a:M,b:m,c:p}=So;if(M.fromBufferAttribute(a,c[0]),m.fromBufferAttribute(a,c[1]),p.fromBufferAttribute(a,c[2]),So.getNormal(Yl),f[0]=`${Math.round(M.x*s)},${Math.round(M.y*s)},${Math.round(M.z*s)}`,f[1]=`${Math.round(m.x*s)},${Math.round(m.y*s)},${Math.round(m.z*s)}`,f[2]=`${Math.round(p.x*s)},${Math.round(p.y*s)},${Math.round(p.z*s)}`,!(f[0]===f[1]||f[1]===f[2]||f[2]===f[0]))for(let T=0;T<3;T++){let P=(T+1)%3,S=f[T],A=f[P],b=So[h[T]],R=So[h[P]],_=`${S}_${A}`,w=`${A}_${S}`;w in u&&u[w]?(Yl.dot(u[w].normal)<=r&&(d.push(b.x,b.y,b.z),d.push(R.x,R.y,R.z)),u[w]=null):_ in u||(u[_]={index0:c[T],index1:c[P],normal:Yl.clone()})}}for(let g in u)if(u[g]){let{index0:M,index1:m}=u[g];vo.fromBufferAttribute(a,M),Mo.fromBufferAttribute(a,m),d.push(vo.x,vo.y,vo.z),d.push(Mo.x,Mo.y,Mo.z)}this.setAttribute("position",new Oe(d,3))}}copy(t){return super.copy(t),this.parameters=Object.assign({},t.parameters),this}},wn=class{constructor(){this.type="Curve",this.arcLengthDivisions=200,this.needsUpdate=!1,this.cacheArcLengths=null}getPoint(){Jt("Curve: .getPoint() not implemented.")}getPointAt(t,e){let n=this.getUtoTmapping(t);return this.getPoint(n,e)}getPoints(t=5){let e=[];for(let n=0;n<=t;n++)e.push(this.getPoint(n/t));return e}getSpacedPoints(t=5){let e=[];for(let n=0;n<=t;n++)e.push(this.getPointAt(n/t));return e}getLength(){let t=this.getLengths();return t[t.length-1]}getLengths(t=this.arcLengthDivisions){if(this.cacheArcLengths&&this.cacheArcLengths.length===t+1&&!this.needsUpdate)return this.cacheArcLengths;this.needsUpdate=!1;let e=[],n,s=this.getPoint(0),r=0;e.push(0);for(let o=1;o<=t;o++)n=this.getPoint(o/t),r+=n.distanceTo(s),e.push(r),s=n;return this.cacheArcLengths=e,e}updateArcLengths(){this.needsUpdate=!0,this.getLengths()}getUtoTmapping(t,e=null){let n=this.getLengths(),s=0,r=n.length,o;e?o=e:o=t*n[r-1];let a=0,l=r-1,c;for(;a<=l;)if(s=Math.floor(a+(l-a)/2),c=n[s]-o,c<0)a=s+1;else if(c>0)l=s-1;else{l=s;break}if(s=l,n[s]===o)return s/(r-1);let h=n[s],u=n[s+1]-h,d=(o-h)/u;return(s+d)/(r-1)}getTangent(t,e){let s=t-1e-4,r=t+1e-4;s<0&&(s=0),r>1&&(r=1);let o=this.getPoint(s),a=this.getPoint(r),l=e||(o.isVector2?new xt:new O);return l.copy(a).sub(o).normalize(),l}getTangentAt(t,e){let n=this.getUtoTmapping(t);return this.getTangent(n,e)}computeFrenetFrames(t,e=!1){let n=new O,s=[],r=[],o=[],a=new O,l=new Ee;for(let d=0;d<=t;d++){let g=d/t;s[d]=this.getTangentAt(g,new O)}r[0]=new O,o[0]=new O;let c=Number.MAX_VALUE,h=Math.abs(s[0].x),f=Math.abs(s[0].y),u=Math.abs(s[0].z);h<=c&&(c=h,n.set(1,0,0)),f<=c&&(c=f,n.set(0,1,0)),u<=c&&n.set(0,0,1),a.crossVectors(s[0],n).normalize(),r[0].crossVectors(s[0],a),o[0].crossVectors(s[0],r[0]);for(let d=1;d<=t;d++){if(r[d]=r[d-1].clone(),o[d]=o[d-1].clone(),a.crossVectors(s[d-1],s[d]),a.length()>Number.EPSILON){a.normalize();let g=Math.acos(ce(s[d-1].dot(s[d]),-1,1));r[d].applyMatrix4(l.makeRotationAxis(a,g))}o[d].crossVectors(s[d],r[d])}if(e===!0){let d=Math.acos(ce(r[0].dot(r[t]),-1,1));d/=t,s[0].dot(a.crossVectors(r[0],r[t]))>0&&(d=-d);for(let g=1;g<=t;g++)r[g].applyMatrix4(l.makeRotationAxis(s[g],d*g)),o[g].crossVectors(s[g],r[g])}return{tangents:s,normals:r,binormals:o}}clone(){return new this.constructor().copy(this)}copy(t){return this.arcLengthDivisions=t.arcLengthDivisions,this}toJSON(){let t={metadata:{version:4.7,type:"Curve",generator:"Curve.toJSON"}};return t.arcLengthDivisions=this.arcLengthDivisions,t.type=this.type,t}fromJSON(t){return this.arcLengthDivisions=t.arcLengthDivisions,this}},Bs=class extends wn{constructor(t=0,e=0,n=1,s=1,r=0,o=Math.PI*2,a=!1,l=0){super(),this.isEllipseCurve=!0,this.type="EllipseCurve",this.aX=t,this.aY=e,this.xRadius=n,this.yRadius=s,this.aStartAngle=r,this.aEndAngle=o,this.aClockwise=a,this.aRotation=l}getPoint(t,e=new xt){let n=e,s=Math.PI*2,r=this.aEndAngle-this.aStartAngle,o=Math.abs(r)<Number.EPSILON;for(;r<0;)r+=s;for(;r>s;)r-=s;r<Number.EPSILON&&(o?r=0:r=s),this.aClockwise===!0&&!o&&(r===s?r=-s:r=r-s);let a=this.aStartAngle+t*r,l=this.aX+this.xRadius*Math.cos(a),c=this.aY+this.yRadius*Math.sin(a);if(this.aRotation!==0){let h=Math.cos(this.aRotation),f=Math.sin(this.aRotation),u=l-this.aX,d=c-this.aY;l=u*h-d*f+this.aX,c=u*f+d*h+this.aY}return n.set(l,c)}copy(t){return super.copy(t),this.aX=t.aX,this.aY=t.aY,this.xRadius=t.xRadius,this.yRadius=t.yRadius,this.aStartAngle=t.aStartAngle,this.aEndAngle=t.aEndAngle,this.aClockwise=t.aClockwise,this.aRotation=t.aRotation,this}toJSON(){let t=super.toJSON();return t.aX=this.aX,t.aY=this.aY,t.xRadius=this.xRadius,t.yRadius=this.yRadius,t.aStartAngle=this.aStartAngle,t.aEndAngle=this.aEndAngle,t.aClockwise=this.aClockwise,t.aRotation=this.aRotation,t}fromJSON(t){return super.fromJSON(t),this.aX=t.aX,this.aY=t.aY,this.xRadius=t.xRadius,this.yRadius=t.yRadius,this.aStartAngle=t.aStartAngle,this.aEndAngle=t.aEndAngle,this.aClockwise=t.aClockwise,this.aRotation=t.aRotation,this}},$o=class extends Bs{constructor(t,e,n,s,r,o){super(t,e,n,n,s,r,o),this.isArcCurve=!0,this.type="ArcCurve"}};function Fc(){let i=0,t=0,e=0,n=0;function s(r,o,a,l){i=r,t=a,e=-3*r+3*o-2*a-l,n=2*r-2*o+a+l}return{initCatmullRom:function(r,o,a,l,c){s(o,a,c*(a-r),c*(l-o))},initNonuniformCatmullRom:function(r,o,a,l,c,h,f){let u=(o-r)/c-(a-r)/(c+h)+(a-o)/h,d=(a-o)/h-(l-o)/(h+f)+(l-a)/f;u*=h,d*=h,s(o,a,u,d)},calc:function(r){let o=r*r,a=o*r;return i+t*r+e*o+n*a}}}var Lh=new O,Dh=new O,Zl=new Fc,$l=new Fc,Jl=new Fc,Jo=class extends wn{constructor(t=[],e=!1,n="centripetal",s=.5){super(),this.isCatmullRomCurve3=!0,this.type="CatmullRomCurve3",this.points=t,this.closed=e,this.curveType=n,this.tension=s}getPoint(t,e=new O){let n=e,s=this.points,r=s.length,o=(r-(this.closed?0:1))*t,a=Math.floor(o),l=o-a;this.closed?a+=a>0?0:(Math.floor(Math.abs(a)/r)+1)*r:l===0&&a===r-1&&(a=r-2,l=1);let c,h;this.closed||a>0?c=s[(a-1)%r]:(Dh.subVectors(s[0],s[1]).add(s[0]),c=Dh);let f=s[a%r],u=s[(a+1)%r];if(this.closed||a+2<r?h=s[(a+2)%r]:(Lh.subVectors(s[r-1],s[r-2]).add(s[r-1]),h=Lh),this.curveType==="centripetal"||this.curveType==="chordal"){let d=this.curveType==="chordal"?.5:.25,g=Math.pow(c.distanceToSquared(f),d),M=Math.pow(f.distanceToSquared(u),d),m=Math.pow(u.distanceToSquared(h),d);M<1e-4&&(M=1),g<1e-4&&(g=M),m<1e-4&&(m=M),Zl.initNonuniformCatmullRom(c.x,f.x,u.x,h.x,g,M,m),$l.initNonuniformCatmullRom(c.y,f.y,u.y,h.y,g,M,m),Jl.initNonuniformCatmullRom(c.z,f.z,u.z,h.z,g,M,m)}else this.curveType==="catmullrom"&&(Zl.initCatmullRom(c.x,f.x,u.x,h.x,this.tension),$l.initCatmullRom(c.y,f.y,u.y,h.y,this.tension),Jl.initCatmullRom(c.z,f.z,u.z,h.z,this.tension));return n.set(Zl.calc(l),$l.calc(l),Jl.calc(l)),n}copy(t){super.copy(t),this.points=[];for(let e=0,n=t.points.length;e<n;e++){let s=t.points[e];this.points.push(s.clone())}return this.closed=t.closed,this.curveType=t.curveType,this.tension=t.tension,this}toJSON(){let t=super.toJSON();t.points=[];for(let e=0,n=this.points.length;e<n;e++){let s=this.points[e];t.points.push(s.toArray())}return t.closed=this.closed,t.curveType=this.curveType,t.tension=this.tension,t}fromJSON(t){super.fromJSON(t),this.points=[];for(let e=0,n=t.points.length;e<n;e++){let s=t.points[e];this.points.push(new O().fromArray(s))}return this.closed=t.closed,this.curveType=t.curveType,this.tension=t.tension,this}};function Nh(i,t,e,n,s){let r=(n-t)*.5,o=(s-e)*.5,a=i*i,l=i*a;return(2*e-2*n+r+o)*l+(-3*e+3*n-2*r-o)*a+r*i+e}function tf(i,t){let e=1-i;return e*e*t}function ef(i,t){return 2*(1-i)*i*t}function nf(i,t){return i*i*t}function cr(i,t,e,n){return tf(i,t)+ef(i,e)+nf(i,n)}function sf(i,t){let e=1-i;return e*e*e*t}function rf(i,t){let e=1-i;return 3*e*e*i*t}function of(i,t){return 3*(1-i)*i*i*t}function af(i,t){return i*i*i*t}function hr(i,t,e,n,s){return sf(i,t)+rf(i,e)+of(i,n)+af(i,s)}var Mr=class extends wn{constructor(t=new xt,e=new xt,n=new xt,s=new xt){super(),this.isCubicBezierCurve=!0,this.type="CubicBezierCurve",this.v0=t,this.v1=e,this.v2=n,this.v3=s}getPoint(t,e=new xt){let n=e,s=this.v0,r=this.v1,o=this.v2,a=this.v3;return n.set(hr(t,s.x,r.x,o.x,a.x),hr(t,s.y,r.y,o.y,a.y)),n}copy(t){return super.copy(t),this.v0.copy(t.v0),this.v1.copy(t.v1),this.v2.copy(t.v2),this.v3.copy(t.v3),this}toJSON(){let t=super.toJSON();return t.v0=this.v0.toArray(),t.v1=this.v1.toArray(),t.v2=this.v2.toArray(),t.v3=this.v3.toArray(),t}fromJSON(t){return super.fromJSON(t),this.v0.fromArray(t.v0),this.v1.fromArray(t.v1),this.v2.fromArray(t.v2),this.v3.fromArray(t.v3),this}},Ko=class extends wn{constructor(t=new O,e=new O,n=new O,s=new O){super(),this.isCubicBezierCurve3=!0,this.type="CubicBezierCurve3",this.v0=t,this.v1=e,this.v2=n,this.v3=s}getPoint(t,e=new O){let n=e,s=this.v0,r=this.v1,o=this.v2,a=this.v3;return n.set(hr(t,s.x,r.x,o.x,a.x),hr(t,s.y,r.y,o.y,a.y),hr(t,s.z,r.z,o.z,a.z)),n}copy(t){return super.copy(t),this.v0.copy(t.v0),this.v1.copy(t.v1),this.v2.copy(t.v2),this.v3.copy(t.v3),this}toJSON(){let t=super.toJSON();return t.v0=this.v0.toArray(),t.v1=this.v1.toArray(),t.v2=this.v2.toArray(),t.v3=this.v3.toArray(),t}fromJSON(t){return super.fromJSON(t),this.v0.fromArray(t.v0),this.v1.fromArray(t.v1),this.v2.fromArray(t.v2),this.v3.fromArray(t.v3),this}},Sr=class extends wn{constructor(t=new xt,e=new xt){super(),this.isLineCurve=!0,this.type="LineCurve",this.v1=t,this.v2=e}getPoint(t,e=new xt){let n=e;return t===1?n.copy(this.v2):(n.copy(this.v2).sub(this.v1),n.multiplyScalar(t).add(this.v1)),n}getPointAt(t,e){return this.getPoint(t,e)}getTangent(t,e=new xt){return e.subVectors(this.v2,this.v1).normalize()}getTangentAt(t,e){return this.getTangent(t,e)}copy(t){return super.copy(t),this.v1.copy(t.v1),this.v2.copy(t.v2),this}toJSON(){let t=super.toJSON();return t.v1=this.v1.toArray(),t.v2=this.v2.toArray(),t}fromJSON(t){return super.fromJSON(t),this.v1.fromArray(t.v1),this.v2.fromArray(t.v2),this}},jo=class extends wn{constructor(t=new O,e=new O){super(),this.isLineCurve3=!0,this.type="LineCurve3",this.v1=t,this.v2=e}getPoint(t,e=new O){let n=e;return t===1?n.copy(this.v2):(n.copy(this.v2).sub(this.v1),n.multiplyScalar(t).add(this.v1)),n}getPointAt(t,e){return this.getPoint(t,e)}getTangent(t,e=new O){return e.subVectors(this.v2,this.v1).normalize()}getTangentAt(t,e){return this.getTangent(t,e)}copy(t){return super.copy(t),this.v1.copy(t.v1),this.v2.copy(t.v2),this}toJSON(){let t=super.toJSON();return t.v1=this.v1.toArray(),t.v2=this.v2.toArray(),t}fromJSON(t){return super.fromJSON(t),this.v1.fromArray(t.v1),this.v2.fromArray(t.v2),this}},br=class extends wn{constructor(t=new xt,e=new xt,n=new xt){super(),this.isQuadraticBezierCurve=!0,this.type="QuadraticBezierCurve",this.v0=t,this.v1=e,this.v2=n}getPoint(t,e=new xt){let n=e,s=this.v0,r=this.v1,o=this.v2;return n.set(cr(t,s.x,r.x,o.x),cr(t,s.y,r.y,o.y)),n}copy(t){return super.copy(t),this.v0.copy(t.v0),this.v1.copy(t.v1),this.v2.copy(t.v2),this}toJSON(){let t=super.toJSON();return t.v0=this.v0.toArray(),t.v1=this.v1.toArray(),t.v2=this.v2.toArray(),t}fromJSON(t){return super.fromJSON(t),this.v0.fromArray(t.v0),this.v1.fromArray(t.v1),this.v2.fromArray(t.v2),this}},Qo=class extends wn{constructor(t=new O,e=new O,n=new O){super(),this.isQuadraticBezierCurve3=!0,this.type="QuadraticBezierCurve3",this.v0=t,this.v1=e,this.v2=n}getPoint(t,e=new O){let n=e,s=this.v0,r=this.v1,o=this.v2;return n.set(cr(t,s.x,r.x,o.x),cr(t,s.y,r.y,o.y),cr(t,s.z,r.z,o.z)),n}copy(t){return super.copy(t),this.v0.copy(t.v0),this.v1.copy(t.v1),this.v2.copy(t.v2),this}toJSON(){let t=super.toJSON();return t.v0=this.v0.toArray(),t.v1=this.v1.toArray(),t.v2=this.v2.toArray(),t}fromJSON(t){return super.fromJSON(t),this.v0.fromArray(t.v0),this.v1.fromArray(t.v1),this.v2.fromArray(t.v2),this}},wr=class extends wn{constructor(t=[]){super(),this.isSplineCurve=!0,this.type="SplineCurve",this.points=t}getPoint(t,e=new xt){let n=e,s=this.points,r=(s.length-1)*t,o=Math.floor(r),a=r-o,l=s[o===0?o:o-1],c=s[o],h=s[o>s.length-2?s.length-1:o+1],f=s[o>s.length-3?s.length-1:o+2];return n.set(Nh(a,l.x,c.x,h.x,f.x),Nh(a,l.y,c.y,h.y,f.y)),n}copy(t){super.copy(t),this.points=[];for(let e=0,n=t.points.length;e<n;e++){let s=t.points[e];this.points.push(s.clone())}return this}toJSON(){let t=super.toJSON();t.points=[];for(let e=0,n=this.points.length;e<n;e++){let s=this.points[e];t.points.push(s.toArray())}return t}fromJSON(t){super.fromJSON(t),this.points=[];for(let e=0,n=t.points.length;e<n;e++){let s=t.points[e];this.points.push(new xt().fromArray(s))}return this}},ic=Object.freeze({__proto__:null,ArcCurve:$o,CatmullRomCurve3:Jo,CubicBezierCurve:Mr,CubicBezierCurve3:Ko,EllipseCurve:Bs,LineCurve:Sr,LineCurve3:jo,QuadraticBezierCurve:br,QuadraticBezierCurve3:Qo,SplineCurve:wr}),ta=class extends wn{constructor(){super(),this.type="CurvePath",this.curves=[],this.autoClose=!1}add(t){this.curves.push(t)}closePath(){let t=this.curves[0].getPoint(0),e=this.curves[this.curves.length-1].getPoint(1);if(!t.equals(e)){let n=t.isVector2===!0?"LineCurve":"LineCurve3";this.curves.push(new ic[n](e,t))}return this}getPoint(t,e){let n=t*this.getLength(),s=this.getCurveLengths(),r=0;for(;r<s.length;){if(s[r]>=n){let o=s[r]-n,a=this.curves[r],l=a.getLength(),c=l===0?0:1-o/l;return a.getPointAt(c,e)}r++}return null}getLength(){let t=this.getCurveLengths();return t[t.length-1]}updateArcLengths(){this.needsUpdate=!0,this.cacheLengths=null,this.getCurveLengths()}getCurveLengths(){if(this.cacheLengths&&this.cacheLengths.length===this.curves.length)return this.cacheLengths;let t=[],e=0;for(let n=0,s=this.curves.length;n<s;n++)e+=this.curves[n].getLength(),t.push(e);return this.cacheLengths=t,t}getSpacedPoints(t=40){let e=[];for(let n=0;n<=t;n++)e.push(this.getPoint(n/t));return this.autoClose&&e.push(e[0]),e}getPoints(t=12){let e=[],n;for(let s=0,r=this.curves;s<r.length;s++){let o=r[s],a=o.isEllipseCurve?t*2:o.isLineCurve||o.isLineCurve3?1:o.isSplineCurve?t*o.points.length:t,l=o.getPoints(a);for(let c=0;c<l.length;c++){let h=l[c];n&&n.equals(h)||(e.push(h),n=h)}}return this.autoClose&&e.length>1&&!e[e.length-1].equals(e[0])&&e.push(e[0]),e}copy(t){super.copy(t),this.curves=[];for(let e=0,n=t.curves.length;e<n;e++){let s=t.curves[e];this.curves.push(s.clone())}return this.autoClose=t.autoClose,this}toJSON(){let t=super.toJSON();t.autoClose=this.autoClose,t.curves=[];for(let e=0,n=this.curves.length;e<n;e++){let s=this.curves[e];t.curves.push(s.toJSON())}return t}fromJSON(t){super.fromJSON(t),this.autoClose=t.autoClose,this.curves=[];for(let e=0,n=t.curves.length;e<n;e++){let s=t.curves[e];this.curves.push(new ic[s.type]().fromJSON(s))}return this}},Tr=class extends ta{constructor(t){super(),this.type="Path",this.currentPoint=new xt,t&&this.setFromPoints(t)}setFromPoints(t){this.moveTo(t[0].x,t[0].y);for(let e=1,n=t.length;e<n;e++)this.lineTo(t[e].x,t[e].y);return this}moveTo(t,e){return this.currentPoint.set(t,e),this}lineTo(t,e){let n=new Sr(this.currentPoint.clone(),new xt(t,e));return this.curves.push(n),this.currentPoint.set(t,e),this}quadraticCurveTo(t,e,n,s){let r=new br(this.currentPoint.clone(),new xt(t,e),new xt(n,s));return this.curves.push(r),this.currentPoint.set(n,s),this}bezierCurveTo(t,e,n,s,r,o){let a=new Mr(this.currentPoint.clone(),new xt(t,e),new xt(n,s),new xt(r,o));return this.curves.push(a),this.currentPoint.set(r,o),this}splineThru(t){let e=[this.currentPoint.clone()].concat(t),n=new wr(e);return this.curves.push(n),this.currentPoint.copy(t[t.length-1]),this}arc(t,e,n,s,r,o){let a=this.currentPoint.x,l=this.currentPoint.y;return this.absarc(t+a,e+l,n,s,r,o),this}absarc(t,e,n,s,r,o){return this.absellipse(t,e,n,n,s,r,o),this}ellipse(t,e,n,s,r,o,a,l){let c=this.currentPoint.x,h=this.currentPoint.y;return this.absellipse(t+c,e+h,n,s,r,o,a,l),this}absellipse(t,e,n,s,r,o,a,l){let c=new Bs(t,e,n,s,r,o,a,l);if(this.curves.length>0){let f=c.getPoint(0);f.equals(this.currentPoint)||this.lineTo(f.x,f.y)}this.curves.push(c);let h=c.getPoint(1);return this.currentPoint.copy(h),this}copy(t){return super.copy(t),this.currentPoint.copy(t.currentPoint),this}toJSON(){let t=super.toJSON();return t.currentPoint=this.currentPoint.toArray(),t}fromJSON(t){return super.fromJSON(t),this.currentPoint.fromArray(t.currentPoint),this}},is=class extends Tr{constructor(t){super(t),this.uuid=qs(),this.type="Shape",this.holes=[]}getPointsHoles(t){let e=[];for(let n=0,s=this.holes.length;n<s;n++)e[n]=this.holes[n].getPoints(t);return e}extractPoints(t){return{shape:this.getPoints(t),holes:this.getPointsHoles(t)}}copy(t){super.copy(t),this.holes=[];for(let e=0,n=t.holes.length;e<n;e++){let s=t.holes[e];this.holes.push(s.clone())}return this}toJSON(){let t=super.toJSON();t.uuid=this.uuid,t.holes=[];for(let e=0,n=this.holes.length;e<n;e++){let s=this.holes[e];t.holes.push(s.toJSON())}return t}fromJSON(t){super.fromJSON(t),this.uuid=t.uuid,this.holes=[];for(let e=0,n=t.holes.length;e<n;e++){let s=t.holes[e];this.holes.push(new Tr().fromJSON(s))}return this}};function lf(i,t,e=2){let n=t&&t.length,s=n?t[0]*e:i.length,r=Ru(i,0,s,e,!0),o=[];if(!r||r.next===r.prev)return o;let a,l,c;if(n&&(r=ff(i,t,r,e)),i.length>80*e){a=i[0],l=i[1];let h=a,f=l;for(let u=e;u<s;u+=e){let d=i[u],g=i[u+1];d<a&&(a=d),g<l&&(l=g),d>h&&(h=d),g>f&&(f=g)}c=Math.max(h-a,f-l),c=c!==0?32767/c:0}return Er(r,o,e,a,l,c,0),o}function Ru(i,t,e,n,s){let r;if(s===wf(i,t,e,n)>0)for(let o=t;o<e;o+=n)r=Uh(o/n|0,i[o],i[o+1],r);else for(let o=e-n;o>=t;o-=n)r=Uh(o/n|0,i[o],i[o+1],r);return r&&zs(r,r.next)&&(Cr(r),r=r.next),r}function ss(i,t){if(!i)return i;t||(t=i);let e=i,n;do if(n=!1,!e.steiner&&(zs(e,e.next)||Ne(e.prev,e,e.next)===0)){if(Cr(e),e=t=e.prev,e===e.next)break;n=!0}else e=e.next;while(n||e!==t);return t}function Er(i,t,e,n,s,r,o){if(!i)return;!o&&r&&_f(i,n,s,r);let a=i;for(;i.prev!==i.next;){let l=i.prev,c=i.next;if(r?hf(i,n,s,r):cf(i)){t.push(l.i,i.i,c.i),Cr(i),i=c.next,a=c.next;continue}if(i=c,i===a){o?o===1?(i=uf(ss(i),t),Er(i,t,e,n,s,r,2)):o===2&&df(i,t,e,n,s,r):Er(ss(i),t,e,n,s,r,1);break}}}function cf(i){let t=i.prev,e=i,n=i.next;if(Ne(t,e,n)>=0)return!1;let s=t.x,r=e.x,o=n.x,a=t.y,l=e.y,c=n.y,h=Math.min(s,r,o),f=Math.min(a,l,c),u=Math.max(s,r,o),d=Math.max(a,l,c),g=n.next;for(;g!==t;){if(g.x>=h&&g.x<=u&&g.y>=f&&g.y<=d&&lr(s,a,r,l,o,c,g.x,g.y)&&Ne(g.prev,g,g.next)>=0)return!1;g=g.next}return!0}function hf(i,t,e,n){let s=i.prev,r=i,o=i.next;if(Ne(s,r,o)>=0)return!1;let a=s.x,l=r.x,c=o.x,h=s.y,f=r.y,u=o.y,d=Math.min(a,l,c),g=Math.min(h,f,u),M=Math.max(a,l,c),m=Math.max(h,f,u),p=sc(d,g,t,e,n),T=sc(M,m,t,e,n),P=i.prevZ,S=i.nextZ;for(;P&&P.z>=p&&S&&S.z<=T;){if(P.x>=d&&P.x<=M&&P.y>=g&&P.y<=m&&P!==s&&P!==o&&lr(a,h,l,f,c,u,P.x,P.y)&&Ne(P.prev,P,P.next)>=0||(P=P.prevZ,S.x>=d&&S.x<=M&&S.y>=g&&S.y<=m&&S!==s&&S!==o&&lr(a,h,l,f,c,u,S.x,S.y)&&Ne(S.prev,S,S.next)>=0))return!1;S=S.nextZ}for(;P&&P.z>=p;){if(P.x>=d&&P.x<=M&&P.y>=g&&P.y<=m&&P!==s&&P!==o&&lr(a,h,l,f,c,u,P.x,P.y)&&Ne(P.prev,P,P.next)>=0)return!1;P=P.prevZ}for(;S&&S.z<=T;){if(S.x>=d&&S.x<=M&&S.y>=g&&S.y<=m&&S!==s&&S!==o&&lr(a,h,l,f,c,u,S.x,S.y)&&Ne(S.prev,S,S.next)>=0)return!1;S=S.nextZ}return!0}function uf(i,t){let e=i;do{let n=e.prev,s=e.next.next;!zs(n,s)&&Pu(n,e,e.next,s)&&Ar(n,s)&&Ar(s,n)&&(t.push(n.i,e.i,s.i),Cr(e),Cr(e.next),e=i=s),e=e.next}while(e!==i);return ss(e)}function df(i,t,e,n,s,r){let o=i;do{let a=o.next.next;for(;a!==o.prev;){if(o.i!==a.i&&Mf(o,a)){let l=Lu(o,a);o=ss(o,o.next),l=ss(l,l.next),Er(o,t,e,n,s,r,0),Er(l,t,e,n,s,r,0);return}a=a.next}o=o.next}while(o!==i)}function ff(i,t,e,n){let s=[];for(let r=0,o=t.length;r<o;r++){let a=t[r]*n,l=r<o-1?t[r+1]*n:i.length,c=Ru(i,a,l,n,!1);c===c.next&&(c.steiner=!0),s.push(vf(c))}s.sort(pf);for(let r=0;r<s.length;r++)e=mf(s[r],e);return e}function pf(i,t){let e=i.x-t.x;if(e===0&&(e=i.y-t.y,e===0)){let n=(i.next.y-i.y)/(i.next.x-i.x),s=(t.next.y-t.y)/(t.next.x-t.x);e=n-s}return e}function mf(i,t){let e=gf(i,t);if(!e)return t;let n=Lu(e,i);return ss(n,n.next),ss(e,e.next)}function gf(i,t){let e=t,n=i.x,s=i.y,r=-1/0,o;if(zs(i,e))return e;do{if(zs(i,e.next))return e.next;if(s<=e.y&&s>=e.next.y&&e.next.y!==e.y){let f=e.x+(s-e.y)*(e.next.x-e.x)/(e.next.y-e.y);if(f<=n&&f>r&&(r=f,o=e.x<e.next.x?e:e.next,f===n))return o}e=e.next}while(e!==t);if(!o)return null;let a=o,l=o.x,c=o.y,h=1/0;e=o;do{if(n>=e.x&&e.x>=l&&n!==e.x&&Iu(s<c?n:r,s,l,c,s<c?r:n,s,e.x,e.y)){let f=Math.abs(s-e.y)/(n-e.x);Ar(e,i)&&(f<h||f===h&&(e.x>o.x||e.x===o.x&&xf(o,e)))&&(o=e,h=f)}e=e.next}while(e!==a);return o}function xf(i,t){return Ne(i.prev,i,t.prev)<0&&Ne(t.next,i,i.next)<0}function _f(i,t,e,n){let s=i;do s.z===0&&(s.z=sc(s.x,s.y,t,e,n)),s.prevZ=s.prev,s.nextZ=s.next,s=s.next;while(s!==i);s.prevZ.nextZ=null,s.prevZ=null,yf(s)}function yf(i){let t,e=1;do{let n=i,s;i=null;let r=null;for(t=0;n;){t++;let o=n,a=0;for(let c=0;c<e&&(a++,o=o.nextZ,!!o);c++);let l=e;for(;a>0||l>0&&o;)a!==0&&(l===0||!o||n.z<=o.z)?(s=n,n=n.nextZ,a--):(s=o,o=o.nextZ,l--),r?r.nextZ=s:i=s,s.prevZ=r,r=s;n=o}r.nextZ=null,e*=2}while(t>1);return i}function sc(i,t,e,n,s){return i=(i-e)*s|0,t=(t-n)*s|0,i=(i|i<<8)&16711935,i=(i|i<<4)&252645135,i=(i|i<<2)&858993459,i=(i|i<<1)&1431655765,t=(t|t<<8)&16711935,t=(t|t<<4)&252645135,t=(t|t<<2)&858993459,t=(t|t<<1)&1431655765,i|t<<1}function vf(i){let t=i,e=i;do(t.x<e.x||t.x===e.x&&t.y<e.y)&&(e=t),t=t.next;while(t!==i);return e}function Iu(i,t,e,n,s,r,o,a){return(s-o)*(t-a)>=(i-o)*(r-a)&&(i-o)*(n-a)>=(e-o)*(t-a)&&(e-o)*(r-a)>=(s-o)*(n-a)}function lr(i,t,e,n,s,r,o,a){return!(i===o&&t===a)&&Iu(i,t,e,n,s,r,o,a)}function Mf(i,t){return i.next.i!==t.i&&i.prev.i!==t.i&&!Sf(i,t)&&(Ar(i,t)&&Ar(t,i)&&bf(i,t)&&(Ne(i.prev,i,t.prev)||Ne(i,t.prev,t))||zs(i,t)&&Ne(i.prev,i,i.next)>0&&Ne(t.prev,t,t.next)>0)}function Ne(i,t,e){return(t.y-i.y)*(e.x-t.x)-(t.x-i.x)*(e.y-t.y)}function zs(i,t){return i.x===t.x&&i.y===t.y}function Pu(i,t,e,n){let s=wo(Ne(i,t,e)),r=wo(Ne(i,t,n)),o=wo(Ne(e,n,i)),a=wo(Ne(e,n,t));return!!(s!==r&&o!==a||s===0&&bo(i,e,t)||r===0&&bo(i,n,t)||o===0&&bo(e,i,n)||a===0&&bo(e,t,n))}function bo(i,t,e){return t.x<=Math.max(i.x,e.x)&&t.x>=Math.min(i.x,e.x)&&t.y<=Math.max(i.y,e.y)&&t.y>=Math.min(i.y,e.y)}function wo(i){return i>0?1:i<0?-1:0}function Sf(i,t){let e=i;do{if(e.i!==i.i&&e.next.i!==i.i&&e.i!==t.i&&e.next.i!==t.i&&Pu(e,e.next,i,t))return!0;e=e.next}while(e!==i);return!1}function Ar(i,t){return Ne(i.prev,i,i.next)<0?Ne(i,t,i.next)>=0&&Ne(i,i.prev,t)>=0:Ne(i,t,i.prev)<0||Ne(i,i.next,t)<0}function bf(i,t){let e=i,n=!1,s=(i.x+t.x)/2,r=(i.y+t.y)/2;do e.y>r!=e.next.y>r&&e.next.y!==e.y&&s<(e.next.x-e.x)*(r-e.y)/(e.next.y-e.y)+e.x&&(n=!n),e=e.next;while(e!==i);return n}function Lu(i,t){let e=rc(i.i,i.x,i.y),n=rc(t.i,t.x,t.y),s=i.next,r=t.prev;return i.next=t,t.prev=i,e.next=s,s.prev=e,n.next=e,e.prev=n,r.next=n,n.prev=r,n}function Uh(i,t,e,n){let s=rc(i,t,e);return n?(s.next=n.next,s.prev=n,n.next.prev=s,n.next=s):(s.prev=s,s.next=s),s}function Cr(i){i.next.prev=i.prev,i.prev.next=i.next,i.prevZ&&(i.prevZ.nextZ=i.nextZ),i.nextZ&&(i.nextZ.prevZ=i.prevZ)}function rc(i,t,e){return{i,x:t,y:e,prev:null,next:null,z:0,prevZ:null,nextZ:null,steiner:!1}}function wf(i,t,e,n){let s=0;for(let r=t,o=e-n;r<e;r+=n)s+=(i[o]-i[r])*(i[r+1]+i[o+1]),o=r;return s}var oc=class{static triangulate(t,e,n=2){return lf(t,e,n)}},ts=class i{static area(t){let e=t.length,n=0;for(let s=e-1,r=0;r<e;s=r++)n+=t[s].x*t[r].y-t[r].x*t[s].y;return n*.5}static isClockWise(t){return i.area(t)<0}static triangulateShape(t,e){let n=[],s=[],r=[];Fh(t),Oh(n,t);let o=t.length;e.forEach(Fh);for(let l=0;l<e.length;l++)s.push(o),o+=e[l].length,Oh(n,e[l]);let a=oc.triangulate(n,s);for(let l=0;l<a.length;l+=3)r.push(a.slice(l,l+3));return r}};function Fh(i){let t=i.length;t>2&&i[t-1].equals(i[0])&&i.pop()}function Oh(i,t){for(let e=0;e<t.length;e++)i.push(t[e].x),i.push(t[e].y)}var ks=class i extends sn{constructor(t=new is([new xt(.5,.5),new xt(-.5,.5),new xt(-.5,-.5),new xt(.5,-.5)]),e={}){super(),this.type="ExtrudeGeometry",this.parameters={shapes:t,options:e},t=Array.isArray(t)?t:[t];let n=this,s=[],r=[];for(let a=0,l=t.length;a<l;a++){let c=t[a];o(c)}this.setAttribute("position",new Oe(s,3)),this.setAttribute("uv",new Oe(r,2)),this.computeVertexNormals();function o(a){let l=[],c=e.curveSegments!==void 0?e.curveSegments:12,h=e.steps!==void 0?e.steps:1,f=e.depth!==void 0?e.depth:1,u=e.bevelEnabled!==void 0?e.bevelEnabled:!0,d=e.bevelThickness!==void 0?e.bevelThickness:.2,g=e.bevelSize!==void 0?e.bevelSize:d-.1,M=e.bevelOffset!==void 0?e.bevelOffset:0,m=e.bevelSegments!==void 0?e.bevelSegments:3,p=e.extrudePath,T=e.UVGenerator!==void 0?e.UVGenerator:Tf,P,S=!1,A,b,R,_;if(p){P=p.getSpacedPoints(h),S=!0,u=!1;let st=p.isCatmullRomCurve3?p.closed:!1;A=p.computeFrenetFrames(h,st),b=new O,R=new O,_=new O}u||(m=0,d=0,g=0,M=0);let w=a.extractPoints(c),L=w.shape,D=w.holes;if(!ts.isClockWise(L)){L=L.reverse();for(let st=0,ot=D.length;st<ot;st++){let ft=D[st];ts.isClockWise(ft)&&(D[st]=ft.reverse())}}function G(st){let ft=10000000000000001e-36,mt=st[0];for(let St=1;St<=st.length;St++){let Xt=St%st.length,kt=st[Xt],$t=kt.x-mt.x,Kt=kt.y-mt.y,F=$t*$t+Kt*Kt,xe=Math.max(Math.abs(kt.x),Math.abs(kt.y),Math.abs(mt.x),Math.abs(mt.y)),ae=ft*xe*xe;if(F<=ae){st.splice(Xt,1),St--;continue}mt=kt}}G(L),D.forEach(G);let N=D.length,C=L;for(let st=0;st<N;st++){let ot=D[st];L=L.concat(ot)}function k(st,ot,ft){return ot||jt("ExtrudeGeometry: vec does not exist"),st.clone().addScaledVector(ot,ft)}let V=L.length;function j(st,ot,ft){let mt,St,Xt,kt=st.x-ot.x,$t=st.y-ot.y,Kt=ft.x-st.x,F=ft.y-st.y,xe=kt*kt+$t*$t,ae=kt*F-$t*Kt;if(Math.abs(ae)>Number.EPSILON){let E=Math.sqrt(xe),x=Math.sqrt(Kt*Kt+F*F),H=ot.x-$t/E,K=ot.y+kt/E,Q=ft.x-F/x,pt=ft.y+Kt/x,_t=((Q-H)*F-(pt-K)*Kt)/(kt*F-$t*Kt);mt=H+kt*_t-st.x,St=K+$t*_t-st.y;let nt=mt*mt+St*St;if(nt<=2)return new xt(mt,St);Xt=Math.sqrt(nt/2)}else{let E=!1;kt>Number.EPSILON?Kt>Number.EPSILON&&(E=!0):kt<-Number.EPSILON?Kt<-Number.EPSILON&&(E=!0):Math.sign($t)===Math.sign(F)&&(E=!0),E?(mt=-$t,St=kt,Xt=Math.sqrt(xe)):(mt=kt,St=$t,Xt=Math.sqrt(xe/2))}return new xt(mt/Xt,St/Xt)}let W=[];for(let st=0,ot=C.length,ft=ot-1,mt=st+1;st<ot;st++,ft++,mt++)ft===ot&&(ft=0),mt===ot&&(mt=0),W[st]=j(C[st],C[ft],C[mt]);let J=[],et,vt=W.concat();for(let st=0,ot=N;st<ot;st++){let ft=D[st];et=[];for(let mt=0,St=ft.length,Xt=St-1,kt=mt+1;mt<St;mt++,Xt++,kt++)Xt===St&&(Xt=0),kt===St&&(kt=0),et[mt]=j(ft[mt],ft[Xt],ft[kt]);J.push(et),vt=vt.concat(et)}let rt;if(m===0)rt=ts.triangulateShape(C,D);else{let st=[],ot=[];for(let ft=0;ft<m;ft++){let mt=ft/m,St=d*Math.cos(mt*Math.PI/2),Xt=g*Math.sin(mt*Math.PI/2)+M;for(let kt=0,$t=C.length;kt<$t;kt++){let Kt=k(C[kt],W[kt],Xt);Mt(Kt.x,Kt.y,-St),mt===0&&st.push(Kt)}for(let kt=0,$t=N;kt<$t;kt++){let Kt=D[kt];et=J[kt];let F=[];for(let xe=0,ae=Kt.length;xe<ae;xe++){let E=k(Kt[xe],et[xe],Xt);Mt(E.x,E.y,-St),mt===0&&F.push(E)}mt===0&&ot.push(F)}}rt=ts.triangulateShape(st,ot)}let Zt=rt.length,Nt=g+M;for(let st=0;st<V;st++){let ot=u?k(L[st],vt[st],Nt):L[st];S?(R.copy(A.normals[0]).multiplyScalar(ot.x),b.copy(A.binormals[0]).multiplyScalar(ot.y),_.copy(P[0]).add(R).add(b),Mt(_.x,_.y,_.z)):Mt(ot.x,ot.y,0)}for(let st=1;st<=h;st++)for(let ot=0;ot<V;ot++){let ft=u?k(L[ot],vt[ot],Nt):L[ot];S?(R.copy(A.normals[st]).multiplyScalar(ft.x),b.copy(A.binormals[st]).multiplyScalar(ft.y),_.copy(P[st]).add(R).add(b),Mt(_.x,_.y,_.z)):Mt(ft.x,ft.y,f/h*st)}for(let st=m-1;st>=0;st--){let ot=st/m,ft=d*Math.cos(ot*Math.PI/2),mt=g*Math.sin(ot*Math.PI/2)+M;for(let St=0,Xt=C.length;St<Xt;St++){let kt=k(C[St],W[St],mt);Mt(kt.x,kt.y,f+ft)}for(let St=0,Xt=D.length;St<Xt;St++){let kt=D[St];et=J[St];for(let $t=0,Kt=kt.length;$t<Kt;$t++){let F=k(kt[$t],et[$t],mt);S?Mt(F.x,F.y+P[h-1].y,P[h-1].x+ft):Mt(F.x,F.y,f+ft)}}}ne(),tt();function ne(){let st=s.length/3;if(u){let ot=0,ft=V*ot;for(let mt=0;mt<Zt;mt++){let St=rt[mt];Dt(St[2]+ft,St[1]+ft,St[0]+ft)}ot=h+m*2,ft=V*ot;for(let mt=0;mt<Zt;mt++){let St=rt[mt];Dt(St[0]+ft,St[1]+ft,St[2]+ft)}}else{for(let ot=0;ot<Zt;ot++){let ft=rt[ot];Dt(ft[2],ft[1],ft[0])}for(let ot=0;ot<Zt;ot++){let ft=rt[ot];Dt(ft[0]+V*h,ft[1]+V*h,ft[2]+V*h)}}n.addGroup(st,s.length/3-st,0)}function tt(){let st=s.length/3,ot=0;it(C,ot),ot+=C.length;for(let ft=0,mt=D.length;ft<mt;ft++){let St=D[ft];it(St,ot),ot+=St.length}n.addGroup(st,s.length/3-st,1)}function it(st,ot){let ft=st.length;for(;--ft>=0;){let mt=ft,St=ft-1;St<0&&(St=st.length-1);for(let Xt=0,kt=h+m*2;Xt<kt;Xt++){let $t=V*Xt,Kt=V*(Xt+1),F=ot+mt+$t,xe=ot+St+$t,ae=ot+St+Kt,E=ot+mt+Kt;It(F,xe,ae,E)}}}function Mt(st,ot,ft){l.push(st),l.push(ot),l.push(ft)}function Dt(st,ot,ft){Yt(st),Yt(ot),Yt(ft);let mt=s.length/3,St=T.generateTopUV(n,s,mt-3,mt-2,mt-1);he(St[0]),he(St[1]),he(St[2])}function It(st,ot,ft,mt){Yt(st),Yt(ot),Yt(mt),Yt(ot),Yt(ft),Yt(mt);let St=s.length/3,Xt=T.generateSideWallUV(n,s,St-6,St-3,St-2,St-1);he(Xt[0]),he(Xt[1]),he(Xt[3]),he(Xt[1]),he(Xt[2]),he(Xt[3])}function Yt(st){s.push(l[st*3+0]),s.push(l[st*3+1]),s.push(l[st*3+2])}function he(st){r.push(st.x),r.push(st.y)}}}copy(t){return super.copy(t),this.parameters=Object.assign({},t.parameters),this}toJSON(){let t=super.toJSON(),e=this.parameters.shapes,n=this.parameters.options;return Ef(e,n,t)}static fromJSON(t,e){let n=[];for(let r=0,o=t.shapes.length;r<o;r++){let a=e[t.shapes[r]];n.push(a)}let s=t.options.extrudePath;return s!==void 0&&(t.options.extrudePath=new ic[s.type]().fromJSON(s)),new i(n,t.options)}},Tf={generateTopUV:function(i,t,e,n,s){let r=t[e*3],o=t[e*3+1],a=t[n*3],l=t[n*3+1],c=t[s*3],h=t[s*3+1];return[new xt(r,o),new xt(a,l),new xt(c,h)]},generateSideWallUV:function(i,t,e,n,s,r){let o=t[e*3],a=t[e*3+1],l=t[e*3+2],c=t[n*3],h=t[n*3+1],f=t[n*3+2],u=t[s*3],d=t[s*3+1],g=t[s*3+2],M=t[r*3],m=t[r*3+1],p=t[r*3+2];return Math.abs(a-h)<Math.abs(o-c)?[new xt(o,1-l),new xt(c,1-f),new xt(u,1-g),new xt(M,1-p)]:[new xt(a,1-l),new xt(h,1-f),new xt(d,1-g),new xt(m,1-p)]}};function Ef(i,t,e){if(e.shapes=[],Array.isArray(i))for(let n=0,s=i.length;n<s;n++){let r=i[n];e.shapes.push(r.uuid)}else e.shapes.push(i.uuid);return e.options=Object.assign({},t),t.extrudePath!==void 0&&(e.options.extrudePath=t.extrudePath.toJSON()),e}var Rr=class i extends sn{constructor(t=[new xt(0,-.5),new xt(.5,0),new xt(0,.5)],e=12,n=0,s=Math.PI*2){super(),this.type="LatheGeometry",this.parameters={points:t,segments:e,phiStart:n,phiLength:s},e=Math.floor(e),s=ce(s,0,Math.PI*2);let r=[],o=[],a=[],l=[],c=[],h=1/e,f=new O,u=new xt,d=new O,g=new O,M=new O,m=0,p=0;for(let T=0;T<=t.length-1;T++)switch(T){case 0:m=t[T+1].x-t[T].x,p=t[T+1].y-t[T].y,d.x=p*1,d.y=-m,d.z=p*0,M.copy(d),d.normalize(),l.push(d.x,d.y,d.z);break;case t.length-1:l.push(M.x,M.y,M.z);break;default:m=t[T+1].x-t[T].x,p=t[T+1].y-t[T].y,d.x=p*1,d.y=-m,d.z=p*0,g.copy(d),d.x+=M.x,d.y+=M.y,d.z+=M.z,d.normalize(),l.push(d.x,d.y,d.z),M.copy(g)}for(let T=0;T<=e;T++){let P=n+T*h*s,S=Math.sin(P),A=Math.cos(P);for(let b=0;b<=t.length-1;b++){f.x=t[b].x*S,f.y=t[b].y,f.z=t[b].x*A,o.push(f.x,f.y,f.z),u.x=T/e,u.y=b/(t.length-1),a.push(u.x,u.y);let R=l[3*b+0]*S,_=l[3*b+1],w=l[3*b+0]*A;c.push(R,_,w)}}for(let T=0;T<e;T++)for(let P=0;P<t.length-1;P++){let S=P+T*t.length,A=S,b=S+t.length,R=S+t.length+1,_=S+1;r.push(A,b,_),r.push(R,_,b)}this.setIndex(r),this.setAttribute("position",new Oe(o,3)),this.setAttribute("uv",new Oe(a,2)),this.setAttribute("normal",new Oe(c,3))}copy(t){return super.copy(t),this.parameters=Object.assign({},t.parameters),this}static fromJSON(t){return new i(t.points,t.segments,t.phiStart,t.phiLength)}};var rs=class i extends sn{constructor(t=1,e=1,n=1,s=1){super(),this.type="PlaneGeometry",this.parameters={width:t,height:e,widthSegments:n,heightSegments:s};let r=t/2,o=e/2,a=Math.floor(n),l=Math.floor(s),c=a+1,h=l+1,f=t/a,u=e/l,d=[],g=[],M=[],m=[];for(let p=0;p<h;p++){let T=p*u-o;for(let P=0;P<c;P++){let S=P*f-r;g.push(S,-T,0),M.push(0,0,1),m.push(P/a),m.push(1-p/l)}}for(let p=0;p<l;p++)for(let T=0;T<a;T++){let P=T+c*p,S=T+c*(p+1),A=T+1+c*(p+1),b=T+1+c*p;d.push(P,S,b),d.push(S,A,b)}this.setIndex(d),this.setAttribute("position",new Oe(g,3)),this.setAttribute("normal",new Oe(M,3)),this.setAttribute("uv",new Oe(m,2))}copy(t){return super.copy(t),this.parameters=Object.assign({},t.parameters),this}static fromJSON(t){return new i(t.width,t.height,t.widthSegments,t.heightSegments)}};var Ir=class extends jn{constructor(t){super(),this.isShadowMaterial=!0,this.type="ShadowMaterial",this.color=new se(0),this.transparent=!0,this.fog=!0,this.setValues(t)}copy(t){return super.copy(t),this.color.copy(t.color),this.fog=t.fog,this}};function ls(i){let t={};for(let e in i){t[e]={};for(let n in i[e]){let s=i[e][n];if(Bh(s))s.isRenderTargetTexture?(Jt("UniformsUtils: Textures of render targets cannot be cloned via cloneUniforms() or mergeUniforms()."),t[e][n]=null):t[e][n]=s.clone();else if(Array.isArray(s))if(Bh(s[0])){let r=[];for(let o=0,a=s.length;o<a;o++)r[o]=s[o].clone();t[e][n]=r}else t[e][n]=s.slice();else t[e][n]=s}}return t}function rn(i){let t={};for(let e=0;e<i.length;e++){let n=ls(i[e]);for(let s in n)t[s]=n[s]}return t}function Bh(i){return i&&(i.isColor||i.isMatrix3||i.isMatrix4||i.isVector2||i.isVector3||i.isVector4||i.isTexture||i.isQuaternion)}function Af(i){let t=[];for(let e=0;e<i.length;e++)t.push(i[e].clone());return t}function Oc(i){let t=i.getRenderTarget();return t===null?i.outputColorSpace:t.isXRRenderTarget===!0?t.texture.colorSpace:pe.workingColorSpace}var Du={clone:ls,merge:rn},Cf=`void main() {
+	gl_Position = projectionMatrix * modelViewMatrix * vec4( position, 1.0 );
+}`,Rf=`void main() {
+	gl_FragColor = vec4( 1.0, 0.0, 0.0, 1.0 );
+}`,Tn=class extends jn{constructor(t){super(),this.isShaderMaterial=!0,this.type="ShaderMaterial",this.defines={},this.uniforms={},this.uniformsGroups=[],this.vertexShader=Cf,this.fragmentShader=Rf,this.linewidth=1,this.wireframe=!1,this.wireframeLinewidth=1,this.fog=!1,this.lights=!1,this.clipping=!1,this.forceSinglePass=!0,this.extensions={clipCullDistance:!1,multiDraw:!1},this.defaultAttributeValues={color:[1,1,1],uv:[0,0],uv1:[0,0]},this.index0AttributeName=void 0,this.uniformsNeedUpdate=!1,this.glslVersion=null,t!==void 0&&this.setValues(t)}copy(t){return super.copy(t),this.fragmentShader=t.fragmentShader,this.vertexShader=t.vertexShader,this.uniforms=ls(t.uniforms),this.uniformsGroups=Af(t.uniformsGroups),this.defines=Object.assign({},t.defines),this.wireframe=t.wireframe,this.wireframeLinewidth=t.wireframeLinewidth,this.fog=t.fog,this.lights=t.lights,this.clipping=t.clipping,this.extensions=Object.assign({},t.extensions),this.glslVersion=t.glslVersion,this.defaultAttributeValues=Object.assign({},t.defaultAttributeValues),this.index0AttributeName=t.index0AttributeName,this.uniformsNeedUpdate=t.uniformsNeedUpdate,this}toJSON(t){let e=super.toJSON(t);e.glslVersion=this.glslVersion,e.uniforms={};for(let s in this.uniforms){let o=this.uniforms[s].value;o&&o.isTexture?e.uniforms[s]={type:"t",value:o.toJSON(t).uuid}:o&&o.isColor?e.uniforms[s]={type:"c",value:o.getHex()}:o&&o.isVector2?e.uniforms[s]={type:"v2",value:o.toArray()}:o&&o.isVector3?e.uniforms[s]={type:"v3",value:o.toArray()}:o&&o.isVector4?e.uniforms[s]={type:"v4",value:o.toArray()}:o&&o.isMatrix3?e.uniforms[s]={type:"m3",value:o.toArray()}:o&&o.isMatrix4?e.uniforms[s]={type:"m4",value:o.toArray()}:e.uniforms[s]={value:o}}Object.keys(this.defines).length>0&&(e.defines=this.defines),e.vertexShader=this.vertexShader,e.fragmentShader=this.fragmentShader,e.lights=this.lights,e.clipping=this.clipping;let n={};for(let s in this.extensions)this.extensions[s]===!0&&(n[s]=!0);return Object.keys(n).length>0&&(e.extensions=n),e}fromJSON(t,e){if(super.fromJSON(t,e),t.uniforms!==void 0)for(let n in t.uniforms){let s=t.uniforms[n];switch(this.uniforms[n]={},s.type){case"t":this.uniforms[n].value=e[s.value]||null;break;case"c":this.uniforms[n].value=new se().setHex(s.value);break;case"v2":this.uniforms[n].value=new xt().fromArray(s.value);break;case"v3":this.uniforms[n].value=new O().fromArray(s.value);break;case"v4":this.uniforms[n].value=new Le().fromArray(s.value);break;case"m3":this.uniforms[n].value=new ie().fromArray(s.value);break;case"m4":this.uniforms[n].value=new Ee().fromArray(s.value);break;default:this.uniforms[n].value=s.value}}if(t.defines!==void 0&&(this.defines=t.defines),t.vertexShader!==void 0&&(this.vertexShader=t.vertexShader),t.fragmentShader!==void 0&&(this.fragmentShader=t.fragmentShader),t.glslVersion!==void 0&&(this.glslVersion=t.glslVersion),t.extensions!==void 0)for(let n in t.extensions)this.extensions[n]=t.extensions[n];return t.lights!==void 0&&(this.lights=t.lights),t.clipping!==void 0&&(this.clipping=t.clipping),this}},ea=class extends Tn{constructor(t){super(t),this.isRawShaderMaterial=!0,this.type="RawShaderMaterial"}},Di=class extends jn{constructor(t){super(),this.isMeshStandardMaterial=!0,this.type="MeshStandardMaterial",this.defines={STANDARD:""},this.color=new se(16777215),this.roughness=1,this.metalness=0,this.map=null,this.lightMap=null,this.lightMapIntensity=1,this.aoMap=null,this.aoMapIntensity=1,this.emissive=new se(0),this.emissiveIntensity=1,this.emissiveMap=null,this.bumpMap=null,this.bumpScale=1,this.normalMap=null,this.normalMapType=il,this.normalScale=new xt(1,1),this.displacementMap=null,this.displacementScale=1,this.displacementBias=0,this.roughnessMap=null,this.metalnessMap=null,this.alphaMap=null,this.envMap=null,this.envMapRotation=new pi,this.envMapIntensity=1,this.wireframe=!1,this.wireframeLinewidth=1,this.wireframeLinecap="round",this.wireframeLinejoin="round",this.flatShading=!1,this.fog=!0,this.setValues(t)}copy(t){return super.copy(t),this.defines={STANDARD:""},this.color.copy(t.color),this.roughness=t.roughness,this.metalness=t.metalness,this.map=t.map,this.lightMap=t.lightMap,this.lightMapIntensity=t.lightMapIntensity,this.aoMap=t.aoMap,this.aoMapIntensity=t.aoMapIntensity,this.emissive.copy(t.emissive),this.emissiveMap=t.emissiveMap,this.emissiveIntensity=t.emissiveIntensity,this.bumpMap=t.bumpMap,this.bumpScale=t.bumpScale,this.normalMap=t.normalMap,this.normalMapType=t.normalMapType,this.normalScale.copy(t.normalScale),this.displacementMap=t.displacementMap,this.displacementScale=t.displacementScale,this.displacementBias=t.displacementBias,this.roughnessMap=t.roughnessMap,this.metalnessMap=t.metalnessMap,this.alphaMap=t.alphaMap,this.envMap=t.envMap,this.envMapRotation.copy(t.envMapRotation),this.envMapIntensity=t.envMapIntensity,this.wireframe=t.wireframe,this.wireframeLinewidth=t.wireframeLinewidth,this.wireframeLinecap=t.wireframeLinecap,this.wireframeLinejoin=t.wireframeLinejoin,this.flatShading=t.flatShading,this.fog=t.fog,this}};var na=class extends jn{constructor(t){super(),this.isMeshDepthMaterial=!0,this.type="MeshDepthMaterial",this.depthPacking=mu,this.map=null,this.alphaMap=null,this.displacementMap=null,this.displacementScale=1,this.displacementBias=0,this.wireframe=!1,this.wireframeLinewidth=1,this.setValues(t)}copy(t){return super.copy(t),this.depthPacking=t.depthPacking,this.map=t.map,this.alphaMap=t.alphaMap,this.displacementMap=t.displacementMap,this.displacementScale=t.displacementScale,this.displacementBias=t.displacementBias,this.wireframe=t.wireframe,this.wireframeLinewidth=t.wireframeLinewidth,this}},ia=class extends jn{constructor(t){super(),this.isMeshDistanceMaterial=!0,this.type="MeshDistanceMaterial",this.map=null,this.alphaMap=null,this.displacementMap=null,this.displacementScale=1,this.displacementBias=0,this.setValues(t)}copy(t){return super.copy(t),this.map=t.map,this.alphaMap=t.alphaMap,this.displacementMap=t.displacementMap,this.displacementScale=t.displacementScale,this.displacementBias=t.displacementBias,this}};function ws(i,t){return!i||i.constructor===t?i:typeof t.BYTES_PER_ELEMENT=="number"?new t(i):Array.prototype.slice.call(i)}function Kl(i){return i!==void 0&&i.inTangents!==void 0&&i.outTangents!==void 0}var Ni=class{constructor(t,e,n,s){this.parameterPositions=t,this._cachedIndex=0,this.resultBuffer=s!==void 0?s:new e.constructor(n),this.sampleValues=e,this.valueSize=n,this.settings=null,this.DefaultSettings_={}}evaluate(t){let e=this.parameterPositions,n=this._cachedIndex,s=e[n],r=e[n-1];n:{t:{let o;e:{i:if(!(t<s)){for(let a=n+2;;){if(s===void 0){if(t<r)break i;return n=e.length,this._cachedIndex=n,this.copySampleValue_(n-1)}if(n===a)break;if(r=s,s=e[++n],t<s)break t}o=e.length;break e}if(!(t>=r)){let a=e[1];t<a&&(n=2,r=a);for(let l=n-2;;){if(r===void 0)return this._cachedIndex=0,this.copySampleValue_(0);if(n===l)break;if(s=r,r=e[--n-1],t>=r)break t}o=n,n=0;break e}break n}for(;n<o;){let a=n+o>>>1;t<e[a]?o=a:n=a+1}if(s=e[n],r=e[n-1],r===void 0)return this._cachedIndex=0,this.copySampleValue_(0);if(s===void 0)return n=e.length,this._cachedIndex=n,this.copySampleValue_(n-1)}this._cachedIndex=n,this.intervalChanged_(n,r,s)}return this.interpolate_(n,r,t,s)}getSettings_(){return this.settings||this.DefaultSettings_}copySampleValue_(t){let e=this.resultBuffer,n=this.sampleValues,s=this.valueSize,r=t*s;for(let o=0;o!==s;++o)e[o]=n[r+o];return e}interpolate_(){throw new Error("THREE.Interpolant: Call to abstract method.")}intervalChanged_(){}},sa=class extends Ni{constructor(t,e,n,s){super(t,e,n,s),this._weightPrev=-0,this._offsetPrev=-0,this._weightNext=-0,this._offsetNext=-0,this.DefaultSettings_={endingStart:tc,endingEnd:tc}}intervalChanged_(t,e,n){let s=this.parameterPositions,r=t-2,o=t+1,a=s[r],l=s[o];if(a===void 0)switch(this.getSettings_().endingStart){case ec:r=t,a=2*e-n;break;case nc:r=s.length-2,a=e+s[r]-s[r+1];break;default:r=t,a=n}if(l===void 0)switch(this.getSettings_().endingEnd){case ec:o=t,l=2*n-e;break;case nc:o=1,l=n+s[1]-s[0];break;default:o=t-1,l=e}let c=(n-e)*.5,h=this.valueSize;this._weightPrev=c/(e-a),this._weightNext=c/(l-n),this._offsetPrev=r*h,this._offsetNext=o*h}interpolate_(t,e,n,s){let r=this.resultBuffer,o=this.sampleValues,a=this.valueSize,l=t*a,c=l-a,h=this._offsetPrev,f=this._offsetNext,u=this._weightPrev,d=this._weightNext,g=(n-e)/(s-e),M=g*g,m=M*g,p=-u*m+2*u*M-u*g,T=(1+u)*m+(-1.5-2*u)*M+(-.5+u)*g+1,P=(-1-d)*m+(1.5+d)*M+.5*g,S=d*m-d*M;for(let A=0;A!==a;++A)r[A]=p*o[h+A]+T*o[c+A]+P*o[l+A]+S*o[f+A];return r}},ra=class extends Ni{constructor(t,e,n,s){super(t,e,n,s)}interpolate_(t,e,n,s){let r=this.resultBuffer,o=this.sampleValues,a=this.valueSize,l=t*a,c=l-a,h=(n-e)/(s-e),f=1-h;for(let u=0;u!==a;++u)r[u]=o[c+u]*f+o[l+u]*h;return r}},oa=class extends Ni{constructor(t,e,n,s){super(t,e,n,s)}interpolate_(t){return this.copySampleValue_(t-1)}},aa=class extends Ni{interpolate_(t,e,n,s){let r=this.resultBuffer,o=this.sampleValues,a=this.valueSize,l=t*a,c=l-a,h=this.inTangents,f=this.outTangents;if(!h||!f){let g=(n-e)/(s-e),M=1-g;for(let m=0;m!==a;++m)r[m]=o[c+m]*M+o[l+m]*g;return r}let u=a*2,d=t-1;for(let g=0;g!==a;++g){let M=o[c+g],m=o[l+g],p=d*u+g*2,T=f[p],P=f[p+1],S=t*u+g*2,A=h[S],b=h[S+1],R=Pf(n,e,T,A,s);r[g]=Nu(R,M,P,b,m)}return r}};function Nu(i,t,e,n,s){let r=1-i;return r*r*r*t+3*r*r*i*e+3*r*i*i*n+i*i*i*s}function If(i,t,e,n,s){let r=1-i;return 3*r*r*(e-t)+6*r*i*(n-e)+3*i*i*(s-n)}function Pf(i,t,e,n,s){let r=(i-t)/(s-t);for(let o=0;o<8;o++){let a=Nu(r,t,e,n,s)-i;if(Math.abs(a)<1e-10)break;let l=If(r,t,e,n,s);if(Math.abs(l)<1e-10)break;r=Math.max(0,Math.min(1,r-a/l))}return r}var En=class{constructor(t,e,n,s){if(t===void 0)throw new Error("THREE.KeyframeTrack: track name is undefined");if(e===void 0||e.length===0)throw new Error("THREE.KeyframeTrack: no keyframes in track named "+t);this.name=t,this.times=ws(e,this.TimeBufferType),this.values=ws(n,this.ValueBufferType),this.setInterpolation(s||this.DefaultInterpolation)}static toJSON(t){let e=t.constructor,n;if(e.toJSON!==this.toJSON)n=e.toJSON(t);else{n={name:t.name,times:ws(t.times,Array),values:ws(t.values,Array)};let s=t.getInterpolation();s!==t.DefaultInterpolation&&(n.interpolation=s),Kl(t.settings)&&(n.settings={inTangents:ws(t.settings.inTangents,Array),outTangents:ws(t.settings.outTangents,Array)})}return n.type=t.ValueTypeName,n}InterpolantFactoryMethodDiscrete(t){return new oa(this.times,this.values,this.getValueSize(),t)}InterpolantFactoryMethodLinear(t){return new ra(this.times,this.values,this.getValueSize(),t)}InterpolantFactoryMethodSmooth(t){return new sa(this.times,this.values,this.getValueSize(),t)}InterpolantFactoryMethodBezier(t){let e=new aa(this.times,this.values,this.getValueSize(),t);return this.settings&&(e.inTangents=this.settings.inTangents,e.outTangents=this.settings.outTangents),e}setInterpolation(t){let e;switch(t){case ur:e=this.InterpolantFactoryMethodDiscrete;break;case zo:e=this.InterpolantFactoryMethodLinear;break;case Ao:e=this.InterpolantFactoryMethodSmooth;break;case Ql:e=this.InterpolantFactoryMethodBezier;break}if(e===void 0){let n="unsupported interpolation for "+this.ValueTypeName+" keyframe track named "+this.name;if(this.createInterpolant===void 0)if(t!==this.DefaultInterpolation)this.setInterpolation(this.DefaultInterpolation);else throw new Error(n);return Jt("KeyframeTrack:",n),this}return this.createInterpolant=e,this}getInterpolation(){switch(this.createInterpolant){case this.InterpolantFactoryMethodDiscrete:return ur;case this.InterpolantFactoryMethodLinear:return zo;case this.InterpolantFactoryMethodSmooth:return Ao;case this.InterpolantFactoryMethodBezier:return Ql}}getValueSize(){return this.values.length/this.times.length}shift(t){if(t!==0){let e=this.times;for(let n=0,s=e.length;n!==s;++n)e[n]+=t}return this}scale(t){if(t!==1){let e=this.times;for(let n=0,s=e.length;n!==s;++n)e[n]*=t;Kl(this.settings)&&(zh(this.settings.inTangents,t),zh(this.settings.outTangents,t))}return this}trim(t,e){let n=this.times,s=n.length,r=0,o=s-1;for(;r!==s&&n[r]<t;)++r;for(;o!==-1&&n[o]>e;)--o;if(++o,r!==0||o!==s){r>=o&&(o=Math.max(o,1),r=o-1);let a=this.getValueSize();this.times=n.slice(r,o),this.values=this.values.slice(r*a,o*a)}return this}validate(){let t=!0,e=this.getValueSize();e-Math.floor(e)!==0&&(jt("KeyframeTrack: Invalid value size in track.",this),t=!1);let n=this.times,s=this.values,r=n.length;r===0&&(jt("KeyframeTrack: Track is empty.",this),t=!1);let o=null;for(let a=0;a!==r;a++){let l=n[a];if(typeof l=="number"&&isNaN(l)){jt("KeyframeTrack: Time is not a valid number.",this,a,l),t=!1;break}if(o!==null&&o>l){jt("KeyframeTrack: Out of order keys.",this,a,l,o),t=!1;break}o=l}if(s!==void 0&&Nd(s))for(let a=0,l=s.length;a!==l;++a){let c=s[a];if(isNaN(c)){jt("KeyframeTrack: Value is not a valid number.",this,a,c),t=!1;break}}return t}optimize(){let t=this.times.slice(),e=this.values.slice(),n=this.getValueSize(),s=this.getInterpolation()===Ao,r=t.length-1,o=1;for(let a=1;a<r;++a){let l=!1,c=t[a],h=t[a+1];if(c!==h&&(a!==1||c!==t[0]))if(s)l=!0;else{let f=a*n,u=f-n,d=f+n;for(let g=0;g!==n;++g){let M=e[f+g];if(M!==e[u+g]||M!==e[d+g]){l=!0;break}}}if(l){if(a!==o){t[o]=t[a];let f=a*n,u=o*n;for(let d=0;d!==n;++d)e[u+d]=e[f+d]}++o}}if(r>0){t[o]=t[r];for(let a=r*n,l=o*n,c=0;c!==n;++c)e[l+c]=e[a+c];++o}return o!==t.length?(this.times=t.slice(0,o),this.values=e.slice(0,o*n)):(this.times=t,this.values=e),this}clone(){let t=this.times.slice(),e=this.values.slice(),n=this.constructor,s=new n(this.name,t,e);return s.createInterpolant=this.createInterpolant,Kl(this.settings)&&(s.settings={inTangents:this.settings.inTangents.slice(),outTangents:this.settings.outTangents.slice()}),s}};function zh(i,t){for(let e=0,n=i.length;e!==n;e+=2)i[e]*=t}En.prototype.ValueTypeName="";En.prototype.TimeBufferType=Float32Array;En.prototype.ValueBufferType=Float32Array;En.prototype.DefaultInterpolation=zo;var Ui=class extends En{constructor(t,e,n){super(t,e,n)}};Ui.prototype.ValueTypeName="bool";Ui.prototype.ValueBufferType=Array;Ui.prototype.DefaultInterpolation=ur;Ui.prototype.InterpolantFactoryMethodLinear=void 0;Ui.prototype.InterpolantFactoryMethodSmooth=void 0;var la=class extends En{constructor(t,e,n,s){super(t,e,n,s)}};la.prototype.ValueTypeName="color";var ca=class extends En{constructor(t,e,n,s){super(t,e,n,s)}};ca.prototype.ValueTypeName="number";var ha=class extends Ni{constructor(t,e,n,s){super(t,e,n,s)}interpolate_(t,e,n,s){let r=this.resultBuffer,o=this.sampleValues,a=this.valueSize,l=(n-e)/(s-e),c=t*a;for(let h=c+a;c!==h;c+=4)Jn.slerpFlat(r,0,o,c-a,o,c,l);return r}},Pr=class extends En{constructor(t,e,n,s){super(t,e,n,s)}InterpolantFactoryMethodLinear(t){return new ha(this.times,this.values,this.getValueSize(),t)}};Pr.prototype.ValueTypeName="quaternion";Pr.prototype.InterpolantFactoryMethodSmooth=void 0;var Fi=class extends En{constructor(t,e,n){super(t,e,n)}};Fi.prototype.ValueTypeName="string";Fi.prototype.ValueBufferType=Array;Fi.prototype.DefaultInterpolation=ur;Fi.prototype.InterpolantFactoryMethodLinear=void 0;Fi.prototype.InterpolantFactoryMethodSmooth=void 0;var ua=class extends En{constructor(t,e,n,s){super(t,e,n,s)}};ua.prototype.ValueTypeName="vector";var da=class{constructor(t,e,n){let s=this,r=!1,o=0,a=0,l,c=[];this.onStart=void 0,this.onLoad=t,this.onProgress=e,this.onError=n,this._abortController=null,this.itemStart=function(h){a++,r===!1&&s.onStart!==void 0&&s.onStart(h,o,a),r=!0},this.itemEnd=function(h){o++,s.onProgress!==void 0&&s.onProgress(h,o,a),o===a&&(r=!1,s.onLoad!==void 0&&s.onLoad())},this.itemError=function(h){s.onError!==void 0&&s.onError(h)},this.resolveURL=function(h){return h=h.normalize("NFC"),l?l(h):h},this.setURLModifier=function(h){return l=h,this},this.addHandler=function(h,f){return c.push(h,f),this},this.removeHandler=function(h){let f=c.indexOf(h);return f!==-1&&c.splice(f,2),this},this.getHandler=function(h){for(let f=0,u=c.length;f<u;f+=2){let d=c[f],g=c[f+1];if(d.global&&(d.lastIndex=0),d.test(h))return g}return null},this.abort=function(){return this.abortController.abort(),this._abortController=null,this}}get abortController(){return this._abortController||(this._abortController=new AbortController),this._abortController}},Uu=new da,fa=class{constructor(t){this.manager=t!==void 0?t:Uu,this.crossOrigin="anonymous",this.withCredentials=!1,this.path="",this.resourcePath="",this.requestHeader={},typeof __THREE_DEVTOOLS__<"u"&&__THREE_DEVTOOLS__.dispatchEvent(new CustomEvent("observe",{detail:this}))}load(){}loadAsync(t,e){let n=this;return new Promise(function(s,r){n.load(t,s,e,r)})}parse(){}setCrossOrigin(t){return this.crossOrigin=t,this}setWithCredentials(t){return this.withCredentials=t,this}setPath(t){return this.path=t,this}setResourcePath(t){return this.resourcePath=t,this}setRequestHeader(t){return this.requestHeader=t,this}abort(){return this}};fa.DEFAULT_MATERIAL_NAME="__DEFAULT";var Lr=class extends Ke{constructor(t,e=1){super(),this.isLight=!0,this.type="Light",this.color=new se(t),this.intensity=e}copy(t,e){return super.copy(t,e),this.color.copy(t.color),this.intensity=t.intensity,this}toJSON(t){let e=super.toJSON(t);return e.object.color=this.color.getHex(),e.object.intensity=this.intensity,e}},Vs=class extends Lr{constructor(t,e,n){super(t,n),this.isHemisphereLight=!0,this.type="HemisphereLight",this.position.copy(Ke.DEFAULT_UP),this.updateMatrix(),this.groundColor=new se(e)}copy(t,e){return super.copy(t,e),this.groundColor.copy(t.groundColor),this}toJSON(t){let e=super.toJSON(t);return e.object.groundColor=this.groundColor.getHex(),e}},jl=new Ee,kh=new O,Vh=new O,pa=class{constructor(t){this.camera=t,this.intensity=1,this.bias=0,this.biasNode=null,this.normalBias=0,this.radius=1,this.blurSamples=8,this.mapSize=new xt(512,512),this.mapType=xn,this.map=null,this.mapPass=null,this.matrix=new Ee,this.autoUpdate=!0,this.needsUpdate=!1,this._frustum=new Fs,this._frameExtents=new xt(1,1),this._viewportCount=1,this._viewports=[new Le(0,0,1,1)]}getViewportCount(){return this._viewportCount}getCamera(){return this.camera}getFrustum(){return this._frustum}updateMatrices(t){let e=this.camera;kh.setFromMatrixPosition(t.matrixWorld),e.position.copy(kh),Vh.setFromMatrixPosition(t.target.matrixWorld),e.lookAt(Vh),e.updateMatrixWorld(),this._updateMatrix(e,this.matrix,this._frustum)}_updateMatrix(t,e,n,s){jl.multiplyMatrices(t.projectionMatrix,t.matrixWorldInverse),n.setFromProjectionMatrix(jl,t.coordinateSystem,t.reversedDepth);let r=this._frameExtents,o=s?s.z/r.x:1,a=s?s.w/r.y:1,l=s?s.x/r.x:0,c=s?s.y/r.y:0;t.coordinateSystem===Rs||t.reversedDepth?e.set(.5*o,0,0,.5*o+l,0,.5*a,0,.5*a+c,0,0,1,0,0,0,0,1):e.set(.5*o,0,0,.5*o+l,0,.5*a,0,.5*a+c,0,0,.5,.5,0,0,0,1),e.multiply(jl)}getViewport(t){return this._viewports[t]}getFrameExtents(){return this._frameExtents}dispose(){this.map&&this.map.dispose(),this.mapPass&&this.mapPass.dispose()}copy(t){return this.camera=t.camera.clone(),this.intensity=t.intensity,this.bias=t.bias,this.radius=t.radius,this.autoUpdate=t.autoUpdate,this.needsUpdate=t.needsUpdate,this.normalBias=t.normalBias,this.blurSamples=t.blurSamples,this.mapSize.copy(t.mapSize),this.biasNode=t.biasNode,this}clone(){return new this.constructor().copy(this)}toJSON(){let t={};return t.intensity=this.intensity,t.bias=this.bias,t.normalBias=this.normalBias,t.radius=this.radius,t.blurSamples=this.blurSamples,t.mapSize=this.mapSize.toArray(),t.camera=this.camera.toJSON(!1).object,delete t.camera.matrix,t}},To=new O,Eo=new Jn,qn=new O,Dr=class extends Ke{constructor(){super(),this.isCamera=!0,this.type="Camera",this.matrixWorldInverse=new Ee,this.projectionMatrix=new Ee,this.projectionMatrixInverse=new Ee,this.coordinateSystem=zn,this._reversedDepth=!1}get reversedDepth(){return this._reversedDepth}copy(t,e){return super.copy(t,e),this.matrixWorldInverse.copy(t.matrixWorldInverse),this.projectionMatrix.copy(t.projectionMatrix),this.projectionMatrixInverse.copy(t.projectionMatrixInverse),this.coordinateSystem=t.coordinateSystem,this}getWorldDirection(t){return super.getWorldDirection(t).negate()}updateMatrixWorld(t){super.updateMatrixWorld(t),this.matrixWorld.decompose(To,Eo,qn),qn.x===1&&qn.y===1&&qn.z===1?this.matrixWorldInverse.copy(this.matrixWorld).invert():this.matrixWorldInverse.compose(To,Eo,qn.set(1,1,1)).invert()}updateWorldMatrix(t,e,n=!1){super.updateWorldMatrix(t,e,n),this.matrixWorld.decompose(To,Eo,qn),qn.x===1&&qn.y===1&&qn.z===1?this.matrixWorldInverse.copy(this.matrixWorld).invert():this.matrixWorldInverse.compose(To,Eo,qn.set(1,1,1)).invert()}clone(){return new this.constructor().copy(this)}},Ii=new O,Gh=new xt,Hh=new xt,fn=class extends Dr{constructor(t=50,e=1,n=.1,s=2e3){super(),this.isPerspectiveCamera=!0,this.type="PerspectiveCamera",this.fov=t,this.zoom=1,this.near=n,this.far=s,this.focus=10,this.aspect=e,this.view=null,this.filmGauge=35,this.filmOffset=0,this.updateProjectionMatrix()}copy(t,e){return super.copy(t,e),this.fov=t.fov,this.zoom=t.zoom,this.near=t.near,this.far=t.far,this.focus=t.focus,this.aspect=t.aspect,this.view=t.view===null?null:Object.assign({},t.view),this.filmGauge=t.filmGauge,this.filmOffset=t.filmOffset,this}setFocalLength(t){let e=.5*this.getFilmHeight()/t;this.fov=ko*2*Math.atan(e),this.updateProjectionMatrix()}getFocalLength(){let t=Math.tan(Ro*.5*this.fov);return .5*this.getFilmHeight()/t}getEffectiveFOV(){return ko*2*Math.atan(Math.tan(Ro*.5*this.fov)/this.zoom)}getFilmWidth(){return this.filmGauge*Math.min(this.aspect,1)}getFilmHeight(){return this.filmGauge/Math.max(this.aspect,1)}getViewBounds(t,e,n){Ii.set(-1,-1,.5).applyMatrix4(this.projectionMatrixInverse),e.set(Ii.x,Ii.y).multiplyScalar(-t/Ii.z),Ii.set(1,1,.5).applyMatrix4(this.projectionMatrixInverse),n.set(Ii.x,Ii.y).multiplyScalar(-t/Ii.z)}getViewSize(t,e){return this.getViewBounds(t,Gh,Hh),e.subVectors(Hh,Gh)}setViewOffset(t,e,n,s,r,o){this.aspect=t/e,this.view===null&&(this.view={enabled:!0,fullWidth:1,fullHeight:1,offsetX:0,offsetY:0,width:1,height:1}),this.view.enabled=!0,this.view.fullWidth=t,this.view.fullHeight=e,this.view.offsetX=n,this.view.offsetY=s,this.view.width=r,this.view.height=o,this.updateProjectionMatrix()}clearViewOffset(){this.view!==null&&(this.view.enabled=!1),this.updateProjectionMatrix()}updateProjectionMatrix(){let t=this.near,e=t*Math.tan(Ro*.5*this.fov)/this.zoom,n=2*e,s=this.aspect*n,r=-.5*s,o=this.view;if(this.view!==null&&this.view.enabled){let l=o.fullWidth,c=o.fullHeight;r+=o.offsetX*s/l,e-=o.offsetY*n/c,s*=o.width/l,n*=o.height/c}let a=this.filmOffset;a!==0&&(r+=t*a/this.getFilmWidth()),this.projectionMatrix.makePerspective(r,r+s,e,e-n,t,this.far,this.coordinateSystem,this.reversedDepth),this.projectionMatrixInverse.copy(this.projectionMatrix).invert()}toJSON(t){let e=super.toJSON(t);return e.object.fov=this.fov,e.object.zoom=this.zoom,e.object.near=this.near,e.object.far=this.far,e.object.focus=this.focus,e.object.aspect=this.aspect,this.view!==null&&(e.object.view=Object.assign({},this.view)),e.object.filmGauge=this.filmGauge,e.object.filmOffset=this.filmOffset,e}};var mi=class extends Dr{constructor(t=-1,e=1,n=1,s=-1,r=.1,o=2e3){super(),this.isOrthographicCamera=!0,this.type="OrthographicCamera",this.zoom=1,this.view=null,this.left=t,this.right=e,this.top=n,this.bottom=s,this.near=r,this.far=o,this.updateProjectionMatrix()}copy(t,e){return super.copy(t,e),this.left=t.left,this.right=t.right,this.top=t.top,this.bottom=t.bottom,this.near=t.near,this.far=t.far,this.zoom=t.zoom,this.view=t.view===null?null:Object.assign({},t.view),this}setViewOffset(t,e,n,s,r,o){this.view===null&&(this.view={enabled:!0,fullWidth:1,fullHeight:1,offsetX:0,offsetY:0,width:1,height:1}),this.view.enabled=!0,this.view.fullWidth=t,this.view.fullHeight=e,this.view.offsetX=n,this.view.offsetY=s,this.view.width=r,this.view.height=o,this.updateProjectionMatrix()}clearViewOffset(){this.view!==null&&(this.view.enabled=!1),this.updateProjectionMatrix()}updateProjectionMatrix(){let t=(this.right-this.left)/(2*this.zoom),e=(this.top-this.bottom)/(2*this.zoom),n=(this.right+this.left)/2,s=(this.top+this.bottom)/2,r=n-t,o=n+t,a=s+e,l=s-e;if(this.view!==null&&this.view.enabled){let c=(this.right-this.left)/this.view.fullWidth/this.zoom,h=(this.top-this.bottom)/this.view.fullHeight/this.zoom;r+=c*this.view.offsetX,o=r+c*this.view.width,a-=h*this.view.offsetY,l=a-h*this.view.height}this.projectionMatrix.makeOrthographic(r,o,a,l,this.near,this.far,this.coordinateSystem,this.reversedDepth),this.projectionMatrixInverse.copy(this.projectionMatrix).invert()}toJSON(t){let e=super.toJSON(t);return e.object.zoom=this.zoom,e.object.left=this.left,e.object.right=this.right,e.object.top=this.top,e.object.bottom=this.bottom,e.object.near=this.near,e.object.far=this.far,this.view!==null&&(e.object.view=Object.assign({},this.view)),e}},ac=class extends pa{constructor(){super(new mi(-5,5,5,-5,.5,500)),this.isDirectionalLightShadow=!0}},Oi=class extends Lr{constructor(t,e){super(t,e),this.isDirectionalLight=!0,this.type="DirectionalLight",this.position.copy(Ke.DEFAULT_UP),this.updateMatrix(),this.target=new Ke,this.shadow=new ac}dispose(){super.dispose(),this.shadow.dispose()}copy(t){return super.copy(t),this.target=t.target.clone(),this.shadow=t.shadow.clone(),this}toJSON(t){let e=super.toJSON(t);return e.object.shadow=this.shadow.toJSON(),e.object.target=this.target.uuid,e}};var Ts=-90,Es=1,ma=class extends Ke{constructor(t,e,n){super(),this.type="CubeCamera",this.renderTarget=n,this.coordinateSystem=null,this.activeMipmapLevel=0;let s=new fn(Ts,Es,t,e);s.layers=this.layers,this.add(s);let r=new fn(Ts,Es,t,e);r.layers=this.layers,this.add(r);let o=new fn(Ts,Es,t,e);o.layers=this.layers,this.add(o);let a=new fn(Ts,Es,t,e);a.layers=this.layers,this.add(a);let l=new fn(Ts,Es,t,e);l.layers=this.layers,this.add(l);let c=new fn(Ts,Es,t,e);c.layers=this.layers,this.add(c)}updateCoordinateSystem(){let t=this.coordinateSystem,e=this.children.concat(),[n,s,r,o,a,l]=e;for(let c of e)this.remove(c);if(t===zn)n.up.set(0,1,0),n.lookAt(1,0,0),s.up.set(0,1,0),s.lookAt(-1,0,0),r.up.set(0,0,-1),r.lookAt(0,1,0),o.up.set(0,0,1),o.lookAt(0,-1,0),a.up.set(0,1,0),a.lookAt(0,0,1),l.up.set(0,1,0),l.lookAt(0,0,-1);else if(t===Rs)n.up.set(0,-1,0),n.lookAt(-1,0,0),s.up.set(0,-1,0),s.lookAt(1,0,0),r.up.set(0,0,1),r.lookAt(0,1,0),o.up.set(0,0,-1),o.lookAt(0,-1,0),a.up.set(0,-1,0),a.lookAt(0,0,1),l.up.set(0,-1,0),l.lookAt(0,0,-1);else throw new Error("THREE.CubeCamera.updateCoordinateSystem(): Invalid coordinate system: "+t);for(let c of e)this.add(c),c.updateMatrixWorld()}update(t,e){this.parent===null&&this.updateMatrixWorld();let{renderTarget:n,activeMipmapLevel:s}=this;this.coordinateSystem!==t.coordinateSystem&&(this.coordinateSystem=t.coordinateSystem,this.updateCoordinateSystem());let[r,o,a,l,c,h]=this.children,f=t.getRenderTarget(),u=t.getActiveCubeFace(),d=t.getActiveMipmapLevel(),g=t.xr.enabled;t.xr.enabled=!1;let M=n.texture.generateMipmaps;n.texture.generateMipmaps=!1;let m=!1;t.isWebGLRenderer===!0?m=t.state.buffers.depth.getReversed():m=t.reversedDepthBuffer,t.setRenderTarget(n,0,s),m&&t.autoClear===!1&&t.clearDepth(),t.render(e,r),t.setRenderTarget(n,1,s),m&&t.autoClear===!1&&t.clearDepth(),t.render(e,o),t.setRenderTarget(n,2,s),m&&t.autoClear===!1&&t.clearDepth(),t.render(e,a),t.setRenderTarget(n,3,s),m&&t.autoClear===!1&&t.clearDepth(),t.render(e,l),t.setRenderTarget(n,4,s),m&&t.autoClear===!1&&t.clearDepth(),t.render(e,c),n.texture.generateMipmaps=M,t.setRenderTarget(n,5,s),m&&t.autoClear===!1&&t.clearDepth(),t.render(e,h),t.setRenderTarget(f,u,d),t.xr.enabled=g,n.texture.needsPMREMUpdate=!0}},ga=class extends fn{constructor(t=[]){super(),this.isArrayCamera=!0,this.isMultiViewCamera=!1,this.cameras=t}};var Bc="\\[\\]\\.:\\/",Lf=new RegExp("["+Bc+"]","g"),zc="[^"+Bc+"]",Df="[^"+Bc.replace("\\.","")+"]",Nf=/((?:WC+[\/:])*)/.source.replace("WC",zc),Uf=/(WCOD+)?/.source.replace("WCOD",Df),Ff=/(?:\.(WC+)(?:\[(.+)\])?)?/.source.replace("WC",zc),Of=/\.(WC+)(?:\[(.+)\])?/.source.replace("WC",zc),Bf=new RegExp("^"+Nf+Uf+Ff+Of+"$"),zf=["material","materials","bones","map"],lc=class{constructor(t,e,n){let s=n||Ie.parseTrackName(e);this._targetGroup=t,this._bindings=t.subscribe_(e,s)}getValue(t,e){this.bind();let n=this._targetGroup.nCachedObjects_,s=this._bindings[n];s!==void 0&&s.getValue(t,e)}setValue(t,e){let n=this._bindings;for(let s=this._targetGroup.nCachedObjects_,r=n.length;s!==r;++s)n[s].setValue(t,e)}bind(){let t=this._bindings;for(let e=this._targetGroup.nCachedObjects_,n=t.length;e!==n;++e)t[e].bind()}unbind(){let t=this._bindings;for(let e=this._targetGroup.nCachedObjects_,n=t.length;e!==n;++e)t[e].unbind()}},Ie=class i{constructor(t,e,n){this.path=e,this.parsedPath=n||i.parseTrackName(e),this.node=i.findNode(t,this.parsedPath.nodeName),this.rootNode=t,this.getValue=this._getValue_unbound,this.setValue=this._setValue_unbound}static create(t,e,n){return t&&t.isAnimationObjectGroup?new i.Composite(t,e,n):new i(t,e,n)}static sanitizeNodeName(t){return t.replace(/\s/g,"_").replace(Lf,"")}static parseTrackName(t){let e=Bf.exec(t);if(e===null)throw new Error("THREE.PropertyBinding: Cannot parse trackName: "+t);let n={nodeName:e[2],objectName:e[3],objectIndex:e[4],propertyName:e[5],propertyIndex:e[6]},s=n.nodeName&&n.nodeName.lastIndexOf(".");if(s!==void 0&&s!==-1){let r=n.nodeName.substring(s+1);zf.indexOf(r)!==-1&&(n.nodeName=n.nodeName.substring(0,s),n.objectName=r)}if(n.propertyName===null||n.propertyName.length===0)throw new Error("THREE.PropertyBinding: can not parse propertyName from trackName: "+t);return n}static findNode(t,e){if(e===void 0||e===""||e==="."||e===-1||e===t.name||e===t.uuid)return t;if(t.skeleton){let n=t.skeleton.getBoneByName(e);if(n!==void 0)return n}if(t.children){let n=function(r){for(let o=0;o<r.length;o++){let a=r[o];if(a.name===e||a.uuid===e)return a;let l=n(a.children);if(l)return l}return null},s=n(t.children);if(s)return s}return null}_getValue_unavailable(){}_setValue_unavailable(){}_getValue_direct(t,e){t[e]=this.targetObject[this.propertyName]}_getValue_array(t,e){let n=this.resolvedProperty;for(let s=0,r=n.length;s!==r;++s)t[e++]=n[s]}_getValue_arrayElement(t,e){t[e]=this.resolvedProperty[this.propertyIndex]}_getValue_toArray(t,e){this.resolvedProperty.toArray(t,e)}_setValue_direct(t,e){this.targetObject[this.propertyName]=t[e]}_setValue_direct_setNeedsUpdate(t,e){this.targetObject[this.propertyName]=t[e],this.targetObject.needsUpdate=!0}_setValue_direct_setMatrixWorldNeedsUpdate(t,e){this.targetObject[this.propertyName]=t[e],this.targetObject.matrixWorldNeedsUpdate=!0}_setValue_array(t,e){let n=this.resolvedProperty;for(let s=0,r=n.length;s!==r;++s)n[s]=t[e++]}_setValue_array_setNeedsUpdate(t,e){let n=this.resolvedProperty;for(let s=0,r=n.length;s!==r;++s)n[s]=t[e++];this.targetObject.needsUpdate=!0}_setValue_array_setMatrixWorldNeedsUpdate(t,e){let n=this.resolvedProperty;for(let s=0,r=n.length;s!==r;++s)n[s]=t[e++];this.targetObject.matrixWorldNeedsUpdate=!0}_setValue_arrayElement(t,e){this.resolvedProperty[this.propertyIndex]=t[e]}_setValue_arrayElement_setNeedsUpdate(t,e){this.resolvedProperty[this.propertyIndex]=t[e],this.targetObject.needsUpdate=!0}_setValue_arrayElement_setMatrixWorldNeedsUpdate(t,e){this.resolvedProperty[this.propertyIndex]=t[e],this.targetObject.matrixWorldNeedsUpdate=!0}_setValue_fromArray(t,e){this.resolvedProperty.fromArray(t,e)}_setValue_fromArray_setNeedsUpdate(t,e){this.resolvedProperty.fromArray(t,e),this.targetObject.needsUpdate=!0}_setValue_fromArray_setMatrixWorldNeedsUpdate(t,e){this.resolvedProperty.fromArray(t,e),this.targetObject.matrixWorldNeedsUpdate=!0}_getValue_unbound(t,e){this.bind(),this.getValue(t,e)}_setValue_unbound(t,e){this.bind(),this.setValue(t,e)}bind(){let t=this.node,e=this.parsedPath,n=e.objectName,s=e.propertyName,r=e.propertyIndex;if(t||(t=i.findNode(this.rootNode,e.nodeName),this.node=t),this.getValue=this._getValue_unavailable,this.setValue=this._setValue_unavailable,!t){Jt("PropertyBinding: No target node found for track: "+this.path+".");return}if(n){let c=e.objectIndex;switch(n){case"materials":if(!t.material){jt("PropertyBinding: Can not bind to material as node does not have a material.",this);return}if(!t.material.materials){jt("PropertyBinding: Can not bind to material.materials as node.material does not have a materials array.",this);return}t=t.material.materials;break;case"bones":if(!t.skeleton){jt("PropertyBinding: Can not bind to bones as node does not have a skeleton.",this);return}t=t.skeleton.bones;for(let h=0;h<t.length;h++)if(t[h].name===c){c=h;break}break;case"map":if("map"in t){t=t.map;break}if(!t.material){jt("PropertyBinding: Can not bind to material as node does not have a material.",this);return}if(!t.material.map){jt("PropertyBinding: Can not bind to material.map as node.material does not have a map.",this);return}t=t.material.map;break;default:if(t[n]===void 0){jt("PropertyBinding: Can not bind to objectName of node undefined.",this);return}t=t[n]}if(c!==void 0){if(t[c]===void 0){jt("PropertyBinding: Trying to bind to objectIndex of objectName, but is undefined.",this,t);return}t=t[c]}}let o=t[s];if(o===void 0){let c=e.nodeName;jt("PropertyBinding: Trying to update property for track: "+c+"."+s+" but it wasn't found.",t);return}let a=this.Versioning.None;this.targetObject=t,t.isMaterial===!0?a=this.Versioning.NeedsUpdate:t.isObject3D===!0&&(a=this.Versioning.MatrixWorldNeedsUpdate);let l=this.BindingType.Direct;if(r!==void 0){if(s==="morphTargetInfluences"){if(!t.geometry){jt("PropertyBinding: Can not bind to morphTargetInfluences because node does not have a geometry.",this);return}if(!t.geometry.morphAttributes){jt("PropertyBinding: Can not bind to morphTargetInfluences because node does not have a geometry.morphAttributes.",this);return}t.morphTargetDictionary[r]!==void 0&&(r=t.morphTargetDictionary[r])}l=this.BindingType.ArrayElement,this.resolvedProperty=o,this.propertyIndex=r}else o.fromArray!==void 0&&o.toArray!==void 0?(l=this.BindingType.HasFromToArray,this.resolvedProperty=o):Array.isArray(o)?(l=this.BindingType.EntireArray,this.resolvedProperty=o):this.propertyName=s;this.getValue=this.GetterByBindingType[l],this.setValue=this.SetterByBindingTypeAndVersioning[l][a]}unbind(){this.node=null,this.getValue=this._getValue_unbound,this.setValue=this._setValue_unbound}};Ie.Composite=lc;Ie.prototype.BindingType={Direct:0,EntireArray:1,ArrayElement:2,HasFromToArray:3};Ie.prototype.Versioning={None:0,NeedsUpdate:1,MatrixWorldNeedsUpdate:2};Ie.prototype.GetterByBindingType=[Ie.prototype._getValue_direct,Ie.prototype._getValue_array,Ie.prototype._getValue_arrayElement,Ie.prototype._getValue_toArray];Ie.prototype.SetterByBindingTypeAndVersioning=[[Ie.prototype._setValue_direct,Ie.prototype._setValue_direct_setNeedsUpdate,Ie.prototype._setValue_direct_setMatrixWorldNeedsUpdate],[Ie.prototype._setValue_array,Ie.prototype._setValue_array_setNeedsUpdate,Ie.prototype._setValue_array_setMatrixWorldNeedsUpdate],[Ie.prototype._setValue_arrayElement,Ie.prototype._setValue_arrayElement_setNeedsUpdate,Ie.prototype._setValue_arrayElement_setMatrixWorldNeedsUpdate],[Ie.prototype._setValue_fromArray,Ie.prototype._setValue_fromArray_setNeedsUpdate,Ie.prototype._setValue_fromArray_setMatrixWorldNeedsUpdate]];var Xx=new Float32Array(1);var Wh=new Ee,Nr=class{constructor(t,e,n=0,s=1/0){this.ray=new Us(t,e),this.near=n,this.far=s,this.camera=null,this.layers=new Ls,this.params={Mesh:{},Line:{threshold:1},LOD:{},Points:{threshold:1},Sprite:{}}}set(t,e){this.ray.set(t,e)}setFromCamera(t,e){e.isPerspectiveCamera?(this.ray.origin.setFromMatrixPosition(e.matrixWorld),this.ray.direction.set(t.x,t.y,.5).unproject(e).sub(this.ray.origin).normalize(),this.camera=e):e.isOrthographicCamera?(this.ray.origin.set(t.x,t.y,e.projectionMatrix.elements[14]).unproject(e),this.ray.direction.set(0,0,-1).transformDirection(e.matrixWorld),this.camera=e):jt("Raycaster: Unsupported camera type: "+e.type)}setFromXRController(t){return Wh.identity().extractRotation(t.matrixWorld),this.ray.origin.setFromMatrixPosition(t.matrixWorld),this.ray.direction.set(0,0,-1).applyMatrix4(Wh),this}intersectObject(t,e=!0,n=[]){return cc(t,this,n,e),n.sort(Xh),n}intersectObjects(t,e=!0,n=[]){for(let s=0,r=t.length;s<r;s++)cc(t[s],this,n,e);return n.sort(Xh),n}};function Xh(i,t){return i.distance-t.distance}function cc(i,t,e,n){let s=!0;if(i.layers.test(t.layers)&&i.raycast(t,e)===!1&&(s=!1),s===!0&&n===!0){let r=i.children;for(let o=0,a=r.length;o<a;o++)cc(r[o],t,e,!0)}}var hc=class i{static{i.prototype.isMatrix2=!0}constructor(t,e,n,s){this.elements=[1,0,0,1],t!==void 0&&this.set(t,e,n,s)}identity(){return this.set(1,0,0,1),this}fromArray(t,e=0){for(let n=0;n<4;n++)this.elements[n]=t[n+e];return this}set(t,e,n,s){let r=this.elements;return r[0]=t,r[2]=e,r[1]=n,r[3]=s,this}};function kc(i,t,e,n){let s=kf(n);switch(e){case Rc:return i*t;case Pc:return i*t/s.components*s.byteLength;case wa:return i*t/s.components*s.byteLength;case Gi:return i*t*2/s.components*s.byteLength;case Ta:return i*t*2/s.components*s.byteLength;case Ic:return i*t*3/s.components*s.byteLength;case In:return i*t*4/s.components*s.byteLength;case Ea:return i*t*4/s.components*s.byteLength;case zr:case kr:return Math.floor((i+3)/4)*Math.floor((t+3)/4)*8;case Vr:case Gr:return Math.floor((i+3)/4)*Math.floor((t+3)/4)*16;case Ca:case Ia:return Math.max(i,16)*Math.max(t,8)/4;case Aa:case Ra:return Math.max(i,8)*Math.max(t,8)/2;case Pa:case La:case Na:case Ua:return Math.floor((i+3)/4)*Math.floor((t+3)/4)*8;case Da:case Hr:case Fa:return Math.floor((i+3)/4)*Math.floor((t+3)/4)*16;case Oa:return Math.floor((i+3)/4)*Math.floor((t+3)/4)*16;case Ba:return Math.floor((i+4)/5)*Math.floor((t+3)/4)*16;case za:return Math.floor((i+4)/5)*Math.floor((t+4)/5)*16;case ka:return Math.floor((i+5)/6)*Math.floor((t+4)/5)*16;case Va:return Math.floor((i+5)/6)*Math.floor((t+5)/6)*16;case Ga:return Math.floor((i+7)/8)*Math.floor((t+4)/5)*16;case Ha:return Math.floor((i+7)/8)*Math.floor((t+5)/6)*16;case Wa:return Math.floor((i+7)/8)*Math.floor((t+7)/8)*16;case Xa:return Math.floor((i+9)/10)*Math.floor((t+4)/5)*16;case qa:return Math.floor((i+9)/10)*Math.floor((t+5)/6)*16;case Ya:return Math.floor((i+9)/10)*Math.floor((t+7)/8)*16;case Za:return Math.floor((i+9)/10)*Math.floor((t+9)/10)*16;case $a:return Math.floor((i+11)/12)*Math.floor((t+9)/10)*16;case Ja:return Math.floor((i+11)/12)*Math.floor((t+11)/12)*16;case Ka:case ja:case Qa:return Math.ceil(i/4)*Math.ceil(t/4)*16;case tl:case el:return Math.ceil(i/4)*Math.ceil(t/4)*8;case Wr:case nl:return Math.ceil(i/4)*Math.ceil(t/4)*16}throw new Error(`Unable to determine texture byte length for ${e} format.`)}function kf(i){switch(i){case xn:case Tc:return{byteLength:1,components:1};case Ws:case Ec:case Hn:return{byteLength:2,components:1};case Sa:case ba:return{byteLength:2,components:4};case Vn:case Ma:case Gn:return{byteLength:4,components:1};case Ac:case Cc:return{byteLength:4,components:3}}throw new Error(`THREE.TextureUtils: Unknown texture type ${i}.`)}typeof __THREE_DEVTOOLS__<"u"&&__THREE_DEVTOOLS__.dispatchEvent(new CustomEvent("register",{detail:{revision:"186"}}));typeof window<"u"&&(window.__THREE__?Jt("WARNING: Multiple instances of Three.js being imported."):window.__THREE__="186");function id(){let i=null,t=!1,e=null,n=null;function s(r,o){n=i.requestAnimationFrame(s),e(r,o)}return{start:function(){t!==!0&&e!==null&&i!==null&&(n=i.requestAnimationFrame(s),t=!0)},stop:function(){i!==null&&i.cancelAnimationFrame(n),t=!1},setAnimationLoop:function(r){e=r},setContext:function(r){i=r}}}function Zf(i){let t=new WeakMap;function e(a,l){let c=a.array,h=a.usage,f=c.byteLength,u=i.createBuffer();i.bindBuffer(l,u),i.bufferData(l,c,h),a.onUploadCallback();let d;if(c instanceof Float32Array)d=i.FLOAT;else if(typeof Float16Array<"u"&&c instanceof Float16Array)d=i.HALF_FLOAT;else if(c instanceof Uint16Array)a.isFloat16BufferAttribute?d=i.HALF_FLOAT:d=i.UNSIGNED_SHORT;else if(c instanceof Int16Array)d=i.SHORT;else if(c instanceof Uint32Array)d=i.UNSIGNED_INT;else if(c instanceof Int32Array)d=i.INT;else if(c instanceof Int8Array)d=i.BYTE;else if(c instanceof Uint8Array)d=i.UNSIGNED_BYTE;else if(c instanceof Uint8ClampedArray)d=i.UNSIGNED_BYTE;else throw new Error("THREE.WebGLAttributes: Unsupported buffer data format: "+c);return{buffer:u,type:d,bytesPerElement:c.BYTES_PER_ELEMENT,version:a.version,size:f}}function n(a,l,c){let h=l.array,f=l.updateRanges;if(i.bindBuffer(c,a),f.length===0)i.bufferSubData(c,0,h);else{f.sort((d,g)=>d.start-g.start);let u=0;for(let d=1;d<f.length;d++){let g=f[u],M=f[d];M.start<=g.start+g.count+1?g.count=Math.max(g.count,M.start+M.count-g.start):(++u,f[u]=M)}f.length=u+1;for(let d=0,g=f.length;d<g;d++){let M=f[d];i.bufferSubData(c,M.start*h.BYTES_PER_ELEMENT,h,M.start,M.count)}l.clearUpdateRanges()}l.onUploadCallback()}function s(a){return a.isInterleavedBufferAttribute&&(a=a.data),t.get(a)}function r(a){a.isInterleavedBufferAttribute&&(a=a.data);let l=t.get(a);l&&(i.deleteBuffer(l.buffer),t.delete(a))}function o(a,l){if(a.isInterleavedBufferAttribute&&(a=a.data),a.isGLBufferAttribute){let h=t.get(a);(!h||h.version<a.version)&&t.set(a,{buffer:a.buffer,type:a.type,bytesPerElement:a.elementSize,version:a.version});return}let c=t.get(a);if(c===void 0)t.set(a,e(a,l));else if(c.version<a.version){if(c.size!==a.array.byteLength)throw new Error("THREE.WebGLAttributes: The size of the buffer attribute's array buffer does not match the original size. Resizing buffer attributes is not supported.");n(c.buffer,a,l),c.version=a.version}}return{get:s,remove:r,update:o}}var $f=`#ifdef USE_ALPHAHASH
+	if ( diffuseColor.a < getAlphaHashThreshold( vPosition ) ) discard;
+#endif`,Jf=`#ifdef USE_ALPHAHASH
+	const float ALPHA_HASH_SCALE = 0.05;
+	float hash2D( vec2 value ) {
+		return fract( 1.0e4 * sin( 17.0 * value.x + 0.1 * value.y ) * ( 0.1 + abs( sin( 13.0 * value.y + value.x ) ) ) );
+	}
+	float hash3D( vec3 value ) {
+		return hash2D( vec2( hash2D( value.xy ), value.z ) );
+	}
+	float getAlphaHashThreshold( vec3 position ) {
+		float maxDeriv = max(
+			length( dFdx( position.xyz ) ),
+			length( dFdy( position.xyz ) )
+		);
+		float pixScale = 1.0 / ( ALPHA_HASH_SCALE * maxDeriv );
+		vec2 pixScales = vec2(
+			exp2( floor( log2( pixScale ) ) ),
+			exp2( ceil( log2( pixScale ) ) )
+		);
+		vec2 alpha = vec2(
+			hash3D( floor( pixScales.x * position.xyz ) ),
+			hash3D( floor( pixScales.y * position.xyz ) )
+		);
+		float lerpFactor = fract( log2( pixScale ) );
+		float x = ( 1.0 - lerpFactor ) * alpha.x + lerpFactor * alpha.y;
+		float a = min( lerpFactor, 1.0 - lerpFactor );
+		vec3 cases = vec3(
+			x * x / ( 2.0 * a * ( 1.0 - a ) ),
+			( x - 0.5 * a ) / ( 1.0 - a ),
+			1.0 - ( ( 1.0 - x ) * ( 1.0 - x ) / ( 2.0 * a * ( 1.0 - a ) ) )
+		);
+		float threshold = ( x < ( 1.0 - a ) )
+			? ( ( x < a ) ? cases.x : cases.y )
+			: cases.z;
+		return clamp( threshold , 1.0e-6, 1.0 );
+	}
+#endif`,Kf=`#ifdef USE_ALPHAMAP
+	diffuseColor.a *= texture2D( alphaMap, vAlphaMapUv ).g;
+#endif`,jf=`#ifdef USE_ALPHAMAP
+	uniform sampler2D alphaMap;
+#endif`,Qf=`#ifdef USE_ALPHATEST
+	#ifdef ALPHA_TO_COVERAGE
+	diffuseColor.a = smoothstep( alphaTest, alphaTest + fwidth( diffuseColor.a ), diffuseColor.a );
+	if ( diffuseColor.a == 0.0 ) discard;
+	#else
+	if ( diffuseColor.a < alphaTest ) discard;
+	#endif
+#endif`,tp=`#ifdef USE_ALPHATEST
+	uniform float alphaTest;
+#endif`,ep=`#ifdef USE_AOMAP
+	float ambientOcclusion = ( texture2D( aoMap, vAoMapUv ).r - 1.0 ) * aoMapIntensity + 1.0;
+	reflectedLight.indirectDiffuse *= ambientOcclusion;
+	#if defined( USE_CLEARCOAT ) 
+		clearcoatSpecularIndirect *= ambientOcclusion;
+	#endif
+	#if defined( USE_SHEEN ) 
+		sheenSpecularIndirect *= ambientOcclusion;
+	#endif
+	#if defined( USE_ENVMAP ) && defined( STANDARD )
+		float dotNV = saturate( dot( geometryNormal, geometryViewDir ) );
+		reflectedLight.indirectSpecular *= computeSpecularOcclusion( dotNV, ambientOcclusion, material.roughness );
+	#endif
+#endif`,np=`#ifdef USE_AOMAP
+	uniform sampler2D aoMap;
+	uniform float aoMapIntensity;
+#endif`,ip=`#ifdef USE_BATCHING
+	#if ! defined( GL_ANGLE_multi_draw )
+	#define gl_DrawID _gl_DrawID
+	uniform int _gl_DrawID;
+	#endif
+	uniform highp sampler2D batchingTexture;
+	uniform highp usampler2D batchingIdTexture;
+	mat4 getBatchingMatrix( const in float i ) {
+		int size = textureSize( batchingTexture, 0 ).x;
+		int j = int( i ) * 4;
+		int x = j % size;
+		int y = j / size;
+		vec4 v1 = texelFetch( batchingTexture, ivec2( x, y ), 0 );
+		vec4 v2 = texelFetch( batchingTexture, ivec2( x + 1, y ), 0 );
+		vec4 v3 = texelFetch( batchingTexture, ivec2( x + 2, y ), 0 );
+		vec4 v4 = texelFetch( batchingTexture, ivec2( x + 3, y ), 0 );
+		return mat4( v1, v2, v3, v4 );
+	}
+	float getIndirectIndex( const in int i ) {
+		int size = textureSize( batchingIdTexture, 0 ).x;
+		int x = i % size;
+		int y = i / size;
+		return float( texelFetch( batchingIdTexture, ivec2( x, y ), 0 ).r );
+	}
+#endif
+#ifdef USE_BATCHING_COLOR
+	uniform sampler2D batchingColorTexture;
+	vec4 getBatchingColor( const in float i ) {
+		int size = textureSize( batchingColorTexture, 0 ).x;
+		int j = int( i );
+		int x = j % size;
+		int y = j / size;
+		return texelFetch( batchingColorTexture, ivec2( x, y ), 0 );
+	}
+#endif`,sp=`#ifdef USE_BATCHING
+	mat4 batchingMatrix = getBatchingMatrix( getIndirectIndex( gl_DrawID ) );
+#endif`,rp=`vec3 transformed = vec3( position );
+#ifdef USE_ALPHAHASH
+	vPosition = vec3( position );
+#endif`,op=`vec3 objectNormal = vec3( normal );
+#ifdef USE_TANGENT
+	vec3 objectTangent = vec3( tangent.xyz );
+#endif`,ap=`float G_BlinnPhong_Implicit( ) {
+	return 0.25;
+}
+float D_BlinnPhong( const in float shininess, const in float dotNH ) {
+	return RECIPROCAL_PI * ( shininess * 0.5 + 1.0 ) * pow( dotNH, shininess );
+}
+vec3 BRDF_BlinnPhong( const in vec3 lightDir, const in vec3 viewDir, const in vec3 normal, const in vec3 specularColor, const in float shininess ) {
+	vec3 halfDir = normalize( lightDir + viewDir );
+	float dotNH = saturate( dot( normal, halfDir ) );
+	float dotVH = saturate( dot( viewDir, halfDir ) );
+	vec3 F = F_Schlick( specularColor, 1.0, dotVH );
+	float G = G_BlinnPhong_Implicit( );
+	float D = D_BlinnPhong( shininess, dotNH );
+	return F * ( G * D );
+} // validated`,lp=`#ifdef USE_IRIDESCENCE
+	const mat3 XYZ_TO_REC709 = mat3(
+		 3.2404542, -0.9692660,  0.0556434,
+		-1.5371385,  1.8760108, -0.2040259,
+		-0.4985314,  0.0415560,  1.0572252
+	);
+	vec3 Fresnel0ToIor( vec3 fresnel0 ) {
+		vec3 sqrtF0 = sqrt( fresnel0 );
+		return ( vec3( 1.0 ) + sqrtF0 ) / ( vec3( 1.0 ) - sqrtF0 );
+	}
+	vec3 IorToFresnel0( vec3 transmittedIor, float incidentIor ) {
+		return pow2( ( transmittedIor - vec3( incidentIor ) ) / ( transmittedIor + vec3( incidentIor ) ) );
+	}
+	float IorToFresnel0( float transmittedIor, float incidentIor ) {
+		return pow2( ( transmittedIor - incidentIor ) / ( transmittedIor + incidentIor ));
+	}
+	vec3 evalSensitivity( float OPD, vec3 shift ) {
+		float phase = 2.0 * PI * OPD * 1.0e-9;
+		vec3 val = vec3( 5.4856e-13, 4.4201e-13, 5.2481e-13 );
+		vec3 pos = vec3( 1.6810e+06, 1.7953e+06, 2.2084e+06 );
+		vec3 var = vec3( 4.3278e+09, 9.3046e+09, 6.6121e+09 );
+		vec3 xyz = val * sqrt( 2.0 * PI * var ) * cos( pos * phase + shift ) * exp( - pow2( phase ) * var );
+		xyz.x += 9.7470e-14 * sqrt( 2.0 * PI * 4.5282e+09 ) * cos( 2.2399e+06 * phase + shift[ 0 ] ) * exp( - 4.5282e+09 * pow2( phase ) );
+		xyz /= 1.0685e-7;
+		vec3 rgb = XYZ_TO_REC709 * xyz;
+		return rgb;
+	}
+	vec3 evalIridescence( float outsideIOR, float eta2, float cosTheta1, float thinFilmThickness, vec3 baseF0 ) {
+		vec3 I;
+		float iridescenceIOR = mix( outsideIOR, eta2, smoothstep( 0.0, 0.03, thinFilmThickness ) );
+		float sinTheta2Sq = pow2( outsideIOR / iridescenceIOR ) * ( 1.0 - pow2( cosTheta1 ) );
+		float cosTheta2Sq = 1.0 - sinTheta2Sq;
+		if ( cosTheta2Sq < 0.0 ) {
+			return vec3( 1.0 );
+		}
+		float cosTheta2 = sqrt( cosTheta2Sq );
+		float R0 = IorToFresnel0( iridescenceIOR, outsideIOR );
+		float R12 = F_Schlick( R0, 1.0, cosTheta1 );
+		float T121 = 1.0 - R12;
+		float phi12 = 0.0;
+		if ( iridescenceIOR < outsideIOR ) phi12 = PI;
+		float phi21 = PI - phi12;
+		vec3 baseIOR = Fresnel0ToIor( clamp( baseF0, 0.0, 0.9999 ) );		vec3 R1 = IorToFresnel0( baseIOR, iridescenceIOR );
+		vec3 R23 = F_Schlick( R1, 1.0, cosTheta2 );
+		vec3 phi23 = vec3( 0.0 );
+		if ( baseIOR[ 0 ] < iridescenceIOR ) phi23[ 0 ] = PI;
+		if ( baseIOR[ 1 ] < iridescenceIOR ) phi23[ 1 ] = PI;
+		if ( baseIOR[ 2 ] < iridescenceIOR ) phi23[ 2 ] = PI;
+		float OPD = 2.0 * iridescenceIOR * thinFilmThickness * cosTheta2;
+		vec3 phi = vec3( phi21 ) + phi23;
+		vec3 R123 = clamp( R12 * R23, 1e-5, 0.9999 );
+		vec3 r123 = sqrt( R123 );
+		vec3 Rs = pow2( T121 ) * R23 / ( vec3( 1.0 ) - R123 );
+		vec3 C0 = R12 + Rs;
+		I = C0;
+		vec3 Cm = Rs - T121;
+		for ( int m = 1; m <= 2; ++ m ) {
+			Cm *= r123;
+			vec3 Sm = 2.0 * evalSensitivity( float( m ) * OPD, float( m ) * phi );
+			I += Cm * Sm;
+		}
+		return max( I, vec3( 0.0 ) );
+	}
+#endif`,cp=`#ifdef USE_BUMPMAP
+	uniform sampler2D bumpMap;
+	uniform float bumpScale;
+	vec2 dHdxy_fwd() {
+		vec2 dSTdx = dFdx( vBumpMapUv );
+		vec2 dSTdy = dFdy( vBumpMapUv );
+		float Hll = bumpScale * texture2D( bumpMap, vBumpMapUv ).x;
+		float dBx = bumpScale * texture2D( bumpMap, vBumpMapUv + dSTdx ).x - Hll;
+		float dBy = bumpScale * texture2D( bumpMap, vBumpMapUv + dSTdy ).x - Hll;
+		return vec2( dBx, dBy );
+	}
+	vec3 perturbNormalArb( vec3 surf_pos, vec3 surf_norm, vec2 dHdxy, float faceDirection ) {
+		vec3 vSigmaX = normalize( dFdx( surf_pos.xyz ) );
+		vec3 vSigmaY = normalize( dFdy( surf_pos.xyz ) );
+		vec3 vN = surf_norm;
+		vec3 R1 = cross( vSigmaY, vN );
+		vec3 R2 = cross( vN, vSigmaX );
+		float fDet = dot( vSigmaX, R1 ) * faceDirection;
+		vec3 vGrad = sign( fDet ) * ( dHdxy.x * R1 + dHdxy.y * R2 );
+		return normalize( abs( fDet ) * surf_norm - vGrad );
+	}
+#endif`,hp=`#if NUM_CLIPPING_PLANES > 0
+	vec4 plane;
+	#ifdef ALPHA_TO_COVERAGE
+		float distanceToPlane, distanceGradient;
+		float clipOpacity = 1.0;
+		#pragma unroll_loop_start
+		for ( int i = 0; i < UNION_CLIPPING_PLANES; i ++ ) {
+			plane = clippingPlanes[ i ];
+			distanceToPlane = - dot( vClipPosition, plane.xyz ) + plane.w;
+			distanceGradient = fwidth( distanceToPlane ) / 2.0;
+			clipOpacity *= smoothstep( - distanceGradient, distanceGradient, distanceToPlane );
+			if ( clipOpacity == 0.0 ) discard;
+		}
+		#pragma unroll_loop_end
+		#if UNION_CLIPPING_PLANES < NUM_CLIPPING_PLANES
+			float unionClipOpacity = 1.0;
+			#pragma unroll_loop_start
+			for ( int i = UNION_CLIPPING_PLANES; i < NUM_CLIPPING_PLANES; i ++ ) {
+				plane = clippingPlanes[ i ];
+				distanceToPlane = - dot( vClipPosition, plane.xyz ) + plane.w;
+				distanceGradient = fwidth( distanceToPlane ) / 2.0;
+				unionClipOpacity *= 1.0 - smoothstep( - distanceGradient, distanceGradient, distanceToPlane );
+			}
+			#pragma unroll_loop_end
+			clipOpacity *= 1.0 - unionClipOpacity;
+		#endif
+		diffuseColor.a *= clipOpacity;
+		if ( diffuseColor.a == 0.0 ) discard;
+	#else
+		#pragma unroll_loop_start
+		for ( int i = 0; i < UNION_CLIPPING_PLANES; i ++ ) {
+			plane = clippingPlanes[ i ];
+			if ( dot( vClipPosition, plane.xyz ) > plane.w ) discard;
+		}
+		#pragma unroll_loop_end
+		#if UNION_CLIPPING_PLANES < NUM_CLIPPING_PLANES
+			bool clipped = true;
+			#pragma unroll_loop_start
+			for ( int i = UNION_CLIPPING_PLANES; i < NUM_CLIPPING_PLANES; i ++ ) {
+				plane = clippingPlanes[ i ];
+				clipped = ( dot( vClipPosition, plane.xyz ) > plane.w ) && clipped;
+			}
+			#pragma unroll_loop_end
+			if ( clipped ) discard;
+		#endif
+	#endif
+#endif`,up=`#if NUM_CLIPPING_PLANES > 0
+	varying vec3 vClipPosition;
+	uniform vec4 clippingPlanes[ NUM_CLIPPING_PLANES ];
+#endif`,dp=`#if NUM_CLIPPING_PLANES > 0
+	varying vec3 vClipPosition;
+#endif`,fp=`#if NUM_CLIPPING_PLANES > 0
+	vClipPosition = - mvPosition.xyz;
+#endif`,pp=`#if defined( USE_COLOR ) || defined( USE_COLOR_ALPHA )
+	diffuseColor *= vColor;
+#endif`,mp=`#if defined( USE_COLOR ) || defined( USE_COLOR_ALPHA )
+	varying vec4 vColor;
+#endif`,gp=`#if defined( USE_COLOR ) || defined( USE_COLOR_ALPHA ) || defined( USE_INSTANCING_COLOR ) || defined( USE_BATCHING_COLOR )
+	varying vec4 vColor;
+#endif`,xp=`#if defined( USE_COLOR ) || defined( USE_COLOR_ALPHA ) || defined( USE_INSTANCING_COLOR ) || defined( USE_BATCHING_COLOR )
+	vColor = vec4( 1.0 );
+#endif
+#ifdef USE_COLOR_ALPHA
+	vColor *= color;
+#elif defined( USE_COLOR )
+	vColor.rgb *= color;
+#endif
+#ifdef USE_INSTANCING_COLOR
+	vColor.rgb *= instanceColor.rgb;
+#endif
+#ifdef USE_BATCHING_COLOR
+	vColor *= getBatchingColor( getIndirectIndex( gl_DrawID ) );
+#endif`,_p=`#define PI 3.141592653589793
+#define PI2 6.283185307179586
+#define PI_HALF 1.5707963267948966
+#define RECIPROCAL_PI 0.3183098861837907
+#define RECIPROCAL_PI2 0.15915494309189535
+#define EPSILON 1e-6
+#ifndef saturate
+#define saturate( a ) clamp( a, 0.0, 1.0 )
+#endif
+#define whiteComplement( a ) ( 1.0 - saturate( a ) )
+float pow2( const in float x ) { return x*x; }
+vec3 pow2( const in vec3 x ) { return x*x; }
+float pow3( const in float x ) { return x*x*x; }
+float pow4( const in float x ) { float x2 = x*x; return x2*x2; }
+float max3( const in vec3 v ) { return max( max( v.x, v.y ), v.z ); }
+float average( const in vec3 v ) { return dot( v, vec3( 0.3333333 ) ); }
+highp float rand( const in vec2 uv ) {
+	const highp float a = 12.9898, b = 78.233, c = 43758.5453;
+	highp float dt = dot( uv.xy, vec2( a,b ) ), sn = mod( dt, PI );
+	return fract( sin( sn ) * c );
+}
+#ifdef HIGH_PRECISION
+	float precisionSafeLength( vec3 v ) { return length( v ); }
+#else
+	float precisionSafeLength( vec3 v ) {
+		float maxComponent = max3( abs( v ) );
+		return length( v / maxComponent ) * maxComponent;
+	}
+#endif
+struct IncidentLight {
+	vec3 color;
+	vec3 direction;
+	bool visible;
+};
+struct ReflectedLight {
+	vec3 directDiffuse;
+	vec3 directSpecular;
+	vec3 indirectDiffuse;
+	vec3 indirectSpecular;
+};
+#ifdef USE_ALPHAHASH
+	varying vec3 vPosition;
+#endif
+vec3 transformDirection( in vec3 dir, in mat4 matrix ) {
+	return normalize( ( matrix * vec4( dir, 0.0 ) ).xyz );
+}
+#define inverseTransformDirection transformDirectionByInverseViewMatrix
+vec3 transformNormalByInverseViewMatrix( in vec3 normal, in mat4 viewMatrix ) {
+	return normalize( ( vec4( normal, 0.0 ) * viewMatrix ).xyz );
+}
+vec3 transformDirectionByInverseViewMatrix( in vec3 dir, in mat4 viewMatrix ) {
+	return normalize( ( vec4( dir, 0.0 ) * viewMatrix ).xyz );
+}
+bool isPerspectiveMatrix( mat4 m ) {
+	return m[ 2 ][ 3 ] == - 1.0;
+}
+vec2 equirectUv( in vec3 dir ) {
+	float u = atan( dir.z, dir.x ) * RECIPROCAL_PI2 + 0.5;
+	float v = asin( clamp( dir.y, - 1.0, 1.0 ) ) * RECIPROCAL_PI + 0.5;
+	return vec2( u, v );
+}
+vec3 BRDF_Lambert( const in vec3 diffuseColor ) {
+	return RECIPROCAL_PI * diffuseColor;
+}
+vec3 F_Schlick( const in vec3 f0, const in float f90, const in float dotVH ) {
+	float fresnel = exp2( ( - 5.55473 * dotVH - 6.98316 ) * dotVH );
+	return f0 * ( 1.0 - fresnel ) + ( f90 * fresnel );
+}
+float F_Schlick( const in float f0, const in float f90, const in float dotVH ) {
+	float fresnel = exp2( ( - 5.55473 * dotVH - 6.98316 ) * dotVH );
+	return f0 * ( 1.0 - fresnel ) + ( f90 * fresnel );
+} // validated`,yp=`#ifdef ENVMAP_TYPE_CUBE_UV
+	#define cubeUV_minMipLevel 4.0
+	#define cubeUV_minTileSize 16.0
+	float getFace( vec3 direction ) {
+		vec3 absDirection = abs( direction );
+		float face = - 1.0;
+		if ( absDirection.x > absDirection.z ) {
+			if ( absDirection.x > absDirection.y )
+				face = direction.x > 0.0 ? 0.0 : 3.0;
+			else
+				face = direction.y > 0.0 ? 1.0 : 4.0;
+		} else {
+			if ( absDirection.z > absDirection.y )
+				face = direction.z > 0.0 ? 2.0 : 5.0;
+			else
+				face = direction.y > 0.0 ? 1.0 : 4.0;
+		}
+		return face;
+	}
+	vec2 getUV( vec3 direction, float face ) {
+		vec2 uv;
+		if ( face == 0.0 ) {
+			uv = vec2( direction.z, direction.y ) / abs( direction.x );
+		} else if ( face == 1.0 ) {
+			uv = vec2( - direction.x, - direction.z ) / abs( direction.y );
+		} else if ( face == 2.0 ) {
+			uv = vec2( - direction.x, direction.y ) / abs( direction.z );
+		} else if ( face == 3.0 ) {
+			uv = vec2( - direction.z, direction.y ) / abs( direction.x );
+		} else if ( face == 4.0 ) {
+			uv = vec2( - direction.x, direction.z ) / abs( direction.y );
+		} else {
+			uv = vec2( direction.x, direction.y ) / abs( direction.z );
+		}
+		return 0.5 * ( uv + 1.0 );
+	}
+	vec3 bilinearCubeUV( sampler2D envMap, vec3 direction, float mipInt ) {
+		float face = getFace( direction );
+		float filterInt = max( cubeUV_minMipLevel - mipInt, 0.0 );
+		mipInt = max( mipInt, cubeUV_minMipLevel );
+		float faceSize = exp2( mipInt );
+		highp vec2 uv = getUV( direction, face ) * ( faceSize - 2.0 ) + 1.0;
+		if ( face > 2.0 ) {
+			uv.y += faceSize;
+			face -= 3.0;
+		}
+		uv.x += face * faceSize;
+		uv.x += filterInt * 3.0 * cubeUV_minTileSize;
+		uv.y += 4.0 * ( exp2( CUBEUV_MAX_MIP ) - faceSize );
+		uv.x *= CUBEUV_TEXEL_WIDTH;
+		uv.y *= CUBEUV_TEXEL_HEIGHT;
+		#ifdef texture2DGradEXT
+			return texture2DGradEXT( envMap, uv, vec2( 0.0 ), vec2( 0.0 ) ).rgb;
+		#else
+			return texture2D( envMap, uv ).rgb;
+		#endif
+	}
+	#define cubeUV_r0 1.0
+	#define cubeUV_m0 - 2.0
+	#define cubeUV_r1 0.8
+	#define cubeUV_m1 - 1.0
+	#define cubeUV_r4 0.4
+	#define cubeUV_m4 2.0
+	#define cubeUV_r5 0.305
+	#define cubeUV_m5 3.0
+	#define cubeUV_r6 0.21
+	#define cubeUV_m6 4.0
+	float roughnessToMip( float roughness ) {
+		float mip = 0.0;
+		if ( roughness >= cubeUV_r1 ) {
+			mip = ( cubeUV_r0 - roughness ) * ( cubeUV_m1 - cubeUV_m0 ) / ( cubeUV_r0 - cubeUV_r1 ) + cubeUV_m0;
+		} else if ( roughness >= cubeUV_r4 ) {
+			mip = ( cubeUV_r1 - roughness ) * ( cubeUV_m4 - cubeUV_m1 ) / ( cubeUV_r1 - cubeUV_r4 ) + cubeUV_m1;
+		} else if ( roughness >= cubeUV_r5 ) {
+			mip = ( cubeUV_r4 - roughness ) * ( cubeUV_m5 - cubeUV_m4 ) / ( cubeUV_r4 - cubeUV_r5 ) + cubeUV_m4;
+		} else if ( roughness >= cubeUV_r6 ) {
+			mip = ( cubeUV_r5 - roughness ) * ( cubeUV_m6 - cubeUV_m5 ) / ( cubeUV_r5 - cubeUV_r6 ) + cubeUV_m5;
+		} else {
+			mip = - 2.0 * log2( 1.16 * roughness );		}
+		return mip;
+	}
+	vec4 textureCubeUV( sampler2D envMap, vec3 sampleDir, float roughness ) {
+		float mip = clamp( roughnessToMip( roughness ), cubeUV_m0, CUBEUV_MAX_MIP );
+		float mipF = fract( mip );
+		float mipInt = floor( mip );
+		vec3 color0 = bilinearCubeUV( envMap, sampleDir, mipInt );
+		if ( mipF == 0.0 ) {
+			return vec4( color0, 1.0 );
+		} else {
+			vec3 color1 = bilinearCubeUV( envMap, sampleDir, mipInt + 1.0 );
+			return vec4( mix( color0, color1, mipF ), 1.0 );
+		}
+	}
+#endif`,vp=`vec3 transformedNormal = objectNormal;
+#ifdef USE_TANGENT
+	vec3 transformedTangent = objectTangent;
+#endif
+#ifdef USE_BATCHING
+	mat3 bm = mat3( batchingMatrix );
+	transformedNormal /= vec3( dot( bm[ 0 ], bm[ 0 ] ), dot( bm[ 1 ], bm[ 1 ] ), dot( bm[ 2 ], bm[ 2 ] ) );
+	transformedNormal = bm * transformedNormal;
+	#ifdef USE_TANGENT
+		transformedTangent = bm * transformedTangent;
+	#endif
+#endif
+#ifdef USE_INSTANCING
+	mat3 im = mat3( instanceMatrix );
+	transformedNormal /= vec3( dot( im[ 0 ], im[ 0 ] ), dot( im[ 1 ], im[ 1 ] ), dot( im[ 2 ], im[ 2 ] ) );
+	transformedNormal = im * transformedNormal;
+	#ifdef USE_TANGENT
+		transformedTangent = im * transformedTangent;
+	#endif
+#endif
+transformedNormal = normalMatrix * transformedNormal;
+#ifdef FLIP_SIDED
+	transformedNormal = - transformedNormal;
+#endif
+#ifdef USE_TANGENT
+	transformedTangent = ( modelViewMatrix * vec4( transformedTangent, 0.0 ) ).xyz;
+#endif`,Mp=`#ifdef USE_DISPLACEMENTMAP
+	uniform sampler2D displacementMap;
+	uniform float displacementScale;
+	uniform float displacementBias;
+#endif`,Sp=`#ifdef USE_DISPLACEMENTMAP
+	transformed += normalize( objectNormal ) * ( texture2D( displacementMap, vDisplacementMapUv ).x * displacementScale + displacementBias );
+#endif`,bp=`#ifdef USE_EMISSIVEMAP
+	vec4 emissiveColor = texture2D( emissiveMap, vEmissiveMapUv );
+	#ifdef DECODE_VIDEO_TEXTURE_EMISSIVE
+		emissiveColor = sRGBTransferEOTF( emissiveColor );
+	#endif
+	totalEmissiveRadiance *= emissiveColor.rgb;
+#endif`,wp=`#ifdef USE_EMISSIVEMAP
+	uniform sampler2D emissiveMap;
+#endif`,Tp="gl_FragColor = linearToOutputTexel( gl_FragColor );",Ep=`vec4 LinearTransferOETF( in vec4 value ) {
+	return value;
+}
+vec4 sRGBTransferEOTF( in vec4 value ) {
+	return vec4( mix( pow( value.rgb * 0.9478672986 + vec3( 0.0521327014 ), vec3( 2.4 ) ), value.rgb * 0.0773993808, vec3( lessThanEqual( value.rgb, vec3( 0.04045 ) ) ) ), value.a );
+}
+vec4 sRGBTransferOETF( in vec4 value ) {
+	return vec4( mix( pow( value.rgb, vec3( 0.41666 ) ) * 1.055 - vec3( 0.055 ), value.rgb * 12.92, vec3( lessThanEqual( value.rgb, vec3( 0.0031308 ) ) ) ), value.a );
+}`,Ap=`#ifdef USE_ENVMAP
+	#ifdef ENV_WORLDPOS
+		vec3 cameraToFrag;
+		if ( isOrthographic ) {
+			cameraToFrag = normalize( vec3( - viewMatrix[ 0 ][ 2 ], - viewMatrix[ 1 ][ 2 ], - viewMatrix[ 2 ][ 2 ] ) );
+		} else {
+			cameraToFrag = normalize( vWorldPosition - cameraPosition );
+		}
+		vec3 worldNormal = transformNormalByInverseViewMatrix( normal, viewMatrix );
+		#ifdef ENVMAP_MODE_REFLECTION
+			vec3 reflectVec = reflect( cameraToFrag, worldNormal );
+		#else
+			vec3 reflectVec = refract( cameraToFrag, worldNormal, refractionRatio );
+		#endif
+	#else
+		vec3 reflectVec = vReflect;
+	#endif
+	#ifdef ENVMAP_TYPE_CUBE
+		vec4 envColor = textureCube( envMap, envMapRotation * reflectVec );
+		#ifdef ENVMAP_BLENDING_MULTIPLY
+			outgoingLight = mix( outgoingLight, outgoingLight * envColor.xyz, specularStrength * reflectivity );
+		#elif defined( ENVMAP_BLENDING_MIX )
+			outgoingLight = mix( outgoingLight, envColor.xyz, specularStrength * reflectivity );
+		#elif defined( ENVMAP_BLENDING_ADD )
+			outgoingLight += envColor.xyz * specularStrength * reflectivity;
+		#endif
+	#endif
+#endif`,Cp=`#ifdef USE_ENVMAP
+	uniform float envMapIntensity;
+	uniform mat3 envMapRotation;
+	#ifdef ENVMAP_TYPE_CUBE
+		uniform samplerCube envMap;
+	#else
+		uniform sampler2D envMap;
+	#endif
+#endif`,Rp=`#ifdef USE_ENVMAP
+	uniform float reflectivity;
+	#if defined( USE_BUMPMAP ) || defined( USE_NORMALMAP ) || defined( PHONG ) || defined( LAMBERT )
+		#define ENV_WORLDPOS
+	#endif
+	#ifdef ENV_WORLDPOS
+		varying vec3 vWorldPosition;
+		uniform float refractionRatio;
+	#else
+		varying vec3 vReflect;
+	#endif
+#endif`,Ip=`#ifdef USE_ENVMAP
+	#if defined( USE_BUMPMAP ) || defined( USE_NORMALMAP ) || defined( PHONG ) || defined( LAMBERT )
+		#define ENV_WORLDPOS
+	#endif
+	#ifdef ENV_WORLDPOS
+		
+		varying vec3 vWorldPosition;
+	#else
+		varying vec3 vReflect;
+		uniform float refractionRatio;
+	#endif
+#endif`,Pp=`#ifdef USE_ENVMAP
+	#ifdef ENV_WORLDPOS
+		vWorldPosition = worldPosition.xyz;
+	#else
+		vec3 cameraToVertex;
+		if ( isOrthographic ) {
+			cameraToVertex = normalize( vec3( - viewMatrix[ 0 ][ 2 ], - viewMatrix[ 1 ][ 2 ], - viewMatrix[ 2 ][ 2 ] ) );
+		} else {
+			cameraToVertex = normalize( worldPosition.xyz - cameraPosition );
+		}
+		vec3 worldNormal = transformNormalByInverseViewMatrix( transformedNormal, viewMatrix );
+		#ifdef ENVMAP_MODE_REFLECTION
+			vReflect = reflect( cameraToVertex, worldNormal );
+		#else
+			vReflect = refract( cameraToVertex, worldNormal, refractionRatio );
+		#endif
+	#endif
+#endif`,Lp=`#ifdef USE_FOG
+	vFogDepth = - mvPosition.z;
+#endif`,Dp=`#ifdef USE_FOG
+	varying float vFogDepth;
+#endif`,Np=`#ifdef USE_FOG
+	#ifdef FOG_EXP2
+		float fogFactor = 1.0 - exp( - fogDensity * fogDensity * vFogDepth * vFogDepth );
+	#else
+		float fogFactor = smoothstep( fogNear, fogFar, vFogDepth );
+	#endif
+	gl_FragColor.rgb = mix( gl_FragColor.rgb, fogColor, fogFactor );
+#endif`,Up=`#ifdef USE_FOG
+	uniform vec3 fogColor;
+	varying float vFogDepth;
+	#ifdef FOG_EXP2
+		uniform float fogDensity;
+	#else
+		uniform float fogNear;
+		uniform float fogFar;
+	#endif
+#endif`,Fp=`#ifdef USE_GRADIENTMAP
+	uniform sampler2D gradientMap;
+#endif
+vec3 getGradientIrradiance( vec3 normal, vec3 lightDirection ) {
+	float dotNL = dot( normal, lightDirection );
+	vec2 coord = vec2( dotNL * 0.5 + 0.5, 0.0 );
+	#ifdef USE_GRADIENTMAP
+		return vec3( texture2D( gradientMap, coord ).r );
+	#else
+		vec2 fw = fwidth( coord ) * 0.5;
+		return mix( vec3( 0.7 ), vec3( 1.0 ), smoothstep( 0.7 - fw.x, 0.7 + fw.x, coord.x ) );
+	#endif
+}`,Op=`#ifdef USE_LIGHTMAP
+	uniform sampler2D lightMap;
+	uniform float lightMapIntensity;
+#endif`,Bp=`LambertMaterial material;
+material.diffuseColor = diffuseColor.rgb;
+material.specularStrength = specularStrength;`,zp=`varying vec3 vViewPosition;
+struct LambertMaterial {
+	vec3 diffuseColor;
+	float specularStrength;
+};
+void RE_Direct_Lambert( const in IncidentLight directLight, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in LambertMaterial material, inout ReflectedLight reflectedLight ) {
+	float dotNL = saturate( dot( geometryNormal, directLight.direction ) );
+	vec3 irradiance = dotNL * directLight.color;
+	reflectedLight.directDiffuse += irradiance * BRDF_Lambert( material.diffuseColor );
+}
+void RE_IndirectDiffuse_Lambert( const in vec3 irradiance, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in LambertMaterial material, inout ReflectedLight reflectedLight ) {
+	reflectedLight.indirectDiffuse += irradiance * BRDF_Lambert( material.diffuseColor );
+}
+#define RE_Direct				RE_Direct_Lambert
+#define RE_IndirectDiffuse		RE_IndirectDiffuse_Lambert`,kp=`uniform bool receiveShadow;
+uniform vec3 ambientLightColor;
+#if defined( USE_LIGHT_PROBES )
+	uniform vec3 lightProbe[ 9 ];
+#endif
+vec3 shGetIrradianceAt( in vec3 normal, in vec3 shCoefficients[ 9 ] ) {
+	float x = normal.x, y = normal.y, z = normal.z;
+	vec3 result = shCoefficients[ 0 ] * 0.886227;
+	result += shCoefficients[ 1 ] * 2.0 * 0.511664 * y;
+	result += shCoefficients[ 2 ] * 2.0 * 0.511664 * z;
+	result += shCoefficients[ 3 ] * 2.0 * 0.511664 * x;
+	result += shCoefficients[ 4 ] * 2.0 * 0.429043 * x * y;
+	result += shCoefficients[ 5 ] * 2.0 * 0.429043 * y * z;
+	result += shCoefficients[ 6 ] * ( 0.743125 * z * z - 0.247708 );
+	result += shCoefficients[ 7 ] * 2.0 * 0.429043 * x * z;
+	result += shCoefficients[ 8 ] * 0.429043 * ( x * x - y * y );
+	return result;
+}
+vec3 getLightProbeIrradiance( const in vec3 lightProbe[ 9 ], const in vec3 normal ) {
+	vec3 worldNormal = transformNormalByInverseViewMatrix( normal, viewMatrix );
+	vec3 irradiance = shGetIrradianceAt( worldNormal, lightProbe );
+	return irradiance;
+}
+vec3 getAmbientLightIrradiance( const in vec3 ambientLightColor ) {
+	vec3 irradiance = ambientLightColor;
+	return irradiance;
+}
+float getDistanceAttenuation( const in float lightDistance, const in float cutoffDistance, const in float decayExponent ) {
+	float distanceFalloff = 1.0 / max( pow( lightDistance, decayExponent ), 0.01 );
+	if ( cutoffDistance > 0.0 ) {
+		distanceFalloff *= pow2( saturate( 1.0 - pow4( lightDistance / cutoffDistance ) ) );
+	}
+	return distanceFalloff;
+}
+float getSpotAttenuation( const in float coneCosine, const in float penumbraCosine, const in float angleCosine ) {
+	return smoothstep( coneCosine, penumbraCosine, angleCosine );
+}
+#if NUM_SUN_LIGHTS > 0
+	struct SunLight {
+		vec3 direction;
+		vec3 color;
+	};
+	uniform SunLight sunLights[ NUM_SUN_LIGHTS ];
+	void getSunLightInfo( const in SunLight sunLight, out IncidentLight light ) {
+		light.color = sunLight.color;
+		light.direction = sunLight.direction;
+		light.visible = true;
+	}
+#endif
+#if NUM_DIR_LIGHTS > 0
+	struct DirectionalLight {
+		vec3 direction;
+		vec3 color;
+	};
+	uniform DirectionalLight directionalLights[ NUM_DIR_LIGHTS ];
+	void getDirectionalLightInfo( const in DirectionalLight directionalLight, out IncidentLight light ) {
+		light.color = directionalLight.color;
+		light.direction = directionalLight.direction;
+		light.visible = true;
+	}
+#endif
+#if NUM_POINT_LIGHTS > 0
+	struct PointLight {
+		vec3 position;
+		vec3 color;
+		float distance;
+		float decay;
+	};
+	uniform PointLight pointLights[ NUM_POINT_LIGHTS ];
+	void getPointLightInfo( const in PointLight pointLight, const in vec3 geometryPosition, out IncidentLight light ) {
+		vec3 lVector = pointLight.position - geometryPosition;
+		light.direction = normalize( lVector );
+		float lightDistance = length( lVector );
+		light.color = pointLight.color;
+		light.color *= getDistanceAttenuation( lightDistance, pointLight.distance, pointLight.decay );
+		light.visible = ( light.color != vec3( 0.0 ) );
+	}
+#endif
+#if NUM_SPOT_LIGHTS > 0
+	struct SpotLight {
+		vec3 position;
+		vec3 direction;
+		vec3 color;
+		float distance;
+		float decay;
+		float coneCos;
+		float penumbraCos;
+	};
+	uniform SpotLight spotLights[ NUM_SPOT_LIGHTS ];
+	void getSpotLightInfo( const in SpotLight spotLight, const in vec3 geometryPosition, out IncidentLight light ) {
+		vec3 lVector = spotLight.position - geometryPosition;
+		light.direction = normalize( lVector );
+		float angleCos = dot( light.direction, spotLight.direction );
+		float spotAttenuation = getSpotAttenuation( spotLight.coneCos, spotLight.penumbraCos, angleCos );
+		if ( spotAttenuation > 0.0 ) {
+			float lightDistance = length( lVector );
+			light.color = spotLight.color * spotAttenuation;
+			light.color *= getDistanceAttenuation( lightDistance, spotLight.distance, spotLight.decay );
+			light.visible = ( light.color != vec3( 0.0 ) );
+		} else {
+			light.color = vec3( 0.0 );
+			light.visible = false;
+		}
+	}
+#endif
+#if NUM_RECT_AREA_LIGHTS > 0
+	struct RectAreaLight {
+		vec3 color;
+		vec3 position;
+		vec3 halfWidth;
+		vec3 halfHeight;
+	};
+	uniform sampler2D ltc_1;	uniform sampler2D ltc_2;
+	uniform RectAreaLight rectAreaLights[ NUM_RECT_AREA_LIGHTS ];
+#endif
+#if NUM_HEMI_LIGHTS > 0
+	struct HemisphereLight {
+		vec3 direction;
+		vec3 skyColor;
+		vec3 groundColor;
+	};
+	uniform HemisphereLight hemisphereLights[ NUM_HEMI_LIGHTS ];
+	vec3 getHemisphereLightIrradiance( const in HemisphereLight hemiLight, const in vec3 normal ) {
+		float dotNL = dot( normal, hemiLight.direction );
+		float hemiDiffuseWeight = 0.5 * dotNL + 0.5;
+		vec3 irradiance = mix( hemiLight.groundColor, hemiLight.skyColor, hemiDiffuseWeight );
+		return irradiance;
+	}
+#endif
+#include <lightprobes_pars_fragment>`,Vp=`#ifdef USE_ENVMAP
+	vec3 getIBLIrradiance( const in vec3 normal ) {
+		#ifdef ENVMAP_TYPE_CUBE_UV
+			vec3 worldNormal = transformNormalByInverseViewMatrix( normal, viewMatrix );
+			vec4 envMapColor = textureCubeUV( envMap, envMapRotation * worldNormal, 1.0 );
+			return PI * envMapColor.rgb * envMapIntensity;
+		#else
+			return vec3( 0.0 );
+		#endif
+	}
+	vec3 getIBLRadiance( const in vec3 viewDir, const in vec3 normal, const in float roughness ) {
+		#ifdef ENVMAP_TYPE_CUBE_UV
+			vec3 reflectVec = reflect( - viewDir, normal );
+			reflectVec = normalize( mix( reflectVec, normal, pow4( roughness ) ) );
+			reflectVec = transformDirectionByInverseViewMatrix( reflectVec, viewMatrix );
+			vec4 envMapColor = textureCubeUV( envMap, envMapRotation * reflectVec, roughness );
+			return envMapColor.rgb * envMapIntensity;
+		#else
+			return vec3( 0.0 );
+		#endif
+	}
+	#ifdef USE_RETROREFLECTION
+		vec3 getIBLRetroRadiance( const in vec3 viewDir, const in vec3 normal, const in float roughness ) {
+			#ifdef ENVMAP_TYPE_CUBE_UV
+				vec3 retroVec = normalize( mix( viewDir, normal, pow4( roughness ) ) );
+				retroVec = transformDirectionByInverseViewMatrix( retroVec, viewMatrix );
+				vec4 envMapColor = textureCubeUV( envMap, envMapRotation * retroVec, roughness );
+				return envMapColor.rgb * envMapIntensity;
+			#else
+				return vec3( 0.0 );
+			#endif
+		}
+	#endif
+	#ifdef USE_ANISOTROPY
+		vec3 getIBLAnisotropyRadiance( const in vec3 viewDir, const in vec3 normal, const in float roughness, const in vec3 bitangent, const in float anisotropy ) {
+			#ifdef ENVMAP_TYPE_CUBE_UV
+				vec3 bentNormal = cross( bitangent, viewDir );
+				bentNormal = normalize( cross( bentNormal, bitangent ) );
+				bentNormal = normalize( mix( bentNormal, normal, pow2( pow2( 1.0 - anisotropy * ( 1.0 - roughness ) ) ) ) );
+				return getIBLRadiance( viewDir, bentNormal, roughness );
+			#else
+				return vec3( 0.0 );
+			#endif
+		}
+		#ifdef USE_RETROREFLECTION
+			vec3 getIBLAnisotropyRetroRadiance( const in vec3 viewDir, const in vec3 normal, const in float roughness, const in vec3 bitangent, const in float anisotropy ) {
+				#ifdef ENVMAP_TYPE_CUBE_UV
+					vec3 bentNormal = cross( bitangent, viewDir );
+					bentNormal = normalize( cross( bentNormal, bitangent ) );
+					bentNormal = normalize( mix( bentNormal, normal, pow2( pow2( 1.0 - anisotropy * ( 1.0 - roughness ) ) ) ) );
+					return getIBLRetroRadiance( viewDir, bentNormal, roughness );
+				#else
+					return vec3( 0.0 );
+				#endif
+			}
+		#endif
+	#endif
+#endif`,Gp=`ToonMaterial material;
+material.diffuseColor = diffuseColor.rgb;`,Hp=`varying vec3 vViewPosition;
+struct ToonMaterial {
+	vec3 diffuseColor;
+};
+void RE_Direct_Toon( const in IncidentLight directLight, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in ToonMaterial material, inout ReflectedLight reflectedLight ) {
+	vec3 irradiance = getGradientIrradiance( geometryNormal, directLight.direction ) * directLight.color;
+	reflectedLight.directDiffuse += irradiance * BRDF_Lambert( material.diffuseColor );
+}
+void RE_IndirectDiffuse_Toon( const in vec3 irradiance, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in ToonMaterial material, inout ReflectedLight reflectedLight ) {
+	reflectedLight.indirectDiffuse += irradiance * BRDF_Lambert( material.diffuseColor );
+}
+#define RE_Direct				RE_Direct_Toon
+#define RE_IndirectDiffuse		RE_IndirectDiffuse_Toon`,Wp=`BlinnPhongMaterial material;
+material.diffuseColor = diffuseColor.rgb;
+material.specularColor = specular;
+material.specularShininess = shininess;
+material.specularStrength = specularStrength;`,Xp=`varying vec3 vViewPosition;
+struct BlinnPhongMaterial {
+	vec3 diffuseColor;
+	vec3 specularColor;
+	float specularShininess;
+	float specularStrength;
+};
+void RE_Direct_BlinnPhong( const in IncidentLight directLight, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in BlinnPhongMaterial material, inout ReflectedLight reflectedLight ) {
+	float dotNL = saturate( dot( geometryNormal, directLight.direction ) );
+	vec3 irradiance = dotNL * directLight.color;
+	reflectedLight.directDiffuse += irradiance * BRDF_Lambert( material.diffuseColor );
+	reflectedLight.directSpecular += irradiance * BRDF_BlinnPhong( directLight.direction, geometryViewDir, geometryNormal, material.specularColor, material.specularShininess ) * material.specularStrength;
+}
+void RE_IndirectDiffuse_BlinnPhong( const in vec3 irradiance, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in BlinnPhongMaterial material, inout ReflectedLight reflectedLight ) {
+	reflectedLight.indirectDiffuse += irradiance * BRDF_Lambert( material.diffuseColor );
+}
+#define RE_Direct				RE_Direct_BlinnPhong
+#define RE_IndirectDiffuse		RE_IndirectDiffuse_BlinnPhong`,qp=`PhysicalMaterial material;
+material.diffuseColor = diffuseColor.rgb;
+material.diffuseContribution = diffuseColor.rgb * ( 1.0 - metalnessFactor );
+material.metalness = metalnessFactor;
+vec3 dxy = max( abs( dFdx( nonPerturbedNormal ) ), abs( dFdy( nonPerturbedNormal ) ) );
+float geometryRoughness = max( max( dxy.x, dxy.y ), dxy.z );
+material.roughness = max( roughnessFactor, 0.0525 );material.roughness += geometryRoughness;
+material.roughness = min( material.roughness, 1.0 );
+#ifdef IOR
+	material.ior = ior;
+	#ifdef USE_SPECULAR
+		float specularIntensityFactor = specularIntensity;
+		vec3 specularColorFactor = specularColor;
+		#ifdef USE_SPECULAR_COLORMAP
+			specularColorFactor *= texture2D( specularColorMap, vSpecularColorMapUv ).rgb;
+		#endif
+		#ifdef USE_SPECULAR_INTENSITYMAP
+			specularIntensityFactor *= texture2D( specularIntensityMap, vSpecularIntensityMapUv ).a;
+		#endif
+		material.specularF90 = mix( specularIntensityFactor, 1.0, metalnessFactor );
+	#else
+		float specularIntensityFactor = 1.0;
+		vec3 specularColorFactor = vec3( 1.0 );
+		material.specularF90 = 1.0;
+	#endif
+	material.specularColor = min( pow2( ( material.ior - 1.0 ) / ( material.ior + 1.0 ) ) * specularColorFactor, vec3( 1.0 ) ) * specularIntensityFactor;
+	material.specularColorBlended = mix( material.specularColor, diffuseColor.rgb, metalnessFactor );
+#else
+	material.specularColor = vec3( 0.04 );
+	material.specularColorBlended = mix( material.specularColor, diffuseColor.rgb, metalnessFactor );
+	material.specularF90 = 1.0;
+#endif
+#ifdef USE_CLEARCOAT
+	material.clearcoat = clearcoat;
+	material.clearcoatRoughness = clearcoatRoughness;
+	material.clearcoatF0 = vec3( 0.04 );
+	material.clearcoatF90 = 1.0;
+	#ifdef USE_CLEARCOATMAP
+		material.clearcoat *= texture2D( clearcoatMap, vClearcoatMapUv ).x;
+	#endif
+	#ifdef USE_CLEARCOAT_ROUGHNESSMAP
+		material.clearcoatRoughness *= texture2D( clearcoatRoughnessMap, vClearcoatRoughnessMapUv ).y;
+	#endif
+	material.clearcoat = saturate( material.clearcoat );	material.clearcoatRoughness = max( material.clearcoatRoughness, 0.0525 );
+	material.clearcoatRoughness += geometryRoughness;
+	material.clearcoatRoughness = min( material.clearcoatRoughness, 1.0 );
+#endif
+#ifdef USE_DISPERSION
+	material.dispersion = dispersion;
+#endif
+#ifdef USE_RETROREFLECTION
+	material.retroreflectivity = retroreflectivity;
+#endif
+#ifdef USE_IRIDESCENCE
+	material.iridescence = iridescence;
+	material.iridescenceIOR = iridescenceIOR;
+	#ifdef USE_IRIDESCENCEMAP
+		material.iridescence *= texture2D( iridescenceMap, vIridescenceMapUv ).r;
+	#endif
+	#ifdef USE_IRIDESCENCE_THICKNESSMAP
+		material.iridescenceThickness = (iridescenceThicknessMaximum - iridescenceThicknessMinimum) * texture2D( iridescenceThicknessMap, vIridescenceThicknessMapUv ).g + iridescenceThicknessMinimum;
+	#else
+		material.iridescenceThickness = iridescenceThicknessMaximum;
+	#endif
+#endif
+#ifdef USE_SHEEN
+	material.sheenColor = sheenColor;
+	#ifdef USE_SHEEN_COLORMAP
+		material.sheenColor *= texture2D( sheenColorMap, vSheenColorMapUv ).rgb;
+	#endif
+	material.sheenRoughness = clamp( sheenRoughness, 0.0001, 1.0 );
+	#ifdef USE_SHEEN_ROUGHNESSMAP
+		material.sheenRoughness *= texture2D( sheenRoughnessMap, vSheenRoughnessMapUv ).a;
+	#endif
+#endif
+#ifdef USE_ANISOTROPY
+	#ifdef USE_ANISOTROPYMAP
+		mat2 anisotropyMat = mat2( anisotropyVector.x, anisotropyVector.y, - anisotropyVector.y, anisotropyVector.x );
+		vec3 anisotropyPolar = texture2D( anisotropyMap, vAnisotropyMapUv ).rgb;
+		vec2 anisotropyV = anisotropyMat * normalize( 2.0 * anisotropyPolar.rg - vec2( 1.0 ) ) * anisotropyPolar.b;
+	#else
+		vec2 anisotropyV = anisotropyVector;
+	#endif
+	material.anisotropy = length( anisotropyV );
+	if( material.anisotropy == 0.0 ) {
+		anisotropyV = vec2( 1.0, 0.0 );
+	} else {
+		anisotropyV /= material.anisotropy;
+		material.anisotropy = saturate( material.anisotropy );
+	}
+	material.alphaT = mix( pow2( material.roughness ), 1.0, pow2( material.anisotropy ) );
+	material.anisotropyT = tbn[ 0 ] * anisotropyV.x + tbn[ 1 ] * anisotropyV.y;
+	material.anisotropyB = tbn[ 1 ] * anisotropyV.x - tbn[ 0 ] * anisotropyV.y;
+#endif`,Yp=`uniform sampler2D dfgLUT;
+struct PhysicalMaterial {
+	vec3 diffuseColor;
+	vec3 diffuseContribution;
+	vec3 specularColor;
+	vec3 specularColorBlended;
+	float roughness;
+	float metalness;
+	float specularF90;
+	float dispersion;
+	vec2 dfg;
+	vec3 multiScatteringCompensation;
+	#ifdef USE_RETROREFLECTION
+		float retroreflectivity;
+	#endif
+	#ifdef USE_CLEARCOAT
+		float clearcoat;
+		float clearcoatRoughness;
+		vec3 clearcoatF0;
+		float clearcoatF90;
+	#endif
+	#ifdef USE_IRIDESCENCE
+		float iridescence;
+		float iridescenceIOR;
+		float iridescenceThickness;
+		vec3 iridescenceFresnel;
+		vec3 iridescenceF0Dielectric;
+		vec3 iridescenceF0Metallic;
+	#endif
+	#ifdef USE_SHEEN
+		vec3 sheenColor;
+		float sheenRoughness;
+	#endif
+	#ifdef IOR
+		float ior;
+	#endif
+	#ifdef USE_TRANSMISSION
+		float transmission;
+		float transmissionAlpha;
+		float thickness;
+		float attenuationDistance;
+		vec3 attenuationColor;
+	#endif
+	#ifdef USE_ANISOTROPY
+		float anisotropy;
+		float alphaT;
+		vec3 anisotropyT;
+		vec3 anisotropyB;
+	#endif
+};
+vec3 clearcoatSpecularDirect = vec3( 0.0 );
+vec3 clearcoatSpecularIndirect = vec3( 0.0 );
+vec3 sheenSpecularDirect = vec3( 0.0 );
+vec3 sheenSpecularIndirect = vec3(0.0 );
+vec3 Schlick_to_F0( const in vec3 f, const in float f90, const in float dotVH ) {
+    float x = clamp( 1.0 - dotVH, 0.0, 1.0 );
+    float x2 = x * x;
+    float x5 = clamp( x * x2 * x2, 0.0, 0.9999 );
+    return ( f - vec3( f90 ) * x5 ) / ( 1.0 - x5 );
+}
+float V_GGX_SmithCorrelated( const in float alpha, const in float dotNL, const in float dotNV ) {
+	float a2 = pow2( alpha );
+	float gv = dotNL * sqrt( a2 + ( 1.0 - a2 ) * pow2( dotNV ) );
+	float gl = dotNV * sqrt( a2 + ( 1.0 - a2 ) * pow2( dotNL ) );
+	return 0.5 / max( gv + gl, EPSILON );
+}
+float D_GGX( const in float alpha, const in float dotNH ) {
+	float a2 = pow2( alpha );
+	float denom = pow2( dotNH ) * ( a2 - 1.0 ) + 1.0;
+	return RECIPROCAL_PI * a2 / pow2( denom );
+}
+#ifdef USE_ANISOTROPY
+	float V_GGX_SmithCorrelated_Anisotropic( const in float alphaT, const in float alphaB, const in float dotTV, const in float dotBV, const in float dotTL, const in float dotBL, const in float dotNV, const in float dotNL ) {
+		float gv = dotNL * length( vec3( alphaT * dotTV, alphaB * dotBV, dotNV ) );
+		float gl = dotNV * length( vec3( alphaT * dotTL, alphaB * dotBL, dotNL ) );
+		return 0.5 / max( gv + gl, EPSILON );
+	}
+	float D_GGX_Anisotropic( const in float alphaT, const in float alphaB, const in float dotNH, const in float dotTH, const in float dotBH ) {
+		float a2 = alphaT * alphaB;
+		highp vec3 v = vec3( alphaB * dotTH, alphaT * dotBH, a2 * dotNH );
+		highp float v2 = dot( v, v );
+		float w2 = a2 / v2;
+		return RECIPROCAL_PI * a2 * pow2 ( w2 );
+	}
+#endif
+#ifdef USE_CLEARCOAT
+	vec3 BRDF_GGX_Clearcoat( const in vec3 lightDir, const in vec3 viewDir, const in vec3 normal, const in PhysicalMaterial material) {
+		vec3 f0 = material.clearcoatF0;
+		float f90 = material.clearcoatF90;
+		float roughness = material.clearcoatRoughness;
+		float alpha = pow2( roughness );
+		vec3 halfDir = normalize( lightDir + viewDir );
+		float dotNL = saturate( dot( normal, lightDir ) );
+		float dotNV = saturate( dot( normal, viewDir ) );
+		float dotNH = saturate( dot( normal, halfDir ) );
+		float dotVH = saturate( dot( viewDir, halfDir ) );
+		vec3 F = F_Schlick( f0, f90, dotVH );
+		float V = V_GGX_SmithCorrelated( alpha, dotNL, dotNV );
+		float D = D_GGX( alpha, dotNH );
+		return F * ( V * D );
+	}
+#endif
+vec3 BRDF_GGX( const in vec3 lightDir, const in vec3 viewDir, const in vec3 normal, const in PhysicalMaterial material ) {
+	vec3 f0 = material.specularColorBlended;
+	float f90 = material.specularF90;
+	float roughness = material.roughness;
+	float alpha = pow2( roughness );
+	vec3 halfDir = normalize( lightDir + viewDir );
+	float dotNL = saturate( dot( normal, lightDir ) );
+	float dotNV = saturate( dot( normal, viewDir ) );
+	float dotNH = saturate( dot( normal, halfDir ) );
+	float dotVH = saturate( dot( viewDir, halfDir ) );
+	vec3 F = F_Schlick( f0, f90, dotVH );
+	#ifdef USE_IRIDESCENCE
+		F = mix( F, material.iridescenceFresnel, material.iridescence );
+	#endif
+	#ifdef USE_ANISOTROPY
+		float dotTL = dot( material.anisotropyT, lightDir );
+		float dotTV = dot( material.anisotropyT, viewDir );
+		float dotTH = dot( material.anisotropyT, halfDir );
+		float dotBL = dot( material.anisotropyB, lightDir );
+		float dotBV = dot( material.anisotropyB, viewDir );
+		float dotBH = dot( material.anisotropyB, halfDir );
+		float V = V_GGX_SmithCorrelated_Anisotropic( material.alphaT, alpha, dotTV, dotBV, dotTL, dotBL, dotNV, dotNL );
+		float D = D_GGX_Anisotropic( material.alphaT, alpha, dotNH, dotTH, dotBH );
+	#else
+		float V = V_GGX_SmithCorrelated( alpha, dotNL, dotNV );
+		float D = D_GGX( alpha, dotNH );
+	#endif
+	return F * ( V * D );
+}
+vec2 LTC_Uv( const in vec3 N, const in vec3 V, const in float roughness ) {
+	const float LUT_SIZE = 64.0;
+	const float LUT_SCALE = ( LUT_SIZE - 1.0 ) / LUT_SIZE;
+	const float LUT_BIAS = 0.5 / LUT_SIZE;
+	float dotNV = saturate( dot( N, V ) );
+	vec2 uv = vec2( roughness, sqrt( 1.0 - dotNV ) );
+	uv = uv * LUT_SCALE + LUT_BIAS;
+	return uv;
+}
+float LTC_ClippedSphereFormFactor( const in vec3 f ) {
+	float l = length( f );
+	return max( ( l * l + f.z ) / ( l + 1.0 ), 0.0 );
+}
+vec3 LTC_EdgeVectorFormFactor( const in vec3 v1, const in vec3 v2 ) {
+	float x = dot( v1, v2 );
+	float y = abs( x );
+	float a = 0.8543985 + ( 0.4965155 + 0.0145206 * y ) * y;
+	float b = 3.4175940 + ( 4.1616724 + y ) * y;
+	float v = a / b;
+	float theta_sintheta = ( x > 0.0 ) ? v : 0.5 * inversesqrt( max( 1.0 - x * x, 1e-7 ) ) - v;
+	return cross( v1, v2 ) * theta_sintheta;
+}
+vec3 LTC_Evaluate( const in vec3 N, const in vec3 V, const in vec3 P, const in mat3 mInv, const in vec3 rectCoords[ 4 ] ) {
+	vec3 v1 = rectCoords[ 1 ] - rectCoords[ 0 ];
+	vec3 v2 = rectCoords[ 3 ] - rectCoords[ 0 ];
+	vec3 lightNormal = cross( v1, v2 );
+	if( dot( lightNormal, P - rectCoords[ 0 ] ) < 0.0 ) return vec3( 0.0 );
+	vec3 T1, T2;
+	T1 = normalize( V - N * dot( V, N ) );
+	T2 = - cross( N, T1 );
+	mat3 mat = mInv * transpose( mat3( T1, T2, N ) );
+	vec3 coords[ 4 ];
+	coords[ 0 ] = mat * ( rectCoords[ 0 ] - P );
+	coords[ 1 ] = mat * ( rectCoords[ 1 ] - P );
+	coords[ 2 ] = mat * ( rectCoords[ 2 ] - P );
+	coords[ 3 ] = mat * ( rectCoords[ 3 ] - P );
+	coords[ 0 ] = normalize( coords[ 0 ] );
+	coords[ 1 ] = normalize( coords[ 1 ] );
+	coords[ 2 ] = normalize( coords[ 2 ] );
+	coords[ 3 ] = normalize( coords[ 3 ] );
+	vec3 vectorFormFactor = vec3( 0.0 );
+	vectorFormFactor += LTC_EdgeVectorFormFactor( coords[ 0 ], coords[ 1 ] );
+	vectorFormFactor += LTC_EdgeVectorFormFactor( coords[ 1 ], coords[ 2 ] );
+	vectorFormFactor += LTC_EdgeVectorFormFactor( coords[ 2 ], coords[ 3 ] );
+	vectorFormFactor += LTC_EdgeVectorFormFactor( coords[ 3 ], coords[ 0 ] );
+	float result = LTC_ClippedSphereFormFactor( vectorFormFactor );
+	return vec3( result );
+}
+#if defined( USE_SHEEN )
+float D_Charlie( float roughness, float dotNH ) {
+	float alpha = pow2( roughness );
+	float invAlpha = 1.0 / alpha;
+	float cos2h = dotNH * dotNH;
+	float sin2h = max( 1.0 - cos2h, 0.0078125 );
+	return ( 2.0 + invAlpha ) * pow( sin2h, invAlpha * 0.5 ) / ( 2.0 * PI );
+}
+float V_Neubelt( float dotNV, float dotNL ) {
+	return saturate( 1.0 / ( 4.0 * ( dotNL + dotNV - dotNL * dotNV ) ) );
+}
+vec3 BRDF_Sheen( const in vec3 lightDir, const in vec3 viewDir, const in vec3 normal, vec3 sheenColor, const in float sheenRoughness ) {
+	vec3 halfDir = normalize( lightDir + viewDir );
+	float dotNL = saturate( dot( normal, lightDir ) );
+	float dotNV = saturate( dot( normal, viewDir ) );
+	float dotNH = saturate( dot( normal, halfDir ) );
+	float D = D_Charlie( sheenRoughness, dotNH );
+	float V = V_Neubelt( dotNV, dotNL );
+	return sheenColor * ( D * V );
+}
+#endif
+float IBLSheenBRDF( const in vec3 normal, const in vec3 viewDir, const in float roughness ) {
+	float dotNV = saturate( dot( normal, viewDir ) );
+	float r2 = roughness * roughness;
+	float rInv = 1.0 / ( roughness + 0.1 );
+	float a = -1.9362 + 1.0678 * roughness + 0.4573 * r2 - 0.8469 * rInv;
+	float b = -0.6014 + 0.5538 * roughness - 0.4670 * r2 - 0.1255 * rInv;
+	float DG = exp( a * dotNV + b );
+	return saturate( DG );
+}
+vec3 EnvironmentBRDF( const in vec3 normal, const in vec3 viewDir, const in vec3 specularColor, const in float specularF90, const in float roughness ) {
+	float dotNV = saturate( dot( normal, viewDir ) );
+	vec2 fab = texture2D( dfgLUT, vec2( roughness, dotNV ) ).rg;
+	return specularColor * fab.x + specularF90 * fab.y;
+}
+#ifdef USE_IRIDESCENCE
+void computeMultiscatteringIridescence( const in vec2 fab, const in vec3 specularColor, const in float specularF90, const in float iridescence, const in vec3 iridescenceF0, inout vec3 singleScatter, inout vec3 multiScatter ) {
+#else
+void computeMultiscattering( const in vec2 fab, const in vec3 specularColor, const in float specularF90, inout vec3 singleScatter, inout vec3 multiScatter ) {
+#endif
+	#ifdef USE_IRIDESCENCE
+		vec3 Fr = mix( specularColor, iridescenceF0, iridescence );
+	#else
+		vec3 Fr = specularColor;
+	#endif
+	vec3 FssEss = Fr * fab.x + specularF90 * fab.y;
+	float Ess = fab.x + fab.y;
+	float Ems = 1.0 - Ess;
+	vec3 Favg = Fr + ( 1.0 - Fr ) * 0.047619;	vec3 Fms = FssEss * Favg / ( 1.0 - Ems * Favg );
+	singleScatter += FssEss;
+	multiScatter += Fms * Ems;
+}
+#if NUM_RECT_AREA_LIGHTS > 0
+	void RE_Direct_RectArea_Physical( const in RectAreaLight rectAreaLight, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in PhysicalMaterial material, inout ReflectedLight reflectedLight ) {
+		vec3 normal = geometryNormal;
+		vec3 viewDir = geometryViewDir;
+		vec3 position = geometryPosition;
+		vec3 lightPos = rectAreaLight.position;
+		vec3 halfWidth = rectAreaLight.halfWidth;
+		vec3 halfHeight = rectAreaLight.halfHeight;
+		vec3 lightColor = rectAreaLight.color;
+		float roughness = material.roughness;
+		vec3 rectCoords[ 4 ];
+		rectCoords[ 0 ] = lightPos + halfWidth - halfHeight;		rectCoords[ 1 ] = lightPos - halfWidth - halfHeight;
+		rectCoords[ 2 ] = lightPos - halfWidth + halfHeight;
+		rectCoords[ 3 ] = lightPos + halfWidth + halfHeight;
+		vec2 uv = LTC_Uv( normal, viewDir, roughness );
+		vec4 t1 = texture2D( ltc_1, uv );
+		vec4 t2 = texture2D( ltc_2, uv );
+		mat3 mInv = mat3(
+			vec3( t1.x, 0, t1.y ),
+			vec3(    0, 1,    0 ),
+			vec3( t1.z, 0, t1.w )
+		);
+		vec3 fresnel = ( material.specularColorBlended * t2.x + ( material.specularF90 - material.specularColorBlended ) * t2.y );
+		reflectedLight.directSpecular += lightColor * fresnel * LTC_Evaluate( normal, viewDir, position, mInv, rectCoords );
+		reflectedLight.directDiffuse += lightColor * material.diffuseContribution * LTC_Evaluate( normal, viewDir, position, mat3( 1.0 ), rectCoords );
+		#ifdef USE_CLEARCOAT
+			vec3 Ncc = geometryClearcoatNormal;
+			vec2 uvClearcoat = LTC_Uv( Ncc, viewDir, material.clearcoatRoughness );
+			vec4 t1Clearcoat = texture2D( ltc_1, uvClearcoat );
+			vec4 t2Clearcoat = texture2D( ltc_2, uvClearcoat );
+			mat3 mInvClearcoat = mat3(
+				vec3( t1Clearcoat.x, 0, t1Clearcoat.y ),
+				vec3(             0, 1,             0 ),
+				vec3( t1Clearcoat.z, 0, t1Clearcoat.w )
+			);
+			vec3 fresnelClearcoat = material.clearcoatF0 * t2Clearcoat.x + ( material.clearcoatF90 - material.clearcoatF0 ) * t2Clearcoat.y;
+			clearcoatSpecularDirect += lightColor * fresnelClearcoat * LTC_Evaluate( Ncc, viewDir, position, mInvClearcoat, rectCoords );
+		#endif
+	}
+#endif
+void RE_Direct_Physical( const in IncidentLight directLight, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in PhysicalMaterial material, inout ReflectedLight reflectedLight ) {
+	float dotNL = saturate( dot( geometryNormal, directLight.direction ) );
+	vec3 irradiance = dotNL * directLight.color;
+	#ifdef USE_CLEARCOAT
+		float dotNLcc = saturate( dot( geometryClearcoatNormal, directLight.direction ) );
+		vec3 ccIrradiance = dotNLcc * directLight.color;
+		clearcoatSpecularDirect += ccIrradiance * BRDF_GGX_Clearcoat( directLight.direction, geometryViewDir, geometryClearcoatNormal, material );
+	#endif
+	#ifdef USE_SHEEN
+ 
+ 		sheenSpecularDirect += irradiance * BRDF_Sheen( directLight.direction, geometryViewDir, geometryNormal, material.sheenColor, material.sheenRoughness );
+ 
+ 		float sheenAlbedoV = IBLSheenBRDF( geometryNormal, geometryViewDir, material.sheenRoughness );
+ 		float sheenAlbedoL = IBLSheenBRDF( geometryNormal, directLight.direction, material.sheenRoughness );
+ 
+ 		float sheenEnergyComp = 1.0 - max3( material.sheenColor ) * max( sheenAlbedoV, sheenAlbedoL );
+ 
+ 		irradiance *= sheenEnergyComp;
+ 
+ 	#endif
+	vec3 specularBRDF = BRDF_GGX( directLight.direction, geometryViewDir, geometryNormal, material );
+	#ifdef USE_RETROREFLECTION
+		vec3 retroViewDir = reflect( - geometryViewDir, geometryNormal );
+		vec3 retroSpecularBRDF = BRDF_GGX( directLight.direction, retroViewDir, geometryNormal, material );
+		specularBRDF = mix( specularBRDF, retroSpecularBRDF, saturate( material.retroreflectivity ) );
+	#endif
+	reflectedLight.directSpecular += irradiance * specularBRDF * material.multiScatteringCompensation;
+	vec3 halfDir = normalize( directLight.direction + geometryViewDir );
+	float dotVH = saturate( dot( geometryViewDir, halfDir ) );
+	vec3 F = F_Schlick( material.specularColor, material.specularF90, dotVH );
+	#ifdef USE_RETROREFLECTION
+		vec3 retroHalfDir = normalize( directLight.direction + retroViewDir );
+		float dotRetroVH = saturate( dot( retroViewDir, retroHalfDir ) );
+		vec3 retroF = F_Schlick( material.specularColor, material.specularF90, dotRetroVH );
+		F = mix( F, retroF, saturate( material.retroreflectivity ) );
+	#endif
+	reflectedLight.directDiffuse += irradiance * BRDF_Lambert( material.diffuseContribution ) * ( 1.0 - F );
+}
+void RE_IndirectDiffuse_Physical( const in vec3 irradiance, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in PhysicalMaterial material, inout ReflectedLight reflectedLight ) {
+	vec3 singleScattering = vec3( 0.0 );
+	vec3 multiScattering = vec3( 0.0 );
+	#ifdef USE_IRIDESCENCE
+		computeMultiscatteringIridescence( material.dfg, material.specularColor, material.specularF90, material.iridescence, material.iridescenceF0Dielectric, singleScattering, multiScattering );
+	#else
+		computeMultiscattering( material.dfg, material.specularColor, material.specularF90, singleScattering, multiScattering );
+	#endif
+	vec3 diffuse = irradiance * BRDF_Lambert( material.diffuseContribution ) * ( 1.0 - singleScattering - multiScattering );
+	#ifdef USE_SHEEN
+		float sheenAlbedo = IBLSheenBRDF( geometryNormal, geometryViewDir, material.sheenRoughness );
+		sheenSpecularIndirect += irradiance * material.sheenColor * sheenAlbedo * RECIPROCAL_PI;
+		float sheenEnergyComp = 1.0 - max3( material.sheenColor ) * sheenAlbedo;
+		diffuse *= sheenEnergyComp;
+	#endif
+	reflectedLight.indirectDiffuse += diffuse;
+}
+void RE_IndirectSpecular_Physical( const in vec3 radiance, const in vec3 irradiance, const in vec3 clearcoatRadiance, const in vec3 geometryPosition, const in vec3 geometryNormal, const in vec3 geometryViewDir, const in vec3 geometryClearcoatNormal, const in PhysicalMaterial material, inout ReflectedLight reflectedLight) {
+	#ifdef USE_CLEARCOAT
+		clearcoatSpecularIndirect += clearcoatRadiance * EnvironmentBRDF( geometryClearcoatNormal, geometryViewDir, material.clearcoatF0, material.clearcoatF90, material.clearcoatRoughness );
+	#endif
+	#ifdef USE_SHEEN
+		sheenSpecularIndirect += irradiance * material.sheenColor * IBLSheenBRDF( geometryNormal, geometryViewDir, material.sheenRoughness ) * RECIPROCAL_PI;
+ 	#endif
+	vec3 singleScatteringDielectric = vec3( 0.0 );
+	vec3 multiScatteringDielectric = vec3( 0.0 );
+	vec3 singleScatteringMetallic = vec3( 0.0 );
+	vec3 multiScatteringMetallic = vec3( 0.0 );
+	#ifdef USE_IRIDESCENCE
+		computeMultiscatteringIridescence( material.dfg, material.specularColor, material.specularF90, material.iridescence, material.iridescenceF0Dielectric, singleScatteringDielectric, multiScatteringDielectric );
+		computeMultiscatteringIridescence( material.dfg, material.diffuseColor, material.specularF90, material.iridescence, material.iridescenceF0Metallic, singleScatteringMetallic, multiScatteringMetallic );
+	#else
+		computeMultiscattering( material.dfg, material.specularColor, material.specularF90, singleScatteringDielectric, multiScatteringDielectric );
+		computeMultiscattering( material.dfg, material.diffuseColor, material.specularF90, singleScatteringMetallic, multiScatteringMetallic );
+	#endif
+	vec3 singleScattering = mix( singleScatteringDielectric, singleScatteringMetallic, material.metalness );
+	vec3 multiScattering = mix( multiScatteringDielectric, multiScatteringMetallic, material.metalness );
+	vec3 totalScatteringDielectric = singleScatteringDielectric + multiScatteringDielectric;
+	vec3 diffuse = material.diffuseContribution * ( 1.0 - totalScatteringDielectric );
+	vec3 cosineWeightedIrradiance = irradiance * RECIPROCAL_PI;
+	vec3 indirectSpecular = radiance * singleScattering;
+	indirectSpecular += multiScattering * cosineWeightedIrradiance;
+	vec3 indirectDiffuse = diffuse * cosineWeightedIrradiance;
+	#ifdef USE_SHEEN
+		float sheenAlbedo = IBLSheenBRDF( geometryNormal, geometryViewDir, material.sheenRoughness );
+		float sheenEnergyComp = 1.0 - max3( material.sheenColor ) * sheenAlbedo;
+		indirectSpecular *= sheenEnergyComp;
+		indirectDiffuse *= sheenEnergyComp;
+	#endif
+	reflectedLight.indirectSpecular += indirectSpecular;
+	reflectedLight.indirectDiffuse += indirectDiffuse;
+}
+#define RE_Direct				RE_Direct_Physical
+#define RE_Direct_RectArea		RE_Direct_RectArea_Physical
+#define RE_IndirectDiffuse		RE_IndirectDiffuse_Physical
+#define RE_IndirectSpecular		RE_IndirectSpecular_Physical
+float computeSpecularOcclusion( const in float dotNV, const in float ambientOcclusion, const in float roughness ) {
+	return saturate( pow( dotNV + ambientOcclusion, exp2( - 16.0 * roughness - 1.0 ) ) - 1.0 + ambientOcclusion );
+}`,Zp=`
+vec3 geometryPosition = - vViewPosition;
+vec3 geometryNormal = normal;
+vec3 geometryViewDir = ( isOrthographic ) ? vec3( 0, 0, 1 ) : normalize( vViewPosition );
+vec3 geometryClearcoatNormal = vec3( 0.0 );
+#ifdef USE_CLEARCOAT
+	geometryClearcoatNormal = clearcoatNormal;
+#endif
+#ifdef USE_IRIDESCENCE
+	float dotNVi = saturate( dot( normal, geometryViewDir ) );
+	if ( material.iridescenceThickness == 0.0 ) {
+		material.iridescence = 0.0;
+	} else {
+		material.iridescence = saturate( material.iridescence );
+	}
+	if ( material.iridescence > 0.0 ) {
+		vec3 iridescenceFresnelDielectric = evalIridescence( 1.0, material.iridescenceIOR, dotNVi, material.iridescenceThickness, material.specularColor );
+		vec3 iridescenceFresnelMetallic = evalIridescence( 1.0, material.iridescenceIOR, dotNVi, material.iridescenceThickness, material.diffuseColor );
+		material.iridescenceFresnel = mix( iridescenceFresnelDielectric, iridescenceFresnelMetallic, material.metalness );
+		material.iridescenceF0Dielectric = Schlick_to_F0( iridescenceFresnelDielectric, 1.0, dotNVi );
+		material.iridescenceF0Metallic = Schlick_to_F0( iridescenceFresnelMetallic, 1.0, dotNVi );
+	}
+#endif
+#ifdef STANDARD
+	float dotNVms = saturate( dot( geometryNormal, geometryViewDir ) );
+	material.dfg = texture2D( dfgLUT, vec2( material.roughness, dotNVms ) ).rg;
+	#if ( NUM_SUN_LIGHTS > 0 || NUM_DIR_LIGHTS > 0 || NUM_POINT_LIGHTS > 0 || NUM_SPOT_LIGHTS > 0 )
+		float EssMs = material.dfg.x + material.dfg.y;
+		material.multiScatteringCompensation = 1.0 + material.specularColorBlended * ( 1.0 / EssMs - 1.0 );
+	#endif
+#endif
+IncidentLight directLight;
+#if ( NUM_POINT_LIGHTS > 0 ) && defined( RE_Direct )
+	PointLight pointLight;
+	#if defined( USE_SHADOWMAP ) && NUM_POINT_LIGHT_SHADOWS > 0
+	PointLightShadow pointLightShadow;
+	#endif
+	#pragma unroll_loop_start
+	for ( int i = 0; i < NUM_POINT_LIGHTS; i ++ ) {
+		pointLight = pointLights[ i ];
+		getPointLightInfo( pointLight, geometryPosition, directLight );
+		#if defined( USE_SHADOWMAP ) && ( UNROLLED_LOOP_INDEX < NUM_POINT_LIGHT_SHADOWS ) && ( defined( SHADOWMAP_TYPE_PCF ) || defined( SHADOWMAP_TYPE_BASIC ) )
+		pointLightShadow = pointLightShadows[ i ];
+		directLight.color *= ( directLight.visible && receiveShadow ) ? getPointShadow( pointShadowMap[ i ], pointLightShadow.shadowMapSize, pointLightShadow.shadowIntensity, pointLightShadow.shadowBias, pointLightShadow.shadowRadius, vPointShadowCoord[ i ], pointLightShadow.shadowCameraNear, pointLightShadow.shadowCameraFar ) : 1.0;
+		#endif
+		RE_Direct( directLight, geometryPosition, geometryNormal, geometryViewDir, geometryClearcoatNormal, material, reflectedLight );
+	}
+	#pragma unroll_loop_end
+#endif
+#if ( NUM_SPOT_LIGHTS > 0 ) && defined( RE_Direct )
+	SpotLight spotLight;
+	vec4 spotColor;
+	vec3 spotLightCoord;
+	bool inSpotLightMap;
+	#if defined( USE_SHADOWMAP ) && NUM_SPOT_LIGHT_SHADOWS > 0
+	SpotLightShadow spotLightShadow;
+	#endif
+	#pragma unroll_loop_start
+	for ( int i = 0; i < NUM_SPOT_LIGHTS; i ++ ) {
+		spotLight = spotLights[ i ];
+		getSpotLightInfo( spotLight, geometryPosition, directLight );
+		#if ( UNROLLED_LOOP_INDEX < NUM_SPOT_LIGHT_SHADOWS_WITH_MAPS )
+		#define SPOT_LIGHT_MAP_INDEX UNROLLED_LOOP_INDEX
+		#elif ( UNROLLED_LOOP_INDEX < NUM_SPOT_LIGHT_SHADOWS )
+		#define SPOT_LIGHT_MAP_INDEX NUM_SPOT_LIGHT_MAPS
+		#else
+		#define SPOT_LIGHT_MAP_INDEX ( UNROLLED_LOOP_INDEX - NUM_SPOT_LIGHT_SHADOWS + NUM_SPOT_LIGHT_SHADOWS_WITH_MAPS )
+		#endif
+		#if ( SPOT_LIGHT_MAP_INDEX < NUM_SPOT_LIGHT_MAPS )
+			spotLightCoord = vSpotLightCoord[ i ].xyz / vSpotLightCoord[ i ].w;
+			inSpotLightMap = all( lessThan( abs( spotLightCoord * 2. - 1. ), vec3( 1.0 ) ) );
+			spotColor = texture2D( spotLightMap[ SPOT_LIGHT_MAP_INDEX ], spotLightCoord.xy );
+			directLight.color = inSpotLightMap ? directLight.color * spotColor.rgb : directLight.color;
+		#endif
+		#undef SPOT_LIGHT_MAP_INDEX
+		#if defined( USE_SHADOWMAP ) && ( UNROLLED_LOOP_INDEX < NUM_SPOT_LIGHT_SHADOWS )
+		spotLightShadow = spotLightShadows[ i ];
+		directLight.color *= ( directLight.visible && receiveShadow ) ? getShadow( spotShadowMap[ i ], spotLightShadow.shadowMapSize, spotLightShadow.shadowIntensity, spotLightShadow.shadowBias, spotLightShadow.shadowRadius, vSpotLightCoord[ i ] ) : 1.0;
+		#endif
+		RE_Direct( directLight, geometryPosition, geometryNormal, geometryViewDir, geometryClearcoatNormal, material, reflectedLight );
+	}
+	#pragma unroll_loop_end
+#endif
+#if ( NUM_SUN_LIGHTS > 0 ) && defined( RE_Direct )
+	SunLight sunLight;
+	#if defined( USE_SHADOWMAP ) && NUM_SUN_LIGHT_SHADOWS > 0
+	SunLightShadow sunLightShadow;
+	#endif
+	#pragma unroll_loop_start
+	for ( int i = 0; i < NUM_SUN_LIGHTS; i ++ ) {
+		sunLight = sunLights[ i ];
+		getSunLightInfo( sunLight, directLight );
+		#if defined( USE_SHADOWMAP ) && ( UNROLLED_LOOP_INDEX < NUM_SUN_LIGHT_SHADOWS )
+		sunLightShadow = sunLightShadows[ i ];
+		directLight.color *= ( directLight.visible && receiveShadow ) ? getSunShadow( sunShadowMap[ i ], sunLightShadow, UNROLLED_LOOP_INDEX ) : 1.0;
+		#endif
+		RE_Direct( directLight, geometryPosition, geometryNormal, geometryViewDir, geometryClearcoatNormal, material, reflectedLight );
+	}
+	#pragma unroll_loop_end
+#endif
+#if ( NUM_DIR_LIGHTS > 0 ) && defined( RE_Direct )
+	DirectionalLight directionalLight;
+	#if defined( USE_SHADOWMAP ) && NUM_DIR_LIGHT_SHADOWS > 0
+	DirectionalLightShadow directionalLightShadow;
+	#endif
+	#pragma unroll_loop_start
+	for ( int i = 0; i < NUM_DIR_LIGHTS; i ++ ) {
+		directionalLight = directionalLights[ i ];
+		getDirectionalLightInfo( directionalLight, directLight );
+		#if defined( USE_SHADOWMAP ) && ( UNROLLED_LOOP_INDEX < NUM_DIR_LIGHT_SHADOWS )
+		directionalLightShadow = directionalLightShadows[ i ];
+		directLight.color *= ( directLight.visible && receiveShadow ) ? getShadow( directionalShadowMap[ i ], directionalLightShadow.shadowMapSize, directionalLightShadow.shadowIntensity, directionalLightShadow.shadowBias, directionalLightShadow.shadowRadius, vDirectionalShadowCoord[ i ] ) : 1.0;
+		#endif
+		RE_Direct( directLight, geometryPosition, geometryNormal, geometryViewDir, geometryClearcoatNormal, material, reflectedLight );
+	}
+	#pragma unroll_loop_end
+#endif
+#if ( NUM_RECT_AREA_LIGHTS > 0 ) && defined( RE_Direct_RectArea )
+	RectAreaLight rectAreaLight;
+	#pragma unroll_loop_start
+	for ( int i = 0; i < NUM_RECT_AREA_LIGHTS; i ++ ) {
+		rectAreaLight = rectAreaLights[ i ];
+		RE_Direct_RectArea( rectAreaLight, geometryPosition, geometryNormal, geometryViewDir, geometryClearcoatNormal, material, reflectedLight );
+	}
+	#pragma unroll_loop_end
+#endif
+#if defined( RE_IndirectDiffuse )
+	vec3 iblIrradiance = vec3( 0.0 );
+	vec3 irradiance = getAmbientLightIrradiance( ambientLightColor );
+	#if defined( USE_LIGHT_PROBES )
+		irradiance += getLightProbeIrradiance( lightProbe, geometryNormal );
+	#endif
+	#if ( NUM_HEMI_LIGHTS > 0 )
+		#pragma unroll_loop_start
+		for ( int i = 0; i < NUM_HEMI_LIGHTS; i ++ ) {
+			irradiance += getHemisphereLightIrradiance( hemisphereLights[ i ], geometryNormal );
+		}
+		#pragma unroll_loop_end
+	#endif
+	#ifdef USE_LIGHT_PROBES_GRID
+		vec3 probeWorldPos = ( ( vec4( geometryPosition, 1.0 ) - viewMatrix[ 3 ] ) * viewMatrix ).xyz;
+		vec3 probeWorldNormal = transformNormalByInverseViewMatrix( geometryNormal, viewMatrix );
+		irradiance += getLightProbeGridIrradiance( probeWorldPos, probeWorldNormal );
+	#endif
+#endif
+#if defined( RE_IndirectSpecular )
+	vec3 radiance = vec3( 0.0 );
+	vec3 clearcoatRadiance = vec3( 0.0 );
+#endif`,$p=`#if defined( RE_IndirectDiffuse )
+	#ifdef USE_LIGHTMAP
+		vec4 lightMapTexel = texture2D( lightMap, vLightMapUv );
+		vec3 lightMapIrradiance = lightMapTexel.rgb * lightMapIntensity;
+		irradiance += lightMapIrradiance;
+	#endif
+	#if defined( USE_ENVMAP ) && defined( ENVMAP_TYPE_CUBE_UV )
+		#if defined( STANDARD ) || defined( LAMBERT ) || defined( PHONG )
+			iblIrradiance += getIBLIrradiance( geometryNormal );
+		#endif
+	#endif
+#endif
+#if defined( USE_ENVMAP ) && defined( RE_IndirectSpecular )
+	#ifdef USE_ANISOTROPY
+		vec3 iblRadiance = getIBLAnisotropyRadiance( geometryViewDir, geometryNormal, material.roughness, material.anisotropyB, material.anisotropy );
+	#else
+		vec3 iblRadiance = getIBLRadiance( geometryViewDir, geometryNormal, material.roughness );
+	#endif
+	#ifdef USE_RETROREFLECTION
+		#ifdef USE_ANISOTROPY
+			vec3 retroIBLRadiance = getIBLAnisotropyRetroRadiance( geometryViewDir, geometryNormal, material.roughness, material.anisotropyB, material.anisotropy );
+		#else
+			vec3 retroIBLRadiance = getIBLRetroRadiance( geometryViewDir, geometryNormal, material.roughness );
+		#endif
+		iblRadiance = mix( iblRadiance, retroIBLRadiance, saturate( material.retroreflectivity ) );
+	#endif
+	radiance += iblRadiance;
+	#ifdef USE_CLEARCOAT
+		clearcoatRadiance += getIBLRadiance( geometryViewDir, geometryClearcoatNormal, material.clearcoatRoughness );
+	#endif
+#endif`,Jp=`#if defined( RE_IndirectDiffuse )
+	#if defined( LAMBERT ) || defined( PHONG )
+		irradiance += iblIrradiance;
+	#endif
+	RE_IndirectDiffuse( irradiance, geometryPosition, geometryNormal, geometryViewDir, geometryClearcoatNormal, material, reflectedLight );
+#endif
+#if defined( RE_IndirectSpecular )
+	RE_IndirectSpecular( radiance, iblIrradiance, clearcoatRadiance, geometryPosition, geometryNormal, geometryViewDir, geometryClearcoatNormal, material, reflectedLight );
+#endif`,Kp=`#ifdef USE_LIGHT_PROBES_GRID
+uniform highp sampler3D probesSH;
+uniform vec3 probesMin;
+uniform vec3 probesMax;
+uniform vec3 probesResolution;
+vec3 getLightProbeGridIrradiance( vec3 worldPos, vec3 worldNormal ) {
+	vec3 res = probesResolution;
+	vec3 gridRange = probesMax - probesMin;
+	vec3 resMinusOne = res - 1.0;
+	vec3 probeSpacing = gridRange / resMinusOne;
+	vec3 samplePos = worldPos + worldNormal * probeSpacing * 0.5;
+	vec3 uvw = clamp( ( samplePos - probesMin ) / gridRange, 0.0, 1.0 );
+	uvw = uvw * resMinusOne / res + 0.5 / res;
+	float nz          = res.z;
+	float paddedSlices = nz + 2.0;
+	float atlasDepth  = 7.0 * paddedSlices;
+	float uvZBase     = uvw.z * nz + 1.0;
+	vec4 s0 = texture( probesSH, vec3( uvw.xy, ( uvZBase                       ) / atlasDepth ) );
+	vec4 s1 = texture( probesSH, vec3( uvw.xy, ( uvZBase +       paddedSlices   ) / atlasDepth ) );
+	vec4 s2 = texture( probesSH, vec3( uvw.xy, ( uvZBase + 2.0 * paddedSlices   ) / atlasDepth ) );
+	vec4 s3 = texture( probesSH, vec3( uvw.xy, ( uvZBase + 3.0 * paddedSlices   ) / atlasDepth ) );
+	vec4 s4 = texture( probesSH, vec3( uvw.xy, ( uvZBase + 4.0 * paddedSlices   ) / atlasDepth ) );
+	vec4 s5 = texture( probesSH, vec3( uvw.xy, ( uvZBase + 5.0 * paddedSlices   ) / atlasDepth ) );
+	vec4 s6 = texture( probesSH, vec3( uvw.xy, ( uvZBase + 6.0 * paddedSlices   ) / atlasDepth ) );
+	vec3 c0 = s0.xyz;
+	vec3 c1 = vec3( s0.w, s1.xy );
+	vec3 c2 = vec3( s1.zw, s2.x );
+	vec3 c3 = s2.yzw;
+	vec3 c4 = s3.xyz;
+	vec3 c5 = vec3( s3.w, s4.xy );
+	vec3 c6 = vec3( s4.zw, s5.x );
+	vec3 c7 = s5.yzw;
+	vec3 c8 = s6.xyz;
+	float x = worldNormal.x, y = worldNormal.y, z = worldNormal.z;
+	vec3 result = c0 * 0.886227;
+	result += c1 * 2.0 * 0.511664 * y;
+	result += c2 * 2.0 * 0.511664 * z;
+	result += c3 * 2.0 * 0.511664 * x;
+	result += c4 * 2.0 * 0.429043 * x * y;
+	result += c5 * 2.0 * 0.429043 * y * z;
+	result += c6 * ( 0.743125 * z * z - 0.247708 );
+	result += c7 * 2.0 * 0.429043 * x * z;
+	result += c8 * 0.429043 * ( x * x - y * y );
+	return max( result, vec3( 0.0 ) );
+}
+#endif`,jp=`#if defined( USE_LOGARITHMIC_DEPTH_BUFFER )
+	gl_FragDepth = vIsPerspective == 0.0 ? gl_FragCoord.z : log2( vFragDepth ) * logDepthBufFC * 0.5;
+#endif`,Qp=`#if defined( USE_LOGARITHMIC_DEPTH_BUFFER )
+	uniform float logDepthBufFC;
+	varying float vFragDepth;
+	varying float vIsPerspective;
+#endif`,tm=`#ifdef USE_LOGARITHMIC_DEPTH_BUFFER
+	varying float vFragDepth;
+	varying float vIsPerspective;
+#endif`,em=`#ifdef USE_LOGARITHMIC_DEPTH_BUFFER
+	vFragDepth = 1.0 + gl_Position.w;
+	vIsPerspective = float( isPerspectiveMatrix( projectionMatrix ) );
+#endif`,nm=`#ifdef USE_MAP
+	vec4 sampledDiffuseColor = texture2D( map, vMapUv );
+	#ifdef DECODE_VIDEO_TEXTURE
+		sampledDiffuseColor = sRGBTransferEOTF( sampledDiffuseColor );
+	#endif
+	diffuseColor *= sampledDiffuseColor;
+#endif`,im=`#ifdef USE_MAP
+	uniform sampler2D map;
+#endif`,sm=`#if defined( USE_MAP ) || defined( USE_ALPHAMAP )
+	#if defined( USE_POINTS_UV )
+		vec2 uv = vUv;
+	#else
+		vec2 uv = ( uvTransform * vec3( gl_PointCoord.x, 1.0 - gl_PointCoord.y, 1 ) ).xy;
+	#endif
+#endif
+#ifdef USE_MAP
+	diffuseColor *= texture2D( map, uv );
+#endif
+#ifdef USE_ALPHAMAP
+	diffuseColor.a *= texture2D( alphaMap, uv ).g;
+#endif`,rm=`#if defined( USE_POINTS_UV )
+	varying vec2 vUv;
+#else
+	#if defined( USE_MAP ) || defined( USE_ALPHAMAP )
+		uniform mat3 uvTransform;
+	#endif
+#endif
+#ifdef USE_MAP
+	uniform sampler2D map;
+#endif
+#ifdef USE_ALPHAMAP
+	uniform sampler2D alphaMap;
+#endif`,om=`float metalnessFactor = metalness;
+#ifdef USE_METALNESSMAP
+	vec4 texelMetalness = texture2D( metalnessMap, vMetalnessMapUv );
+	metalnessFactor *= texelMetalness.b;
+#endif`,am=`#ifdef USE_METALNESSMAP
+	uniform sampler2D metalnessMap;
+#endif`,lm=`#ifdef USE_INSTANCING_MORPH
+	float morphTargetInfluences[ MORPHTARGETS_COUNT ];
+	float morphTargetBaseInfluence = texelFetch( morphTexture, ivec2( 0, gl_InstanceID ), 0 ).r;
+	for ( int i = 0; i < MORPHTARGETS_COUNT; i ++ ) {
+		morphTargetInfluences[i] =  texelFetch( morphTexture, ivec2( i + 1, gl_InstanceID ), 0 ).r;
+	}
+#endif`,cm=`#if defined( USE_MORPHCOLORS )
+	vColor *= morphTargetBaseInfluence;
+	for ( int i = 0; i < MORPHTARGETS_COUNT; i ++ ) {
+		#if defined( USE_COLOR_ALPHA )
+			if ( morphTargetInfluences[ i ] != 0.0 ) vColor += getMorph( gl_VertexID, i, 2 ) * morphTargetInfluences[ i ];
+		#elif defined( USE_COLOR )
+			if ( morphTargetInfluences[ i ] != 0.0 ) vColor += getMorph( gl_VertexID, i, 2 ).rgb * morphTargetInfluences[ i ];
+		#endif
+	}
+#endif`,hm=`#ifdef USE_MORPHNORMALS
+	objectNormal *= morphTargetBaseInfluence;
+	for ( int i = 0; i < MORPHTARGETS_COUNT; i ++ ) {
+		if ( morphTargetInfluences[ i ] != 0.0 ) objectNormal += getMorph( gl_VertexID, i, 1 ).xyz * morphTargetInfluences[ i ];
+	}
+#endif`,um=`#ifdef USE_MORPHTARGETS
+	#ifndef USE_INSTANCING_MORPH
+		uniform float morphTargetBaseInfluence;
+		uniform float morphTargetInfluences[ MORPHTARGETS_COUNT ];
+	#endif
+	uniform sampler2DArray morphTargetsTexture;
+	uniform ivec2 morphTargetsTextureSize;
+	vec4 getMorph( const in int vertexIndex, const in int morphTargetIndex, const in int offset ) {
+		int texelIndex = vertexIndex * MORPHTARGETS_TEXTURE_STRIDE + offset;
+		int y = texelIndex / morphTargetsTextureSize.x;
+		int x = texelIndex - y * morphTargetsTextureSize.x;
+		ivec3 morphUV = ivec3( x, y, morphTargetIndex );
+		return texelFetch( morphTargetsTexture, morphUV, 0 );
+	}
+#endif`,dm=`#ifdef USE_MORPHTARGETS
+	transformed *= morphTargetBaseInfluence;
+	for ( int i = 0; i < MORPHTARGETS_COUNT; i ++ ) {
+		if ( morphTargetInfluences[ i ] != 0.0 ) transformed += getMorph( gl_VertexID, i, 0 ).xyz * morphTargetInfluences[ i ];
+	}
+#endif`,fm=`float faceDirection = gl_FrontFacing ? 1.0 : - 1.0;
+#ifdef FLAT_SHADED
+	vec3 fdx = dFdx( vViewPosition );
+	vec3 fdy = dFdy( vViewPosition );
+	vec3 normal = normalize( cross( fdx, fdy ) );
+#else
+	vec3 normal = normalize( vNormal );
+	#ifdef DOUBLE_SIDED
+		normal *= faceDirection;
+	#endif
+#endif
+#if defined( USE_NORMALMAP_TANGENTSPACE ) || defined( USE_CLEARCOAT_NORMALMAP ) || defined( USE_ANISOTROPY )
+	#ifdef USE_TANGENT
+		mat3 tbn = mat3( normalize( vTangent ), normalize( vBitangent ), normal );
+	#else
+		mat3 tbn = getTangentFrame( - vViewPosition, normal,
+		#if defined( USE_NORMALMAP )
+			vNormalMapUv
+		#elif defined( USE_CLEARCOAT_NORMALMAP )
+			vClearcoatNormalMapUv
+		#else
+			vUv
+		#endif
+		);
+	#endif
+	#ifdef DOUBLE_SIDED
+		tbn[0] *= faceDirection;
+		tbn[1] *= faceDirection;
+	#endif
+#endif
+#ifdef USE_CLEARCOAT_NORMALMAP
+	#ifdef USE_TANGENT
+		mat3 tbn2 = mat3( normalize( vTangent ), normalize( vBitangent ), normal );
+	#else
+		mat3 tbn2 = getTangentFrame( - vViewPosition, normal, vClearcoatNormalMapUv );
+	#endif
+	#ifdef DOUBLE_SIDED
+		tbn2[0] *= faceDirection;
+		tbn2[1] *= faceDirection;
+	#endif
+#endif
+vec3 nonPerturbedNormal = normal;`,pm=`#ifdef USE_NORMALMAP_OBJECTSPACE
+	normal = texture2D( normalMap, vNormalMapUv ).xyz * 2.0 - 1.0;
+	#ifdef FLIP_SIDED
+		normal = - normal;
+	#endif
+	#ifdef DOUBLE_SIDED
+		normal = normal * faceDirection;
+	#endif
+	normal = normalize( normalMatrix * normal );
+#elif defined( USE_NORMALMAP_TANGENTSPACE )
+	vec3 mapN = texture2D( normalMap, vNormalMapUv ).xyz * 2.0 - 1.0;
+	#if defined( USE_PACKED_NORMALMAP )
+		mapN = vec3( mapN.xy, sqrt( saturate( 1.0 - dot( mapN.xy, mapN.xy ) ) ) );
+	#endif
+	mapN.xy *= normalScale;
+	normal = normalize( tbn * mapN );
+#elif defined( USE_BUMPMAP )
+	normal = perturbNormalArb( - vViewPosition, normal, dHdxy_fwd(), faceDirection );
+#endif`,mm=`#ifndef FLAT_SHADED
+	varying vec3 vNormal;
+	#ifdef USE_TANGENT
+		varying vec3 vTangent;
+		varying vec3 vBitangent;
+	#endif
+#endif`,gm=`#ifndef FLAT_SHADED
+	varying vec3 vNormal;
+	#ifdef USE_TANGENT
+		varying vec3 vTangent;
+		varying vec3 vBitangent;
+	#endif
+#endif`,xm=`#ifndef FLAT_SHADED
+	vNormal = normalize( transformedNormal );
+	#ifdef USE_TANGENT
+		vTangent = normalize( transformedTangent );
+		vBitangent = normalize( cross( vNormal, vTangent ) * tangent.w );
+		#ifdef FLIP_SIDED
+			vBitangent = - vBitangent;
+		#endif
+	#endif
+#endif`,_m=`#ifdef USE_NORMALMAP
+	uniform sampler2D normalMap;
+	uniform vec2 normalScale;
+#endif
+#ifdef USE_NORMALMAP_OBJECTSPACE
+	uniform mat3 normalMatrix;
+#endif
+#if ! defined ( USE_TANGENT ) && ( defined ( USE_NORMALMAP_TANGENTSPACE ) || defined ( USE_CLEARCOAT_NORMALMAP ) || defined( USE_ANISOTROPY ) )
+	mat3 getTangentFrame( vec3 eye_pos, vec3 surf_norm, vec2 uv ) {
+		vec3 q0 = dFdx( eye_pos.xyz );
+		vec3 q1 = dFdy( eye_pos.xyz );
+		vec2 st0 = dFdx( uv.st );
+		vec2 st1 = dFdy( uv.st );
+		vec3 N = surf_norm;
+		vec3 q1perp = cross( q1, N );
+		vec3 q0perp = cross( N, q0 );
+		vec3 T = q1perp * st0.x + q0perp * st1.x;
+		vec3 B = q1perp * st0.y + q0perp * st1.y;
+		float det = max( dot( T, T ), dot( B, B ) );
+		float scale = ( det == 0.0 ) ? 0.0 : inversesqrt( det );
+		return mat3( T * scale, B * scale, N );
+	}
+#endif`,ym=`#ifdef USE_CLEARCOAT
+	vec3 clearcoatNormal = nonPerturbedNormal;
+#endif`,vm=`#ifdef USE_CLEARCOAT_NORMALMAP
+	vec3 clearcoatMapN = texture2D( clearcoatNormalMap, vClearcoatNormalMapUv ).xyz * 2.0 - 1.0;
+	clearcoatMapN.xy *= clearcoatNormalScale;
+	clearcoatNormal = normalize( tbn2 * clearcoatMapN );
+#endif`,Mm=`#ifdef USE_CLEARCOATMAP
+	uniform sampler2D clearcoatMap;
+#endif
+#ifdef USE_CLEARCOAT_NORMALMAP
+	uniform sampler2D clearcoatNormalMap;
+	uniform vec2 clearcoatNormalScale;
+#endif
+#ifdef USE_CLEARCOAT_ROUGHNESSMAP
+	uniform sampler2D clearcoatRoughnessMap;
+#endif`,Sm=`#ifdef USE_IRIDESCENCEMAP
+	uniform sampler2D iridescenceMap;
+#endif
+#ifdef USE_IRIDESCENCE_THICKNESSMAP
+	uniform sampler2D iridescenceThicknessMap;
+#endif`,bm=`#ifdef OPAQUE
+diffuseColor.a = 1.0;
+#endif
+#ifdef USE_TRANSMISSION
+diffuseColor.a *= material.transmissionAlpha;
+#endif
+gl_FragColor = vec4( outgoingLight, diffuseColor.a );`,wm=`vec3 packNormalToRGB( const in vec3 normal ) {
+	return normalize( normal ) * 0.5 + 0.5;
+}
+vec3 unpackRGBToNormal( const in vec3 rgb ) {
+	return 2.0 * rgb.xyz - 1.0;
+}
+const float PackUpscale = 256. / 255.;const float UnpackDownscale = 255. / 256.;const float ShiftRight8 = 1. / 256.;
+const float Inv255 = 1. / 255.;
+const vec4 PackFactors = vec4( 1.0, 256.0, 256.0 * 256.0, 256.0 * 256.0 * 256.0 );
+const vec2 UnpackFactors2 = vec2( UnpackDownscale, 1.0 / PackFactors.g );
+const vec3 UnpackFactors3 = vec3( UnpackDownscale / PackFactors.rg, 1.0 / PackFactors.b );
+const vec4 UnpackFactors4 = vec4( UnpackDownscale / PackFactors.rgb, 1.0 / PackFactors.a );
+vec4 packDepthToRGBA( const in float v ) {
+	if( v <= 0.0 )
+		return vec4( 0., 0., 0., 0. );
+	if( v >= 1.0 )
+		return vec4( 1., 1., 1., 1. );
+	float vuf;
+	float af = modf( v * PackFactors.a, vuf );
+	float bf = modf( vuf * ShiftRight8, vuf );
+	float gf = modf( vuf * ShiftRight8, vuf );
+	return vec4( vuf * Inv255, gf * PackUpscale, bf * PackUpscale, af );
+}
+vec3 packDepthToRGB( const in float v ) {
+	if( v <= 0.0 )
+		return vec3( 0., 0., 0. );
+	if( v >= 1.0 )
+		return vec3( 1., 1., 1. );
+	float vuf;
+	float bf = modf( v * PackFactors.b, vuf );
+	float gf = modf( vuf * ShiftRight8, vuf );
+	return vec3( vuf * Inv255, gf * PackUpscale, bf );
+}
+vec2 packDepthToRG( const in float v ) {
+	if( v <= 0.0 )
+		return vec2( 0., 0. );
+	if( v >= 1.0 )
+		return vec2( 1., 1. );
+	float vuf;
+	float gf = modf( v * 256., vuf );
+	return vec2( vuf * Inv255, gf );
+}
+float unpackRGBAToDepth( const in vec4 v ) {
+	return dot( v, UnpackFactors4 );
+}
+float unpackRGBToDepth( const in vec3 v ) {
+	return dot( v, UnpackFactors3 );
+}
+float unpackRGToDepth( const in vec2 v ) {
+	return v.r * UnpackFactors2.r + v.g * UnpackFactors2.g;
+}
+vec4 pack2HalfToRGBA( const in vec2 v ) {
+	vec4 r = vec4( v.x, fract( v.x * 255.0 ), v.y, fract( v.y * 255.0 ) );
+	return vec4( r.x - r.y / 255.0, r.y, r.z - r.w / 255.0, r.w );
+}
+vec2 unpackRGBATo2Half( const in vec4 v ) {
+	return vec2( v.x + ( v.y / 255.0 ), v.z + ( v.w / 255.0 ) );
+}
+float viewZToOrthographicDepth( const in float viewZ, const in float near, const in float far ) {
+	return ( viewZ + near ) / ( near - far );
+}
+float orthographicDepthToViewZ( const in float depth, const in float near, const in float far ) {
+	#ifdef USE_REVERSED_DEPTH_BUFFER
+	
+		return depth * ( far - near ) - far;
+	#else
+		return depth * ( near - far ) - near;
+	#endif
+}
+float viewZToPerspectiveDepth( const in float viewZ, const in float near, const in float far ) {
+	return ( ( near + viewZ ) * far ) / ( ( far - near ) * viewZ );
+}
+float perspectiveDepthToViewZ( const in float depth, const in float near, const in float far ) {
+	
+	#ifdef USE_REVERSED_DEPTH_BUFFER
+		return ( near * far ) / ( ( near - far ) * depth - near );
+	#else
+		return ( near * far ) / ( ( far - near ) * depth - far );
+	#endif
+}`,Tm=`#ifdef PREMULTIPLIED_ALPHA
+	gl_FragColor.rgb *= gl_FragColor.a;
+#endif`,Em=`vec4 mvPosition = vec4( transformed, 1.0 );
+#ifdef USE_BATCHING
+	mvPosition = batchingMatrix * mvPosition;
+#endif
+#ifdef USE_INSTANCING
+	mvPosition = instanceMatrix * mvPosition;
+#endif
+mvPosition = modelViewMatrix * mvPosition;
+gl_Position = projectionMatrix * mvPosition;`,Am=`#ifdef DITHERING
+	gl_FragColor.rgb = dithering( gl_FragColor.rgb );
+#endif`,Cm=`#ifdef DITHERING
+	vec3 dithering( vec3 color ) {
+		float grid_position = rand( gl_FragCoord.xy );
+		vec3 dither_shift_RGB = vec3( 0.25 / 255.0, -0.25 / 255.0, 0.25 / 255.0 );
+		dither_shift_RGB = mix( 2.0 * dither_shift_RGB, -2.0 * dither_shift_RGB, grid_position );
+		return color + dither_shift_RGB;
+	}
+#endif`,Rm=`float roughnessFactor = roughness;
+#ifdef USE_ROUGHNESSMAP
+	vec4 texelRoughness = texture2D( roughnessMap, vRoughnessMapUv );
+	roughnessFactor *= texelRoughness.g;
+#endif`,Im=`#ifdef USE_ROUGHNESSMAP
+	uniform sampler2D roughnessMap;
+#endif`,Pm=`#if NUM_SPOT_LIGHT_COORDS > 0
+	varying vec4 vSpotLightCoord[ NUM_SPOT_LIGHT_COORDS ];
+#endif
+#if NUM_SPOT_LIGHT_MAPS > 0
+	uniform sampler2D spotLightMap[ NUM_SPOT_LIGHT_MAPS ];
+#endif
+#ifdef USE_SHADOWMAP
+	#if NUM_SUN_LIGHT_SHADOWS > 0
+		#define SUN_LIGHT_CASCADES 2
+		#if defined( SHADOWMAP_TYPE_PCF )
+			uniform sampler2DShadow sunShadowMap[ NUM_SUN_LIGHT_SHADOWS ];
+		#else
+			uniform sampler2D sunShadowMap[ NUM_SUN_LIGHT_SHADOWS ];
+		#endif
+		uniform mat4 sunShadowMatrix[ NUM_SUN_LIGHT_SHADOWS * SUN_LIGHT_CASCADES ];
+		uniform vec4 sunShadowCascade[ NUM_SUN_LIGHT_SHADOWS * SUN_LIGHT_CASCADES ];
+		varying vec4 vSunShadowWorldPosition;
+		varying vec3 vSunShadowWorldNormal;
+		struct SunLightShadow {
+			float shadowIntensity;
+			float shadowBias;
+			float shadowNormalBias;
+			float shadowRadius;
+			vec2 shadowMapSize;
+		};
+		uniform SunLightShadow sunLightShadows[ NUM_SUN_LIGHT_SHADOWS ];
+	#endif
+	#if NUM_DIR_LIGHT_SHADOWS > 0
+		#if defined( SHADOWMAP_TYPE_PCF )
+			uniform sampler2DShadow directionalShadowMap[ NUM_DIR_LIGHT_SHADOWS ];
+		#else
+			uniform sampler2D directionalShadowMap[ NUM_DIR_LIGHT_SHADOWS ];
+		#endif
+		varying vec4 vDirectionalShadowCoord[ NUM_DIR_LIGHT_SHADOWS ];
+		struct DirectionalLightShadow {
+			float shadowIntensity;
+			float shadowBias;
+			float shadowNormalBias;
+			float shadowRadius;
+			vec2 shadowMapSize;
+		};
+		uniform DirectionalLightShadow directionalLightShadows[ NUM_DIR_LIGHT_SHADOWS ];
+	#endif
+	#if NUM_SPOT_LIGHT_SHADOWS > 0
+		#if defined( SHADOWMAP_TYPE_PCF )
+			uniform sampler2DShadow spotShadowMap[ NUM_SPOT_LIGHT_SHADOWS ];
+		#else
+			uniform sampler2D spotShadowMap[ NUM_SPOT_LIGHT_SHADOWS ];
+		#endif
+		struct SpotLightShadow {
+			float shadowIntensity;
+			float shadowBias;
+			float shadowNormalBias;
+			float shadowRadius;
+			vec2 shadowMapSize;
+		};
+		uniform SpotLightShadow spotLightShadows[ NUM_SPOT_LIGHT_SHADOWS ];
+	#endif
+	#if NUM_POINT_LIGHT_SHADOWS > 0
+		#if defined( SHADOWMAP_TYPE_PCF )
+			uniform samplerCubeShadow pointShadowMap[ NUM_POINT_LIGHT_SHADOWS ];
+		#elif defined( SHADOWMAP_TYPE_BASIC )
+			uniform samplerCube pointShadowMap[ NUM_POINT_LIGHT_SHADOWS ];
+		#endif
+		varying vec4 vPointShadowCoord[ NUM_POINT_LIGHT_SHADOWS ];
+		struct PointLightShadow {
+			float shadowIntensity;
+			float shadowBias;
+			float shadowNormalBias;
+			float shadowRadius;
+			vec2 shadowMapSize;
+			float shadowCameraNear;
+			float shadowCameraFar;
+		};
+		uniform PointLightShadow pointLightShadows[ NUM_POINT_LIGHT_SHADOWS ];
+	#endif
+	#if defined( SHADOWMAP_TYPE_PCF )
+		float interleavedGradientNoise( vec2 position ) {
+			return fract( 52.9829189 * fract( dot( position, vec2( 0.06711056, 0.00583715 ) ) ) );
+		}
+		vec2 vogelDiskSample( int sampleIndex, int samplesCount, float phi ) {
+			const float goldenAngle = 2.399963229728653;
+			float r = sqrt( ( float( sampleIndex ) + 0.5 ) / float( samplesCount ) );
+			float theta = float( sampleIndex ) * goldenAngle + phi;
+			return vec2( cos( theta ), sin( theta ) ) * r;
+		}
+	#endif
+	#if defined( SHADOWMAP_TYPE_PCF )
+		float getShadow( sampler2DShadow shadowMap, vec2 shadowMapSize, float shadowIntensity, float shadowBias, float shadowRadius, vec4 shadowCoord ) {
+			float shadow = 1.0;
+			shadowCoord.xyz /= shadowCoord.w;
+			shadowCoord.z += shadowBias;
+			bool inFrustum = shadowCoord.x >= 0.0 && shadowCoord.x <= 1.0 && shadowCoord.y >= 0.0 && shadowCoord.y <= 1.0;
+			bool frustumTest = inFrustum && shadowCoord.z <= 1.0;
+			if ( frustumTest ) {
+				vec2 texelSize = vec2( 1.0 ) / shadowMapSize;
+				float radius = shadowRadius * texelSize.x;
+				float phi = interleavedGradientNoise( gl_FragCoord.xy ) * PI2;
+				shadow = (
+					texture( shadowMap, vec3( shadowCoord.xy + vogelDiskSample( 0, 5, phi ) * radius, shadowCoord.z ) ) +
+					texture( shadowMap, vec3( shadowCoord.xy + vogelDiskSample( 1, 5, phi ) * radius, shadowCoord.z ) ) +
+					texture( shadowMap, vec3( shadowCoord.xy + vogelDiskSample( 2, 5, phi ) * radius, shadowCoord.z ) ) +
+					texture( shadowMap, vec3( shadowCoord.xy + vogelDiskSample( 3, 5, phi ) * radius, shadowCoord.z ) ) +
+					texture( shadowMap, vec3( shadowCoord.xy + vogelDiskSample( 4, 5, phi ) * radius, shadowCoord.z ) )
+				) * 0.2;
+			}
+			return mix( 1.0, shadow, shadowIntensity );
+		}
+	#elif defined( SHADOWMAP_TYPE_VSM )
+		float getShadow( sampler2D shadowMap, vec2 shadowMapSize, float shadowIntensity, float shadowBias, float shadowRadius, vec4 shadowCoord ) {
+			float shadow = 1.0;
+			shadowCoord.xyz /= shadowCoord.w;
+			#ifdef USE_REVERSED_DEPTH_BUFFER
+				shadowCoord.z -= shadowBias;
+			#else
+				shadowCoord.z += shadowBias;
+			#endif
+			bool inFrustum = shadowCoord.x >= 0.0 && shadowCoord.x <= 1.0 && shadowCoord.y >= 0.0 && shadowCoord.y <= 1.0;
+			bool frustumTest = inFrustum && shadowCoord.z <= 1.0;
+			if ( frustumTest ) {
+				vec2 distribution = texture2D( shadowMap, shadowCoord.xy ).rg;
+				float mean = distribution.x;
+				float variance = distribution.y * distribution.y;
+				#ifdef USE_REVERSED_DEPTH_BUFFER
+					float hard_shadow = step( mean, shadowCoord.z );
+				#else
+					float hard_shadow = step( shadowCoord.z, mean );
+				#endif
+				
+				if ( hard_shadow == 1.0 ) {
+					shadow = 1.0;
+				} else {
+					variance = max( variance, 0.0000001 );
+					float d = shadowCoord.z - mean;
+					float p_max = variance / ( variance + d * d );
+					p_max = clamp( ( p_max - 0.3 ) / 0.65, 0.0, 1.0 );
+					shadow = max( hard_shadow, p_max );
+				}
+			}
+			return mix( 1.0, shadow, shadowIntensity );
+		}
+	#else
+		float getShadow( sampler2D shadowMap, vec2 shadowMapSize, float shadowIntensity, float shadowBias, float shadowRadius, vec4 shadowCoord ) {
+			float shadow = 1.0;
+			shadowCoord.xyz /= shadowCoord.w;
+			#ifdef USE_REVERSED_DEPTH_BUFFER
+				shadowCoord.z -= shadowBias;
+			#else
+				shadowCoord.z += shadowBias;
+			#endif
+			bool inFrustum = shadowCoord.x >= 0.0 && shadowCoord.x <= 1.0 && shadowCoord.y >= 0.0 && shadowCoord.y <= 1.0;
+			bool frustumTest = inFrustum && shadowCoord.z <= 1.0;
+			if ( frustumTest ) {
+				float depth = texture2D( shadowMap, shadowCoord.xy ).r;
+				#ifdef USE_REVERSED_DEPTH_BUFFER
+					shadow = step( depth, shadowCoord.z );
+				#else
+					shadow = step( shadowCoord.z, depth );
+				#endif
+			}
+			return mix( 1.0, shadow, shadowIntensity );
+		}
+	#endif
+	#if NUM_SUN_LIGHT_SHADOWS > 0
+		float getSunShadow(
+			#if defined( SHADOWMAP_TYPE_PCF )
+				sampler2DShadow shadowMap,
+			#else
+				sampler2D shadowMap,
+			#endif
+			SunLightShadow sunLightShadow,
+			int shadowIndex
+		) {
+			vec4 shadowWorldPosition = vec4( vSunShadowWorldPosition.xyz + vSunShadowWorldNormal * sunLightShadow.shadowNormalBias, 1.0 );
+			float viewDepth = vSunShadowWorldPosition.w;
+			int cascadeOffset = shadowIndex * SUN_LIGHT_CASCADES;
+			float shadow = 1.0;
+			for ( int i = SUN_LIGHT_CASCADES - 1; i >= 0; i -- ) {
+				vec4 cascade = sunShadowCascade[ cascadeOffset + i ];
+				if ( viewDepth >= cascade.x && viewDepth < cascade.y ) {
+					float cascadeShadow = getShadow(
+						shadowMap,
+						sunLightShadow.shadowMapSize,
+						sunLightShadow.shadowIntensity,
+						sunLightShadow.shadowBias,
+						sunLightShadow.shadowRadius,
+						sunShadowMatrix[ cascadeOffset + i ] * shadowWorldPosition
+					);
+					shadow = mix( cascadeShadow, shadow, smoothstep( cascade.z, cascade.y, viewDepth ) );
+				}
+			}
+			return shadow;
+		}
+	#endif
+	#if NUM_POINT_LIGHT_SHADOWS > 0
+	#if defined( SHADOWMAP_TYPE_PCF )
+	float getPointShadow( samplerCubeShadow shadowMap, vec2 shadowMapSize, float shadowIntensity, float shadowBias, float shadowRadius, vec4 shadowCoord, float shadowCameraNear, float shadowCameraFar ) {
+		float shadow = 1.0;
+		vec3 lightToPosition = shadowCoord.xyz;
+		vec3 bd3D = normalize( lightToPosition );
+		vec3 absVec = abs( lightToPosition );
+		float viewSpaceZ = max( max( absVec.x, absVec.y ), absVec.z );
+		if ( viewSpaceZ - shadowCameraFar <= 0.0 && viewSpaceZ - shadowCameraNear >= 0.0 ) {
+			#ifdef USE_REVERSED_DEPTH_BUFFER
+				float dp = ( shadowCameraNear * ( shadowCameraFar - viewSpaceZ ) ) / ( viewSpaceZ * ( shadowCameraFar - shadowCameraNear ) );
+				dp -= shadowBias;
+			#else
+				float dp = ( shadowCameraFar * ( viewSpaceZ - shadowCameraNear ) ) / ( viewSpaceZ * ( shadowCameraFar - shadowCameraNear ) );
+				dp += shadowBias;
+			#endif
+			float texelSize = shadowRadius / shadowMapSize.x;
+			vec3 absDir = abs( bd3D );
+			vec3 tangent = absDir.x > absDir.z ? vec3( 0.0, 1.0, 0.0 ) : vec3( 1.0, 0.0, 0.0 );
+			tangent = normalize( cross( bd3D, tangent ) );
+			vec3 bitangent = cross( bd3D, tangent );
+			float phi = interleavedGradientNoise( gl_FragCoord.xy ) * PI2;
+			vec2 sample0 = vogelDiskSample( 0, 5, phi );
+			vec2 sample1 = vogelDiskSample( 1, 5, phi );
+			vec2 sample2 = vogelDiskSample( 2, 5, phi );
+			vec2 sample3 = vogelDiskSample( 3, 5, phi );
+			vec2 sample4 = vogelDiskSample( 4, 5, phi );
+			shadow = (
+				texture( shadowMap, vec4( bd3D + ( tangent * sample0.x + bitangent * sample0.y ) * texelSize, dp ) ) +
+				texture( shadowMap, vec4( bd3D + ( tangent * sample1.x + bitangent * sample1.y ) * texelSize, dp ) ) +
+				texture( shadowMap, vec4( bd3D + ( tangent * sample2.x + bitangent * sample2.y ) * texelSize, dp ) ) +
+				texture( shadowMap, vec4( bd3D + ( tangent * sample3.x + bitangent * sample3.y ) * texelSize, dp ) ) +
+				texture( shadowMap, vec4( bd3D + ( tangent * sample4.x + bitangent * sample4.y ) * texelSize, dp ) )
+			) * 0.2;
+		}
+		return mix( 1.0, shadow, shadowIntensity );
+	}
+	#elif defined( SHADOWMAP_TYPE_BASIC )
+	float getPointShadow( samplerCube shadowMap, vec2 shadowMapSize, float shadowIntensity, float shadowBias, float shadowRadius, vec4 shadowCoord, float shadowCameraNear, float shadowCameraFar ) {
+		float shadow = 1.0;
+		vec3 lightToPosition = shadowCoord.xyz;
+		vec3 absVec = abs( lightToPosition );
+		float viewSpaceZ = max( max( absVec.x, absVec.y ), absVec.z );
+		if ( viewSpaceZ - shadowCameraFar <= 0.0 && viewSpaceZ - shadowCameraNear >= 0.0 ) {
+			float dp = ( shadowCameraFar * ( viewSpaceZ - shadowCameraNear ) ) / ( viewSpaceZ * ( shadowCameraFar - shadowCameraNear ) );
+			dp += shadowBias;
+			vec3 bd3D = normalize( lightToPosition );
+			float depth = textureCube( shadowMap, bd3D ).r;
+			#ifdef USE_REVERSED_DEPTH_BUFFER
+				depth = 1.0 - depth;
+			#endif
+			shadow = step( dp, depth );
+		}
+		return mix( 1.0, shadow, shadowIntensity );
+	}
+	#endif
+	#endif
+#endif`,Lm=`#if NUM_SPOT_LIGHT_COORDS > 0
+	uniform mat4 spotLightMatrix[ NUM_SPOT_LIGHT_COORDS ];
+	varying vec4 vSpotLightCoord[ NUM_SPOT_LIGHT_COORDS ];
+#endif
+#ifdef USE_SHADOWMAP
+	#if NUM_SUN_LIGHT_SHADOWS > 0
+		varying vec4 vSunShadowWorldPosition;
+		varying vec3 vSunShadowWorldNormal;
+	#endif
+	#if NUM_DIR_LIGHT_SHADOWS > 0
+		uniform mat4 directionalShadowMatrix[ NUM_DIR_LIGHT_SHADOWS ];
+		varying vec4 vDirectionalShadowCoord[ NUM_DIR_LIGHT_SHADOWS ];
+		struct DirectionalLightShadow {
+			float shadowIntensity;
+			float shadowBias;
+			float shadowNormalBias;
+			float shadowRadius;
+			vec2 shadowMapSize;
+		};
+		uniform DirectionalLightShadow directionalLightShadows[ NUM_DIR_LIGHT_SHADOWS ];
+	#endif
+	#if NUM_SPOT_LIGHT_SHADOWS > 0
+		struct SpotLightShadow {
+			float shadowIntensity;
+			float shadowBias;
+			float shadowNormalBias;
+			float shadowRadius;
+			vec2 shadowMapSize;
+		};
+		uniform SpotLightShadow spotLightShadows[ NUM_SPOT_LIGHT_SHADOWS ];
+	#endif
+	#if NUM_POINT_LIGHT_SHADOWS > 0
+		uniform mat4 pointShadowMatrix[ NUM_POINT_LIGHT_SHADOWS ];
+		varying vec4 vPointShadowCoord[ NUM_POINT_LIGHT_SHADOWS ];
+		struct PointLightShadow {
+			float shadowIntensity;
+			float shadowBias;
+			float shadowNormalBias;
+			float shadowRadius;
+			vec2 shadowMapSize;
+			float shadowCameraNear;
+			float shadowCameraFar;
+		};
+		uniform PointLightShadow pointLightShadows[ NUM_POINT_LIGHT_SHADOWS ];
+	#endif
+#endif`,Dm=`#if ( defined( USE_SHADOWMAP ) && ( NUM_DIR_LIGHT_SHADOWS > 0 || NUM_SUN_LIGHT_SHADOWS > 0 || NUM_POINT_LIGHT_SHADOWS > 0 ) ) || ( NUM_SPOT_LIGHT_COORDS > 0 )
+	#ifdef HAS_NORMAL
+		vec3 shadowWorldNormal = transformNormalByInverseViewMatrix( transformedNormal, viewMatrix );
+	#else
+		vec3 shadowWorldNormal = vec3( 0.0 );
+	#endif
+	vec4 shadowWorldPosition;
+#endif
+#if defined( USE_SHADOWMAP )
+	#if NUM_SUN_LIGHT_SHADOWS > 0
+		vSunShadowWorldPosition = vec4( worldPosition.xyz, - mvPosition.z );
+		vSunShadowWorldNormal = shadowWorldNormal;
+	#endif
+	#if NUM_DIR_LIGHT_SHADOWS > 0
+		#pragma unroll_loop_start
+		for ( int i = 0; i < NUM_DIR_LIGHT_SHADOWS; i ++ ) {
+			shadowWorldPosition = worldPosition + vec4( shadowWorldNormal * directionalLightShadows[ i ].shadowNormalBias, 0 );
+			vDirectionalShadowCoord[ i ] = directionalShadowMatrix[ i ] * shadowWorldPosition;
+		}
+		#pragma unroll_loop_end
+	#endif
+	#if NUM_POINT_LIGHT_SHADOWS > 0
+		#pragma unroll_loop_start
+		for ( int i = 0; i < NUM_POINT_LIGHT_SHADOWS; i ++ ) {
+			shadowWorldPosition = worldPosition + vec4( shadowWorldNormal * pointLightShadows[ i ].shadowNormalBias, 0 );
+			vPointShadowCoord[ i ] = pointShadowMatrix[ i ] * shadowWorldPosition;
+		}
+		#pragma unroll_loop_end
+	#endif
+#endif
+#if NUM_SPOT_LIGHT_COORDS > 0
+	#pragma unroll_loop_start
+	for ( int i = 0; i < NUM_SPOT_LIGHT_COORDS; i ++ ) {
+		shadowWorldPosition = worldPosition;
+		#if ( defined( USE_SHADOWMAP ) && UNROLLED_LOOP_INDEX < NUM_SPOT_LIGHT_SHADOWS )
+			shadowWorldPosition.xyz += shadowWorldNormal * spotLightShadows[ i ].shadowNormalBias;
+		#endif
+		vSpotLightCoord[ i ] = spotLightMatrix[ i ] * shadowWorldPosition;
+	}
+	#pragma unroll_loop_end
+#endif`,Nm=`float getShadowMask() {
+	float shadow = 1.0;
+	#ifdef USE_SHADOWMAP
+	#if NUM_SUN_LIGHT_SHADOWS > 0
+	SunLightShadow sunLight;
+	#pragma unroll_loop_start
+	for ( int i = 0; i < NUM_SUN_LIGHT_SHADOWS; i ++ ) {
+		sunLight = sunLightShadows[ i ];
+		shadow *= receiveShadow ? getSunShadow( sunShadowMap[ i ], sunLight, UNROLLED_LOOP_INDEX ) : 1.0;
+	}
+	#pragma unroll_loop_end
+	#endif
+	#if NUM_DIR_LIGHT_SHADOWS > 0
+	DirectionalLightShadow directionalLight;
+	#pragma unroll_loop_start
+	for ( int i = 0; i < NUM_DIR_LIGHT_SHADOWS; i ++ ) {
+		directionalLight = directionalLightShadows[ i ];
+		shadow *= receiveShadow ? getShadow( directionalShadowMap[ i ], directionalLight.shadowMapSize, directionalLight.shadowIntensity, directionalLight.shadowBias, directionalLight.shadowRadius, vDirectionalShadowCoord[ i ] ) : 1.0;
+	}
+	#pragma unroll_loop_end
+	#endif
+	#if NUM_SPOT_LIGHT_SHADOWS > 0
+	SpotLightShadow spotLight;
+	#pragma unroll_loop_start
+	for ( int i = 0; i < NUM_SPOT_LIGHT_SHADOWS; i ++ ) {
+		spotLight = spotLightShadows[ i ];
+		shadow *= receiveShadow ? getShadow( spotShadowMap[ i ], spotLight.shadowMapSize, spotLight.shadowIntensity, spotLight.shadowBias, spotLight.shadowRadius, vSpotLightCoord[ i ] ) : 1.0;
+	}
+	#pragma unroll_loop_end
+	#endif
+	#if NUM_POINT_LIGHT_SHADOWS > 0 && ( defined( SHADOWMAP_TYPE_PCF ) || defined( SHADOWMAP_TYPE_BASIC ) )
+	PointLightShadow pointLight;
+	#pragma unroll_loop_start
+	for ( int i = 0; i < NUM_POINT_LIGHT_SHADOWS; i ++ ) {
+		pointLight = pointLightShadows[ i ];
+		shadow *= receiveShadow ? getPointShadow( pointShadowMap[ i ], pointLight.shadowMapSize, pointLight.shadowIntensity, pointLight.shadowBias, pointLight.shadowRadius, vPointShadowCoord[ i ], pointLight.shadowCameraNear, pointLight.shadowCameraFar ) : 1.0;
+	}
+	#pragma unroll_loop_end
+	#endif
+	#endif
+	return shadow;
+}`,Um=`#ifdef USE_SKINNING
+	mat4 boneMatX = getBoneMatrix( skinIndex.x );
+	mat4 boneMatY = getBoneMatrix( skinIndex.y );
+	mat4 boneMatZ = getBoneMatrix( skinIndex.z );
+	mat4 boneMatW = getBoneMatrix( skinIndex.w );
+#endif`,Fm=`#ifdef USE_SKINNING
+	uniform mat4 bindMatrix;
+	uniform mat4 bindMatrixInverse;
+	uniform highp sampler2D boneTexture;
+	mat4 getBoneMatrix( const in float i ) {
+		int size = textureSize( boneTexture, 0 ).x;
+		int j = int( i ) * 4;
+		int x = j % size;
+		int y = j / size;
+		vec4 v1 = texelFetch( boneTexture, ivec2( x, y ), 0 );
+		vec4 v2 = texelFetch( boneTexture, ivec2( x + 1, y ), 0 );
+		vec4 v3 = texelFetch( boneTexture, ivec2( x + 2, y ), 0 );
+		vec4 v4 = texelFetch( boneTexture, ivec2( x + 3, y ), 0 );
+		return mat4( v1, v2, v3, v4 );
+	}
+#endif`,Om=`#ifdef USE_SKINNING
+	vec4 skinVertex = bindMatrix * vec4( transformed, 1.0 );
+	vec4 skinned = vec4( 0.0 );
+	skinned += boneMatX * skinVertex * skinWeight.x;
+	skinned += boneMatY * skinVertex * skinWeight.y;
+	skinned += boneMatZ * skinVertex * skinWeight.z;
+	skinned += boneMatW * skinVertex * skinWeight.w;
+	transformed = ( bindMatrixInverse * skinned ).xyz;
+#endif`,Bm=`#ifdef USE_SKINNING
+	mat4 skinMatrix = mat4( 0.0 );
+	skinMatrix += skinWeight.x * boneMatX;
+	skinMatrix += skinWeight.y * boneMatY;
+	skinMatrix += skinWeight.z * boneMatZ;
+	skinMatrix += skinWeight.w * boneMatW;
+	skinMatrix = bindMatrixInverse * skinMatrix * bindMatrix;
+	objectNormal = vec4( skinMatrix * vec4( objectNormal, 0.0 ) ).xyz;
+	#ifdef USE_TANGENT
+		objectTangent = vec4( skinMatrix * vec4( objectTangent, 0.0 ) ).xyz;
+	#endif
+#endif`,zm=`float specularStrength;
+#ifdef USE_SPECULARMAP
+	vec4 texelSpecular = texture2D( specularMap, vSpecularMapUv );
+	specularStrength = texelSpecular.r;
+#else
+	specularStrength = 1.0;
+#endif`,km=`#ifdef USE_SPECULARMAP
+	uniform sampler2D specularMap;
+#endif`,Vm=`#if defined( TONE_MAPPING )
+	gl_FragColor.rgb = toneMapping( gl_FragColor.rgb );
+#endif`,Gm=`#ifndef saturate
+#define saturate( a ) clamp( a, 0.0, 1.0 )
+#endif
+uniform float toneMappingExposure;
+vec3 LinearToneMapping( vec3 color ) {
+	return saturate( toneMappingExposure * color );
+}
+vec3 ReinhardToneMapping( vec3 color ) {
+	color *= toneMappingExposure;
+	return saturate( color / ( vec3( 1.0 ) + color ) );
+}
+vec3 CineonToneMapping( vec3 color ) {
+	color *= toneMappingExposure;
+	color = max( vec3( 0.0 ), color - 0.004 );
+	return pow( ( color * ( 6.2 * color + 0.5 ) ) / ( color * ( 6.2 * color + 1.7 ) + 0.06 ), vec3( 2.2 ) );
+}
+vec3 RRTAndODTFit( vec3 v ) {
+	vec3 a = v * ( v + 0.0245786 ) - 0.000090537;
+	vec3 b = v * ( 0.983729 * v + 0.4329510 ) + 0.238081;
+	return a / b;
+}
+vec3 ACESFilmicToneMapping( vec3 color ) {
+	const mat3 ACESInputMat = mat3(
+		vec3( 0.59719, 0.07600, 0.02840 ),		vec3( 0.35458, 0.90834, 0.13383 ),
+		vec3( 0.04823, 0.01566, 0.83777 )
+	);
+	const mat3 ACESOutputMat = mat3(
+		vec3(  1.60475, -0.10208, -0.00327 ),		vec3( -0.53108,  1.10813, -0.07276 ),
+		vec3( -0.07367, -0.00605,  1.07602 )
+	);
+	color *= toneMappingExposure / 0.6;
+	color = ACESInputMat * color;
+	color = RRTAndODTFit( color );
+	color = ACESOutputMat * color;
+	return saturate( color );
+}
+const mat3 LINEAR_REC2020_TO_LINEAR_SRGB = mat3(
+	vec3( 1.6605, - 0.1246, - 0.0182 ),
+	vec3( - 0.5876, 1.1329, - 0.1006 ),
+	vec3( - 0.0728, - 0.0083, 1.1187 )
+);
+const mat3 LINEAR_SRGB_TO_LINEAR_REC2020 = mat3(
+	vec3( 0.6274, 0.0691, 0.0164 ),
+	vec3( 0.3293, 0.9195, 0.0880 ),
+	vec3( 0.0433, 0.0113, 0.8956 )
+);
+vec3 agxDefaultContrastApprox( vec3 x ) {
+	vec3 x2 = x * x;
+	vec3 x4 = x2 * x2;
+	return + 15.5 * x4 * x2
+		- 40.14 * x4 * x
+		+ 31.96 * x4
+		- 6.868 * x2 * x
+		+ 0.4298 * x2
+		+ 0.1191 * x
+		- 0.00232;
+}
+vec3 AgXToneMapping( vec3 color ) {
+	const mat3 AgXInsetMatrix = mat3(
+		vec3( 0.856627153315983, 0.137318972929847, 0.11189821299995 ),
+		vec3( 0.0951212405381588, 0.761241990602591, 0.0767994186031903 ),
+		vec3( 0.0482516061458583, 0.101439036467562, 0.811302368396859 )
+	);
+	const mat3 AgXOutsetMatrix = mat3(
+		vec3( 1.1271005818144368, - 0.1413297634984383, - 0.14132976349843826 ),
+		vec3( - 0.11060664309660323, 1.157823702216272, - 0.11060664309660294 ),
+		vec3( - 0.016493938717834573, - 0.016493938717834257, 1.2519364065950405 )
+	);
+	const float AgxMinEv = - 12.47393;	const float AgxMaxEv = 4.026069;
+	color *= toneMappingExposure;
+	color = LINEAR_SRGB_TO_LINEAR_REC2020 * color;
+	color = AgXInsetMatrix * color;
+	color = max( color, 1e-10 );	color = log2( color );
+	color = ( color - AgxMinEv ) / ( AgxMaxEv - AgxMinEv );
+	color = clamp( color, 0.0, 1.0 );
+	color = agxDefaultContrastApprox( color );
+	color = AgXOutsetMatrix * color;
+	color = pow( max( vec3( 0.0 ), color ), vec3( 2.2 ) );
+	color = LINEAR_REC2020_TO_LINEAR_SRGB * color;
+	color = clamp( color, 0.0, 1.0 );
+	return color;
+}
+vec3 NeutralToneMapping( vec3 color ) {
+	const float StartCompression = 0.8 - 0.04;
+	const float Desaturation = 0.15;
+	color *= toneMappingExposure;
+	float x = min( color.r, min( color.g, color.b ) );
+	float offset = x < 0.08 ? x - 6.25 * x * x : 0.04;
+	color -= offset;
+	float peak = max( color.r, max( color.g, color.b ) );
+	if ( peak < StartCompression ) return color;
+	float d = 1. - StartCompression;
+	float newPeak = 1. - d * d / ( peak + d - StartCompression );
+	color *= newPeak / peak;
+	float g = 1. - 1. / ( Desaturation * ( peak - newPeak ) + 1. );
+	return mix( color, vec3( newPeak ), g );
+}
+vec3 CustomToneMapping( vec3 color ) { return color; }`,Hm=`#ifdef USE_TRANSMISSION
+	material.transmission = transmission;
+	material.transmissionAlpha = 1.0;
+	material.thickness = thickness;
+	material.attenuationDistance = attenuationDistance;
+	material.attenuationColor = attenuationColor;
+	#ifdef USE_TRANSMISSIONMAP
+		material.transmission *= texture2D( transmissionMap, vTransmissionMapUv ).r;
+	#endif
+	#ifdef USE_THICKNESSMAP
+		material.thickness *= texture2D( thicknessMap, vThicknessMapUv ).g;
+	#endif
+	vec3 pos = vWorldPosition;
+	vec3 v = normalize( cameraPosition - pos );
+	vec3 n = transformNormalByInverseViewMatrix( normal, viewMatrix );
+	vec4 transmitted = getIBLVolumeRefraction(
+		n, v, material.roughness, material.diffuseContribution, material.specularColorBlended, material.specularF90,
+		pos, modelMatrix, viewMatrix, projectionMatrix, material.dispersion, material.ior, material.thickness,
+		material.attenuationColor, material.attenuationDistance );
+	material.transmissionAlpha = mix( material.transmissionAlpha, transmitted.a, material.transmission );
+	totalDiffuse = mix( totalDiffuse, transmitted.rgb, material.transmission );
+#endif`,Wm=`#ifdef USE_TRANSMISSION
+	uniform float transmission;
+	uniform float thickness;
+	uniform float attenuationDistance;
+	uniform vec3 attenuationColor;
+	#ifdef USE_TRANSMISSIONMAP
+		uniform sampler2D transmissionMap;
+	#endif
+	#ifdef USE_THICKNESSMAP
+		uniform sampler2D thicknessMap;
+	#endif
+	uniform vec2 transmissionSamplerSize;
+	uniform sampler2D transmissionSamplerMap;
+	uniform mat4 modelMatrix;
+	uniform mat4 projectionMatrix;
+	varying vec3 vWorldPosition;
+	float w0( float a ) {
+		return ( 1.0 / 6.0 ) * ( a * ( a * ( - a + 3.0 ) - 3.0 ) + 1.0 );
+	}
+	float w1( float a ) {
+		return ( 1.0 / 6.0 ) * ( a *  a * ( 3.0 * a - 6.0 ) + 4.0 );
+	}
+	float w2( float a ){
+		return ( 1.0 / 6.0 ) * ( a * ( a * ( - 3.0 * a + 3.0 ) + 3.0 ) + 1.0 );
+	}
+	float w3( float a ) {
+		return ( 1.0 / 6.0 ) * ( a * a * a );
+	}
+	float g0( float a ) {
+		return w0( a ) + w1( a );
+	}
+	float g1( float a ) {
+		return w2( a ) + w3( a );
+	}
+	float h0( float a ) {
+		return - 1.0 + w1( a ) / ( w0( a ) + w1( a ) );
+	}
+	float h1( float a ) {
+		return 1.0 + w3( a ) / ( w2( a ) + w3( a ) );
+	}
+	vec4 bicubic( sampler2D tex, vec2 uv, vec4 texelSize, float lod ) {
+		uv = uv * texelSize.zw + 0.5;
+		vec2 iuv = floor( uv );
+		vec2 fuv = fract( uv );
+		float g0x = g0( fuv.x );
+		float g1x = g1( fuv.x );
+		float h0x = h0( fuv.x );
+		float h1x = h1( fuv.x );
+		float h0y = h0( fuv.y );
+		float h1y = h1( fuv.y );
+		vec2 p0 = ( vec2( iuv.x + h0x, iuv.y + h0y ) - 0.5 ) * texelSize.xy;
+		vec2 p1 = ( vec2( iuv.x + h1x, iuv.y + h0y ) - 0.5 ) * texelSize.xy;
+		vec2 p2 = ( vec2( iuv.x + h0x, iuv.y + h1y ) - 0.5 ) * texelSize.xy;
+		vec2 p3 = ( vec2( iuv.x + h1x, iuv.y + h1y ) - 0.5 ) * texelSize.xy;
+		return g0( fuv.y ) * ( g0x * textureLod( tex, p0, lod ) + g1x * textureLod( tex, p1, lod ) ) +
+			g1( fuv.y ) * ( g0x * textureLod( tex, p2, lod ) + g1x * textureLod( tex, p3, lod ) );
+	}
+	vec4 textureBicubic( sampler2D sampler, vec2 uv, float lod ) {
+		vec2 fLodSize = vec2( textureSize( sampler, int( lod ) ) );
+		vec2 cLodSize = vec2( textureSize( sampler, int( lod + 1.0 ) ) );
+		vec2 fLodSizeInv = 1.0 / fLodSize;
+		vec2 cLodSizeInv = 1.0 / cLodSize;
+		vec4 fSample = bicubic( sampler, uv, vec4( fLodSizeInv, fLodSize ), floor( lod ) );
+		vec4 cSample = bicubic( sampler, uv, vec4( cLodSizeInv, cLodSize ), ceil( lod ) );
+		return mix( fSample, cSample, fract( lod ) );
+	}
+	vec3 getVolumeTransmissionRay( const in vec3 n, const in vec3 v, const in float thickness, const in float ior, const in mat4 modelMatrix ) {
+		vec3 refractionVector = refract( - v, normalize( n ), 1.0 / ior );
+		vec3 modelScale;
+		modelScale.x = length( vec3( modelMatrix[ 0 ].xyz ) );
+		modelScale.y = length( vec3( modelMatrix[ 1 ].xyz ) );
+		modelScale.z = length( vec3( modelMatrix[ 2 ].xyz ) );
+		return normalize( refractionVector ) * thickness * modelScale;
+	}
+	float applyIorToRoughness( const in float roughness, const in float ior ) {
+		return roughness * clamp( ior * 2.0 - 2.0, 0.0, 1.0 );
+	}
+	vec4 getTransmissionSample( const in vec2 fragCoord, const in float roughness, const in float ior ) {
+		float lod = log2( transmissionSamplerSize.x ) * applyIorToRoughness( roughness, ior );
+		return textureBicubic( transmissionSamplerMap, fragCoord.xy, lod );
+	}
+	vec3 volumeAttenuation( const in float transmissionDistance, const in vec3 attenuationColor, const in float attenuationDistance ) {
+		if ( isinf( attenuationDistance ) ) {
+			return vec3( 1.0 );
+		} else {
+			vec3 attenuationCoefficient = -log( attenuationColor ) / attenuationDistance;
+			vec3 transmittance = exp( - attenuationCoefficient * transmissionDistance );			return transmittance;
+		}
+	}
+	vec4 getIBLVolumeRefraction( const in vec3 n, const in vec3 v, const in float roughness, const in vec3 diffuseColor,
+		const in vec3 specularColor, const in float specularF90, const in vec3 position, const in mat4 modelMatrix,
+		const in mat4 viewMatrix, const in mat4 projMatrix, const in float dispersion, const in float ior, const in float thickness,
+		const in vec3 attenuationColor, const in float attenuationDistance ) {
+		vec4 transmittedLight;
+		vec3 transmittance;
+		#ifdef USE_DISPERSION
+			float halfSpread = ( ior - 1.0 ) * 0.025 * dispersion;
+			vec3 iors = vec3( ior - halfSpread, ior, ior + halfSpread );
+			for ( int i = 0; i < 3; i ++ ) {
+				vec3 transmissionRay = getVolumeTransmissionRay( n, v, thickness, iors[ i ], modelMatrix );
+				vec3 refractedRayExit = position + transmissionRay;
+				vec4 ndcPos = projMatrix * viewMatrix * vec4( refractedRayExit, 1.0 );
+				vec2 refractionCoords = ndcPos.xy / ndcPos.w;
+				refractionCoords += 1.0;
+				refractionCoords /= 2.0;
+				vec4 transmissionSample = getTransmissionSample( refractionCoords, roughness, iors[ i ] );
+				transmittedLight[ i ] = transmissionSample[ i ];
+				transmittedLight.a += transmissionSample.a;
+				transmittance[ i ] = diffuseColor[ i ] * volumeAttenuation( length( transmissionRay ), attenuationColor, attenuationDistance )[ i ];
+			}
+			transmittedLight.a /= 3.0;
+		#else
+			vec3 transmissionRay = getVolumeTransmissionRay( n, v, thickness, ior, modelMatrix );
+			vec3 refractedRayExit = position + transmissionRay;
+			vec4 ndcPos = projMatrix * viewMatrix * vec4( refractedRayExit, 1.0 );
+			vec2 refractionCoords = ndcPos.xy / ndcPos.w;
+			refractionCoords += 1.0;
+			refractionCoords /= 2.0;
+			transmittedLight = getTransmissionSample( refractionCoords, roughness, ior );
+			transmittance = diffuseColor * volumeAttenuation( length( transmissionRay ), attenuationColor, attenuationDistance );
+		#endif
+		vec3 attenuatedColor = transmittance * transmittedLight.rgb;
+		vec3 F = EnvironmentBRDF( n, v, specularColor, specularF90, roughness );
+		float transmittanceFactor = ( transmittance.r + transmittance.g + transmittance.b ) / 3.0;
+		return vec4( ( 1.0 - F ) * attenuatedColor, 1.0 - ( 1.0 - transmittedLight.a ) * transmittanceFactor );
+	}
+#endif`,Xm=`#if defined( USE_UV ) || defined( USE_ANISOTROPY )
+	varying vec2 vUv;
+#endif
+#ifdef USE_MAP
+	varying vec2 vMapUv;
+#endif
+#ifdef USE_ALPHAMAP
+	varying vec2 vAlphaMapUv;
+#endif
+#ifdef USE_LIGHTMAP
+	varying vec2 vLightMapUv;
+#endif
+#ifdef USE_AOMAP
+	varying vec2 vAoMapUv;
+#endif
+#ifdef USE_BUMPMAP
+	varying vec2 vBumpMapUv;
+#endif
+#ifdef USE_NORMALMAP
+	varying vec2 vNormalMapUv;
+#endif
+#ifdef USE_EMISSIVEMAP
+	varying vec2 vEmissiveMapUv;
+#endif
+#ifdef USE_METALNESSMAP
+	varying vec2 vMetalnessMapUv;
+#endif
+#ifdef USE_ROUGHNESSMAP
+	varying vec2 vRoughnessMapUv;
+#endif
+#ifdef USE_ANISOTROPYMAP
+	varying vec2 vAnisotropyMapUv;
+#endif
+#ifdef USE_CLEARCOATMAP
+	varying vec2 vClearcoatMapUv;
+#endif
+#ifdef USE_CLEARCOAT_NORMALMAP
+	varying vec2 vClearcoatNormalMapUv;
+#endif
+#ifdef USE_CLEARCOAT_ROUGHNESSMAP
+	varying vec2 vClearcoatRoughnessMapUv;
+#endif
+#ifdef USE_IRIDESCENCEMAP
+	varying vec2 vIridescenceMapUv;
+#endif
+#ifdef USE_IRIDESCENCE_THICKNESSMAP
+	varying vec2 vIridescenceThicknessMapUv;
+#endif
+#ifdef USE_SHEEN_COLORMAP
+	varying vec2 vSheenColorMapUv;
+#endif
+#ifdef USE_SHEEN_ROUGHNESSMAP
+	varying vec2 vSheenRoughnessMapUv;
+#endif
+#ifdef USE_SPECULARMAP
+	varying vec2 vSpecularMapUv;
+#endif
+#ifdef USE_SPECULAR_COLORMAP
+	varying vec2 vSpecularColorMapUv;
+#endif
+#ifdef USE_SPECULAR_INTENSITYMAP
+	varying vec2 vSpecularIntensityMapUv;
+#endif
+#ifdef USE_TRANSMISSIONMAP
+	uniform mat3 transmissionMapTransform;
+	varying vec2 vTransmissionMapUv;
+#endif
+#ifdef USE_THICKNESSMAP
+	uniform mat3 thicknessMapTransform;
+	varying vec2 vThicknessMapUv;
+#endif`,qm=`#if defined( USE_UV ) || defined( USE_ANISOTROPY )
+	varying vec2 vUv;
+#endif
+#ifdef USE_MAP
+	uniform mat3 mapTransform;
+	varying vec2 vMapUv;
+#endif
+#ifdef USE_ALPHAMAP
+	uniform mat3 alphaMapTransform;
+	varying vec2 vAlphaMapUv;
+#endif
+#ifdef USE_LIGHTMAP
+	uniform mat3 lightMapTransform;
+	varying vec2 vLightMapUv;
+#endif
+#ifdef USE_AOMAP
+	uniform mat3 aoMapTransform;
+	varying vec2 vAoMapUv;
+#endif
+#ifdef USE_BUMPMAP
+	uniform mat3 bumpMapTransform;
+	varying vec2 vBumpMapUv;
+#endif
+#ifdef USE_NORMALMAP
+	uniform mat3 normalMapTransform;
+	varying vec2 vNormalMapUv;
+#endif
+#ifdef USE_DISPLACEMENTMAP
+	uniform mat3 displacementMapTransform;
+	varying vec2 vDisplacementMapUv;
+#endif
+#ifdef USE_EMISSIVEMAP
+	uniform mat3 emissiveMapTransform;
+	varying vec2 vEmissiveMapUv;
+#endif
+#ifdef USE_METALNESSMAP
+	uniform mat3 metalnessMapTransform;
+	varying vec2 vMetalnessMapUv;
+#endif
+#ifdef USE_ROUGHNESSMAP
+	uniform mat3 roughnessMapTransform;
+	varying vec2 vRoughnessMapUv;
+#endif
+#ifdef USE_ANISOTROPYMAP
+	uniform mat3 anisotropyMapTransform;
+	varying vec2 vAnisotropyMapUv;
+#endif
+#ifdef USE_CLEARCOATMAP
+	uniform mat3 clearcoatMapTransform;
+	varying vec2 vClearcoatMapUv;
+#endif
+#ifdef USE_CLEARCOAT_NORMALMAP
+	uniform mat3 clearcoatNormalMapTransform;
+	varying vec2 vClearcoatNormalMapUv;
+#endif
+#ifdef USE_CLEARCOAT_ROUGHNESSMAP
+	uniform mat3 clearcoatRoughnessMapTransform;
+	varying vec2 vClearcoatRoughnessMapUv;
+#endif
+#ifdef USE_SHEEN_COLORMAP
+	uniform mat3 sheenColorMapTransform;
+	varying vec2 vSheenColorMapUv;
+#endif
+#ifdef USE_SHEEN_ROUGHNESSMAP
+	uniform mat3 sheenRoughnessMapTransform;
+	varying vec2 vSheenRoughnessMapUv;
+#endif
+#ifdef USE_IRIDESCENCEMAP
+	uniform mat3 iridescenceMapTransform;
+	varying vec2 vIridescenceMapUv;
+#endif
+#ifdef USE_IRIDESCENCE_THICKNESSMAP
+	uniform mat3 iridescenceThicknessMapTransform;
+	varying vec2 vIridescenceThicknessMapUv;
+#endif
+#ifdef USE_SPECULARMAP
+	uniform mat3 specularMapTransform;
+	varying vec2 vSpecularMapUv;
+#endif
+#ifdef USE_SPECULAR_COLORMAP
+	uniform mat3 specularColorMapTransform;
+	varying vec2 vSpecularColorMapUv;
+#endif
+#ifdef USE_SPECULAR_INTENSITYMAP
+	uniform mat3 specularIntensityMapTransform;
+	varying vec2 vSpecularIntensityMapUv;
+#endif
+#ifdef USE_TRANSMISSIONMAP
+	uniform mat3 transmissionMapTransform;
+	varying vec2 vTransmissionMapUv;
+#endif
+#ifdef USE_THICKNESSMAP
+	uniform mat3 thicknessMapTransform;
+	varying vec2 vThicknessMapUv;
+#endif`,Ym=`#if defined( USE_UV ) || defined( USE_ANISOTROPY )
+	vUv = vec3( uv, 1 ).xy;
+#endif
+#ifdef USE_MAP
+	vMapUv = ( mapTransform * vec3( MAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_ALPHAMAP
+	vAlphaMapUv = ( alphaMapTransform * vec3( ALPHAMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_LIGHTMAP
+	vLightMapUv = ( lightMapTransform * vec3( LIGHTMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_AOMAP
+	vAoMapUv = ( aoMapTransform * vec3( AOMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_BUMPMAP
+	vBumpMapUv = ( bumpMapTransform * vec3( BUMPMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_NORMALMAP
+	vNormalMapUv = ( normalMapTransform * vec3( NORMALMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_DISPLACEMENTMAP
+	vDisplacementMapUv = ( displacementMapTransform * vec3( DISPLACEMENTMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_EMISSIVEMAP
+	vEmissiveMapUv = ( emissiveMapTransform * vec3( EMISSIVEMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_METALNESSMAP
+	vMetalnessMapUv = ( metalnessMapTransform * vec3( METALNESSMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_ROUGHNESSMAP
+	vRoughnessMapUv = ( roughnessMapTransform * vec3( ROUGHNESSMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_ANISOTROPYMAP
+	vAnisotropyMapUv = ( anisotropyMapTransform * vec3( ANISOTROPYMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_CLEARCOATMAP
+	vClearcoatMapUv = ( clearcoatMapTransform * vec3( CLEARCOATMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_CLEARCOAT_NORMALMAP
+	vClearcoatNormalMapUv = ( clearcoatNormalMapTransform * vec3( CLEARCOAT_NORMALMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_CLEARCOAT_ROUGHNESSMAP
+	vClearcoatRoughnessMapUv = ( clearcoatRoughnessMapTransform * vec3( CLEARCOAT_ROUGHNESSMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_IRIDESCENCEMAP
+	vIridescenceMapUv = ( iridescenceMapTransform * vec3( IRIDESCENCEMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_IRIDESCENCE_THICKNESSMAP
+	vIridescenceThicknessMapUv = ( iridescenceThicknessMapTransform * vec3( IRIDESCENCE_THICKNESSMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_SHEEN_COLORMAP
+	vSheenColorMapUv = ( sheenColorMapTransform * vec3( SHEEN_COLORMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_SHEEN_ROUGHNESSMAP
+	vSheenRoughnessMapUv = ( sheenRoughnessMapTransform * vec3( SHEEN_ROUGHNESSMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_SPECULARMAP
+	vSpecularMapUv = ( specularMapTransform * vec3( SPECULARMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_SPECULAR_COLORMAP
+	vSpecularColorMapUv = ( specularColorMapTransform * vec3( SPECULAR_COLORMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_SPECULAR_INTENSITYMAP
+	vSpecularIntensityMapUv = ( specularIntensityMapTransform * vec3( SPECULAR_INTENSITYMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_TRANSMISSIONMAP
+	vTransmissionMapUv = ( transmissionMapTransform * vec3( TRANSMISSIONMAP_UV, 1 ) ).xy;
+#endif
+#ifdef USE_THICKNESSMAP
+	vThicknessMapUv = ( thicknessMapTransform * vec3( THICKNESSMAP_UV, 1 ) ).xy;
+#endif`,Zm=`#if defined( USE_ENVMAP ) || defined( DISTANCE ) || defined ( USE_SHADOWMAP ) || defined ( USE_TRANSMISSION ) || NUM_SPOT_LIGHT_COORDS > 0
+	vec4 worldPosition = vec4( transformed, 1.0 );
+	#ifdef USE_BATCHING
+		worldPosition = batchingMatrix * worldPosition;
+	#endif
+	#ifdef USE_INSTANCING
+		worldPosition = instanceMatrix * worldPosition;
+	#endif
+	worldPosition = modelMatrix * worldPosition;
+#endif`,$m=`varying vec2 vUv;
+uniform mat3 uvTransform;
+void main() {
+	vUv = ( uvTransform * vec3( uv, 1 ) ).xy;
+	gl_Position = vec4( position.xy, 1.0, 1.0 );
+}`,Jm=`uniform sampler2D t2D;
+uniform float backgroundIntensity;
+varying vec2 vUv;
+void main() {
+	vec4 texColor = texture2D( t2D, vUv );
+	#ifdef DECODE_VIDEO_TEXTURE
+		texColor = vec4( mix( pow( texColor.rgb * 0.9478672986 + vec3( 0.0521327014 ), vec3( 2.4 ) ), texColor.rgb * 0.0773993808, vec3( lessThanEqual( texColor.rgb, vec3( 0.04045 ) ) ) ), texColor.w );
+	#endif
+	texColor.rgb *= backgroundIntensity;
+	gl_FragColor = texColor;
+	#include <tonemapping_fragment>
+	#include <colorspace_fragment>
+}`,Km=`varying vec3 vWorldDirection;
+#include <common>
+void main() {
+	vWorldDirection = transformDirection( position, modelMatrix );
+	#include <begin_vertex>
+	#include <project_vertex>
+	gl_Position.z = gl_Position.w;
+}`,jm=`#ifdef ENVMAP_TYPE_CUBE
+	uniform samplerCube envMap;
+#elif defined( ENVMAP_TYPE_CUBE_UV )
+	uniform sampler2D envMap;
+#endif
+uniform float backgroundBlurriness;
+uniform float backgroundIntensity;
+uniform mat3 backgroundRotation;
+varying vec3 vWorldDirection;
+#include <cube_uv_reflection_fragment>
+void main() {
+	#ifdef ENVMAP_TYPE_CUBE
+		vec4 texColor = textureCube( envMap, backgroundRotation * vWorldDirection );
+	#elif defined( ENVMAP_TYPE_CUBE_UV )
+		vec4 texColor = textureCubeUV( envMap, backgroundRotation * vWorldDirection, backgroundBlurriness );
+	#else
+		vec4 texColor = vec4( 0.0, 0.0, 0.0, 1.0 );
+	#endif
+	texColor.rgb *= backgroundIntensity;
+	gl_FragColor = texColor;
+	#include <tonemapping_fragment>
+	#include <colorspace_fragment>
+}`,Qm=`varying vec3 vWorldDirection;
+#include <common>
+void main() {
+	vWorldDirection = transformDirection( position, modelMatrix );
+	#include <begin_vertex>
+	#include <project_vertex>
+	gl_Position.z = gl_Position.w;
+}`,tg=`uniform samplerCube tCube;
+uniform float tFlip;
+uniform float opacity;
+varying vec3 vWorldDirection;
+void main() {
+	vec4 texColor = textureCube( tCube, vec3( tFlip * vWorldDirection.x, vWorldDirection.yz ) );
+	gl_FragColor = texColor;
+	gl_FragColor.a *= opacity;
+	#include <tonemapping_fragment>
+	#include <colorspace_fragment>
+}`,eg=`#include <common>
+#include <batching_pars_vertex>
+#include <uv_pars_vertex>
+#include <displacementmap_pars_vertex>
+#include <morphtarget_pars_vertex>
+#include <skinning_pars_vertex>
+#include <logdepthbuf_pars_vertex>
+#include <clipping_planes_pars_vertex>
+varying vec2 vHighPrecisionZW;
+void main() {
+	#include <uv_vertex>
+	#include <batching_vertex>
+	#include <skinbase_vertex>
+	#include <morphinstance_vertex>
+	#ifdef USE_DISPLACEMENTMAP
+		#include <beginnormal_vertex>
+		#include <morphnormal_vertex>
+		#include <skinnormal_vertex>
+	#endif
+	#include <begin_vertex>
+	#include <morphtarget_vertex>
+	#include <skinning_vertex>
+	#include <displacementmap_vertex>
+	#include <project_vertex>
+	#include <logdepthbuf_vertex>
+	#include <clipping_planes_vertex>
+	vHighPrecisionZW = gl_Position.zw;
+}`,ng=`#if DEPTH_PACKING == 3200
+	uniform float opacity;
+#endif
+#include <common>
+#include <packing>
+#include <uv_pars_fragment>
+#include <map_pars_fragment>
+#include <alphamap_pars_fragment>
+#include <alphatest_pars_fragment>
+#include <alphahash_pars_fragment>
+#include <logdepthbuf_pars_fragment>
+#include <clipping_planes_pars_fragment>
+varying vec2 vHighPrecisionZW;
+void main() {
+	vec4 diffuseColor = vec4( 1.0 );
+	#include <clipping_planes_fragment>
+	#if DEPTH_PACKING == 3200
+		diffuseColor.a = opacity;
+	#endif
+	#include <map_fragment>
+	#include <alphamap_fragment>
+	#include <alphatest_fragment>
+	#include <alphahash_fragment>
+	#include <logdepthbuf_fragment>
+	#ifdef USE_REVERSED_DEPTH_BUFFER
+		float fragCoordZ = vHighPrecisionZW[ 0 ] / vHighPrecisionZW[ 1 ];
+	#else
+		float fragCoordZ = 0.5 * vHighPrecisionZW[ 0 ] / vHighPrecisionZW[ 1 ] + 0.5;
+	#endif
+	#if DEPTH_PACKING == 3200
+		gl_FragColor = vec4( vec3( 1.0 - fragCoordZ ), opacity );
+	#elif DEPTH_PACKING == 3201
+		gl_FragColor = packDepthToRGBA( fragCoordZ );
+	#elif DEPTH_PACKING == 3202
+		gl_FragColor = vec4( packDepthToRGB( fragCoordZ ), 1.0 );
+	#elif DEPTH_PACKING == 3203
+		gl_FragColor = vec4( packDepthToRG( fragCoordZ ), 0.0, 1.0 );
+	#endif
+}`,ig=`#define DISTANCE
+varying vec3 vWorldPosition;
+#include <common>
+#include <batching_pars_vertex>
+#include <uv_pars_vertex>
+#include <displacementmap_pars_vertex>
+#include <morphtarget_pars_vertex>
+#include <skinning_pars_vertex>
+#include <clipping_planes_pars_vertex>
+void main() {
+	#include <uv_vertex>
+	#include <batching_vertex>
+	#include <skinbase_vertex>
+	#include <morphinstance_vertex>
+	#ifdef USE_DISPLACEMENTMAP
+		#include <beginnormal_vertex>
+		#include <morphnormal_vertex>
+		#include <skinnormal_vertex>
+	#endif
+	#include <begin_vertex>
+	#include <morphtarget_vertex>
+	#include <skinning_vertex>
+	#include <displacementmap_vertex>
+	#include <project_vertex>
+	#include <worldpos_vertex>
+	#include <clipping_planes_vertex>
+	vWorldPosition = worldPosition.xyz;
+}`,sg=`#define DISTANCE
+uniform vec3 referencePosition;
+uniform float nearDistance;
+uniform float farDistance;
+varying vec3 vWorldPosition;
+#include <common>
+#include <uv_pars_fragment>
+#include <map_pars_fragment>
+#include <alphamap_pars_fragment>
+#include <alphatest_pars_fragment>
+#include <alphahash_pars_fragment>
+#include <clipping_planes_pars_fragment>
+void main() {
+	vec4 diffuseColor = vec4( 1.0 );
+	#include <clipping_planes_fragment>
+	#include <map_fragment>
+	#include <alphamap_fragment>
+	#include <alphatest_fragment>
+	#include <alphahash_fragment>
+	float dist = length( vWorldPosition - referencePosition );
+	dist = ( dist - nearDistance ) / ( farDistance - nearDistance );
+	dist = saturate( dist );
+	gl_FragColor = vec4( dist, 0.0, 0.0, 1.0 );
+}`,rg=`varying vec3 vWorldDirection;
+#include <common>
+void main() {
+	vWorldDirection = transformDirection( position, modelMatrix );
+	#include <begin_vertex>
+	#include <project_vertex>
+}`,og=`uniform sampler2D tEquirect;
+varying vec3 vWorldDirection;
+#include <common>
+void main() {
+	vec3 direction = normalize( vWorldDirection );
+	vec2 sampleUV = equirectUv( direction );
+	gl_FragColor = texture2D( tEquirect, sampleUV );
+	#include <tonemapping_fragment>
+	#include <colorspace_fragment>
+}`,ag=`uniform float scale;
+attribute float lineDistance;
+varying float vLineDistance;
+#include <common>
+#include <uv_pars_vertex>
+#include <color_pars_vertex>
+#include <fog_pars_vertex>
+#include <morphtarget_pars_vertex>
+#include <logdepthbuf_pars_vertex>
+#include <clipping_planes_pars_vertex>
+void main() {
+	vLineDistance = scale * lineDistance;
+	#include <uv_vertex>
+	#include <color_vertex>
+	#include <morphinstance_vertex>
+	#include <morphcolor_vertex>
+	#include <begin_vertex>
+	#include <morphtarget_vertex>
+	#include <project_vertex>
+	#include <logdepthbuf_vertex>
+	#include <clipping_planes_vertex>
+	#include <fog_vertex>
+}`,lg=`uniform vec3 diffuse;
+uniform float opacity;
+uniform float dashSize;
+uniform float totalSize;
+varying float vLineDistance;
+#include <common>
+#include <color_pars_fragment>
+#include <uv_pars_fragment>
+#include <map_pars_fragment>
+#include <fog_pars_fragment>
+#include <logdepthbuf_pars_fragment>
+#include <clipping_planes_pars_fragment>
+void main() {
+	vec4 diffuseColor = vec4( diffuse, opacity );
+	#include <clipping_planes_fragment>
+	if ( mod( vLineDistance, totalSize ) > dashSize ) {
+		discard;
+	}
+	vec3 outgoingLight = vec3( 0.0 );
+	#include <logdepthbuf_fragment>
+	#include <map_fragment>
+	#include <color_fragment>
+	outgoingLight = diffuseColor.rgb;
+	#include <opaque_fragment>
+	#include <tonemapping_fragment>
+	#include <colorspace_fragment>
+	#include <fog_fragment>
+	#include <premultiplied_alpha_fragment>
+}`,cg=`#include <common>
+#include <batching_pars_vertex>
+#include <uv_pars_vertex>
+#include <envmap_pars_vertex>
+#include <color_pars_vertex>
+#include <fog_pars_vertex>
+#include <morphtarget_pars_vertex>
+#include <skinning_pars_vertex>
+#include <logdepthbuf_pars_vertex>
+#include <clipping_planes_pars_vertex>
+void main() {
+	#include <uv_vertex>
+	#include <color_vertex>
+	#include <morphinstance_vertex>
+	#include <morphcolor_vertex>
+	#include <batching_vertex>
+	#if defined ( USE_ENVMAP ) || defined ( USE_SKINNING )
+		#include <beginnormal_vertex>
+		#include <morphnormal_vertex>
+		#include <skinbase_vertex>
+		#include <skinnormal_vertex>
+		#include <defaultnormal_vertex>
+	#endif
+	#include <begin_vertex>
+	#include <morphtarget_vertex>
+	#include <skinning_vertex>
+	#include <project_vertex>
+	#include <logdepthbuf_vertex>
+	#include <clipping_planes_vertex>
+	#include <worldpos_vertex>
+	#include <envmap_vertex>
+	#include <fog_vertex>
+}`,hg=`uniform vec3 diffuse;
+uniform float opacity;
+#ifndef FLAT_SHADED
+	varying vec3 vNormal;
+#endif
+#include <common>
+#include <dithering_pars_fragment>
+#include <color_pars_fragment>
+#include <uv_pars_fragment>
+#include <map_pars_fragment>
+#include <alphamap_pars_fragment>
+#include <alphatest_pars_fragment>
+#include <alphahash_pars_fragment>
+#include <aomap_pars_fragment>
+#include <lightmap_pars_fragment>
+#include <envmap_common_pars_fragment>
+#include <envmap_pars_fragment>
+#include <fog_pars_fragment>
+#include <specularmap_pars_fragment>
+#include <logdepthbuf_pars_fragment>
+#include <clipping_planes_pars_fragment>
+void main() {
+	vec4 diffuseColor = vec4( diffuse, opacity );
+	#include <clipping_planes_fragment>
+	#include <logdepthbuf_fragment>
+	#include <map_fragment>
+	#include <color_fragment>
+	#include <alphamap_fragment>
+	#include <alphatest_fragment>
+	#include <alphahash_fragment>
+	#include <specularmap_fragment>
+	ReflectedLight reflectedLight = ReflectedLight( vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ) );
+	#ifdef USE_LIGHTMAP
+		vec4 lightMapTexel = texture2D( lightMap, vLightMapUv );
+		reflectedLight.indirectDiffuse += lightMapTexel.rgb * lightMapIntensity * RECIPROCAL_PI;
+	#else
+		reflectedLight.indirectDiffuse += vec3( 1.0 );
+	#endif
+	#include <aomap_fragment>
+	reflectedLight.indirectDiffuse *= diffuseColor.rgb;
+	vec3 outgoingLight = reflectedLight.indirectDiffuse;
+	#include <envmap_fragment>
+	#include <opaque_fragment>
+	#include <tonemapping_fragment>
+	#include <colorspace_fragment>
+	#include <fog_fragment>
+	#include <premultiplied_alpha_fragment>
+	#include <dithering_fragment>
+}`,ug=`#define LAMBERT
+varying vec3 vViewPosition;
+#include <common>
+#include <batching_pars_vertex>
+#include <uv_pars_vertex>
+#include <displacementmap_pars_vertex>
+#include <envmap_pars_vertex>
+#include <color_pars_vertex>
+#include <fog_pars_vertex>
+#include <normal_pars_vertex>
+#include <morphtarget_pars_vertex>
+#include <skinning_pars_vertex>
+#include <shadowmap_pars_vertex>
+#include <logdepthbuf_pars_vertex>
+#include <clipping_planes_pars_vertex>
+void main() {
+	#include <uv_vertex>
+	#include <color_vertex>
+	#include <morphinstance_vertex>
+	#include <morphcolor_vertex>
+	#include <batching_vertex>
+	#include <beginnormal_vertex>
+	#include <morphnormal_vertex>
+	#include <skinbase_vertex>
+	#include <skinnormal_vertex>
+	#include <defaultnormal_vertex>
+	#include <normal_vertex>
+	#include <begin_vertex>
+	#include <morphtarget_vertex>
+	#include <skinning_vertex>
+	#include <displacementmap_vertex>
+	#include <project_vertex>
+	#include <logdepthbuf_vertex>
+	#include <clipping_planes_vertex>
+	vViewPosition = - mvPosition.xyz;
+	#include <worldpos_vertex>
+	#include <envmap_vertex>
+	#include <shadowmap_vertex>
+	#include <fog_vertex>
+}`,dg=`#define LAMBERT
+uniform vec3 diffuse;
+uniform vec3 emissive;
+uniform float opacity;
+#include <common>
+#include <dithering_pars_fragment>
+#include <color_pars_fragment>
+#include <uv_pars_fragment>
+#include <map_pars_fragment>
+#include <alphamap_pars_fragment>
+#include <alphatest_pars_fragment>
+#include <alphahash_pars_fragment>
+#include <aomap_pars_fragment>
+#include <lightmap_pars_fragment>
+#include <emissivemap_pars_fragment>
+#include <cube_uv_reflection_fragment>
+#include <envmap_common_pars_fragment>
+#include <envmap_pars_fragment>
+#include <envmap_physical_pars_fragment>
+#include <fog_pars_fragment>
+#include <bsdfs>
+#include <lights_pars_begin>
+#include <normal_pars_fragment>
+#include <lights_lambert_pars_fragment>
+#include <shadowmap_pars_fragment>
+#include <bumpmap_pars_fragment>
+#include <normalmap_pars_fragment>
+#include <specularmap_pars_fragment>
+#include <logdepthbuf_pars_fragment>
+#include <clipping_planes_pars_fragment>
+void main() {
+	vec4 diffuseColor = vec4( diffuse, opacity );
+	#include <clipping_planes_fragment>
+	ReflectedLight reflectedLight = ReflectedLight( vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ) );
+	vec3 totalEmissiveRadiance = emissive;
+	#include <logdepthbuf_fragment>
+	#include <map_fragment>
+	#include <color_fragment>
+	#include <alphamap_fragment>
+	#include <alphatest_fragment>
+	#include <alphahash_fragment>
+	#include <specularmap_fragment>
+	#include <normal_fragment_begin>
+	#include <normal_fragment_maps>
+	#include <emissivemap_fragment>
+	#include <lights_lambert_fragment>
+	#include <lights_fragment_begin>
+	#include <lights_fragment_maps>
+	#include <lights_fragment_end>
+	#include <aomap_fragment>
+	vec3 outgoingLight = reflectedLight.directDiffuse + reflectedLight.indirectDiffuse + totalEmissiveRadiance;
+	#include <envmap_fragment>
+	#include <opaque_fragment>
+	#include <tonemapping_fragment>
+	#include <colorspace_fragment>
+	#include <fog_fragment>
+	#include <premultiplied_alpha_fragment>
+	#include <dithering_fragment>
+}`,fg=`#define MATCAP
+varying vec3 vViewPosition;
+#include <common>
+#include <batching_pars_vertex>
+#include <uv_pars_vertex>
+#include <color_pars_vertex>
+#include <displacementmap_pars_vertex>
+#include <fog_pars_vertex>
+#include <normal_pars_vertex>
+#include <morphtarget_pars_vertex>
+#include <skinning_pars_vertex>
+#include <logdepthbuf_pars_vertex>
+#include <clipping_planes_pars_vertex>
+void main() {
+	#include <uv_vertex>
+	#include <color_vertex>
+	#include <morphinstance_vertex>
+	#include <morphcolor_vertex>
+	#include <batching_vertex>
+	#include <beginnormal_vertex>
+	#include <morphnormal_vertex>
+	#include <skinbase_vertex>
+	#include <skinnormal_vertex>
+	#include <defaultnormal_vertex>
+	#include <normal_vertex>
+	#include <begin_vertex>
+	#include <morphtarget_vertex>
+	#include <skinning_vertex>
+	#include <displacementmap_vertex>
+	#include <project_vertex>
+	#include <logdepthbuf_vertex>
+	#include <clipping_planes_vertex>
+	#include <fog_vertex>
+	vViewPosition = - mvPosition.xyz;
+}`,pg=`#define MATCAP
+uniform vec3 diffuse;
+uniform float opacity;
+uniform sampler2D matcap;
+varying vec3 vViewPosition;
+#include <common>
+#include <dithering_pars_fragment>
+#include <color_pars_fragment>
+#include <uv_pars_fragment>
+#include <map_pars_fragment>
+#include <alphamap_pars_fragment>
+#include <alphatest_pars_fragment>
+#include <alphahash_pars_fragment>
+#include <fog_pars_fragment>
+#include <normal_pars_fragment>
+#include <bumpmap_pars_fragment>
+#include <normalmap_pars_fragment>
+#include <logdepthbuf_pars_fragment>
+#include <clipping_planes_pars_fragment>
+void main() {
+	vec4 diffuseColor = vec4( diffuse, opacity );
+	#include <clipping_planes_fragment>
+	#include <logdepthbuf_fragment>
+	#include <map_fragment>
+	#include <color_fragment>
+	#include <alphamap_fragment>
+	#include <alphatest_fragment>
+	#include <alphahash_fragment>
+	#include <normal_fragment_begin>
+	#include <normal_fragment_maps>
+	vec3 viewDir = normalize( vViewPosition );
+	vec3 x = normalize( vec3( viewDir.z, 0.0, - viewDir.x ) );
+	vec3 y = cross( viewDir, x );
+	vec2 uv = vec2( dot( x, normal ), dot( y, normal ) ) * 0.495 + 0.5;
+	#ifdef USE_MATCAP
+		vec4 matcapColor = texture2D( matcap, uv );
+	#else
+		vec4 matcapColor = vec4( vec3( mix( 0.2, 0.8, uv.y ) ), 1.0 );
+	#endif
+	vec3 outgoingLight = diffuseColor.rgb * matcapColor.rgb;
+	#include <opaque_fragment>
+	#include <tonemapping_fragment>
+	#include <colorspace_fragment>
+	#include <fog_fragment>
+	#include <premultiplied_alpha_fragment>
+	#include <dithering_fragment>
+}`,mg=`#define NORMAL
+#if defined( FLAT_SHADED ) || defined( USE_BUMPMAP ) || defined( USE_NORMALMAP_TANGENTSPACE )
+	varying vec3 vViewPosition;
+#endif
+#include <common>
+#include <batching_pars_vertex>
+#include <uv_pars_vertex>
+#include <displacementmap_pars_vertex>
+#include <normal_pars_vertex>
+#include <morphtarget_pars_vertex>
+#include <skinning_pars_vertex>
+#include <logdepthbuf_pars_vertex>
+#include <clipping_planes_pars_vertex>
+void main() {
+	#include <uv_vertex>
+	#include <batching_vertex>
+	#include <beginnormal_vertex>
+	#include <morphinstance_vertex>
+	#include <morphnormal_vertex>
+	#include <skinbase_vertex>
+	#include <skinnormal_vertex>
+	#include <defaultnormal_vertex>
+	#include <normal_vertex>
+	#include <begin_vertex>
+	#include <morphtarget_vertex>
+	#include <skinning_vertex>
+	#include <displacementmap_vertex>
+	#include <project_vertex>
+	#include <logdepthbuf_vertex>
+	#include <clipping_planes_vertex>
+#if defined( FLAT_SHADED ) || defined( USE_BUMPMAP ) || defined( USE_NORMALMAP_TANGENTSPACE )
+	vViewPosition = - mvPosition.xyz;
+#endif
+}`,gg=`#define NORMAL
+uniform float opacity;
+#if defined( FLAT_SHADED ) || defined( USE_BUMPMAP ) || defined( USE_NORMALMAP_TANGENTSPACE )
+	varying vec3 vViewPosition;
+#endif
+#include <uv_pars_fragment>
+#include <normal_pars_fragment>
+#include <bumpmap_pars_fragment>
+#include <normalmap_pars_fragment>
+#include <logdepthbuf_pars_fragment>
+#include <clipping_planes_pars_fragment>
+void main() {
+	vec4 diffuseColor = vec4( 0.0, 0.0, 0.0, opacity );
+	#include <clipping_planes_fragment>
+	#include <logdepthbuf_fragment>
+	#include <normal_fragment_begin>
+	#include <normal_fragment_maps>
+	gl_FragColor = vec4( normalize( normal ) * 0.5 + 0.5, diffuseColor.a );
+	#ifdef OPAQUE
+		gl_FragColor.a = 1.0;
+	#endif
+}`,xg=`#define PHONG
+varying vec3 vViewPosition;
+#include <common>
+#include <batching_pars_vertex>
+#include <uv_pars_vertex>
+#include <displacementmap_pars_vertex>
+#include <envmap_pars_vertex>
+#include <color_pars_vertex>
+#include <fog_pars_vertex>
+#include <normal_pars_vertex>
+#include <morphtarget_pars_vertex>
+#include <skinning_pars_vertex>
+#include <shadowmap_pars_vertex>
+#include <logdepthbuf_pars_vertex>
+#include <clipping_planes_pars_vertex>
+void main() {
+	#include <uv_vertex>
+	#include <color_vertex>
+	#include <morphcolor_vertex>
+	#include <batching_vertex>
+	#include <beginnormal_vertex>
+	#include <morphinstance_vertex>
+	#include <morphnormal_vertex>
+	#include <skinbase_vertex>
+	#include <skinnormal_vertex>
+	#include <defaultnormal_vertex>
+	#include <normal_vertex>
+	#include <begin_vertex>
+	#include <morphtarget_vertex>
+	#include <skinning_vertex>
+	#include <displacementmap_vertex>
+	#include <project_vertex>
+	#include <logdepthbuf_vertex>
+	#include <clipping_planes_vertex>
+	vViewPosition = - mvPosition.xyz;
+	#include <worldpos_vertex>
+	#include <envmap_vertex>
+	#include <shadowmap_vertex>
+	#include <fog_vertex>
+}`,_g=`#define PHONG
+uniform vec3 diffuse;
+uniform vec3 emissive;
+uniform vec3 specular;
+uniform float shininess;
+uniform float opacity;
+#include <common>
+#include <dithering_pars_fragment>
+#include <color_pars_fragment>
+#include <uv_pars_fragment>
+#include <map_pars_fragment>
+#include <alphamap_pars_fragment>
+#include <alphatest_pars_fragment>
+#include <alphahash_pars_fragment>
+#include <aomap_pars_fragment>
+#include <lightmap_pars_fragment>
+#include <emissivemap_pars_fragment>
+#include <cube_uv_reflection_fragment>
+#include <envmap_common_pars_fragment>
+#include <envmap_pars_fragment>
+#include <envmap_physical_pars_fragment>
+#include <fog_pars_fragment>
+#include <bsdfs>
+#include <lights_pars_begin>
+#include <normal_pars_fragment>
+#include <lights_phong_pars_fragment>
+#include <shadowmap_pars_fragment>
+#include <bumpmap_pars_fragment>
+#include <normalmap_pars_fragment>
+#include <specularmap_pars_fragment>
+#include <logdepthbuf_pars_fragment>
+#include <clipping_planes_pars_fragment>
+void main() {
+	vec4 diffuseColor = vec4( diffuse, opacity );
+	#include <clipping_planes_fragment>
+	ReflectedLight reflectedLight = ReflectedLight( vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ) );
+	vec3 totalEmissiveRadiance = emissive;
+	#include <logdepthbuf_fragment>
+	#include <map_fragment>
+	#include <color_fragment>
+	#include <alphamap_fragment>
+	#include <alphatest_fragment>
+	#include <alphahash_fragment>
+	#include <specularmap_fragment>
+	#include <normal_fragment_begin>
+	#include <normal_fragment_maps>
+	#include <emissivemap_fragment>
+	#include <lights_phong_fragment>
+	#include <lights_fragment_begin>
+	#include <lights_fragment_maps>
+	#include <lights_fragment_end>
+	#include <aomap_fragment>
+	vec3 outgoingLight = reflectedLight.directDiffuse + reflectedLight.indirectDiffuse + reflectedLight.directSpecular + reflectedLight.indirectSpecular + totalEmissiveRadiance;
+	#include <envmap_fragment>
+	#include <opaque_fragment>
+	#include <tonemapping_fragment>
+	#include <colorspace_fragment>
+	#include <fog_fragment>
+	#include <premultiplied_alpha_fragment>
+	#include <dithering_fragment>
+}`,yg=`#define STANDARD
+varying vec3 vViewPosition;
+#ifdef USE_TRANSMISSION
+	varying vec3 vWorldPosition;
+#endif
+#include <common>
+#include <batching_pars_vertex>
+#include <uv_pars_vertex>
+#include <displacementmap_pars_vertex>
+#include <color_pars_vertex>
+#include <fog_pars_vertex>
+#include <normal_pars_vertex>
+#include <morphtarget_pars_vertex>
+#include <skinning_pars_vertex>
+#include <shadowmap_pars_vertex>
+#include <logdepthbuf_pars_vertex>
+#include <clipping_planes_pars_vertex>
+void main() {
+	#include <uv_vertex>
+	#include <color_vertex>
+	#include <morphinstance_vertex>
+	#include <morphcolor_vertex>
+	#include <batching_vertex>
+	#include <beginnormal_vertex>
+	#include <morphnormal_vertex>
+	#include <skinbase_vertex>
+	#include <skinnormal_vertex>
+	#include <defaultnormal_vertex>
+	#include <normal_vertex>
+	#include <begin_vertex>
+	#include <morphtarget_vertex>
+	#include <skinning_vertex>
+	#include <displacementmap_vertex>
+	#include <project_vertex>
+	#include <logdepthbuf_vertex>
+	#include <clipping_planes_vertex>
+	vViewPosition = - mvPosition.xyz;
+	#include <worldpos_vertex>
+	#include <shadowmap_vertex>
+	#include <fog_vertex>
+#ifdef USE_TRANSMISSION
+	vWorldPosition = worldPosition.xyz;
+#endif
+}`,vg=`#define STANDARD
+#ifdef PHYSICAL
+	#define IOR
+	#define USE_SPECULAR
+#endif
+uniform vec3 diffuse;
+uniform vec3 emissive;
+uniform float roughness;
+uniform float metalness;
+uniform float opacity;
+#ifdef IOR
+	uniform float ior;
+#endif
+#ifdef USE_SPECULAR
+	uniform float specularIntensity;
+	uniform vec3 specularColor;
+	#ifdef USE_SPECULAR_COLORMAP
+		uniform sampler2D specularColorMap;
+	#endif
+	#ifdef USE_SPECULAR_INTENSITYMAP
+		uniform sampler2D specularIntensityMap;
+	#endif
+#endif
+#ifdef USE_CLEARCOAT
+	uniform float clearcoat;
+	uniform float clearcoatRoughness;
+#endif
+#ifdef USE_DISPERSION
+	uniform float dispersion;
+#endif
+#ifdef USE_RETROREFLECTION
+	uniform float retroreflectivity;
+#endif
+#ifdef USE_IRIDESCENCE
+	uniform float iridescence;
+	uniform float iridescenceIOR;
+	uniform float iridescenceThicknessMinimum;
+	uniform float iridescenceThicknessMaximum;
+#endif
+#ifdef USE_SHEEN
+	uniform vec3 sheenColor;
+	uniform float sheenRoughness;
+	#ifdef USE_SHEEN_COLORMAP
+		uniform sampler2D sheenColorMap;
+	#endif
+	#ifdef USE_SHEEN_ROUGHNESSMAP
+		uniform sampler2D sheenRoughnessMap;
+	#endif
+#endif
+#ifdef USE_ANISOTROPY
+	uniform vec2 anisotropyVector;
+	#ifdef USE_ANISOTROPYMAP
+		uniform sampler2D anisotropyMap;
+	#endif
+#endif
+varying vec3 vViewPosition;
+#include <common>
+#include <dithering_pars_fragment>
+#include <color_pars_fragment>
+#include <uv_pars_fragment>
+#include <map_pars_fragment>
+#include <alphamap_pars_fragment>
+#include <alphatest_pars_fragment>
+#include <alphahash_pars_fragment>
+#include <aomap_pars_fragment>
+#include <lightmap_pars_fragment>
+#include <emissivemap_pars_fragment>
+#include <iridescence_fragment>
+#include <cube_uv_reflection_fragment>
+#include <envmap_common_pars_fragment>
+#include <envmap_physical_pars_fragment>
+#include <fog_pars_fragment>
+#include <lights_pars_begin>
+#include <normal_pars_fragment>
+#include <lights_physical_pars_fragment>
+#include <transmission_pars_fragment>
+#include <shadowmap_pars_fragment>
+#include <bumpmap_pars_fragment>
+#include <normalmap_pars_fragment>
+#include <clearcoat_pars_fragment>
+#include <iridescence_pars_fragment>
+#include <roughnessmap_pars_fragment>
+#include <metalnessmap_pars_fragment>
+#include <logdepthbuf_pars_fragment>
+#include <clipping_planes_pars_fragment>
+void main() {
+	vec4 diffuseColor = vec4( diffuse, opacity );
+	#include <clipping_planes_fragment>
+	ReflectedLight reflectedLight = ReflectedLight( vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ) );
+	vec3 totalEmissiveRadiance = emissive;
+	#include <logdepthbuf_fragment>
+	#include <map_fragment>
+	#include <color_fragment>
+	#include <alphamap_fragment>
+	#include <alphatest_fragment>
+	#include <alphahash_fragment>
+	#include <roughnessmap_fragment>
+	#include <metalnessmap_fragment>
+	#include <normal_fragment_begin>
+	#include <normal_fragment_maps>
+	#include <clearcoat_normal_fragment_begin>
+	#include <clearcoat_normal_fragment_maps>
+	#include <emissivemap_fragment>
+	#include <lights_physical_fragment>
+	#include <lights_fragment_begin>
+	#include <lights_fragment_maps>
+	#include <lights_fragment_end>
+	#include <aomap_fragment>
+	vec3 totalDiffuse = reflectedLight.directDiffuse + reflectedLight.indirectDiffuse;
+	vec3 totalSpecular = reflectedLight.directSpecular + reflectedLight.indirectSpecular;
+	#include <transmission_fragment>
+	vec3 outgoingLight = totalDiffuse + totalSpecular + totalEmissiveRadiance;
+	#ifdef USE_SHEEN
+ 
+		outgoingLight = outgoingLight + sheenSpecularDirect + sheenSpecularIndirect;
+ 
+ 	#endif
+	#ifdef USE_CLEARCOAT
+		float dotNVcc = saturate( dot( geometryClearcoatNormal, geometryViewDir ) );
+		vec3 Fcc = F_Schlick( material.clearcoatF0, material.clearcoatF90, dotNVcc );
+		outgoingLight = outgoingLight * ( 1.0 - material.clearcoat * Fcc ) + ( clearcoatSpecularDirect + clearcoatSpecularIndirect ) * material.clearcoat;
+	#endif
+	#include <opaque_fragment>
+	#include <tonemapping_fragment>
+	#include <colorspace_fragment>
+	#include <fog_fragment>
+	#include <premultiplied_alpha_fragment>
+	#include <dithering_fragment>
+}`,Mg=`#define TOON
+varying vec3 vViewPosition;
+#include <common>
+#include <batching_pars_vertex>
+#include <uv_pars_vertex>
+#include <displacementmap_pars_vertex>
+#include <color_pars_vertex>
+#include <fog_pars_vertex>
+#include <normal_pars_vertex>
+#include <morphtarget_pars_vertex>
+#include <skinning_pars_vertex>
+#include <shadowmap_pars_vertex>
+#include <logdepthbuf_pars_vertex>
+#include <clipping_planes_pars_vertex>
+void main() {
+	#include <uv_vertex>
+	#include <color_vertex>
+	#include <morphinstance_vertex>
+	#include <morphcolor_vertex>
+	#include <batching_vertex>
+	#include <beginnormal_vertex>
+	#include <morphnormal_vertex>
+	#include <skinbase_vertex>
+	#include <skinnormal_vertex>
+	#include <defaultnormal_vertex>
+	#include <normal_vertex>
+	#include <begin_vertex>
+	#include <morphtarget_vertex>
+	#include <skinning_vertex>
+	#include <displacementmap_vertex>
+	#include <project_vertex>
+	#include <logdepthbuf_vertex>
+	#include <clipping_planes_vertex>
+	vViewPosition = - mvPosition.xyz;
+	#include <worldpos_vertex>
+	#include <shadowmap_vertex>
+	#include <fog_vertex>
+}`,Sg=`#define TOON
+uniform vec3 diffuse;
+uniform vec3 emissive;
+uniform float opacity;
+#include <common>
+#include <dithering_pars_fragment>
+#include <color_pars_fragment>
+#include <uv_pars_fragment>
+#include <map_pars_fragment>
+#include <alphamap_pars_fragment>
+#include <alphatest_pars_fragment>
+#include <alphahash_pars_fragment>
+#include <aomap_pars_fragment>
+#include <lightmap_pars_fragment>
+#include <emissivemap_pars_fragment>
+#include <gradientmap_pars_fragment>
+#include <fog_pars_fragment>
+#include <bsdfs>
+#include <lights_pars_begin>
+#include <normal_pars_fragment>
+#include <lights_toon_pars_fragment>
+#include <shadowmap_pars_fragment>
+#include <bumpmap_pars_fragment>
+#include <normalmap_pars_fragment>
+#include <logdepthbuf_pars_fragment>
+#include <clipping_planes_pars_fragment>
+void main() {
+	vec4 diffuseColor = vec4( diffuse, opacity );
+	#include <clipping_planes_fragment>
+	ReflectedLight reflectedLight = ReflectedLight( vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ), vec3( 0.0 ) );
+	vec3 totalEmissiveRadiance = emissive;
+	#include <logdepthbuf_fragment>
+	#include <map_fragment>
+	#include <color_fragment>
+	#include <alphamap_fragment>
+	#include <alphatest_fragment>
+	#include <alphahash_fragment>
+	#include <normal_fragment_begin>
+	#include <normal_fragment_maps>
+	#include <emissivemap_fragment>
+	#include <lights_toon_fragment>
+	#include <lights_fragment_begin>
+	#include <lights_fragment_maps>
+	#include <lights_fragment_end>
+	#include <aomap_fragment>
+	vec3 outgoingLight = reflectedLight.directDiffuse + reflectedLight.indirectDiffuse + totalEmissiveRadiance;
+	#include <opaque_fragment>
+	#include <tonemapping_fragment>
+	#include <colorspace_fragment>
+	#include <fog_fragment>
+	#include <premultiplied_alpha_fragment>
+	#include <dithering_fragment>
+}`,bg=`uniform float size;
+uniform float scale;
+#include <common>
+#include <color_pars_vertex>
+#include <fog_pars_vertex>
+#include <morphtarget_pars_vertex>
+#include <logdepthbuf_pars_vertex>
+#include <clipping_planes_pars_vertex>
+#ifdef USE_POINTS_UV
+	varying vec2 vUv;
+	uniform mat3 uvTransform;
+#endif
+void main() {
+	#ifdef USE_POINTS_UV
+		vUv = ( uvTransform * vec3( uv, 1 ) ).xy;
+	#endif
+	#include <color_vertex>
+	#include <morphinstance_vertex>
+	#include <morphcolor_vertex>
+	#include <begin_vertex>
+	#include <morphtarget_vertex>
+	#include <project_vertex>
+	gl_PointSize = size;
+	#ifdef USE_SIZEATTENUATION
+		bool isPerspective = isPerspectiveMatrix( projectionMatrix );
+		if ( isPerspective ) gl_PointSize *= ( scale / - mvPosition.z );
+	#endif
+	#include <logdepthbuf_vertex>
+	#include <clipping_planes_vertex>
+	#include <worldpos_vertex>
+	#include <fog_vertex>
+}`,wg=`uniform vec3 diffuse;
+uniform float opacity;
+#include <common>
+#include <color_pars_fragment>
+#include <map_particle_pars_fragment>
+#include <alphatest_pars_fragment>
+#include <alphahash_pars_fragment>
+#include <fog_pars_fragment>
+#include <logdepthbuf_pars_fragment>
+#include <clipping_planes_pars_fragment>
+void main() {
+	vec4 diffuseColor = vec4( diffuse, opacity );
+	#include <clipping_planes_fragment>
+	vec3 outgoingLight = vec3( 0.0 );
+	#include <logdepthbuf_fragment>
+	#include <map_particle_fragment>
+	#include <color_fragment>
+	#include <alphatest_fragment>
+	#include <alphahash_fragment>
+	outgoingLight = diffuseColor.rgb;
+	#include <opaque_fragment>
+	#include <tonemapping_fragment>
+	#include <colorspace_fragment>
+	#include <fog_fragment>
+	#include <premultiplied_alpha_fragment>
+}`,Tg=`#include <common>
+#include <batching_pars_vertex>
+#include <fog_pars_vertex>
+#include <morphtarget_pars_vertex>
+#include <skinning_pars_vertex>
+#include <logdepthbuf_pars_vertex>
+#include <shadowmap_pars_vertex>
+void main() {
+	#include <batching_vertex>
+	#include <beginnormal_vertex>
+	#include <morphinstance_vertex>
+	#include <morphnormal_vertex>
+	#include <skinbase_vertex>
+	#include <skinnormal_vertex>
+	#include <defaultnormal_vertex>
+	#include <begin_vertex>
+	#include <morphtarget_vertex>
+	#include <skinning_vertex>
+	#include <project_vertex>
+	#include <logdepthbuf_vertex>
+	#include <worldpos_vertex>
+	#include <shadowmap_vertex>
+	#include <fog_vertex>
+}`,Eg=`uniform vec3 color;
+uniform float opacity;
+#include <common>
+#include <fog_pars_fragment>
+#include <bsdfs>
+#include <lights_pars_begin>
+#include <logdepthbuf_pars_fragment>
+#include <shadowmap_pars_fragment>
+#include <shadowmask_pars_fragment>
+void main() {
+	#include <logdepthbuf_fragment>
+	gl_FragColor = vec4( color, opacity * ( 1.0 - getShadowMask() ) );
+	#include <tonemapping_fragment>
+	#include <colorspace_fragment>
+	#include <fog_fragment>
+	#include <premultiplied_alpha_fragment>
+}`,Ag=`uniform float rotation;
+uniform vec2 center;
+#include <common>
+#include <uv_pars_vertex>
+#include <fog_pars_vertex>
+#include <logdepthbuf_pars_vertex>
+#include <clipping_planes_pars_vertex>
+void main() {
+	#include <uv_vertex>
+	vec4 mvPosition = modelViewMatrix[ 3 ];
+	vec2 scale = vec2( length( modelMatrix[ 0 ].xyz ), length( modelMatrix[ 1 ].xyz ) );
+	#ifndef USE_SIZEATTENUATION
+		bool isPerspective = isPerspectiveMatrix( projectionMatrix );
+		if ( isPerspective ) scale *= - mvPosition.z;
+	#endif
+	vec2 alignedPosition = ( position.xy - ( center - vec2( 0.5 ) ) ) * scale;
+	vec2 rotatedPosition;
+	rotatedPosition.x = cos( rotation ) * alignedPosition.x - sin( rotation ) * alignedPosition.y;
+	rotatedPosition.y = sin( rotation ) * alignedPosition.x + cos( rotation ) * alignedPosition.y;
+	mvPosition.xy += rotatedPosition;
+	gl_Position = projectionMatrix * mvPosition;
+	#include <logdepthbuf_vertex>
+	#include <clipping_planes_vertex>
+	#include <fog_vertex>
+}`,Cg=`uniform vec3 diffuse;
+uniform float opacity;
+#include <common>
+#include <uv_pars_fragment>
+#include <map_pars_fragment>
+#include <alphamap_pars_fragment>
+#include <alphatest_pars_fragment>
+#include <alphahash_pars_fragment>
+#include <fog_pars_fragment>
+#include <logdepthbuf_pars_fragment>
+#include <clipping_planes_pars_fragment>
+void main() {
+	vec4 diffuseColor = vec4( diffuse, opacity );
+	#include <clipping_planes_fragment>
+	vec3 outgoingLight = vec3( 0.0 );
+	#include <logdepthbuf_fragment>
+	#include <map_fragment>
+	#include <alphamap_fragment>
+	#include <alphatest_fragment>
+	#include <alphahash_fragment>
+	outgoingLight = diffuseColor.rgb;
+	#include <opaque_fragment>
+	#include <tonemapping_fragment>
+	#include <colorspace_fragment>
+	#include <fog_fragment>
+}`,oe={alphahash_fragment:$f,alphahash_pars_fragment:Jf,alphamap_fragment:Kf,alphamap_pars_fragment:jf,alphatest_fragment:Qf,alphatest_pars_fragment:tp,aomap_fragment:ep,aomap_pars_fragment:np,batching_pars_vertex:ip,batching_vertex:sp,begin_vertex:rp,beginnormal_vertex:op,bsdfs:ap,iridescence_fragment:lp,bumpmap_pars_fragment:cp,clipping_planes_fragment:hp,clipping_planes_pars_fragment:up,clipping_planes_pars_vertex:dp,clipping_planes_vertex:fp,color_fragment:pp,color_pars_fragment:mp,color_pars_vertex:gp,color_vertex:xp,common:_p,cube_uv_reflection_fragment:yp,defaultnormal_vertex:vp,displacementmap_pars_vertex:Mp,displacementmap_vertex:Sp,emissivemap_fragment:bp,emissivemap_pars_fragment:wp,colorspace_fragment:Tp,colorspace_pars_fragment:Ep,envmap_fragment:Ap,envmap_common_pars_fragment:Cp,envmap_pars_fragment:Rp,envmap_pars_vertex:Ip,envmap_physical_pars_fragment:Vp,envmap_vertex:Pp,fog_vertex:Lp,fog_pars_vertex:Dp,fog_fragment:Np,fog_pars_fragment:Up,gradientmap_pars_fragment:Fp,lightmap_pars_fragment:Op,lights_lambert_fragment:Bp,lights_lambert_pars_fragment:zp,lights_pars_begin:kp,lights_toon_fragment:Gp,lights_toon_pars_fragment:Hp,lights_phong_fragment:Wp,lights_phong_pars_fragment:Xp,lights_physical_fragment:qp,lights_physical_pars_fragment:Yp,lights_fragment_begin:Zp,lights_fragment_maps:$p,lights_fragment_end:Jp,lightprobes_pars_fragment:Kp,logdepthbuf_fragment:jp,logdepthbuf_pars_fragment:Qp,logdepthbuf_pars_vertex:tm,logdepthbuf_vertex:em,map_fragment:nm,map_pars_fragment:im,map_particle_fragment:sm,map_particle_pars_fragment:rm,metalnessmap_fragment:om,metalnessmap_pars_fragment:am,morphinstance_vertex:lm,morphcolor_vertex:cm,morphnormal_vertex:hm,morphtarget_pars_vertex:um,morphtarget_vertex:dm,normal_fragment_begin:fm,normal_fragment_maps:pm,normal_pars_fragment:mm,normal_pars_vertex:gm,normal_vertex:xm,normalmap_pars_fragment:_m,clearcoat_normal_fragment_begin:ym,clearcoat_normal_fragment_maps:vm,clearcoat_pars_fragment:Mm,iridescence_pars_fragment:Sm,opaque_fragment:bm,packing:wm,premultiplied_alpha_fragment:Tm,project_vertex:Em,dithering_fragment:Am,dithering_pars_fragment:Cm,roughnessmap_fragment:Rm,roughnessmap_pars_fragment:Im,shadowmap_pars_fragment:Pm,shadowmap_pars_vertex:Lm,shadowmap_vertex:Dm,shadowmask_pars_fragment:Nm,skinbase_vertex:Um,skinning_pars_vertex:Fm,skinning_vertex:Om,skinnormal_vertex:Bm,specularmap_fragment:zm,specularmap_pars_fragment:km,tonemapping_fragment:Vm,tonemapping_pars_fragment:Gm,transmission_fragment:Hm,transmission_pars_fragment:Wm,uv_pars_fragment:Xm,uv_pars_vertex:qm,uv_vertex:Ym,worldpos_vertex:Zm,background_vert:$m,background_frag:Jm,backgroundCube_vert:Km,backgroundCube_frag:jm,cube_vert:Qm,cube_frag:tg,depth_vert:eg,depth_frag:ng,distance_vert:ig,distance_frag:sg,equirect_vert:rg,equirect_frag:og,linedashed_vert:ag,linedashed_frag:lg,meshbasic_vert:cg,meshbasic_frag:hg,meshlambert_vert:ug,meshlambert_frag:dg,meshmatcap_vert:fg,meshmatcap_frag:pg,meshnormal_vert:mg,meshnormal_frag:gg,meshphong_vert:xg,meshphong_frag:_g,meshphysical_vert:yg,meshphysical_frag:vg,meshtoon_vert:Mg,meshtoon_frag:Sg,points_vert:bg,points_frag:wg,shadow_vert:Tg,shadow_frag:Eg,sprite_vert:Ag,sprite_frag:Cg},Rt={common:{diffuse:{value:new se(16777215)},opacity:{value:1},map:{value:null},mapTransform:{value:new ie},alphaMap:{value:null},alphaMapTransform:{value:new ie},alphaTest:{value:0}},specularmap:{specularMap:{value:null},specularMapTransform:{value:new ie}},envmap:{envMap:{value:null},envMapRotation:{value:new ie},reflectivity:{value:1},ior:{value:1.5},refractionRatio:{value:.98},dfgLUT:{value:null}},aomap:{aoMap:{value:null},aoMapIntensity:{value:1},aoMapTransform:{value:new ie}},lightmap:{lightMap:{value:null},lightMapIntensity:{value:1},lightMapTransform:{value:new ie}},bumpmap:{bumpMap:{value:null},bumpMapTransform:{value:new ie},bumpScale:{value:1}},normalmap:{normalMap:{value:null},normalMapTransform:{value:new ie},normalScale:{value:new xt(1,1)}},displacementmap:{displacementMap:{value:null},displacementMapTransform:{value:new ie},displacementScale:{value:1},displacementBias:{value:0}},emissivemap:{emissiveMap:{value:null},emissiveMapTransform:{value:new ie}},metalnessmap:{metalnessMap:{value:null},metalnessMapTransform:{value:new ie}},roughnessmap:{roughnessMap:{value:null},roughnessMapTransform:{value:new ie}},gradientmap:{gradientMap:{value:null}},fog:{fogDensity:{value:25e-5},fogNear:{value:1},fogFar:{value:2e3},fogColor:{value:new se(16777215)}},lights:{ambientLightColor:{value:[]},lightProbe:{value:[]},sunLights:{value:[],properties:{direction:{},color:{}}},sunLightShadows:{value:[],properties:{shadowIntensity:1,shadowBias:{},shadowNormalBias:{},shadowRadius:{},shadowMapSize:{}}},sunShadowMatrix:{value:[]},sunShadowCascade:{value:[]},directionalLights:{value:[],properties:{direction:{},color:{}}},directionalLightShadows:{value:[],properties:{shadowIntensity:1,shadowBias:{},shadowNormalBias:{},shadowRadius:{},shadowMapSize:{}}},directionalShadowMatrix:{value:[]},spotLights:{value:[],properties:{color:{},position:{},direction:{},distance:{},coneCos:{},penumbraCos:{},decay:{}}},spotLightShadows:{value:[],properties:{shadowIntensity:1,shadowBias:{},shadowNormalBias:{},shadowRadius:{},shadowMapSize:{}}},spotLightMap:{value:[]},spotLightMatrix:{value:[]},pointLights:{value:[],properties:{color:{},position:{},decay:{},distance:{}}},pointLightShadows:{value:[],properties:{shadowIntensity:1,shadowBias:{},shadowNormalBias:{},shadowRadius:{},shadowMapSize:{},shadowCameraNear:{},shadowCameraFar:{}}},pointShadowMatrix:{value:[]},hemisphereLights:{value:[],properties:{direction:{},skyColor:{},groundColor:{}}},rectAreaLights:{value:[],properties:{color:{},position:{},width:{},height:{}}},ltc_1:{value:null},ltc_2:{value:null},probesSH:{value:null},probesMin:{value:new O},probesMax:{value:new O},probesResolution:{value:new O}},points:{diffuse:{value:new se(16777215)},opacity:{value:1},size:{value:1},scale:{value:1},map:{value:null},alphaMap:{value:null},alphaMapTransform:{value:new ie},alphaTest:{value:0},uvTransform:{value:new ie}},sprite:{diffuse:{value:new se(16777215)},opacity:{value:1},center:{value:new xt(.5,.5)},rotation:{value:0},map:{value:null},mapTransform:{value:new ie},alphaMap:{value:null},alphaMapTransform:{value:new ie},alphaTest:{value:0}}},si={basic:{uniforms:rn([Rt.common,Rt.specularmap,Rt.envmap,Rt.aomap,Rt.lightmap,Rt.fog]),vertexShader:oe.meshbasic_vert,fragmentShader:oe.meshbasic_frag},lambert:{uniforms:rn([Rt.common,Rt.specularmap,Rt.envmap,Rt.aomap,Rt.lightmap,Rt.emissivemap,Rt.bumpmap,Rt.normalmap,Rt.displacementmap,Rt.fog,Rt.lights,{emissive:{value:new se(0)},envMapIntensity:{value:1}}]),vertexShader:oe.meshlambert_vert,fragmentShader:oe.meshlambert_frag},phong:{uniforms:rn([Rt.common,Rt.specularmap,Rt.envmap,Rt.aomap,Rt.lightmap,Rt.emissivemap,Rt.bumpmap,Rt.normalmap,Rt.displacementmap,Rt.fog,Rt.lights,{emissive:{value:new se(0)},specular:{value:new se(1118481)},shininess:{value:30},envMapIntensity:{value:1}}]),vertexShader:oe.meshphong_vert,fragmentShader:oe.meshphong_frag},standard:{uniforms:rn([Rt.common,Rt.envmap,Rt.aomap,Rt.lightmap,Rt.emissivemap,Rt.bumpmap,Rt.normalmap,Rt.displacementmap,Rt.roughnessmap,Rt.metalnessmap,Rt.fog,Rt.lights,{emissive:{value:new se(0)},roughness:{value:1},metalness:{value:0},envMapIntensity:{value:1}}]),vertexShader:oe.meshphysical_vert,fragmentShader:oe.meshphysical_frag},toon:{uniforms:rn([Rt.common,Rt.aomap,Rt.lightmap,Rt.emissivemap,Rt.bumpmap,Rt.normalmap,Rt.displacementmap,Rt.gradientmap,Rt.fog,Rt.lights,{emissive:{value:new se(0)}}]),vertexShader:oe.meshtoon_vert,fragmentShader:oe.meshtoon_frag},matcap:{uniforms:rn([Rt.common,Rt.bumpmap,Rt.normalmap,Rt.displacementmap,Rt.fog,{matcap:{value:null}}]),vertexShader:oe.meshmatcap_vert,fragmentShader:oe.meshmatcap_frag},points:{uniforms:rn([Rt.points,Rt.fog]),vertexShader:oe.points_vert,fragmentShader:oe.points_frag},dashed:{uniforms:rn([Rt.common,Rt.fog,{scale:{value:1},dashSize:{value:1},totalSize:{value:2}}]),vertexShader:oe.linedashed_vert,fragmentShader:oe.linedashed_frag},depth:{uniforms:rn([Rt.common,Rt.displacementmap]),vertexShader:oe.depth_vert,fragmentShader:oe.depth_frag},normal:{uniforms:rn([Rt.common,Rt.bumpmap,Rt.normalmap,Rt.displacementmap,{opacity:{value:1}}]),vertexShader:oe.meshnormal_vert,fragmentShader:oe.meshnormal_frag},sprite:{uniforms:rn([Rt.sprite,Rt.fog]),vertexShader:oe.sprite_vert,fragmentShader:oe.sprite_frag},background:{uniforms:{uvTransform:{value:new ie},t2D:{value:null},backgroundIntensity:{value:1}},vertexShader:oe.background_vert,fragmentShader:oe.background_frag},backgroundCube:{uniforms:{envMap:{value:null},backgroundBlurriness:{value:0},backgroundIntensity:{value:1},backgroundRotation:{value:new ie}},vertexShader:oe.backgroundCube_vert,fragmentShader:oe.backgroundCube_frag},cube:{uniforms:{tCube:{value:null},tFlip:{value:-1},opacity:{value:1}},vertexShader:oe.cube_vert,fragmentShader:oe.cube_frag},equirect:{uniforms:{tEquirect:{value:null}},vertexShader:oe.equirect_vert,fragmentShader:oe.equirect_frag},distance:{uniforms:rn([Rt.common,Rt.displacementmap,{referencePosition:{value:new O},nearDistance:{value:1},farDistance:{value:1e3}}]),vertexShader:oe.distance_vert,fragmentShader:oe.distance_frag},shadow:{uniforms:rn([Rt.lights,Rt.fog,{color:{value:new se(0)},opacity:{value:1}}]),vertexShader:oe.shadow_vert,fragmentShader:oe.shadow_frag}};si.physical={uniforms:rn([si.standard.uniforms,{clearcoat:{value:0},clearcoatMap:{value:null},clearcoatMapTransform:{value:new ie},clearcoatNormalMap:{value:null},clearcoatNormalMapTransform:{value:new ie},clearcoatNormalScale:{value:new xt(1,1)},clearcoatRoughness:{value:0},clearcoatRoughnessMap:{value:null},clearcoatRoughnessMapTransform:{value:new ie},dispersion:{value:0},retroreflectivity:{value:0},iridescence:{value:0},iridescenceMap:{value:null},iridescenceMapTransform:{value:new ie},iridescenceIOR:{value:1.3},iridescenceThicknessMinimum:{value:100},iridescenceThicknessMaximum:{value:400},iridescenceThicknessMap:{value:null},iridescenceThicknessMapTransform:{value:new ie},sheen:{value:0},sheenColor:{value:new se(0)},sheenColorMap:{value:null},sheenColorMapTransform:{value:new ie},sheenRoughness:{value:1},sheenRoughnessMap:{value:null},sheenRoughnessMapTransform:{value:new ie},transmission:{value:0},transmissionMap:{value:null},transmissionMapTransform:{value:new ie},transmissionSamplerSize:{value:new xt},transmissionSamplerMap:{value:null},thickness:{value:0},thicknessMap:{value:null},thicknessMapTransform:{value:new ie},attenuationDistance:{value:0},attenuationColor:{value:new se(0)},specularColor:{value:new se(1,1,1)},specularColorMap:{value:null},specularColorMapTransform:{value:new ie},specularIntensity:{value:1},specularIntensityMap:{value:null},specularIntensityMapTransform:{value:new ie},anisotropyVector:{value:new xt},anisotropyMap:{value:null},anisotropyMapTransform:{value:new ie}}]),vertexShader:oe.meshphysical_vert,fragmentShader:oe.meshphysical_frag};var al={r:0,b:0,g:0},Rg=new Ee,sd=new ie;sd.set(-1,0,0,0,1,0,0,0,1);function Ig(i,t,e,n,s,r){let o=new se(0),a=s===!0?0:1,l,c,h=null,f=0,u=null;function d(T){let P=T.isScene===!0?T.background:null;if(P&&P.isTexture){let S=T.backgroundBlurriness>0;P=t.get(P,S)}return P}function g(T){let P=!1,S=d(T);S===null?m(o,a):S&&S.isColor&&(m(S,1),P=!0);let A=i.xr.getEnvironmentBlendMode();A==="additive"?e.buffers.color.setClear(0,0,0,1,r):A==="alpha-blend"&&e.buffers.color.setClear(0,0,0,0,r),(i.autoClear||P)&&(e.buffers.depth.setTest(!0),e.buffers.depth.setMask(!0),e.buffers.color.setMask(!0),i.clear(i.autoClearColor,i.autoClearDepth,i.autoClearStencil))}function M(T,P){let S=d(P);S&&(S.isCubeTexture||S.mapping===Or)?(c===void 0&&(c=new Ue(new ti(1,1,1),new Tn({name:"BackgroundCubeMaterial",uniforms:ls(si.backgroundCube.uniforms),vertexShader:si.backgroundCube.vertexShader,fragmentShader:si.backgroundCube.fragmentShader,side:je,depthTest:!1,depthWrite:!1,fog:!1,allowOverride:!1})),c.geometry.deleteAttribute("normal"),c.geometry.deleteAttribute("uv"),c.onBeforeRender=function(A,b,R){this.matrixWorld.copyPosition(R.matrixWorld)},Object.defineProperty(c.material,"envMap",{get:function(){return this.uniforms.envMap.value}}),n.update(c)),c.material.uniforms.envMap.value=S,c.material.uniforms.backgroundBlurriness.value=P.backgroundBlurriness,c.material.uniforms.backgroundIntensity.value=P.backgroundIntensity,c.material.uniforms.backgroundRotation.value.setFromMatrix4(Rg.makeRotationFromEuler(P.backgroundRotation)).transpose(),S.isCubeTexture&&S.isRenderTargetTexture===!1&&c.material.uniforms.backgroundRotation.value.premultiply(sd),c.material.toneMapped=pe.getTransfer(S.colorSpace)!==Me,(h!==S||f!==S.version||u!==i.toneMapping)&&(c.material.needsUpdate=!0,h=S,f=S.version,u=i.toneMapping),c.layers.enableAll(),T.unshift(c,c.geometry,c.material,0,0,null)):S&&S.isTexture&&(l===void 0&&(l=new Ue(new rs(2,2),new Tn({name:"BackgroundMaterial",uniforms:ls(si.background.uniforms),vertexShader:si.background.vertexShader,fragmentShader:si.background.fragmentShader,side:Bi,depthTest:!1,depthWrite:!1,fog:!1,allowOverride:!1})),l.geometry.deleteAttribute("normal"),Object.defineProperty(l.material,"map",{get:function(){return this.uniforms.t2D.value}}),n.update(l)),l.material.uniforms.t2D.value=S,l.material.uniforms.backgroundIntensity.value=P.backgroundIntensity,l.material.toneMapped=pe.getTransfer(S.colorSpace)!==Me,S.matrixAutoUpdate===!0&&S.updateMatrix(),l.material.uniforms.uvTransform.value.copy(S.matrix),(h!==S||f!==S.version||u!==i.toneMapping)&&(l.material.needsUpdate=!0,h=S,f=S.version,u=i.toneMapping),l.layers.enableAll(),T.unshift(l,l.geometry,l.material,0,0,null))}function m(T,P){T.getRGB(al,Oc(i)),e.buffers.color.setClear(al.r,al.g,al.b,P,r)}function p(){c!==void 0&&(c.geometry.dispose(),c.material.dispose(),c=void 0),l!==void 0&&(l.geometry.dispose(),l.material.dispose(),l=void 0)}return{getClearColor:function(){return o},setClearColor:function(T,P=1){o.set(T),a=P,m(o,a)},getClearAlpha:function(){return a},setClearAlpha:function(T){a=T,m(o,a)},render:g,addToRenderList:M,dispose:p}}function Pg(i,t){let e=i.getParameter(i.MAX_VERTEX_ATTRIBS),n={},s=u(null),r=s,o=!1;function a(D,B,G,N,C){let k=!1,V=f(D,N,G,B);r!==V&&(r=V,c(r.object)),k=d(D,N,G,C),k&&g(D,N,G,C),C!==null&&t.update(C,i.ELEMENT_ARRAY_BUFFER),(k||o)&&(o=!1,S(D,B,G,N),C!==null&&i.bindBuffer(i.ELEMENT_ARRAY_BUFFER,t.get(C).buffer))}function l(){return i.createVertexArray()}function c(D){return i.bindVertexArray(D)}function h(D){return i.deleteVertexArray(D)}function f(D,B,G,N){let C=N.wireframe===!0,k=n[B.id];k===void 0&&(k={},n[B.id]=k);let V=D.isInstancedMesh===!0?D.id:0,j=k[V];j===void 0&&(j={},k[V]=j);let W=j[G.id];W===void 0&&(W={},j[G.id]=W);let J=W[C];return J===void 0&&(J=u(l()),W[C]=J),J}function u(D){let B=[],G=[],N=[];for(let C=0;C<e;C++)B[C]=0,G[C]=0,N[C]=0;return{geometry:null,program:null,wireframe:!1,newAttributes:B,enabledAttributes:G,attributeDivisors:N,object:D,attributes:{},index:null}}function d(D,B,G,N){let C=r.attributes,k=B.attributes,V=0,j=G.getAttributes();for(let W in j)if(j[W].location>=0){let et=C[W],vt=k[W];if(vt===void 0&&(W==="instanceMatrix"&&D.instanceMatrix&&(vt=D.instanceMatrix),W==="instanceColor"&&D.instanceColor&&(vt=D.instanceColor)),et===void 0||et.attribute!==vt||vt&&et.data!==vt.data)return!0;V++}return r.attributesNum!==V||r.index!==N}function g(D,B,G,N){let C={},k=B.attributes,V=0,j=G.getAttributes();for(let W in j)if(j[W].location>=0){let et=k[W];et===void 0&&(W==="instanceMatrix"&&D.instanceMatrix&&(et=D.instanceMatrix),W==="instanceColor"&&D.instanceColor&&(et=D.instanceColor));let vt={};vt.attribute=et,et&&et.data&&(vt.data=et.data),C[W]=vt,V++}r.attributes=C,r.attributesNum=V,r.index=N}function M(){let D=r.newAttributes;for(let B=0,G=D.length;B<G;B++)D[B]=0}function m(D){p(D,0)}function p(D,B){let G=r.newAttributes,N=r.enabledAttributes,C=r.attributeDivisors;G[D]=1,N[D]===0&&(i.enableVertexAttribArray(D),N[D]=1),C[D]!==B&&(i.vertexAttribDivisor(D,B),C[D]=B)}function T(){let D=r.newAttributes,B=r.enabledAttributes;for(let G=0,N=B.length;G<N;G++)B[G]!==D[G]&&(i.disableVertexAttribArray(G),B[G]=0)}function P(D,B,G,N,C,k,V){V===!0?i.vertexAttribIPointer(D,B,G,C,k):i.vertexAttribPointer(D,B,G,N,C,k)}function S(D,B,G,N){M();let C=N.attributes,k=G.getAttributes(),V=B.defaultAttributeValues;for(let j in k){let W=k[j];if(W.location>=0){let J=C[j];if(J===void 0&&(j==="instanceMatrix"&&D.instanceMatrix&&(J=D.instanceMatrix),j==="instanceColor"&&D.instanceColor&&(J=D.instanceColor)),J!==void 0){let et=J.normalized,vt=J.itemSize,rt=t.get(J);if(rt===void 0)continue;let Zt=rt.buffer,Nt=rt.type,ne=rt.bytesPerElement,tt=Nt===i.INT||Nt===i.UNSIGNED_INT||J.gpuType===Ma;if(J.isInterleavedBufferAttribute){let it=J.data,Mt=it.stride,Dt=J.offset;if(it.isInstancedInterleavedBuffer){for(let It=0;It<W.locationSize;It++)p(W.location+It,it.meshPerAttribute);D.isInstancedMesh!==!0&&N._maxInstanceCount===void 0&&(N._maxInstanceCount=it.meshPerAttribute*it.count)}else for(let It=0;It<W.locationSize;It++)m(W.location+It);i.bindBuffer(i.ARRAY_BUFFER,Zt);for(let It=0;It<W.locationSize;It++)P(W.location+It,vt/W.locationSize,Nt,et,Mt*ne,(Dt+vt/W.locationSize*It)*ne,tt)}else{if(J.isInstancedBufferAttribute){for(let it=0;it<W.locationSize;it++)p(W.location+it,J.meshPerAttribute);D.isInstancedMesh!==!0&&N._maxInstanceCount===void 0&&(N._maxInstanceCount=J.meshPerAttribute*J.count)}else for(let it=0;it<W.locationSize;it++)m(W.location+it);i.bindBuffer(i.ARRAY_BUFFER,Zt);for(let it=0;it<W.locationSize;it++)P(W.location+it,vt/W.locationSize,Nt,et,vt*ne,vt/W.locationSize*it*ne,tt)}}else if(V!==void 0){let et=V[j];if(et!==void 0)switch(et.length){case 2:i.vertexAttrib2fv(W.location,et);break;case 3:i.vertexAttrib3fv(W.location,et);break;case 4:i.vertexAttrib4fv(W.location,et);break;default:i.vertexAttrib1fv(W.location,et)}}}}T()}function A(){w();for(let D in n){let B=n[D];for(let G in B){let N=B[G];for(let C in N){let k=N[C];for(let V in k)h(k[V].object),delete k[V];delete N[C]}}delete n[D]}}function b(D){if(n[D.id]===void 0)return;let B=n[D.id];for(let G in B){let N=B[G];for(let C in N){let k=N[C];for(let V in k)h(k[V].object),delete k[V];delete N[C]}}delete n[D.id]}function R(D){for(let B in n){let G=n[B];for(let N in G){let C=G[N];if(C[D.id]===void 0)continue;let k=C[D.id];for(let V in k)h(k[V].object),delete k[V];delete C[D.id]}}}function _(D){for(let B in n){let G=n[B],N=D.isInstancedMesh===!0?D.id:0,C=G[N];if(C!==void 0){for(let k in C){let V=C[k];for(let j in V)h(V[j].object),delete V[j];delete C[k]}delete G[N],Object.keys(G).length===0&&delete n[B]}}}function w(){L(),o=!0,r!==s&&(r=s,c(r.object))}function L(){s.geometry=null,s.program=null,s.wireframe=!1}return{setup:a,reset:w,resetDefaultState:L,dispose:A,releaseStatesOfGeometry:b,releaseStatesOfObject:_,releaseStatesOfProgram:R,initAttributes:M,enableAttribute:m,disableUnusedAttributes:T}}function Lg(i,t,e){let n;function s(l){n=l}function r(l,c){i.drawArrays(n,l,c),e.update(c,n,1)}function o(l,c,h){h!==0&&(i.drawArraysInstanced(n,l,c,h),e.update(c,n,h))}function a(l,c,h){if(h===0)return;t.get("WEBGL_multi_draw").multiDrawArraysWEBGL(n,l,0,c,0,h);let u=0;for(let d=0;d<h;d++)u+=c[d];e.update(u,n,1)}this.setMode=s,this.render=r,this.renderInstances=o,this.renderMultiDraw=a}function Dg(i,t,e,n){let s;function r(){if(s!==void 0)return s;if(t.has("EXT_texture_filter_anisotropic")===!0){let R=t.get("EXT_texture_filter_anisotropic");s=i.getParameter(R.MAX_TEXTURE_MAX_ANISOTROPY_EXT)}else s=0;return s}function o(R){return!(R!==In&&n.convert(R)!==i.getParameter(i.IMPLEMENTATION_COLOR_READ_FORMAT))}function a(R){let _=R===Hn&&(t.has("EXT_color_buffer_half_float")||t.has("EXT_color_buffer_float"));return!(R!==xn&&R!==Gn&&!_&&n.convert(R)!==i.getParameter(i.IMPLEMENTATION_COLOR_READ_TYPE))}function l(R){if(R==="highp"){if(i.getShaderPrecisionFormat(i.VERTEX_SHADER,i.HIGH_FLOAT).precision>0&&i.getShaderPrecisionFormat(i.FRAGMENT_SHADER,i.HIGH_FLOAT).precision>0)return"highp";R="mediump"}return R==="mediump"&&i.getShaderPrecisionFormat(i.VERTEX_SHADER,i.MEDIUM_FLOAT).precision>0&&i.getShaderPrecisionFormat(i.FRAGMENT_SHADER,i.MEDIUM_FLOAT).precision>0?"mediump":"lowp"}let c=e.precision!==void 0?e.precision:"highp",h=l(c);h!==c&&(Jt("WebGLRenderer:",c,"not supported, using",h,"instead."),c=h);let f=e.logarithmicDepthBuffer===!0,u=e.reversedDepthBuffer===!0&&t.has("EXT_clip_control");e.reversedDepthBuffer===!0&&u===!1&&Jt("WebGLRenderer: Unable to use reversed depth buffer due to missing EXT_clip_control extension. Fallback to default depth buffer.");let d=i.getParameter(i.MAX_TEXTURE_IMAGE_UNITS),g=i.getParameter(i.MAX_VERTEX_TEXTURE_IMAGE_UNITS),M=i.getParameter(i.MAX_TEXTURE_SIZE),m=i.getParameter(i.MAX_CUBE_MAP_TEXTURE_SIZE),p=i.getParameter(i.MAX_VERTEX_ATTRIBS),T=i.getParameter(i.MAX_VERTEX_UNIFORM_VECTORS),P=i.getParameter(i.MAX_VARYING_VECTORS),S=i.getParameter(i.MAX_FRAGMENT_UNIFORM_VECTORS),A=i.getParameter(i.MAX_SAMPLES),b=i.getParameter(i.SAMPLES);return{isWebGL2:!0,getMaxAnisotropy:r,getMaxPrecision:l,textureFormatReadable:o,textureTypeReadable:a,precision:c,logarithmicDepthBuffer:f,reversedDepthBuffer:u,maxTextures:d,maxVertexTextures:g,maxTextureSize:M,maxCubemapSize:m,maxAttributes:p,maxVertexUniforms:T,maxVaryings:P,maxFragmentUniforms:S,maxSamples:A,samples:b}}function Ng(i){let t=this,e=null,n=0,s=!1,r=!1,o=new Bn,a=new ie,l={value:null,needsUpdate:!1};this.uniform=l,this.numPlanes=0,this.numIntersection=0,this.init=function(f,u){let d=f.length!==0||u||n!==0||s;return s=u,n=f.length,d},this.beginShadows=function(){r=!0,h(null)},this.endShadows=function(){r=!1},this.setGlobalState=function(f,u){e=h(f,u,0)},this.setState=function(f,u,d){let g=f.clippingPlanes,M=f.clipIntersection,m=f.clipShadows,p=i.get(f);if(!s||g===null||g.length===0||r&&!m)r?h(null):c();else{let T=r?0:n,P=T*4,S=p.clippingState||null;l.value=S,S=h(g,u,P,d);for(let A=0;A!==P;++A)S[A]=e[A];p.clippingState=S,this.numIntersection=M?this.numPlanes:0,this.numPlanes+=T}};function c(){l.value!==e&&(l.value=e,l.needsUpdate=n>0),t.numPlanes=n,t.numIntersection=0}function h(f,u,d,g){let M=f!==null?f.length:0,m=null;if(M!==0){if(m=l.value,g!==!0||m===null){let p=d+M*4,T=u.matrixWorldInverse;a.getNormalMatrix(T),(m===null||m.length<p)&&(m=new Float32Array(p));for(let P=0,S=d;P!==M;++P,S+=4)o.copy(f[P]).applyMatrix4(T,a),o.normal.toArray(m,S),m[S+3]=o.constant}l.value=m,l.needsUpdate=!0}return t.numPlanes=M,t.numIntersection=0,m}}var Zs=4,Ug=6,Fg=20,Og=256,Xr=new mi,Fu=new se,Vc=null,Gc=0,Hc=0,Wc=!1,Bg=new O,cs=new O,cl=class{constructor(t){this._renderer=t,this._pingPongRenderTarget=null,this._lodMax=0,this._cubeSize=0,this._sizeLods=[],this._lodMeshes=[],this._backgroundBox=null,this._cubemapMaterial=null,this._equirectMaterial=null,this._blurMaterial=null,this._ggxMaterial=null}fromScene(t,e=0,n=.1,s=100,r={}){let{size:o=256,position:a=Bg}=r;Vc=this._renderer.getRenderTarget(),Gc=this._renderer.getActiveCubeFace(),Hc=this._renderer.getActiveMipmapLevel(),Wc=this._renderer.xr.enabled,this._renderer.xr.enabled=!1,this._setSize(o);let l=this._allocateTargets();return l.depthBuffer=!0,this._sceneToCubeUV(t,n,s,l,a),e>0&&this._blur(l,0,0,e),this._applyPMREM(l),this._cleanup(l),l}fromEquirectangular(t,e=null){return this._fromTexture(t,e)}fromCubemap(t,e=null){return this._fromTexture(t,e)}compileCubemapShader(){this._cubemapMaterial===null&&(this._cubemapMaterial=zu(),this._compileMaterial(this._cubemapMaterial))}compileEquirectangularShader(){this._equirectMaterial===null&&(this._equirectMaterial=Bu(),this._compileMaterial(this._equirectMaterial))}dispose(){this._dispose(),this._cubemapMaterial!==null&&this._cubemapMaterial.dispose(),this._equirectMaterial!==null&&this._equirectMaterial.dispose(),this._backgroundBox!==null&&(this._backgroundBox.geometry.dispose(),this._backgroundBox.material.dispose())}_setSize(t){this._lodMax=Math.floor(Math.log2(t)),this._cubeSize=Math.pow(2,this._lodMax)}_dispose(){this._blurMaterial!==null&&this._blurMaterial.dispose(),this._ggxMaterial!==null&&this._ggxMaterial.dispose(),this._pingPongRenderTarget!==null&&this._pingPongRenderTarget.dispose();for(let t=0;t<this._lodMeshes.length;t++)this._lodMeshes[t].geometry.dispose()}_cleanup(t){this._renderer.setRenderTarget(Vc,Gc,Hc),this._renderer.xr.enabled=Wc,t.scissorTest=!1,Ys(t,0,0,t.width,t.height)}_fromTexture(t,e){t.mapping===zi||t.mapping===as?this._setSize(t.image.length===0?16:t.image[0].width||t.image[0].image.width):this._setSize(t.image.width/4),Vc=this._renderer.getRenderTarget(),Gc=this._renderer.getActiveCubeFace(),Hc=this._renderer.getActiveMipmapLevel(),Wc=this._renderer.xr.enabled,this._renderer.xr.enabled=!1;let n=e||this._allocateTargets();return this._textureToCubeUV(t,n),this._applyPMREM(n),this._cleanup(n),n}_allocateTargets(){let t=3*Math.max(this._cubeSize,112),e=4*this._cubeSize,n={magFilter:Je,minFilter:Je,generateMipmaps:!1,type:Hn,format:In,colorSpace:dr,depthBuffer:!1},s=Ou(t,e,n);if(this._pingPongRenderTarget===null||this._pingPongRenderTarget.width!==t||this._pingPongRenderTarget.height!==e){this._pingPongRenderTarget!==null&&this._dispose(),this._pingPongRenderTarget=Ou(t,e,n);let{_lodMax:r}=this;({lodMeshes:this._lodMeshes,sizeLods:this._sizeLods}=zg(r)),this._blurMaterial=Vg(r,t,e),this._ggxMaterial=kg(r,t,e)}return s}_compileMaterial(t){let e=new Ue(new sn,t);this._renderer.compile(e,Xr)}_sceneToCubeUV(t,e,n,s,r){let l=new fn(90,1,e,n),c=[1,-1,1,1,1,1],h=[1,1,1,-1,-1,-1],f=this._renderer,u=f.autoClear,d=f.toneMapping;f.getClearColor(Fu),f.toneMapping=kn,f.autoClear=!1,f.state.buffers.depth.getReversed()&&(f.setRenderTarget(s),f.clearDepth(),f.setRenderTarget(null)),this._backgroundBox===null&&(this._backgroundBox=new Ue(new ti,new Qn({name:"PMREM.Background",side:je,depthWrite:!1,depthTest:!1})));let M=this._backgroundBox,m=M.material,p=!1,T=t.background;T?T.isColor&&(m.color.copy(T),t.background=null,p=!0):(m.color.copy(Fu),p=!0);for(let P=0;P<6;P++){let S=P%3;S===0?(l.up.set(0,c[P],0),l.position.set(r.x,r.y,r.z),l.lookAt(r.x+h[P],r.y,r.z)):S===1?(l.up.set(0,0,c[P]),l.position.set(r.x,r.y,r.z),l.lookAt(r.x,r.y+h[P],r.z)):(l.up.set(0,c[P],0),l.position.set(r.x,r.y,r.z),l.lookAt(r.x,r.y,r.z+h[P]));let A=this._cubeSize;Ys(s,S*A,P>2?A:0,A,A),f.setRenderTarget(s),p&&f.render(M,l),f.render(t,l)}f.toneMapping=d,f.autoClear=u,t.background=T}_textureToCubeUV(t,e){let n=this._renderer,s=t.mapping===zi||t.mapping===as;s?(this._cubemapMaterial===null&&(this._cubemapMaterial=zu()),this._cubemapMaterial.uniforms.flipEnvMap.value=t.isRenderTargetTexture===!1?-1:1):this._equirectMaterial===null&&(this._equirectMaterial=Bu());let r=s?this._cubemapMaterial:this._equirectMaterial,o=this._lodMeshes[0];o.material=r;let a=r.uniforms;a.envMap.value=t;let l=this._cubeSize;Ys(e,0,0,3*l,2*l),n.setRenderTarget(e),n.render(o,Xr)}_applyPMREM(t){let e=this._renderer,n=e.autoClear;e.autoClear=!1;let s=this._lodMeshes.length;for(let r=1;r<s;r++)this._applyGGXFilter(t,r-1,r);e.autoClear=n}_applyGGXFilter(t,e,n){let s=this._renderer,r=this._pingPongRenderTarget,o=this._ggxMaterial,a=this._lodMeshes[n];a.material=o;let l=o.uniforms,c=n/(this._lodMeshes.length-1),h=e/(this._lodMeshes.length-1),f=Math.sqrt(c*c-h*h),u=c*1.25,d=f*u,{_lodMax:g}=this,M=this._sizeLods[n],m=3*M*(n>g-Zs?n-g+Zs:0),p=4*(this._cubeSize-M);l.envMap.value=t.texture,l.roughness.value=d,l.mipInt.value=g-e,Ys(r,m,p,3*M,2*M),s.setRenderTarget(r),s.render(a,Xr),l.envMap.value=r.texture,l.roughness.value=0,l.mipInt.value=g-n,Ys(t,m,p,3*M,2*M),s.setRenderTarget(t),s.render(a,Xr)}_blur(t,e,n,s){let r=this._pingPongRenderTarget,o=Math.min(s,Math.PI)/Math.SQRT2;this._blurPass(t,r,e,n,o),this._blurPass(r,t,n,n,o)}_blurPass(t,e,n,s,r){let o=this._renderer,a=this._blurMaterial,l=this._lodMeshes[s];l.material=a;let c=a.uniforms;c.envMap.value=t.texture,c.sigma.value=r,c.mipInt.value=this._lodMax-n;let h=this._sizeLods[s],f=3*h*(s>this._lodMax-Zs?s-this._lodMax+Zs:0),u=4*(this._cubeSize-h);Ys(e,f,u,3*h,2*h),o.setRenderTarget(e),o.render(l,Xr)}};function zg(i){let t=[],e=[],n=i,s=i-Zs+1+Ug;for(let r=0;r<s;r++){let o=Math.pow(2,n);t.push(o);let a=1/(o-2),l=-a,c=1+a,h=[l,l,c,l,c,c,l,l,c,c,l,c],f=6,u=6,d=3,g=new Float32Array(d*u*f),M=new Float32Array(d*u*f);for(let p=0;p<f;p++){let T=p%3*2/3-1,P=p>2?0:-1,S=[T,P,0,T+2/3,P,0,T+2/3,P+1,0,T,P,0,T+2/3,P+1,0,T,P+1,0];g.set(S,d*u*p);for(let A=0;A<u;A++){let b=h[A*2]*2-1,R=h[A*2+1]*2-1;p===0?cs.set(1,R,b):p===1?cs.set(-b,1,-R):p===2?cs.set(-b,R,1):p===3?cs.set(-1,R,-b):p===4?cs.set(-b,-1,R):cs.set(b,R,-1),cs.toArray(M,(p*u+A)*d)}}let m=new sn;m.setAttribute("position",new pn(g,d)),m.setAttribute("outputDirection",new pn(M,d)),e.push(new Ue(m,null)),n>Zs&&n--}return{lodMeshes:e,sizeLods:t}}function Ou(i,t,e){let n=new gn(i,t,e);return n.texture.mapping=Or,n.texture.name="PMREM.cubeUv",n.scissorTest=!0,n}function Ys(i,t,e,n,s){i.viewport.set(t,e,n,s),i.scissor.set(t,e,n,s)}function kg(i,t,e){return new Tn({name:"PMREMGGXConvolution",defines:{GGX_SAMPLES:Og,CUBEUV_TEXEL_WIDTH:1/t,CUBEUV_TEXEL_HEIGHT:1/e,CUBEUV_MAX_MIP:`${i}.0`},uniforms:{envMap:{value:null},roughness:{value:0},mipInt:{value:0}},vertexShader:dl(),fragmentShader:`
+
+			precision highp float;
+			precision highp int;
+
+			varying vec3 vOutputDirection;
+
+			uniform sampler2D envMap;
+			uniform float roughness;
+			uniform float mipInt;
+
+			#define ENVMAP_TYPE_CUBE_UV
+			#include <cube_uv_reflection_fragment>
+
+			#define PI 3.14159265359
+
+			// Van der Corput radical inverse
+			float radicalInverse_VdC(uint bits) {
+				bits = (bits << 16u) | (bits >> 16u);
+				bits = ((bits & 0x55555555u) << 1u) | ((bits & 0xAAAAAAAAu) >> 1u);
+				bits = ((bits & 0x33333333u) << 2u) | ((bits & 0xCCCCCCCCu) >> 2u);
+				bits = ((bits & 0x0F0F0F0Fu) << 4u) | ((bits & 0xF0F0F0F0u) >> 4u);
+				bits = ((bits & 0x00FF00FFu) << 8u) | ((bits & 0xFF00FF00u) >> 8u);
+				return float(bits) * 2.3283064365386963e-10; // / 0x100000000
+			}
+
+			// Hammersley sequence
+			vec2 hammersley(uint i, uint N) {
+				return vec2(float(i) / float(N), radicalInverse_VdC(i));
+			}
+
+			// GGX VNDF importance sampling (Eric Heitz 2018)
+			// "Sampling the GGX Distribution of Visible Normals"
+			// https://jcgt.org/published/0007/04/01/
+			vec3 importanceSampleGGX_VNDF(vec2 Xi, vec3 V, float roughness) {
+				float alpha = roughness * roughness;
+
+				// Section 4.1: Orthonormal basis
+				vec3 T1 = vec3(1.0, 0.0, 0.0);
+				vec3 T2 = cross(V, T1);
+
+				// Section 4.2: Parameterization of projected area
+				float r = sqrt(Xi.x);
+				float phi = 2.0 * PI * Xi.y;
+				float t1 = r * cos(phi);
+				float t2 = r * sin(phi);
+				float s = 0.5 * (1.0 + V.z);
+				t2 = (1.0 - s) * sqrt(1.0 - t1 * t1) + s * t2;
+
+				// Section 4.3: Reprojection onto hemisphere
+				vec3 Nh = t1 * T1 + t2 * T2 + sqrt(max(0.0, 1.0 - t1 * t1 - t2 * t2)) * V;
+
+				// Section 3.4: Transform back to ellipsoid configuration
+				return normalize(vec3(alpha * Nh.x, alpha * Nh.y, max(0.0, Nh.z)));
+			}
+
+			void main() {
+				vec3 N = normalize(vOutputDirection);
+				vec3 V = N; // Assume view direction equals normal for pre-filtering
+
+				vec3 prefilteredColor = vec3(0.0);
+				float totalWeight = 0.0;
+
+				// For very low roughness, just sample the environment directly
+				if (roughness < 0.001) {
+					gl_FragColor = vec4(bilinearCubeUV(envMap, N, mipInt), 1.0);
+					return;
+				}
+
+				// Tangent space basis for VNDF sampling
+				vec3 up = abs(N.z) < 0.999 ? vec3(0.0, 0.0, 1.0) : vec3(1.0, 0.0, 0.0);
+				vec3 tangent = normalize(cross(up, N));
+				vec3 bitangent = cross(N, tangent);
+
+				for(uint i = 0u; i < uint(GGX_SAMPLES); i++) {
+					vec2 Xi = hammersley(i, uint(GGX_SAMPLES));
+
+					// For PMREM, V = N, so in tangent space V is always (0, 0, 1)
+					vec3 H_tangent = importanceSampleGGX_VNDF(Xi, vec3(0.0, 0.0, 1.0), roughness);
+
+					// Transform H back to world space
+					vec3 H = normalize(tangent * H_tangent.x + bitangent * H_tangent.y + N * H_tangent.z);
+					vec3 L = normalize(2.0 * dot(V, H) * H - V);
+
+					float NdotL = max(dot(N, L), 0.0);
+
+					if(NdotL > 0.0) {
+						// Sample environment at fixed mip level
+						// VNDF importance sampling handles the distribution filtering
+						vec3 sampleColor = bilinearCubeUV(envMap, L, mipInt);
+
+						// Weight by NdotL for the split-sum approximation
+						// VNDF PDF naturally accounts for the visible microfacet distribution
+						prefilteredColor += sampleColor * NdotL;
+						totalWeight += NdotL;
+					}
+				}
+
+				if (totalWeight > 0.0) {
+					prefilteredColor = prefilteredColor / totalWeight;
+				}
+
+				gl_FragColor = vec4(prefilteredColor, 1.0);
+			}
+		`,blending:ni,depthTest:!1,depthWrite:!1})}function Vg(i,t,e){return new Tn({name:"SphericalGaussianBlur",defines:{SAMPLES:Fg,CUBEUV_TEXEL_WIDTH:1/t,CUBEUV_TEXEL_HEIGHT:1/e,CUBEUV_MAX_MIP:`${i}.0`},uniforms:{envMap:{value:null},sigma:{value:0},mipInt:{value:0}},vertexShader:dl(),fragmentShader:`
+
+			precision highp float;
+			precision highp int;
+
+			varying vec3 vOutputDirection;
+
+			uniform sampler2D envMap;
+			uniform float sigma;
+			uniform float mipInt;
+
+			#define ENVMAP_TYPE_CUBE_UV
+			#include <cube_uv_reflection_fragment>
+
+			#define PI 3.14159265359
+			#define GOLDEN_ANGLE 2.39996322973
+
+			void main() {
+
+				if ( sigma == 0.0 ) {
+
+					gl_FragColor = vec4( bilinearCubeUV( envMap, vOutputDirection, mipInt ), 1.0 );
+					return;
+
+				}
+
+				vec3 outputDirection = normalize( vOutputDirection );
+
+				vec3 up = abs( outputDirection.z ) < 0.999 ? vec3( 0.0, 0.0, 1.0 ) : vec3( 1.0, 0.0, 0.0 );
+				vec3 tangent = normalize( cross( up, outputDirection ) );
+				vec3 bitangent = cross( outputDirection, tangent );
+
+				// Truncate the kernel at three standard deviations or at the antipode.
+				float thetaMax = min( 3.0 * sigma, PI );
+				float truncation = 1.0 - exp( - 0.5 * thetaMax * thetaMax / ( sigma * sigma ) );
+
+				vec3 accumColor = vec3( 0.0 );
+				float accumWeight = 0.0;
+
+				for ( int i = 0; i < SAMPLES; i ++ ) {
+
+					// Stratified inverse-CDF sampling of the Gaussian, placed on a golden-angle spiral.
+					float stratum = ( float( i ) + 0.5 ) / float( SAMPLES );
+					float theta = sigma * sqrt( - 2.0 * log( 1.0 - stratum * truncation ) );
+					float phi = float( i ) * GOLDEN_ANGLE;
+
+					vec3 offset = cos( phi ) * tangent + sin( phi ) * bitangent;
+					vec3 sampleDirection = cos( theta ) * outputDirection + sin( theta ) * offset;
+
+					// Correct the planar sample density to solid angle.
+					float weight = sin( theta ) / theta;
+
+					accumColor += weight * bilinearCubeUV( envMap, sampleDirection, mipInt );
+					accumWeight += weight;
+
+				}
+
+				gl_FragColor = vec4( accumColor / accumWeight, 1.0 );
+
+			}
+		`,blending:ni,depthTest:!1,depthWrite:!1})}function Bu(){return new Tn({name:"EquirectangularToCubeUV",uniforms:{envMap:{value:null}},vertexShader:dl(),fragmentShader:`
+
+			precision mediump float;
+			precision mediump int;
+
+			varying vec3 vOutputDirection;
+
+			uniform sampler2D envMap;
+
+			#include <common>
+
+			void main() {
+
+				vec3 outputDirection = normalize( vOutputDirection );
+				vec2 uv = equirectUv( outputDirection );
+
+				gl_FragColor = vec4( texture2D ( envMap, uv ).rgb, 1.0 );
+
+			}
+		`,blending:ni,depthTest:!1,depthWrite:!1})}function zu(){return new Tn({name:"CubemapToCubeUV",uniforms:{envMap:{value:null},flipEnvMap:{value:-1}},vertexShader:dl(),fragmentShader:`
+
+			precision mediump float;
+			precision mediump int;
+
+			uniform float flipEnvMap;
+
+			varying vec3 vOutputDirection;
+
+			uniform samplerCube envMap;
+
+			void main() {
+
+				gl_FragColor = textureCube( envMap, vec3( flipEnvMap * vOutputDirection.x, vOutputDirection.yz ) );
+
+			}
+		`,blending:ni,depthTest:!1,depthWrite:!1})}function dl(){return`
+
+		precision mediump float;
+		precision mediump int;
+
+		attribute vec3 outputDirection;
+
+		varying vec3 vOutputDirection;
+
+		void main() {
+
+			vOutputDirection = outputDirection;
+			gl_Position = vec4( position, 1.0 );
+
+		}
+	`}var hl=class extends gn{constructor(t=1,e={}){super(t,t,e),this.isWebGLCubeRenderTarget=!0;let n={width:t,height:t,depth:1},s=[n,n,n,n,n,n];this.texture=new _r(s),this._setTextureOptions(e),this.texture.isRenderTargetTexture=!0}fromEquirectangularTexture(t,e){this.texture.type=e.type,this.texture.colorSpace=e.colorSpace,this.texture.generateMipmaps=e.generateMipmaps,this.texture.minFilter=e.minFilter,this.texture.magFilter=e.magFilter;let n={uniforms:{tEquirect:{value:null}},vertexShader:`
+
+				varying vec3 vWorldDirection;
+
+				vec3 transformDirection( in vec3 dir, in mat4 matrix ) {
+
+					return normalize( ( matrix * vec4( dir, 0.0 ) ).xyz );
+
+				}
+
+				void main() {
+
+					vWorldDirection = transformDirection( position, modelMatrix );
+
+					#include <begin_vertex>
+					#include <project_vertex>
+
+				}
+			`,fragmentShader:`
+
+				uniform sampler2D tEquirect;
+
+				varying vec3 vWorldDirection;
+
+				#include <common>
+
+				void main() {
+
+					vec3 direction = normalize( vWorldDirection );
+
+					vec2 sampleUV = equirectUv( direction );
+
+					gl_FragColor = texture2D( tEquirect, sampleUV );
+
+				}
+			`},s=new ti(5,5,5),r=new Tn({name:"CubemapFromEquirect",uniforms:ls(n.uniforms),vertexShader:n.vertexShader,fragmentShader:n.fragmentShader,side:je,blending:ni});r.uniforms.tEquirect.value=e;let o=new Ue(s,r),a=e.minFilter;return e.minFilter===ki&&(e.minFilter=Je),new ma(1,10,this).update(t,o),e.minFilter=a,o.geometry.dispose(),o.material.dispose(),this}clear(t,e=!0,n=!0,s=!0){let r=t.getRenderTarget();for(let o=0;o<6;o++)t.setRenderTarget(this,o),t.clear(e,n,s);t.setRenderTarget(r)}};function Gg(i){let t=new WeakMap,e=new WeakMap,n=null;function s(u,d=!1){return u==null?null:d?o(u):r(u)}function r(u){if(u&&u.isTexture){let d=u.mapping;if(d===_a||d===ya)if(t.has(u)){let g=t.get(u).texture;return a(g,u.mapping)}else{let g=u.image;if(g&&g.height>0){let M=new hl(g.height);return M.fromEquirectangularTexture(i,u),t.set(u,M),u.addEventListener("dispose",c),a(M.texture,u.mapping)}else return null}}return u}function o(u){if(u&&u.isTexture){let d=u.mapping,g=d===_a||d===ya,M=d===zi||d===as;if(g||M){let m=e.get(u),p=m!==void 0?m.texture.pmremVersion:0;if(u.isRenderTargetTexture&&u.pmremVersion!==p)return n===null&&(n=new cl(i)),m=g?n.fromEquirectangular(u,m):n.fromCubemap(u,m),m.texture.pmremVersion=u.pmremVersion,e.set(u,m),m.texture;if(m!==void 0)return m.texture;{let T=u.image;return g&&T&&T.height>0||M&&T&&l(T)?(n===null&&(n=new cl(i)),m=g?n.fromEquirectangular(u):n.fromCubemap(u),m.texture.pmremVersion=u.pmremVersion,e.set(u,m),u.addEventListener("dispose",h),m.texture):null}}}return u}function a(u,d){return d===_a?u.mapping=zi:d===ya&&(u.mapping=as),u}function l(u){let d=0,g=6;for(let M=0;M<g;M++)u[M]!==void 0&&d++;return d===g}function c(u){let d=u.target;d.removeEventListener("dispose",c);let g=t.get(d);g!==void 0&&(t.delete(d),g.dispose())}function h(u){let d=u.target;d.removeEventListener("dispose",h);let g=e.get(d);g!==void 0&&(e.delete(d),g.dispose())}function f(){t=new WeakMap,e=new WeakMap,n!==null&&(n.dispose(),n=null)}return{get:s,dispose:f}}function Hg(i){let t={};function e(n){if(t[n]!==void 0)return t[n];let s=i.getExtension(n);return t[n]=s,s}return{has:function(n){return e(n)!==null},init:function(){e("EXT_color_buffer_float"),e("WEBGL_clip_cull_distance"),e("OES_texture_float_linear"),e("EXT_color_buffer_half_float"),e("WEBGL_multisampled_render_to_texture"),e("WEBGL_render_shared_exponent")},get:function(n){let s=e(n);return s===null&&es("WebGLRenderer: "+n+" extension not supported."),s}}}function Wg(i,t,e,n){let s={},r=new WeakMap;function o(f){let u=f.target;u.index!==null&&t.remove(u.index);for(let g in u.attributes)t.remove(u.attributes[g]);u.removeEventListener("dispose",o),delete s[u.id];let d=r.get(u);d&&(t.remove(d),r.delete(u)),n.releaseStatesOfGeometry(u),u.isInstancedBufferGeometry===!0&&delete u._maxInstanceCount,e.memory.geometries--}function a(f,u){return s[u.id]===!0||(u.addEventListener("dispose",o),s[u.id]=!0,e.memory.geometries++),u}function l(f){let u=f.attributes;for(let d in u)t.update(u[d],i.ARRAY_BUFFER)}function c(f){let u=[],d=f.index,g=f.attributes.position,M=0;if(g===void 0)return;if(d!==null){let T=d.array;M=d.version;for(let P=0,S=T.length;P<S;P+=3){let A=T[P+0],b=T[P+1],R=T[P+2];u.push(A,b,b,R,R,A)}}else{let T=g.array;M=g.version;for(let P=0,S=T.length/3-1;P<S;P+=3){let A=P+0,b=P+1,R=P+2;u.push(A,b,b,R,R,A)}}let m=new(g.count>=65535?xr:gr)(u,1);m.version=M;let p=r.get(f);p&&t.remove(p),r.set(f,m)}function h(f){let u=r.get(f);if(u){let d=f.index;d!==null&&u.version<d.version&&c(f)}else c(f);return r.get(f)}return{get:a,update:l,getWireframeAttribute:h}}function Xg(i,t,e){let n;function s(f){n=f}let r,o;function a(f){r=f.type,o=f.bytesPerElement}function l(f,u){i.drawElements(n,u,r,f*o),e.update(u,n,1)}function c(f,u,d){d!==0&&(i.drawElementsInstanced(n,u,r,f*o,d),e.update(u,n,d))}function h(f,u,d){if(d===0)return;t.get("WEBGL_multi_draw").multiDrawElementsWEBGL(n,u,0,r,f,0,d);let M=0;for(let m=0;m<d;m++)M+=u[m];e.update(M,n,1)}this.setMode=s,this.setIndex=a,this.render=l,this.renderInstances=c,this.renderMultiDraw=h}function qg(i){let t={geometries:0,textures:0},e={frame:0,calls:0,triangles:0,points:0,lines:0};function n(r,o,a){switch(e.calls++,o){case i.TRIANGLES:e.triangles+=a*(r/3);break;case i.LINES:e.lines+=a*(r/2);break;case i.LINE_STRIP:e.lines+=a*(r-1);break;case i.LINE_LOOP:e.lines+=a*r;break;case i.POINTS:e.points+=a*r;break;default:jt("WebGLInfo: Unknown draw mode:",o);break}}function s(){e.calls=0,e.triangles=0,e.points=0,e.lines=0}return{memory:t,render:e,programs:null,autoReset:!0,reset:s,update:n}}function Yg(i,t,e){let n=new WeakMap,s=new Le;function r(o,a,l){let c=o.morphTargetInfluences,h=a.morphAttributes.position||a.morphAttributes.normal||a.morphAttributes.color,f=h!==void 0?h.length:0,u=n.get(a);if(u===void 0||u.count!==f){let w=function(){R.dispose(),n.delete(a),a.removeEventListener("dispose",w)};u!==void 0&&u.texture.dispose();let d=a.morphAttributes.position!==void 0,g=a.morphAttributes.normal!==void 0,M=a.morphAttributes.color!==void 0,m=a.morphAttributes.position||[],p=a.morphAttributes.normal||[],T=a.morphAttributes.color||[],P=0;d===!0&&(P=1),g===!0&&(P=2),M===!0&&(P=3);let S=a.attributes.position.count*P,A=1;S>t.maxTextureSize&&(A=Math.ceil(S/t.maxTextureSize),S=t.maxTextureSize);let b=new Float32Array(S*A*4*f),R=new mr(b,S,A,f);R.type=Gn,R.needsUpdate=!0;let _=P*4;for(let L=0;L<f;L++){let D=m[L],B=p[L],G=T[L],N=S*A*4*L;for(let C=0;C<D.count;C++){let k=C*_;d===!0&&(s.fromBufferAttribute(D,C),b[N+k+0]=s.x,b[N+k+1]=s.y,b[N+k+2]=s.z,b[N+k+3]=0),g===!0&&(s.fromBufferAttribute(B,C),b[N+k+4]=s.x,b[N+k+5]=s.y,b[N+k+6]=s.z,b[N+k+7]=0),M===!0&&(s.fromBufferAttribute(G,C),b[N+k+8]=s.x,b[N+k+9]=s.y,b[N+k+10]=s.z,b[N+k+11]=G.itemSize===4?s.w:1)}}u={count:f,texture:R,size:new xt(S,A)},n.set(a,u),a.addEventListener("dispose",w)}if(o.isInstancedMesh===!0&&o.morphTexture!==null)l.getUniforms().setValue(i,"morphTexture",o.morphTexture,e);else{let d=0;for(let M=0;M<c.length;M++)d+=c[M];let g=a.morphTargetsRelative?1:1-d;l.getUniforms().setValue(i,"morphTargetBaseInfluence",g),l.getUniforms().setValue(i,"morphTargetInfluences",c)}l.getUniforms().setValue(i,"morphTargetsTexture",u.texture,e),l.getUniforms().setValue(i,"morphTargetsTextureSize",u.size)}return{update:r}}function Zg(i,t,e,n,s){let r=new WeakMap;function o(c){let h=s.render.frame,f=c.geometry,u=t.get(c,f);if(r.get(u)!==h&&(t.update(u),r.set(u,h)),c.isInstancedMesh&&(c.hasEventListener("dispose",l)===!1&&c.addEventListener("dispose",l),r.get(c)!==h&&(e.update(c.instanceMatrix,i.ARRAY_BUFFER),c.instanceColor!==null&&e.update(c.instanceColor,i.ARRAY_BUFFER),r.set(c,h))),c.isSkinnedMesh){let d=c.skeleton;r.get(d)!==h&&(d.update(),r.set(d,h))}return u}function a(){r=new WeakMap}function l(c){let h=c.target;h.removeEventListener("dispose",l),n.releaseStatesOfObject(h),e.remove(h.instanceMatrix),h.instanceColor!==null&&e.remove(h.instanceColor)}return{update:o,dispose:a}}var $g={[_c]:"LINEAR_TONE_MAPPING",[yc]:"REINHARD_TONE_MAPPING",[vc]:"CINEON_TONE_MAPPING",[Fr]:"ACES_FILMIC_TONE_MAPPING",[Sc]:"AGX_TONE_MAPPING",[bc]:"NEUTRAL_TONE_MAPPING",[Mc]:"CUSTOM_TONE_MAPPING"};function Jg(i,t,e,n,s,r){let o=new gn(t,e,{type:i,depthBuffer:s,stencilBuffer:r,samples:n?4:0,storeMultisampledDepthBuffer:!1,storeMultisampledStencilBuffer:!1,resolveDepthBuffer:!1,resolveStencilBuffer:!1}),a=null,l=null,c=new sn;c.setAttribute("position",new Oe([-1,3,0,-1,-1,0,3,-1,0],3)),c.setAttribute("uv",new Oe([0,2,0,0,2,0],2));let h=new ea({uniforms:{tDiffuse:{value:null}},vertexShader:`
+			precision highp float;
+
+			uniform mat4 modelViewMatrix;
+			uniform mat4 projectionMatrix;
+
+			attribute vec3 position;
+			attribute vec2 uv;
+
+			varying vec2 vUv;
+
+			void main() {
+				vUv = uv;
+				gl_Position = projectionMatrix * modelViewMatrix * vec4( position, 1.0 );
+			}`,fragmentShader:`
+			precision highp float;
+
+			uniform sampler2D tDiffuse;
+
+			varying vec2 vUv;
+
+			#include <tonemapping_pars_fragment>
+			#include <colorspace_pars_fragment>
+
+			void main() {
+				gl_FragColor = texture2D( tDiffuse, vUv );
+
+				#ifdef LINEAR_TONE_MAPPING
+					gl_FragColor.rgb = LinearToneMapping( gl_FragColor.rgb );
+				#elif defined( REINHARD_TONE_MAPPING )
+					gl_FragColor.rgb = ReinhardToneMapping( gl_FragColor.rgb );
+				#elif defined( CINEON_TONE_MAPPING )
+					gl_FragColor.rgb = CineonToneMapping( gl_FragColor.rgb );
+				#elif defined( ACES_FILMIC_TONE_MAPPING )
+					gl_FragColor.rgb = ACESFilmicToneMapping( gl_FragColor.rgb );
+				#elif defined( AGX_TONE_MAPPING )
+					gl_FragColor.rgb = AgXToneMapping( gl_FragColor.rgb );
+				#elif defined( NEUTRAL_TONE_MAPPING )
+					gl_FragColor.rgb = NeutralToneMapping( gl_FragColor.rgb );
+				#elif defined( CUSTOM_TONE_MAPPING )
+					gl_FragColor.rgb = CustomToneMapping( gl_FragColor.rgb );
+				#endif
+
+				#ifdef SRGB_TRANSFER
+					gl_FragColor = sRGBTransferOETF( gl_FragColor );
+				#endif
+			}`,depthTest:!1,depthWrite:!1}),f=new Ue(c,h),u=new mi(-1,1,1,-1,0,1),d=null,g=null,M=!1,m,p=null,T=[],P=!1;this.setSize=function(S,A){o.setSize(S,A),a!==null&&a.setSize(S,A),l!==null&&l.setSize(S,A);for(let b=0;b<T.length;b++){let R=T[b];R.setSize&&R.setSize(S,A)}},this.setEffects=function(S){T=S,P=T.length>0&&T[0].isRenderPass===!0;let A=o.width,b=o.height;T.length>0&&a===null&&(a=new gn(A,b,{type:Hn,depthBuffer:!1,stencilBuffer:!1}),l=new gn(A,b,{type:Hn,depthBuffer:!1,stencilBuffer:!1}));for(let R=0;R<T.length;R++){let _=T[R];_.setSize&&_.setSize(A,b)}},this.begin=function(S,A){if(M||S.toneMapping===kn&&T.length===0)return!1;if(p=A,A!==null){let b=A.width,R=A.height;(o.width!==b||o.height!==R)&&this.setSize(b,R)}return P===!1&&S.setRenderTarget(o),m=S.toneMapping,S.toneMapping=kn,!0},this.hasRenderPass=function(){return P},this.end=function(S,A){S.toneMapping=m,M=!0;let b=o,R=a;for(let _=0;_<T.length;_++){let w=T[_];w.enabled!==!1&&(w.render(S,R,b,A),w.needsSwap!==!1&&(b=R,R=R===a?l:a))}if(d!==S.outputColorSpace||g!==S.toneMapping){d=S.outputColorSpace,g=S.toneMapping,h.defines={},pe.getTransfer(d)===Me&&(h.defines.SRGB_TRANSFER="");let _=$g[g];_&&(h.defines[_]=""),h.needsUpdate=!0}h.uniforms.tDiffuse.value=b.texture,S.setRenderTarget(p),S.render(f,u),p=null,M=!1},this.isCompositing=function(){return M},this.dispose=function(){o.dispose(),a!==null&&a.dispose(),l!==null&&l.dispose(),c.dispose(),h.dispose()}}var rd=new mn,Yc=new Li(1,1),od=new mr,ad=new Ho,ld=new _r,ku=[],Vu=[],Gu=new Float32Array(16),Hu=new Float32Array(9),Wu=new Float32Array(4);function Js(i,t,e){let n=i[0];if(n<=0||n>0)return i;let s=t*e,r=ku[s];if(r===void 0&&(r=new Float32Array(s),ku[s]=r),t!==0){n.toArray(r,0);for(let o=1,a=0;o!==t;++o)a+=e,i[o].toArray(r,a)}return r}function We(i,t){if(i.length!==t.length)return!1;for(let e=0,n=i.length;e<n;e++)if(i[e]!==t[e])return!1;return!0}function Xe(i,t){for(let e=0,n=t.length;e<n;e++)i[e]=t[e]}function fl(i,t){let e=Vu[t];e===void 0&&(e=new Int32Array(t),Vu[t]=e);for(let n=0;n!==t;++n)e[n]=i.allocateTextureUnit();return e}function Kg(i,t){let e=this.cache;e[0]!==t&&(i.uniform1f(this.addr,t),e[0]=t)}function jg(i,t){let e=this.cache;if(t.x!==void 0)(e[0]!==t.x||e[1]!==t.y)&&(i.uniform2f(this.addr,t.x,t.y),e[0]=t.x,e[1]=t.y);else{if(We(e,t))return;i.uniform2fv(this.addr,t),Xe(e,t)}}function Qg(i,t){let e=this.cache;if(t.x!==void 0)(e[0]!==t.x||e[1]!==t.y||e[2]!==t.z)&&(i.uniform3f(this.addr,t.x,t.y,t.z),e[0]=t.x,e[1]=t.y,e[2]=t.z);else if(t.r!==void 0)(e[0]!==t.r||e[1]!==t.g||e[2]!==t.b)&&(i.uniform3f(this.addr,t.r,t.g,t.b),e[0]=t.r,e[1]=t.g,e[2]=t.b);else{if(We(e,t))return;i.uniform3fv(this.addr,t),Xe(e,t)}}function t0(i,t){let e=this.cache;if(t.x!==void 0)(e[0]!==t.x||e[1]!==t.y||e[2]!==t.z||e[3]!==t.w)&&(i.uniform4f(this.addr,t.x,t.y,t.z,t.w),e[0]=t.x,e[1]=t.y,e[2]=t.z,e[3]=t.w);else{if(We(e,t))return;i.uniform4fv(this.addr,t),Xe(e,t)}}function e0(i,t){let e=this.cache,n=t.elements;if(n===void 0){if(We(e,t))return;i.uniformMatrix2fv(this.addr,!1,t),Xe(e,t)}else{if(We(e,n))return;Wu.set(n),i.uniformMatrix2fv(this.addr,!1,Wu),Xe(e,n)}}function n0(i,t){let e=this.cache,n=t.elements;if(n===void 0){if(We(e,t))return;i.uniformMatrix3fv(this.addr,!1,t),Xe(e,t)}else{if(We(e,n))return;Hu.set(n),i.uniformMatrix3fv(this.addr,!1,Hu),Xe(e,n)}}function i0(i,t){let e=this.cache,n=t.elements;if(n===void 0){if(We(e,t))return;i.uniformMatrix4fv(this.addr,!1,t),Xe(e,t)}else{if(We(e,n))return;Gu.set(n),i.uniformMatrix4fv(this.addr,!1,Gu),Xe(e,n)}}function s0(i,t){let e=this.cache;e[0]!==t&&(i.uniform1i(this.addr,t),e[0]=t)}function r0(i,t){let e=this.cache;if(t.x!==void 0)(e[0]!==t.x||e[1]!==t.y)&&(i.uniform2i(this.addr,t.x,t.y),e[0]=t.x,e[1]=t.y);else{if(We(e,t))return;i.uniform2iv(this.addr,t),Xe(e,t)}}function o0(i,t){let e=this.cache;if(t.x!==void 0)(e[0]!==t.x||e[1]!==t.y||e[2]!==t.z)&&(i.uniform3i(this.addr,t.x,t.y,t.z),e[0]=t.x,e[1]=t.y,e[2]=t.z);else{if(We(e,t))return;i.uniform3iv(this.addr,t),Xe(e,t)}}function a0(i,t){let e=this.cache;if(t.x!==void 0)(e[0]!==t.x||e[1]!==t.y||e[2]!==t.z||e[3]!==t.w)&&(i.uniform4i(this.addr,t.x,t.y,t.z,t.w),e[0]=t.x,e[1]=t.y,e[2]=t.z,e[3]=t.w);else{if(We(e,t))return;i.uniform4iv(this.addr,t),Xe(e,t)}}function l0(i,t){let e=this.cache;e[0]!==t&&(i.uniform1ui(this.addr,t),e[0]=t)}function c0(i,t){let e=this.cache;if(t.x!==void 0)(e[0]!==t.x||e[1]!==t.y)&&(i.uniform2ui(this.addr,t.x,t.y),e[0]=t.x,e[1]=t.y);else{if(We(e,t))return;i.uniform2uiv(this.addr,t),Xe(e,t)}}function h0(i,t){let e=this.cache;if(t.x!==void 0)(e[0]!==t.x||e[1]!==t.y||e[2]!==t.z)&&(i.uniform3ui(this.addr,t.x,t.y,t.z),e[0]=t.x,e[1]=t.y,e[2]=t.z);else{if(We(e,t))return;i.uniform3uiv(this.addr,t),Xe(e,t)}}function u0(i,t){let e=this.cache;if(t.x!==void 0)(e[0]!==t.x||e[1]!==t.y||e[2]!==t.z||e[3]!==t.w)&&(i.uniform4ui(this.addr,t.x,t.y,t.z,t.w),e[0]=t.x,e[1]=t.y,e[2]=t.z,e[3]=t.w);else{if(We(e,t))return;i.uniform4uiv(this.addr,t),Xe(e,t)}}function d0(i,t,e){let n=this.cache,s=e.allocateTextureUnit();n[0]!==s&&(i.uniform1i(this.addr,s),n[0]=s);let r;this.type===i.SAMPLER_2D_SHADOW?(Yc.compareFunction=e.isReversedDepthBuffer()?ol:rl,r=Yc):r=rd,e.setTexture2D(t||r,s)}function f0(i,t,e){let n=this.cache,s=e.allocateTextureUnit();n[0]!==s&&(i.uniform1i(this.addr,s),n[0]=s),e.setTexture3D(t||ad,s)}function p0(i,t,e){let n=this.cache,s=e.allocateTextureUnit();n[0]!==s&&(i.uniform1i(this.addr,s),n[0]=s),e.setTextureCube(t||ld,s)}function m0(i,t,e){let n=this.cache,s=e.allocateTextureUnit();n[0]!==s&&(i.uniform1i(this.addr,s),n[0]=s),e.setTexture2DArray(t||od,s)}function g0(i){switch(i){case 5126:return Kg;case 35664:return jg;case 35665:return Qg;case 35666:return t0;case 35674:return e0;case 35675:return n0;case 35676:return i0;case 5124:case 35670:return s0;case 35667:case 35671:return r0;case 35668:case 35672:return o0;case 35669:case 35673:return a0;case 5125:return l0;case 36294:return c0;case 36295:return h0;case 36296:return u0;case 35678:case 36198:case 36298:case 36306:case 35682:return d0;case 35679:case 36299:case 36307:return f0;case 35680:case 36300:case 36308:case 36293:return p0;case 36289:case 36303:case 36311:case 36292:return m0}}function x0(i,t){i.uniform1fv(this.addr,t)}function _0(i,t){let e=Js(t,this.size,2);i.uniform2fv(this.addr,e)}function y0(i,t){let e=Js(t,this.size,3);i.uniform3fv(this.addr,e)}function v0(i,t){let e=Js(t,this.size,4);i.uniform4fv(this.addr,e)}function M0(i,t){let e=Js(t,this.size,4);i.uniformMatrix2fv(this.addr,!1,e)}function S0(i,t){let e=Js(t,this.size,9);i.uniformMatrix3fv(this.addr,!1,e)}function b0(i,t){let e=Js(t,this.size,16);i.uniformMatrix4fv(this.addr,!1,e)}function w0(i,t){i.uniform1iv(this.addr,t)}function T0(i,t){i.uniform2iv(this.addr,t)}function E0(i,t){i.uniform3iv(this.addr,t)}function A0(i,t){i.uniform4iv(this.addr,t)}function C0(i,t){i.uniform1uiv(this.addr,t)}function R0(i,t){i.uniform2uiv(this.addr,t)}function I0(i,t){i.uniform3uiv(this.addr,t)}function P0(i,t){i.uniform4uiv(this.addr,t)}function L0(i,t,e){let n=this.cache,s=t.length,r=fl(e,s);We(n,r)||(i.uniform1iv(this.addr,r),Xe(n,r));let o;this.type===i.SAMPLER_2D_SHADOW?o=Yc:o=rd;for(let a=0;a!==s;++a)e.setTexture2D(t[a]||o,r[a])}function D0(i,t,e){let n=this.cache,s=t.length,r=fl(e,s);We(n,r)||(i.uniform1iv(this.addr,r),Xe(n,r));for(let o=0;o!==s;++o)e.setTexture3D(t[o]||ad,r[o])}function N0(i,t,e){let n=this.cache,s=t.length,r=fl(e,s);We(n,r)||(i.uniform1iv(this.addr,r),Xe(n,r));for(let o=0;o!==s;++o)e.setTextureCube(t[o]||ld,r[o])}function U0(i,t,e){let n=this.cache,s=t.length,r=fl(e,s);We(n,r)||(i.uniform1iv(this.addr,r),Xe(n,r));for(let o=0;o!==s;++o)e.setTexture2DArray(t[o]||od,r[o])}function F0(i){switch(i){case 5126:return x0;case 35664:return _0;case 35665:return y0;case 35666:return v0;case 35674:return M0;case 35675:return S0;case 35676:return b0;case 5124:case 35670:return w0;case 35667:case 35671:return T0;case 35668:case 35672:return E0;case 35669:case 35673:return A0;case 5125:return C0;case 36294:return R0;case 36295:return I0;case 36296:return P0;case 35678:case 36198:case 36298:case 36306:case 35682:return L0;case 35679:case 36299:case 36307:return D0;case 35680:case 36300:case 36308:case 36293:return N0;case 36289:case 36303:case 36311:case 36292:return U0}}var Zc=class{constructor(t,e,n){this.id=t,this.addr=n,this.cache=[],this.type=e.type,this.setValue=g0(e.type)}},$c=class{constructor(t,e,n){this.id=t,this.addr=n,this.cache=[],this.type=e.type,this.size=e.size,this.setValue=F0(e.type)}},Jc=class{constructor(t){this.id=t,this.seq=[],this.map={}}setValue(t,e,n){let s=this.seq;for(let r=0,o=s.length;r!==o;++r){let a=s[r];a.setValue(t,e[a.id],n)}}},Xc=/(\w+)(\])?(\[|\.)?/g;function Xu(i,t){i.seq.push(t),i.map[t.id]=t}function O0(i,t,e){let n=i.name,s=n.length;for(Xc.lastIndex=0;;){let r=Xc.exec(n),o=Xc.lastIndex,a=r[1],l=r[2]==="]",c=r[3];if(l&&(a=a|0),c===void 0||c==="["&&o+2===s){Xu(e,c===void 0?new Zc(a,i,t):new $c(a,i,t));break}else{let f=e.map[a];f===void 0&&(f=new Jc(a),Xu(e,f)),e=f}}}var $s=class{constructor(t,e){this.seq=[],this.map={};let n=t.getProgramParameter(e,t.ACTIVE_UNIFORMS);for(let o=0;o<n;++o){let a=t.getActiveUniform(e,o),l=t.getUniformLocation(e,a.name);O0(a,l,this)}let s=[],r=[];for(let o of this.seq)o.type===t.SAMPLER_2D_SHADOW||o.type===t.SAMPLER_CUBE_SHADOW||o.type===t.SAMPLER_2D_ARRAY_SHADOW?s.push(o):r.push(o);s.length>0&&(this.seq=s.concat(r))}setValue(t,e,n,s){let r=this.map[e];r!==void 0&&r.setValue(t,n,s)}setOptional(t,e,n){let s=e[n];s!==void 0&&this.setValue(t,n,s)}static upload(t,e,n,s){for(let r=0,o=e.length;r!==o;++r){let a=e[r],l=n[a.id];l.needsUpdate!==!1&&a.setValue(t,l.value,s)}}static seqWithValue(t,e){let n=[];for(let s=0,r=t.length;s!==r;++s){let o=t[s];o.id in e&&n.push(o)}return n}};function qu(i,t,e){let n=i.createShader(t);return i.shaderSource(n,e),i.compileShader(n),n}var B0=37297,z0=0;function k0(i,t){let e=i.split(`
+`),n=[],s=Math.max(t-6,0),r=Math.min(t+6,e.length);for(let o=s;o<r;o++){let a=o+1;n.push(`${a===t?">":" "} ${a}: ${e[o]}`)}return n.join(`
+`)}var Yu=new ie;function V0(i){pe._getMatrix(Yu,pe.workingColorSpace,i);let t=`mat3( ${Yu.elements.map(e=>e.toFixed(4))} )`;switch(pe.getTransfer(i)){case fr:return[t,"LinearTransferOETF"];case Me:return[t,"sRGBTransferOETF"];default:return Jt("WebGLProgram: Unsupported color space: ",i),[t,"LinearTransferOETF"]}}function Zu(i,t,e){let n=i.getShaderParameter(t,i.COMPILE_STATUS),r=(i.getShaderInfoLog(t)||"").trim();if(n&&r==="")return"";let o=/ERROR: 0:(\d+)/.exec(r);if(o){let a=parseInt(o[1]);return e.toUpperCase()+`
+
+`+r+`
+
+`+k0(i.getShaderSource(t),a)}else return r}function G0(i,t){let e=V0(t);return[`vec4 ${i}( vec4 value ) {`,`	return ${e[1]}( vec4( value.rgb * ${e[0]}, value.a ) );`,"}"].join(`
+`)}var H0={[_c]:"Linear",[yc]:"Reinhard",[vc]:"Cineon",[Fr]:"ACESFilmic",[Sc]:"AgX",[bc]:"Neutral",[Mc]:"Custom"};function W0(i,t){let e=H0[t];return e===void 0?(Jt("WebGLProgram: Unsupported toneMapping:",t),"vec3 "+i+"( vec3 color ) { return LinearToneMapping( color ); }"):"vec3 "+i+"( vec3 color ) { return "+e+"ToneMapping( color ); }"}var ll=new O;function X0(){pe.getLuminanceCoefficients(ll);let i=ll.x.toFixed(4),t=ll.y.toFixed(4),e=ll.z.toFixed(4);return["float luminance( const in vec3 rgb ) {",`	const vec3 weights = vec3( ${i}, ${t}, ${e} );`,"	return dot( weights, rgb );","}"].join(`
+`)}function q0(i){return[i.extensionClipCullDistance?"#extension GL_ANGLE_clip_cull_distance : require":"",i.extensionMultiDraw?"#extension GL_ANGLE_multi_draw : require":""].filter(Yr).join(`
+`)}function Y0(i){let t=[];for(let e in i){let n=i[e];n!==!1&&t.push("#define "+e+" "+n)}return t.join(`
+`)}function Z0(i,t){let e={},n=i.getProgramParameter(t,i.ACTIVE_ATTRIBUTES);for(let s=0;s<n;s++){let r=i.getActiveAttrib(t,s),o=r.name,a=1;r.type===i.FLOAT_MAT2&&(a=2),r.type===i.FLOAT_MAT3&&(a=3),r.type===i.FLOAT_MAT4&&(a=4),e[o]={type:r.type,location:i.getAttribLocation(t,o),locationSize:a}}return e}function Yr(i){return i!==""}function $u(i,t){let e=t.numSpotLightShadows+t.numSpotLightMaps-t.numSpotLightShadowsWithMaps;return i.replace(/NUM_SUN_LIGHTS/g,t.numSunLights).replace(/NUM_DIR_LIGHTS/g,t.numDirLights).replace(/NUM_SPOT_LIGHTS/g,t.numSpotLights).replace(/NUM_SPOT_LIGHT_MAPS/g,t.numSpotLightMaps).replace(/NUM_SPOT_LIGHT_COORDS/g,e).replace(/NUM_RECT_AREA_LIGHTS/g,t.numRectAreaLights).replace(/NUM_POINT_LIGHTS/g,t.numPointLights).replace(/NUM_HEMI_LIGHTS/g,t.numHemiLights).replace(/NUM_SUN_LIGHT_SHADOWS/g,t.numSunLightShadows).replace(/NUM_DIR_LIGHT_SHADOWS/g,t.numDirLightShadows).replace(/NUM_SPOT_LIGHT_SHADOWS_WITH_MAPS/g,t.numSpotLightShadowsWithMaps).replace(/NUM_SPOT_LIGHT_SHADOWS/g,t.numSpotLightShadows).replace(/NUM_POINT_LIGHT_SHADOWS/g,t.numPointLightShadows)}function Ju(i,t){return i.replace(/NUM_CLIPPING_PLANES/g,t.numClippingPlanes).replace(/UNION_CLIPPING_PLANES/g,t.numClippingPlanes-t.numClipIntersection)}var $0=/^[ \t]*#include +<([\w\d./]+)>/gm;function Kc(i){return i.replace($0,K0)}var J0=new Map;function K0(i,t){let e=oe[t];if(e===void 0){let n=J0.get(t);if(n!==void 0)e=oe[n],Jt('WebGLRenderer: Shader chunk "%s" has been deprecated. Use "%s" instead.',t,n);else throw new Error("THREE.WebGLProgram: Can not resolve #include <"+t+">")}return Kc(e)}var j0=/#pragma unroll_loop_start\s+for\s*\(\s*int\s+i\s*=\s*(\d+)\s*;\s*i\s*<\s*(\d+)\s*;\s*i\s*\+\+\s*\)\s*{([\s\S]+?)}\s+#pragma unroll_loop_end/g;function Ku(i){return i.replace(j0,Q0)}function Q0(i,t,e,n){let s="";for(let r=parseInt(t);r<parseInt(e);r++)s+=n.replace(/\[\s*i\s*\]/g,"[ "+r+" ]").replace(/UNROLLED_LOOP_INDEX/g,r);return s}function ju(i){let t=`precision ${i.precision} float;
+	precision ${i.precision} int;
+	precision ${i.precision} sampler2D;
+	precision ${i.precision} samplerCube;
+	precision ${i.precision} sampler3D;
+	precision ${i.precision} sampler2DArray;
+	precision ${i.precision} sampler2DShadow;
+	precision ${i.precision} samplerCubeShadow;
+	precision ${i.precision} sampler2DArrayShadow;
+	precision ${i.precision} isampler2D;
+	precision ${i.precision} isampler3D;
+	precision ${i.precision} isamplerCube;
+	precision ${i.precision} isampler2DArray;
+	precision ${i.precision} usampler2D;
+	precision ${i.precision} usampler3D;
+	precision ${i.precision} usamplerCube;
+	precision ${i.precision} usampler2DArray;
+	`;return i.precision==="highp"?t+=`
+#define HIGH_PRECISION`:i.precision==="mediump"?t+=`
+#define MEDIUM_PRECISION`:i.precision==="lowp"&&(t+=`
+#define LOW_PRECISION`),t}var tx={[Ur]:"SHADOWMAP_TYPE_PCF",[Gs]:"SHADOWMAP_TYPE_VSM"};function ex(i){return tx[i.shadowMapType]||"SHADOWMAP_TYPE_BASIC"}var nx={[zi]:"ENVMAP_TYPE_CUBE",[as]:"ENVMAP_TYPE_CUBE",[Or]:"ENVMAP_TYPE_CUBE_UV"};function ix(i){return i.envMap===!1?"ENVMAP_TYPE_CUBE":nx[i.envMapMode]||"ENVMAP_TYPE_CUBE"}var sx={[as]:"ENVMAP_MODE_REFRACTION"};function rx(i){return i.envMap===!1?"ENVMAP_MODE_REFLECTION":sx[i.envMapMode]||"ENVMAP_MODE_REFLECTION"}var ox={[xc]:"ENVMAP_BLENDING_MULTIPLY",[du]:"ENVMAP_BLENDING_MIX",[fu]:"ENVMAP_BLENDING_ADD"};function ax(i){return i.envMap===!1?"ENVMAP_BLENDING_NONE":ox[i.combine]||"ENVMAP_BLENDING_NONE"}function lx(i){let t=i.envMapCubeUVHeight;if(t===null)return null;let e=Math.log2(t)-2,n=1/t;return{texelWidth:1/(3*Math.max(Math.pow(2,e),112)),texelHeight:n,maxMip:e}}function cx(i,t,e,n){let s=i.getContext(),r=e.defines,o=e.vertexShader,a=e.fragmentShader,l=ex(e),c=ix(e),h=rx(e),f=ax(e),u=lx(e),d=q0(e),g=Y0(r),M=s.createProgram(),m,p,T=e.glslVersion?"#version "+e.glslVersion+`
+`:"";e.isRawShaderMaterial?(m=["#define SHADER_TYPE "+e.shaderType,"#define SHADER_NAME "+e.shaderName,g].filter(Yr).join(`
+`),m.length>0&&(m+=`
+`),p=["#define SHADER_TYPE "+e.shaderType,"#define SHADER_NAME "+e.shaderName,g].filter(Yr).join(`
+`),p.length>0&&(p+=`
+`)):(m=[ju(e),"#define SHADER_TYPE "+e.shaderType,"#define SHADER_NAME "+e.shaderName,g,e.extensionClipCullDistance?"#define USE_CLIP_DISTANCE":"",e.batching?"#define USE_BATCHING":"",e.batchingColor?"#define USE_BATCHING_COLOR":"",e.instancing?"#define USE_INSTANCING":"",e.instancingColor?"#define USE_INSTANCING_COLOR":"",e.instancingMorph?"#define USE_INSTANCING_MORPH":"",e.useFog&&e.fog?"#define USE_FOG":"",e.useFog&&e.fogExp2?"#define FOG_EXP2":"",e.map?"#define USE_MAP":"",e.envMap?"#define USE_ENVMAP":"",e.envMap?"#define "+h:"",e.lightMap?"#define USE_LIGHTMAP":"",e.aoMap?"#define USE_AOMAP":"",e.bumpMap?"#define USE_BUMPMAP":"",e.normalMap?"#define USE_NORMALMAP":"",e.normalMapObjectSpace?"#define USE_NORMALMAP_OBJECTSPACE":"",e.normalMapTangentSpace?"#define USE_NORMALMAP_TANGENTSPACE":"",e.displacementMap?"#define USE_DISPLACEMENTMAP":"",e.emissiveMap?"#define USE_EMISSIVEMAP":"",e.anisotropy?"#define USE_ANISOTROPY":"",e.anisotropyMap?"#define USE_ANISOTROPYMAP":"",e.clearcoatMap?"#define USE_CLEARCOATMAP":"",e.clearcoatRoughnessMap?"#define USE_CLEARCOAT_ROUGHNESSMAP":"",e.clearcoatNormalMap?"#define USE_CLEARCOAT_NORMALMAP":"",e.iridescenceMap?"#define USE_IRIDESCENCEMAP":"",e.iridescenceThicknessMap?"#define USE_IRIDESCENCE_THICKNESSMAP":"",e.specularMap?"#define USE_SPECULARMAP":"",e.specularColorMap?"#define USE_SPECULAR_COLORMAP":"",e.specularIntensityMap?"#define USE_SPECULAR_INTENSITYMAP":"",e.roughnessMap?"#define USE_ROUGHNESSMAP":"",e.metalnessMap?"#define USE_METALNESSMAP":"",e.alphaMap?"#define USE_ALPHAMAP":"",e.alphaHash?"#define USE_ALPHAHASH":"",e.transmission?"#define USE_TRANSMISSION":"",e.transmissionMap?"#define USE_TRANSMISSIONMAP":"",e.thicknessMap?"#define USE_THICKNESSMAP":"",e.sheenColorMap?"#define USE_SHEEN_COLORMAP":"",e.sheenRoughnessMap?"#define USE_SHEEN_ROUGHNESSMAP":"",e.mapUv?"#define MAP_UV "+e.mapUv:"",e.alphaMapUv?"#define ALPHAMAP_UV "+e.alphaMapUv:"",e.lightMapUv?"#define LIGHTMAP_UV "+e.lightMapUv:"",e.aoMapUv?"#define AOMAP_UV "+e.aoMapUv:"",e.emissiveMapUv?"#define EMISSIVEMAP_UV "+e.emissiveMapUv:"",e.bumpMapUv?"#define BUMPMAP_UV "+e.bumpMapUv:"",e.normalMapUv?"#define NORMALMAP_UV "+e.normalMapUv:"",e.displacementMapUv?"#define DISPLACEMENTMAP_UV "+e.displacementMapUv:"",e.metalnessMapUv?"#define METALNESSMAP_UV "+e.metalnessMapUv:"",e.roughnessMapUv?"#define ROUGHNESSMAP_UV "+e.roughnessMapUv:"",e.anisotropyMapUv?"#define ANISOTROPYMAP_UV "+e.anisotropyMapUv:"",e.clearcoatMapUv?"#define CLEARCOATMAP_UV "+e.clearcoatMapUv:"",e.clearcoatNormalMapUv?"#define CLEARCOAT_NORMALMAP_UV "+e.clearcoatNormalMapUv:"",e.clearcoatRoughnessMapUv?"#define CLEARCOAT_ROUGHNESSMAP_UV "+e.clearcoatRoughnessMapUv:"",e.iridescenceMapUv?"#define IRIDESCENCEMAP_UV "+e.iridescenceMapUv:"",e.iridescenceThicknessMapUv?"#define IRIDESCENCE_THICKNESSMAP_UV "+e.iridescenceThicknessMapUv:"",e.sheenColorMapUv?"#define SHEEN_COLORMAP_UV "+e.sheenColorMapUv:"",e.sheenRoughnessMapUv?"#define SHEEN_ROUGHNESSMAP_UV "+e.sheenRoughnessMapUv:"",e.specularMapUv?"#define SPECULARMAP_UV "+e.specularMapUv:"",e.specularColorMapUv?"#define SPECULAR_COLORMAP_UV "+e.specularColorMapUv:"",e.specularIntensityMapUv?"#define SPECULAR_INTENSITYMAP_UV "+e.specularIntensityMapUv:"",e.transmissionMapUv?"#define TRANSMISSIONMAP_UV "+e.transmissionMapUv:"",e.thicknessMapUv?"#define THICKNESSMAP_UV "+e.thicknessMapUv:"",e.vertexTangents&&e.flatShading===!1?"#define USE_TANGENT":"",e.vertexNormals?"#define HAS_NORMAL":"",e.vertexColors?"#define USE_COLOR":"",e.vertexAlphas?"#define USE_COLOR_ALPHA":"",e.vertexUv1s?"#define USE_UV1":"",e.vertexUv2s?"#define USE_UV2":"",e.vertexUv3s?"#define USE_UV3":"",e.pointsUvs?"#define USE_POINTS_UV":"",e.flatShading?"#define FLAT_SHADED":"",e.skinning?"#define USE_SKINNING":"",e.morphTargets?"#define USE_MORPHTARGETS":"",e.morphNormals&&e.flatShading===!1?"#define USE_MORPHNORMALS":"",e.morphColors?"#define USE_MORPHCOLORS":"",e.morphTargetsCount>0?"#define MORPHTARGETS_TEXTURE_STRIDE "+e.morphTextureStride:"",e.morphTargetsCount>0?"#define MORPHTARGETS_COUNT "+e.morphTargetsCount:"",e.doubleSided?"#define DOUBLE_SIDED":"",e.flipSided?"#define FLIP_SIDED":"",e.shadowMapEnabled?"#define USE_SHADOWMAP":"",e.shadowMapEnabled?"#define "+l:"",e.sizeAttenuation?"#define USE_SIZEATTENUATION":"",e.numLightProbes>0?"#define USE_LIGHT_PROBES":"",e.logarithmicDepthBuffer?"#define USE_LOGARITHMIC_DEPTH_BUFFER":"",e.reversedDepthBuffer?"#define USE_REVERSED_DEPTH_BUFFER":"","uniform mat4 modelMatrix;","uniform mat4 modelViewMatrix;","uniform mat4 projectionMatrix;","uniform mat4 viewMatrix;","uniform mat3 normalMatrix;","uniform vec3 cameraPosition;","uniform bool isOrthographic;","#ifdef USE_INSTANCING","	attribute mat4 instanceMatrix;","#endif","#ifdef USE_INSTANCING_COLOR","	attribute vec3 instanceColor;","#endif","#ifdef USE_INSTANCING_MORPH","	uniform sampler2D morphTexture;","#endif","attribute vec3 position;","attribute vec3 normal;","attribute vec2 uv;","#ifdef USE_UV1","	attribute vec2 uv1;","#endif","#ifdef USE_UV2","	attribute vec2 uv2;","#endif","#ifdef USE_UV3","	attribute vec2 uv3;","#endif","#ifdef USE_TANGENT","	attribute vec4 tangent;","#endif","#if defined( USE_COLOR_ALPHA )","	attribute vec4 color;","#elif defined( USE_COLOR )","	attribute vec3 color;","#endif","#ifdef USE_SKINNING","	attribute vec4 skinIndex;","	attribute vec4 skinWeight;","#endif",`
+`].filter(Yr).join(`
+`),p=[ju(e),"#define SHADER_TYPE "+e.shaderType,"#define SHADER_NAME "+e.shaderName,g,e.useFog&&e.fog?"#define USE_FOG":"",e.useFog&&e.fogExp2?"#define FOG_EXP2":"",e.alphaToCoverage?"#define ALPHA_TO_COVERAGE":"",e.map?"#define USE_MAP":"",e.matcap?"#define USE_MATCAP":"",e.envMap?"#define USE_ENVMAP":"",e.envMap?"#define "+c:"",e.envMap?"#define "+h:"",e.envMap?"#define "+f:"",u?"#define CUBEUV_TEXEL_WIDTH "+u.texelWidth:"",u?"#define CUBEUV_TEXEL_HEIGHT "+u.texelHeight:"",u?"#define CUBEUV_MAX_MIP "+u.maxMip+".0":"",e.lightMap?"#define USE_LIGHTMAP":"",e.aoMap?"#define USE_AOMAP":"",e.bumpMap?"#define USE_BUMPMAP":"",e.normalMap?"#define USE_NORMALMAP":"",e.normalMapObjectSpace?"#define USE_NORMALMAP_OBJECTSPACE":"",e.normalMapTangentSpace?"#define USE_NORMALMAP_TANGENTSPACE":"",e.packedNormalMap?"#define USE_PACKED_NORMALMAP":"",e.emissiveMap?"#define USE_EMISSIVEMAP":"",e.anisotropy?"#define USE_ANISOTROPY":"",e.anisotropyMap?"#define USE_ANISOTROPYMAP":"",e.clearcoat?"#define USE_CLEARCOAT":"",e.clearcoatMap?"#define USE_CLEARCOATMAP":"",e.clearcoatRoughnessMap?"#define USE_CLEARCOAT_ROUGHNESSMAP":"",e.clearcoatNormalMap?"#define USE_CLEARCOAT_NORMALMAP":"",e.dispersion?"#define USE_DISPERSION":"",e.retroreflection?"#define USE_RETROREFLECTION":"",e.iridescence?"#define USE_IRIDESCENCE":"",e.iridescenceMap?"#define USE_IRIDESCENCEMAP":"",e.iridescenceThicknessMap?"#define USE_IRIDESCENCE_THICKNESSMAP":"",e.specularMap?"#define USE_SPECULARMAP":"",e.specularColorMap?"#define USE_SPECULAR_COLORMAP":"",e.specularIntensityMap?"#define USE_SPECULAR_INTENSITYMAP":"",e.roughnessMap?"#define USE_ROUGHNESSMAP":"",e.metalnessMap?"#define USE_METALNESSMAP":"",e.alphaMap?"#define USE_ALPHAMAP":"",e.alphaTest?"#define USE_ALPHATEST":"",e.alphaHash?"#define USE_ALPHAHASH":"",e.sheen?"#define USE_SHEEN":"",e.sheenColorMap?"#define USE_SHEEN_COLORMAP":"",e.sheenRoughnessMap?"#define USE_SHEEN_ROUGHNESSMAP":"",e.transmission?"#define USE_TRANSMISSION":"",e.transmissionMap?"#define USE_TRANSMISSIONMAP":"",e.thicknessMap?"#define USE_THICKNESSMAP":"",e.vertexTangents&&e.flatShading===!1?"#define USE_TANGENT":"",e.vertexColors||e.instancingColor?"#define USE_COLOR":"",e.vertexAlphas||e.batchingColor?"#define USE_COLOR_ALPHA":"",e.vertexUv1s?"#define USE_UV1":"",e.vertexUv2s?"#define USE_UV2":"",e.vertexUv3s?"#define USE_UV3":"",e.pointsUvs?"#define USE_POINTS_UV":"",e.gradientMap?"#define USE_GRADIENTMAP":"",e.flatShading?"#define FLAT_SHADED":"",e.doubleSided?"#define DOUBLE_SIDED":"",e.flipSided?"#define FLIP_SIDED":"",e.shadowMapEnabled?"#define USE_SHADOWMAP":"",e.shadowMapEnabled?"#define "+l:"",e.premultipliedAlpha?"#define PREMULTIPLIED_ALPHA":"",e.numLightProbes>0?"#define USE_LIGHT_PROBES":"",e.numLightProbeGrids>0?"#define USE_LIGHT_PROBES_GRID":"",e.decodeVideoTexture?"#define DECODE_VIDEO_TEXTURE":"",e.decodeVideoTextureEmissive?"#define DECODE_VIDEO_TEXTURE_EMISSIVE":"",e.logarithmicDepthBuffer?"#define USE_LOGARITHMIC_DEPTH_BUFFER":"",e.reversedDepthBuffer?"#define USE_REVERSED_DEPTH_BUFFER":"","uniform mat4 viewMatrix;","uniform vec3 cameraPosition;","uniform bool isOrthographic;",e.toneMapping!==kn?"#define TONE_MAPPING":"",e.toneMapping!==kn?oe.tonemapping_pars_fragment:"",e.toneMapping!==kn?W0("toneMapping",e.toneMapping):"",e.dithering?"#define DITHERING":"",e.opaque?"#define OPAQUE":"",oe.colorspace_pars_fragment,G0("linearToOutputTexel",e.outputColorSpace),X0(),e.useDepthPacking?"#define DEPTH_PACKING "+e.depthPacking:"",`
+`].filter(Yr).join(`
+`)),o=Kc(o),o=$u(o,e),o=Ju(o,e),a=Kc(a),a=$u(a,e),a=Ju(a,e),o=Ku(o),a=Ku(a),e.isRawShaderMaterial!==!0&&(T=`#version 300 es
+`,m=[d,"#define attribute in","#define varying out","#define texture2D texture"].join(`
+`)+`
+`+m,p=["#define varying in",e.glslVersion===Nc?"":"layout(location = 0) out highp vec4 pc_fragColor;",e.glslVersion===Nc?"":"#define gl_FragColor pc_fragColor","#define gl_FragDepthEXT gl_FragDepth","#define texture2D texture","#define textureCube texture","#define texture2DProj textureProj","#define texture2DLodEXT textureLod","#define texture2DProjLodEXT textureProjLod","#define textureCubeLodEXT textureLod","#define texture2DGradEXT textureGrad","#define texture2DProjGradEXT textureProjGrad","#define textureCubeGradEXT textureGrad"].join(`
+`)+`
+`+p);let P=T+m+o,S=T+p+a,A=qu(s,s.VERTEX_SHADER,P),b=qu(s,s.FRAGMENT_SHADER,S);s.attachShader(M,A),s.attachShader(M,b),e.index0AttributeName!==void 0?s.bindAttribLocation(M,0,e.index0AttributeName):e.hasPositionAttribute===!0&&s.bindAttribLocation(M,0,"position"),s.linkProgram(M);function R(D){if(i.debug.checkShaderErrors){let B=s.getProgramInfoLog(M)||"",G=s.getShaderInfoLog(A)||"",N=s.getShaderInfoLog(b)||"",C=B.trim(),k=G.trim(),V=N.trim(),j=!0,W=!0;if(s.getProgramParameter(M,s.LINK_STATUS)===!1)if(j=!1,typeof i.debug.onShaderError=="function")i.debug.onShaderError(s,M,A,b);else{let J=Zu(s,A,"vertex"),et=Zu(s,b,"fragment");jt("WebGLProgram: Shader Error "+s.getError()+" - VALIDATE_STATUS "+s.getProgramParameter(M,s.VALIDATE_STATUS)+`
+
+Material Name: `+D.name+`
+Material Type: `+D.type+`
+
+Program Info Log: `+C+`
+`+J+`
+`+et)}else C!==""?Jt("WebGLProgram: Program Info Log:",C):(k===""||V==="")&&(W=!1);W&&(D.diagnostics={runnable:j,programLog:C,vertexShader:{log:k,prefix:m},fragmentShader:{log:V,prefix:p}})}s.deleteShader(A),s.deleteShader(b),_=new $s(s,M),w=Z0(s,M)}let _;this.getUniforms=function(){return _===void 0&&R(this),_};let w;this.getAttributes=function(){return w===void 0&&R(this),w};let L=e.rendererExtensionParallelShaderCompile===!1;return this.isReady=function(){return L===!1&&(L=s.getProgramParameter(M,B0)),L},this.destroy=function(){n.releaseStatesOfProgram(this),s.deleteProgram(M),this.program=void 0},this.type=e.shaderType,this.name=e.shaderName,this.id=z0++,this.cacheKey=t,this.usedTimes=1,this.program=M,this.vertexShader=A,this.fragmentShader=b,this}var hx=0,jc=class{constructor(){this.shaderCache=new Map,this.materialCache=new Map}update(t,e,n){let s=this._getShaderCacheForMaterial(t);return s.has(e)===!1&&(s.add(e),e.usedTimes++),s.has(n)===!1&&(s.add(n),n.usedTimes++),this}remove(t){let e=this.materialCache.get(t);for(let n of e)n.usedTimes--,n.usedTimes===0&&this.shaderCache.delete(n.code);return this.materialCache.delete(t),this}getVertexShaderStage(t){return this._getShaderStage(t.vertexShader)}getFragmentShaderStage(t){return this._getShaderStage(t.fragmentShader)}dispose(){this.shaderCache.clear(),this.materialCache.clear()}_getShaderCacheForMaterial(t){let e=this.materialCache,n=e.get(t);return n===void 0&&(n=new Set,e.set(t,n)),n}_getShaderStage(t){let e=this.shaderCache,n=e.get(t);return n===void 0&&(n=new Qc(t),e.set(t,n)),n}},Qc=class{constructor(t){this.id=hx++,this.code=t,this.usedTimes=0}};function ux(i){return i===Gi||i===Hr||i===Wr}function dx(i,t,e,n,s,r){let o=new Ls,a=new jc,l=new Set,c=[],h=new Map,f=n.logarithmicDepthBuffer,u=n.precision,d={MeshDepthMaterial:"depth",MeshDistanceMaterial:"distance",MeshNormalMaterial:"normal",MeshBasicMaterial:"basic",MeshLambertMaterial:"lambert",MeshPhongMaterial:"phong",MeshToonMaterial:"toon",MeshStandardMaterial:"physical",MeshPhysicalMaterial:"physical",MeshMatcapMaterial:"matcap",LineBasicMaterial:"basic",LineDashedMaterial:"dashed",PointsMaterial:"points",ShadowMaterial:"shadow",SpriteMaterial:"sprite"};function g(_){return l.add(_),_===0?"uv":`uv${_}`}function M(_,w,L,D,B,G){let N=D.fog,C=B.geometry,k=_.isMeshStandardMaterial||_.isMeshLambertMaterial||_.isMeshPhongMaterial?D.environment:null,V=_.isMeshStandardMaterial||_.isMeshLambertMaterial&&!_.envMap||_.isMeshPhongMaterial&&!_.envMap,j=t.get(_.envMap||k,V),W=j&&j.mapping===Or?j.image.height:null,J=d[_.type];_.precision!==null&&(u=n.getMaxPrecision(_.precision),u!==_.precision&&Jt("WebGLProgram.getParameters:",_.precision,"not supported, using",u,"instead."));let et=C.morphAttributes.position||C.morphAttributes.normal||C.morphAttributes.color,vt=et!==void 0?et.length:0,rt=0;C.morphAttributes.position!==void 0&&(rt=1),C.morphAttributes.normal!==void 0&&(rt=2),C.morphAttributes.color!==void 0&&(rt=3);let Zt,Nt,ne,tt;if(J){let we=si[J];Zt=we.vertexShader,Nt=we.fragmentShader}else{Zt=_.vertexShader,Nt=_.fragmentShader;let we=a.getVertexShaderStage(_),ue=a.getFragmentShaderStage(_);a.update(_,we,ue),ne=we.id,tt=ue.id}let it=i.getRenderTarget(),Mt=i.state.buffers.depth.getReversed(),Dt=B.isInstancedMesh===!0,It=B.isBatchedMesh===!0,Yt=!!_.map,he=!!_.matcap,st=!!j,ot=!!_.aoMap,ft=!!_.lightMap,mt=!!_.bumpMap&&_.wireframe===!1,St=!!_.normalMap,Xt=!!_.displacementMap,kt=!!_.emissiveMap,$t=!!_.metalnessMap,Kt=!!_.roughnessMap,F=_.anisotropy>0,xe=_.clearcoat>0,ae=_.dispersion>0,E=_.retroreflectivity>0,x=_.iridescence>0,H=_.sheen>0,K=_.transmission>0,Q=F&&!!_.anisotropyMap,pt=xe&&!!_.clearcoatMap,_t=xe&&!!_.clearcoatNormalMap,nt=xe&&!!_.clearcoatRoughnessMap,at=x&&!!_.iridescenceMap,wt=x&&!!_.iridescenceThicknessMap,Vt=H&&!!_.sheenColorMap,At=H&&!!_.sheenRoughnessMap,bt=!!_.specularMap,Gt=!!_.specularColorMap,Wt=!!_.specularIntensityMap,ee=K&&!!_.transmissionMap,z=K&&!!_.thicknessMap,Et=!!_.gradientMap,lt=!!_.alphaMap,Tt=_.alphaTest>0,Pt=!!_.alphaHash,dt=!!_.extensions,Ht=kn;_.toneMapped&&(it===null||it.isXRRenderTarget===!0)&&(Ht=i.toneMapping);let zt={shaderID:J,shaderType:_.type,shaderName:_.name,vertexShader:Zt,fragmentShader:Nt,defines:_.defines,customVertexShaderID:ne,customFragmentShaderID:tt,isRawShaderMaterial:_.isRawShaderMaterial===!0,glslVersion:_.glslVersion,precision:u,batching:It,batchingColor:It&&B._colorsTexture!==null,instancing:Dt,instancingColor:Dt&&B.instanceColor!==null,instancingMorph:Dt&&B.morphTexture!==null,outputColorSpace:it===null?i.outputColorSpace:it.isXRRenderTarget===!0?it.texture.colorSpace:pe.workingColorSpace,alphaToCoverage:!!_.alphaToCoverage,map:Yt,matcap:he,envMap:st,envMapMode:st&&j.mapping,envMapCubeUVHeight:W,aoMap:ot,lightMap:ft,bumpMap:mt,normalMap:St,displacementMap:Xt,emissiveMap:kt,normalMapObjectSpace:St&&_.normalMapType===gu,normalMapTangentSpace:St&&_.normalMapType===il,packedNormalMap:St&&_.normalMapType===il&&ux(_.normalMap.format),metalnessMap:$t,roughnessMap:Kt,anisotropy:F,anisotropyMap:Q,clearcoat:xe,clearcoatMap:pt,clearcoatNormalMap:_t,clearcoatRoughnessMap:nt,dispersion:ae,retroreflection:E,iridescence:x,iridescenceMap:at,iridescenceThicknessMap:wt,sheen:H,sheenColorMap:Vt,sheenRoughnessMap:At,specularMap:bt,specularColorMap:Gt,specularIntensityMap:Wt,transmission:K,transmissionMap:ee,thicknessMap:z,gradientMap:Et,opaque:_.transparent===!1&&_.blending===Hs&&_.alphaToCoverage===!1,alphaMap:lt,alphaTest:Tt,alphaHash:Pt,combine:_.combine,mapUv:Yt&&g(_.map.channel),aoMapUv:ot&&g(_.aoMap.channel),lightMapUv:ft&&g(_.lightMap.channel),bumpMapUv:mt&&g(_.bumpMap.channel),normalMapUv:St&&g(_.normalMap.channel),displacementMapUv:Xt&&g(_.displacementMap.channel),emissiveMapUv:kt&&g(_.emissiveMap.channel),metalnessMapUv:$t&&g(_.metalnessMap.channel),roughnessMapUv:Kt&&g(_.roughnessMap.channel),anisotropyMapUv:Q&&g(_.anisotropyMap.channel),clearcoatMapUv:pt&&g(_.clearcoatMap.channel),clearcoatNormalMapUv:_t&&g(_.clearcoatNormalMap.channel),clearcoatRoughnessMapUv:nt&&g(_.clearcoatRoughnessMap.channel),iridescenceMapUv:at&&g(_.iridescenceMap.channel),iridescenceThicknessMapUv:wt&&g(_.iridescenceThicknessMap.channel),sheenColorMapUv:Vt&&g(_.sheenColorMap.channel),sheenRoughnessMapUv:At&&g(_.sheenRoughnessMap.channel),specularMapUv:bt&&g(_.specularMap.channel),specularColorMapUv:Gt&&g(_.specularColorMap.channel),specularIntensityMapUv:Wt&&g(_.specularIntensityMap.channel),transmissionMapUv:ee&&g(_.transmissionMap.channel),thicknessMapUv:z&&g(_.thicknessMap.channel),alphaMapUv:lt&&g(_.alphaMap.channel),vertexTangents:!!C.attributes.tangent&&(St||F),vertexNormals:!!C.attributes.normal,vertexColors:_.vertexColors,vertexAlphas:_.vertexColors===!0&&!!C.attributes.color&&C.attributes.color.itemSize===4,pointsUvs:B.isPoints===!0&&!!C.attributes.uv&&(Yt||lt),fog:!!N,useFog:_.fog===!0,fogExp2:!!N&&N.isFogExp2,flatShading:_.wireframe===!1&&(_.flatShading===!0||C.attributes.normal===void 0&&St===!1&&(_.isMeshLambertMaterial||_.isMeshPhongMaterial||_.isMeshStandardMaterial||_.isMeshPhysicalMaterial)),sizeAttenuation:_.sizeAttenuation===!0,logarithmicDepthBuffer:f,reversedDepthBuffer:Mt,skinning:B.isSkinnedMesh===!0,hasPositionAttribute:C.attributes.position!==void 0,morphTargets:C.morphAttributes.position!==void 0,morphNormals:C.morphAttributes.normal!==void 0,morphColors:C.morphAttributes.color!==void 0,morphTargetsCount:vt,morphTextureStride:rt,numSunLights:w.sun.length,numDirLights:w.directional.length,numPointLights:w.point.length,numSpotLights:w.spot.length,numSpotLightMaps:w.spotLightMap.length,numRectAreaLights:w.rectArea.length,numHemiLights:w.hemi.length,numSunLightShadows:w.sunShadowMap.length,numDirLightShadows:w.directionalShadowMap.length,numPointLightShadows:w.pointShadowMap.length,numSpotLightShadows:w.spotShadowMap.length,numSpotLightShadowsWithMaps:w.numSpotLightShadowsWithMaps,numLightProbes:w.numLightProbes,numLightProbeGrids:G.length,numClippingPlanes:r.numPlanes,numClipIntersection:r.numIntersection,dithering:_.dithering,shadowMapEnabled:i.shadowMap.enabled&&L.length>0,shadowMapType:i.shadowMap.type,toneMapping:Ht,decodeVideoTexture:Yt&&_.map.isVideoTexture===!0&&pe.getTransfer(_.map.colorSpace)===Me,decodeVideoTextureEmissive:kt&&_.emissiveMap.isVideoTexture===!0&&pe.getTransfer(_.emissiveMap.colorSpace)===Me,premultipliedAlpha:_.premultipliedAlpha,doubleSided:_.side===ei,flipSided:_.side===je,useDepthPacking:_.depthPacking>=0,depthPacking:_.depthPacking||0,index0AttributeName:_.index0AttributeName,extensionClipCullDistance:dt&&_.extensions.clipCullDistance===!0&&e.has("WEBGL_clip_cull_distance"),extensionMultiDraw:(dt&&_.extensions.multiDraw===!0||It)&&e.has("WEBGL_multi_draw"),rendererExtensionParallelShaderCompile:e.has("KHR_parallel_shader_compile"),customProgramCacheKey:_.customProgramCacheKey()};return zt.vertexUv1s=l.has(1),zt.vertexUv2s=l.has(2),zt.vertexUv3s=l.has(3),l.clear(),zt}function m(_){let w=[];if(_.shaderID?w.push(_.shaderID):(w.push(_.customVertexShaderID),w.push(_.customFragmentShaderID)),_.defines!==void 0)for(let L in _.defines)w.push(L),w.push(_.defines[L]);return _.isRawShaderMaterial===!1&&(p(w,_),T(w,_),w.push(i.outputColorSpace)),w.push(_.customProgramCacheKey),w.join()}function p(_,w){_.push(w.precision),_.push(w.outputColorSpace),_.push(w.envMapMode),_.push(w.envMapCubeUVHeight),_.push(w.mapUv),_.push(w.alphaMapUv),_.push(w.lightMapUv),_.push(w.aoMapUv),_.push(w.bumpMapUv),_.push(w.normalMapUv),_.push(w.displacementMapUv),_.push(w.emissiveMapUv),_.push(w.metalnessMapUv),_.push(w.roughnessMapUv),_.push(w.anisotropyMapUv),_.push(w.clearcoatMapUv),_.push(w.clearcoatNormalMapUv),_.push(w.clearcoatRoughnessMapUv),_.push(w.iridescenceMapUv),_.push(w.iridescenceThicknessMapUv),_.push(w.sheenColorMapUv),_.push(w.sheenRoughnessMapUv),_.push(w.specularMapUv),_.push(w.specularColorMapUv),_.push(w.specularIntensityMapUv),_.push(w.transmissionMapUv),_.push(w.thicknessMapUv),_.push(w.combine),_.push(w.fogExp2),_.push(w.sizeAttenuation),_.push(w.morphTargetsCount),_.push(w.morphAttributeCount),_.push(w.numSunLights),_.push(w.numDirLights),_.push(w.numPointLights),_.push(w.numSpotLights),_.push(w.numSpotLightMaps),_.push(w.numHemiLights),_.push(w.numRectAreaLights),_.push(w.numSunLightShadows),_.push(w.numDirLightShadows),_.push(w.numPointLightShadows),_.push(w.numSpotLightShadows),_.push(w.numSpotLightShadowsWithMaps),_.push(w.numLightProbes),_.push(w.shadowMapType),_.push(w.toneMapping),_.push(w.numClippingPlanes),_.push(w.numClipIntersection),_.push(w.depthPacking)}function T(_,w){o.disableAll(),w.instancing&&o.enable(0),w.instancingColor&&o.enable(1),w.instancingMorph&&o.enable(2),w.matcap&&o.enable(3),w.envMap&&o.enable(4),w.normalMapObjectSpace&&o.enable(5),w.normalMapTangentSpace&&o.enable(6),w.clearcoat&&o.enable(7),w.iridescence&&o.enable(8),w.alphaTest&&o.enable(9),w.vertexColors&&o.enable(10),w.vertexAlphas&&o.enable(11),w.vertexUv1s&&o.enable(12),w.vertexUv2s&&o.enable(13),w.vertexUv3s&&o.enable(14),w.vertexTangents&&o.enable(15),w.anisotropy&&o.enable(16),w.alphaHash&&o.enable(17),w.batching&&o.enable(18),w.dispersion&&o.enable(19),w.retroreflection&&o.enable(24),w.batchingColor&&o.enable(20),w.gradientMap&&o.enable(21),w.packedNormalMap&&o.enable(22),w.vertexNormals&&o.enable(23),_.push(o.mask),o.disableAll(),w.fog&&o.enable(0),w.useFog&&o.enable(1),w.flatShading&&o.enable(2),w.logarithmicDepthBuffer&&o.enable(3),w.reversedDepthBuffer&&o.enable(4),w.skinning&&o.enable(5),w.morphTargets&&o.enable(6),w.morphNormals&&o.enable(7),w.morphColors&&o.enable(8),w.premultipliedAlpha&&o.enable(9),w.shadowMapEnabled&&o.enable(10),w.doubleSided&&o.enable(11),w.flipSided&&o.enable(12),w.useDepthPacking&&o.enable(13),w.dithering&&o.enable(14),w.transmission&&o.enable(15),w.sheen&&o.enable(16),w.opaque&&o.enable(17),w.pointsUvs&&o.enable(18),w.decodeVideoTexture&&o.enable(19),w.decodeVideoTextureEmissive&&o.enable(20),w.alphaToCoverage&&o.enable(21),w.numLightProbeGrids>0&&o.enable(22),w.hasPositionAttribute&&o.enable(23),_.push(o.mask)}function P(_){let w=d[_.type],L;if(w){let D=si[w];L=Du.clone(D.uniforms)}else L=_.uniforms;return L}function S(_,w){let L=h.get(w);return L!==void 0?++L.usedTimes:(L=new cx(i,w,_,s),c.push(L),h.set(w,L)),L}function A(_){if(--_.usedTimes===0){let w=c.indexOf(_);c[w]=c[c.length-1],c.pop(),h.delete(_.cacheKey),_.destroy()}}function b(_){a.remove(_)}function R(){a.dispose()}return{getParameters:M,getProgramCacheKey:m,getUniforms:P,acquireProgram:S,releaseProgram:A,releaseShaderCache:b,programs:c,dispose:R}}function fx(){let i=new WeakMap;function t(o){return i.has(o)}function e(o){let a=i.get(o);return a===void 0&&(a={},i.set(o,a)),a}function n(o){i.delete(o)}function s(o,a,l){i.get(o)[a]=l}function r(){i=new WeakMap}return{has:t,get:e,remove:n,update:s,dispose:r}}function px(i,t){return i.groupOrder!==t.groupOrder?i.groupOrder-t.groupOrder:i.renderOrder!==t.renderOrder?i.renderOrder-t.renderOrder:i.material.id!==t.material.id?i.material.id-t.material.id:i.materialVariant!==t.materialVariant?i.materialVariant-t.materialVariant:i.z!==t.z?i.z-t.z:i.id-t.id}function Qu(i,t){return i.groupOrder!==t.groupOrder?i.groupOrder-t.groupOrder:i.renderOrder!==t.renderOrder?i.renderOrder-t.renderOrder:i.z!==t.z?t.z-i.z:i.id-t.id}function td(){let i=[],t=0,e=[],n=[],s=[];function r(){t=0,e.length=0,n.length=0,s.length=0}function o(u){let d=0;return u.isInstancedMesh&&(d+=2),u.isSkinnedMesh&&(d+=1),d}function a(u,d,g,M,m,p){let T=i[t];return T===void 0?(T={id:u.id,object:u,geometry:d,material:g,materialVariant:o(u),groupOrder:M,renderOrder:u.renderOrder,z:m,group:p},i[t]=T):(T.id=u.id,T.object=u,T.geometry=d,T.material=g,T.materialVariant=o(u),T.groupOrder=M,T.renderOrder=u.renderOrder,T.z=m,T.group=p),t++,T}function l(u,d,g,M,m,p,T){T.reversedDepth===!0&&(m=-m);let P=a(u,d,g,M,m,p);g.transmission>0?n.push(P):g.transparent===!0?s.push(P):e.push(P)}function c(u,d,g,M,m,p){let T=a(u,d,g,M,m,p);g.transmission>0?n.unshift(T):g.transparent===!0?s.unshift(T):e.unshift(T)}function h(u,d){e.length>1&&e.sort(u||px),n.length>1&&n.sort(d||Qu),s.length>1&&s.sort(d||Qu)}function f(){for(let u=t,d=i.length;u<d;u++){let g=i[u];if(g.id===null)break;g.id=null,g.object=null,g.geometry=null,g.material=null,g.group=null}}return{opaque:e,transmissive:n,transparent:s,init:r,push:l,unshift:c,finish:f,sort:h}}function mx(){let i=new WeakMap;function t(n,s){let r=i.get(n),o;return r===void 0?(o=new td,i.set(n,[o])):s>=r.length?(o=new td,r.push(o)):o=r[s],o}function e(){i=new WeakMap}return{get:t,dispose:e}}function gx(){let i={};return{get:function(t){if(i[t.id]!==void 0)return i[t.id];let e;switch(t.type){case"SunLight":case"DirectionalLight":e={direction:new O,color:new se};break;case"SpotLight":e={position:new O,direction:new O,color:new se,distance:0,coneCos:0,penumbraCos:0,decay:0};break;case"PointLight":e={position:new O,color:new se,distance:0,decay:0};break;case"HemisphereLight":e={direction:new O,skyColor:new se,groundColor:new se};break;case"RectAreaLight":e={color:new se,position:new O,halfWidth:new O,halfHeight:new O};break}return i[t.id]=e,e}}}function xx(){let i={};return{get:function(t){if(i[t.id]!==void 0)return i[t.id];let e;switch(t.type){case"SunLight":case"DirectionalLight":e={shadowIntensity:1,shadowBias:0,shadowNormalBias:0,shadowRadius:1,shadowMapSize:new xt};break;case"SpotLight":e={shadowIntensity:1,shadowBias:0,shadowNormalBias:0,shadowRadius:1,shadowMapSize:new xt};break;case"PointLight":e={shadowIntensity:1,shadowBias:0,shadowNormalBias:0,shadowRadius:1,shadowMapSize:new xt,shadowCameraNear:1,shadowCameraFar:1e3};break}return i[t.id]=e,e}}}var _x=0;function yx(i,t){return(t.castShadow?2:0)-(i.castShadow?2:0)+(t.map?1:0)-(i.map?1:0)}function vx(i){let t=new gx,e=xx(),n={version:0,hash:{sunLength:-1,directionalLength:-1,pointLength:-1,spotLength:-1,rectAreaLength:-1,hemiLength:-1,numSunShadows:-1,numDirectionalShadows:-1,numPointShadows:-1,numSpotShadows:-1,numSpotMaps:-1,numLightProbes:-1},ambient:[0,0,0],probe:[],sun:[],sunShadow:[],sunShadowMap:[],sunShadowMatrix:[],sunShadowCascade:[],directional:[],directionalShadow:[],directionalShadowMap:[],directionalShadowMatrix:[],spot:[],spotLightMap:[],spotShadow:[],spotShadowMap:[],spotLightMatrix:[],rectArea:[],rectAreaLTC1:null,rectAreaLTC2:null,point:[],pointShadow:[],pointShadowMap:[],pointShadowMatrix:[],hemi:[],numSpotLightShadowsWithMaps:0,numLightProbes:0};for(let c=0;c<9;c++)n.probe.push(new O);let s=new O,r=new Ee,o=new Ee;function a(c){let h=0,f=0,u=0;for(let B=0;B<9;B++)n.probe[B].set(0,0,0);let d=0,g=0,M=0,m=0,p=0,T=0,P=0,S=0,A=0,b=0,R=0,_=0,w=0,L=0;c.sort(yx);for(let B=0,G=c.length;B<G;B++){let N=c[B],C=N.color,k=N.intensity,V=N.distance,j=null;if(N.shadow&&N.shadow.map&&(N.shadow.map.texture.format===Gi?j=N.shadow.map.texture:j=N.shadow.map.depthTexture||N.shadow.map.texture),N.isAmbientLight)h+=C.r*k,f+=C.g*k,u+=C.b*k;else if(N.isLightProbe){for(let W=0;W<9;W++)n.probe[W].addScaledVector(N.sh.coefficients[W],k);L++}else if(N.isSunLight){let W=t.get(N);if(W.color.copy(N.color).multiplyScalar(N.intensity),N.castShadow){let J=N.shadow,et=e.get(N);et.shadowIntensity=J.intensity,et.shadowBias=J.bias,et.shadowNormalBias=J.normalBias,et.shadowRadius=J.radius,et.shadowMapSize.copy(J.mapSize).multiply(J.getFrameExtents()),n.sunShadow[g]=et,n.sunShadowMap[g]=j;let vt=J.getViewportCount();for(let rt=0;rt<vt;rt++)n.sunShadowMatrix[M+rt]=J.getMatrix(rt),n.sunShadowCascade[M+rt]=J._cascadeData[rt];M+=vt,g++}n.sun[d]=W,d++}else if(N.isDirectionalLight){let W=t.get(N);if(W.color.copy(N.color).multiplyScalar(N.intensity),N.castShadow){let J=N.shadow,et=e.get(N);et.shadowIntensity=J.intensity,et.shadowBias=J.bias,et.shadowNormalBias=J.normalBias,et.shadowRadius=J.radius,et.shadowMapSize=J.mapSize,n.directionalShadow[m]=et,n.directionalShadowMap[m]=j,n.directionalShadowMatrix[m]=N.shadow.matrix,A++}n.directional[m]=W,m++}else if(N.isSpotLight){let W=t.get(N);W.position.setFromMatrixPosition(N.matrixWorld),W.color.copy(C).multiplyScalar(k),W.distance=V,W.coneCos=Math.cos(N.angle),W.penumbraCos=Math.cos(N.angle*(1-N.penumbra)),W.decay=N.decay,n.spot[T]=W;let J=N.shadow;if(N.map&&(n.spotLightMap[_]=N.map,_++,J.updateMatrices(N),N.castShadow&&w++),n.spotLightMatrix[T]=J.matrix,N.castShadow){let et=e.get(N);et.shadowIntensity=J.intensity,et.shadowBias=J.bias,et.shadowNormalBias=J.normalBias,et.shadowRadius=J.radius,et.shadowMapSize=J.mapSize,n.spotShadow[T]=et,n.spotShadowMap[T]=j,R++}T++}else if(N.isRectAreaLight){let W=t.get(N);W.color.copy(C).multiplyScalar(k),W.halfWidth.set(N.width*.5,0,0),W.halfHeight.set(0,N.height*.5,0),n.rectArea[P]=W,P++}else if(N.isPointLight){let W=t.get(N);if(W.color.copy(N.color).multiplyScalar(N.intensity),W.distance=N.distance,W.decay=N.decay,N.castShadow){let J=N.shadow,et=e.get(N);et.shadowIntensity=J.intensity,et.shadowBias=J.bias,et.shadowNormalBias=J.normalBias,et.shadowRadius=J.radius,et.shadowMapSize=J.mapSize,et.shadowCameraNear=J.camera.near,et.shadowCameraFar=J.camera.far,n.pointShadow[p]=et,n.pointShadowMap[p]=j,n.pointShadowMatrix[p]=N.shadow.matrix,b++}n.point[p]=W,p++}else if(N.isHemisphereLight){let W=t.get(N);W.skyColor.copy(N.color).multiplyScalar(k),W.groundColor.copy(N.groundColor).multiplyScalar(k),n.hemi[S]=W,S++}}P>0&&(i.has("OES_texture_float_linear")===!0?(n.rectAreaLTC1=Rt.LTC_FLOAT_1,n.rectAreaLTC2=Rt.LTC_FLOAT_2):(n.rectAreaLTC1=Rt.LTC_HALF_1,n.rectAreaLTC2=Rt.LTC_HALF_2)),n.ambient[0]=h,n.ambient[1]=f,n.ambient[2]=u;let D=n.hash;(D.sunLength!==d||D.directionalLength!==m||D.pointLength!==p||D.spotLength!==T||D.rectAreaLength!==P||D.hemiLength!==S||D.numSunShadows!==g||D.numDirectionalShadows!==A||D.numPointShadows!==b||D.numSpotShadows!==R||D.numSpotMaps!==_||D.numLightProbes!==L)&&(n.sun.length=d,n.directional.length=m,n.spot.length=T,n.rectArea.length=P,n.point.length=p,n.hemi.length=S,n.sunShadow.length=g,n.sunShadowMap.length=g,n.sunShadowMatrix.length=M,n.sunShadowCascade.length=M,n.directionalShadow.length=A,n.directionalShadowMap.length=A,n.directionalShadowMatrix.length=A,n.pointShadow.length=b,n.pointShadowMap.length=b,n.pointShadowMatrix.length=b,n.spotShadow.length=R,n.spotShadowMap.length=R,n.spotLightMatrix.length=R+_-w,n.spotLightMap.length=_,n.numSpotLightShadowsWithMaps=w,n.numLightProbes=L,D.sunLength=d,D.directionalLength=m,D.pointLength=p,D.spotLength=T,D.rectAreaLength=P,D.hemiLength=S,D.numSunShadows=g,D.numDirectionalShadows=A,D.numPointShadows=b,D.numSpotShadows=R,D.numSpotMaps=_,D.numLightProbes=L,n.version=_x++)}function l(c,h){let f=0,u=0,d=0,g=0,M=0,m=0,p=h.matrixWorldInverse;for(let T=0,P=c.length;T<P;T++){let S=c[T];if(S.isSunLight){let A=n.sun[f];A.direction.setFromMatrixPosition(S.matrixWorld),A.direction.transformDirection(p),f++}else if(S.isDirectionalLight){let A=n.directional[u];A.direction.setFromMatrixPosition(S.matrixWorld),s.setFromMatrixPosition(S.target.matrixWorld),A.direction.sub(s),A.direction.transformDirection(p),u++}else if(S.isSpotLight){let A=n.spot[g];A.position.setFromMatrixPosition(S.matrixWorld),A.position.applyMatrix4(p),A.direction.setFromMatrixPosition(S.matrixWorld),s.setFromMatrixPosition(S.target.matrixWorld),A.direction.sub(s),A.direction.transformDirection(p),g++}else if(S.isRectAreaLight){let A=n.rectArea[M];A.position.setFromMatrixPosition(S.matrixWorld),A.position.applyMatrix4(p),o.identity(),r.copy(S.matrixWorld),r.premultiply(p),o.extractRotation(r),A.halfWidth.set(S.width*.5,0,0),A.halfHeight.set(0,S.height*.5,0),A.halfWidth.applyMatrix4(o),A.halfHeight.applyMatrix4(o),M++}else if(S.isPointLight){let A=n.point[d];A.position.setFromMatrixPosition(S.matrixWorld),A.position.applyMatrix4(p),d++}else if(S.isHemisphereLight){let A=n.hemi[m];A.direction.setFromMatrixPosition(S.matrixWorld),A.direction.transformDirection(p),m++}}}return{setup:a,setupView:l,state:n}}function ed(i){let t=new vx(i),e=[],n=[],s=[];function r(u){f.camera=u,e.length=0,n.length=0,s.length=0}function o(u){e.push(u)}function a(u){n.push(u)}function l(u){s.push(u)}function c(){t.setup(e)}function h(u){t.setupView(e,u)}let f={lightsArray:e,shadowsArray:n,lightProbeGridArray:s,camera:null,lights:t,transmissionRenderTarget:{},textureUnits:0};return{init:r,state:f,setupLights:c,setupLightsView:h,pushLight:o,pushShadow:a,pushLightProbeGrid:l}}function Mx(i){let t=new WeakMap;function e(s,r=0){let o=t.get(s),a;return o===void 0?(a=new ed(i),t.set(s,[a])):r>=o.length?(a=new ed(i),o.push(a)):a=o[r],a}function n(){t=new WeakMap}return{get:e,dispose:n}}var Sx=`void main() {
+	gl_Position = vec4( position, 1.0 );
+}`,bx=`uniform sampler2D shadow_pass;
+uniform vec2 resolution;
+uniform float radius;
+void main() {
+	const float samples = float( VSM_SAMPLES );
+	float mean = 0.0;
+	float squared_mean = 0.0;
+	float uvStride = samples <= 1.0 ? 0.0 : 2.0 / ( samples - 1.0 );
+	float uvStart = samples <= 1.0 ? 0.0 : - 1.0;
+	for ( float i = 0.0; i < samples; i ++ ) {
+		float uvOffset = uvStart + i * uvStride;
+		#ifdef HORIZONTAL_PASS
+			vec2 distribution = texture2D( shadow_pass, ( gl_FragCoord.xy + vec2( uvOffset, 0.0 ) * radius ) / resolution ).rg;
+			mean += distribution.x;
+			squared_mean += distribution.y * distribution.y + distribution.x * distribution.x;
+		#else
+			float depth = texture2D( shadow_pass, ( gl_FragCoord.xy + vec2( 0.0, uvOffset ) * radius ) / resolution ).r;
+			mean += depth;
+			squared_mean += depth * depth;
+		#endif
+	}
+	mean = mean / samples;
+	squared_mean = squared_mean / samples;
+	float std_dev = sqrt( max( 0.0, squared_mean - mean * mean ) );
+	gl_FragColor = vec4( mean, std_dev, 0.0, 1.0 );
+}`,wx=[new O(1,0,0),new O(-1,0,0),new O(0,1,0),new O(0,-1,0),new O(0,0,1),new O(0,0,-1)],Tx=[new O(0,-1,0),new O(0,-1,0),new O(0,0,1),new O(0,0,-1),new O(0,-1,0),new O(0,-1,0)],nd=new Ee,qr=new O,qc=new O;function Ex(i,t,e){let n=new Fs,s=new xt,r=new xt,o=new Le,a=new na,l=new ia,c={},h=e.maxTextureSize,f={[Bi]:je,[je]:Bi,[ei]:ei},u=new Tn({defines:{VSM_SAMPLES:8},uniforms:{shadow_pass:{value:null},resolution:{value:new xt},radius:{value:4}},vertexShader:Sx,fragmentShader:bx}),d=u.clone();d.defines.HORIZONTAL_PASS=1;let g=new sn;g.setAttribute("position",new pn(new Float32Array([-1,-1,.5,3,-1,.5,-1,3,.5]),3));let M=new Ue(g,u),m=this;this.enabled=!1,this.autoUpdate=!0,this.needsUpdate=!1,this.type=Ur;let p=this.type;this.render=function(b,R,_){if(m.enabled===!1||m.autoUpdate===!1&&m.needsUpdate===!1||b.length===0)return;this.type===xa&&(Jt("WebGLShadowMap: PCFSoftShadowMap has been removed. Using PCFShadowMap instead."),this.type=Ur);let w=i.getRenderTarget(),L=i.getActiveCubeFace(),D=i.getActiveMipmapLevel(),B=i.state;B.setBlending(ni),B.buffers.depth.getReversed()===!0?B.buffers.color.setClear(0,0,0,0):B.buffers.color.setClear(1,1,1,1),B.buffers.depth.setTest(!0),B.setScissorTest(!1);let G=p!==this.type;G&&R.traverse(function(N){N.material&&(Array.isArray(N.material)?N.material.forEach(C=>C.needsUpdate=!0):N.material.needsUpdate=!0)});for(let N=0,C=b.length;N<C;N++){let k=b[N],V=k.shadow;if(V===void 0){Jt("WebGLShadowMap:",k,"has no shadow.");continue}if(V.autoUpdate===!1&&V.needsUpdate===!1)continue;s.copy(V.mapSize);let j=V.getFrameExtents();s.multiply(j),r.copy(V.mapSize),(s.x>h||s.y>h)&&(s.x>h&&(r.x=Math.floor(h/j.x),s.x=r.x*j.x,V.mapSize.x=r.x),s.y>h&&(r.y=Math.floor(h/j.y),s.y=r.y*j.y,V.mapSize.y=r.y));let W=i.state.buffers.depth.getReversed();if(V.camera._reversedDepth=W,V.map===null||G===!0){if(V.map!==null&&(V.map.depthTexture!==null&&(V.map.depthTexture.dispose(),V.map.depthTexture=null),V.map.dispose()),this.type===Gs){if(k.isPointLight){Jt("WebGLShadowMap: VSM shadow maps are not supported for PointLights. Use PCF or BasicShadowMap instead.");continue}V.map=new gn(s.x,s.y,{format:Gi,type:Hn,minFilter:Je,magFilter:Je,generateMipmaps:!1}),V.map.texture.name=k.name+".shadowMap",V.map.depthTexture=new Li(s.x,s.y,Gn),V.map.depthTexture.name=k.name+".shadowMapDepth",V.map.depthTexture.format=Zn,V.map.depthTexture.compareFunction=null,V.map.depthTexture.minFilter=Ze,V.map.depthTexture.magFilter=Ze}else k.isPointLight?(V.map=new hl(s.x),V.map.depthTexture=new Zo(s.x,Vn)):(V.map=new gn(s.x,s.y),V.map.depthTexture=new Li(s.x,s.y,Vn)),V.map.depthTexture.name=k.name+".shadowMap",V.map.depthTexture.format=Zn,this.type===Ur?(V.map.depthTexture.compareFunction=W?ol:rl,V.map.depthTexture.minFilter=Je,V.map.depthTexture.magFilter=Je):(V.map.depthTexture.compareFunction=null,V.map.depthTexture.minFilter=Ze,V.map.depthTexture.magFilter=Ze);V.camera.updateProjectionMatrix()}V.map.isWebGLCubeRenderTarget!==!0&&(V.map.width!==s.x||V.map.height!==s.y)&&V.map.setSize(s.x,s.y);let J=V.map.isWebGLCubeRenderTarget?6:V.getViewportCount();k.isPointLight!==!0&&V.updateMatrices(k,_);for(let et=0;et<J;et++){let vt=V.getCamera(et);if(k.isPointLight){let rt=V.camera,Zt=V.matrix,Nt=k.distance||rt.far;Nt!==rt.far&&(rt.far=Nt,rt.updateProjectionMatrix()),qr.setFromMatrixPosition(k.matrixWorld),rt.position.copy(qr),qc.copy(rt.position),qc.add(wx[et]),rt.up.copy(Tx[et]),rt.lookAt(qc),rt.updateMatrixWorld(),Zt.makeTranslation(-qr.x,-qr.y,-qr.z),nd.multiplyMatrices(rt.projectionMatrix,rt.matrixWorldInverse),V._frustum.setFromProjectionMatrix(nd,rt.coordinateSystem,rt.reversedDepth)}if(V.map.isWebGLCubeRenderTarget)i.setRenderTarget(V.map,et),i.clear();else{et===0&&(i.setRenderTarget(V.map),i.clear());let rt=V.getViewport(et);o.set(r.x*rt.x,r.y*rt.y,r.x*rt.z,r.y*rt.w),B.viewport(o)}n=V.getFrustum(et),S(R,_,vt,k,this.type)}V.isPointLightShadow!==!0&&this.type===Gs&&T(V,_),V.needsUpdate=!1}p=this.type,m.needsUpdate=!1,i.setRenderTarget(w,L,D)};function T(b,R){let _=t.update(M);u.defines.VSM_SAMPLES!==b.blurSamples&&(u.defines.VSM_SAMPLES=b.blurSamples,d.defines.VSM_SAMPLES=b.blurSamples,u.needsUpdate=!0,d.needsUpdate=!0),b.mapPass===null?b.mapPass=new gn(s.x,s.y,{format:Gi,type:Hn}):(b.mapPass.width!==b.map.width||b.mapPass.height!==b.map.height)&&b.mapPass.setSize(b.map.width,b.map.height),u.uniforms.shadow_pass.value=b.map.depthTexture,u.uniforms.resolution.value.set(b.map.width,b.map.height),u.uniforms.radius.value=b.radius,i.setRenderTarget(b.mapPass),i.clear(),i.renderBufferDirect(R,null,_,u,M,null),d.uniforms.shadow_pass.value=b.mapPass.texture,d.uniforms.resolution.value.set(b.map.width,b.map.height),d.uniforms.radius.value=b.radius,i.setRenderTarget(b.map),i.clear(),i.renderBufferDirect(R,null,_,d,M,null)}function P(b,R,_,w){let L=null,D=_.isPointLight===!0?b.customDistanceMaterial:b.customDepthMaterial;if(D!==void 0)L=D;else if(L=_.isPointLight===!0?l:a,i.localClippingEnabled&&R.clipShadows===!0&&Array.isArray(R.clippingPlanes)&&R.clippingPlanes.length!==0||R.displacementMap&&R.displacementScale!==0||R.alphaMap&&R.alphaTest>0||R.map&&R.alphaTest>0||R.alphaToCoverage===!0){let B=L.uuid,G=R.uuid,N=c[B];N===void 0&&(N={},c[B]=N);let C=N[G];C===void 0&&(C=L.clone(),N[G]=C,R.addEventListener("dispose",A)),L=C}if(L.visible=R.visible,L.wireframe=R.wireframe,w===Gs?L.side=R.shadowSide!==null?R.shadowSide:R.side:L.side=R.shadowSide!==null?R.shadowSide:f[R.side],L.alphaMap=R.alphaMap,L.alphaTest=R.alphaToCoverage===!0?.5:R.alphaTest,L.map=R.map,L.clipShadows=R.clipShadows,L.clippingPlanes=R.clippingPlanes,L.clipIntersection=R.clipIntersection,L.displacementMap=R.displacementMap,L.displacementScale=R.displacementScale,L.displacementBias=R.displacementBias,L.wireframeLinewidth=R.wireframeLinewidth,L.linewidth=R.linewidth,_.isPointLight===!0&&L.isMeshDistanceMaterial===!0){let B=i.properties.get(L);B.light=_}return L}function S(b,R,_,w,L){if(b.visible===!1)return;if(b.layers.test(R.layers)&&(b.isMesh||b.isLine||b.isPoints)&&(b.castShadow||b.receiveShadow&&L===Gs)&&(!b.frustumCulled||b.intersectsFrustum(n))){b.modelViewMatrix.multiplyMatrices(_.matrixWorldInverse,b.matrixWorld);let G=t.update(b),N=b.material;if(Array.isArray(N)){let C=G.groups;for(let k=0,V=C.length;k<V;k++){let j=C[k],W=N[j.materialIndex];if(W&&W.visible){let J=P(b,W,w,L);b.onBeforeShadow(i,b,R,_,G,J,j),i.renderBufferDirect(_,null,G,J,b,j),b.onAfterShadow(i,b,R,_,G,J,j)}}}else if(N.visible){let C=P(b,N,w,L);b.onBeforeShadow(i,b,R,_,G,C,null),i.renderBufferDirect(_,null,G,C,b,null),b.onAfterShadow(i,b,R,_,G,C,null)}}let B=b.children;for(let G=0,N=B.length;G<N;G++)S(B[G],R,_,w,L)}function A(b){b.target.removeEventListener("dispose",A);for(let _ in c){let w=c[_],L=b.target.uuid;L in w&&(w[L].dispose(),delete w[L])}}}function Ax(i,t){function e(){let z=!1,Et=new Le,lt=null,Tt=new Le(0,0,0,0);return{setMask:function(Pt){lt!==Pt&&!z&&(i.colorMask(Pt,Pt,Pt,Pt),lt=Pt)},setLocked:function(Pt){z=Pt},setClear:function(Pt,dt,Ht,zt,we){we===!0&&(Pt*=zt,dt*=zt,Ht*=zt),Et.set(Pt,dt,Ht,zt),Tt.equals(Et)===!1&&(i.clearColor(Pt,dt,Ht,zt),Tt.copy(Et))},reset:function(){z=!1,lt=null,Tt.set(-1,0,0,0)}}}function n(){let z=!1,Et=!1,lt=null,Tt=null,Pt=null;return{setReversed:function(dt){if(Et!==dt){let Ht=t.get("EXT_clip_control");dt?Ht.clipControlEXT(Ht.LOWER_LEFT_EXT,Ht.ZERO_TO_ONE_EXT):Ht.clipControlEXT(Ht.LOWER_LEFT_EXT,Ht.NEGATIVE_ONE_TO_ONE_EXT),Et=dt;let zt=Pt;Pt=null,this.setClear(zt)}},getReversed:function(){return Et},setTest:function(dt){dt?it(i.DEPTH_TEST):Mt(i.DEPTH_TEST)},setMask:function(dt){lt!==dt&&!z&&(i.depthMask(dt),lt=dt)},setFunc:function(dt){if(Et&&(dt=Au[dt]),Tt!==dt){switch(dt){case Io:i.depthFunc(i.NEVER);break;case Po:i.depthFunc(i.ALWAYS);break;case Lo:i.depthFunc(i.LESS);break;case Cs:i.depthFunc(i.LEQUAL);break;case Do:i.depthFunc(i.EQUAL);break;case No:i.depthFunc(i.GEQUAL);break;case Uo:i.depthFunc(i.GREATER);break;case Fo:i.depthFunc(i.NOTEQUAL);break;default:i.depthFunc(i.LEQUAL)}Tt=dt}},setLocked:function(dt){z=dt},setClear:function(dt){Pt!==dt&&(Pt=dt,Et&&(dt=1-dt),i.clearDepth(dt))},reset:function(){z=!1,lt=null,Tt=null,Pt=null,Et=!1}}}function s(){let z=!1,Et=null,lt=null,Tt=null,Pt=null,dt=null,Ht=null,zt=null,we=null;return{setTest:function(ue){z||(ue?it(i.STENCIL_TEST):Mt(i.STENCIL_TEST))},setMask:function(ue){Et!==ue&&!z&&(i.stencilMask(ue),Et=ue)},setFunc:function(ue,Be,vn){(lt!==ue||Tt!==Be||Pt!==vn)&&(i.stencilFunc(ue,Be,vn),lt=ue,Tt=Be,Pt=vn)},setOp:function(ue,Be,vn){(dt!==ue||Ht!==Be||zt!==vn)&&(i.stencilOp(ue,Be,vn),dt=ue,Ht=Be,zt=vn)},setLocked:function(ue){z=ue},setClear:function(ue){we!==ue&&(i.clearStencil(ue),we=ue)},reset:function(){z=!1,Et=null,lt=null,Tt=null,Pt=null,dt=null,Ht=null,zt=null,we=null}}}let r=new e,o=new n,a=new s,l=new WeakMap,c=new WeakMap,h={},f={},u={},d=new WeakMap,g=[],M=null,m=!1,p=null,T=null,P=null,S=null,A=null,b=null,R=null,_=new se(0,0,0),w=0,L=!1,D=null,B=null,G=null,N=null,C=null,k=i.getParameter(i.MAX_COMBINED_TEXTURE_IMAGE_UNITS),V=!1,j=0,W=i.getParameter(i.VERSION);W.indexOf("WebGL")!==-1?(j=parseFloat(/^WebGL (\d)/.exec(W)[1]),V=j>=1):W.indexOf("OpenGL ES")!==-1&&(j=parseFloat(/^OpenGL ES (\d)/.exec(W)[1]),V=j>=2);let J=null,et={},vt=i.getParameter(i.SCISSOR_BOX),rt=i.getParameter(i.VIEWPORT),Zt=new Le().fromArray(vt),Nt=new Le().fromArray(rt);function ne(z,Et,lt,Tt){let Pt=new Uint8Array(4),dt=i.createTexture();i.bindTexture(z,dt),i.texParameteri(z,i.TEXTURE_MIN_FILTER,i.NEAREST),i.texParameteri(z,i.TEXTURE_MAG_FILTER,i.NEAREST);for(let Ht=0;Ht<lt;Ht++)z===i.TEXTURE_3D||z===i.TEXTURE_2D_ARRAY?i.texImage3D(Et,0,i.RGBA,1,1,Tt,0,i.RGBA,i.UNSIGNED_BYTE,Pt):i.texImage2D(Et+Ht,0,i.RGBA,1,1,0,i.RGBA,i.UNSIGNED_BYTE,Pt);return dt}let tt={};tt[i.TEXTURE_2D]=ne(i.TEXTURE_2D,i.TEXTURE_2D,1),tt[i.TEXTURE_CUBE_MAP]=ne(i.TEXTURE_CUBE_MAP,i.TEXTURE_CUBE_MAP_POSITIVE_X,6),tt[i.TEXTURE_2D_ARRAY]=ne(i.TEXTURE_2D_ARRAY,i.TEXTURE_2D_ARRAY,1,1),tt[i.TEXTURE_3D]=ne(i.TEXTURE_3D,i.TEXTURE_3D,1,1),r.setClear(0,0,0,1),o.setClear(1),a.setClear(0),it(i.DEPTH_TEST),o.setFunc(Cs),mt(!1),St(uc),it(i.CULL_FACE),ot(ni);function it(z){h[z]!==!0&&(i.enable(z),h[z]=!0)}function Mt(z){h[z]!==!1&&(i.disable(z),h[z]=!1)}function Dt(z,Et){return u[z]!==Et?(i.bindFramebuffer(z,Et),u[z]=Et,z===i.DRAW_FRAMEBUFFER&&(u[i.FRAMEBUFFER]=Et),z===i.FRAMEBUFFER&&(u[i.DRAW_FRAMEBUFFER]=Et),!0):!1}function It(z,Et){let lt=g,Tt=!1;if(z){lt=d.get(Et),lt===void 0&&(lt=[],d.set(Et,lt));let Pt=z.textures;if(lt.length!==Pt.length||lt[0]!==i.COLOR_ATTACHMENT0){for(let dt=0,Ht=Pt.length;dt<Ht;dt++)lt[dt]=i.COLOR_ATTACHMENT0+dt;lt.length=Pt.length,Tt=!0}}else lt[0]!==i.BACK&&(lt[0]=i.BACK,Tt=!0);Tt&&i.drawBuffers(lt)}function Yt(z){return M!==z?(i.useProgram(z),M=z,!0):!1}let he={[os]:i.FUNC_ADD,[$h]:i.FUNC_SUBTRACT,[Jh]:i.FUNC_REVERSE_SUBTRACT};he[Kh]=i.MIN,he[jh]=i.MAX;let st={[Qh]:i.ZERO,[tu]:i.ONE,[eu]:i.SRC_COLOR,[mc]:i.SRC_ALPHA,[au]:i.SRC_ALPHA_SATURATE,[ru]:i.DST_COLOR,[iu]:i.DST_ALPHA,[nu]:i.ONE_MINUS_SRC_COLOR,[gc]:i.ONE_MINUS_SRC_ALPHA,[ou]:i.ONE_MINUS_DST_COLOR,[su]:i.ONE_MINUS_DST_ALPHA,[lu]:i.CONSTANT_COLOR,[cu]:i.ONE_MINUS_CONSTANT_COLOR,[hu]:i.CONSTANT_ALPHA,[uu]:i.ONE_MINUS_CONSTANT_ALPHA};function ot(z,Et,lt,Tt,Pt,dt,Ht,zt,we,ue){if(z===ni){m===!0&&(Mt(i.BLEND),m=!1);return}if(m===!1&&(it(i.BLEND),m=!0),z!==Zh){if(z!==p||ue!==L){if((T!==os||A!==os)&&(i.blendEquation(i.FUNC_ADD),T=os,A=os),ue)switch(z){case Hs:i.blendFuncSeparate(i.ONE,i.ONE_MINUS_SRC_ALPHA,i.ONE,i.ONE_MINUS_SRC_ALPHA);break;case dc:i.blendFunc(i.ONE,i.ONE);break;case fc:i.blendFuncSeparate(i.ZERO,i.ONE_MINUS_SRC_COLOR,i.ZERO,i.ONE);break;case pc:i.blendFuncSeparate(i.DST_COLOR,i.ONE_MINUS_SRC_ALPHA,i.ZERO,i.ONE);break;default:jt("WebGLState: Invalid blending: ",z);break}else switch(z){case Hs:i.blendFuncSeparate(i.SRC_ALPHA,i.ONE_MINUS_SRC_ALPHA,i.ONE,i.ONE_MINUS_SRC_ALPHA);break;case dc:i.blendFuncSeparate(i.SRC_ALPHA,i.ONE,i.ONE,i.ONE);break;case fc:jt("WebGLState: SubtractiveBlending requires material.premultipliedAlpha = true");break;case pc:jt("WebGLState: MultiplyBlending requires material.premultipliedAlpha = true");break;default:jt("WebGLState: Invalid blending: ",z);break}P=null,S=null,b=null,R=null,_.set(0,0,0),w=0,p=z,L=ue}return}Pt=Pt||Et,dt=dt||lt,Ht=Ht||Tt,(Et!==T||Pt!==A)&&(i.blendEquationSeparate(he[Et],he[Pt]),T=Et,A=Pt),(lt!==P||Tt!==S||dt!==b||Ht!==R)&&(i.blendFuncSeparate(st[lt],st[Tt],st[dt],st[Ht]),P=lt,S=Tt,b=dt,R=Ht),(zt.equals(_)===!1||we!==w)&&(i.blendColor(zt.r,zt.g,zt.b,we),_.copy(zt),w=we),p=z,L=!1}function ft(z,Et){z.side===ei?Mt(i.CULL_FACE):it(i.CULL_FACE);let lt=z.side===je;Et&&(lt=!lt),mt(lt),z.blending===Hs&&z.transparent===!1?ot(ni):ot(z.blending,z.blendEquation,z.blendSrc,z.blendDst,z.blendEquationAlpha,z.blendSrcAlpha,z.blendDstAlpha,z.blendColor,z.blendAlpha,z.premultipliedAlpha),o.setFunc(z.depthFunc),o.setTest(z.depthTest),o.setMask(z.depthWrite),r.setMask(z.colorWrite);let Tt=z.stencilWrite;a.setTest(Tt),Tt&&(a.setMask(z.stencilWriteMask),a.setFunc(z.stencilFunc,z.stencilRef,z.stencilFuncMask),a.setOp(z.stencilFail,z.stencilZFail,z.stencilZPass)),kt(z.polygonOffset,z.polygonOffsetFactor,z.polygonOffsetUnits),z.alphaToCoverage===!0?it(i.SAMPLE_ALPHA_TO_COVERAGE):Mt(i.SAMPLE_ALPHA_TO_COVERAGE)}function mt(z){D!==z&&(z?i.frontFace(i.CW):i.frontFace(i.CCW),D=z)}function St(z){z!==qh?(it(i.CULL_FACE),z!==B&&(z===uc?i.cullFace(i.BACK):z===Yh?i.cullFace(i.FRONT):i.cullFace(i.FRONT_AND_BACK))):Mt(i.CULL_FACE),B=z}function Xt(z){z!==G&&(V&&i.lineWidth(z),G=z)}function kt(z,Et,lt){z?(it(i.POLYGON_OFFSET_FILL),(N!==Et||C!==lt)&&(N=Et,C=lt,o.getReversed()&&(Et=-Et),i.polygonOffset(Et,lt))):Mt(i.POLYGON_OFFSET_FILL)}function $t(z){z?it(i.SCISSOR_TEST):Mt(i.SCISSOR_TEST)}function Kt(z){z===void 0&&(z=i.TEXTURE0+k-1),J!==z&&(i.activeTexture(z),J=z)}function F(z,Et,lt){lt===void 0&&(J===null?lt=i.TEXTURE0+k-1:lt=J);let Tt=et[lt];Tt===void 0&&(Tt={type:void 0,texture:void 0},et[lt]=Tt),(Tt.type!==z||Tt.texture!==Et)&&(J!==lt&&(i.activeTexture(lt),J=lt),i.bindTexture(z,Et||tt[z]),Tt.type=z,Tt.texture=Et)}function xe(){let z=et[J];z!==void 0&&z.type!==void 0&&(i.bindTexture(z.type,null),z.type=void 0,z.texture=void 0)}function ae(){try{i.compressedTexImage2D(...arguments)}catch(z){jt("WebGLState:",z)}}function E(){try{i.compressedTexImage3D(...arguments)}catch(z){jt("WebGLState:",z)}}function x(){try{i.texSubImage2D(...arguments)}catch(z){jt("WebGLState:",z)}}function H(){try{i.texSubImage3D(...arguments)}catch(z){jt("WebGLState:",z)}}function K(){try{i.compressedTexSubImage2D(...arguments)}catch(z){jt("WebGLState:",z)}}function Q(){try{i.compressedTexSubImage3D(...arguments)}catch(z){jt("WebGLState:",z)}}function pt(){try{i.texStorage2D(...arguments)}catch(z){jt("WebGLState:",z)}}function _t(){try{i.texStorage3D(...arguments)}catch(z){jt("WebGLState:",z)}}function nt(){try{i.texImage2D(...arguments)}catch(z){jt("WebGLState:",z)}}function at(){try{i.texImage3D(...arguments)}catch(z){jt("WebGLState:",z)}}function wt(z){return f[z]!==void 0?f[z]:i.getParameter(z)}function Vt(z,Et){f[z]!==Et&&(i.pixelStorei(z,Et),f[z]=Et)}function At(z){Zt.equals(z)===!1&&(i.scissor(z.x,z.y,z.z,z.w),Zt.copy(z))}function bt(z){Nt.equals(z)===!1&&(i.viewport(z.x,z.y,z.z,z.w),Nt.copy(z))}function Gt(z,Et){let lt=c.get(Et);lt===void 0&&(lt=new WeakMap,c.set(Et,lt));let Tt=lt.get(z);Tt===void 0&&(Tt=i.getUniformBlockIndex(Et,z.name),lt.set(z,Tt))}function Wt(z,Et){let Tt=c.get(Et).get(z);l.get(Et)!==Tt&&(i.uniformBlockBinding(Et,Tt,z.__bindingPointIndex),l.set(Et,Tt))}function ee(){i.disable(i.BLEND),i.disable(i.CULL_FACE),i.disable(i.DEPTH_TEST),i.disable(i.POLYGON_OFFSET_FILL),i.disable(i.SCISSOR_TEST),i.disable(i.STENCIL_TEST),i.disable(i.SAMPLE_ALPHA_TO_COVERAGE),i.blendEquation(i.FUNC_ADD),i.blendFunc(i.ONE,i.ZERO),i.blendFuncSeparate(i.ONE,i.ZERO,i.ONE,i.ZERO),i.blendColor(0,0,0,0),i.colorMask(!0,!0,!0,!0),i.clearColor(0,0,0,0),i.depthMask(!0),i.depthFunc(i.LESS),o.setReversed(!1),i.clearDepth(1),i.stencilMask(4294967295),i.stencilFunc(i.ALWAYS,0,4294967295),i.stencilOp(i.KEEP,i.KEEP,i.KEEP),i.clearStencil(0),i.cullFace(i.BACK),i.frontFace(i.CCW),i.polygonOffset(0,0),i.activeTexture(i.TEXTURE0),i.bindFramebuffer(i.FRAMEBUFFER,null),i.bindFramebuffer(i.DRAW_FRAMEBUFFER,null),i.bindFramebuffer(i.READ_FRAMEBUFFER,null),i.useProgram(null),i.lineWidth(1),i.scissor(0,0,i.canvas.width,i.canvas.height),i.viewport(0,0,i.canvas.width,i.canvas.height),i.pixelStorei(i.PACK_ALIGNMENT,4),i.pixelStorei(i.UNPACK_ALIGNMENT,4),i.pixelStorei(i.UNPACK_FLIP_Y_WEBGL,!1),i.pixelStorei(i.UNPACK_PREMULTIPLY_ALPHA_WEBGL,!1),i.pixelStorei(i.UNPACK_COLORSPACE_CONVERSION_WEBGL,i.BROWSER_DEFAULT_WEBGL),i.pixelStorei(i.PACK_ROW_LENGTH,0),i.pixelStorei(i.PACK_SKIP_PIXELS,0),i.pixelStorei(i.PACK_SKIP_ROWS,0),i.pixelStorei(i.UNPACK_ROW_LENGTH,0),i.pixelStorei(i.UNPACK_IMAGE_HEIGHT,0),i.pixelStorei(i.UNPACK_SKIP_PIXELS,0),i.pixelStorei(i.UNPACK_SKIP_ROWS,0),i.pixelStorei(i.UNPACK_SKIP_IMAGES,0),h={},f={},J=null,et={},u={},d=new WeakMap,g=[],M=null,m=!1,p=null,T=null,P=null,S=null,A=null,b=null,R=null,_=new se(0,0,0),w=0,L=!1,D=null,B=null,G=null,N=null,C=null,Zt.set(0,0,i.canvas.width,i.canvas.height),Nt.set(0,0,i.canvas.width,i.canvas.height),r.reset(),o.reset(),a.reset()}return{buffers:{color:r,depth:o,stencil:a},enable:it,disable:Mt,bindFramebuffer:Dt,drawBuffers:It,useProgram:Yt,setBlending:ot,setMaterial:ft,setFlipSided:mt,setCullFace:St,setLineWidth:Xt,setPolygonOffset:kt,setScissorTest:$t,activeTexture:Kt,bindTexture:F,unbindTexture:xe,compressedTexImage2D:ae,compressedTexImage3D:E,texImage2D:nt,texImage3D:at,pixelStorei:Vt,getParameter:wt,updateUBOMapping:Gt,uniformBlockBinding:Wt,texStorage2D:pt,texStorage3D:_t,texSubImage2D:x,texSubImage3D:H,compressedTexSubImage2D:K,compressedTexSubImage3D:Q,scissor:At,viewport:bt,reset:ee}}function Cx(i,t,e,n,s,r,o){let a=t.has("WEBGL_multisampled_render_to_texture")?t.get("WEBGL_multisampled_render_to_texture"):null,l=typeof navigator>"u"?!1:/OculusBrowser/g.test(navigator.userAgent),c=new xt,h=new WeakMap,f=new Set,u,d=new WeakMap,g=!1;try{g=typeof OffscreenCanvas<"u"&&new OffscreenCanvas(1,1).getContext("2d")!==null}catch{}function M(E,x){return g?new OffscreenCanvas(E,x):pr("canvas")}function m(E,x,H){let K=1,Q=ae(E);if((Q.width>H||Q.height>H)&&(K=H/Math.max(Q.width,Q.height)),K<1)if(typeof HTMLImageElement<"u"&&E instanceof HTMLImageElement||typeof HTMLCanvasElement<"u"&&E instanceof HTMLCanvasElement||typeof ImageBitmap<"u"&&E instanceof ImageBitmap||typeof VideoFrame<"u"&&E instanceof VideoFrame){let pt=Math.floor(K*Q.width),_t=Math.floor(K*Q.height);u===void 0&&(u=M(pt,_t));let nt=x?M(pt,_t):u;return nt.width=pt,nt.height=_t,nt.getContext("2d").drawImage(E,0,0,pt,_t),Jt("WebGLRenderer: Texture has been resized from ("+Q.width+"x"+Q.height+") to ("+pt+"x"+_t+")."),nt}else return"data"in E&&Jt("WebGLRenderer: Image in DataTexture is too big ("+Q.width+"x"+Q.height+")."),E;return E}function p(E){return E.generateMipmaps}function T(E){i.generateMipmap(E)}function P(E){return E.isWebGLCubeRenderTarget?i.TEXTURE_CUBE_MAP:E.isWebGL3DRenderTarget?i.TEXTURE_3D:E.isWebGLArrayRenderTarget||E.isCompressedArrayTexture?i.TEXTURE_2D_ARRAY:i.TEXTURE_2D}function S(E,x,H,K,Q,pt=!1){if(E!==null){if(i[E]!==void 0)return i[E];Jt("WebGLRenderer: Attempt to use non-existing WebGL internal format '"+E+"'")}let _t;K&&(_t=t.get("EXT_texture_norm16"),_t||Jt("WebGLRenderer: Unable to use normalized textures without EXT_texture_norm16 extension"));let nt=x;if(x===i.RED&&(H===i.FLOAT&&(nt=i.R32F),H===i.HALF_FLOAT&&(nt=i.R16F),H===i.UNSIGNED_BYTE&&(nt=i.R8),H===i.UNSIGNED_SHORT&&_t&&(nt=_t.R16_EXT),H===i.SHORT&&_t&&(nt=_t.R16_SNORM_EXT)),x===i.RED_INTEGER&&(H===i.UNSIGNED_BYTE&&(nt=i.R8UI),H===i.UNSIGNED_SHORT&&(nt=i.R16UI),H===i.UNSIGNED_INT&&(nt=i.R32UI),H===i.BYTE&&(nt=i.R8I),H===i.SHORT&&(nt=i.R16I),H===i.INT&&(nt=i.R32I)),x===i.RG&&(H===i.FLOAT&&(nt=i.RG32F),H===i.HALF_FLOAT&&(nt=i.RG16F),H===i.UNSIGNED_BYTE&&(nt=i.RG8),H===i.UNSIGNED_SHORT&&_t&&(nt=_t.RG16_EXT),H===i.SHORT&&_t&&(nt=_t.RG16_SNORM_EXT)),x===i.RG_INTEGER&&(H===i.UNSIGNED_BYTE&&(nt=i.RG8UI),H===i.UNSIGNED_SHORT&&(nt=i.RG16UI),H===i.UNSIGNED_INT&&(nt=i.RG32UI),H===i.BYTE&&(nt=i.RG8I),H===i.SHORT&&(nt=i.RG16I),H===i.INT&&(nt=i.RG32I)),x===i.RGB_INTEGER&&(H===i.UNSIGNED_BYTE&&(nt=i.RGB8UI),H===i.UNSIGNED_SHORT&&(nt=i.RGB16UI),H===i.UNSIGNED_INT&&(nt=i.RGB32UI),H===i.BYTE&&(nt=i.RGB8I),H===i.SHORT&&(nt=i.RGB16I),H===i.INT&&(nt=i.RGB32I)),x===i.RGBA_INTEGER&&(H===i.UNSIGNED_BYTE&&(nt=i.RGBA8UI),H===i.UNSIGNED_SHORT&&(nt=i.RGBA16UI),H===i.UNSIGNED_INT&&(nt=i.RGBA32UI),H===i.BYTE&&(nt=i.RGBA8I),H===i.SHORT&&(nt=i.RGBA16I),H===i.INT&&(nt=i.RGBA32I)),x===i.RGB&&(H===i.UNSIGNED_SHORT&&_t&&(nt=_t.RGB16_EXT),H===i.SHORT&&_t&&(nt=_t.RGB16_SNORM_EXT),H===i.UNSIGNED_INT_5_9_9_9_REV&&(nt=i.RGB9_E5),H===i.UNSIGNED_INT_10F_11F_11F_REV&&(nt=i.R11F_G11F_B10F)),x===i.RGBA){let at=pt?fr:pe.getTransfer(Q);H===i.FLOAT&&(nt=i.RGBA32F),H===i.HALF_FLOAT&&(nt=i.RGBA16F),H===i.UNSIGNED_BYTE&&(nt=at===Me?i.SRGB8_ALPHA8:i.RGBA8),H===i.UNSIGNED_SHORT&&_t&&(nt=_t.RGBA16_EXT),H===i.SHORT&&_t&&(nt=_t.RGBA16_SNORM_EXT),H===i.UNSIGNED_SHORT_4_4_4_4&&(nt=i.RGBA4),H===i.UNSIGNED_SHORT_5_5_5_1&&(nt=i.RGB5_A1)}return(nt===i.R16F||nt===i.R32F||nt===i.RG16F||nt===i.RG32F||nt===i.RGBA16F||nt===i.RGBA32F)&&t.get("EXT_color_buffer_float"),nt}function A(E,x){let H;return E?x===null||x===Vn||x===Xs?H=i.DEPTH24_STENCIL8:x===Gn?H=i.DEPTH32F_STENCIL8:x===Ws&&(H=i.DEPTH24_STENCIL8,Jt("DepthTexture: 16 bit depth attachment is not supported with stencil. Using 24-bit attachment.")):x===null||x===Vn||x===Xs?H=i.DEPTH_COMPONENT24:x===Gn?H=i.DEPTH_COMPONENT32F:x===Ws&&(H=i.DEPTH_COMPONENT16),H}function b(E,x){return p(E)===!0||E.isFramebufferTexture&&E.minFilter!==Ze&&E.minFilter!==Je?Math.log2(Math.max(x.width,x.height))+1:E.mipmaps!==void 0&&E.mipmaps.length>0?E.mipmaps.length:E.isCompressedTexture&&Array.isArray(E.image)?x.mipmaps.length:1}function R(E){let x=E.target;x.removeEventListener("dispose",R),w(x),x.isVideoTexture&&h.delete(x),x.isHTMLTexture&&f.delete(x)}function _(E){let x=E.target;x.removeEventListener("dispose",_),D(x)}function w(E){let x=n.get(E);if(x.__webglInit===void 0)return;let H=E.source,K=d.get(H);if(K){let Q=K[x.__cacheKey];Q.usedTimes--,Q.usedTimes===0&&L(E),Object.keys(K).length===0&&d.delete(H)}n.remove(E)}function L(E){let x=n.get(E);i.deleteTexture(x.__webglTexture);let H=E.source,K=d.get(H);delete K[x.__cacheKey],o.memory.textures--}function D(E){let x=n.get(E);if(E.depthTexture&&(E.depthTexture.dispose(),n.remove(E.depthTexture)),E.isWebGLCubeRenderTarget)for(let K=0;K<6;K++){if(Array.isArray(x.__webglFramebuffer[K]))for(let Q=0;Q<x.__webglFramebuffer[K].length;Q++)i.deleteFramebuffer(x.__webglFramebuffer[K][Q]);else i.deleteFramebuffer(x.__webglFramebuffer[K]);x.__webglDepthbuffer&&i.deleteRenderbuffer(x.__webglDepthbuffer[K])}else{if(Array.isArray(x.__webglFramebuffer))for(let K=0;K<x.__webglFramebuffer.length;K++)i.deleteFramebuffer(x.__webglFramebuffer[K]);else i.deleteFramebuffer(x.__webglFramebuffer);if(x.__webglDepthbuffer&&i.deleteRenderbuffer(x.__webglDepthbuffer),x.__webglMultisampledFramebuffer&&i.deleteFramebuffer(x.__webglMultisampledFramebuffer),x.__webglColorRenderbuffer)for(let K=0;K<x.__webglColorRenderbuffer.length;K++)x.__webglColorRenderbuffer[K]&&i.deleteRenderbuffer(x.__webglColorRenderbuffer[K]);x.__webglDepthRenderbuffer&&i.deleteRenderbuffer(x.__webglDepthRenderbuffer)}let H=E.textures;for(let K=0,Q=H.length;K<Q;K++){let pt=n.get(H[K]);pt.__webglTexture&&(i.deleteTexture(pt.__webglTexture),o.memory.textures--),n.remove(H[K])}n.remove(E)}let B=0;function G(){B=0}function N(){return B}function C(E){B=E}function k(){let E=B;return E>=s.maxTextures&&Jt("WebGLTextures: Trying to use "+(E+1)+" texture units while this GPU supports only "+s.maxTextures),B+=1,E}function V(E){let x=[];return x.push(E.wrapS),x.push(E.wrapT),x.push(E.wrapR||0),x.push(E.magFilter),x.push(E.minFilter),x.push(E.anisotropy),x.push(E.internalFormat),x.push(E.format),x.push(E.type),x.push(E.generateMipmaps),x.push(E.premultiplyAlpha),x.push(E.flipY),x.push(E.unpackAlignment),x.push(E.colorSpace),x.join()}function j(E,x){let H=n.get(E);if(E.isVideoTexture&&F(E),E.isRenderTargetTexture===!1&&E.isExternalTexture!==!0&&E.version>0&&H.__version!==E.version){let K=E.image;if(K===null)Jt("WebGLRenderer: Texture marked for update but no image data found.");else if(K.complete===!1)Jt("WebGLRenderer: Texture marked for update but image is incomplete");else{Mt(H,E,x);return}}else E.isExternalTexture&&(H.__webglTexture=E.sourceTexture?E.sourceTexture:null);e.bindTexture(i.TEXTURE_2D,H.__webglTexture,i.TEXTURE0+x)}function W(E,x){let H=n.get(E);if(E.isRenderTargetTexture===!1&&E.version>0&&H.__version!==E.version){Mt(H,E,x);return}else E.isExternalTexture&&(H.__webglTexture=E.sourceTexture?E.sourceTexture:null);e.bindTexture(i.TEXTURE_2D_ARRAY,H.__webglTexture,i.TEXTURE0+x)}function J(E,x){let H=n.get(E);if(E.isRenderTargetTexture===!1&&E.version>0&&H.__version!==E.version){Mt(H,E,x);return}e.bindTexture(i.TEXTURE_3D,H.__webglTexture,i.TEXTURE0+x)}function et(E,x){let H=n.get(E);if(E.isCubeDepthTexture!==!0&&E.version>0&&H.__version!==E.version){Dt(H,E,x);return}e.bindTexture(i.TEXTURE_CUBE_MAP,H.__webglTexture,i.TEXTURE0+x)}let vt={[Oo]:i.REPEAT,[Yn]:i.CLAMP_TO_EDGE,[Bo]:i.MIRRORED_REPEAT},rt={[Ze]:i.NEAREST,[pu]:i.NEAREST_MIPMAP_NEAREST,[Br]:i.NEAREST_MIPMAP_LINEAR,[Je]:i.LINEAR,[va]:i.LINEAR_MIPMAP_NEAREST,[ki]:i.LINEAR_MIPMAP_LINEAR},Zt={[xu]:i.NEVER,[Su]:i.ALWAYS,[_u]:i.LESS,[rl]:i.LEQUAL,[yu]:i.EQUAL,[ol]:i.GEQUAL,[vu]:i.GREATER,[Mu]:i.NOTEQUAL};function Nt(E,x){if(x.type===Gn&&t.has("OES_texture_float_linear")===!1&&(x.magFilter===Je||x.magFilter===va||x.magFilter===Br||x.magFilter===ki||x.minFilter===Je||x.minFilter===va||x.minFilter===Br||x.minFilter===ki)&&Jt("WebGLRenderer: Unable to use linear filtering with floating point textures. OES_texture_float_linear not supported on this device."),i.texParameteri(E,i.TEXTURE_WRAP_S,vt[x.wrapS]),i.texParameteri(E,i.TEXTURE_WRAP_T,vt[x.wrapT]),(E===i.TEXTURE_3D||E===i.TEXTURE_2D_ARRAY)&&i.texParameteri(E,i.TEXTURE_WRAP_R,vt[x.wrapR]),i.texParameteri(E,i.TEXTURE_MAG_FILTER,rt[x.magFilter]),i.texParameteri(E,i.TEXTURE_MIN_FILTER,rt[x.minFilter]),x.compareFunction&&(i.texParameteri(E,i.TEXTURE_COMPARE_MODE,i.COMPARE_REF_TO_TEXTURE),i.texParameteri(E,i.TEXTURE_COMPARE_FUNC,Zt[x.compareFunction])),t.has("EXT_texture_filter_anisotropic")===!0){if(x.magFilter===Ze||x.minFilter!==Br&&x.minFilter!==ki||x.type===Gn&&t.has("OES_texture_float_linear")===!1)return;if(x.anisotropy>1||n.get(x).__currentAnisotropy){let H=t.get("EXT_texture_filter_anisotropic");i.texParameterf(E,H.TEXTURE_MAX_ANISOTROPY_EXT,Math.min(x.anisotropy,s.getMaxAnisotropy())),n.get(x).__currentAnisotropy=x.anisotropy}}}function ne(E,x){let H=!1;E.__webglInit===void 0&&(E.__webglInit=!0,x.addEventListener("dispose",R));let K=x.source,Q=d.get(K);Q===void 0&&(Q={},d.set(K,Q));let pt=V(x);if(pt!==E.__cacheKey){Q[pt]===void 0&&(Q[pt]={texture:i.createTexture(),usedTimes:0},o.memory.textures++,H=!0),Q[pt].usedTimes++;let _t=Q[E.__cacheKey];_t!==void 0&&(Q[E.__cacheKey].usedTimes--,_t.usedTimes===0&&L(x)),E.__cacheKey=pt,E.__webglTexture=Q[pt].texture}return H}function tt(E,x,H){return Math.floor(Math.floor(E/H)/x)}function it(E,x,H,K){let pt=E.updateRanges;if(pt.length===0)e.texSubImage2D(i.TEXTURE_2D,0,0,0,x.width,x.height,H,K,x.data);else{pt.sort((Vt,At)=>Vt.start-At.start);let _t=0;for(let Vt=1;Vt<pt.length;Vt++){let At=pt[_t],bt=pt[Vt],Gt=At.start+At.count,Wt=tt(bt.start,x.width,4),ee=tt(At.start,x.width,4);bt.start<=Gt+1&&Wt===ee&&tt(bt.start+bt.count-1,x.width,4)===Wt?At.count=Math.max(At.count,bt.start+bt.count-At.start):(++_t,pt[_t]=bt)}pt.length=_t+1;let nt=e.getParameter(i.UNPACK_ROW_LENGTH),at=e.getParameter(i.UNPACK_SKIP_PIXELS),wt=e.getParameter(i.UNPACK_SKIP_ROWS);e.pixelStorei(i.UNPACK_ROW_LENGTH,x.width);for(let Vt=0,At=pt.length;Vt<At;Vt++){let bt=pt[Vt],Gt=Math.floor(bt.start/4),Wt=Math.ceil(bt.count/4),ee=Gt%x.width,z=Math.floor(Gt/x.width),Et=Wt,lt=1;e.pixelStorei(i.UNPACK_SKIP_PIXELS,ee),e.pixelStorei(i.UNPACK_SKIP_ROWS,z),e.texSubImage2D(i.TEXTURE_2D,0,ee,z,Et,lt,H,K,x.data)}E.clearUpdateRanges(),e.pixelStorei(i.UNPACK_ROW_LENGTH,nt),e.pixelStorei(i.UNPACK_SKIP_PIXELS,at),e.pixelStorei(i.UNPACK_SKIP_ROWS,wt)}}function Mt(E,x,H){let K=i.TEXTURE_2D;(x.isDataArrayTexture||x.isCompressedArrayTexture)&&(K=i.TEXTURE_2D_ARRAY),x.isData3DTexture&&(K=i.TEXTURE_3D);let Q=ne(E,x),pt=x.source;e.bindTexture(K,E.__webglTexture,i.TEXTURE0+H);let _t=n.get(pt);if(pt.version!==_t.__version||Q===!0){if(e.activeTexture(i.TEXTURE0+H),(typeof ImageBitmap<"u"&&x.image instanceof ImageBitmap)===!1){let lt=pe.getPrimaries(pe.workingColorSpace),Tt=x.colorSpace===gi?null:pe.getPrimaries(x.colorSpace),Pt=x.colorSpace===gi||lt===Tt?i.NONE:i.BROWSER_DEFAULT_WEBGL;e.pixelStorei(i.UNPACK_FLIP_Y_WEBGL,x.flipY),e.pixelStorei(i.UNPACK_PREMULTIPLY_ALPHA_WEBGL,x.premultiplyAlpha),e.pixelStorei(i.UNPACK_COLORSPACE_CONVERSION_WEBGL,Pt)}e.pixelStorei(i.UNPACK_ALIGNMENT,x.unpackAlignment);let at=m(x.image,!1,s.maxTextureSize);at=xe(x,at);let wt=r.convert(x.format,x.colorSpace),Vt=r.convert(x.type),At=S(x.internalFormat,wt,Vt,x.normalized,x.colorSpace,x.isVideoTexture);Nt(K,x);let bt,Gt=x.mipmaps,Wt=x.isVideoTexture!==!0,ee=_t.__version===void 0||Q===!0,z=pt.dataReady,Et=b(x,at);if(x.isDepthTexture)At=A(x.format===Vi,x.type),ee&&(Wt?e.texStorage2D(i.TEXTURE_2D,1,At,at.width,at.height):e.texImage2D(i.TEXTURE_2D,0,At,at.width,at.height,0,wt,Vt,null));else if(x.isDataTexture)if(Gt.length>0){Wt&&ee&&e.texStorage2D(i.TEXTURE_2D,Et,At,Gt[0].width,Gt[0].height);for(let lt=0,Tt=Gt.length;lt<Tt;lt++)bt=Gt[lt],Wt?z&&e.texSubImage2D(i.TEXTURE_2D,lt,0,0,bt.width,bt.height,wt,Vt,bt.data):e.texImage2D(i.TEXTURE_2D,lt,At,bt.width,bt.height,0,wt,Vt,bt.data);x.generateMipmaps=!1}else Wt?(ee&&e.texStorage2D(i.TEXTURE_2D,Et,At,at.width,at.height),z&&it(x,at,wt,Vt)):e.texImage2D(i.TEXTURE_2D,0,At,at.width,at.height,0,wt,Vt,at.data);else if(x.isCompressedTexture)if(x.isCompressedArrayTexture){Wt&&ee&&e.texStorage3D(i.TEXTURE_2D_ARRAY,Et,At,Gt[0].width,Gt[0].height,at.depth);for(let lt=0,Tt=Gt.length;lt<Tt;lt++)if(bt=Gt[lt],x.format!==In)if(wt!==null)if(Wt){if(z)if(x.layerUpdates.size>0){let Pt=kc(bt.width,bt.height,x.format,x.type);for(let dt of x.layerUpdates){let Ht=bt.data.subarray(dt*Pt/bt.data.BYTES_PER_ELEMENT,(dt+1)*Pt/bt.data.BYTES_PER_ELEMENT);e.compressedTexSubImage3D(i.TEXTURE_2D_ARRAY,lt,0,0,dt,bt.width,bt.height,1,wt,Ht)}}else e.compressedTexSubImage3D(i.TEXTURE_2D_ARRAY,lt,0,0,0,bt.width,bt.height,at.depth,wt,bt.data)}else e.compressedTexImage3D(i.TEXTURE_2D_ARRAY,lt,At,bt.width,bt.height,at.depth,0,bt.data,0,0);else Jt("WebGLRenderer: Attempt to load unsupported compressed texture format in .uploadTexture()");else Wt?z&&e.texSubImage3D(i.TEXTURE_2D_ARRAY,lt,0,0,0,bt.width,bt.height,at.depth,wt,Vt,bt.data):e.texImage3D(i.TEXTURE_2D_ARRAY,lt,At,bt.width,bt.height,at.depth,0,wt,Vt,bt.data);x.layerUpdates.size>0&&x.clearLayerUpdates()}else{Wt&&ee&&e.texStorage2D(i.TEXTURE_2D,Et,At,Gt[0].width,Gt[0].height);for(let lt=0,Tt=Gt.length;lt<Tt;lt++)bt=Gt[lt],x.format!==In?wt!==null?Wt?z&&e.compressedTexSubImage2D(i.TEXTURE_2D,lt,0,0,bt.width,bt.height,wt,bt.data):e.compressedTexImage2D(i.TEXTURE_2D,lt,At,bt.width,bt.height,0,bt.data):Jt("WebGLRenderer: Attempt to load unsupported compressed texture format in .uploadTexture()"):Wt?z&&e.texSubImage2D(i.TEXTURE_2D,lt,0,0,bt.width,bt.height,wt,Vt,bt.data):e.texImage2D(i.TEXTURE_2D,lt,At,bt.width,bt.height,0,wt,Vt,bt.data)}else if(x.isDataArrayTexture)if(Wt){if(ee&&e.texStorage3D(i.TEXTURE_2D_ARRAY,Et,At,at.width,at.height,at.depth),z)if(x.layerUpdates.size>0){let lt=kc(at.width,at.height,x.format,x.type);for(let Tt of x.layerUpdates){let Pt=at.data.subarray(Tt*lt/at.data.BYTES_PER_ELEMENT,(Tt+1)*lt/at.data.BYTES_PER_ELEMENT);e.texSubImage3D(i.TEXTURE_2D_ARRAY,0,0,0,Tt,at.width,at.height,1,wt,Vt,Pt)}x.clearLayerUpdates()}else e.texSubImage3D(i.TEXTURE_2D_ARRAY,0,0,0,0,at.width,at.height,at.depth,wt,Vt,at.data)}else e.texImage3D(i.TEXTURE_2D_ARRAY,0,At,at.width,at.height,at.depth,0,wt,Vt,at.data);else if(x.isData3DTexture)Wt?(ee&&e.texStorage3D(i.TEXTURE_3D,Et,At,at.width,at.height,at.depth),z&&e.texSubImage3D(i.TEXTURE_3D,0,0,0,0,at.width,at.height,at.depth,wt,Vt,at.data)):e.texImage3D(i.TEXTURE_3D,0,At,at.width,at.height,at.depth,0,wt,Vt,at.data);else if(x.isFramebufferTexture){if(ee)if(Wt)e.texStorage2D(i.TEXTURE_2D,Et,At,at.width,at.height);else{let lt=at.width,Tt=at.height;for(let Pt=0;Pt<Et;Pt++)e.texImage2D(i.TEXTURE_2D,Pt,At,lt,Tt,0,wt,Vt,null),lt>>=1,Tt>>=1}}else if(x.isHTMLTexture){if("texElementImage2D"in i){let lt=i.canvas;if(lt.hasAttribute("layoutsubtree")||lt.setAttribute("layoutsubtree","true"),at.parentNode!==lt){lt.appendChild(at),f.add(x),lt.onpaint=Tt=>{let Pt=Tt.changedElements;for(let dt of f)Pt.includes(dt.image)&&(dt.needsUpdate=!0)},lt.requestPaint();return}if(i.texElementImage2D.length===3)i.texElementImage2D(i.TEXTURE_2D,i.RGBA8,at);else{let Pt=i.RGBA,dt=i.RGBA,Ht=i.UNSIGNED_BYTE;i.texElementImage2D(i.TEXTURE_2D,0,Pt,dt,Ht,at)}i.texParameteri(i.TEXTURE_2D,i.TEXTURE_MIN_FILTER,i.LINEAR),i.texParameteri(i.TEXTURE_2D,i.TEXTURE_WRAP_S,i.CLAMP_TO_EDGE),i.texParameteri(i.TEXTURE_2D,i.TEXTURE_WRAP_T,i.CLAMP_TO_EDGE)}}else if(Gt.length>0){if(Wt&&ee){let lt=ae(Gt[0]);e.texStorage2D(i.TEXTURE_2D,Et,At,lt.width,lt.height)}for(let lt=0,Tt=Gt.length;lt<Tt;lt++)bt=Gt[lt],Wt?z&&e.texSubImage2D(i.TEXTURE_2D,lt,0,0,wt,Vt,bt):e.texImage2D(i.TEXTURE_2D,lt,At,wt,Vt,bt);x.generateMipmaps=!1}else if(Wt){if(ee){let lt=ae(at);e.texStorage2D(i.TEXTURE_2D,Et,At,lt.width,lt.height)}z&&e.texSubImage2D(i.TEXTURE_2D,0,0,0,wt,Vt,at)}else e.texImage2D(i.TEXTURE_2D,0,At,wt,Vt,at);p(x)&&T(K),_t.__version=pt.version,x.onUpdate&&x.onUpdate(x)}E.__version=x.version}function Dt(E,x,H){if(x.image.length!==6)return;let K=ne(E,x),Q=x.source;e.bindTexture(i.TEXTURE_CUBE_MAP,E.__webglTexture,i.TEXTURE0+H);let pt=n.get(Q);if(Q.version!==pt.__version||K===!0){e.activeTexture(i.TEXTURE0+H);let _t=pe.getPrimaries(pe.workingColorSpace),nt=x.colorSpace===gi?null:pe.getPrimaries(x.colorSpace),at=x.colorSpace===gi||_t===nt?i.NONE:i.BROWSER_DEFAULT_WEBGL;e.pixelStorei(i.UNPACK_FLIP_Y_WEBGL,x.flipY),e.pixelStorei(i.UNPACK_PREMULTIPLY_ALPHA_WEBGL,x.premultiplyAlpha),e.pixelStorei(i.UNPACK_ALIGNMENT,x.unpackAlignment),e.pixelStorei(i.UNPACK_COLORSPACE_CONVERSION_WEBGL,at);let wt=x.isCompressedTexture||x.image[0].isCompressedTexture,Vt=x.image[0]&&x.image[0].isDataTexture,At=[];for(let dt=0;dt<6;dt++)!wt&&!Vt?At[dt]=m(x.image[dt],!0,s.maxCubemapSize):At[dt]=Vt?x.image[dt].image:x.image[dt],At[dt]=xe(x,At[dt]);let bt=At[0],Gt=r.convert(x.format,x.colorSpace),Wt=r.convert(x.type),ee=S(x.internalFormat,Gt,Wt,x.normalized,x.colorSpace),z=x.isVideoTexture!==!0,Et=pt.__version===void 0||K===!0,lt=Q.dataReady,Tt=b(x,bt);Nt(i.TEXTURE_CUBE_MAP,x);let Pt;if(wt){z&&Et&&e.texStorage2D(i.TEXTURE_CUBE_MAP,Tt,ee,bt.width,bt.height);for(let dt=0;dt<6;dt++){Pt=At[dt].mipmaps;for(let Ht=0;Ht<Pt.length;Ht++){let zt=Pt[Ht];x.format!==In?Gt!==null?z?lt&&e.compressedTexSubImage2D(i.TEXTURE_CUBE_MAP_POSITIVE_X+dt,Ht,0,0,zt.width,zt.height,Gt,zt.data):e.compressedTexImage2D(i.TEXTURE_CUBE_MAP_POSITIVE_X+dt,Ht,ee,zt.width,zt.height,0,zt.data):Jt("WebGLRenderer: Attempt to load unsupported compressed texture format in .setTextureCube()"):z?lt&&e.texSubImage2D(i.TEXTURE_CUBE_MAP_POSITIVE_X+dt,Ht,0,0,zt.width,zt.height,Gt,Wt,zt.data):e.texImage2D(i.TEXTURE_CUBE_MAP_POSITIVE_X+dt,Ht,ee,zt.width,zt.height,0,Gt,Wt,zt.data)}}}else{if(Pt=x.mipmaps,z&&Et){Pt.length>0&&Tt++;let dt=ae(At[0]);e.texStorage2D(i.TEXTURE_CUBE_MAP,Tt,ee,dt.width,dt.height)}for(let dt=0;dt<6;dt++)if(Vt){z?lt&&e.texSubImage2D(i.TEXTURE_CUBE_MAP_POSITIVE_X+dt,0,0,0,At[dt].width,At[dt].height,Gt,Wt,At[dt].data):e.texImage2D(i.TEXTURE_CUBE_MAP_POSITIVE_X+dt,0,ee,At[dt].width,At[dt].height,0,Gt,Wt,At[dt].data);for(let Ht=0;Ht<Pt.length;Ht++){let we=Pt[Ht].image[dt].image;z?lt&&e.texSubImage2D(i.TEXTURE_CUBE_MAP_POSITIVE_X+dt,Ht+1,0,0,we.width,we.height,Gt,Wt,we.data):e.texImage2D(i.TEXTURE_CUBE_MAP_POSITIVE_X+dt,Ht+1,ee,we.width,we.height,0,Gt,Wt,we.data)}}else{z?lt&&e.texSubImage2D(i.TEXTURE_CUBE_MAP_POSITIVE_X+dt,0,0,0,Gt,Wt,At[dt]):e.texImage2D(i.TEXTURE_CUBE_MAP_POSITIVE_X+dt,0,ee,Gt,Wt,At[dt]);for(let Ht=0;Ht<Pt.length;Ht++){let zt=Pt[Ht];z?lt&&e.texSubImage2D(i.TEXTURE_CUBE_MAP_POSITIVE_X+dt,Ht+1,0,0,Gt,Wt,zt.image[dt]):e.texImage2D(i.TEXTURE_CUBE_MAP_POSITIVE_X+dt,Ht+1,ee,Gt,Wt,zt.image[dt])}}}p(x)&&T(i.TEXTURE_CUBE_MAP),pt.__version=Q.version,x.onUpdate&&x.onUpdate(x)}E.__version=x.version}function It(E,x,H,K,Q,pt){let _t=r.convert(H.format,H.colorSpace),nt=r.convert(H.type),at=S(H.internalFormat,_t,nt,H.normalized,H.colorSpace),wt=n.get(x),Vt=n.get(H);if(Vt.__renderTarget=x,!wt.__hasExternalTextures){let At=Math.max(1,x.width>>pt),bt=Math.max(1,x.height>>pt);Q===i.TEXTURE_3D||Q===i.TEXTURE_2D_ARRAY?e.texImage3D(Q,pt,at,At,bt,x.depth,0,_t,nt,null):e.texImage2D(Q,pt,at,At,bt,0,_t,nt,null)}e.bindFramebuffer(i.FRAMEBUFFER,E),Kt(x)?a.framebufferTexture2DMultisampleEXT(i.FRAMEBUFFER,K,Q,Vt.__webglTexture,0,$t(x)):(Q===i.TEXTURE_2D||Q>=i.TEXTURE_CUBE_MAP_POSITIVE_X&&Q<=i.TEXTURE_CUBE_MAP_NEGATIVE_Z)&&i.framebufferTexture2D(i.FRAMEBUFFER,K,Q,Vt.__webglTexture,pt),e.bindFramebuffer(i.FRAMEBUFFER,null)}function Yt(E,x,H){if(i.bindRenderbuffer(i.RENDERBUFFER,E),x.depthBuffer){let K=x.depthTexture,Q=K&&K.isDepthTexture?K.type:null,pt=A(x.stencilBuffer,Q),_t=x.stencilBuffer?i.DEPTH_STENCIL_ATTACHMENT:i.DEPTH_ATTACHMENT;Kt(x)?a.renderbufferStorageMultisampleEXT(i.RENDERBUFFER,$t(x),pt,x.width,x.height):H?i.renderbufferStorageMultisample(i.RENDERBUFFER,$t(x),pt,x.width,x.height):i.renderbufferStorage(i.RENDERBUFFER,pt,x.width,x.height),i.framebufferRenderbuffer(i.FRAMEBUFFER,_t,i.RENDERBUFFER,E)}else{let K=x.textures;for(let Q=0;Q<K.length;Q++){let pt=K[Q],_t=r.convert(pt.format,pt.colorSpace),nt=r.convert(pt.type),at=S(pt.internalFormat,_t,nt,pt.normalized,pt.colorSpace);Kt(x)?a.renderbufferStorageMultisampleEXT(i.RENDERBUFFER,$t(x),at,x.width,x.height):H?i.renderbufferStorageMultisample(i.RENDERBUFFER,$t(x),at,x.width,x.height):i.renderbufferStorage(i.RENDERBUFFER,at,x.width,x.height)}}i.bindRenderbuffer(i.RENDERBUFFER,null)}function he(E,x,H){let K=x.isWebGLCubeRenderTarget===!0;if(e.bindFramebuffer(i.FRAMEBUFFER,E),!(x.depthTexture&&x.depthTexture.isDepthTexture))throw new Error("THREE.WebGLTextures: renderTarget.depthTexture must be an instance of THREE.DepthTexture.");let Q=n.get(x.depthTexture);if(Q.__renderTarget=x,(!Q.__webglTexture||x.depthTexture.image.width!==x.width||x.depthTexture.image.height!==x.height)&&(x.depthTexture.image.width=x.width,x.depthTexture.image.height=x.height,x.depthTexture.needsUpdate=!0),K){if(Q.__webglInit===void 0&&(Q.__webglInit=!0,x.depthTexture.addEventListener("dispose",R)),Q.__webglTexture===void 0){Q.__webglTexture=i.createTexture(),e.bindTexture(i.TEXTURE_CUBE_MAP,Q.__webglTexture),Nt(i.TEXTURE_CUBE_MAP,x.depthTexture);let wt=r.convert(x.depthTexture.format),Vt=r.convert(x.depthTexture.type),At;x.depthTexture.format===Zn?At=i.DEPTH_COMPONENT24:x.depthTexture.format===Vi&&(At=i.DEPTH24_STENCIL8);for(let bt=0;bt<6;bt++)i.texImage2D(i.TEXTURE_CUBE_MAP_POSITIVE_X+bt,0,At,x.width,x.height,0,wt,Vt,null)}}else j(x.depthTexture,0);let pt=Q.__webglTexture,_t=$t(x),nt=K?i.TEXTURE_CUBE_MAP_POSITIVE_X+H:i.TEXTURE_2D,at=x.depthTexture.format===Vi?i.DEPTH_STENCIL_ATTACHMENT:i.DEPTH_ATTACHMENT;if(x.depthTexture.format===Zn)Kt(x)?a.framebufferTexture2DMultisampleEXT(i.FRAMEBUFFER,at,nt,pt,0,_t):i.framebufferTexture2D(i.FRAMEBUFFER,at,nt,pt,0);else if(x.depthTexture.format===Vi)Kt(x)?a.framebufferTexture2DMultisampleEXT(i.FRAMEBUFFER,at,nt,pt,0,_t):i.framebufferTexture2D(i.FRAMEBUFFER,at,nt,pt,0);else throw new Error("THREE.WebGLTextures: Unknown depthTexture format.")}function st(E){let x=n.get(E),H=E.isWebGLCubeRenderTarget===!0;if(x.__boundDepthTexture!==E.depthTexture){let K=E.depthTexture;if(x.__depthDisposeCallback&&x.__depthDisposeCallback(),K){let Q=()=>{delete x.__boundDepthTexture,delete x.__depthDisposeCallback,K.removeEventListener("dispose",Q)};K.addEventListener("dispose",Q),x.__depthDisposeCallback=Q}x.__boundDepthTexture=K}if(E.depthTexture&&!x.__autoAllocateDepthBuffer)if(H)for(let K=0;K<6;K++)he(x.__webglFramebuffer[K],E,K);else{let K=E.texture.mipmaps;K&&K.length>0?he(x.__webglFramebuffer[0],E,0):he(x.__webglFramebuffer,E,0)}else if(H){x.__webglDepthbuffer=[];for(let K=0;K<6;K++)if(e.bindFramebuffer(i.FRAMEBUFFER,x.__webglFramebuffer[K]),x.__webglDepthbuffer[K]===void 0)x.__webglDepthbuffer[K]=i.createRenderbuffer(),Yt(x.__webglDepthbuffer[K],E,!1);else{let Q=E.stencilBuffer?i.DEPTH_STENCIL_ATTACHMENT:i.DEPTH_ATTACHMENT,pt=x.__webglDepthbuffer[K];i.bindRenderbuffer(i.RENDERBUFFER,pt),i.framebufferRenderbuffer(i.FRAMEBUFFER,Q,i.RENDERBUFFER,pt)}}else{let K=E.texture.mipmaps;if(K&&K.length>0?e.bindFramebuffer(i.FRAMEBUFFER,x.__webglFramebuffer[0]):e.bindFramebuffer(i.FRAMEBUFFER,x.__webglFramebuffer),x.__webglDepthbuffer===void 0)x.__webglDepthbuffer=i.createRenderbuffer(),Yt(x.__webglDepthbuffer,E,!1);else{let Q=E.stencilBuffer?i.DEPTH_STENCIL_ATTACHMENT:i.DEPTH_ATTACHMENT,pt=x.__webglDepthbuffer;i.bindRenderbuffer(i.RENDERBUFFER,pt),i.framebufferRenderbuffer(i.FRAMEBUFFER,Q,i.RENDERBUFFER,pt)}}e.bindFramebuffer(i.FRAMEBUFFER,null)}function ot(E,x,H){let K=n.get(E);x!==void 0&&It(K.__webglFramebuffer,E,E.texture,i.COLOR_ATTACHMENT0,i.TEXTURE_2D,0),H!==void 0&&st(E)}function ft(E){let x=E.texture,H=n.get(E),K=n.get(x);E.addEventListener("dispose",_);let Q=E.textures,pt=E.isWebGLCubeRenderTarget===!0,_t=Q.length>1;if(_t||(K.__webglTexture===void 0&&(K.__webglTexture=i.createTexture()),K.__version=x.version,o.memory.textures++),pt){H.__webglFramebuffer=[];for(let nt=0;nt<6;nt++)if(x.mipmaps&&x.mipmaps.length>0){H.__webglFramebuffer[nt]=[];for(let at=0;at<x.mipmaps.length;at++)H.__webglFramebuffer[nt][at]=i.createFramebuffer()}else H.__webglFramebuffer[nt]=i.createFramebuffer()}else{if(x.mipmaps&&x.mipmaps.length>0){H.__webglFramebuffer=[];for(let nt=0;nt<x.mipmaps.length;nt++)H.__webglFramebuffer[nt]=i.createFramebuffer()}else H.__webglFramebuffer=i.createFramebuffer();if(_t)for(let nt=0,at=Q.length;nt<at;nt++){let wt=n.get(Q[nt]);wt.__webglTexture===void 0&&(wt.__webglTexture=i.createTexture(),o.memory.textures++)}if(E.samples>0&&Kt(E)===!1){H.__webglMultisampledFramebuffer=i.createFramebuffer(),H.__webglColorRenderbuffer=[],e.bindFramebuffer(i.FRAMEBUFFER,H.__webglMultisampledFramebuffer);for(let nt=0;nt<Q.length;nt++){let at=Q[nt];H.__webglColorRenderbuffer[nt]=i.createRenderbuffer(),i.bindRenderbuffer(i.RENDERBUFFER,H.__webglColorRenderbuffer[nt]);let wt=r.convert(at.format,at.colorSpace),Vt=r.convert(at.type),At=S(at.internalFormat,wt,Vt,at.normalized,at.colorSpace,E.isXRRenderTarget===!0),bt=$t(E);i.renderbufferStorageMultisample(i.RENDERBUFFER,bt,At,E.width,E.height),i.framebufferRenderbuffer(i.FRAMEBUFFER,i.COLOR_ATTACHMENT0+nt,i.RENDERBUFFER,H.__webglColorRenderbuffer[nt])}i.bindRenderbuffer(i.RENDERBUFFER,null),E.depthBuffer&&(H.__webglDepthRenderbuffer=i.createRenderbuffer(),Yt(H.__webglDepthRenderbuffer,E,!0)),e.bindFramebuffer(i.FRAMEBUFFER,null)}}if(pt){e.bindTexture(i.TEXTURE_CUBE_MAP,K.__webglTexture),Nt(i.TEXTURE_CUBE_MAP,x);for(let nt=0;nt<6;nt++)if(x.mipmaps&&x.mipmaps.length>0)for(let at=0;at<x.mipmaps.length;at++)It(H.__webglFramebuffer[nt][at],E,x,i.COLOR_ATTACHMENT0,i.TEXTURE_CUBE_MAP_POSITIVE_X+nt,at);else It(H.__webglFramebuffer[nt],E,x,i.COLOR_ATTACHMENT0,i.TEXTURE_CUBE_MAP_POSITIVE_X+nt,0);p(x)&&T(i.TEXTURE_CUBE_MAP),e.unbindTexture()}else if(_t){for(let nt=0,at=Q.length;nt<at;nt++){let wt=Q[nt],Vt=n.get(wt),At=i.TEXTURE_2D;(E.isWebGL3DRenderTarget||E.isWebGLArrayRenderTarget)&&(At=E.isWebGL3DRenderTarget?i.TEXTURE_3D:i.TEXTURE_2D_ARRAY),e.bindTexture(At,Vt.__webglTexture),Nt(At,wt),It(H.__webglFramebuffer,E,wt,i.COLOR_ATTACHMENT0+nt,At,0),p(wt)&&T(At)}e.unbindTexture()}else{let nt=i.TEXTURE_2D;if((E.isWebGL3DRenderTarget||E.isWebGLArrayRenderTarget)&&(nt=E.isWebGL3DRenderTarget?i.TEXTURE_3D:i.TEXTURE_2D_ARRAY),e.bindTexture(nt,K.__webglTexture),Nt(nt,x),x.mipmaps&&x.mipmaps.length>0)for(let at=0;at<x.mipmaps.length;at++)It(H.__webglFramebuffer[at],E,x,i.COLOR_ATTACHMENT0,nt,at);else It(H.__webglFramebuffer,E,x,i.COLOR_ATTACHMENT0,nt,0);p(x)&&T(nt),e.unbindTexture()}E.depthBuffer&&st(E)}function mt(E){let x=E.textures;for(let H=0,K=x.length;H<K;H++){let Q=x[H];if(p(Q)){let pt=P(E),_t=n.get(Q).__webglTexture;e.bindTexture(pt,_t),T(pt),e.unbindTexture()}}}let St=[],Xt=[];function kt(E){if(E.samples>0){if(Kt(E)===!1){let x=E.textures,H=E.width,K=E.height,Q=i.COLOR_BUFFER_BIT,pt=E.stencilBuffer?i.DEPTH_STENCIL_ATTACHMENT:i.DEPTH_ATTACHMENT,_t=n.get(E),nt=x.length>1;if(nt)for(let wt=0;wt<x.length;wt++)e.bindFramebuffer(i.FRAMEBUFFER,_t.__webglMultisampledFramebuffer),i.framebufferRenderbuffer(i.FRAMEBUFFER,i.COLOR_ATTACHMENT0+wt,i.RENDERBUFFER,null),e.bindFramebuffer(i.FRAMEBUFFER,_t.__webglFramebuffer),i.framebufferTexture2D(i.DRAW_FRAMEBUFFER,i.COLOR_ATTACHMENT0+wt,i.TEXTURE_2D,null,0);e.bindFramebuffer(i.READ_FRAMEBUFFER,_t.__webglMultisampledFramebuffer);let at=E.texture.mipmaps;at&&at.length>0?e.bindFramebuffer(i.DRAW_FRAMEBUFFER,_t.__webglFramebuffer[0]):e.bindFramebuffer(i.DRAW_FRAMEBUFFER,_t.__webglFramebuffer);for(let wt=0;wt<x.length;wt++){if(E.resolveDepthBuffer&&(E.depthBuffer&&(Q|=i.DEPTH_BUFFER_BIT),E.stencilBuffer&&E.resolveStencilBuffer&&(Q|=i.STENCIL_BUFFER_BIT)),nt){i.framebufferRenderbuffer(i.READ_FRAMEBUFFER,i.COLOR_ATTACHMENT0,i.RENDERBUFFER,_t.__webglColorRenderbuffer[wt]);let Vt=n.get(x[wt]).__webglTexture;i.framebufferTexture2D(i.DRAW_FRAMEBUFFER,i.COLOR_ATTACHMENT0,i.TEXTURE_2D,Vt,0)}i.blitFramebuffer(0,0,H,K,0,0,H,K,Q,i.NEAREST),l===!0&&(St.length=0,Xt.length=0,St.push(i.COLOR_ATTACHMENT0+wt),E.depthBuffer&&E.storeMultisampledDepthBuffer===!1&&(St.push(pt),Xt.push(pt),i.invalidateFramebuffer(i.DRAW_FRAMEBUFFER,Xt)),i.invalidateFramebuffer(i.READ_FRAMEBUFFER,St))}if(e.bindFramebuffer(i.READ_FRAMEBUFFER,null),e.bindFramebuffer(i.DRAW_FRAMEBUFFER,null),nt)for(let wt=0;wt<x.length;wt++){e.bindFramebuffer(i.FRAMEBUFFER,_t.__webglMultisampledFramebuffer),i.framebufferRenderbuffer(i.FRAMEBUFFER,i.COLOR_ATTACHMENT0+wt,i.RENDERBUFFER,_t.__webglColorRenderbuffer[wt]);let Vt=n.get(x[wt]).__webglTexture;e.bindFramebuffer(i.FRAMEBUFFER,_t.__webglFramebuffer),i.framebufferTexture2D(i.DRAW_FRAMEBUFFER,i.COLOR_ATTACHMENT0+wt,i.TEXTURE_2D,Vt,0)}e.bindFramebuffer(i.DRAW_FRAMEBUFFER,_t.__webglMultisampledFramebuffer)}else if(E.depthBuffer&&E.storeMultisampledDepthBuffer===!1&&l){let x=E.stencilBuffer?i.DEPTH_STENCIL_ATTACHMENT:i.DEPTH_ATTACHMENT;i.invalidateFramebuffer(i.DRAW_FRAMEBUFFER,[x])}}}function $t(E){return Math.min(s.maxSamples,E.samples)}function Kt(E){let x=n.get(E);return E.samples>0&&t.has("WEBGL_multisampled_render_to_texture")===!0&&x.__useRenderToTexture!==!1}function F(E){let x=o.render.frame;h.get(E)!==x&&(h.set(E,x),E.update())}function xe(E,x){let H=E.colorSpace,K=E.format,Q=E.type;return E.isCompressedTexture===!0||E.isVideoTexture===!0||H!==dr&&H!==gi&&(pe.getTransfer(H)===Me?(K!==In||Q!==xn)&&Jt("WebGLTextures: sRGB encoded textures have to use RGBAFormat and UnsignedByteType."):jt("WebGLTextures: Unsupported texture color space:",H)),x}function ae(E){return typeof HTMLImageElement<"u"&&E instanceof HTMLImageElement?(c.width=E.naturalWidth||E.width,c.height=E.naturalHeight||E.height):typeof VideoFrame<"u"&&E instanceof VideoFrame?(c.width=E.displayWidth,c.height=E.displayHeight):(c.width=E.width,c.height=E.height),c}this.allocateTextureUnit=k,this.resetTextureUnits=G,this.getTextureUnits=N,this.setTextureUnits=C,this.setTexture2D=j,this.setTexture2DArray=W,this.setTexture3D=J,this.setTextureCube=et,this.rebindTextures=ot,this.setupRenderTarget=ft,this.updateRenderTargetMipmap=mt,this.updateMultisampleRenderTarget=kt,this.setupDepthRenderbuffer=st,this.setupFrameBufferTexture=It,this.useMultisampledRTT=Kt,this.isReversedDepthBuffer=function(){return e.buffers.depth.getReversed()}}function Rx(i,t){function e(n,s=gi){let r,o=pe.getTransfer(s);if(n===xn)return i.UNSIGNED_BYTE;if(n===Sa)return i.UNSIGNED_SHORT_4_4_4_4;if(n===ba)return i.UNSIGNED_SHORT_5_5_5_1;if(n===Ac)return i.UNSIGNED_INT_5_9_9_9_REV;if(n===Cc)return i.UNSIGNED_INT_10F_11F_11F_REV;if(n===Tc)return i.BYTE;if(n===Ec)return i.SHORT;if(n===Ws)return i.UNSIGNED_SHORT;if(n===Ma)return i.INT;if(n===Vn)return i.UNSIGNED_INT;if(n===Gn)return i.FLOAT;if(n===Hn)return i.HALF_FLOAT;if(n===Rc)return i.ALPHA;if(n===Ic)return i.RGB;if(n===In)return i.RGBA;if(n===Zn)return i.DEPTH_COMPONENT;if(n===Vi)return i.DEPTH_STENCIL;if(n===Pc)return i.RED;if(n===wa)return i.RED_INTEGER;if(n===Gi)return i.RG;if(n===Ta)return i.RG_INTEGER;if(n===Ea)return i.RGBA_INTEGER;if(n===zr||n===kr||n===Vr||n===Gr)if(o===Me)if(r=t.get("WEBGL_compressed_texture_s3tc_srgb"),r!==null){if(n===zr)return r.COMPRESSED_SRGB_S3TC_DXT1_EXT;if(n===kr)return r.COMPRESSED_SRGB_ALPHA_S3TC_DXT1_EXT;if(n===Vr)return r.COMPRESSED_SRGB_ALPHA_S3TC_DXT3_EXT;if(n===Gr)return r.COMPRESSED_SRGB_ALPHA_S3TC_DXT5_EXT}else return null;else if(r=t.get("WEBGL_compressed_texture_s3tc"),r!==null){if(n===zr)return r.COMPRESSED_RGB_S3TC_DXT1_EXT;if(n===kr)return r.COMPRESSED_RGBA_S3TC_DXT1_EXT;if(n===Vr)return r.COMPRESSED_RGBA_S3TC_DXT3_EXT;if(n===Gr)return r.COMPRESSED_RGBA_S3TC_DXT5_EXT}else return null;if(n===Aa||n===Ca||n===Ra||n===Ia)if(r=t.get("WEBGL_compressed_texture_pvrtc"),r!==null){if(n===Aa)return r.COMPRESSED_RGB_PVRTC_4BPPV1_IMG;if(n===Ca)return r.COMPRESSED_RGB_PVRTC_2BPPV1_IMG;if(n===Ra)return r.COMPRESSED_RGBA_PVRTC_4BPPV1_IMG;if(n===Ia)return r.COMPRESSED_RGBA_PVRTC_2BPPV1_IMG}else return null;if(n===Pa||n===La||n===Da||n===Na||n===Ua||n===Hr||n===Fa)if(r=t.get("WEBGL_compressed_texture_etc"),r!==null){if(n===Pa||n===La)return o===Me?r.COMPRESSED_SRGB8_ETC2:r.COMPRESSED_RGB8_ETC2;if(n===Da)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ETC2_EAC:r.COMPRESSED_RGBA8_ETC2_EAC;if(n===Na)return r.COMPRESSED_R11_EAC;if(n===Ua)return r.COMPRESSED_SIGNED_R11_EAC;if(n===Hr)return r.COMPRESSED_RG11_EAC;if(n===Fa)return r.COMPRESSED_SIGNED_RG11_EAC}else return null;if(n===Oa||n===Ba||n===za||n===ka||n===Va||n===Ga||n===Ha||n===Wa||n===Xa||n===qa||n===Ya||n===Za||n===$a||n===Ja)if(r=t.get("WEBGL_compressed_texture_astc"),r!==null){if(n===Oa)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ASTC_4x4_KHR:r.COMPRESSED_RGBA_ASTC_4x4_KHR;if(n===Ba)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ASTC_5x4_KHR:r.COMPRESSED_RGBA_ASTC_5x4_KHR;if(n===za)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ASTC_5x5_KHR:r.COMPRESSED_RGBA_ASTC_5x5_KHR;if(n===ka)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ASTC_6x5_KHR:r.COMPRESSED_RGBA_ASTC_6x5_KHR;if(n===Va)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ASTC_6x6_KHR:r.COMPRESSED_RGBA_ASTC_6x6_KHR;if(n===Ga)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ASTC_8x5_KHR:r.COMPRESSED_RGBA_ASTC_8x5_KHR;if(n===Ha)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ASTC_8x6_KHR:r.COMPRESSED_RGBA_ASTC_8x6_KHR;if(n===Wa)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ASTC_8x8_KHR:r.COMPRESSED_RGBA_ASTC_8x8_KHR;if(n===Xa)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ASTC_10x5_KHR:r.COMPRESSED_RGBA_ASTC_10x5_KHR;if(n===qa)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ASTC_10x6_KHR:r.COMPRESSED_RGBA_ASTC_10x6_KHR;if(n===Ya)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ASTC_10x8_KHR:r.COMPRESSED_RGBA_ASTC_10x8_KHR;if(n===Za)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ASTC_10x10_KHR:r.COMPRESSED_RGBA_ASTC_10x10_KHR;if(n===$a)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ASTC_12x10_KHR:r.COMPRESSED_RGBA_ASTC_12x10_KHR;if(n===Ja)return o===Me?r.COMPRESSED_SRGB8_ALPHA8_ASTC_12x12_KHR:r.COMPRESSED_RGBA_ASTC_12x12_KHR}else return null;if(n===Ka||n===ja||n===Qa)if(r=t.get("EXT_texture_compression_bptc"),r!==null){if(n===Ka)return o===Me?r.COMPRESSED_SRGB_ALPHA_BPTC_UNORM_EXT:r.COMPRESSED_RGBA_BPTC_UNORM_EXT;if(n===ja)return r.COMPRESSED_RGB_BPTC_SIGNED_FLOAT_EXT;if(n===Qa)return r.COMPRESSED_RGB_BPTC_UNSIGNED_FLOAT_EXT}else return null;if(n===tl||n===el||n===Wr||n===nl)if(r=t.get("EXT_texture_compression_rgtc"),r!==null){if(n===tl)return r.COMPRESSED_RED_RGTC1_EXT;if(n===el)return r.COMPRESSED_SIGNED_RED_RGTC1_EXT;if(n===Wr)return r.COMPRESSED_RED_GREEN_RGTC2_EXT;if(n===nl)return r.COMPRESSED_SIGNED_RED_GREEN_RGTC2_EXT}else return null;return n===Xs?i.UNSIGNED_INT_24_8:i[n]!==void 0?i[n]:null}return{convert:e}}var Ix=`
+void main() {
+
+	gl_Position = vec4( position, 1.0 );
+
+}`,Px=`
+uniform sampler2DArray depthColor;
+uniform float depthWidth;
+uniform float depthHeight;
+
+void main() {
+
+	vec2 coord = vec2( gl_FragCoord.x / depthWidth, gl_FragCoord.y / depthHeight );
+
+	if ( coord.x >= 1.0 ) {
+
+		gl_FragDepth = texture( depthColor, vec3( coord.x - 1.0, coord.y, 1 ) ).r;
+
+	} else {
+
+		gl_FragDepth = texture( depthColor, vec3( coord.x, coord.y, 0 ) ).r;
+
+	}
+
+}`,th=class{constructor(){this.texture=null,this.mesh=null,this.depthNear=0,this.depthFar=0}init(t,e){if(this.texture===null){let n=new yr(t.texture);(t.depthNear!==e.depthNear||t.depthFar!==e.depthFar)&&(this.depthNear=t.depthNear,this.depthFar=t.depthFar),this.texture=n}}getMesh(t){if(this.texture!==null&&this.mesh===null){let e=t.cameras[0].viewport,n=new Tn({vertexShader:Ix,fragmentShader:Px,uniforms:{depthColor:{value:this.texture},depthWidth:{value:e.z},depthHeight:{value:e.w}}});this.mesh=new Ue(new rs(20,20),n)}return this.mesh}reset(){this.texture=null,this.mesh=null}getDepthTexture(){return this.texture}},eh=class extends $n{constructor(t,e){super();let n=this,s=null,r=1,o=null,a="local-floor",l=1,c=null,h=null,f=null,u=null,d=null,g=null,M=typeof XRWebGLBinding<"u",m=new th,p={},T=e.getContextAttributes(),P=null,S=null,A=[],b=[],R=new xt,_=null,w=null,L=new fn;L.viewport=new Le;let D=new fn;D.viewport=new Le;let B=[L,D],G=new ga,N=null,C=null;this.cameraAutoUpdate=!0,this.enabled=!1,this.isPresenting=!1,this.getController=function(tt){let it=A[tt];return it===void 0&&(it=new Ds,A[tt]=it),it.getTargetRaySpace()},this.getControllerGrip=function(tt){let it=A[tt];return it===void 0&&(it=new Ds,A[tt]=it),it.getGripSpace()},this.getHand=function(tt){let it=A[tt];return it===void 0&&(it=new Ds,A[tt]=it),it.getHandSpace()};function k(tt){let it=b.indexOf(tt.inputSource);if(it===-1)return;let Mt=A[it];Mt!==void 0&&(Mt.update(tt.inputSource,tt.frame,c||o),Mt.dispatchEvent({type:tt.type,data:tt.inputSource}))}function V(){s.removeEventListener("select",k),s.removeEventListener("selectstart",k),s.removeEventListener("selectend",k),s.removeEventListener("squeeze",k),s.removeEventListener("squeezestart",k),s.removeEventListener("squeezeend",k),s.removeEventListener("end",V),s.removeEventListener("inputsourceschange",j);for(let tt=0;tt<A.length;tt++){let it=b[tt];it!==null&&(b[tt]=null,A[tt].disconnect(it))}N=null,C=null,m.reset();for(let tt in p)delete p[tt];if(t.setRenderTarget(P),d=null,u=null,f=null,s=null,S=null,ne.stop(),n.isPresenting=!1,t.setPixelRatio(_),t.setSize(R.width,R.height,!1),w!==null){let tt=w.camera;tt.fov=w.fov,tt.zoom=w.zoom,tt.updateProjectionMatrix(),w=null}n.dispatchEvent({type:"sessionend"})}this.setFramebufferScaleFactor=function(tt){r=tt,n.isPresenting===!0&&Jt("WebXRManager: Cannot change framebuffer scale while presenting.")},this.setReferenceSpaceType=function(tt){a=tt,n.isPresenting===!0&&Jt("WebXRManager: Cannot change reference space type while presenting.")},this.getReferenceSpace=function(){return c||o},this.setReferenceSpace=function(tt){c=tt},this.getBaseLayer=function(){return u!==null?u:d},this.getBinding=function(){return f===null&&M&&(f=new XRWebGLBinding(s,e)),f},this.getFrame=function(){return g},this.getSession=function(){return s},this.setSession=async function(tt){if(s=tt,s!==null){if(P=t.getRenderTarget(),s.addEventListener("select",k),s.addEventListener("selectstart",k),s.addEventListener("selectend",k),s.addEventListener("squeeze",k),s.addEventListener("squeezestart",k),s.addEventListener("squeezeend",k),s.addEventListener("end",V),s.addEventListener("inputsourceschange",j),T.xrCompatible!==!0&&await e.makeXRCompatible(),_=t.getPixelRatio(),t.getSize(R),M&&"createProjectionLayer"in XRWebGLBinding.prototype){let Mt=null,Dt=null,It=null;T.depth&&(It=T.stencil?e.DEPTH24_STENCIL8:e.DEPTH_COMPONENT24,Mt=T.stencil?Vi:Zn,Dt=T.stencil?Xs:Vn);let Yt={colorFormat:e.RGBA8,depthFormat:It,scaleFactor:r};f=this.getBinding(),u=f.createProjectionLayer(Yt),s.updateRenderState({layers:[u]}),t.setPixelRatio(1),t.setSize(u.textureWidth,u.textureHeight,!1),S=new gn(u.textureWidth,u.textureHeight,{format:In,type:xn,depthTexture:new Li(u.textureWidth,u.textureHeight,Dt,void 0,void 0,void 0,void 0,void 0,void 0,Mt),stencilBuffer:T.stencil,colorSpace:t.outputColorSpace,samples:T.antialias?4:0,resolveDepthBuffer:u.ignoreDepthValues===!1,resolveStencilBuffer:u.ignoreDepthValues===!1,storeMultisampledDepthBuffer:u.ignoreDepthValues===!1,storeMultisampledStencilBuffer:u.ignoreDepthValues===!1})}else{let Mt={antialias:T.antialias,alpha:!0,depth:T.depth,stencil:T.stencil,framebufferScaleFactor:r};d=new XRWebGLLayer(s,e,Mt),s.updateRenderState({baseLayer:d}),t.setPixelRatio(1),t.setSize(d.framebufferWidth,d.framebufferHeight,!1),S=new gn(d.framebufferWidth,d.framebufferHeight,{format:In,type:xn,colorSpace:t.outputColorSpace,stencilBuffer:T.stencil,resolveDepthBuffer:d.ignoreDepthValues===!1,resolveStencilBuffer:d.ignoreDepthValues===!1,storeMultisampledDepthBuffer:d.ignoreDepthValues===!1,storeMultisampledStencilBuffer:d.ignoreDepthValues===!1})}S.isXRRenderTarget=!0,this.setFoveation(l),c=null,o=await s.requestReferenceSpace(a),ne.setContext(s),ne.start(),n.isPresenting=!0,n.dispatchEvent({type:"sessionstart"})}},this.getEnvironmentBlendMode=function(){if(s!==null)return s.environmentBlendMode},this.getDepthTexture=function(){return m.getDepthTexture()};function j(tt){for(let it=0;it<tt.removed.length;it++){let Mt=tt.removed[it],Dt=b.indexOf(Mt);Dt>=0&&(b[Dt]=null,A[Dt].disconnect(Mt))}for(let it=0;it<tt.added.length;it++){let Mt=tt.added[it],Dt=b.indexOf(Mt);if(Dt===-1){for(let Yt=0;Yt<A.length;Yt++)if(Yt>=b.length){b.push(Mt),Dt=Yt;break}else if(b[Yt]===null){b[Yt]=Mt,Dt=Yt;break}if(Dt===-1)break}let It=A[Dt];It&&It.connect(Mt)}}let W=new O,J=new O;function et(tt,it,Mt){W.setFromMatrixPosition(it.matrixWorld),J.setFromMatrixPosition(Mt.matrixWorld);let Dt=W.distanceTo(J),It=it.projectionMatrix.elements,Yt=Mt.projectionMatrix.elements,he=It[14]/(It[10]-1),st=It[14]/(It[10]+1),ot=(It[9]+1)/It[5],ft=(It[9]-1)/It[5],mt=(It[8]-1)/It[0],St=(Yt[8]+1)/Yt[0],Xt=he*mt,kt=he*St,$t=Dt/(-mt+St),Kt=$t*-mt;if(it.matrixWorld.decompose(tt.position,tt.quaternion,tt.scale),tt.translateX(Kt),tt.translateZ($t),tt.matrixWorld.compose(tt.position,tt.quaternion,tt.scale),tt.matrixWorldInverse.copy(tt.matrixWorld).invert(),It[10]===-1)tt.projectionMatrix.copy(it.projectionMatrix),tt.projectionMatrixInverse.copy(it.projectionMatrixInverse);else{let F=he+$t,xe=st+$t,ae=Xt-Kt,E=kt+(Dt-Kt),x=ot*st/xe*F,H=ft*st/xe*F;tt.projectionMatrix.makePerspective(ae,E,x,H,F,xe),tt.projectionMatrixInverse.copy(tt.projectionMatrix).invert()}}function vt(tt,it){it===null?tt.matrixWorld.copy(tt.matrix):tt.matrixWorld.multiplyMatrices(it.matrixWorld,tt.matrix),tt.matrixWorldInverse.copy(tt.matrixWorld).invert()}this.updateCamera=function(tt){if(s===null)return;let it=tt.near,Mt=tt.far;m.texture!==null&&(m.depthNear>0&&(it=m.depthNear),m.depthFar>0&&(Mt=m.depthFar)),G.near=D.near=L.near=it,G.far=D.far=L.far=Mt,(N!==G.near||C!==G.far)&&(s.updateRenderState({depthNear:G.near,depthFar:G.far}),N=G.near,C=G.far),G.layers.mask=tt.layers.mask|6,L.layers.mask=G.layers.mask&-5,D.layers.mask=G.layers.mask&-3;let Dt=tt.parent,It=G.cameras;vt(G,Dt);for(let Yt=0;Yt<It.length;Yt++)vt(It[Yt],Dt);It.length===2?et(G,L,D):G.projectionMatrix.copy(L.projectionMatrix),w===null&&tt.isPerspectiveCamera&&(w={camera:tt,fov:tt.fov,zoom:tt.zoom}),rt(tt,G,Dt)};function rt(tt,it,Mt){Mt===null?tt.matrix.copy(it.matrixWorld):(tt.matrix.copy(Mt.matrixWorld),tt.matrix.invert(),tt.matrix.multiply(it.matrixWorld)),tt.matrix.decompose(tt.position,tt.quaternion,tt.scale),tt.updateMatrixWorld(!0),tt.projectionMatrix.copy(it.projectionMatrix),tt.projectionMatrixInverse.copy(it.projectionMatrixInverse),tt.isPerspectiveCamera&&(tt.fov=ko*2*Math.atan(1/tt.projectionMatrix.elements[5]),tt.zoom=1)}this.getCamera=function(){return G},this.getFoveation=function(){if(!(u===null&&d===null))return l},this.setFoveation=function(tt){l=tt,u!==null&&(u.fixedFoveation=tt),d!==null&&d.fixedFoveation!==void 0&&(d.fixedFoveation=tt)},this.hasDepthSensing=function(){return m.texture!==null},this.getDepthSensingMesh=function(){return m.getMesh(G)},this.getCameraTexture=function(tt){return p[tt]};let Zt=null;function Nt(tt,it){if(h=it.getViewerPose(c||o),g=it,h!==null){let Mt=h.views;d!==null&&(t.setRenderTargetFramebuffer(S,d.framebuffer),t.setRenderTarget(S));let Dt=!1;Mt.length!==G.cameras.length&&(G.cameras.length=0,Dt=!0);for(let st=0;st<Mt.length;st++){let ot=Mt[st],ft=null;if(d!==null)ft=d.getViewport(ot);else{let St=f.getViewSubImage(u,ot);ft=St.viewport,st===0&&(t.setRenderTargetTextures(S,St.colorTexture,St.depthStencilTexture),t.setRenderTarget(S))}let mt=B[st];mt===void 0&&(mt=new fn,mt.layers.enable(st),mt.viewport=new Le,B[st]=mt),mt.matrix.fromArray(ot.transform.matrix),mt.matrix.decompose(mt.position,mt.quaternion,mt.scale),mt.projectionMatrix.fromArray(ot.projectionMatrix),mt.projectionMatrixInverse.copy(mt.projectionMatrix).invert(),mt.viewport.set(ft.x,ft.y,ft.width,ft.height),st===0&&(G.matrix.copy(mt.matrix),G.matrix.decompose(G.position,G.quaternion,G.scale)),Dt===!0&&G.cameras.push(mt)}let It=s.enabledFeatures;if(It&&It.includes("depth-sensing")&&s.depthUsage=="gpu-optimized"&&M){f=n.getBinding();let st=f.getDepthInformation(Mt[0]);st&&st.isValid&&st.texture&&m.init(st,s.renderState)}if(It&&It.includes("camera-access")&&M){t.state.unbindTexture(),f=n.getBinding();for(let st=0;st<Mt.length;st++){let ot=Mt[st].camera;if(ot){let ft=p[ot];ft||(ft=new yr,p[ot]=ft);let mt=f.getCameraImage(ot);ft.sourceTexture=mt}}}}for(let Mt=0;Mt<A.length;Mt++){let Dt=b[Mt],It=A[Mt];Dt!==null&&It!==void 0&&It.update(Dt,it,c||o)}Zt&&Zt(tt,it),it.detectedPlanes&&n.dispatchEvent({type:"planesdetected",data:it}),g=null}let ne=new id;ne.setAnimationLoop(Nt),this.setAnimationLoop=function(tt){Zt=tt},this.dispose=function(){}}},Lx=new Ee,cd=new ie;cd.set(-1,0,0,0,1,0,0,0,1);function Dx(i,t){function e(m,p){m.matrixAutoUpdate===!0&&m.updateMatrix(),p.value.copy(m.matrix)}function n(m,p){p.color.getRGB(m.fogColor.value,Oc(i)),p.isFog?(m.fogNear.value=p.near,m.fogFar.value=p.far):p.isFogExp2&&(m.fogDensity.value=p.density)}function s(m,p,T,P,S){p.isNodeMaterial?p.uniformsNeedUpdate=!1:p.isMeshBasicMaterial?r(m,p):p.isMeshLambertMaterial?(r(m,p),p.envMap&&(m.envMapIntensity.value=p.envMapIntensity)):p.isMeshToonMaterial?(r(m,p),f(m,p)):p.isMeshPhongMaterial?(r(m,p),h(m,p),p.envMap&&(m.envMapIntensity.value=p.envMapIntensity)):p.isMeshStandardMaterial?(r(m,p),u(m,p),p.isMeshPhysicalMaterial&&d(m,p,S)):p.isMeshMatcapMaterial?(r(m,p),g(m,p)):p.isMeshDepthMaterial?r(m,p):p.isMeshDistanceMaterial?(r(m,p),M(m,p)):p.isMeshNormalMaterial?r(m,p):p.isLineBasicMaterial?(o(m,p),p.isLineDashedMaterial&&a(m,p)):p.isPointsMaterial?l(m,p,T,P):p.isSpriteMaterial?c(m,p):p.isShadowMaterial?(m.color.value.copy(p.color),m.opacity.value=p.opacity):p.isShaderMaterial&&(p.uniformsNeedUpdate=!1)}function r(m,p){m.opacity.value=p.opacity,p.color&&m.diffuse.value.copy(p.color),p.emissive&&m.emissive.value.copy(p.emissive).multiplyScalar(p.emissiveIntensity),p.map&&(m.map.value=p.map,e(p.map,m.mapTransform)),p.alphaMap&&(m.alphaMap.value=p.alphaMap,e(p.alphaMap,m.alphaMapTransform)),p.bumpMap&&(m.bumpMap.value=p.bumpMap,e(p.bumpMap,m.bumpMapTransform),m.bumpScale.value=p.bumpScale,p.side===je&&(m.bumpScale.value*=-1)),p.normalMap&&(m.normalMap.value=p.normalMap,e(p.normalMap,m.normalMapTransform),m.normalScale.value.copy(p.normalScale),p.side===je&&m.normalScale.value.negate()),p.displacementMap&&(m.displacementMap.value=p.displacementMap,e(p.displacementMap,m.displacementMapTransform),m.displacementScale.value=p.displacementScale,m.displacementBias.value=p.displacementBias),p.emissiveMap&&(m.emissiveMap.value=p.emissiveMap,e(p.emissiveMap,m.emissiveMapTransform)),p.specularMap&&(m.specularMap.value=p.specularMap,e(p.specularMap,m.specularMapTransform)),p.alphaTest>0&&(m.alphaTest.value=p.alphaTest);let T=t.get(p),P=T.envMap,S=T.envMapRotation;P&&(m.envMap.value=P,m.envMapRotation.value.setFromMatrix4(Lx.makeRotationFromEuler(S)).transpose(),P.isCubeTexture&&P.isRenderTargetTexture===!1&&m.envMapRotation.value.premultiply(cd),m.reflectivity.value=p.reflectivity,m.ior.value=p.ior,m.refractionRatio.value=p.refractionRatio),p.lightMap&&(m.lightMap.value=p.lightMap,m.lightMapIntensity.value=p.lightMapIntensity,e(p.lightMap,m.lightMapTransform)),p.aoMap&&(m.aoMap.value=p.aoMap,m.aoMapIntensity.value=p.aoMapIntensity,e(p.aoMap,m.aoMapTransform))}function o(m,p){m.diffuse.value.copy(p.color),m.opacity.value=p.opacity,p.map&&(m.map.value=p.map,e(p.map,m.mapTransform))}function a(m,p){m.dashSize.value=p.dashSize,m.totalSize.value=p.dashSize+p.gapSize,m.scale.value=p.scale}function l(m,p,T,P){m.diffuse.value.copy(p.color),m.opacity.value=p.opacity,m.size.value=p.size*T,m.scale.value=P*.5,p.map&&(m.map.value=p.map,e(p.map,m.uvTransform)),p.alphaMap&&(m.alphaMap.value=p.alphaMap,e(p.alphaMap,m.alphaMapTransform)),p.alphaTest>0&&(m.alphaTest.value=p.alphaTest)}function c(m,p){m.diffuse.value.copy(p.color),m.opacity.value=p.opacity,m.rotation.value=p.rotation,p.map&&(m.map.value=p.map,e(p.map,m.mapTransform)),p.alphaMap&&(m.alphaMap.value=p.alphaMap,e(p.alphaMap,m.alphaMapTransform)),p.alphaTest>0&&(m.alphaTest.value=p.alphaTest)}function h(m,p){m.specular.value.copy(p.specular),m.shininess.value=Math.max(p.shininess,1e-4)}function f(m,p){p.gradientMap&&(m.gradientMap.value=p.gradientMap)}function u(m,p){m.metalness.value=p.metalness,p.metalnessMap&&(m.metalnessMap.value=p.metalnessMap,e(p.metalnessMap,m.metalnessMapTransform)),m.roughness.value=p.roughness,p.roughnessMap&&(m.roughnessMap.value=p.roughnessMap,e(p.roughnessMap,m.roughnessMapTransform)),p.envMap&&(m.envMapIntensity.value=p.envMapIntensity)}function d(m,p,T){m.ior.value=p.ior,p.sheen>0&&(m.sheenColor.value.copy(p.sheenColor).multiplyScalar(p.sheen),m.sheenRoughness.value=p.sheenRoughness,p.sheenColorMap&&(m.sheenColorMap.value=p.sheenColorMap,e(p.sheenColorMap,m.sheenColorMapTransform)),p.sheenRoughnessMap&&(m.sheenRoughnessMap.value=p.sheenRoughnessMap,e(p.sheenRoughnessMap,m.sheenRoughnessMapTransform))),p.clearcoat>0&&(m.clearcoat.value=p.clearcoat,m.clearcoatRoughness.value=p.clearcoatRoughness,p.clearcoatMap&&(m.clearcoatMap.value=p.clearcoatMap,e(p.clearcoatMap,m.clearcoatMapTransform)),p.clearcoatRoughnessMap&&(m.clearcoatRoughnessMap.value=p.clearcoatRoughnessMap,e(p.clearcoatRoughnessMap,m.clearcoatRoughnessMapTransform)),p.clearcoatNormalMap&&(m.clearcoatNormalMap.value=p.clearcoatNormalMap,e(p.clearcoatNormalMap,m.clearcoatNormalMapTransform),m.clearcoatNormalScale.value.copy(p.clearcoatNormalScale),p.side===je&&m.clearcoatNormalScale.value.negate())),p.dispersion>0&&(m.dispersion.value=p.dispersion),p.retroreflectivity>0&&(m.retroreflectivity.value=p.retroreflectivity),p.iridescence>0&&(m.iridescence.value=p.iridescence,m.iridescenceIOR.value=p.iridescenceIOR,m.iridescenceThicknessMinimum.value=p.iridescenceThicknessRange[0],m.iridescenceThicknessMaximum.value=p.iridescenceThicknessRange[1],p.iridescenceMap&&(m.iridescenceMap.value=p.iridescenceMap,e(p.iridescenceMap,m.iridescenceMapTransform)),p.iridescenceThicknessMap&&(m.iridescenceThicknessMap.value=p.iridescenceThicknessMap,e(p.iridescenceThicknessMap,m.iridescenceThicknessMapTransform))),p.transmission>0&&(m.transmission.value=p.transmission,m.transmissionSamplerMap.value=T.texture,m.transmissionSamplerSize.value.set(T.width,T.height),p.transmissionMap&&(m.transmissionMap.value=p.transmissionMap,e(p.transmissionMap,m.transmissionMapTransform)),m.thickness.value=p.thickness,p.thicknessMap&&(m.thicknessMap.value=p.thicknessMap,e(p.thicknessMap,m.thicknessMapTransform)),m.attenuationDistance.value=p.attenuationDistance,m.attenuationColor.value.copy(p.attenuationColor)),p.anisotropy>0&&(m.anisotropyVector.value.set(p.anisotropy*Math.cos(p.anisotropyRotation),p.anisotropy*Math.sin(p.anisotropyRotation)),p.anisotropyMap&&(m.anisotropyMap.value=p.anisotropyMap,e(p.anisotropyMap,m.anisotropyMapTransform))),m.specularIntensity.value=p.specularIntensity,m.specularColor.value.copy(p.specularColor),p.specularColorMap&&(m.specularColorMap.value=p.specularColorMap,e(p.specularColorMap,m.specularColorMapTransform)),p.specularIntensityMap&&(m.specularIntensityMap.value=p.specularIntensityMap,e(p.specularIntensityMap,m.specularIntensityMapTransform))}function g(m,p){p.matcap&&(m.matcap.value=p.matcap)}function M(m,p){let T=t.get(p).light;m.referencePosition.value.setFromMatrixPosition(T.matrixWorld),m.nearDistance.value=T.shadow.camera.near,m.farDistance.value=T.shadow.camera.far}return{refreshFogUniforms:n,refreshMaterialUniforms:s}}function Nx(i,t,e,n){let s={},r={},o=[],a=i.getParameter(i.MAX_UNIFORM_BUFFER_BINDINGS);function l(S,A){let b=A.program;n.uniformBlockBinding(S,b)}function c(S,A){let b=s[S.id];b===void 0&&(m(S),b=h(S),s[S.id]=b,S.addEventListener("dispose",T));let R=A.program;n.updateUBOMapping(S,R);let _=t.render.frame;r[S.id]!==_&&(u(S),r[S.id]=_)}function h(S){let A=f();S.__bindingPointIndex=A;let b=i.createBuffer(),R=S.__size,_=S.usage;return i.bindBuffer(i.UNIFORM_BUFFER,b),i.bufferData(i.UNIFORM_BUFFER,R,_),i.bindBuffer(i.UNIFORM_BUFFER,null),i.bindBufferBase(i.UNIFORM_BUFFER,A,b),b}function f(){for(let S=0;S<a;S++)if(o.indexOf(S)===-1)return o.push(S),S;return jt("WebGLRenderer: Maximum number of simultaneously usable uniforms groups reached."),0}function u(S){let A=s[S.id],b=S.uniforms,R=S.__cache;i.bindBuffer(i.UNIFORM_BUFFER,A);for(let _=0,w=b.length;_<w;_++){let L=b[_];if(Array.isArray(L))for(let D=0,B=L.length;D<B;D++)d(L[D],_,D,R);else d(L,_,0,R)}i.bindBuffer(i.UNIFORM_BUFFER,null)}function d(S,A,b,R){if(M(S,A,b,R)===!0){let _=S.__offset,w=S.value;if(Array.isArray(w)){let L=0;for(let D=0;D<w.length;D++){let B=w[D],G=p(B);g(B,S.__data,L),typeof B!="number"&&typeof B!="boolean"&&!B.isMatrix3&&!ArrayBuffer.isView(B)&&(L+=G.storage/Float32Array.BYTES_PER_ELEMENT)}}else g(w,S.__data,0);i.bufferSubData(i.UNIFORM_BUFFER,_,S.__data)}}function g(S,A,b){typeof S=="number"||typeof S=="boolean"?A[0]=S:S.isMatrix3?(A[0]=S.elements[0],A[1]=S.elements[1],A[2]=S.elements[2],A[3]=0,A[4]=S.elements[3],A[5]=S.elements[4],A[6]=S.elements[5],A[7]=0,A[8]=S.elements[6],A[9]=S.elements[7],A[10]=S.elements[8],A[11]=0):ArrayBuffer.isView(S)?A.set(new S.constructor(S.buffer,S.byteOffset,A.length)):S.toArray(A,b)}function M(S,A,b,R){let _=S.value,w=A+"_"+b;if(R[w]===void 0)return typeof _=="number"||typeof _=="boolean"?R[w]=_:ArrayBuffer.isView(_)?R[w]=_.slice():R[w]=_.clone(),!0;{let L=R[w];if(typeof _=="number"||typeof _=="boolean"){if(L!==_)return R[w]=_,!0}else{if(ArrayBuffer.isView(_))return!0;if(L.equals(_)===!1)return L.copy(_),!0}}return!1}function m(S){let A=S.uniforms,b=0,R=16;for(let w=0,L=A.length;w<L;w++){let D=Array.isArray(A[w])?A[w]:[A[w]];for(let B=0,G=D.length;B<G;B++){let N=D[B],C=Array.isArray(N.value)?N.value:[N.value];for(let k=0,V=C.length;k<V;k++){let j=C[k],W=p(j),J=b%R,et=J%W.boundary,vt=J+et;b+=et,vt!==0&&R-vt<W.storage&&(b+=R-vt),N.__data=new Float32Array(W.storage/Float32Array.BYTES_PER_ELEMENT),N.__offset=b,b+=W.storage}}}let _=b%R;return _>0&&(b+=R-_),S.__size=b,S.__cache={},this}function p(S){let A={boundary:0,storage:0};return typeof S=="number"||typeof S=="boolean"?(A.boundary=4,A.storage=4):S.isVector2?(A.boundary=8,A.storage=8):S.isVector3||S.isColor?(A.boundary=16,A.storage=12):S.isVector4?(A.boundary=16,A.storage=16):S.isMatrix3?(A.boundary=48,A.storage=48):S.isMatrix4?(A.boundary=64,A.storage=64):S.isTexture?Jt("WebGLRenderer: Texture samplers can not be part of an uniforms group."):ArrayBuffer.isView(S)?(A.boundary=16,A.storage=S.byteLength):Jt("WebGLRenderer: Unsupported uniform value type.",S),A}function T(S){let A=S.target;A.removeEventListener("dispose",T);let b=o.indexOf(A.__bindingPointIndex);o.splice(b,1),i.deleteBuffer(s[A.id]),delete s[A.id],delete r[A.id]}function P(){for(let S in s)i.deleteBuffer(s[S]);o=[],s={},r={}}return{bind:l,update:c,dispose:P}}var Ux=new Uint16Array([12469,15057,12620,14925,13266,14620,13807,14376,14323,13990,14545,13625,14713,13328,14840,12882,14931,12528,14996,12233,15039,11829,15066,11525,15080,11295,15085,10976,15082,10705,15073,10495,13880,14564,13898,14542,13977,14430,14158,14124,14393,13732,14556,13410,14702,12996,14814,12596,14891,12291,14937,11834,14957,11489,14958,11194,14943,10803,14921,10506,14893,10278,14858,9960,14484,14039,14487,14025,14499,13941,14524,13740,14574,13468,14654,13106,14743,12678,14818,12344,14867,11893,14889,11509,14893,11180,14881,10751,14852,10428,14812,10128,14765,9754,14712,9466,14764,13480,14764,13475,14766,13440,14766,13347,14769,13070,14786,12713,14816,12387,14844,11957,14860,11549,14868,11215,14855,10751,14825,10403,14782,10044,14729,9651,14666,9352,14599,9029,14967,12835,14966,12831,14963,12804,14954,12723,14936,12564,14917,12347,14900,11958,14886,11569,14878,11247,14859,10765,14828,10401,14784,10011,14727,9600,14660,9289,14586,8893,14508,8533,15111,12234,15110,12234,15104,12216,15092,12156,15067,12010,15028,11776,14981,11500,14942,11205,14902,10752,14861,10393,14812,9991,14752,9570,14682,9252,14603,8808,14519,8445,14431,8145,15209,11449,15208,11451,15202,11451,15190,11438,15163,11384,15117,11274,15055,10979,14994,10648,14932,10343,14871,9936,14803,9532,14729,9218,14645,8742,14556,8381,14461,8020,14365,7603,15273,10603,15272,10607,15267,10619,15256,10631,15231,10614,15182,10535,15118,10389,15042,10167,14963,9787,14883,9447,14800,9115,14710,8665,14615,8318,14514,7911,14411,7507,14279,7198,15314,9675,15313,9683,15309,9712,15298,9759,15277,9797,15229,9773,15166,9668,15084,9487,14995,9274,14898,8910,14800,8539,14697,8234,14590,7790,14479,7409,14367,7067,14178,6621,15337,8619,15337,8631,15333,8677,15325,8769,15305,8871,15264,8940,15202,8909,15119,8775,15022,8565,14916,8328,14804,8009,14688,7614,14569,7287,14448,6888,14321,6483,14088,6171,15350,7402,15350,7419,15347,7480,15340,7613,15322,7804,15287,7973,15229,8057,15148,8012,15046,7846,14933,7611,14810,7357,14682,7069,14552,6656,14421,6316,14251,5948,14007,5528,15356,5942,15356,5977,15353,6119,15348,6294,15332,6551,15302,6824,15249,7044,15171,7122,15070,7050,14949,6861,14818,6611,14679,6349,14538,6067,14398,5651,14189,5311,13935,4958,15359,4123,15359,4153,15356,4296,15353,4646,15338,5160,15311,5508,15263,5829,15188,6042,15088,6094,14966,6001,14826,5796,14678,5543,14527,5287,14377,4985,14133,4586,13869,4257,15360,1563,15360,1642,15358,2076,15354,2636,15341,3350,15317,4019,15273,4429,15203,4732,15105,4911,14981,4932,14836,4818,14679,4621,14517,4386,14359,4156,14083,3795,13808,3437,15360,122,15360,137,15358,285,15355,636,15344,1274,15322,2177,15281,2765,15215,3223,15120,3451,14995,3569,14846,3567,14681,3466,14511,3305,14344,3121,14037,2800,13753,2467,15360,0,15360,1,15359,21,15355,89,15346,253,15325,479,15287,796,15225,1148,15133,1492,15008,1749,14856,1882,14685,1886,14506,1783,14324,1608,13996,1398,13702,1183]),ii=null;function Fx(){return ii===null&&(ii=new Wo(Ux,16,16,Gi,Hn),ii.name="DFG_LUT",ii.minFilter=Je,ii.magFilter=Je,ii.wrapS=Yn,ii.wrapT=Yn,ii.generateMipmaps=!1,ii.needsUpdate=!0),ii}var ul=class{constructor(t={}){let{canvas:e=wu(),context:n=null,depth:s=!0,stencil:r=!1,alpha:o=!1,antialias:a=!1,premultipliedAlpha:l=!0,preserveDrawingBuffer:c=!1,powerPreference:h="default",failIfMajorPerformanceCaveat:f=!1,reversedDepthBuffer:u=!1,outputBufferType:d=xn}=t;this.isWebGLRenderer=!0;let g;if(n!==null){if(typeof WebGLRenderingContext<"u"&&n instanceof WebGLRenderingContext)throw new Error("THREE.WebGLRenderer: WebGL 1 is not supported since r163.");g=n.getContextAttributes().alpha}else g=o;let M=d,m=new Set([Ea,Ta,wa]),p=new Set([xn,Vn,Ws,Xs,Sa,ba]),T=new Uint32Array(4),P=new Int32Array(4),S=new O,A=null,b=null,R=[],_=[],w=null;this.domElement=e,this.debug={checkShaderErrors:!0,diagnostics:{keywords:!1},onShaderError:null},this.autoClear=!0,this.autoClearColor=!0,this.autoClearDepth=!0,this.autoClearStencil=!0,this.sortObjects=!0,this.clippingPlanes=[],this.localClippingEnabled=!1,this.toneMapping=kn,this.toneMappingExposure=1,this.transmissionResolutionScale=1;let L=this,D=!1,B=null,G=null,N=null,C=null;this._outputColorSpace=ln;let k=0,V=0,j=null,W=-1,J=null,et=new Le,vt=new Le,rt=null,Zt=new se(0),Nt=0,ne=e.width,tt=e.height,it=1,Mt=null,Dt=null,It=new Le(0,0,ne,tt),Yt=new Le(0,0,ne,tt),he=!1,st=new Fs,ot=!1,ft=!1,mt=new Ee,St=new O,Xt=new Le,kt={background:null,fog:null,environment:null,overrideMaterial:null,isScene:!0},$t=!1;function Kt(){return j===null?it:1}let F=n;function xe(y,U){return e.getContext(y,U)}let ae,E,x,H,K,Q,pt,_t,nt,at,wt,Vt,At,bt,Gt,Wt,ee,z,Et,lt,Tt,Pt,dt;try{let y={alpha:!0,depth:s,stencil:r,antialias:a,premultipliedAlpha:l,preserveDrawingBuffer:c,powerPreference:h,failIfMajorPerformanceCaveat:f};if("setAttribute"in e&&e.setAttribute("data-engine",`three.js r${"186"}`),e.addEventListener("webglcontextlost",we,!1),e.addEventListener("webglcontextrestored",ue,!1),e.addEventListener("webglcontextcreationerror",Be,!1),F===null){let U="webgl2";if(F=xe(U,y),F===null)throw xe(U)?new Error("THREE.WebGLRenderer: Error creating WebGL context with your selected attributes."):new Error("THREE.WebGLRenderer: Error creating WebGL context.")}Ht()}catch(y){throw e.removeEventListener("webglcontextlost",we,!1),e.removeEventListener("webglcontextrestored",ue,!1),e.removeEventListener("webglcontextcreationerror",Be,!1),jt("WebGLRenderer: "+y.message),y}function Ht(){ae=new Hg(F),ae.init(),Tt=new Rx(F,ae),E=new Dg(F,ae,t,Tt),x=new Ax(F,ae),E.reversedDepthBuffer&&u&&x.buffers.depth.setReversed(!0),G=F.createFramebuffer(),N=F.createFramebuffer(),C=F.createFramebuffer(),H=new qg(F),K=new fx,Q=new Cx(F,ae,x,K,E,Tt,H),pt=new Gg(L),_t=new Zf(F),Pt=new Pg(F,_t),nt=new Wg(F,_t,H,Pt),at=new Zg(F,nt,_t,Pt,H),z=new Yg(F,E,Q),Gt=new Ng(K),wt=new dx(L,pt,ae,E,Pt,Gt),Vt=new Dx(L,K),At=new mx,bt=new Mx(ae),ee=new Ig(L,pt,x,at,g,l),Wt=new Ex(L,at,E),dt=new Nx(F,H,E,x),Et=new Lg(F,ae,H),lt=new Xg(F,ae,H),H.programs=wt.programs,L.capabilities=E,L.extensions=ae,L.properties=K,L.renderLists=At,L.shadowMap=Wt,L.state=x,L.info=H}M!==xn&&(w=new Jg(M,e.width,e.height,a,s,r));let zt=new eh(L,F);this.xr=zt,this.getContext=function(){return F},this.getContextAttributes=function(){return F.getContextAttributes()},this.forceContextLoss=function(){let y=ae.get("WEBGL_lose_context");y&&y.loseContext()},this.forceContextRestore=function(){let y=ae.get("WEBGL_lose_context");y&&y.restoreContext()},this.getPixelRatio=function(){return it},this.setPixelRatio=function(y){y!==void 0&&(it=y,this.setSize(ne,tt,!1))},this.getSize=function(y){return y.set(ne,tt)},this.setSize=function(y,U,Y=!0){if(zt.isPresenting){Jt("WebGLRenderer: Can't change size while VR device is presenting.");return}ne=y,tt=U,e.width=Math.floor(y*it),e.height=Math.floor(U*it),Y===!0&&(e.style.width=y+"px",e.style.height=U+"px"),w!==null&&w.setSize(e.width,e.height),this.setViewport(0,0,y,U)},this.getDrawingBufferSize=function(y){return y.set(ne*it,tt*it).floor()},this.setDrawingBufferSize=function(y,U,Y){ne=y,tt=U,it=Y,e.width=Math.floor(y*Y),e.height=Math.floor(U*Y),this.setViewport(0,0,y,U)},this.setEffects=function(y){if(M===xn){jt("WebGLRenderer: setEffects() requires outputBufferType set to HalfFloatType or FloatType.");return}if(y){for(let U=0;U<y.length;U++)if(y[U].isOutputPass===!0){Jt("WebGLRenderer: OutputPass is not needed in setEffects(). Tone mapping and color space conversion are applied automatically.");break}}w.setEffects(y||[])},this.getCurrentViewport=function(y){return y.copy(et)},this.getViewport=function(y){return y.copy(It)},this.setViewport=function(y,U,Y,X){y.isVector4?It.set(y.x,y.y,y.z,y.w):It.set(y,U,Y,X),x.viewport(et.copy(It).multiplyScalar(it).round())},this.getScissor=function(y){return y.copy(Yt)},this.setScissor=function(y,U,Y,X){y.isVector4?Yt.set(y.x,y.y,y.z,y.w):Yt.set(y,U,Y,X),x.scissor(vt.copy(Yt).multiplyScalar(it).round())},this.getScissorTest=function(){return he},this.setScissorTest=function(y){x.setScissorTest(he=y)},this.setOpaqueSort=function(y){Mt=y},this.setTransparentSort=function(y){Dt=y},this.getClearColor=function(y){return y.copy(ee.getClearColor())},this.setClearColor=function(){ee.setClearColor(...arguments)},this.getClearAlpha=function(){return ee.getClearAlpha()},this.setClearAlpha=function(){ee.setClearAlpha(...arguments)},this.clear=function(y=!0,U=!0,Y=!0){let X=0;if(y){let q=!1;if(j!==null){let gt=j.texture.format;q=m.has(gt)}if(q){let gt=j.texture.type,Lt=p.has(gt),Ct=ee.getClearColor(),Ft=ee.getClearAlpha(),Bt=Ct.r,qt=Ct.g,te=Ct.b;Lt?(T[0]=Bt,T[1]=qt,T[2]=te,T[3]=Ft,F.clearBufferuiv(F.COLOR,0,T)):(P[0]=Bt,P[1]=qt,P[2]=te,P[3]=Ft,F.clearBufferiv(F.COLOR,0,P))}else X|=F.COLOR_BUFFER_BIT}U&&(X|=F.DEPTH_BUFFER_BIT,this.state.buffers.depth.setMask(!0)),Y&&(X|=F.STENCIL_BUFFER_BIT,this.state.buffers.stencil.setMask(4294967295)),X!==0&&F.clear(X)},this.clearColor=function(){this.clear(!0,!1,!1)},this.clearDepth=function(){this.clear(!1,!0,!1)},this.clearStencil=function(){this.clear(!1,!1,!0)},this.setNodesHandler=function(y){y.setRenderer(this),B=y},this.dispose=function(){e.removeEventListener("webglcontextlost",we,!1),e.removeEventListener("webglcontextrestored",ue,!1),e.removeEventListener("webglcontextcreationerror",Be,!1),ee.dispose(),At.dispose(),bt.dispose(),K.dispose(),pt.dispose(),at.dispose(),Pt.dispose(),dt.dispose(),wt.dispose(),zt.dispose(),zt.removeEventListener("sessionstart",on),zt.removeEventListener("sessionend",Xi),le.stop()};function we(y){y.preventDefault(),Uc("WebGLRenderer: Context Lost."),D=!0}function ue(){Uc("WebGLRenderer: Context Restored."),D=!1;let y=H.autoReset,U=Wt.enabled,Y=Wt.autoUpdate,X=Wt.needsUpdate,q=Wt.type;Ht(),H.autoReset=y,Wt.enabled=U,Wt.autoUpdate=Y,Wt.needsUpdate=X,Wt.type=q}function Be(y){jt("WebGLRenderer: A WebGL context could not be created. Reason: ",y.statusMessage)}function vn(y){let U=y.target;U.removeEventListener("dispose",vn),ze(U)}function ze(y){Wn(y),K.remove(y)}function Wn(y){let U=K.get(y).programs;U!==void 0&&(U.forEach(function(Y){wt.releaseProgram(Y)}),y.isShaderMaterial&&wt.releaseShaderCache(y))}this.renderBufferDirect=function(y,U,Y,X,q,gt){U===null&&(U=kt);let Lt=q.isMesh&&q.matrixWorld.determinantAffine()<0,Ct=un(y,U,Y,X,q);x.setMaterial(X,Lt);let Ft=Y.index,Bt=1;if(X.wireframe===!0){if(Ft=nt.getWireframeAttribute(Y),Ft===void 0)return;Bt=2}let qt=Y.drawRange,te=Y.attributes.position,Ot=qt.start*Bt,me=(qt.start+qt.count)*Bt;gt!==null&&(Ot=Math.max(Ot,gt.start*Bt),me=Math.min(me,(gt.start+gt.count)*Bt)),Ft!==null?(Ot=Math.max(Ot,0),me=Math.min(me,Ft.count)):te!=null&&(Ot=Math.max(Ot,0),me=Math.min(me,te.count));let De=me-Ot;if(De<0||De===1/0)return;Pt.setup(q,X,Ct,Y,Ft);let ye,_e=Et;if(Ft!==null&&(ye=_t.get(Ft),_e=lt,_e.setIndex(ye)),q.isMesh)X.wireframe===!0?(x.setLineWidth(X.wireframeLinewidth*Kt()),_e.setMode(F.LINES)):_e.setMode(F.TRIANGLES);else if(q.isLine){let He=X.linewidth;He===void 0&&(He=1),x.setLineWidth(He*Kt()),q.isLineSegments?_e.setMode(F.LINES):q.isLineLoop?_e.setMode(F.LINE_LOOP):_e.setMode(F.LINE_STRIP)}else q.isPoints?_e.setMode(F.POINTS):q.isSprite&&_e.setMode(F.TRIANGLES);if(q.isBatchedMesh)if(ae.get("WEBGL_multi_draw"))_e.renderMultiDraw(q._multiDrawStarts,q._multiDrawCounts,q._multiDrawCount);else{let He=q._multiDrawStarts,Ut=q._multiDrawCounts,ke=q._multiDrawCount,ge=Ft?_t.get(Ft).bytesPerElement:1,an=K.get(X).currentProgram.getUniforms();for(let An=0;An<ke;An++)an.setValue(F,"_gl_DrawID",An),_e.render(He[An]/ge,Ut[An])}else if(q.isInstancedMesh)_e.renderInstances(Ot,De,q.count);else if(Y.isInstancedBufferGeometry){let He=Y._maxInstanceCount!==void 0?Y._maxInstanceCount:1/0,Ut=Math.min(Y.instanceCount,He);_e.renderInstances(Ot,De,Ut)}else _e.render(Ot,De)};function vi(y,U,Y,X){B!==null&&y.isNodeMaterial&&B.setObject(X,y),ot===!0&&Gt.setState(y,Y,!1),y.transparent===!0&&y.side===ei&&y.forceSinglePass===!1?(y.side=je,y.needsUpdate=!0,tn(y,U,X),y.side=Bi,y.needsUpdate=!0,tn(y,U,X),y.side=ei):tn(y,U,X)}this.compile=function(y,U,Y=null){Y===null&&(Y=y),B!==null&&B.renderStart(y,U,Y),b=bt.get(Y),b.init(U),_.push(b),Y.traverseVisible(function(q){q.isLight&&q.layers.test(U.layers)&&(b.pushLight(q),q.castShadow&&b.pushShadow(q))}),y!==Y&&y.traverseVisible(function(q){q.isLight&&q.layers.test(U.layers)&&(b.pushLight(q),q.castShadow&&b.pushShadow(q))}),b.setupLights(),B!==null&&B.updateLights(b.state.lightsArray),ft=this.localClippingEnabled,ot=Gt.init(this.clippingPlanes,ft),ot===!0&&Gt.setGlobalState(this.clippingPlanes,U),B!==null&&Wt.render(b.state.shadowsArray,Y,U);let X=new Set;return y.traverse(function(q){if(!(q.isMesh||q.isPoints||q.isLine||q.isSprite))return;let gt=q.material;if(gt)if(Array.isArray(gt))for(let Lt=0;Lt<gt.length;Lt++){let Ct=gt[Lt];vi(Ct,Y,U,q),X.add(Ct)}else vi(gt,Y,U,q),X.add(gt)}),b=_.pop(),B!==null&&B.renderEnd(),X},this.compileAsync=function(y,U,Y=null){let X=this.compile(y,U,Y);return new Promise(q=>{function gt(){if(X.forEach(function(Lt){let Ft=K.get(Lt).currentProgram;(Ft===void 0||Ft.isReady())&&X.delete(Lt)}),X.size===0){q(y);return}setTimeout(gt,10)}ae.get("KHR_parallel_shader_compile")!==null?gt():setTimeout(gt,10)})};let Mi=null;function de(y){Mi&&Mi(y)}function on(){le.stop()}function Xi(){le.start()}let le=new id;le.setAnimationLoop(de),typeof self<"u"&&le.setContext(self),this.setAnimationLoop=function(y){Mi=y,zt.setAnimationLoop(y),y===null?le.stop():le.start()},zt.addEventListener("sessionstart",on),zt.addEventListener("sessionend",Xi),this.render=function(y,U){if(U!==void 0&&U.isCamera!==!0){jt("WebGLRenderer.render: camera is not an instance of THREE.Camera.");return}if(D===!0)return;B!==null&&B.renderStart(y,U);let Y=zt.enabled===!0&&zt.isPresenting===!0,X=w!==null&&(j===null||Y)&&w.begin(L,j);if(y.matrixWorldAutoUpdate===!0&&y.updateMatrixWorld(),U.parent===null&&U.matrixWorldAutoUpdate===!0&&U.updateMatrixWorld(),zt.enabled===!0&&zt.isPresenting===!0&&(w===null||w.isCompositing()===!1)&&(zt.cameraAutoUpdate===!0&&zt.updateCamera(U),U=zt.getCamera()),y.isScene===!0&&y.onBeforeRender(L,y,U,j),b=bt.get(y,_.length),b.init(U),b.state.textureUnits=Q.getTextureUnits(),_.push(b),mt.multiplyMatrices(U.projectionMatrix,U.matrixWorldInverse),st.setFromProjectionMatrix(mt,zn,U.reversedDepth),ft=this.localClippingEnabled,ot=Gt.init(this.clippingPlanes,ft),A=At.get(y,R.length),A.init(),R.push(A),zt.enabled===!0&&zt.isPresenting===!0){let Lt=L.xr.getDepthSensingMesh();Lt!==null&&hn(Lt,U,-1/0,L.sortObjects)}hn(y,U,0,L.sortObjects),A.finish(),B!==null&&B.updateLights(b.state.lightsArray),L.sortObjects===!0&&A.sort(Mt,Dt),$t=zt.enabled===!1||zt.isPresenting===!1||zt.hasDepthSensing()===!1,$t&&ee.addToRenderList(A,y),this.info.render.frame++,this.info.autoReset===!0&&this.info.reset(),ot===!0&&Gt.beginShadows();let q=b.state.shadowsArray;if(Wt.render(q,y,U),ot===!0&&Gt.endShadows(),(X&&w.hasRenderPass())===!1){let Lt=A.opaque,Ct=A.transmissive;if(b.setupLights(),U.isArrayCamera){let Ft=U.cameras;if(Ct.length>0)for(let Bt=0,qt=Ft.length;Bt<qt;Bt++){let te=Ft[Bt];ds(Lt,Ct,y,te)}$t&&ee.render(y);for(let Bt=0,qt=Ft.length;Bt<qt;Bt++){let te=Ft[Bt];Qe(A,y,te,te.viewport)}}else Ct.length>0&&ds(Lt,Ct,y,U),$t&&ee.render(y),Qe(A,y,U)}j!==null&&V===0&&(Q.updateMultisampleRenderTarget(j),Q.updateRenderTargetMipmap(j)),X&&w.end(L),y.isScene===!0&&y.onAfterRender(L,y,U),Pt.resetDefaultState(),W=-1,J=null,_.pop(),_.length>0?(b=_[_.length-1],Q.setTextureUnits(b.state.textureUnits),ot===!0&&Gt.setGlobalState(L.clippingPlanes,b.state.camera)):b=null,R.pop(),R.length>0?A=R[R.length-1]:A=null,B!==null&&B.renderEnd()};function hn(y,U,Y,X){if(y.visible===!1)return;if(y.layers.test(U.layers)){if(y.isGroup)Y=y.renderOrder;else if(y.isLOD)y.autoUpdate===!0&&y.update(U);else if(y.isLightProbeGrid)b.pushLightProbeGrid(y);else if(y.isLight)b.pushLight(y),y.castShadow&&b.pushShadow(y);else if(y.isSprite){if(!y.frustumCulled||y.intersectsFrustum(st)){X&&Xt.setFromMatrixPosition(y.matrixWorld).applyMatrix4(mt);let Lt=at.update(y),Ct=y.material;Ct.visible&&A.push(y,Lt,Ct,Y,Xt.z,null,U)}}else if((y.isMesh||y.isLine||y.isPoints)&&(!y.frustumCulled||y.intersectsFrustum(st))){let Lt=at.update(y),Ct=y.material;if(X&&(y.boundingSphere!==void 0?(y.boundingSphere===null&&y.computeBoundingSphere(),Xt.copy(y.boundingSphere.center)):(Lt.boundingSphere===null&&Lt.computeBoundingSphere(),Xt.copy(Lt.boundingSphere.center)),Xt.applyMatrix4(y.matrixWorld).applyMatrix4(mt)),Array.isArray(Ct)){let Ft=Lt.groups;for(let Bt=0,qt=Ft.length;Bt<qt;Bt++){let te=Ft[Bt],Ot=Ct[te.materialIndex];Ot&&Ot.visible&&A.push(y,Lt,Ot,Y,Xt.z,te,U)}}else Ct.visible&&A.push(y,Lt,Ct,Y,Xt.z,null,U)}}let gt=y.children;for(let Lt=0,Ct=gt.length;Lt<Ct;Lt++)hn(gt[Lt],U,Y,X)}function Qe(y,U,Y,X){let{opaque:q,transmissive:gt,transparent:Lt}=y;b.setupLightsView(Y),ot===!0&&Gt.setGlobalState(L.clippingPlanes,Y),X&&x.viewport(et.copy(X)),q.length>0&&Re(q,U,Y),gt.length>0&&Re(gt,U,Y),Lt.length>0&&Re(Lt,U,Y),x.buffers.depth.setTest(!0),x.buffers.depth.setMask(!0),x.buffers.color.setMask(!0),x.setPolygonOffset(!1)}function ds(y,U,Y,X){if((Y.isScene===!0?Y.overrideMaterial:null)!==null)return;if(b.state.transmissionRenderTarget[X.id]===void 0){let Ot=ae.has("EXT_color_buffer_half_float")||ae.has("EXT_color_buffer_float");b.state.transmissionRenderTarget[X.id]=new gn(1,1,{generateMipmaps:!0,type:Ot?Hn:xn,minFilter:ki,samples:Math.max(4,E.samples),stencilBuffer:r,resolveDepthBuffer:!1,resolveStencilBuffer:!1,storeMultisampledDepthBuffer:!1,storeMultisampledStencilBuffer:!1,colorSpace:pe.workingColorSpace})}let gt=b.state.transmissionRenderTarget[X.id],Lt=X.viewport||et;gt.setSize(Lt.z*L.transmissionResolutionScale,Lt.w*L.transmissionResolutionScale);let Ct=L.getRenderTarget(),Ft=L.getActiveCubeFace(),Bt=L.getActiveMipmapLevel();L.setRenderTarget(gt),L.getClearColor(Zt),Nt=L.getClearAlpha(),Nt<1&&L.setClearColor(16777215,.5),L.clear(),$t&&ee.render(Y);let qt=L.toneMapping;L.toneMapping=kn;let te=X.viewport;if(X.viewport!==void 0&&(X.viewport=void 0),b.setupLightsView(X),ot===!0&&Gt.setGlobalState(L.clippingPlanes,X),Re(y,Y,X),Q.updateMultisampleRenderTarget(gt),Q.updateRenderTargetMipmap(gt),ae.has("WEBGL_multisampled_render_to_texture")===!1){let Ot=!1;for(let me=0,De=U.length;me<De;me++){let ye=U[me],{object:_e,geometry:He,material:Ut,group:ke}=ye;if(Ut.side===ei&&_e.layers.test(X.layers)){let ge=Ut.side;Ut.side=je,Ut.needsUpdate=!0,js(_e,Y,X,He,Ut,ke),Ut.side=ge,Ut.needsUpdate=!0,Ot=!0}}Ot===!0&&(Q.updateMultisampleRenderTarget(gt),Q.updateRenderTargetMipmap(gt))}L.setRenderTarget(Ct,Ft,Bt),L.setClearColor(Zt,Nt),te!==void 0&&(X.viewport=te),L.toneMapping=qt}function Re(y,U,Y){let X=U.isScene===!0?U.overrideMaterial:null;for(let q=0,gt=y.length;q<gt;q++){let Lt=y[q],{object:Ct,geometry:Ft,group:Bt}=Lt,qt=Lt.material;qt.allowOverride===!0&&X!==null&&(qt=X),Ct.layers.test(Y.layers)&&js(Ct,U,Y,Ft,qt,Bt)}}function js(y,U,Y,X,q,gt){B!==null&&q.isNodeMaterial&&B.setObject(y,q),y.onBeforeRender(L,U,Y,X,q,gt),y.modelViewMatrix.multiplyMatrices(Y.matrixWorldInverse,y.matrixWorld),y.normalMatrix.getNormalMatrix(y.modelViewMatrix),q.onBeforeRender(L,U,Y,X,y,gt),q.transparent===!0&&q.side===ei&&q.forceSinglePass===!1?(q.side=je,q.needsUpdate=!0,L.renderBufferDirect(Y,U,X,q,y,gt),q.side=Bi,q.needsUpdate=!0,L.renderBufferDirect(Y,U,X,q,y,gt),q.side=ei):L.renderBufferDirect(Y,U,X,q,y,gt),y.onAfterRender(L,U,Y,X,q,gt)}function tn(y,U,Y){U.isScene!==!0&&(U=kt);let X=K.get(y),q=b.state.lights,gt=b.state.shadowsArray,Lt=q.state.version,Ct=wt.getParameters(y,q.state,gt,U,Y,b.state.lightProbeGridArray),Ft=wt.getProgramCacheKey(Ct),Bt=X.programs;X.environment=y.isMeshStandardMaterial||y.isMeshLambertMaterial||y.isMeshPhongMaterial?U.environment:null,X.fog=U.fog;let qt=y.isMeshStandardMaterial||y.isMeshLambertMaterial&&!y.envMap||y.isMeshPhongMaterial&&!y.envMap;X.envMap=pt.get(y.envMap||X.environment,qt),X.envMapRotation=X.environment!==null&&y.envMap===null?U.environmentRotation:y.envMapRotation,Bt===void 0&&(y.addEventListener("dispose",vn),Bt=new Map,X.programs=Bt);let te=Bt.get(Ft);if(te!==void 0){if(X.currentProgram===te&&X.lightsStateVersion===Lt)return Ae(y,Ct),te}else Ct.uniforms=wt.getUniforms(y),B!==null&&y.isNodeMaterial&&B.build(y,Y,Ct),y.onBeforeCompile(Ct,L),te=wt.acquireProgram(Ct,Ft),Bt.set(Ft,te),X.uniforms=Ct.uniforms;let Ot=X.uniforms;return(!y.isShaderMaterial&&!y.isRawShaderMaterial||y.clipping===!0)&&(Ot.clippingPlanes=Gt.uniform),Ae(y,Ct),X.needsLights=jr(y),X.lightsStateVersion=Lt,X.needsLights&&(Ot.ambientLightColor.value=q.state.ambient,Ot.lightProbe.value=q.state.probe,Ot.sunLights.value=q.state.sun,Ot.sunLightShadows.value=q.state.sunShadow,Ot.directionalLights.value=q.state.directional,Ot.directionalLightShadows.value=q.state.directionalShadow,Ot.spotLights.value=q.state.spot,Ot.spotLightShadows.value=q.state.spotShadow,Ot.rectAreaLights.value=q.state.rectArea,Ot.ltc_1.value=q.state.rectAreaLTC1,Ot.ltc_2.value=q.state.rectAreaLTC2,Ot.pointLights.value=q.state.point,Ot.pointLightShadows.value=q.state.pointShadow,Ot.hemisphereLights.value=q.state.hemi,Ot.sunShadowMatrix.value=q.state.sunShadowMatrix,Ot.sunShadowCascade.value=q.state.sunShadowCascade,Ot.directionalShadowMatrix.value=q.state.directionalShadowMatrix,Ot.spotLightMatrix.value=q.state.spotLightMatrix,Ot.spotLightMap.value=q.state.spotLightMap,Ot.pointShadowMatrix.value=q.state.pointShadowMatrix),X.lightProbeGrid=b.state.lightProbeGridArray.length>0,X.currentProgram=te,X.uniformsList=null,te}function Si(y){if(y.uniformsList===null){let U=y.currentProgram.getUniforms();y.uniformsList=$s.seqWithValue(U.seq,y.uniforms)}return y.uniformsList}function Ae(y,U){let Y=K.get(y);Y.outputColorSpace=U.outputColorSpace,Y.batching=U.batching,Y.batchingColor=U.batchingColor,Y.instancing=U.instancing,Y.instancingColor=U.instancingColor,Y.instancingMorph=U.instancingMorph,Y.skinning=U.skinning,Y.morphTargets=U.morphTargets,Y.morphNormals=U.morphNormals,Y.morphColors=U.morphColors,Y.morphTargetsCount=U.morphTargetsCount,Y.numClippingPlanes=U.numClippingPlanes,Y.numIntersection=U.numClipIntersection,Y.vertexAlphas=U.vertexAlphas,Y.vertexTangents=U.vertexTangents,Y.toneMapping=U.toneMapping}function qi(y,U){if(y.length===0)return null;if(y.length===1)return y[0].texture!==null?y[0]:null;S.setFromMatrixPosition(U.matrixWorld);for(let Y=0,X=y.length;Y<X;Y++){let q=y[Y];if(q.texture!==null&&q.boundingBox.containsPoint(S))return q}return null}function un(y,U,Y,X,q){U.isScene!==!0&&(U=kt),Q.resetTextureUnits();let gt=U.fog,Lt=X.isMeshStandardMaterial||X.isMeshLambertMaterial||X.isMeshPhongMaterial?U.environment:null,Ct=j===null?L.outputColorSpace:j.isXRRenderTarget===!0?j.texture.colorSpace:pe.workingColorSpace,Ft=X.isMeshStandardMaterial||X.isMeshLambertMaterial&&!X.envMap||X.isMeshPhongMaterial&&!X.envMap,Bt=pt.get(X.envMap||Lt,Ft),qt=X.vertexColors===!0&&!!Y.attributes.color&&Y.attributes.color.itemSize===4,te=!!Y.attributes.tangent&&(!!X.normalMap||X.anisotropy>0),Ot=!!Y.morphAttributes.position,me=!!Y.morphAttributes.normal,De=!!Y.morphAttributes.color,ye=kn;X.toneMapped&&(j===null||j.isXRRenderTarget===!0)&&(ye=L.toneMapping);let _e=Y.morphAttributes.position||Y.morphAttributes.normal||Y.morphAttributes.color,He=_e!==void 0?_e.length:0,Ut=K.get(X),ke=b.state.lights;if(ot===!0&&(ft===!0||y!==J)){let Se=y===J&&X.id===W;Gt.setState(X,y,Se)}let ge=!1;X.version===Ut.__version?(Ut.needsLights&&Ut.lightsStateVersion!==ke.state.version||Ut.outputColorSpace!==Ct||q.isBatchedMesh&&Ut.batching===!1||!q.isBatchedMesh&&Ut.batching===!0||q.isBatchedMesh&&Ut.batchingColor===!0&&q._colorsTexture===null||q.isBatchedMesh&&Ut.batchingColor===!1&&q._colorsTexture!==null||q.isInstancedMesh&&Ut.instancing===!1||!q.isInstancedMesh&&Ut.instancing===!0||q.isSkinnedMesh&&Ut.skinning===!1||!q.isSkinnedMesh&&Ut.skinning===!0||q.isInstancedMesh&&Ut.instancingColor===!0&&q.instanceColor===null||q.isInstancedMesh&&Ut.instancingColor===!1&&q.instanceColor!==null||q.isInstancedMesh&&Ut.instancingMorph===!0&&q.morphTexture===null||q.isInstancedMesh&&Ut.instancingMorph===!1&&q.morphTexture!==null||Ut.envMap!==Bt||X.fog===!0&&Ut.fog!==gt||Ut.numClippingPlanes!==void 0&&(Ut.numClippingPlanes!==Gt.numPlanes||Ut.numIntersection!==Gt.numIntersection)||Ut.vertexAlphas!==qt||Ut.vertexTangents!==te||Ut.morphTargets!==Ot||Ut.morphNormals!==me||Ut.morphColors!==De||Ut.toneMapping!==ye||Ut.morphTargetsCount!==He||!!Ut.lightProbeGrid!=b.state.lightProbeGridArray.length>0)&&(ge=!0):(ge=!0,Ut.__version=X.version);let an=Ut.currentProgram;ge===!0&&(an=tn(X,U,q),B&&X.isNodeMaterial&&B.onUpdateProgram(X,an,Ut));let An=!1,Dn=!1,wi=!1,ve=an.getUniforms(),Pe=Ut.uniforms;if(x.useProgram(an.program)&&(An=!0,Dn=!0,wi=!0),X.id!==W&&(W=X.id,Dn=!0),Ut.needsLights){let Se=qi(b.state.lightProbeGridArray,q);Ut.lightProbeGrid!==Se&&(Ut.lightProbeGrid=Se,Dn=!0)}if(An||J!==y){x.buffers.depth.getReversed()&&y.reversedDepth!==!0&&(y._reversedDepth=!0,y.updateProjectionMatrix()),ve.setValue(F,"projectionMatrix",y.projectionMatrix),ve.setValue(F,"viewMatrix",y.matrixWorldInverse);let Xn=ve.map.cameraPosition;Xn!==void 0&&Xn.setValue(F,St.setFromMatrixPosition(y.matrixWorld)),E.logarithmicDepthBuffer&&ve.setValue(F,"logDepthBufFC",2/(Math.log(y.far+1)/Math.LN2)),(X.isMeshPhongMaterial||X.isMeshToonMaterial||X.isMeshLambertMaterial||X.isMeshBasicMaterial||X.isMeshStandardMaterial||X.isShaderMaterial)&&ve.setValue(F,"isOrthographic",y.isOrthographicCamera===!0),J!==y&&(J=y,Dn=!0,wi=!0)}if(Ut.needsLights&&(ke.state.sunShadowMap.length>0&&ve.setValue(F,"sunShadowMap",ke.state.sunShadowMap,Q),ke.state.directionalShadowMap.length>0&&ve.setValue(F,"directionalShadowMap",ke.state.directionalShadowMap,Q),ke.state.spotShadowMap.length>0&&ve.setValue(F,"spotShadowMap",ke.state.spotShadowMap,Q),ke.state.pointShadowMap.length>0&&ve.setValue(F,"pointShadowMap",ke.state.pointShadowMap,Q)),q.isSkinnedMesh){ve.setOptional(F,q,"bindMatrix"),ve.setOptional(F,q,"bindMatrixInverse");let Se=q.skeleton;Se&&(Se.boneTexture===null&&Se.computeBoneTexture(),ve.setValue(F,"boneTexture",Se.boneTexture,Q))}q.isBatchedMesh&&(ve.setOptional(F,q,"batchingTexture"),ve.setValue(F,"batchingTexture",q._matricesTexture,Q),ve.setOptional(F,q,"batchingIdTexture"),ve.setValue(F,"batchingIdTexture",q._indirectTexture,Q),ve.setOptional(F,q,"batchingColorTexture"),q._colorsTexture!==null&&ve.setValue(F,"batchingColorTexture",q._colorsTexture,Q));let Nn=Y.morphAttributes;if((Nn.position!==void 0||Nn.normal!==void 0||Nn.color!==void 0)&&z.update(q,Y,an),(Dn||Ut.receiveShadow!==q.receiveShadow)&&(Ut.receiveShadow=q.receiveShadow,ve.setValue(F,"receiveShadow",q.receiveShadow)),(X.isMeshStandardMaterial||X.isMeshLambertMaterial||X.isMeshPhongMaterial)&&X.envMap===null&&U.environment!==null&&(Pe.envMapIntensity.value=U.environmentIntensity),Pe.dfgLUT!==void 0&&(Pe.dfgLUT.value=Fx()),Dn){if(ve.setValue(F,"toneMappingExposure",L.toneMappingExposure),Ut.needsLights&&Qs(Pe,wi),gt&&X.fog===!0&&Vt.refreshFogUniforms(Pe,gt),Vt.refreshMaterialUniforms(Pe,X,it,tt,b.state.transmissionRenderTarget[y.id]),Ut.needsLights&&Ut.lightProbeGrid){let Se=Ut.lightProbeGrid;Pe.probesSH.value=Se.texture,Pe.probesMin.value.copy(Se.boundingBox.min),Pe.probesMax.value.copy(Se.boundingBox.max),Pe.probesResolution.value.copy(Se.resolution)}$s.upload(F,Si(Ut),Pe,Q)}if(X.isShaderMaterial&&X.uniformsNeedUpdate===!0&&($s.upload(F,Si(Ut),Pe,Q),X.uniformsNeedUpdate=!1),X.isSpriteMaterial&&ve.setValue(F,"center",q.center),ve.setValue(F,"modelViewMatrix",q.modelViewMatrix),ve.setValue(F,"normalMatrix",q.normalMatrix),ve.setValue(F,"modelMatrix",q.matrixWorld),X.uniformsGroups!==void 0){let Se=X.uniformsGroups;for(let Xn=0,Ti=Se.length;Xn<Ti;Xn++){let Yi=Se[Xn];dt.update(Yi,an),dt.bind(Yi,an)}}return an}function Qs(y,U){y.ambientLightColor.needsUpdate=U,y.lightProbe.needsUpdate=U,y.sunLights.needsUpdate=U,y.sunLightShadows.needsUpdate=U,y.directionalLights.needsUpdate=U,y.directionalLightShadows.needsUpdate=U,y.pointLights.needsUpdate=U,y.pointLightShadows.needsUpdate=U,y.spotLights.needsUpdate=U,y.spotLightShadows.needsUpdate=U,y.rectAreaLights.needsUpdate=U,y.hemisphereLights.needsUpdate=U}function jr(y){return y.isMeshLambertMaterial||y.isMeshToonMaterial||y.isMeshPhongMaterial||y.isMeshStandardMaterial||y.isShadowMaterial||y.isShaderMaterial&&y.lights===!0}this.getActiveCubeFace=function(){return k},this.getActiveMipmapLevel=function(){return V},this.getRenderTarget=function(){return j},this.setRenderTargetTextures=function(y,U,Y){let X=K.get(y);X.__autoAllocateDepthBuffer=y.resolveDepthBuffer===!1,X.__autoAllocateDepthBuffer===!1&&(X.__useRenderToTexture=!1),K.get(y.texture).__webglTexture=U,K.get(y.depthTexture).__webglTexture=X.__autoAllocateDepthBuffer?void 0:Y,X.__hasExternalTextures=!0},this.setRenderTargetFramebuffer=function(y,U){let Y=K.get(y);Y.__webglFramebuffer=U,Y.__useDefaultFramebuffer=U===void 0},this.setRenderTarget=function(y,U=0,Y=0){j=y,k=U,V=Y;let X=null,q=!1,gt=!1;if(y){let Ct=K.get(y);if(Ct.__useDefaultFramebuffer!==void 0){x.bindFramebuffer(F.FRAMEBUFFER,Ct.__webglFramebuffer),et.copy(y.viewport),vt.copy(y.scissor),rt=y.scissorTest,x.viewport(et),x.scissor(vt),x.setScissorTest(rt),W=-1;return}else if(Ct.__webglFramebuffer===void 0)Q.setupRenderTarget(y);else if(Ct.__hasExternalTextures)Q.rebindTextures(y,K.get(y.texture).__webglTexture,K.get(y.depthTexture).__webglTexture);else if(y.depthBuffer){let qt=y.depthTexture;if(Ct.__boundDepthTexture!==qt){if(qt!==null&&K.has(qt)&&(y.width!==qt.image.width||y.height!==qt.image.height))throw new Error("THREE.WebGLRenderer: Attached DepthTexture is initialized to the incorrect size.");Q.setupDepthRenderbuffer(y)}}let Ft=y.texture;(Ft.isData3DTexture||Ft.isDataArrayTexture||Ft.isCompressedArrayTexture)&&(gt=!0);let Bt=K.get(y).__webglFramebuffer;y.isWebGLCubeRenderTarget?(Array.isArray(Bt[U])?X=Bt[U][Y]:X=Bt[U],q=!0):y.samples>0&&Q.useMultisampledRTT(y)===!1?X=K.get(y).__webglMultisampledFramebuffer:Array.isArray(Bt)?X=Bt[Y]:X=Bt,et.copy(y.viewport),vt.copy(y.scissor),rt=y.scissorTest}else et.copy(It).multiplyScalar(it).floor(),vt.copy(Yt).multiplyScalar(it).floor(),rt=he;if(Y!==0&&(X=G),x.bindFramebuffer(F.FRAMEBUFFER,X)&&x.drawBuffers(y,X),x.viewport(et),x.scissor(vt),x.setScissorTest(rt),q){let Ct=K.get(y.texture);F.framebufferTexture2D(F.FRAMEBUFFER,F.COLOR_ATTACHMENT0,F.TEXTURE_CUBE_MAP_POSITIVE_X+U,Ct.__webglTexture,Y)}else if(gt){let Ct=U;for(let Ft=0;Ft<y.textures.length;Ft++){let Bt=K.get(y.textures[Ft]);F.framebufferTextureLayer(F.FRAMEBUFFER,F.COLOR_ATTACHMENT0+Ft,Bt.__webglTexture,Y,Ct)}}else if(y!==null&&Y!==0){let Ct=K.get(y.texture);F.framebufferTexture2D(F.FRAMEBUFFER,F.COLOR_ATTACHMENT0,F.TEXTURE_2D,Ct.__webglTexture,Y)}W=-1};function bi(y){let U=K.get(y);return(U.__readFormat!==y.format||U.__readType!==y.type)&&(U.__readFormat=y.format,U.__readType=y.type,U.__formatReadable=E.textureFormatReadable(y.format),U.__typeReadable=E.textureTypeReadable(y.type)),U}this.readRenderTargetPixels=function(y,U,Y,X,q,gt,Lt,Ct=0){if(!(y&&y.isWebGLRenderTarget)){jt("WebGLRenderer.readRenderTargetPixels: renderTarget is not THREE.WebGLRenderTarget.");return}let Ft=K.get(y).__webglFramebuffer;if(y.isWebGLCubeRenderTarget&&Lt!==void 0&&(Ft=Ft[Lt]),Ft){x.bindFramebuffer(F.FRAMEBUFFER,Ft);try{let Bt=y.textures[Ct],qt=Bt.format,te=Bt.type;y.textures.length>1&&F.readBuffer(F.COLOR_ATTACHMENT0+Ct);let Ot=bi(Bt);if(Ot.__formatReadable===!1){jt("WebGLRenderer.readRenderTargetPixels: renderTarget is not in RGBA or implementation defined format.");return}if(Ot.__typeReadable===!1){jt("WebGLRenderer.readRenderTargetPixels: renderTarget is not in UnsignedByteType or implementation defined type.");return}U>=0&&U<=y.width-X&&Y>=0&&Y<=y.height-q&&F.readPixels(U,Y,X,q,Tt.convert(qt),Tt.convert(te),gt)}finally{let Bt=j!==null?K.get(j).__webglFramebuffer:null;x.bindFramebuffer(F.FRAMEBUFFER,Bt)}}},this.readRenderTargetPixelsAsync=async function(y,U,Y,X,q,gt,Lt,Ct=0){if(!(y&&y.isWebGLRenderTarget))throw new Error("THREE.WebGLRenderer.readRenderTargetPixels: renderTarget is not THREE.WebGLRenderTarget.");let Ft=K.get(y).__webglFramebuffer;if(y.isWebGLCubeRenderTarget&&Lt!==void 0&&(Ft=Ft[Lt]),Ft)if(U>=0&&U<=y.width-X&&Y>=0&&Y<=y.height-q){x.bindFramebuffer(F.FRAMEBUFFER,Ft);let Bt=y.textures[Ct],qt=Bt.format,te=Bt.type;y.textures.length>1&&F.readBuffer(F.COLOR_ATTACHMENT0+Ct);let Ot=bi(Bt);if(Ot.__formatReadable===!1)throw new Error("THREE.WebGLRenderer.readRenderTargetPixelsAsync: renderTarget is not in RGBA or implementation defined format.");if(Ot.__typeReadable===!1)throw new Error("THREE.WebGLRenderer.readRenderTargetPixelsAsync: renderTarget is not in UnsignedByteType or implementation defined type.");let me=F.createBuffer();F.bindBuffer(F.PIXEL_PACK_BUFFER,me),F.bufferData(F.PIXEL_PACK_BUFFER,gt.byteLength,F.STREAM_READ),F.readPixels(U,Y,X,q,Tt.convert(qt),Tt.convert(te),0),F.bindBuffer(F.PIXEL_PACK_BUFFER,null);let De=j!==null?K.get(j).__webglFramebuffer:null;x.bindFramebuffer(F.FRAMEBUFFER,De);let ye=F.fenceSync(F.SYNC_GPU_COMMANDS_COMPLETE,0);return F.flush(),await Eu(F,ye,4),F.bindBuffer(F.PIXEL_PACK_BUFFER,me),F.getBufferSubData(F.PIXEL_PACK_BUFFER,0,gt),F.bindBuffer(F.PIXEL_PACK_BUFFER,null),F.deleteBuffer(me),F.deleteSync(ye),gt}else throw new Error("THREE.WebGLRenderer.readRenderTargetPixelsAsync: requested read bounds are out of range.")},this.copyFramebufferToTexture=function(y,U=null,Y=0){let X=Math.pow(2,-Y),q=Math.floor(y.image.width*X),gt=Math.floor(y.image.height*X),Lt=U!==null?U.x:0,Ct=U!==null?U.y:0;Q.setTexture2D(y,0),F.copyTexSubImage2D(F.TEXTURE_2D,Y,0,0,Lt,Ct,q,gt),x.unbindTexture()},this.copyTextureToTexture=function(y,U,Y=null,X=null,q=0,gt=0){let Lt,Ct,Ft,Bt,qt,te,Ot,me,De,ye=y.isCompressedTexture?y.mipmaps[gt]:y.image;if(Y!==null)Lt=Y.max.x-Y.min.x,Ct=Y.max.y-Y.min.y,Ft=Y.isBox3?Y.max.z-Y.min.z:1,Bt=Y.min.x,qt=Y.min.y,te=Y.isBox3?Y.min.z:0;else{let Pe=Math.pow(2,-q);Lt=Math.floor(ye.width*Pe),Ct=Math.floor(ye.height*Pe),y.isDataArrayTexture?Ft=ye.depth:y.isData3DTexture?Ft=Math.floor(ye.depth*Pe):Ft=1,Bt=0,qt=0,te=0}X!==null?(Ot=X.x,me=X.y,De=X.z):(Ot=0,me=0,De=0);let _e=Tt.convert(U.format),He=Tt.convert(U.type),Ut;U.isData3DTexture?(Q.setTexture3D(U,0),Ut=F.TEXTURE_3D):U.isDataArrayTexture||U.isCompressedArrayTexture?(Q.setTexture2DArray(U,0),Ut=F.TEXTURE_2D_ARRAY):(Q.setTexture2D(U,0),Ut=F.TEXTURE_2D),x.activeTexture(F.TEXTURE0),x.pixelStorei(F.UNPACK_FLIP_Y_WEBGL,U.flipY),x.pixelStorei(F.UNPACK_PREMULTIPLY_ALPHA_WEBGL,U.premultiplyAlpha),x.pixelStorei(F.UNPACK_ALIGNMENT,U.unpackAlignment);let ke=x.getParameter(F.UNPACK_ROW_LENGTH),ge=x.getParameter(F.UNPACK_IMAGE_HEIGHT),an=x.getParameter(F.UNPACK_SKIP_PIXELS),An=x.getParameter(F.UNPACK_SKIP_ROWS),Dn=x.getParameter(F.UNPACK_SKIP_IMAGES);x.pixelStorei(F.UNPACK_ROW_LENGTH,ye.width),x.pixelStorei(F.UNPACK_IMAGE_HEIGHT,ye.height),x.pixelStorei(F.UNPACK_SKIP_PIXELS,Bt),x.pixelStorei(F.UNPACK_SKIP_ROWS,qt),x.pixelStorei(F.UNPACK_SKIP_IMAGES,te);let wi=y.isDataArrayTexture||y.isData3DTexture,ve=U.isDataArrayTexture||U.isData3DTexture;if(y.isDepthTexture){let Pe=K.get(y),Nn=K.get(U),Se=K.get(Pe.__renderTarget),Xn=K.get(Nn.__renderTarget);x.bindFramebuffer(F.READ_FRAMEBUFFER,Se.__webglFramebuffer),x.bindFramebuffer(F.DRAW_FRAMEBUFFER,Xn.__webglFramebuffer);for(let Ti=0;Ti<Ft;Ti++)wi&&(F.framebufferTextureLayer(F.READ_FRAMEBUFFER,F.COLOR_ATTACHMENT0,K.get(y).__webglTexture,q,te+Ti),F.framebufferTextureLayer(F.DRAW_FRAMEBUFFER,F.COLOR_ATTACHMENT0,K.get(U).__webglTexture,gt,De+Ti)),F.blitFramebuffer(Bt,qt,Lt,Ct,Ot,me,Lt,Ct,F.DEPTH_BUFFER_BIT,F.NEAREST);x.bindFramebuffer(F.READ_FRAMEBUFFER,null),x.bindFramebuffer(F.DRAW_FRAMEBUFFER,null)}else if(q!==0||y.isRenderTargetTexture||K.has(y)){let Pe=K.get(y),Nn=K.get(U);x.bindFramebuffer(F.READ_FRAMEBUFFER,N),x.bindFramebuffer(F.DRAW_FRAMEBUFFER,C);for(let Se=0;Se<Ft;Se++)wi?F.framebufferTextureLayer(F.READ_FRAMEBUFFER,F.COLOR_ATTACHMENT0,Pe.__webglTexture,q,te+Se):F.framebufferTexture2D(F.READ_FRAMEBUFFER,F.COLOR_ATTACHMENT0,F.TEXTURE_2D,Pe.__webglTexture,q),ve?F.framebufferTextureLayer(F.DRAW_FRAMEBUFFER,F.COLOR_ATTACHMENT0,Nn.__webglTexture,gt,De+Se):F.framebufferTexture2D(F.DRAW_FRAMEBUFFER,F.COLOR_ATTACHMENT0,F.TEXTURE_2D,Nn.__webglTexture,gt),q!==0?F.blitFramebuffer(Bt,qt,Lt,Ct,Ot,me,Lt,Ct,F.COLOR_BUFFER_BIT,F.NEAREST):ve?F.copyTexSubImage3D(Ut,gt,Ot,me,De+Se,Bt,qt,Lt,Ct):F.copyTexSubImage2D(Ut,gt,Ot,me,Bt,qt,Lt,Ct);x.bindFramebuffer(F.READ_FRAMEBUFFER,null),x.bindFramebuffer(F.DRAW_FRAMEBUFFER,null)}else ve?y.isDataTexture||y.isData3DTexture?F.texSubImage3D(Ut,gt,Ot,me,De,Lt,Ct,Ft,_e,He,ye.data):U.isCompressedArrayTexture?F.compressedTexSubImage3D(Ut,gt,Ot,me,De,Lt,Ct,Ft,_e,ye.data):F.texSubImage3D(Ut,gt,Ot,me,De,Lt,Ct,Ft,_e,He,ye):y.isDataTexture?F.texSubImage2D(F.TEXTURE_2D,gt,Ot,me,Lt,Ct,_e,He,ye.data):y.isCompressedTexture?F.compressedTexSubImage2D(F.TEXTURE_2D,gt,Ot,me,ye.width,ye.height,_e,ye.data):F.texSubImage2D(F.TEXTURE_2D,gt,Ot,me,Lt,Ct,_e,He,ye);x.pixelStorei(F.UNPACK_ROW_LENGTH,ke),x.pixelStorei(F.UNPACK_IMAGE_HEIGHT,ge),x.pixelStorei(F.UNPACK_SKIP_PIXELS,an),x.pixelStorei(F.UNPACK_SKIP_ROWS,An),x.pixelStorei(F.UNPACK_SKIP_IMAGES,Dn),gt===0&&U.generateMipmaps&&F.generateMipmap(Ut),x.unbindTexture()},this.initRenderTarget=function(y){K.get(y).__webglFramebuffer===void 0&&Q.setupRenderTarget(y)},this.initTexture=function(y){y.isCubeTexture?Q.setTextureCube(y,0):y.isData3DTexture?Q.setTexture3D(y,0):y.isDataArrayTexture||y.isCompressedArrayTexture?Q.setTexture2DArray(y,0):Q.setTexture2D(y,0),x.unbindTexture()},this.resetState=function(){k=0,V=0,j=null,x.reset(),Pt.reset()},typeof __THREE_DEVTOOLS__<"u"&&__THREE_DEVTOOLS__.dispatchEvent(new CustomEvent("observe",{detail:this}))}get coordinateSystem(){return zn}get outputColorSpace(){return this._outputColorSpace}set outputColorSpace(t){this._outputColorSpace=t;let e=this.getContext();e.drawingBufferColorSpace=pe._getDrawingBufferColorSpace(t),e.unpackColorSpace=pe._getUnpackColorSpace()}};var Zr=new O;function Pn(i,t,e,n,s,r){let o=2*Math.PI*s/4,a=Math.max(r-2*s,0),l=Math.PI/4;Zr.copy(t),Zr[n]=0,Zr.normalize();let c=.5*o/(o+a),h=1-Zr.angleTo(i)/l;return Math.sign(Zr[e])===1?h*c:a/(o+a)+c+c*(1-h)}var pl=class i extends ti{constructor(t=1,e=1,n=1,s=2,r=.1){let o=s*2+1;if(r=Math.min(t/2,e/2,n/2,r),super(1,1,1,o,o,o),this.type="RoundedBoxGeometry",this.parameters={width:t,height:e,depth:n,segments:s,radius:r},o===1)return;let a=this.toNonIndexed();this.index=null,this.attributes.position=a.attributes.position,this.attributes.normal=a.attributes.normal,this.attributes.uv=a.attributes.uv;let l=new O,c=new O,h=new O(t,e,n).divideScalar(2).subScalar(r),f=this.attributes.position.array,u=this.attributes.normal.array,d=this.attributes.uv.array,g=f.length/6,M=new O,m=.5/o;for(let p=0,T=0;p<f.length;p+=3,T+=2)switch(l.fromArray(f,p),c.copy(l),c.x-=Math.sign(c.x)*m,c.y-=Math.sign(c.y)*m,c.z-=Math.sign(c.z)*m,c.normalize(),f[p+0]=h.x*Math.sign(l.x)+c.x*r,f[p+1]=h.y*Math.sign(l.y)+c.y*r,f[p+2]=h.z*Math.sign(l.z)+c.z*r,u[p+0]=c.x,u[p+1]=c.y,u[p+2]=c.z,Math.floor(p/g)){case 0:M.set(1,0,0),d[T+0]=Pn(M,c,"z","y",r,n),d[T+1]=1-Pn(M,c,"y","z",r,e);break;case 1:M.set(-1,0,0),d[T+0]=1-Pn(M,c,"z","y",r,n),d[T+1]=1-Pn(M,c,"y","z",r,e);break;case 2:M.set(0,1,0),d[T+0]=1-Pn(M,c,"x","z",r,t),d[T+1]=Pn(M,c,"z","x",r,n);break;case 3:M.set(0,-1,0),d[T+0]=1-Pn(M,c,"x","z",r,t),d[T+1]=1-Pn(M,c,"z","x",r,n);break;case 4:M.set(0,0,1),d[T+0]=1-Pn(M,c,"x","y",r,t),d[T+1]=1-Pn(M,c,"y","x",r,e);break;case 5:M.set(0,0,-1),d[T+0]=Pn(M,c,"x","y",r,t),d[T+1]=1-Pn(M,c,"y","x",r,e);break}}static fromJSON(t){return new i(t.width,t.height,t.depth,t.segments,t.radius)}};function ud(i,t=!1){let e=i[0].index!==null,n=new Set(Object.keys(i[0].attributes)),s=new Set(Object.keys(i[0].morphAttributes)),r={},o={},a=i[0].morphTargetsRelative,l=new sn,c=0;for(let h=0;h<i.length;++h){let f=i[h],u=0;if(e!==(f.index!==null))return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index "+h+". All geometries must have compatible attributes; make sure index attribute exists among all geometries, or in none of them."),null;for(let d in f.attributes){if(!n.has(d))return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index "+h+'. All geometries must have compatible attributes; make sure "'+d+'" attribute exists among all geometries, or in none of them.'),null;r[d]===void 0&&(r[d]=[]),r[d].push(f.attributes[d]),u++}if(u!==n.size)return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index "+h+". Make sure all geometries have the same number of attributes."),null;if(a!==f.morphTargetsRelative)return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index "+h+". .morphTargetsRelative must be consistent throughout all geometries."),null;for(let d in f.morphAttributes){if(!s.has(d))return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index "+h+".  .morphAttributes must be consistent throughout all geometries."),null;o[d]===void 0&&(o[d]=[]),o[d].push(f.morphAttributes[d])}if(t){let d;if(e)d=f.index.count;else if(f.attributes.position!==void 0)d=f.attributes.position.count;else return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index "+h+". The geometry must have either an index or a position attribute"),null;l.addGroup(c,d,h),c+=d}}if(e){let h=0,f=[];for(let u=0;u<i.length;++u){let d=i[u].index;for(let g=0;g<d.count;++g)f.push(d.getX(g)+h);h+=i[u].attributes.position.count}l.setIndex(f)}for(let h in r){let f=hd(r[h]);if(!f)return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the "+h+" attribute."),null;l.setAttribute(h,f)}for(let h in o){let f=o[h][0].length;if(f!==0){l.morphAttributes=l.morphAttributes||{},l.morphAttributes[h]=[];for(let u=0;u<f;++u){let d=[];for(let M=0;M<o[h].length;++M)d.push(o[h][M][u]);let g=hd(d);if(!g)return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the "+h+" morphAttribute."),null;l.morphAttributes[h].push(g)}}}return l}function hd(i){let t,e,n,s=-1,r=0;for(let c=0;c<i.length;++c){let h=i[c];if(t===void 0&&(t=h.array.constructor),t!==h.array.constructor)return console.error("THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.array must be of consistent array types across matching attributes."),null;if(e===void 0&&(e=h.itemSize),e!==h.itemSize)return console.error("THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.itemSize must be consistent across matching attributes."),null;if(n===void 0&&(n=h.normalized),n!==h.normalized)return console.error("THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.normalized must be consistent across matching attributes."),null;if(s===-1&&(s=h.gpuType),s!==h.gpuType)return console.error("THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.gpuType must be consistent across matching attributes."),null;r+=h.count*e}let o=new t(r),a=new pn(o,e,n),l=0;for(let c=0;c<i.length;++c){let h=i[c];if(h.isInterleavedBufferAttribute){let f=l/e;for(let u=0,d=h.count;u<d;u++)for(let g=0;g<e;g++){let M=h.getComponent(u,g);a.setComponent(u+f,g,M)}}else o.set(h.array,l);l+=h.count*e}return s!==void 0&&(a.gpuType=s),a}var Hi=.3,xi=.27,Ln=.014,Wi=.3,nh=9,_i=.15,ih=1.2,Ox=-.035,ml=_i+Ln/2-.005-Ox,lM=4.02-ml;function dd(){let i=new cn;i.name="Brick-built stone keep";let t=[],e=new Map,s=["#55616a","#5c6870","#637078","#505c65","#6b757b","#5a666e","#626b71"].map(b=>new Di({color:b,roughness:.42,metalness:.025})),r=["#79848a","#707c83","#65717a"].map(b=>new Di({color:b,roughness:.43,metalness:.025})),o=new Di({color:"#444f58",roughness:.48,metalness:.02}),a=1,l=0,c=new Rr([new xt(0,0),new xt(.078,0),new xt(.087,.008),new xt(.087,.048),new xt(.08,.055),new xt(0,.055)],16);function h(b){let R=ud(b.map(_=>_.index?_.toNonIndexed():_),!1);return R.computeBoundingSphere(),R}function f(b,R,_){return c.clone().applyMatrix4(new Ee().makeTranslation(b,R,_))}function u(b,R,_,w=!0){let L=[b,R,_,w].map(G=>typeof G=="number"?G.toFixed(4):G).join("/");if(e.has(L))return e.get(L);let D=[new pl(b-Ln,R-Ln,_-Ln,2,.011)];if(w){let G=Math.max(1,Math.floor((b-.18)/Hi)+1),N=Math.max(1,Math.floor((_-.18)/Hi)+1);for(let C=0;C<G;C++)for(let k=0;k<N;k++){let V=(C-(G-1)/2)*Hi,j=(k-(N-1)/2)*Hi;Math.abs(V)+.09<b/2&&Math.abs(j)+.09<_/2&&D.push(f(V,(R-Ln)/2,j))}}let B=h(D);return e.set(L,B),B}function d(b,{x:R=0,y:_=0,z:w=0,rotation:L=0,material:D,animate:B=!1,order:G,name:N="Masonry brick"}={}){let C=new cn;C.name=N,C.position.set(R,_,w),C.rotation.y=L;let k=new Ue(b,D||s[(a*17+Math.floor(_*31))%s.length]);return k.castShadow=!0,k.receiveShadow=!0,C.add(k),C.userData={brick:!0,index:a++,course:Math.floor((_-_i)/xi),restHeight:_},i.add(C),B&&t.push({object:C,order:G??_*100+a%23*.025}),C}function g(b,R,_,w,L,D,B){let G=w*Math.PI/2,N=ih-Wi/2;return d(b,{x:Math.cos(G)*R+Math.sin(G)*N,y:_,z:-Math.sin(G)*R+Math.cos(G)*N,rotation:G,material:L,animate:D,name:B})}let M=[[{bottom:_i-.03,spring:.96,radius:.45,top:1.41}],[{bottom:_i-.03,spring:.81,radius:.36,top:1.17}],[],[]];function m(b,R){return b.half?b.half:R<=b.spring?b.radius:Math.sqrt(Math.max(0,b.radius**2-(R-b.spring)**2))}function p(b,R,_){let w=[b],L=_%2?.3:0;for(let D=-1.8+L;D<R-.01;D+=.6)D>b+.08&&w.push(D);return w.push(R),w.slice(0,-1).map((D,B)=>[D,w[B+1]])}function T(b,R,_,w,L,D){let B=(b+R)/2,G=(_+w)/2,N=18,C=[],k=0,V=b+Ln/2,j=R-Ln/2,W=_+Ln/2,J=w-Ln/2;for(let Nt=0;Nt<=N;Nt++){let ne=W+(J-W)*Nt/N,tt=D<0?Math.min(j,-m(L,ne)-.006):Math.max(V,m(L,ne)+.006),it=D<0?Math.max(0,tt-V):Math.max(0,j-tt);k+=it,C.push({y:ne,boundary:D<0?Math.max(V,tt):Math.min(j,tt)})}if(k<.025)return null;let et=new is;if(D<0){et.moveTo(V-B,W-G);for(let Nt of C)et.lineTo(Nt.boundary-B,Nt.y-G);et.lineTo(V-B,J-G)}else{et.moveTo(j-B,W-G),et.lineTo(j-B,J-G);for(let Nt of C.slice().reverse())et.lineTo(Nt.boundary-B,Nt.y-G)}et.closePath();let vt=new ks(et,{depth:Wi-Ln-.012,bevelEnabled:!0,bevelThickness:.006,bevelSize:.005,bevelSegments:2,steps:1,curveSegments:10});vt.translate(0,0,-(Wi-Ln-.012)/2);let rt=[vt],Zt=C[C.length-1].boundary;for(let Nt=-1.05;Nt<1.2;Nt+=Hi)(D<0?Nt+.094<Zt:Nt-.094>Zt)&&Nt-.094>V&&Nt+.094<j&&rt.push(f(Nt-B,J-G,0));return h(rt)}for(let b=0;b<nh;b++){let R=_i+b*xi,_=R+xi;for(let w=0;w<4;w++){let D=w%2===b%2?ih:ih-Wi,B=[R,_],G=M[w],N=!1;for(let C of G)for(let k of[C.bottom,C.top])k>R+.01&&k<_-.01&&(C.radius?N=!0:B.push(k));B.sort((C,k)=>C-k);for(let C=0;C<B.length-1;C++){let k=B[C],V=B[C+1],j=(k+V)/2,W=G.find(J=>j>J.bottom&&j<J.top);for(let[J,et]of p(-D,D,b+w)){let vt=(J+et)/2,rt=!1;if(!W||et<-m(W,k)-.01||J>m(W,k)+.01)g(u(et-J,V-k,Wi),vt,j,w,null,rt,"Interlocking slate-grey wall brick");else for(let Zt of[-1,1]){let Nt=T(J,et,k,V,W,Zt);Nt&&g(Nt,vt,j,w,null,rt,"Shaped masonry around an opening")}}}if(N){let C=p(-D,D,b+w).length;a+=C,l+=C}}}function P(b,R,_,w){for(let B=0;B<w;B++){let G=B*Math.PI/w+.012,N=(B+1)*Math.PI/w-.012,C=R+.135,k=new is;k.absarc(0,0,C,G,N,!1),k.absarc(0,0,R+.007,N,G,!0),k.closePath();let V=new ks(k,{depth:Wi+.025,bevelEnabled:!0,bevelSize:.004,bevelThickness:.004,bevelSegments:2,curveSegments:6,steps:1});V.translate(0,0,-(Wi+.025)/2),g(V,0,_,b,r[B%r.length],!1,"Individual arch voussoir")}let L=_-_i,D=Math.ceil(L/xi);for(let B=0;B<D;B++){let G=L/D;for(let N of[-1,1])g(u(.132,G,Wi+.027,!1),N*(R+.071),_i+G*(B+.5),b,r[(B+b)%r.length],!1,"Arch jamb brick")}}P(0,.45,.96,7),P(1,.36,.81,7);let S=new Di({color:"#757f84",roughness:.46,metalness:.02});d(u(6*Hi,xi/3,6*Hi),{y:_i+nh*xi-xi/6,material:S,name:"Deck"});for(let b of i.children)b.position.y-=ml,b.userData.restHeight-=ml;let A=new Map;i.updateMatrixWorld(!0);for(let b of i.children.slice())b.traverse(R=>{R.isMesh&&(A.has(R.material)||A.set(R.material,[]),A.get(R.material).push(R.geometry.clone().applyMatrix4(R.matrixWorld)))}),i.remove(b);for(let[b,R]of A){let _=new Ue(h(R),b);_.name="Fixed castle masonry",_.castShadow=!0,_.receiveShadow=!0,i.add(_),R.forEach(w=>w.dispose())}return{model:i,brickGeometry:u,stones:s,foundationTop:_i+nh*xi-ml,pitch:Hi,course:xi,gap:Ln}}var $r=.016666666666666666;function fd(i,{pieces:t,grips:e,standing:n,shell:s,groundY:r,leans:o,random:a=Math.random}){let l=new i.World({gravity:new i.Vec3(0,-26,0),allowSleep:!0});l.broadphase=new i.SAPBroadphase(l),l.solver.iterations=18,l.defaultContactMaterial.friction=.55,l.defaultContactMaterial.restitution=.18;let c=C=>l.addBody(new i.Body({mass:0,shape:new i.Box(new i.Vec3(C.hx,C.hy,C.hz)),position:new i.Vec3(C.x,C.y,C.z)}));s.forEach(c),n.forEach(c);let h=new i.Body({mass:0,shape:new i.Plane,position:new i.Vec3(0,r,0)});h.quaternion.setFromAxisAngle(new i.Vec3(1,0,0),-Math.PI/2),l.addBody(h);let f=t.map(C=>new i.Quaternion().setFromAxisAngle(new i.Vec3(0,1,0),C.rotY)),u=C=>C.hx*C.hy*C.hz,d=new Set,g=new Map,M=0,m=e.map(C=>C.studs+a()*1.5);function p(C,k,V,j,W,J,et){let vt=0,rt=new i.Vec3;for(let tt of C){let it=u(t[tt]),Mt=k(tt);vt+=it,rt.x+=Mt.x*it,rt.y+=Mt.y*it,rt.z+=Mt.z*it}rt.scale(1/vt,rt);let Zt=new i.Body({mass:8*vt*20,position:V.vadd(j.vmult(rt)),quaternion:j.clone(),velocity:W(j.vmult(rt)),angularVelocity:J.clone(),allowSleep:M>=1.2,sleepSpeedLimit:.6,sleepTimeLimit:.25}),Nt=new Map;for(let tt of C){let it=t[tt],Mt=k(tt).vsub(rt);Nt.set(tt,Mt),Zt.addShape(new i.Box(new i.Vec3(it.hx,it.hy,it.hz)),Mt)}let ne={body:Zt,members:C,offsets:Nt,level:et,from:Zt.position.clone()};return Zt.addEventListener("collide",tt=>{if(C.length<2)return;let it=Math.abs(tt.contact.getImpactVelocityAlongNormal());it>1.6&&g.set(ne,Math.max(g.get(ne)||0,it))}),l.addBody(Zt),d.add(ne),ne}function T(C,k){let V=new Map(C.map(J=>[J,J])),j=J=>V.get(J)===J?J:(V.set(J,j(V.get(J))),V.get(J));e.forEach((J,et)=>{m[et]>k&&V.has(J.a)&&V.has(J.b)&&V.set(j(J.a),j(J.b))});let W=new Map;for(let J of C){let et=j(J);W.has(et)||W.set(et,[]),W.get(et).push(J)}return[...W.values()]}function P(C,k){C.level+=k*.75;let V=T(C.members,C.level);if(V.length<2)return;let{body:j,offsets:W,level:J}=C;l.removeBody(j),d.delete(C);let et=rt=>{let Zt=j.velocity.vadd(j.angularVelocity.cross(rt)),Nt=Math.hypot(rt.x,rt.y,rt.z)||1;return Zt.vadd(new i.Vec3(rt.x/Nt*.9,Math.abs(rt.y)/Nt*.9*.5,rt.z/Nt*.9))},vt=()=>(a()-.5)*2.2;for(let rt of V)p(rt,Zt=>W.get(Zt),j.position,j.quaternion,et,j.angularVelocity.vadd(new i.Vec3(vt(),vt(),vt())),J)}let S=new i.Quaternion,A=new i.Vec3,b=new i.Vec3;for(let C of T(t.map((k,V)=>V),0)){let k=p(C,j=>new i.Vec3(t[j].x,t[j].y,t[j].z),A,S,()=>b.clone(),b,0),V=o.find(j=>C.includes(j.piece));if(V){let j=k.body.position.x-V.x,W=k.body.position.z-V.z,J=Math.hypot(j,W)||1;k.body.angularVelocity.set(W/J*.55,0,-j/J*.55)}}function R(C){let{body:k}=C;if(C.members.length>1){let J=d.size;if(P(C,9),d.size!==J||!d.has(C))return}let V=k.position.x,j=k.position.z,W=Math.hypot(V,j)||1;k.velocity.set(V/W*1.6,1,j/W*1.6),k.angularVelocity.set(j/W*3,0,-V/W*3)}let _=new i.Vec3,w=new i.Quaternion;function L(){for(let{body:C,members:k,offsets:V}of d)for(let j of k){C.quaternion.vmult(V.get(j),_);let W=t[j].object;W.position.set(C.position.x+_.x,C.position.y+_.y,C.position.z+_.z),C.quaternion.mult(f[j],w),W.quaternion.set(w.x,w.y,w.z,w.w)}}function D(){if(l.step($r),M+=$r,M>=1.2)for(let{body:C}of d)C.allowSleep=!0;for(let{body:C}of d){let k=C.velocity.length(),V=C.angularVelocity.length();k>15&&C.velocity.scale(15/k,C.velocity),V>12&&C.angularVelocity.scale(12/V,C.angularVelocity)}if(!G&&M>=.7){G=!0;for(let C of[...d])C.body.position.distanceTo(C.from)<.08&&R(C)}for(let[C,k]of g)d.has(C)&&P(C,k);g.clear()}let B=0,G=!1,N=()=>M>5||M>1.2+.25&&[...d].every(C=>C.body.sleepState===i.Body.SLEEPING);return{advance(C){B+=C;for(let k=0;B>=$r&&k<3;k++)D(),B-=$r;B=Math.min(B,$r),L()},finish(){for(;!N();)D();L()},get settled(){return N()},get time(){return M},get clumps(){return d.size}}}var Bx=`
+html.tg-lock{overflow:hidden;scrollbar-gutter:stable}
+#tower-game{touch-action:none;width:min(1000px,100vw);max-width:100vw;height:min(800px,100dvh);max-height:100dvh;padding:0;border:0;border-radius:18px;background:#e3efec;color:#262d35;overflow:hidden}
+#tower-game::backdrop{background:rgba(38,45,53,.55)}
+#tower-game .tg-wrap{display:flex;flex-direction:column;height:100%}
+#tower-game .tg-head{display:flex;align-items:center;gap:12px;padding:10px 12px 4px 18px}
+#tower-game h2{font:500 clamp(20px,3vw,26px)/1.1 'Newsreader',Georgia,serif;margin:0;flex:1}
+#tower-game .tg-count{font-weight:600;font-size:16px;white-space:nowrap}
+#tower-game .tg-field{position:relative;flex:1;min-height:0}
+#tower-game .tg-stage{position:absolute;inset:0;touch-action:none;user-select:none;-webkit-user-select:none}
+#tower-game .tg-over{position:absolute;top:6px;display:flex;gap:6px}
+#tower-game .tg-over[hidden]{display:none}
+#tower-game .tg-plan{left:8px}
+#tower-game .tg-again{right:8px}
+#tower-game .tg-stage.tg-keys:focus{outline:3px solid #005a87;outline-offset:-3px}
+#tower-game canvas{position:absolute;inset:0;width:100%;height:100%;display:block;cursor:crosshair}
+#tower-game .tg-tray{display:grid;grid-template-columns:repeat(10,minmax(0,1fr));gap:4px;padding:4px 12px;touch-action:none;user-select:none;-webkit-user-select:none}
+#tower-game button.tg-style{display:flex;flex-direction:column;align-items:center;justify-content:flex-end;gap:0;min-height:58px;min-width:0;padding:3px 1px 4px;border:2px solid transparent;border-radius:10px;background:#f6faf9;font:600 13px/1.1 'Source Sans 3',system-ui,sans-serif;color:#262d35}
+@media(hover:hover){#tower-game button.tg-style:hover{background:#fff;color:#262d35;border-color:#2d5750}}
+#tower-game button.tg-style[aria-pressed=true]{background:#fff;color:#262d35;border-color:#b34e0a;box-shadow:0 0 0 1px #b34e0a}
+#tower-game .tg-style img{width:100%;max-width:62px;height:34px;object-fit:contain;display:block;pointer-events:none;transition:transform .15s}
+#tower-game .tg-style.tg-flip img{transform:scaleX(-1)}
+#tower-game .tg-style small{font-size:12px;font-weight:400;line-height:1}
+#tower-game .tg-style{position:relative}
+#tower-game .tg-style kbd{position:absolute;top:3px;left:5px;font:600 11px/1 'Source Sans 3',system-ui,sans-serif;color:#5a666e}
+@media(hover:none){#tower-game .tg-style kbd{display:none}}
+#tower-game .tg-looks{left:8px;bottom:6px;top:auto;gap:4px}
+#tower-game button.tg-look{display:flex;align-items:center;gap:5px;min-height:44px;padding:4px 10px 4px 7px;border:2px solid transparent;border-radius:10px;background:#f6faf9;font:600 14px/1 'Source Sans 3',system-ui,sans-serif;color:#262d35;cursor:pointer}
+@media(hover:hover){#tower-game button.tg-look:hover{background:#fff;border-color:#2d5750}}
+#tower-game button.tg-look[aria-pressed=true]{background:#fff;border-color:#b34e0a;box-shadow:0 0 0 1px #b34e0a}
+#tower-game .tg-look i{width:16px;height:16px;border-radius:4px;flex:none}
+#tower-game .tg-look[data-look=grey] i{background:#5c6870}
+#tower-game .tg-look[data-look=brick] i{background:#963a27}
+#tower-game .tg-look[data-look=pride] i{background:linear-gradient(#7046a3 0 17%,#2672b8 17% 33%,#2b985b 33% 50%,#e8b52c 50% 67%,#e98434 67% 83%,#ce4742 83%)}
+#tower-game .tg-note{position:absolute;inset:0;display:flex;align-items:center;justify-content:center;padding:8px;background:rgba(38,45,53,.45)}
+#tower-game .tg-note[hidden]{display:none}
+#tower-game .tg-card{display:flex;flex-direction:column;width:min(500px,100%);max-height:100%;padding:14px 18px 12px;border-radius:14px;background:#fff;box-shadow:0 10px 30px rgba(38,45,53,.3)}
+#tower-game .tg-card h3{font:500 22px/1.1 'Newsreader',Georgia,serif;margin:0 0 6px}
+#tower-game .tg-card .tg-steps{min-height:0;overflow:auto;touch-action:pan-y;margin:0 0 10px;padding:0;list-style:none;font-size:15px;line-height:1.3}
+#tower-game .tg-card li{margin:0 0 7px}
+#tower-game .tg-warn-text{margin:0 0 12px;font-size:17px;line-height:1.35}
+#tower-game .tg-warn-row{display:flex;flex-wrap:wrap;justify-content:flex-end;gap:8px}
+#tower-game .tg-turns{display:flex;align-items:center;gap:4px;float:right;margin:0 0 2px 8px;font-size:20px;color:#5a666e}
+#tower-game .tg-turns img{width:58px;height:36px;object-fit:contain;display:block}
+#tower-game .tg-style.tg-suggested::after{content:'';position:absolute;top:4px;right:4px;width:9px;height:9px;border-radius:50%;background:#14808f}
+#tower-game .tg-foot{display:flex;flex-wrap:wrap;align-items:center;gap:6px 8px;padding:4px 12px 12px 18px}
+#tower-game .tg-hint{flex:1 1 240px;margin:0;font-size:15px;line-height:1.3;height:2.6em;overflow:hidden}
+#tower-game .tg-btn{white-space:nowrap;min-height:44px;padding:8px 14px;border:1.5px solid #2d5750;border-radius:999px;background:#fff;color:#262d35;font:600 15px/1.2 'Source Sans 3',system-ui,sans-serif;cursor:pointer}
+#tower-game .tg-close{min-width:44px;padding:8px 12px}
+@media(hover:hover){#tower-game .tg-btn:hover:not(:disabled){background:#2d5750;color:#fff}}
+#tower-game .tg-btn:disabled{opacity:.45;cursor:default}
+#tower-game .tg-btn.tg-main{flex:0 0 5.4em;padding-left:4px;padding-right:4px;background:#b34e0a;border-color:#b34e0a;color:#fff}
+#tower-game .tg-btn.tg-main:disabled{background:#fff;border-color:#2d5750;color:#262d35}
+@media(hover:hover){#tower-game .tg-btn.tg-main:hover:not(:disabled){background:#8f3e07}}
+#tower-game .tg-card .tg-btn.tg-main{align-self:flex-end;flex:none;padding:8px 16px}
+#tower-game .tg-btn[aria-pressed=true],#tower-game .tg-btn[aria-pressed=true]:hover{background:#14808f;border-color:#14808f;color:#fff}
+#tower-game button:focus-visible{outline:3px solid #005a87;outline-offset:2px}
+#tower-game .tg-sr{position:absolute;width:1px;height:1px;overflow:hidden;clip-path:inset(50%);white-space:nowrap}
+@media(max-width:760px){#tower-game .tg-tray{grid-template-columns:repeat(5,minmax(0,1fr));padding:2px 8px}#tower-game .tg-foot{padding:4px 8px 8px}#tower-game .tg-hint{flex-basis:100%}#tower-game .tg-foot .tg-btn:not(.tg-main){padding:8px 11px;flex:1 1 auto}#tower-game .tg-plan{flex-direction:column}#tower-game .tg-over .tg-btn{padding:8px 11px}}
+@media(max-width:600px){#tower-game{border-radius:0;width:100vw;height:100dvh}#tower-game button.tg-style{min-height:52px}#tower-game .tg-style img{height:28px}}
+@media(max-width:360px){#tower-game button.tg-look{padding:4px 7px 4px 5px}#tower-game .tg-foot .tg-btn:not(.tg-main){padding:8px 6px}#tower-game button.tg-style{min-height:44px}#tower-game .tg-style img{height:22px}#tower-game .tg-style small{display:none}#tower-game .tg-hint{font-size:14px}}
+@media(max-height:480px){#tower-game .tg-card{padding:8px 14px}#tower-game .tg-card h3{font-size:18px;margin-bottom:3px}#tower-game .tg-card .tg-steps{font-size:14px;line-height:1.25;margin-bottom:5px}#tower-game .tg-card li{margin-bottom:3px}#tower-game .tg-turns img{height:24px;width:40px}#tower-game .tg-wrap{display:grid;grid-template-columns:1fr 300px;grid-template-rows:auto auto 1fr}
+ #tower-game .tg-head{grid-column:2;grid-row:1;padding:6px 8px 0 4px}#tower-game .tg-field{grid-column:1;grid-row:1/4}#tower-game .tg-plan{flex-direction:column}#tower-game .tg-over .tg-btn{padding:8px 11px}#tower-game .tg-tray{grid-column:2;grid-row:2;grid-template-columns:repeat(5,minmax(0,1fr));padding:2px 8px 2px 4px}
+ #tower-game button.tg-style{min-height:44px}#tower-game .tg-style img{height:20px}#tower-game .tg-style small{display:none}
+ #tower-game .tg-foot{grid-column:2;grid-row:3;align-content:flex-end;padding:2px 8px 8px 4px}#tower-game .tg-foot .tg-btn:not(.tg-main){padding:6px 8px;flex:1 1 auto}#tower-game .tg-hint{flex:1 1 100%;font-size:14px}}
+`,zx=document.currentScript?.src||location.href,sh=null;function pd(){return sh??=new Promise((i,t)=>{let e=document.createElement("script");e.src=new URL("physics.bundle.js",zx).href,e.onload=()=>i(window.CANNON),e.onerror=()=>{sh=null,t(new Error("The physics file did not load"))},document.head.appendChild(e)}),sh}var Jr=i=>Math.max(0,Math.min(1,i)),gl=i=>{let t=Jr(i);return t*t*(3-2*t)},yi=matchMedia("(prefers-reduced-motion: reduce)"),us=matchMedia("(pointer: coarse)"),yn=.3,hs=.09,Ce={};for(let[i,t]of[[1,1],[1,2],[1,4],[2,2],[2,3],[2,4]])Ce[`b${i}x${t}`]={nx:t,nz:i,plates:3,size:`${i}\xD7${t}`,word:"brick",label:`${i} by ${t} brick`};for(let[i,t]of[[1,1],[1,2],[2,2],[2,4]])Ce[`p${i}x${t}`]={nx:t,nz:i,plates:1,size:`${i}\xD7${t}`,word:"plate",label:`${i} by ${t} plate`};var Kr=Object.keys(Ce),md=i=>String((i+1)%10),kx={grey:"Grey",brick:"Brick",pride:"Pride"},rh=["#8e3524","#963a27","#833022","#9c432c","#8a3828","#7b2d20","#984631"],ah=["#7046a3","#2672b8","#2b985b","#e8b52c","#e98434","#ce4742"],gd=i=>ah[Math.ceil(i/3)%ah.length],oh=-1e3,xl=80,ri=-8,oi=7,_l=48,xd=400;function Vx(){let i=[],t=(e,n,s,r,o)=>i.push({type:e,i:n,j:s,rot:r,level:o});for(let[e,n]of[[-4,-4],[3,-4],[-4,3],[3,3]])t("b1x1",e,n,0,0);t("b1x2",-3,3,0,0),t("b1x2",1,3,0,0),t("b1x2",3,-3,1,0),t("b1x2",3,1,1,0);for(let e of[-3,-1,1])t("b1x2",e,-4,0,0);for(let e of[-3,-1,1])t("b1x2",-4,e,1,0);t("b1x2",-4,3,0,3),t("b1x4",-2,3,0,3),t("b1x2",2,3,0,3);for(let e of[-4,-2,0,2])t("b1x2",e,-4,0,3);for(let e of[-3,-1,1])t("b1x2",-4,e,1,3);t("b1x1",3,-3,0,3),t("b1x4",3,-2,1,3),t("b1x1",3,2,0,3);for(let e of[-5,-1])t("p2x4",e,3,0,6);for(let e of[-3,1])t("p2x4",3,e,1,6);for(let e of[-3,1])t("p2x4",e,-5,0,6);for(let e of[-5,-1])t("p2x4",-5,e,1,6);for(let[e,n]of[[-5,3],[3,3],[3,-5],[-5,-5],[-1,3],[3,-1],[-1,-5],[-5,-1]])t("b2x2",e,n,0,7);return i}var _n=(i,t)=>t?[Ce[i].nz,Ce[i].nx]:[Ce[i].nx,Ce[i].nz],yl=i=>Ce[i].nx===Ce[i].nz,vl=i=>.15+yn*i,ut,Ks;function Gx(){let i=document.createElement("style");i.textContent=Bx,document.head.appendChild(i);let t=document.createElement("dialog");t.id="tower-game",t.setAttribute("aria-labelledby","tg-title");let e=Kr.map((a,l)=>`<button type="button" class="tg-style" data-type="${a}" aria-pressed="false" aria-label="${Ce[a].label}" aria-keyshortcuts="${md(l)}"><kbd>${md(l)}</kbd><img alt=""><span>${Ce[a].size}</span><small>${Ce[a].word}</small></button>`).join(""),n=Object.entries(kx).map(([a,l])=>`<button type="button" class="tg-look" data-look="${a}" aria-pressed="false"><i></i>${l}</button>`).join(""),s=us.matches?"tap":"click",r=[`<strong>Pick a brick</strong> from the row below${us.matches?"":", or press its number: 1 to 9, then 0 for the tenth"}.`,`<strong>Point and ${s}.</strong> ${us.matches?"Drag first to see a copy of the brick, edged in orange, where it will land; a plain tap places it at once.":"A copy of the brick, edged in orange, shows where it will land."} One stud is enough to hold a brick, but a red edge means the pile would be too wobbly.`,`<span class="tg-turns" aria-hidden="true"><img id="tg-turn-a" alt="">\u21BB<img id="tg-turn-b" alt=""></span><strong>Rotate${us.matches?"":" (or R)"}</strong> turns the brick a quarter turn before you place it. Square bricks stay the same.`,`<strong>View${us.matches?"":" (or T)"}</strong> turns the whole tower, so you can reach the far side.`,"<strong>Grey, Brick and Pride</strong> set the look of your next bricks, so you can mix them. Pride colours follow the height.","<strong>Undo</strong> takes a brick back. <strong>Hints</strong> shows a planned tower, if you would like one."].map(a=>`<li>${a}</li>`).join("");t.innerHTML=`<div class="tg-wrap">
+    <div class="tg-head"><h2 id="tg-title">Build the tower</h2><span class="tg-count" id="tg-count"></span>
+      <button type="button" class="tg-btn tg-close" id="tg-help" aria-label="How to play">?</button>
+      <button type="button" class="tg-btn tg-close" id="tg-close" aria-label="Close the game">\u2715</button></div>
+    <div class="tg-field"><div class="tg-stage" id="tg-stage" tabindex="0" role="application" aria-label="Building area. Number keys choose a brick, arrow keys move it, R rotates it, T turns the view, Enter places it."><canvas id="tg-canvas" aria-hidden="true"></canvas></div>
+      <div class="tg-over tg-plan" id="tg-plan" hidden><button type="button" class="tg-btn" id="tg-next" title="Places the next brick of the planned tower" aria-label="Place the next brick of the plan">Place next</button>
+      <button type="button" class="tg-btn" id="tg-finish" title="Builds the rest of the planned tower. Undo takes it all back" aria-label="Build the rest of the plan for me">Build rest</button></div>
+      <div class="tg-over tg-again"><button type="button" class="tg-btn" id="tg-restart">Start again</button></div>
+      <div class="tg-over tg-looks" id="tg-looks" role="group" aria-label="Look of your next bricks">${n}</div></div>
+    <div class="tg-tray" id="tg-tray" role="group" aria-label="Choose a brick">${e}</div>
+    <div class="tg-foot"><p class="tg-hint" id="tg-hint"></p>
+      <button type="button" class="tg-btn" id="tg-rotate" aria-label="Rotate the brick">Rotate</button>
+      <button type="button" class="tg-btn" id="tg-view" aria-label="Turn the view">View</button>
+      <button type="button" class="tg-btn" id="tg-undo">Undo</button>
+      <button type="button" class="tg-btn" id="tg-hints" aria-pressed="false" aria-label="Show hints">Hints</button>
+      <button type="button" class="tg-btn tg-main" id="tg-done">Done</button></div>
+    <div class="tg-sr" role="status" aria-live="polite" id="tg-live"></div></div>
+    <div class="tg-note" id="tg-note" hidden><div class="tg-card" role="group" aria-labelledby="tg-note-title"><h3 id="tg-note-title">How to play</h3><ul class="tg-steps" id="tg-steps" tabindex="0">${r}</ul><button type="button" class="tg-btn tg-main" id="tg-note-go">Start building</button></div></div>
+    <div class="tg-note" id="tg-warn" hidden><div class="tg-card" role="alertdialog" aria-modal="true" aria-labelledby="tg-warn-title" aria-describedby="tg-warn-text"><h3 id="tg-warn-title">Careful!</h3><p class="tg-warn-text" id="tg-warn-text">Placing it here would bring FORRT down. We only build on solid foundations.</p><div class="tg-warn-row"><button type="button" class="tg-btn" id="tg-warn-anyway">Place it anyway</button><button type="button" class="tg-btn tg-main" id="tg-warn-go">Move it</button></div></div></div>`,document.body.appendChild(t);let o=a=>t.querySelector("#"+a);return{d:t,canvas:o("tg-canvas"),stage:o("tg-stage"),tray:o("tg-tray"),count:o("tg-count"),hint:o("tg-hint"),rotate:o("tg-rotate"),view:o("tg-view"),next:o("tg-next"),plan:o("tg-plan"),restart:o("tg-restart"),undo:o("tg-undo"),hints:o("tg-hints"),finish:o("tg-finish"),done:o("tg-done"),close:o("tg-close"),live:o("tg-live"),styles:[...t.querySelectorAll(".tg-style")],looks:[...t.querySelectorAll(".tg-look")],wrap:t.querySelector(".tg-wrap"),note:o("tg-note"),noteGo:o("tg-note-go"),help:o("tg-help"),warn:o("tg-warn"),warnGo:o("tg-warn-go"),warnAnyway:o("tg-warn-anyway")}}function Hx(){let i=new ul({canvas:ut.canvas,antialias:!0,alpha:!0,stencil:!0});i.setPixelRatio(Math.min(window.devicePixelRatio||1,1.75)),i.outputColorSpace=ln,i.toneMapping=Fr,i.toneMappingExposure=1.05,i.shadowMap.enabled=!0,i.shadowMap.type=xa;let t=new Ns,e=new mi(-3.7,3.7,3,-3,.1,60);t.add(new Vs(16777215,9143161,1.75));let n=new Oi(16776182,3.5);n.position.set(-3,11,6),n.castShadow=!0,n.shadow.mapSize.set(2048,2048),n.shadow.camera.left=-8,n.shadow.camera.right=8,n.shadow.camera.top=8,n.shadow.camera.bottom=-8,n.shadow.camera.near=.5,n.shadow.camera.far=30,n.shadow.normalBias=.035,n.shadow.bias=-4e-4,n.shadow.radius=3,n.shadow.intensity=.6,t.add(n);let s=new Oi(15988735,1.25);s.position.set(6,4,-2),t.add(s);let r=new Oi(16777215,1.2);r.position.set(-3,5,-5),t.add(r);let{model:o,brickGeometry:a,stones:l,foundationTop:c}=dd();t.add(o);let h=new cn;t.add(h);let f=new Ue(new rs(60,60),new Ir({opacity:.18}));f.rotation.x=-Math.PI/2,f.position.y=-.035,f.receiveShadow=!0,t.add(f);let u=new O(0,1,0),d=v=>v.object.children[0],g={},M={},m={};for(let v of Kr){let I=Ce[v],Z=I.nx*yn,$=I.plates*hs,ht=I.nz*yn;g[v]=a(Z,$,ht),M[v]=new ti(Z-.014,$-.014,ht-.014),m[v]=new vr(M[v])}let p=oi-ri+1,T=(v,I)=>(v-ri)*p+(I-ri),P=new Int16Array(p*p).fill(oh);for(let v=-4;v<=3;v++)for(let I=-4;I<=3;I++)P[T(v,I)]=0;let S=P.slice(),A=new Array(p*p).fill(null),b=Array.from({length:p*p},()=>[]),R=.048,_=.007,w=v=>c+v*hs,L=(v,I,Z,$,ht)=>{for(let ct=v;ct<v+Z;ct++)for(let yt=I;yt<I+$;yt++)ht(T(ct,yt))},D=(v,I,Z,$)=>v>=ri&&I>=ri&&v+Z-1<=oi&&I+$-1<=oi;function B(v,I,Z,$){let[ht,ct]=_n(v,$);if(!D(I,Z,ht,ct))return null;let yt=oh,Qt=0;return L(I,Z,ht,ct,re=>{S[re]>yt?(yt=S[re],Qt=1):S[re]===yt&&Qt++}),yt===oh||yt+Ce[v].plates>_l?null:{level:yt,studs:Qt}}let G=(v,I,Z,$,ht)=>{let[ct,yt]=_n(v,$);return{x:vl(I+(ct-1)/2),z:vl(Z+(yt-1)/2),y:w(ht)+Ce[v].plates*hs/2,floor:w(ht),rotY:$?Math.PI/2:0}},N=(v,I,Z,$,ht)=>({type:v,i:I,j:Z,rot:$,level:ht.level,studs:ht.studs,...G(v,I,Z,$,ht.level)});function C(v,I,Z,$,ht){let[ct,yt]=_n(v,$),Qt=new Map,re=0,fe=0,be=0,Te=1/0,qe=-1/0,Ve=1/0,$e=-1/0;for(let Cn=I;Cn<I+ct;Cn++)for(let Fe=Z;Fe<Z+yt;Fe++){let fs=T(Cn,Fe);if(S[fs]!==ht)continue;let $i=A[fs];$i&&Qt.set($i,(Qt.get($i)||0)+1),re++,fe+=Cn+.5,be+=Fe+.5,Te=Math.min(Te,Cn),qe=Math.max(qe,Cn+1),Ve=Math.min(Ve,Fe),$e=Math.max($e,Fe+1)}return{under:Qt,studs:re,x:fe/re,z:be/re,hx:(qe-Te)/2,hz:($e-Ve)/2,mass:ct*yt*Ce[v].plates,cx:I+ct/2,cz:Z+yt/2}}let k=null;function V(v){let I=new Map,Z=0;k=null;let $=ht=>{let ct=I.get(ht),yt=ht.mass+(ct?ct.w:0),Qt=ht.mass*ht.cx+(ct?ct.mx:0),re=ht.mass*ht.cz+(ct?ct.mz:0),fe=Math.hypot(Math.max(0,Math.abs(Qt/yt-ht.x)-ht.hx),Math.max(0,Math.abs(re/yt-ht.z)-ht.hz)),be=yt*fe/ht.studs;be>Z&&(Z=be,k=ht);for(let[Te,qe]of ht.under){let Ve=qe/ht.studs,$e=I.get(Te.hold)||{w:0,mx:0,mz:0};$e.w+=yt*Ve,$e.mx+=Qt*Ve,$e.mz+=re*Ve,I.set(Te.hold,$e)}};v&&$(v);for(let ht=rt.length-1;ht>=0;ht--)$(rt[ht].hold);return Z}let j=v=>V(C(v.type,v.i,v.j,v.rot,v.level))>xl,W=Vx().map(v=>({...v,filled:null}));for(let v of W){let[I,Z]=_n(v.type,v.rot);v.needs=W.filter($=>{if($.level>=v.level)return!1;let[ht,ct]=_n($.type,$.rot);return $.i<v.i+I&&v.i<$.i+ht&&$.j<v.j+Z&&v.j<$.j+ct})}let J=v=>{let I=B(v.type,v.i,v.j,v.rot);return!I||I.level>v.level},et=v=>W.filter(I=>{if(I.filled||v&&I.type!==v||!I.needs.every($=>$.filled||J($)))return!1;let Z=B(I.type,I.i,I.j,I.rot);return Z&&Z.level===I.level&&V(C(I.type,I.i,I.j,I.rot,I.level))<=xl}),vt=[],rt=[],Zt=()=>vt.filter(v=>v.state==="placed").length,Nt=(v,I,Z)=>v==="pride"?gd(Z):v==="brick"?rh[I%rh.length]:l[I%l.length].color;function ne(v,I){v.stone.set(Nt(v.look,v.shade,I)),v.material.color.copy(v.stone)}let tt=()=>vt.length*3+1;function it(v,I=It){let Z=new cn,$=tt(),ht=l[$%l.length].clone(),ct=new Ue(g[v],ht);ct.castShadow=!0,ct.receiveShadow=!0,Z.add(ct),Z.name=Ce[v].label,o.add(Z);let yt={object:Z,type:v,look:I,shade:$,state:"flying",material:ht,stone:new se,pride:new se,slot:null,cell:null,rest:new O};return vt.push(yt),yt}function Mt(v){o.remove(v.object),v.material.dispose(),vt.splice(vt.indexOf(v),1)}let Dt="b1x2",It="grey",Yt=0,he=0,st=!1,ot=!1,ft=()=>yl(Dt)?0:Yt,mt=new cn;mt.visible=!1,h.add(mt);let St=l[0].clone();St.transparent=!0;let Xt=new Ue(g[Dt],St),kt=new Os(m[Dt],new Pi({color:"#ff8a1f",transparent:!0,depthTest:!1,toneMapped:!1})),$t=new Ue(g[Dt],new Qn({colorWrite:!1,transparent:!0,depthWrite:!1,depthTest:!1,stencilWrite:!0,stencilFunc:sl,stencilRef:1,stencilZPass:Lc})),Kt=new Ue(M[Dt],new Qn({color:"#ff8a1f",side:je,transparent:!0,depthWrite:!1,depthTest:!1,toneMapped:!1,stencilWrite:!0,stencilFunc:Dc,stencilRef:1}));$t.renderOrder=4,Kt.renderOrder=5,Xt.renderOrder=6,kt.renderOrder=7,mt.add($t,Kt,Xt,kt);let F=new Qn({color:"#14808f",transparent:!0,opacity:.42,depthWrite:!1,depthTest:!1}),xe=new Qn({color:"#14808f",transparent:!0,opacity:.14,depthWrite:!1,depthTest:!1}),ae=new Pi({color:"#0b5a65",transparent:!0,depthTest:!1}),E=new Pi({color:"#0b5a65",transparent:!0,opacity:.45,depthTest:!1});for(let v of W){let I=G(v.type,v.i,v.j,v.rot,v.level);v.hint=new cn,v.hint.position.set(I.x,I.y,I.z),v.hint.rotation.y=I.rotY,v.hint.visible=!1,v.body=new Ue(M[v.type],xe),v.body.renderOrder=4,v.line=new Os(m[v.type],E),v.line.renderOrder=5,v.hint.add(v.body,v.line),h.add(v.hint)}function x(){let v=st&&!ot?et():[];for(let I of W)I.hint.visible=!1;for(let I of v){let Z=I.type===Dt;I.hint.visible=!0,I.body.material=Z?F:xe,I.line.material=Z?ae:E}for(let I of ut.styles)I.classList.toggle("tg-suggested",v.some(Z=>Z.type===I.dataset.type));return ze=!0,v}let H=new O(7.4,10.6,10.2),K=new O(0,2.5,0),Q={width:1,height:1,scale:1},pt={l:-3,r:3,t:3,b:-3},_t=0,nt=!1;function at(){e.position.copy(H).applyAxisAngle(u,_t),e.lookAt(K),e.updateMatrixWorld(!0)}function wt(){let v=Q.height<480?w(0)-.75:-.035,I=1.56,Z=Q.height<480?9:13;for(let Fe of rt){let[fs,$i]=_n(Fe.type,Fe.cell.rot),dh=G(Fe.type,Fe.cell.i,Fe.cell.j,Fe.cell.rot,Fe.cell.level);I=Math.max(I,Math.ceil((Math.max(Math.abs(dh.x)+fs*.15,Math.abs(dh.z)+$i*.15)+yn)/.6)*.6),Z=Math.max(Z,Math.min(_l,Math.ceil((Fe.cell.level+Ce[Fe.type].plates+9)/6)*6))}let $=new Kn(new O(-I,v,-I),new O(I,w(Z)+.06,I)),ht=e.matrixWorldInverse,ct=new O,yt=1/0,Qt=-1/0,re=1/0,fe=-1/0;for(let Fe of[$.min.x,$.max.x])for(let fs of[$.min.y,$.max.y])for(let $i of[$.min.z,$.max.z])ct.set(Fe,fs,$i).applyMatrix4(ht),yt=Math.min(yt,ct.x),Qt=Math.max(Qt,ct.x),re=Math.min(re,ct.y),fe=Math.max(fe,ct.y);for(let Fe of vt)Fe.state==="debris"&&(ct.copy(Fe.object.position).applyMatrix4(ht),yt=Math.min(yt,ct.x-.8),Qt=Math.max(Qt,ct.x+.8),re=Math.min(re,ct.y-.8),fe=Math.max(fe,ct.y+.8));let be=1.03,Te=Q.width/Q.height,qe=Math.max((fe-re)/2,(Qt-yt)/2/Te)*be,Ve=qe*Te,$e=(yt+Qt)/2,Cn=(fe+re)/2;return{l:$e-Ve,r:$e+Ve,t:Cn+qe,b:Cn-qe}}function Vt(){e.left=pt.l,e.right=pt.r,e.top=pt.t,e.bottom=pt.b,e.updateProjectionMatrix(),Q.scale=Q.height/(pt.t-pt.b),ze=!0}function At(){Object.assign(pt,wt()),Vt()}function bt(){let{width:v,height:I}=ut.stage.getBoundingClientRect();!v||!I||(i.setSize(v,I,!1),Q.width=v,Q.height=I,at(),At())}let Gt=v=>{let I=v.clone().project(e);return{x:(I.x+1)/2*Q.width,y:(1-I.y)/2*Q.height}},Wt=v=>{let I=ut.canvas.getBoundingClientRect();return{x:v.clientX-I.left,y:v.clientY-I.top}},ee=new Nr,z=new xt;function Et(v){return ee.setFromCamera(z.set(v.x/Q.width*2-1,1-v.y/Q.height*2),e),ee.ray}function lt(v,I,Z,$,ht){let ct=T(v,I),Qt=Math.hypot(Z-vl(v),ht-vl(I))<=.087?R:-_;if(P[ct]===0&&$<=w(0)+Qt)return!0;for(let[re,fe]of b[ct])if($>=w(re)&&$<=w(fe)+Qt)return!0;return!1}function Tt(v){let{origin:I,direction:Z}=Et(v),$=(w(_l)+.06-I.y)/Z.y,ht=(w(0)-.12-I.y)/Z.y;for(let ct=$;ct<=ht;ct+=.015){let yt=I.x+Z.x*ct,Qt=I.z+Z.z*ct,re=Math.floor(yt/yn),fe=Math.floor(Qt/yn);if(D(re,fe,1,1)&&lt(re,fe,yt,I.y+Z.y*ct,Qt))return{i:re,j:fe}}return null}let Pt=34,dt=60,Ht=10,zt=us.matches?10:6,we=60,ue=v=>Re&&Math.hypot(v.x-Re.x,v.y-Re.y)<=zt;function Be(v){if(ue(v)){let I=ft(),[Z,$]=_n(Dt,I);if(D(Re.i,Re.j,Z,$)){let ht=B(Dt,Re.i,Re.j,I);return ht?N(Dt,Re.i,Re.j,I,ht):null}}return vn(v)}function vn(v){let I=Dt,Z=ft(),[$,ht]=_n(I,Z),ct=(be,Te,qe)=>{let Ve=G(I,be,Te,Z,qe.level);return Gt(new O(Ve.x,Ve.floor,Ve.z))},yt=null,Qt=1/0,re=(be,Te)=>{let qe=B(I,be,Te,Z);if(!qe)return;let Ve=ct(be,Te,qe),$e=Math.hypot(Ve.x-v.x,Ve.y-v.y);$e<Qt&&(Qt=$e,yt={i:be,j:Te,r:qe})},fe=Tt(v);if(fe)for(let be=fe.i-$+1;be<=fe.i;be++)for(let Te=fe.j-ht+1;Te<=fe.j;Te++)re(be,Te);if(yt)return N(I,yt.i,yt.j,Z,yt.r);for(let be=ri;be<=oi;be++)for(let Te=ri;Te<=oi;Te++)re(be,Te);return yt&&Qt<=Pt?N(I,yt.i,yt.j,Z,yt.r):null}let ze=!0,Wn=!1,vi=0,Mi=0,de=null,on=null,Xi=null,le=null,hn=null,Qe=null,ds=0,Re=null,js=-1e3,tn=new Set,Si=new Set,Ae=!1,qi=!1,un=null,Qs=0,jr=null,bi=null,y=0,U={refused:0,toppled:0,misses:0,drops:0,undos:0,lost:0,frames:0,rotates:0,turns:0,keyboard:0},Y=v=>{ut.live.textContent=v},X="Too wobbly here: a brick in this spot would bring the tower down.",q=()=>{let v=st?et():[];return st&&v.length?"Teal boxes show the plan's next places. Dark ones fit your brick; dotted bricks fit the rest.":st?W.every(I=>I.filled)?"The planned tower is complete. Keep building if you like.":"Your build has covered the rest of the plan, or left it too wobbly. Keep building, or undo to bring it back.":us.matches?"Pick a brick, then tap the tower. Drag to aim, and turn bricks with Rotate.":"Press 1 to 9 or 0 for a brick, then click the tower. R rotates the brick and T turns the view."};function gt(){let v=Zt();ut.count.textContent=v===1?"1 brick":`${v} bricks`,ut.done.textContent=ot?"Build on":"Done",ut.done.setAttribute("aria-label",ot?"Build on":"Done building"),ut.done.disabled=Ae||!rt.length&&!ot,ut.undo.disabled=qi||!rt.length&&!Qe,ut.restart.disabled=!rt.length,ut.plan.hidden=!st;let I=x();ut.next.disabled=ut.finish.disabled=Ae||!I.length,!ot&&!de&&!Ae&&(ut.hint.textContent=q()),ze=!0}function Lt(v){Dt=v;for(let I of ut.styles)I.setAttribute("aria-pressed",String(I.dataset.type===v));Xt.geometry=$t.geometry=g[v],kt.geometry=m[v],Kt.geometry=M[v],Ft(),ut.rotate.disabled=yl(v),gt(),te()}function Ct(v){It=v;for(let I of ut.looks)I.setAttribute("aria-pressed",String(I.dataset.look===v));for(let I of ut.styles)I.querySelector("img").src=Qr[v][I.dataset.type];te()}function Ft(){for(let v of ut.styles)v.classList.toggle("tg-flip",!yl(v.dataset.type)&&(Yt+he)%2===1)}function Bt(){yl(Dt)||(Yt=1-Yt,U.rotates++,Ft(),te(),!ot&&!de&&(ut.hint.textContent="Brick rotated. The pictures below show which way it now runs."),Y(Yt?"Brick rotated.":"Brick rotated back."))}function qt(v){Xi=v,mt.visible=!!v;let I=!!v&&j(v);if(v){mt.position.set(v.x,v.y,v.z),mt.rotation.y=v.rotY,St.color.set(I?"#e01414":Nt(It,tt(),v.level)),St.opacity=I?.6:1;let Z=I?"#e01414":"#ff8a1f",$=Ce[v.type],ht=2.5/Q.scale*2,ct=yt=>yt-.014;kt.material.color.set(Z),Kt.material.color.set(Z),Kt.scale.set((ct($.nx*yn)+ht)/ct($.nx*yn),(ct($.plates*hs)+ht)/ct($.plates*hs),(ct($.nz*yn)+ht)/ct($.nz*yn))}ut.canvas.style.cursor=I?"not-allowed":"",I?ut.hint.textContent=X:ut.hint.textContent===X&&(ut.hint.textContent=q()),ze=!0}function te(){ot||Ae?qt(null):de&&de.point?qt(Be(de.point)):le?er():hn&&qt(Be(hn))}function Ot(v,I){let[Z,$]=_n(v.type,I.rot);v.cell={i:I.i,j:I.j,rot:I.rot,level:I.level},v.hold=C(v.type,I.i,I.j,I.rot,I.level),v.rest.set(I.x,I.y,I.z),v.object.quaternion.setFromAxisAngle(u,I.rotY),ne(v,I.level);let ht=W.find(ct=>!ct.filled&&ct.type===v.type&&ct.i===I.i&&ct.j===I.j&&ct.rot===I.rot&&ct.level===I.level)||null;v.slot=ht,ht&&(ht.filled=v),L(I.i,I.j,Z,$,ct=>{S[ct]=I.level+Ce[v.type].plates,A[ct]=v,b[ct].push([I.level,S[ct]])}),rt.push(v)}function me(v){v.state="placed",v.object.position.copy(v.rest),Y(`${Ce[v.type].label} placed. ${Zt()} in all.`),gt(),v.finishing&&!tn.size&&Ml(),v.topples&&(v.topples=!1,ve())}function De(v,I=0){let Z=yi.matches?0:.24,$=v.rest.y+.7;if(v.object.position.set(v.rest.x,$,v.rest.z),I>0&&!yi.matches&&(v.object.visible=!1),!Z){me(v);return}tn.add({part:v,t:-I,d:Z,high:$}),ze=!0}function ye(v,I=!1){if(Ae)return null;if(vt.length>=xd)return ut.hint.textContent=`That is ${xd} bricks, the most this version allows.`,null;if(!I&&j(v))return Ut(v),null;ot&&tr(),Qe=null,Nn();let Z=it(v.type);return Z.batch=++ds,Ot(Z,v),De(Z),gt(),Z}let _e=null,He=null;function Ut(v){U.refused++,He=v,pd().catch(()=>{}),_e=le&&document.activeElement===ut.stage?{...le}:null,hn=null,qt(null),ut.warn.hidden=!1,ut.wrap.inert=!0,ut.warnGo.focus({preventScroll:!0})}function ke(){ut.warn.hidden=!0,ut.wrap.inert=!1,_e?(ut.stage.focus({preventScroll:!0}),ut.stage.classList.add("tg-keys"),le=_e,_e=null,er()):ut.styles.find(v=>v.getAttribute("aria-pressed")==="true").focus({preventScroll:!0})}async function ge(){let v=He;ke(),Ae=qi=!0,gt();try{jr=await pd()}catch{Ae=qi=!1,gt(),ut.hint.textContent="The physics file did not load, so nothing was placed.";return}if(qi=!1,!Ae){gt();return}let I=an();Ae=!1;let Z=ye(v,!0);Ae=!0,Qe=I,Qe.wipe=!0,Z.topples=!0,ut.hint.textContent="Here goes\u2026",gt(),Z.state==="placed"&&Z.topples&&(Z.topples=!1,ve())}let an=()=>rt.map(v=>({type:v.type,cell:v.cell,batch:v.batch,look:v.look,shade:v.shade}));function An(){let v=[],I=[],Z=[];for(let $=0;$<60&&V()>xl;$++){let ht=rt.find(yt=>yt.hold===k),ct=new Set([ht]);Z.push({part:ht,x:yn*ht.hold.x,z:yn*ht.hold.z});for(let yt of rt)yt!==ht&&[...yt.hold.under.keys()].some(Qt=>ct.has(Qt))&&ct.add(yt);for(let yt of ct)if(yt!==ht)for(let[Qt,re]of yt.hold.under)ct.has(Qt)&&I.push({a:yt,b:Qt,studs:re});for(let yt=rt.length-1;yt>=0;yt--)ct.has(rt[yt])&&rt.splice(yt,1);for(let yt of ct)yt.slot&&(yt.slot.filled=null),yt.slot=null,yt.state="debris",v.push(yt);Yi()}return{fallen:v,grips:I,leans:Z}}let Dn=v=>{let[I,Z]=_n(v.type,v.cell.rot),$=G(v.type,v.cell.i,v.cell.j,v.cell.rot,v.cell.level);return{x:$.x,y:$.y,z:$.z,hx:I*yn/2-.002,hy:Ce[v.type].plates*hs/2-.002,hz:Z*yn/2-.002,rotY:$.rotY}};function wi(){let v=c,I=-.035,Z=1.2,$=.3,ht=(be,Te)=>(be+Te)/2,ct=(be,Te,qe,Ve,$e,Cn)=>({x:ht(be,Te),y:ht(qe,Ve),z:ht($e,Cn),hx:(Te-be)/2,hy:(Ve-qe)/2,hz:(Cn-$e)/2}),yt=.45,Qt=.96+.45-.187,re=.36,fe=.81+.36-.187;return[ct(-Z,Z,I,v,-Z,-Z+$),ct(-Z,-Z+$,I,v,-Z+$,Z-$),ct(-Z,-yt,I,v,Z-$,Z),ct(yt,Z,I,v,Z-$,Z),ct(-yt,yt,Qt,v,Z-$,Z),ct(Z-$,Z,I,v,-Z+$,-re),ct(Z-$,Z,I,v,re,Z-$),ct(Z-$,Z,fe,v,-re,re),ct(-Z+$,Z-$,v-hs,v,-Z+$,Z-$)]}function ve(){Re=null;let{fallen:v,grips:I,leans:Z}=An(),$=new Map(v.map((ct,yt)=>[ct,yt])),ht=v.map(ct=>({object:ct.object,...Dn(ct)}));un=fd(jr,{pieces:ht,shell:wi(),standing:rt.map(Dn),groundY:-.035,grips:I.map(ct=>({a:$.get(ct.a),b:$.get(ct.b),studs:ct.studs})),leans:Z.map(ct=>({piece:$.get(ct.part),x:ct.x,z:ct.z}))}),U.toppled++,bi={fell:v.length,stayed:rt.length,clumpsAtStart:un.clumps},Qs=yi.matches?0:.14,yi.matches&&(un.finish(),Pe()),ze=!0}function Pe(){let v=bi.fell;bi.seconds=+un.time.toFixed(2),bi.clumpsAtEnd=un.clumps,un=null,Ae=!1,Zi(),gt(),te();let I=`Down it came: ${v===1?"1 brick":`${v} bricks`} fell. Undo puts ${v===1?"it":"them"} back, and your next brick clears the rubble.`;ut.hint.textContent=I,Y(I)}function Nn(){for(let v of vt)v.state==="debris"&&(v.state="gone",Si.add({part:v,t:yi.matches?1:0}));ze=!0}function Se(v){return N(v.type,v.i,v.j,v.rot,B(v.type,v.i,v.j,v.rot))}function Xn(){if(Ae)return;ot&&tr();let v=et().sort((I,Z)=>I.level-Z.level)[0];v&&(ye(Se(v)),U.drops++),gt()}function Ti(){if(Ae)return;ot&&tr(),Nn();let v=0,I=null;Qe=null,ds++;for(let Z=et().sort(($,ht)=>$.level-ht.level)[0];Z;Z=et().sort(($,ht)=>$.level-ht.level)[0])I=it(Z.type),I.batch=ds,Ot(I,Se(Z)),De(I,v),v+=.07;I&&(I.finishing=!0,tn.size||Ml()),gt()}function Yi(){S.set(P),A.fill(null);for(let v of b)v.length=0;for(let v of rt){let[I,Z]=_n(v.type,v.cell.rot);v.hold=C(v.type,v.cell.i,v.cell.j,v.cell.rot,v.cell.level),L(v.cell.i,v.cell.j,I,Z,$=>{S[$]=v.cell.level+Ce[v.type].plates,A[$]=v,b[$].push([v.cell.level,S[$]])})}}function Zi(){Mn={from:{...pt},to:wt(),t:0},ze=!0}let Mn=null;function tr(){Re=null,ot=!1,on=null,o.rotation.y=0,bd()}function lh(){if(de||qi)return;if(Re=null,Qe?.wipe&&Md(),Qe){Sd();return}if(!rt.length)return;ot&&tr();let v=rt[rt.length-1].batch;for(;rt.length&&rt[rt.length-1].batch===v;){let I=rt.pop();for(let Z of tn)Z.part===I&&tn.delete(Z);I.slot&&(I.slot.filled=null),Mt(I)}U.undos++,Yi(),Zi(),Y(`Undone. ${Zt()} left.`),gt(),te()}function Md(){un=null,Ae=!1,on=null,ot=!1,o.rotation.y=0,tn.clear(),Si.clear(),rt.length=0;for(let v of W)v.filled=null;for(let v of[...vt])Mt(v);Yi()}function Sd(){for(let{type:v,cell:I,batch:Z,look:$,shade:ht}of Qe){let ct=it(v,$);ct.shade=ht??ct.shade,ct.batch=Z,Ot(ct,N(v,I.i,I.j,I.rot,{level:I.level,studs:0})),me(ct)}Qe=null,U.undos++,Zi(),Y(`Build restored. ${Zt()} bricks.`),gt()}function ch(){Re=null;let v=Qe?.wipe?Qe:rt.length?an():null;un=null,Ae=!1,Si.clear(),Qe=v,on=null,ot=!1,tn.clear(),o.rotation.y=0,rt.length=0,Yt=0,Ft();for(let I of W)I.filled=null;for(let I of[...vt])Mt(I);Yi(),Zi(),Y("All bricks cleared. Undo brings them back."),gt(),Qe&&(ut.hint.textContent="All bricks cleared. Undo brings them back."),ut.styles.find(I=>I.dataset.type===Dt).focus()}function bd(){for(let v of vt)v.material.color.copy(v.stone);ze=!0}function Ml(){ot=!0,qt(null);let v=W.every($=>$.filled)&&rt.every($=>$.slot),I=rt.length;ut.hint.textContent=v?"Tower built to the plan.":`Your tower is finished: ${I} ${I===1?"brick":"bricks"}. Build on, or start again.`,Y(ut.hint.textContent);let Z=rt.map($=>$.cell.level);for(let $ of rt)$.look==="grey"?$.pride.set(gd($.cell.level)):$.pride.copy($.stone);if(gt(),yi.matches){for(let $ of vt)$.material.color.copy($.pride);ze=!0;return}on={t:0,top:Math.max(1,...Z)}}function wd(v){let I=Wt(v);if(v.pointerType==="touch"&&de){let Z=Math.hypot(I.x-de.down.x,I.y-de.down.y);Z>=Ht&&(de.lift=Math.max(de.lift,Math.min(dt,Z*1.5))),I.y-=de.lift}return I}let Td=v=>v.x>=0&&v.y>=0&&v.x<=Q.width&&v.y<=Q.height;function Ed(v){if(de||!Wn||ot||Ae||v.pointerType==="mouse"&&v.button!==0)return;let I=Wt(v);v.preventDefault(),ue(I)||(Re=null),ut.stage.classList.remove("tg-keys"),le=null,ut.canvas.setPointerCapture(v.pointerId),de={id:v.pointerId,down:I,lift:0,point:I},qt(Be(I))}function Ad(v){let I=v.target.closest(".tg-style");!I||de||!Wn||(Lt(I.dataset.type),I.releasePointerCapture?.(v.pointerId),de={id:v.pointerId,down:Wt(v),lift:v.pointerType==="touch"?dt:0,fromTray:!0,point:null},le=null)}function Cd(v){if(de&&v.pointerId===de.id){let I=wd(v);de.point=Td(I)?I:null,de.point&&!ue(de.point)&&(Re=null),qt(de.point&&!Ae?Be(de.point):null)}else!de&&v.pointerType==="mouse"&&Wn&&v.target===ut.canvas&&(hn=Wt(v),le=null,ue(hn)||(Re=null),qt(ot||Ae?null:Be(hn)))}function Sl(v){if(!de||v.pointerId!==de.id)return;let{fromTray:I,point:Z}=de,$=v.type!=="pointerup",ht=!$&&Z&&de.point;if(de=null,ht&&!ot&&!Ae){let ct=Be(Z),yt=performance.now(),Qt=Re&&yt-Re.t<we&&ue(Z);ct&&!Qt&&ye(ct)?(U.drops++,Re={t:yt,x:Z.x,y:Z.y,i:ct.i,j:ct.j}):!ct&&!I&&!Qt&&(U.misses++,ut.hint.textContent=Tt(Z)?"That stack has reached the height limit.":"No studs there. Point at the top of the tower.")}v.pointerType==="mouse"&&hn&&!$&&!ot&&!Ae?qt(Be(Wt(v))):qt(null),hn=v.pointerType==="mouse"?hn:null}let bl=!1;function er(){let[v,I]=_n(Dt,ft());le.i=Math.min(le.i,oi-v+1),le.j=Math.min(le.j,oi-I+1);let Z=B(Dt,le.i,le.j,ft());return qt(Z&&!Ae?N(Dt,le.i,le.j,ft(),Z):null),Z}function Rd(v){let I=v.key.toLowerCase();if(v.ctrlKey||v.metaKey||v.altKey||!ut.note.hidden||!ut.warn.hidden)return;let Z=/^(?:Digit|Numpad)(\d)$/.exec(v.code)?.[1]??(/^\d$/.test(I)?I:null);if(Z!==null){let ht=Kr[(+Z+9)%10];Lt(ht),Y(`${Ce[ht].label} chosen.`);return}if(I==="r"){Bt();return}if(I==="t"){wl();return}if(I==="tab"&&(bl=!0),v.target!==ut.stage)return;let $={arrowleft:[-1,0],arrowright:[1,0],arrowup:[0,-1],arrowdown:[0,1]}[I];if($){if(v.preventDefault(),!le)le={i:0,j:0};else{let[ct,yt]=$;for(let fe=0;fe<he;fe++)[ct,yt]=[yt,-ct];let[Qt,re]=_n(Dt,ft());le.i=Math.max(ri,Math.min(oi-Qt+1,le.i+ct)),le.j=Math.max(ri,Math.min(oi-re+1,le.j+yt))}let ht=er();Y(ht?`Column ${le.i+5}, row ${le.j+5}, height ${ht.level}, held by ${ht.studs} ${ht.studs===1?"stud":"studs"}${Xi&&j(Xi)?", too wobbly":""}.`:`Column ${le.i+5}, row ${le.j+5}: nothing to build on.`)}else if((I==="enter"||I===" ")&&le&&!ot&&!Ae){v.preventDefault();let ht=er();ht?ye(N(Dt,le.i,le.j,ft(),ht))&&(U.keyboard++,U.drops++,er()):Y("Nothing to build on here.")}}function wl(){nt||(Re=null,he=(he+1)%4,U.turns++,nt={from:_t,to:_t+Math.PI/2,t:0},Ft(),qt(null),Y(`View turned, side ${he+1} of 4.`),yi.matches&&(nt.t=1,hh()),ze=!0)}function hh(){_t=nt.to%(Math.PI*2),nt=!1,at(),At(),te()}ut.canvas.addEventListener("pointerdown",Ed),ut.tray.addEventListener("pointerdown",Ad),ut.d.addEventListener("pointermove",Cd),ut.d.addEventListener("pointerup",Sl),ut.d.addEventListener("pointercancel",Sl),ut.d.addEventListener("keydown",Rd),ut.canvas.addEventListener("pointerleave",()=>{de||(hn=null,qt(null))}),ut.stage.addEventListener("focus",()=>{ut.stage.classList.toggle("tg-keys",bl),bl=!1}),ut.stage.addEventListener("blur",()=>{le&&(le=null,qt(null))}),ut.tray.addEventListener("click",v=>{let I=v.target.closest(".tg-style");I&&(Lt(I.dataset.type),Y(`${Ce[I.dataset.type].label} chosen.`))}),ut.d.querySelector("#tg-looks").addEventListener("click",v=>{let I=v.target.closest(".tg-look");if(!I)return;Ct(I.dataset.look);let Z={grey:"New bricks will be grey. Done gives grey bricks their pride stripes.",brick:"New bricks will be red brick. Bricks already placed keep their look.",pride:"New bricks take a pride colour from their height, so stripes rise as you build."}[I.dataset.look];!ot&&!de&&(ut.hint.textContent=Z),Y(Z)}),ut.warnGo.addEventListener("click",ke),ut.warnAnyway.addEventListener("click",ge),ut.warn.addEventListener("keydown",v=>{v.repeat&&v.preventDefault()}),ut.rotate.addEventListener("click",Bt),ut.view.addEventListener("click",wl),ut.undo.addEventListener("click",lh),ut.next.addEventListener("click",Xn),ut.finish.addEventListener("click",Ti),ut.restart.addEventListener("click",ch),ut.done.addEventListener("click",()=>{performance.now()-js<400||(js=performance.now(),ot?(tr(),gt(),te()):rt.length&&Ml())}),ut.hints.addEventListener("click",()=>{st=!st,ut.hints.setAttribute("aria-pressed",String(st)),gt(),te(),Y(st?`Hints on. ${et().length} places outlined.`:"Hints off.")});let Tl=!1;ut.canvas.addEventListener("webglcontextlost",v=>{v.preventDefault(),Tl=!0,ut.hint.textContent="The browser reset its graphics. Waiting for it to come back.",U.lost++}),ut.canvas.addEventListener("webglcontextrestored",()=>{Tl=!1,bt(),gt()});function uh(v){if(vi=0,!Wn)return;let I=Math.min(.05,Mi?(v-Mi)/1e3:0);Mi=v;let Z=[];for(let $ of[...tn]){if($.t+=I,$.t<0)continue;$.part.object.visible=!0;let ht=Jr($.t/$.d),ct=ht*ht;$.part.object.position.y=$.high+($.part.rest.y-$.high)*ct,ze=!0,ht===1&&(tn.delete($),Z.push($.part))}for(let $ of Z)me($),Mn||Zi();if(un){if(Qs-=I,Qs<=0&&un.advance(I),ze=!0,y-=I,y<=0&&!Mn){y=.25;let $=wt();$.t-$.b>pt.t-pt.b+.01&&Zi()}un.settled&&Pe()}for(let $ of[...Si]){$.t+=I/.25;let ht=1-Jr($.t);$.part.object.scale.setScalar(Math.max(.001,ht)),ze=!0,$.t>=1&&(Si.delete($),Mt($.part),Mn||Zi())}if(Mn){Mn.t+=I/.28;let $=yi.matches?1:gl(Mn.t);for(let ht of"lrtb")pt[ht]=Mn.from[ht]+(Mn.to[ht]-Mn.from[ht])*$;Vt(),(Mn.t>=1||yi.matches)&&(Mn=null,te())}if(nt&&(nt.t+=I/.42,_t=nt.from+(nt.to-nt.from)*gl(nt.t),at(),At(),nt.t>=1&&hh()),on){on.t+=I;let $=Jr(on.t/3);for(let ht of rt)ht.material.color.lerpColors(ht.stone,ht.pride,gl(($-Jr(ht.cell.level/on.top)*.6)/.4));o.rotation.y=on.t>3?gl((on.t-3)/3)*Math.PI*2:0,on.t>6&&(on=null,o.rotation.y=0),ze=!0}ze&&!Tl&&(i.render(t,e),U.frames++,ze=!1),vi=requestAnimationFrame(uh)}let Id=()=>{Wn||(Wn=!0,Mi=0,ze=!0,vi=requestAnimationFrame(uh))},Pd=()=>{Wn=!1,cancelAnimationFrame(vi),vi=0,de&&Sl({pointerId:de.id,type:"pointercancel"}),ut.warn.hidden||(_e=null,ke()),qt(null)},Qr={grey:{},brick:{},pride:{}};function Ld(){let v=new Ns;v.add(new Vs(16777215,9143161,2.1));let I=new Oi(16776182,3.2);I.position.set(-3,11,6),v.add(I);let Z=new mi(-.82,.82,.5,-.5,.1,20);Z.position.set(3.7,4.4,5.1),Z.lookAt(0,0,0);let $=new Ue(g.b1x1,l[4]);v.add($),i.setSize(164,100,!1);let ht=l[4].clone();ht.color.set(rh[0]);let ct=l[4].clone();ct.color.set("#d5dadc");let yt=document.createElement("canvas");yt.width=164,yt.height=100;let Qt=yt.getContext("2d"),re=Qt.createLinearGradient(30,0,134,0);ah.forEach((fe,be)=>{re.addColorStop(be/6,fe),re.addColorStop((be+1)/6,fe)});for(let fe of Kr)$.geometry=g[fe],$.material=l[4],i.render(v,Z),Qr.grey[fe]=ut.canvas.toDataURL(),$.material=ht,i.render(v,Z),Qr.brick[fe]=ut.canvas.toDataURL(),$.material=ct,i.render(v,Z),Qt.globalCompositeOperation="source-over",Qt.clearRect(0,0,164,100),Qt.drawImage(ut.canvas,0,0),Qt.globalCompositeOperation="multiply",Qt.fillStyle=re,Qt.fillRect(0,0,164,100),Qt.globalCompositeOperation="destination-in",Qt.drawImage(ut.canvas,0,0),Qr.pride[fe]=yt.toDataURL();$.geometry=g.b1x4,$.material=l[4],i.render(v,Z),ut.d.querySelector("#tg-turn-a").src=ut.canvas.toDataURL(),$.rotation.y=Math.PI/2,i.render(v,Z),ut.d.querySelector("#tg-turn-b").src=ut.canvas.toDataURL()}return Ld(),at(),bt(),new ResizeObserver(()=>{bt(),Wn&&i.render(t,e)}).observe(ut.stage),Ct(It),Lt(Dt),{hideWarning:ke,strainWith:V,holdOf:C,tooWobbly:j,STRAIN_LIMIT:xl,ghostSkin:St,ghostLine:kt,ghostBody:Xt,colourOf:Nt,start:Id,stop:Pd,resize:bt,renderer:i,stats:U,bricks:vt,slots:W,camera:e,scene:t,model:o,ghost:mt,overlay:h,project:Gt,placedCount:Zt,frame:Q,openSlots:et,landing:B,targetAt:Be,freeTargetAt:vn,surfaceCell:Tt,history:rt,flights:tn,commit:Ot,land:me,spawn:it,restart:ch,undo:lh,select:Lt,rotateBrick:Bt,turnView:wl,placeBrick:ye,makeTarget:N,castRay:Et,raycaster:ee,get drag(){return de},get aim(){return Xi},get cursor(){return le},get busy(){return!!(tn.size||Mn||nt||Ae)},get toppling(){return Ae},get collapse(){return un},get lastCollapse(){return bi},get worstHold(){return k},get selected(){return Dt},get look(){return It},get view(){return he},get hintsOn(){return st},get done(){return ot},get rot(){return ft()},MIN_CELL:ri,MAX_CELL:oi,MAX_PLATES:_l,mesh:d,foundationTop:c,TYPES:Ce,TYPE_KEYS:Kr,footprint:_n,heightOf:w}}var _d=!1;function yd(){ut.note.hidden=!1,ut.wrap.inert=!0,ut.noteGo.focus({preventScroll:!0})}function vd(){ut.note.hidden=!0,ut.wrap.inert=!1,ut.styles.find(i=>i.getAttribute("aria-pressed")==="true").focus({preventScroll:!0})}function Wx(){if(ut||(ut=Gx(),ut.close.addEventListener("click",()=>ut.d.close()),ut.help.addEventListener("click",yd),ut.noteGo.addEventListener("click",vd),ut.d.addEventListener("cancel",t=>{ut.note.hidden?ut.warn.hidden||(t.preventDefault(),Ks.hideWarning()):(t.preventDefault(),vd())}),ut.d.addEventListener("close",()=>{Ks?.stop(),document.documentElement.classList.remove("tg-lock"),window.forrtHeroSuspend?.(!1)})),ut.d.open)return;window.forrtHeroSuspend?.(!0),document.documentElement.classList.add("tg-lock"),ut.d.showModal();let i=performance.now();try{Ks||(Ks=Hx()),window.towerGame.setupMs=window.towerGame.setupMs||performance.now()-i,Ks.resize(),Ks.start(),!_d||!ut.note.hidden?(_d=!0,yd()):ut.styles.find(t=>t.getAttribute("aria-pressed")==="true").focus({preventScroll:!0})}catch(t){ut.hint.textContent="This browser could not start the game.",console.warn("Tower game could not start:",t.message)}}window.towerGame={open:Wx,close:()=>ut?.d.close()};})();
+/*! Bundled license information:
+
+three/build/three.core.js:
+three/build/three.module.js:
+  (**
+   * @license
+   * Copyright 2010-2026 Three.js Authors
+   * SPDX-License-Identifier: MIT
+   *)
+*/
diff --git a/static/js/tower/physics.bundle.js b/static/js/tower/physics.bundle.js
new file mode 100644
index 00000000000..a3af6026cc4
--- /dev/null
+++ b/static/js/tower/physics.bundle.js
@@ -0,0 +1 @@
+var CANNON=(()=>{var Wt=Object.defineProperty;var Se=Object.getOwnPropertyDescriptor;var Fe=Object.getOwnPropertyNames;var Ne=Object.prototype.hasOwnProperty;var Ie=(w,t)=>{for(var e in t)Wt(w,e,{get:t[e],enumerable:!0})},_e=(w,t,e,s)=>{if(t&&typeof t=="object"||typeof t=="function")for(let n of Fe(t))!Ne.call(w,n)&&n!==e&&Wt(w,n,{get:()=>t[n],enumerable:!(s=Se(t,n))||s.enumerable});return w};var Me=w=>_e(Wt({},"__esModule",{value:!0}),w);var Jn={};Ie(Jn,{Body:()=>q,Box:()=>vt,Plane:()=>Tt,Quaternion:()=>H,SAPBroadphase:()=>St,Vec3:()=>c,World:()=>Pt});var ot=class w{constructor(t){t===void 0&&(t=[0,0,0,0,0,0,0,0,0]),this.elements=t}identity(){let t=this.elements;t[0]=1,t[1]=0,t[2]=0,t[3]=0,t[4]=1,t[5]=0,t[6]=0,t[7]=0,t[8]=1}setZero(){let t=this.elements;t[0]=0,t[1]=0,t[2]=0,t[3]=0,t[4]=0,t[5]=0,t[6]=0,t[7]=0,t[8]=0}setTrace(t){let e=this.elements;e[0]=t.x,e[4]=t.y,e[8]=t.z}getTrace(t){t===void 0&&(t=new c);let e=this.elements;return t.x=e[0],t.y=e[4],t.z=e[8],t}vmult(t,e){e===void 0&&(e=new c);let s=this.elements,n=t.x,i=t.y,o=t.z;return e.x=s[0]*n+s[1]*i+s[2]*o,e.y=s[3]*n+s[4]*i+s[5]*o,e.z=s[6]*n+s[7]*i+s[8]*o,e}smult(t){for(let e=0;e<this.elements.length;e++)this.elements[e]*=t}mmult(t,e){e===void 0&&(e=new w);let s=this.elements,n=t.elements,i=e.elements,o=s[0],r=s[1],a=s[2],l=s[3],d=s[4],u=s[5],h=s[6],f=s[7],p=s[8],y=n[0],v=n[1],x=n[2],m=n[3],g=n[4],b=n[5],B=n[6],z=n[7],F=n[8];return i[0]=o*y+r*m+a*B,i[1]=o*v+r*g+a*z,i[2]=o*x+r*b+a*F,i[3]=l*y+d*m+u*B,i[4]=l*v+d*g+u*z,i[5]=l*x+d*b+u*F,i[6]=h*y+f*m+p*B,i[7]=h*v+f*g+p*z,i[8]=h*x+f*b+p*F,e}scale(t,e){e===void 0&&(e=new w);let s=this.elements,n=e.elements;for(let i=0;i!==3;i++)n[3*i+0]=t.x*s[3*i+0],n[3*i+1]=t.y*s[3*i+1],n[3*i+2]=t.z*s[3*i+2];return e}solve(t,e){e===void 0&&(e=new c);let s=3,n=4,i=[],o,r;for(o=0;o<s*n;o++)i.push(0);for(o=0;o<3;o++)for(r=0;r<3;r++)i[o+n*r]=this.elements[o+3*r];i[3]=t.x,i[7]=t.y,i[11]=t.z;let a=3,l=a,d,u=4,h;do{if(o=l-a,i[o+n*o]===0){for(r=o+1;r<l;r++)if(i[o+n*r]!==0){d=u;do h=u-d,i[h+n*o]+=i[h+n*r];while(--d);break}}if(i[o+n*o]!==0)for(r=o+1;r<l;r++){let f=i[o+n*r]/i[o+n*o];d=u;do h=u-d,i[h+n*r]=h<=o?0:i[h+n*r]-i[h+n*o]*f;while(--d)}}while(--a);if(e.z=i[2*n+3]/i[2*n+2],e.y=(i[1*n+3]-i[1*n+2]*e.z)/i[1*n+1],e.x=(i[0*n+3]-i[0*n+2]*e.z-i[0*n+1]*e.y)/i[0*n+0],isNaN(e.x)||isNaN(e.y)||isNaN(e.z)||e.x===1/0||e.y===1/0||e.z===1/0)throw`Could not solve equation! Got x=[${e.toString()}], b=[${t.toString()}], A=[${this.toString()}]`;return e}e(t,e,s){if(s===void 0)return this.elements[e+3*t];this.elements[e+3*t]=s}copy(t){for(let e=0;e<t.elements.length;e++)this.elements[e]=t.elements[e];return this}toString(){let t="";for(let s=0;s<9;s++)t+=this.elements[s]+",";return t}reverse(t){t===void 0&&(t=new w);let e=3,s=6,n=Te,i,o;for(i=0;i<3;i++)for(o=0;o<3;o++)n[i+s*o]=this.elements[i+3*o];n[3]=1,n[9]=0,n[15]=0,n[4]=0,n[10]=1,n[16]=0,n[5]=0,n[11]=0,n[17]=1;let r=3,a=r,l,d=s,u;do{if(i=a-r,n[i+s*i]===0){for(o=i+1;o<a;o++)if(n[i+s*o]!==0){l=d;do u=d-l,n[u+s*i]+=n[u+s*o];while(--l);break}}if(n[i+s*i]!==0)for(o=i+1;o<a;o++){let h=n[i+s*o]/n[i+s*i];l=d;do u=d-l,n[u+s*o]=u<=i?0:n[u+s*o]-n[u+s*i]*h;while(--l)}}while(--r);i=2;do{o=i-1;do{let h=n[i+s*o]/n[i+s*i];l=s;do u=s-l,n[u+s*o]=n[u+s*o]-n[u+s*i]*h;while(--l)}while(o--)}while(--i);i=2;do{let h=1/n[i+s*i];l=s;do u=s-l,n[u+s*i]=n[u+s*i]*h;while(--l)}while(i--);i=2;do{o=2;do{if(u=n[e+o+s*i],isNaN(u)||u===1/0)throw`Could not reverse! A=[${this.toString()}]`;t.e(i,o,u)}while(o--)}while(i--);return t}setRotationFromQuaternion(t){let e=t.x,s=t.y,n=t.z,i=t.w,o=e+e,r=s+s,a=n+n,l=e*o,d=e*r,u=e*a,h=s*r,f=s*a,p=n*a,y=i*o,v=i*r,x=i*a,m=this.elements;return m[0]=1-(h+p),m[1]=d-x,m[2]=u+v,m[3]=d+x,m[4]=1-(l+p),m[5]=f-y,m[6]=u-v,m[7]=f+y,m[8]=1-(l+h),this}transpose(t){t===void 0&&(t=new w);let e=this.elements,s=t.elements,n;return s[0]=e[0],s[4]=e[4],s[8]=e[8],n=e[1],s[1]=e[3],s[3]=n,n=e[2],s[2]=e[6],s[6]=n,n=e[5],s[5]=e[7],s[7]=n,t}},Te=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],c=class w{constructor(t,e,s){t===void 0&&(t=0),e===void 0&&(e=0),s===void 0&&(s=0),this.x=t,this.y=e,this.z=s}cross(t,e){e===void 0&&(e=new w);let s=t.x,n=t.y,i=t.z,o=this.x,r=this.y,a=this.z;return e.x=r*i-a*n,e.y=a*s-o*i,e.z=o*n-r*s,e}set(t,e,s){return this.x=t,this.y=e,this.z=s,this}setZero(){this.x=this.y=this.z=0}vadd(t,e){if(e)e.x=t.x+this.x,e.y=t.y+this.y,e.z=t.z+this.z;else return new w(this.x+t.x,this.y+t.y,this.z+t.z)}vsub(t,e){if(e)e.x=this.x-t.x,e.y=this.y-t.y,e.z=this.z-t.z;else return new w(this.x-t.x,this.y-t.y,this.z-t.z)}crossmat(){return new ot([0,-this.z,this.y,this.z,0,-this.x,-this.y,this.x,0])}normalize(){let t=this.x,e=this.y,s=this.z,n=Math.sqrt(t*t+e*e+s*s);if(n>0){let i=1/n;this.x*=i,this.y*=i,this.z*=i}else this.x=0,this.y=0,this.z=0;return n}unit(t){t===void 0&&(t=new w);let e=this.x,s=this.y,n=this.z,i=Math.sqrt(e*e+s*s+n*n);return i>0?(i=1/i,t.x=e*i,t.y=s*i,t.z=n*i):(t.x=1,t.y=0,t.z=0),t}length(){let t=this.x,e=this.y,s=this.z;return Math.sqrt(t*t+e*e+s*s)}lengthSquared(){return this.dot(this)}distanceTo(t){let e=this.x,s=this.y,n=this.z,i=t.x,o=t.y,r=t.z;return Math.sqrt((i-e)*(i-e)+(o-s)*(o-s)+(r-n)*(r-n))}distanceSquared(t){let e=this.x,s=this.y,n=this.z,i=t.x,o=t.y,r=t.z;return(i-e)*(i-e)+(o-s)*(o-s)+(r-n)*(r-n)}scale(t,e){e===void 0&&(e=new w);let s=this.x,n=this.y,i=this.z;return e.x=t*s,e.y=t*n,e.z=t*i,e}vmul(t,e){return e===void 0&&(e=new w),e.x=t.x*this.x,e.y=t.y*this.y,e.z=t.z*this.z,e}addScaledVector(t,e,s){return s===void 0&&(s=new w),s.x=this.x+t*e.x,s.y=this.y+t*e.y,s.z=this.z+t*e.z,s}dot(t){return this.x*t.x+this.y*t.y+this.z*t.z}isZero(){return this.x===0&&this.y===0&&this.z===0}negate(t){return t===void 0&&(t=new w),t.x=-this.x,t.y=-this.y,t.z=-this.z,t}tangents(t,e){let s=this.length();if(s>0){let n=Re,i=1/s;n.set(this.x*i,this.y*i,this.z*i);let o=Pe;Math.abs(n.x)<.9?(o.set(1,0,0),n.cross(o,t)):(o.set(0,1,0),n.cross(o,t)),n.cross(t,e)}else t.set(1,0,0),e.set(0,1,0)}toString(){return`${this.x},${this.y},${this.z}`}toArray(){return[this.x,this.y,this.z]}copy(t){return this.x=t.x,this.y=t.y,this.z=t.z,this}lerp(t,e,s){let n=this.x,i=this.y,o=this.z;s.x=n+(t.x-n)*e,s.y=i+(t.y-i)*e,s.z=o+(t.z-o)*e}almostEquals(t,e){return e===void 0&&(e=1e-6),!(Math.abs(this.x-t.x)>e||Math.abs(this.y-t.y)>e||Math.abs(this.z-t.z)>e)}almostZero(t){return t===void 0&&(t=1e-6),!(Math.abs(this.x)>t||Math.abs(this.y)>t||Math.abs(this.z)>t)}isAntiparallelTo(t,e){return this.negate(oe),oe.almostEquals(t,e)}clone(){return new w(this.x,this.y,this.z)}};c.ZERO=new c(0,0,0);c.UNIT_X=new c(1,0,0);c.UNIT_Y=new c(0,1,0);c.UNIT_Z=new c(0,0,1);var Re=new c,Pe=new c,oe=new c,Y=class w{constructor(t){t===void 0&&(t={}),this.lowerBound=new c,this.upperBound=new c,t.lowerBound&&this.lowerBound.copy(t.lowerBound),t.upperBound&&this.upperBound.copy(t.upperBound)}setFromPoints(t,e,s,n){let i=this.lowerBound,o=this.upperBound,r=s;i.copy(t[0]),r&&r.vmult(i,i),o.copy(i);for(let a=1;a<t.length;a++){let l=t[a];r&&(r.vmult(l,re),l=re),l.x>o.x&&(o.x=l.x),l.x<i.x&&(i.x=l.x),l.y>o.y&&(o.y=l.y),l.y<i.y&&(i.y=l.y),l.z>o.z&&(o.z=l.z),l.z<i.z&&(i.z=l.z)}return e&&(e.vadd(i,i),e.vadd(o,o)),n&&(i.x-=n,i.y-=n,i.z-=n,o.x+=n,o.y+=n,o.z+=n),this}copy(t){return this.lowerBound.copy(t.lowerBound),this.upperBound.copy(t.upperBound),this}clone(){return new w().copy(this)}extend(t){this.lowerBound.x=Math.min(this.lowerBound.x,t.lowerBound.x),this.upperBound.x=Math.max(this.upperBound.x,t.upperBound.x),this.lowerBound.y=Math.min(this.lowerBound.y,t.lowerBound.y),this.upperBound.y=Math.max(this.upperBound.y,t.upperBound.y),this.lowerBound.z=Math.min(this.lowerBound.z,t.lowerBound.z),this.upperBound.z=Math.max(this.upperBound.z,t.upperBound.z)}overlaps(t){let e=this.lowerBound,s=this.upperBound,n=t.lowerBound,i=t.upperBound,o=n.x<=s.x&&s.x<=i.x||e.x<=i.x&&i.x<=s.x,r=n.y<=s.y&&s.y<=i.y||e.y<=i.y&&i.y<=s.y,a=n.z<=s.z&&s.z<=i.z||e.z<=i.z&&i.z<=s.z;return o&&r&&a}volume(){let t=this.lowerBound,e=this.upperBound;return(e.x-t.x)*(e.y-t.y)*(e.z-t.z)}contains(t){let e=this.lowerBound,s=this.upperBound,n=t.lowerBound,i=t.upperBound;return e.x<=n.x&&s.x>=i.x&&e.y<=n.y&&s.y>=i.y&&e.z<=n.z&&s.z>=i.z}getCorners(t,e,s,n,i,o,r,a){let l=this.lowerBound,d=this.upperBound;t.copy(l),e.set(d.x,l.y,l.z),s.set(d.x,d.y,l.z),n.set(l.x,d.y,d.z),i.set(d.x,l.y,d.z),o.set(l.x,d.y,l.z),r.set(l.x,l.y,d.z),a.copy(d)}toLocalFrame(t,e){let s=ce,n=s[0],i=s[1],o=s[2],r=s[3],a=s[4],l=s[5],d=s[6],u=s[7];this.getCorners(n,i,o,r,a,l,d,u);for(let h=0;h!==8;h++){let f=s[h];t.pointToLocal(f,f)}return e.setFromPoints(s)}toWorldFrame(t,e){let s=ce,n=s[0],i=s[1],o=s[2],r=s[3],a=s[4],l=s[5],d=s[6],u=s[7];this.getCorners(n,i,o,r,a,l,d,u);for(let h=0;h!==8;h++){let f=s[h];t.pointToWorld(f,f)}return e.setFromPoints(s)}overlapsRay(t){let{direction:e,from:s}=t,n=1/e.x,i=1/e.y,o=1/e.z,r=(this.lowerBound.x-s.x)*n,a=(this.upperBound.x-s.x)*n,l=(this.lowerBound.y-s.y)*i,d=(this.upperBound.y-s.y)*i,u=(this.lowerBound.z-s.z)*o,h=(this.upperBound.z-s.z)*o,f=Math.max(Math.max(Math.min(r,a),Math.min(l,d)),Math.min(u,h)),p=Math.min(Math.min(Math.max(r,a),Math.max(l,d)),Math.max(u,h));return!(p<0||f>p)}},re=new c,ce=[new c,new c,new c,new c,new c,new c,new c,new c],Et=class{constructor(){this.matrix=[]}get(t,e){let{index:s}=t,{index:n}=e;if(n>s){let i=n;n=s,s=i}return this.matrix[(s*(s+1)>>1)+n-1]}set(t,e,s){let{index:n}=t,{index:i}=e;if(i>n){let o=i;i=n,n=o}this.matrix[(n*(n+1)>>1)+i-1]=s?1:0}reset(){for(let t=0,e=this.matrix.length;t!==e;t++)this.matrix[t]=0}setNumObjects(t){this.matrix.length=t*(t-1)>>1}},zt=class{addEventListener(t,e){this._listeners===void 0&&(this._listeners={});let s=this._listeners;return s[t]===void 0&&(s[t]=[]),s[t].includes(e)||s[t].push(e),this}hasEventListener(t,e){if(this._listeners===void 0)return!1;let s=this._listeners;return!!(s[t]!==void 0&&s[t].includes(e))}hasAnyEventListener(t){return this._listeners===void 0?!1:this._listeners[t]!==void 0}removeEventListener(t,e){if(this._listeners===void 0)return this;let s=this._listeners;if(s[t]===void 0)return this;let n=s[t].indexOf(e);return n!==-1&&s[t].splice(n,1),this}dispatchEvent(t){if(this._listeners===void 0)return this;let s=this._listeners[t.type];if(s!==void 0){t.target=this;for(let n=0,i=s.length;n<i;n++)s[n].call(this,t)}return this}},H=class w{constructor(t,e,s,n){t===void 0&&(t=0),e===void 0&&(e=0),s===void 0&&(s=0),n===void 0&&(n=1),this.x=t,this.y=e,this.z=s,this.w=n}set(t,e,s,n){return this.x=t,this.y=e,this.z=s,this.w=n,this}toString(){return`${this.x},${this.y},${this.z},${this.w}`}toArray(){return[this.x,this.y,this.z,this.w]}setFromAxisAngle(t,e){let s=Math.sin(e*.5);return this.x=t.x*s,this.y=t.y*s,this.z=t.z*s,this.w=Math.cos(e*.5),this}toAxisAngle(t){t===void 0&&(t=new c),this.normalize();let e=2*Math.acos(this.w),s=Math.sqrt(1-this.w*this.w);return s<.001?(t.x=this.x,t.y=this.y,t.z=this.z):(t.x=this.x/s,t.y=this.y/s,t.z=this.z/s),[t,e]}setFromVectors(t,e){if(t.isAntiparallelTo(e)){let s=qe,n=Le;t.tangents(s,n),this.setFromAxisAngle(s,Math.PI)}else{let s=t.cross(e);this.x=s.x,this.y=s.y,this.z=s.z,this.w=Math.sqrt(t.length()**2*e.length()**2)+t.dot(e),this.normalize()}return this}mult(t,e){e===void 0&&(e=new w);let s=this.x,n=this.y,i=this.z,o=this.w,r=t.x,a=t.y,l=t.z,d=t.w;return e.x=s*d+o*r+n*l-i*a,e.y=n*d+o*a+i*r-s*l,e.z=i*d+o*l+s*a-n*r,e.w=o*d-s*r-n*a-i*l,e}inverse(t){t===void 0&&(t=new w);let e=this.x,s=this.y,n=this.z,i=this.w;this.conjugate(t);let o=1/(e*e+s*s+n*n+i*i);return t.x*=o,t.y*=o,t.z*=o,t.w*=o,t}conjugate(t){return t===void 0&&(t=new w),t.x=-this.x,t.y=-this.y,t.z=-this.z,t.w=this.w,t}normalize(){let t=Math.sqrt(this.x*this.x+this.y*this.y+this.z*this.z+this.w*this.w);return t===0?(this.x=0,this.y=0,this.z=0,this.w=0):(t=1/t,this.x*=t,this.y*=t,this.z*=t,this.w*=t),this}normalizeFast(){let t=(3-(this.x*this.x+this.y*this.y+this.z*this.z+this.w*this.w))/2;return t===0?(this.x=0,this.y=0,this.z=0,this.w=0):(this.x*=t,this.y*=t,this.z*=t,this.w*=t),this}vmult(t,e){e===void 0&&(e=new c);let s=t.x,n=t.y,i=t.z,o=this.x,r=this.y,a=this.z,l=this.w,d=l*s+r*i-a*n,u=l*n+a*s-o*i,h=l*i+o*n-r*s,f=-o*s-r*n-a*i;return e.x=d*l+f*-o+u*-a-h*-r,e.y=u*l+f*-r+h*-o-d*-a,e.z=h*l+f*-a+d*-r-u*-o,e}copy(t){return this.x=t.x,this.y=t.y,this.z=t.z,this.w=t.w,this}toEuler(t,e){e===void 0&&(e="YZX");let s,n,i,o=this.x,r=this.y,a=this.z,l=this.w;switch(e){case"YZX":let d=o*r+a*l;if(d>.499&&(s=2*Math.atan2(o,l),n=Math.PI/2,i=0),d<-.499&&(s=-2*Math.atan2(o,l),n=-Math.PI/2,i=0),s===void 0){let u=o*o,h=r*r,f=a*a;s=Math.atan2(2*r*l-2*o*a,1-2*h-2*f),n=Math.asin(2*d),i=Math.atan2(2*o*l-2*r*a,1-2*u-2*f)}break;default:throw new Error(`Euler order ${e} not supported yet.`)}t.y=s,t.z=n,t.x=i}setFromEuler(t,e,s,n){n===void 0&&(n="XYZ");let i=Math.cos(t/2),o=Math.cos(e/2),r=Math.cos(s/2),a=Math.sin(t/2),l=Math.sin(e/2),d=Math.sin(s/2);return n==="XYZ"?(this.x=a*o*r+i*l*d,this.y=i*l*r-a*o*d,this.z=i*o*d+a*l*r,this.w=i*o*r-a*l*d):n==="YXZ"?(this.x=a*o*r+i*l*d,this.y=i*l*r-a*o*d,this.z=i*o*d-a*l*r,this.w=i*o*r+a*l*d):n==="ZXY"?(this.x=a*o*r-i*l*d,this.y=i*l*r+a*o*d,this.z=i*o*d+a*l*r,this.w=i*o*r-a*l*d):n==="ZYX"?(this.x=a*o*r-i*l*d,this.y=i*l*r+a*o*d,this.z=i*o*d-a*l*r,this.w=i*o*r+a*l*d):n==="YZX"?(this.x=a*o*r+i*l*d,this.y=i*l*r+a*o*d,this.z=i*o*d-a*l*r,this.w=i*o*r-a*l*d):n==="XZY"&&(this.x=a*o*r-i*l*d,this.y=i*l*r-a*o*d,this.z=i*o*d+a*l*r,this.w=i*o*r+a*l*d),this}clone(){return new w(this.x,this.y,this.z,this.w)}slerp(t,e,s){s===void 0&&(s=new w);let n=this.x,i=this.y,o=this.z,r=this.w,a=t.x,l=t.y,d=t.z,u=t.w,h,f,p,y,v;return f=n*a+i*l+o*d+r*u,f<0&&(f=-f,a=-a,l=-l,d=-d,u=-u),1-f>1e-6?(h=Math.acos(f),p=Math.sin(h),y=Math.sin((1-e)*h)/p,v=Math.sin(e*h)/p):(y=1-e,v=e),s.x=y*n+v*a,s.y=y*i+v*l,s.z=y*o+v*d,s.w=y*r+v*u,s}integrate(t,e,s,n){n===void 0&&(n=new w);let i=t.x*s.x,o=t.y*s.y,r=t.z*s.z,a=this.x,l=this.y,d=this.z,u=this.w,h=e*.5;return n.x+=h*(i*u+o*d-r*l),n.y+=h*(o*u+r*a-i*d),n.z+=h*(r*u+i*l-o*a),n.w+=h*(-i*a-o*l-r*d),n}},qe=new c,Le=new c,We={SPHERE:1,PLANE:2,BOX:4,COMPOUND:8,CONVEXPOLYHEDRON:16,HEIGHTFIELD:32,PARTICLE:64,CYLINDER:128,TRIMESH:256},N=class w{constructor(t){t===void 0&&(t={}),this.id=w.idCounter++,this.type=t.type||0,this.boundingSphereRadius=0,this.collisionResponse=t.collisionResponse?t.collisionResponse:!0,this.collisionFilterGroup=t.collisionFilterGroup!==void 0?t.collisionFilterGroup:1,this.collisionFilterMask=t.collisionFilterMask!==void 0?t.collisionFilterMask:-1,this.material=t.material?t.material:null,this.body=null}updateBoundingSphereRadius(){throw`computeBoundingSphereRadius() not implemented for shape type ${this.type}`}volume(){throw`volume() not implemented for shape type ${this.type}`}calculateLocalInertia(t,e){throw`calculateLocalInertia() not implemented for shape type ${this.type}`}calculateWorldAABB(t,e,s,n){throw`calculateWorldAABB() not implemented for shape type ${this.type}`}};N.idCounter=0;N.types=We;var V=class w{constructor(t){t===void 0&&(t={}),this.position=new c,this.quaternion=new H,t.position&&this.position.copy(t.position),t.quaternion&&this.quaternion.copy(t.quaternion)}pointToLocal(t,e){return w.pointToLocalFrame(this.position,this.quaternion,t,e)}pointToWorld(t,e){return w.pointToWorldFrame(this.position,this.quaternion,t,e)}vectorToWorldFrame(t,e){return e===void 0&&(e=new c),this.quaternion.vmult(t,e),e}static pointToLocalFrame(t,e,s,n){return n===void 0&&(n=new c),s.vsub(t,n),e.conjugate(ae),ae.vmult(n,n),n}static pointToWorldFrame(t,e,s,n){return n===void 0&&(n=new c),e.vmult(s,n),n.vadd(t,n),n}static vectorToWorldFrame(t,e,s){return s===void 0&&(s=new c),t.vmult(e,s),s}static vectorToLocalFrame(t,e,s,n){return n===void 0&&(n=new c),e.w*=-1,e.vmult(s,n),e.w*=-1,n}},ae=new H,Dt=class w extends N{constructor(t){t===void 0&&(t={});let{vertices:e=[],faces:s=[],normals:n=[],axes:i,boundingSphereRadius:o}=t;super({type:N.types.CONVEXPOLYHEDRON}),this.vertices=e,this.faces=s,this.faceNormals=n,this.faceNormals.length===0&&this.computeNormals(),o?this.boundingSphereRadius=o:this.updateBoundingSphereRadius(),this.worldVertices=[],this.worldVerticesNeedsUpdate=!0,this.worldFaceNormals=[],this.worldFaceNormalsNeedsUpdate=!0,this.uniqueAxes=i?i.slice():null,this.uniqueEdges=[],this.computeEdges()}computeEdges(){let t=this.faces,e=this.vertices,s=this.uniqueEdges;s.length=0;let n=new c;for(let i=0;i!==t.length;i++){let o=t[i],r=o.length;for(let a=0;a!==r;a++){let l=(a+1)%r;e[o[a]].vsub(e[o[l]],n),n.normalize();let d=!1;for(let u=0;u!==s.length;u++)if(s[u].almostEquals(n)||s[u].almostEquals(n)){d=!0;break}d||s.push(n.clone())}}}computeNormals(){this.faceNormals.length=this.faces.length;for(let t=0;t<this.faces.length;t++){for(let n=0;n<this.faces[t].length;n++)if(!this.vertices[this.faces[t][n]])throw new Error(`Vertex ${this.faces[t][n]} not found!`);let e=this.faceNormals[t]||new c;this.getFaceNormal(t,e),e.negate(e),this.faceNormals[t]=e;let s=this.vertices[this.faces[t][0]];if(e.dot(s)<0){console.error(`.faceNormals[${t}] = Vec3(${e.toString()}) looks like it points into the shape? The vertices follow. Make sure they are ordered CCW around the normal, using the right hand rule.`);for(let n=0;n<this.faces[t].length;n++)console.warn(`.vertices[${this.faces[t][n]}] = Vec3(${this.vertices[this.faces[t][n]].toString()})`)}}}getFaceNormal(t,e){let s=this.faces[t],n=this.vertices[s[0]],i=this.vertices[s[1]],o=this.vertices[s[2]];w.computeNormal(n,i,o,e)}static computeNormal(t,e,s,n){let i=new c,o=new c;e.vsub(t,o),s.vsub(e,i),i.cross(o,n),n.isZero()||n.normalize()}clipAgainstHull(t,e,s,n,i,o,r,a,l){let d=new c,u=-1,h=-Number.MAX_VALUE;for(let p=0;p<s.faces.length;p++){d.copy(s.faceNormals[p]),i.vmult(d,d);let y=d.dot(o);y>h&&(h=y,u=p)}let f=[];for(let p=0;p<s.faces[u].length;p++){let y=s.vertices[s.faces[u][p]],v=new c;v.copy(y),i.vmult(v,v),n.vadd(v,v),f.push(v)}u>=0&&this.clipFaceAgainstHull(o,t,e,f,r,a,l)}findSeparatingAxis(t,e,s,n,i,o,r,a){let l=new c,d=new c,u=new c,h=new c,f=new c,p=new c,y=Number.MAX_VALUE,v=this;if(v.uniqueAxes)for(let x=0;x!==v.uniqueAxes.length;x++){s.vmult(v.uniqueAxes[x],l);let m=v.testSepAxis(l,t,e,s,n,i);if(m===!1)return!1;m<y&&(y=m,o.copy(l))}else{let x=r?r.length:v.faces.length;for(let m=0;m<x;m++){let g=r?r[m]:m;l.copy(v.faceNormals[g]),s.vmult(l,l);let b=v.testSepAxis(l,t,e,s,n,i);if(b===!1)return!1;b<y&&(y=b,o.copy(l))}}if(t.uniqueAxes)for(let x=0;x!==t.uniqueAxes.length;x++){i.vmult(t.uniqueAxes[x],d);let m=v.testSepAxis(d,t,e,s,n,i);if(m===!1)return!1;m<y&&(y=m,o.copy(d))}else{let x=a?a.length:t.faces.length;for(let m=0;m<x;m++){let g=a?a[m]:m;d.copy(t.faceNormals[g]),i.vmult(d,d);let b=v.testSepAxis(d,t,e,s,n,i);if(b===!1)return!1;b<y&&(y=b,o.copy(d))}}for(let x=0;x!==v.uniqueEdges.length;x++){s.vmult(v.uniqueEdges[x],h);for(let m=0;m!==t.uniqueEdges.length;m++)if(i.vmult(t.uniqueEdges[m],f),h.cross(f,p),!p.almostZero()){p.normalize();let g=v.testSepAxis(p,t,e,s,n,i);if(g===!1)return!1;g<y&&(y=g,o.copy(p))}}return n.vsub(e,u),u.dot(o)>0&&o.negate(o),!0}testSepAxis(t,e,s,n,i,o){let r=this;w.project(r,t,s,n,Vt),w.project(e,t,i,o,jt);let a=Vt[0],l=Vt[1],d=jt[0],u=jt[1];if(a<u||d<l)return!1;let h=a-u,f=d-l;return h<f?h:f}calculateLocalInertia(t,e){let s=new c,n=new c;this.computeLocalAABB(n,s);let i=s.x-n.x,o=s.y-n.y,r=s.z-n.z;e.x=1/12*t*(2*o*2*o+2*r*2*r),e.y=1/12*t*(2*i*2*i+2*r*2*r),e.z=1/12*t*(2*o*2*o+2*i*2*i)}getPlaneConstantOfFace(t){let e=this.faces[t],s=this.faceNormals[t],n=this.vertices[e[0]];return-s.dot(n)}clipFaceAgainstHull(t,e,s,n,i,o,r){let a=new c,l=new c,d=new c,u=new c,h=new c,f=new c,p=new c,y=new c,v=this,x=[],m=n,g=x,b=-1,B=Number.MAX_VALUE;for(let I=0;I<v.faces.length;I++){a.copy(v.faceNormals[I]),s.vmult(a,a);let T=a.dot(t);T<B&&(B=T,b=I)}if(b<0)return;let z=v.faces[b];z.connectedFaces=[];for(let I=0;I<v.faces.length;I++)for(let T=0;T<v.faces[I].length;T++)z.indexOf(v.faces[I][T])!==-1&&I!==b&&z.connectedFaces.indexOf(I)===-1&&z.connectedFaces.push(I);let F=z.length;for(let I=0;I<F;I++){let T=v.vertices[z[I]],L=v.vertices[z[(I+1)%F]];T.vsub(L,l),d.copy(l),s.vmult(d,d),e.vadd(d,d),u.copy(this.faceNormals[b]),s.vmult(u,u),e.vadd(u,u),d.cross(u,h),h.negate(h),f.copy(T),s.vmult(f,f),e.vadd(f,f);let A=z.connectedFaces[I];p.copy(this.faceNormals[A]);let S=this.getPlaneConstantOfFace(A);y.copy(p),s.vmult(y,y);let C=S-y.dot(e);for(this.clipFaceAgainstPlane(m,g,y,C);m.length;)m.shift();for(;g.length;)m.push(g.shift())}p.copy(this.faceNormals[b]);let _=this.getPlaneConstantOfFace(b);y.copy(p),s.vmult(y,y);let R=_-y.dot(e);for(let I=0;I<m.length;I++){let T=y.dot(m[I])+R;if(T<=i&&(console.log(`clamped: depth=${T} to minDist=${i}`),T=i),T<=o){let L=m[I];if(T<=1e-6){let A={point:L,normal:y,depth:T};r.push(A)}}}}clipFaceAgainstPlane(t,e,s,n){let i,o,r=t.length;if(r<2)return e;let a=t[t.length-1],l=t[0];i=s.dot(a)+n;for(let d=0;d<r;d++){if(l=t[d],o=s.dot(l)+n,i<0)if(o<0){let u=new c;u.copy(l),e.push(u)}else{let u=new c;a.lerp(l,i/(i-o),u),e.push(u)}else if(o<0){let u=new c;a.lerp(l,i/(i-o),u),e.push(u),e.push(l)}a=l,i=o}return e}computeWorldVertices(t,e){for(;this.worldVertices.length<this.vertices.length;)this.worldVertices.push(new c);let s=this.vertices,n=this.worldVertices;for(let i=0;i!==this.vertices.length;i++)e.vmult(s[i],n[i]),t.vadd(n[i],n[i]);this.worldVerticesNeedsUpdate=!1}computeLocalAABB(t,e){let s=this.vertices;t.set(Number.MAX_VALUE,Number.MAX_VALUE,Number.MAX_VALUE),e.set(-Number.MAX_VALUE,-Number.MAX_VALUE,-Number.MAX_VALUE);for(let n=0;n<this.vertices.length;n++){let i=s[n];i.x<t.x?t.x=i.x:i.x>e.x&&(e.x=i.x),i.y<t.y?t.y=i.y:i.y>e.y&&(e.y=i.y),i.z<t.z?t.z=i.z:i.z>e.z&&(e.z=i.z)}}computeWorldFaceNormals(t){let e=this.faceNormals.length;for(;this.worldFaceNormals.length<e;)this.worldFaceNormals.push(new c);let s=this.faceNormals,n=this.worldFaceNormals;for(let i=0;i!==e;i++)t.vmult(s[i],n[i]);this.worldFaceNormalsNeedsUpdate=!1}updateBoundingSphereRadius(){let t=0,e=this.vertices;for(let s=0;s!==e.length;s++){let n=e[s].lengthSquared();n>t&&(t=n)}this.boundingSphereRadius=Math.sqrt(t)}calculateWorldAABB(t,e,s,n){let i=this.vertices,o,r,a,l,d,u,h=new c;for(let f=0;f<i.length;f++){h.copy(i[f]),e.vmult(h,h),t.vadd(h,h);let p=h;(o===void 0||p.x<o)&&(o=p.x),(l===void 0||p.x>l)&&(l=p.x),(r===void 0||p.y<r)&&(r=p.y),(d===void 0||p.y>d)&&(d=p.y),(a===void 0||p.z<a)&&(a=p.z),(u===void 0||p.z>u)&&(u=p.z)}s.set(o,r,a),n.set(l,d,u)}volume(){return 4*Math.PI*this.boundingSphereRadius/3}getAveragePointLocal(t){t===void 0&&(t=new c);let e=this.vertices;for(let s=0;s<e.length;s++)t.vadd(e[s],t);return t.scale(1/e.length,t),t}transformAllPoints(t,e){let s=this.vertices.length,n=this.vertices;if(e){for(let i=0;i<s;i++){let o=n[i];e.vmult(o,o)}for(let i=0;i<this.faceNormals.length;i++){let o=this.faceNormals[i];e.vmult(o,o)}}if(t)for(let i=0;i<s;i++){let o=n[i];o.vadd(t,o)}}pointIsInside(t){let e=this.vertices,s=this.faces,n=this.faceNormals,i=null,o=new c;this.getAveragePointLocal(o);for(let r=0;r<this.faces.length;r++){let a=n[r],l=e[s[r][0]],d=new c;t.vsub(l,d);let u=a.dot(d),h=new c;o.vsub(l,h);let f=a.dot(h);if(u<0&&f>0||u>0&&f<0)return!1}return i?1:-1}static project(t,e,s,n,i){let o=t.vertices.length,r=je,a=0,l=0,d=ke,u=t.vertices;d.setZero(),V.vectorToLocalFrame(s,n,e,r),V.pointToLocalFrame(s,n,d,d);let h=d.dot(r);l=a=u[0].dot(r);for(let f=1;f<o;f++){let p=u[f].dot(r);p>a&&(a=p),p<l&&(l=p)}if(l-=h,a-=h,l>a){let f=l;l=a,a=f}i[0]=a,i[1]=l}},Vt=[],jt=[],Ve=new c,je=new c,ke=new c,vt=class w extends N{constructor(t){super({type:N.types.BOX}),this.halfExtents=t,this.convexPolyhedronRepresentation=null,this.updateConvexPolyhedronRepresentation(),this.updateBoundingSphereRadius()}updateConvexPolyhedronRepresentation(){let t=this.halfExtents.x,e=this.halfExtents.y,s=this.halfExtents.z,n=c,i=[new n(-t,-e,-s),new n(t,-e,-s),new n(t,e,-s),new n(-t,e,-s),new n(-t,-e,s),new n(t,-e,s),new n(t,e,s),new n(-t,e,s)],o=[[3,2,1,0],[4,5,6,7],[5,4,0,1],[2,3,7,6],[0,4,7,3],[1,2,6,5]],r=[new n(0,0,1),new n(0,1,0),new n(1,0,0)],a=new Dt({vertices:i,faces:o,axes:r});this.convexPolyhedronRepresentation=a,a.material=this.material}calculateLocalInertia(t,e){return e===void 0&&(e=new c),w.calculateInertia(this.halfExtents,t,e),e}static calculateInertia(t,e,s){let n=t;s.x=1/12*e*(2*n.y*2*n.y+2*n.z*2*n.z),s.y=1/12*e*(2*n.x*2*n.x+2*n.z*2*n.z),s.z=1/12*e*(2*n.y*2*n.y+2*n.x*2*n.x)}getSideNormals(t,e){let s=t,n=this.halfExtents;if(s[0].set(n.x,0,0),s[1].set(0,n.y,0),s[2].set(0,0,n.z),s[3].set(-n.x,0,0),s[4].set(0,-n.y,0),s[5].set(0,0,-n.z),e!==void 0)for(let i=0;i!==s.length;i++)e.vmult(s[i],s[i]);return s}volume(){return 8*this.halfExtents.x*this.halfExtents.y*this.halfExtents.z}updateBoundingSphereRadius(){this.boundingSphereRadius=this.halfExtents.length()}forEachWorldCorner(t,e,s){let n=this.halfExtents,i=[[n.x,n.y,n.z],[-n.x,n.y,n.z],[-n.x,-n.y,n.z],[-n.x,-n.y,-n.z],[n.x,-n.y,-n.z],[n.x,n.y,-n.z],[-n.x,n.y,-n.z],[n.x,-n.y,n.z]];for(let o=0;o<i.length;o++)it.set(i[o][0],i[o][1],i[o][2]),e.vmult(it,it),t.vadd(it,it),s(it.x,it.y,it.z)}calculateWorldAABB(t,e,s,n){let i=this.halfExtents;Z[0].set(i.x,i.y,i.z),Z[1].set(-i.x,i.y,i.z),Z[2].set(-i.x,-i.y,i.z),Z[3].set(-i.x,-i.y,-i.z),Z[4].set(i.x,-i.y,-i.z),Z[5].set(i.x,i.y,-i.z),Z[6].set(-i.x,i.y,-i.z),Z[7].set(i.x,-i.y,i.z);let o=Z[0];e.vmult(o,o),t.vadd(o,o),n.copy(o),s.copy(o);for(let r=1;r<8;r++){let a=Z[r];e.vmult(a,a),t.vadd(a,a);let l=a.x,d=a.y,u=a.z;l>n.x&&(n.x=l),d>n.y&&(n.y=d),u>n.z&&(n.z=u),l<s.x&&(s.x=l),d<s.y&&(s.y=d),u<s.z&&(s.z=u)}}},it=new c,Z=[new c,new c,new c,new c,new c,new c,new c,new c],ee={DYNAMIC:1,STATIC:2,KINEMATIC:4},se={AWAKE:0,SLEEPY:1,SLEEPING:2},q=class w extends zt{constructor(t){t===void 0&&(t={}),super(),this.id=w.idCounter++,this.index=-1,this.world=null,this.vlambda=new c,this.collisionFilterGroup=typeof t.collisionFilterGroup=="number"?t.collisionFilterGroup:1,this.collisionFilterMask=typeof t.collisionFilterMask=="number"?t.collisionFilterMask:-1,this.collisionResponse=typeof t.collisionResponse=="boolean"?t.collisionResponse:!0,this.position=new c,this.previousPosition=new c,this.interpolatedPosition=new c,this.initPosition=new c,t.position&&(this.position.copy(t.position),this.previousPosition.copy(t.position),this.interpolatedPosition.copy(t.position),this.initPosition.copy(t.position)),this.velocity=new c,t.velocity&&this.velocity.copy(t.velocity),this.initVelocity=new c,this.force=new c;let e=typeof t.mass=="number"?t.mass:0;this.mass=e,this.invMass=e>0?1/e:0,this.material=t.material||null,this.linearDamping=typeof t.linearDamping=="number"?t.linearDamping:.01,this.type=e<=0?w.STATIC:w.DYNAMIC,typeof t.type==typeof w.STATIC&&(this.type=t.type),this.allowSleep=typeof t.allowSleep<"u"?t.allowSleep:!0,this.sleepState=w.AWAKE,this.sleepSpeedLimit=typeof t.sleepSpeedLimit<"u"?t.sleepSpeedLimit:.1,this.sleepTimeLimit=typeof t.sleepTimeLimit<"u"?t.sleepTimeLimit:1,this.timeLastSleepy=0,this.wakeUpAfterNarrowphase=!1,this.torque=new c,this.quaternion=new H,this.initQuaternion=new H,this.previousQuaternion=new H,this.interpolatedQuaternion=new H,t.quaternion&&(this.quaternion.copy(t.quaternion),this.initQuaternion.copy(t.quaternion),this.previousQuaternion.copy(t.quaternion),this.interpolatedQuaternion.copy(t.quaternion)),this.angularVelocity=new c,t.angularVelocity&&this.angularVelocity.copy(t.angularVelocity),this.initAngularVelocity=new c,this.shapes=[],this.shapeOffsets=[],this.shapeOrientations=[],this.inertia=new c,this.invInertia=new c,this.invInertiaWorld=new ot,this.invMassSolve=0,this.invInertiaSolve=new c,this.invInertiaWorldSolve=new ot,this.fixedRotation=typeof t.fixedRotation<"u"?t.fixedRotation:!1,this.angularDamping=typeof t.angularDamping<"u"?t.angularDamping:.01,this.linearFactor=new c(1,1,1),t.linearFactor&&this.linearFactor.copy(t.linearFactor),this.angularFactor=new c(1,1,1),t.angularFactor&&this.angularFactor.copy(t.angularFactor),this.aabb=new Y,this.aabbNeedsUpdate=!0,this.boundingRadius=0,this.wlambda=new c,this.isTrigger=!!t.isTrigger,t.shape&&this.addShape(t.shape),this.updateMassProperties()}wakeUp(){let t=this.sleepState;this.sleepState=w.AWAKE,this.wakeUpAfterNarrowphase=!1,t===w.SLEEPING&&this.dispatchEvent(w.wakeupEvent)}sleep(){this.sleepState=w.SLEEPING,this.velocity.set(0,0,0),this.angularVelocity.set(0,0,0),this.wakeUpAfterNarrowphase=!1}sleepTick(t){if(this.allowSleep){let e=this.sleepState,s=this.velocity.lengthSquared()+this.angularVelocity.lengthSquared(),n=this.sleepSpeedLimit**2;e===w.AWAKE&&s<n?(this.sleepState=w.SLEEPY,this.timeLastSleepy=t,this.dispatchEvent(w.sleepyEvent)):e===w.SLEEPY&&s>n?this.wakeUp():e===w.SLEEPY&&t-this.timeLastSleepy>this.sleepTimeLimit&&(this.sleep(),this.dispatchEvent(w.sleepEvent))}}updateSolveMassProperties(){this.sleepState===w.SLEEPING||this.type===w.KINEMATIC?(this.invMassSolve=0,this.invInertiaSolve.setZero(),this.invInertiaWorldSolve.setZero()):(this.invMassSolve=this.invMass,this.invInertiaSolve.copy(this.invInertia),this.invInertiaWorldSolve.copy(this.invInertiaWorld))}pointToLocalFrame(t,e){return e===void 0&&(e=new c),t.vsub(this.position,e),this.quaternion.conjugate().vmult(e,e),e}vectorToLocalFrame(t,e){return e===void 0&&(e=new c),this.quaternion.conjugate().vmult(t,e),e}pointToWorldFrame(t,e){return e===void 0&&(e=new c),this.quaternion.vmult(t,e),e.vadd(this.position,e),e}vectorToWorldFrame(t,e){return e===void 0&&(e=new c),this.quaternion.vmult(t,e),e}addShape(t,e,s){let n=new c,i=new H;return e&&n.copy(e),s&&i.copy(s),this.shapes.push(t),this.shapeOffsets.push(n),this.shapeOrientations.push(i),this.updateMassProperties(),this.updateBoundingRadius(),this.aabbNeedsUpdate=!0,t.body=this,this}removeShape(t){let e=this.shapes.indexOf(t);return e===-1?(console.warn("Shape does not belong to the body"),this):(this.shapes.splice(e,1),this.shapeOffsets.splice(e,1),this.shapeOrientations.splice(e,1),this.updateMassProperties(),this.updateBoundingRadius(),this.aabbNeedsUpdate=!0,t.body=null,this)}updateBoundingRadius(){let t=this.shapes,e=this.shapeOffsets,s=t.length,n=0;for(let i=0;i!==s;i++){let o=t[i];o.updateBoundingSphereRadius();let r=e[i].length(),a=o.boundingSphereRadius;r+a>n&&(n=r+a)}this.boundingRadius=n}updateAABB(){let t=this.shapes,e=this.shapeOffsets,s=this.shapeOrientations,n=t.length,i=Oe,o=He,r=this.quaternion,a=this.aabb,l=Ge;for(let d=0;d!==n;d++){let u=t[d];r.vmult(e[d],i),i.vadd(this.position,i),r.mult(s[d],o),u.calculateWorldAABB(i,o,l.lowerBound,l.upperBound),d===0?a.copy(l):a.extend(l)}this.aabbNeedsUpdate=!1}updateInertiaWorld(t){let e=this.invInertia;if(!(e.x===e.y&&e.y===e.z&&!t)){let s=De,n=Ue;s.setRotationFromQuaternion(this.quaternion),s.transpose(n),s.scale(e,s),s.mmult(n,this.invInertiaWorld)}}applyForce(t,e){if(e===void 0&&(e=new c),this.type!==w.DYNAMIC)return;this.sleepState===w.SLEEPING&&this.wakeUp();let s=Xe;e.cross(t,s),this.force.vadd(t,this.force),this.torque.vadd(s,this.torque)}applyLocalForce(t,e){if(e===void 0&&(e=new c),this.type!==w.DYNAMIC)return;let s=$e,n=Ze;this.vectorToWorldFrame(t,s),this.vectorToWorldFrame(e,n),this.applyForce(s,n)}applyTorque(t){this.type===w.DYNAMIC&&(this.sleepState===w.SLEEPING&&this.wakeUp(),this.torque.vadd(t,this.torque))}applyImpulse(t,e){if(e===void 0&&(e=new c),this.type!==w.DYNAMIC)return;this.sleepState===w.SLEEPING&&this.wakeUp();let s=e,n=Ke;n.copy(t),n.scale(this.invMass,n),this.velocity.vadd(n,this.velocity);let i=Qe;s.cross(t,i),this.invInertiaWorld.vmult(i,i),this.angularVelocity.vadd(i,this.angularVelocity)}applyLocalImpulse(t,e){if(e===void 0&&(e=new c),this.type!==w.DYNAMIC)return;let s=Je,n=ts;this.vectorToWorldFrame(t,s),this.vectorToWorldFrame(e,n),this.applyImpulse(s,n)}updateMassProperties(){let t=es;this.invMass=this.mass>0?1/this.mass:0;let e=this.inertia,s=this.fixedRotation;this.updateAABB(),t.set((this.aabb.upperBound.x-this.aabb.lowerBound.x)/2,(this.aabb.upperBound.y-this.aabb.lowerBound.y)/2,(this.aabb.upperBound.z-this.aabb.lowerBound.z)/2),vt.calculateInertia(t,this.mass,e),this.invInertia.set(e.x>0&&!s?1/e.x:0,e.y>0&&!s?1/e.y:0,e.z>0&&!s?1/e.z:0),this.updateInertiaWorld(!0)}getVelocityAtWorldPoint(t,e){let s=new c;return t.vsub(this.position,s),this.angularVelocity.cross(s,e),this.velocity.vadd(e,e),e}integrate(t,e,s){if(this.previousPosition.copy(this.position),this.previousQuaternion.copy(this.quaternion),!(this.type===w.DYNAMIC||this.type===w.KINEMATIC)||this.sleepState===w.SLEEPING)return;let n=this.velocity,i=this.angularVelocity,o=this.position,r=this.force,a=this.torque,l=this.quaternion,d=this.invMass,u=this.invInertiaWorld,h=this.linearFactor,f=d*t;n.x+=r.x*f*h.x,n.y+=r.y*f*h.y,n.z+=r.z*f*h.z;let p=u.elements,y=this.angularFactor,v=a.x*y.x,x=a.y*y.y,m=a.z*y.z;i.x+=t*(p[0]*v+p[1]*x+p[2]*m),i.y+=t*(p[3]*v+p[4]*x+p[5]*m),i.z+=t*(p[6]*v+p[7]*x+p[8]*m),o.x+=n.x*t,o.y+=n.y*t,o.z+=n.z*t,l.integrate(this.angularVelocity,t,this.angularFactor,l),e&&(s?l.normalizeFast():l.normalize()),this.aabbNeedsUpdate=!0,this.updateInertiaWorld()}};q.idCounter=0;q.COLLIDE_EVENT_NAME="collide";q.DYNAMIC=ee.DYNAMIC;q.STATIC=ee.STATIC;q.KINEMATIC=ee.KINEMATIC;q.AWAKE=se.AWAKE;q.SLEEPY=se.SLEEPY;q.SLEEPING=se.SLEEPING;q.wakeupEvent={type:"wakeup"};q.sleepyEvent={type:"sleepy"};q.sleepEvent={type:"sleep"};var Oe=new c,He=new H,Ge=new Y,De=new ot,Ue=new ot,Ye=new ot,Xe=new c,$e=new c,Ze=new c,Ke=new c,Qe=new c,Je=new c,ts=new c,es=new c,Ct=class{constructor(){this.world=null,this.useBoundingBoxes=!1,this.dirty=!0}collisionPairs(t,e,s){throw new Error("collisionPairs not implemented for this BroadPhase class!")}needBroadphaseCollision(t,e){return!((t.collisionFilterGroup&e.collisionFilterMask)===0||(e.collisionFilterGroup&t.collisionFilterMask)===0||((t.type&q.STATIC)!==0||t.sleepState===q.SLEEPING)&&((e.type&q.STATIC)!==0||e.sleepState===q.SLEEPING))}intersectionTest(t,e,s,n){this.useBoundingBoxes?this.doBoundingBoxBroadphase(t,e,s,n):this.doBoundingSphereBroadphase(t,e,s,n)}doBoundingSphereBroadphase(t,e,s,n){let i=ss;e.position.vsub(t.position,i);let o=(t.boundingRadius+e.boundingRadius)**2;i.lengthSquared()<o&&(s.push(t),n.push(e))}doBoundingBoxBroadphase(t,e,s,n){t.aabbNeedsUpdate&&t.updateAABB(),e.aabbNeedsUpdate&&e.updateAABB(),t.aabb.overlaps(e.aabb)&&(s.push(t),n.push(e))}makePairsUnique(t,e){let s=ns,n=is,i=os,o=t.length;for(let r=0;r!==o;r++)n[r]=t[r],i[r]=e[r];t.length=0,e.length=0;for(let r=0;r!==o;r++){let a=n[r].id,l=i[r].id,d=a<l?`${a},${l}`:`${l},${a}`;s[d]=r,s.keys.push(d)}for(let r=0;r!==s.keys.length;r++){let a=s.keys.pop(),l=s[a];t.push(n[l]),e.push(i[l]),delete s[a]}}setWorld(t){}static boundingSphereCheck(t,e){let s=new c;t.position.vsub(e.position,s);let n=t.shapes[0],i=e.shapes[0];return Math.pow(n.boundingSphereRadius+i.boundingSphereRadius,2)>s.lengthSquared()}aabbQuery(t,e,s){return console.warn(".aabbQuery is not implemented in this Broadphase subclass."),[]}},ss=new c;new c;new H;new c;var ns={keys:[]},is=[],os=[];new c;var ei=new c;new c;var Ut=class extends Ct{constructor(){super()}collisionPairs(t,e,s){let n=t.bodies,i=n.length,o,r;for(let a=0;a!==i;a++)for(let l=0;l!==a;l++)o=n[a],r=n[l],this.needBroadphaseCollision(o,r)&&this.intersectionTest(o,r,e,s)}aabbQuery(t,e,s){s===void 0&&(s=[]);for(let n=0;n<t.bodies.length;n++){let i=t.bodies[n];i.aabbNeedsUpdate&&i.updateAABB(),i.aabb.overlaps(e)&&s.push(i)}return s}},dt=class{constructor(){this.rayFromWorld=new c,this.rayToWorld=new c,this.hitNormalWorld=new c,this.hitPointWorld=new c,this.hasHit=!1,this.shape=null,this.body=null,this.hitFaceIndex=-1,this.distance=-1,this.shouldStop=!1}reset(){this.rayFromWorld.setZero(),this.rayToWorld.setZero(),this.hitNormalWorld.setZero(),this.hitPointWorld.setZero(),this.hasHit=!1,this.shape=null,this.body=null,this.hitFaceIndex=-1,this.distance=-1,this.shouldStop=!1}abort(){this.shouldStop=!0}set(t,e,s,n,i,o,r){this.rayFromWorld.copy(t),this.rayToWorld.copy(e),this.hitNormalWorld.copy(s),this.hitPointWorld.copy(n),this.shape=i,this.body=o,this.distance=r}},ge,be,Ae,Be,Ee,ze,Ce,ne={CLOSEST:1,ANY:2,ALL:4};ge=N.types.SPHERE;be=N.types.PLANE;Ae=N.types.BOX;Be=N.types.CYLINDER;Ee=N.types.CONVEXPOLYHEDRON;ze=N.types.HEIGHTFIELD;Ce=N.types.TRIMESH;var X=class w{get[ge](){return this._intersectSphere}get[be](){return this._intersectPlane}get[Ae](){return this._intersectBox}get[Be](){return this._intersectConvex}get[Ee](){return this._intersectConvex}get[ze](){return this._intersectHeightfield}get[Ce](){return this._intersectTrimesh}constructor(t,e){t===void 0&&(t=new c),e===void 0&&(e=new c),this.from=t.clone(),this.to=e.clone(),this.direction=new c,this.precision=1e-4,this.checkCollisionResponse=!0,this.skipBackfaces=!1,this.collisionFilterMask=-1,this.collisionFilterGroup=-1,this.mode=w.ANY,this.result=new dt,this.hasHit=!1,this.callback=s=>{}}intersectWorld(t,e){return this.mode=e.mode||w.ANY,this.result=e.result||new dt,this.skipBackfaces=!!e.skipBackfaces,this.collisionFilterMask=typeof e.collisionFilterMask<"u"?e.collisionFilterMask:-1,this.collisionFilterGroup=typeof e.collisionFilterGroup<"u"?e.collisionFilterGroup:-1,this.checkCollisionResponse=typeof e.checkCollisionResponse<"u"?e.checkCollisionResponse:!0,e.from&&this.from.copy(e.from),e.to&&this.to.copy(e.to),this.callback=e.callback||(()=>{}),this.hasHit=!1,this.result.reset(),this.updateDirection(),this.getAABB(le),kt.length=0,t.broadphase.aabbQuery(t,le,kt),this.intersectBodies(kt),this.hasHit}intersectBody(t,e){e&&(this.result=e,this.updateDirection());let s=this.checkCollisionResponse;if(s&&!t.collisionResponse||(this.collisionFilterGroup&t.collisionFilterMask)===0||(t.collisionFilterGroup&this.collisionFilterMask)===0)return;let n=rs,i=cs;for(let o=0,r=t.shapes.length;o<r;o++){let a=t.shapes[o];if(!(s&&!a.collisionResponse)&&(t.quaternion.mult(t.shapeOrientations[o],i),t.quaternion.vmult(t.shapeOffsets[o],n),n.vadd(t.position,n),this.intersectShape(a,i,n,t),this.result.shouldStop))break}}intersectBodies(t,e){e&&(this.result=e,this.updateDirection());for(let s=0,n=t.length;!this.result.shouldStop&&s<n;s++)this.intersectBody(t[s])}updateDirection(){this.to.vsub(this.from,this.direction),this.direction.normalize()}intersectShape(t,e,s,n){let i=this.from;if(Bs(i,this.direction,s)>t.boundingSphereRadius)return;let r=this[t.type];r&&r.call(this,t,e,s,n,t)}_intersectBox(t,e,s,n,i){return this._intersectConvex(t.convexPolyhedronRepresentation,e,s,n,i)}_intersectPlane(t,e,s,n,i){let o=this.from,r=this.to,a=this.direction,l=new c(0,0,1);e.vmult(l,l);let d=new c;o.vsub(s,d);let u=d.dot(l);r.vsub(s,d);let h=d.dot(l);if(u*h>0||o.distanceTo(r)<u)return;let f=l.dot(a);if(Math.abs(f)<this.precision)return;let p=new c,y=new c,v=new c;o.vsub(s,p);let x=-l.dot(p)/f;a.scale(x,y),o.vadd(y,v),this.reportIntersection(l,v,i,n,-1)}getAABB(t){let{lowerBound:e,upperBound:s}=t,n=this.to,i=this.from;e.x=Math.min(n.x,i.x),e.y=Math.min(n.y,i.y),e.z=Math.min(n.z,i.z),s.x=Math.max(n.x,i.x),s.y=Math.max(n.y,i.y),s.z=Math.max(n.z,i.z)}_intersectHeightfield(t,e,s,n,i){t.data,t.elementSize;let o=as;o.from.copy(this.from),o.to.copy(this.to),V.pointToLocalFrame(s,e,o.from,o.from),V.pointToLocalFrame(s,e,o.to,o.to),o.updateDirection();let r=ls,a,l,d,u;a=l=0,d=u=t.data.length-1;let h=new Y;o.getAABB(h),t.getIndexOfPosition(h.lowerBound.x,h.lowerBound.y,r,!0),a=Math.max(a,r[0]),l=Math.max(l,r[1]),t.getIndexOfPosition(h.upperBound.x,h.upperBound.y,r,!0),d=Math.min(d,r[0]+1),u=Math.min(u,r[1]+1);for(let f=a;f<d;f++)for(let p=l;p<u;p++){if(this.result.shouldStop)return;if(t.getAabbAtIndex(f,p,h),!!h.overlapsRay(o)){if(t.getConvexTrianglePillar(f,p,!1),V.pointToWorldFrame(s,e,t.pillarOffset,xt),this._intersectConvex(t.pillarConvex,e,xt,n,i,he),this.result.shouldStop)return;t.getConvexTrianglePillar(f,p,!0),V.pointToWorldFrame(s,e,t.pillarOffset,xt),this._intersectConvex(t.pillarConvex,e,xt,n,i,he)}}}_intersectSphere(t,e,s,n,i){let o=this.from,r=this.to,a=t.radius,l=(r.x-o.x)**2+(r.y-o.y)**2+(r.z-o.z)**2,d=2*((r.x-o.x)*(o.x-s.x)+(r.y-o.y)*(o.y-s.y)+(r.z-o.z)*(o.z-s.z)),u=(o.x-s.x)**2+(o.y-s.y)**2+(o.z-s.z)**2-a**2,h=d**2-4*l*u,f=hs,p=ds;if(!(h<0))if(h===0)o.lerp(r,h,f),f.vsub(s,p),p.normalize(),this.reportIntersection(p,f,i,n,-1);else{let y=(-d-Math.sqrt(h))/(2*l),v=(-d+Math.sqrt(h))/(2*l);if(y>=0&&y<=1&&(o.lerp(r,y,f),f.vsub(s,p),p.normalize(),this.reportIntersection(p,f,i,n,-1)),this.result.shouldStop)return;v>=0&&v<=1&&(o.lerp(r,v,f),f.vsub(s,p),p.normalize(),this.reportIntersection(p,f,i,n,-1))}}_intersectConvex(t,e,s,n,i,o){let r=us,a=de,l=o&&o.faceList||null,d=t.faces,u=t.vertices,h=t.faceNormals,f=this.direction,p=this.from,y=this.to,v=p.distanceTo(y),x=l?l.length:d.length,m=this.result;for(let g=0;!m.shouldStop&&g<x;g++){let b=l?l[g]:g,B=d[b],z=h[b],F=e,_=s;a.copy(u[B[0]]),F.vmult(a,a),a.vadd(_,a),a.vsub(p,a),F.vmult(z,r);let R=f.dot(r);if(Math.abs(R)<this.precision)continue;let I=r.dot(a)/R;if(!(I<0)){f.scale(I,U),U.vadd(p,U),$.copy(u[B[0]]),F.vmult($,$),_.vadd($,$);for(let T=1;!m.shouldStop&&T<B.length-1;T++){K.copy(u[B[T]]),Q.copy(u[B[T+1]]),F.vmult(K,K),F.vmult(Q,Q),_.vadd(K,K),_.vadd(Q,Q);let L=U.distanceTo(p);!(w.pointInTriangle(U,$,K,Q)||w.pointInTriangle(U,K,$,Q))||L>v||this.reportIntersection(r,U,i,n,b)}}}}_intersectTrimesh(t,e,s,n,i,o){let r=ms,a=bs,l=As,d=de,u=vs,h=ys,f=ws,p=gs,y=xs,v=t.indices;t.vertices;let x=this.from,m=this.to,g=this.direction;l.position.copy(s),l.quaternion.copy(e),V.vectorToLocalFrame(s,e,g,u),V.pointToLocalFrame(s,e,x,h),V.pointToLocalFrame(s,e,m,f),f.x*=t.scale.x,f.y*=t.scale.y,f.z*=t.scale.z,h.x*=t.scale.x,h.y*=t.scale.y,h.z*=t.scale.z,f.vsub(h,u),u.normalize();let b=h.distanceSquared(f);t.tree.rayQuery(this,l,a);for(let B=0,z=a.length;!this.result.shouldStop&&B!==z;B++){let F=a[B];t.getNormal(F,r),t.getVertex(v[F*3],$),$.vsub(h,d);let _=u.dot(r),R=r.dot(d)/_;if(R<0)continue;u.scale(R,U),U.vadd(h,U),t.getVertex(v[F*3+1],K),t.getVertex(v[F*3+2],Q);let I=U.distanceSquared(h);!(w.pointInTriangle(U,K,$,Q)||w.pointInTriangle(U,$,K,Q))||I>b||(V.vectorToWorldFrame(e,r,y),V.pointToWorldFrame(s,e,U,p),this.reportIntersection(y,p,i,n,F))}a.length=0}reportIntersection(t,e,s,n,i){let o=this.from,r=this.to,a=o.distanceTo(e),l=this.result;if(!(this.skipBackfaces&&t.dot(this.direction)>0))switch(l.hitFaceIndex=typeof i<"u"?i:-1,this.mode){case w.ALL:this.hasHit=!0,l.set(o,r,t,e,s,n,a),l.hasHit=!0,this.callback(l);break;case w.CLOSEST:(a<l.distance||!l.hasHit)&&(this.hasHit=!0,l.hasHit=!0,l.set(o,r,t,e,s,n,a));break;case w.ANY:this.hasHit=!0,l.hasHit=!0,l.set(o,r,t,e,s,n,a),l.shouldStop=!0;break}}static pointInTriangle(t,e,s,n){n.vsub(e,ct),s.vsub(e,ut),t.vsub(e,Ot);let i=ct.dot(ct),o=ct.dot(ut),r=ct.dot(Ot),a=ut.dot(ut),l=ut.dot(Ot),d,u;return(d=a*r-o*l)>=0&&(u=i*l-o*r)>=0&&d+u<i*a-o*o}};X.CLOSEST=ne.CLOSEST;X.ANY=ne.ANY;X.ALL=ne.ALL;var le=new Y,kt=[],ut=new c,Ot=new c,rs=new c,cs=new H,U=new c,$=new c,K=new c,Q=new c;new c;new dt;var he={faceList:[0]},xt=new c,as=new X,ls=[],hs=new c,ds=new c,us=new c,ps=new c,fs=new c,de=new c,ms=new c,vs=new c,ys=new c,ws=new c,xs=new c,gs=new c;new Y;var bs=[],As=new V,ct=new c,gt=new c;function Bs(w,t,e){e.vsub(w,ct);let s=ct.dot(t);return t.scale(s,gt),gt.vadd(w,gt),e.distanceTo(gt)}var St=class w extends Ct{static checkBounds(t,e,s){let n,i;s===0?(n=t.position.x,i=e.position.x):s===1?(n=t.position.y,i=e.position.y):s===2&&(n=t.position.z,i=e.position.z);let o=t.boundingRadius,r=e.boundingRadius,a=n+o;return i-r<a}static insertionSortX(t){for(let e=1,s=t.length;e<s;e++){let n=t[e],i;for(i=e-1;i>=0&&!(t[i].aabb.lowerBound.x<=n.aabb.lowerBound.x);i--)t[i+1]=t[i];t[i+1]=n}return t}static insertionSortY(t){for(let e=1,s=t.length;e<s;e++){let n=t[e],i;for(i=e-1;i>=0&&!(t[i].aabb.lowerBound.y<=n.aabb.lowerBound.y);i--)t[i+1]=t[i];t[i+1]=n}return t}static insertionSortZ(t){for(let e=1,s=t.length;e<s;e++){let n=t[e],i;for(i=e-1;i>=0&&!(t[i].aabb.lowerBound.z<=n.aabb.lowerBound.z);i--)t[i+1]=t[i];t[i+1]=n}return t}constructor(t){super(),this.axisList=[],this.world=null,this.axisIndex=0;let e=this.axisList;this._addBodyHandler=s=>{e.push(s.body)},this._removeBodyHandler=s=>{let n=e.indexOf(s.body);n!==-1&&e.splice(n,1)},t&&this.setWorld(t)}setWorld(t){this.axisList.length=0;for(let e=0;e<t.bodies.length;e++)this.axisList.push(t.bodies[e]);t.removeEventListener("addBody",this._addBodyHandler),t.removeEventListener("removeBody",this._removeBodyHandler),t.addEventListener("addBody",this._addBodyHandler),t.addEventListener("removeBody",this._removeBodyHandler),this.world=t,this.dirty=!0}collisionPairs(t,e,s){let n=this.axisList,i=n.length,o=this.axisIndex,r,a;for(this.dirty&&(this.sortList(),this.dirty=!1),r=0;r!==i;r++){let l=n[r];for(a=r+1;a<i;a++){let d=n[a];if(this.needBroadphaseCollision(l,d)){if(!w.checkBounds(l,d,o))break;this.intersectionTest(l,d,e,s)}}}}sortList(){let t=this.axisList,e=this.axisIndex,s=t.length;for(let n=0;n!==s;n++){let i=t[n];i.aabbNeedsUpdate&&i.updateAABB()}e===0?w.insertionSortX(t):e===1?w.insertionSortY(t):e===2&&w.insertionSortZ(t)}autoDetectAxis(){let t=0,e=0,s=0,n=0,i=0,o=0,r=this.axisList,a=r.length,l=1/a;for(let f=0;f!==a;f++){let p=r[f],y=p.position.x;t+=y,e+=y*y;let v=p.position.y;s+=v,n+=v*v;let x=p.position.z;i+=x,o+=x*x}let d=e-t*t*l,u=n-s*s*l,h=o-i*i*l;d>u?d>h?this.axisIndex=0:this.axisIndex=2:u>h?this.axisIndex=1:this.axisIndex=2}aabbQuery(t,e,s){s===void 0&&(s=[]),this.dirty&&(this.sortList(),this.dirty=!1);let n=this.axisIndex,i="x";n===1&&(i="y"),n===2&&(i="z");let o=this.axisList;e.lowerBound[i],e.upperBound[i];for(let r=0;r<o.length;r++){let a=o[r];a.aabbNeedsUpdate&&a.updateAABB(),a.aabb.overlaps(e)&&s.push(a)}return s}},Ft=class{static defaults(t,e){t===void 0&&(t={});for(let s in e)s in t||(t[s]=e[s]);return t}},Yt=class w{constructor(t,e,s){s===void 0&&(s={}),s=Ft.defaults(s,{collideConnected:!0,wakeUpBodies:!0}),this.equations=[],this.bodyA=t,this.bodyB=e,this.id=w.idCounter++,this.collideConnected=s.collideConnected,s.wakeUpBodies&&(t&&t.wakeUp(),e&&e.wakeUp())}update(){throw new Error("method update() not implmemented in this Constraint subclass!")}enable(){let t=this.equations;for(let e=0;e<t.length;e++)t[e].enabled=!0}disable(){let t=this.equations;for(let e=0;e<t.length;e++)t[e].enabled=!1}};Yt.idCounter=0;var Nt=class{constructor(){this.spatial=new c,this.rotational=new c}multiplyElement(t){return t.spatial.dot(this.spatial)+t.rotational.dot(this.rotational)}multiplyVectors(t,e){return t.dot(this.spatial)+e.dot(this.rotational)}},yt=class w{constructor(t,e,s,n){s===void 0&&(s=-1e6),n===void 0&&(n=1e6),this.id=w.idCounter++,this.minForce=s,this.maxForce=n,this.bi=t,this.bj=e,this.a=0,this.b=0,this.eps=0,this.jacobianElementA=new Nt,this.jacobianElementB=new Nt,this.enabled=!0,this.multiplier=0,this.setSpookParams(1e7,4,1/60)}setSpookParams(t,e,s){let n=e,i=t,o=s;this.a=4/(o*(1+4*n)),this.b=4*n/(1+4*n),this.eps=4/(o*o*i*(1+4*n))}computeB(t,e,s){let n=this.computeGW(),i=this.computeGq(),o=this.computeGiMf();return-i*t-n*e-o*s}computeGq(){let t=this.jacobianElementA,e=this.jacobianElementB,s=this.bi,n=this.bj,i=s.position,o=n.position;return t.spatial.dot(i)+e.spatial.dot(o)}computeGW(){let t=this.jacobianElementA,e=this.jacobianElementB,s=this.bi,n=this.bj,i=s.velocity,o=n.velocity,r=s.angularVelocity,a=n.angularVelocity;return t.multiplyVectors(i,r)+e.multiplyVectors(o,a)}computeGWlambda(){let t=this.jacobianElementA,e=this.jacobianElementB,s=this.bi,n=this.bj,i=s.vlambda,o=n.vlambda,r=s.wlambda,a=n.wlambda;return t.multiplyVectors(i,r)+e.multiplyVectors(o,a)}computeGiMf(){let t=this.jacobianElementA,e=this.jacobianElementB,s=this.bi,n=this.bj,i=s.force,o=s.torque,r=n.force,a=n.torque,l=s.invMassSolve,d=n.invMassSolve;return i.scale(l,ue),r.scale(d,pe),s.invInertiaWorldSolve.vmult(o,fe),n.invInertiaWorldSolve.vmult(a,me),t.multiplyVectors(ue,fe)+e.multiplyVectors(pe,me)}computeGiMGt(){let t=this.jacobianElementA,e=this.jacobianElementB,s=this.bi,n=this.bj,i=s.invMassSolve,o=n.invMassSolve,r=s.invInertiaWorldSolve,a=n.invInertiaWorldSolve,l=i+o;return r.vmult(t.rotational,bt),l+=bt.dot(t.rotational),a.vmult(e.rotational,bt),l+=bt.dot(e.rotational),l}addToWlambda(t){let e=this.jacobianElementA,s=this.jacobianElementB,n=this.bi,i=this.bj,o=Es;n.vlambda.addScaledVector(n.invMassSolve*t,e.spatial,n.vlambda),i.vlambda.addScaledVector(i.invMassSolve*t,s.spatial,i.vlambda),n.invInertiaWorldSolve.vmult(e.rotational,o),n.wlambda.addScaledVector(t,o,n.wlambda),i.invInertiaWorldSolve.vmult(s.rotational,o),i.wlambda.addScaledVector(t,o,i.wlambda)}computeC(){return this.computeGiMGt()+this.eps}};yt.idCounter=0;var ue=new c,pe=new c,fe=new c,me=new c,bt=new c,Es=new c,Xt=class extends yt{constructor(t,e,s){s===void 0&&(s=1e6),super(t,e,0,s),this.restitution=0,this.ri=new c,this.rj=new c,this.ni=new c}computeB(t){let e=this.a,s=this.b,n=this.bi,i=this.bj,o=this.ri,r=this.rj,a=zs,l=Cs,d=n.velocity,u=n.angularVelocity;n.force,n.torque;let h=i.velocity,f=i.angularVelocity;i.force,i.torque;let p=Ss,y=this.jacobianElementA,v=this.jacobianElementB,x=this.ni;o.cross(x,a),r.cross(x,l),x.negate(y.spatial),a.negate(y.rotational),v.spatial.copy(x),v.rotational.copy(l),p.copy(i.position),p.vadd(r,p),p.vsub(n.position,p),p.vsub(o,p);let m=x.dot(p),g=this.restitution+1,b=g*h.dot(x)-g*d.dot(x)+f.dot(l)-u.dot(a),B=this.computeGiMf();return-m*e-b*s-t*B}getImpactVelocityAlongNormal(){let t=Fs,e=Ns,s=Is,n=_s,i=Ms;return this.bi.position.vadd(this.ri,s),this.bj.position.vadd(this.rj,n),this.bi.getVelocityAtWorldPoint(s,t),this.bj.getVelocityAtWorldPoint(n,e),t.vsub(e,i),this.ni.dot(i)}},zs=new c,Cs=new c,Ss=new c,Fs=new c,Ns=new c,Is=new c,_s=new c,Ms=new c;var si=new c,ni=new c;var ii=new c,oi=new c;new c;new c;var ri=new c,ci=new c;var ai=new c,li=new c,It=class extends yt{constructor(t,e,s){super(t,e,-s,s),this.ri=new c,this.rj=new c,this.t=new c}computeB(t){this.a;let e=this.b;this.bi,this.bj;let s=this.ri,n=this.rj,i=Ts,o=Rs,r=this.t;s.cross(r,i),n.cross(r,o);let a=this.jacobianElementA,l=this.jacobianElementB;r.negate(a.spatial),i.negate(a.rotational),l.spatial.copy(r),l.rotational.copy(o);let d=this.computeGW(),u=this.computeGiMf();return-d*e-t*u}},Ts=new c,Rs=new c,_t=class w{constructor(t,e,s){s=Ft.defaults(s,{friction:.3,restitution:.3,contactEquationStiffness:1e7,contactEquationRelaxation:3,frictionEquationStiffness:1e7,frictionEquationRelaxation:3}),this.id=w.idCounter++,this.materials=[t,e],this.friction=s.friction,this.restitution=s.restitution,this.contactEquationStiffness=s.contactEquationStiffness,this.contactEquationRelaxation=s.contactEquationRelaxation,this.frictionEquationStiffness=s.frictionEquationStiffness,this.frictionEquationRelaxation=s.frictionEquationRelaxation}};_t.idCounter=0;var Mt=class w{constructor(t){t===void 0&&(t={});let e="";typeof t=="string"&&(e=t,t={}),this.name=e,this.id=w.idCounter++,this.friction=typeof t.friction<"u"?t.friction:-1,this.restitution=typeof t.restitution<"u"?t.restitution:-1}};Mt.idCounter=0;var hi=new c,di=new c,ui=new c,pi=new c,fi=new c,mi=new c,vi=new c,yi=new c,wi=new c,xi=new c,gi=new c;var bi=new c,Ai=new c;new c;new c;new c;var Bi=new c,Ei=new c,zi=new c;new X;new c;var Ci=new c,Si=new c,Fi=[new c(1,0,0),new c(0,1,0),new c(0,0,1)],Ni=new c;var Ii=new c,_i=new c,Mi=new c;var Ti=new c,Ri=new c,Pi=new c,qi=new c;var Li=new c,Wi=new c,Vi=new c;var ji=new c,ki=new c;var Oi=new c,Hi=new c,Gi=new c,Di=new c,Ui=new c,Yi=new c,Xi=new c;var Tt=class extends N{constructor(){super({type:N.types.PLANE}),this.worldNormal=new c,this.worldNormalNeedsUpdate=!0,this.boundingSphereRadius=Number.MAX_VALUE}computeWorldNormal(t){let e=this.worldNormal;e.set(0,0,1),t.vmult(e,e),this.worldNormalNeedsUpdate=!1}calculateLocalInertia(t,e){return e===void 0&&(e=new c),e}volume(){return Number.MAX_VALUE}calculateWorldAABB(t,e,s,n){J.set(0,0,1),e.vmult(J,J);let i=Number.MAX_VALUE;s.set(-i,-i,-i),n.set(i,i,i),J.x===1?n.x=t.x:J.x===-1&&(s.x=t.x),J.y===1?n.y=t.y:J.y===-1&&(s.y=t.y),J.z===1?n.z=t.z:J.z===-1&&(s.z=t.z)}updateBoundingSphereRadius(){this.boundingSphereRadius=Number.MAX_VALUE}},J=new c;var $i=new c,Zi=new c,Ki=new c,Qi=new c,Ji=new c,to=new c,eo=new c,so=new c,no=new c;var io=new c,oo=new Y;var ro=new c,co=new Y,ao=new c,lo=new c,ho=new c,uo=new c,po=new c,fo=new c,mo=new c,vo=new Y,yo=new c,wo=new V,xo=new Y,$t=class{constructor(){this.equations=[]}solve(t,e){return 0}addEquation(t){t.enabled&&!t.bi.isTrigger&&!t.bj.isTrigger&&this.equations.push(t)}removeEquation(t){let e=this.equations,s=e.indexOf(t);s!==-1&&e.splice(s,1)}removeAllEquations(){this.equations.length=0}},Zt=class extends $t{constructor(){super(),this.iterations=10,this.tolerance=1e-7}solve(t,e){let s=0,n=this.iterations,i=this.tolerance*this.tolerance,o=this.equations,r=o.length,a=e.bodies,l=a.length,d=t,u,h,f,p,y,v;if(r!==0)for(let b=0;b!==l;b++)a[b].updateSolveMassProperties();let x=qs,m=Ls,g=Ps;x.length=r,m.length=r,g.length=r;for(let b=0;b!==r;b++){let B=o[b];g[b]=0,m[b]=B.computeB(d),x[b]=1/B.computeC()}if(r!==0){for(let z=0;z!==l;z++){let F=a[z],_=F.vlambda,R=F.wlambda;_.set(0,0,0),R.set(0,0,0)}for(s=0;s!==n;s++){p=0;for(let z=0;z!==r;z++){let F=o[z];u=m[z],h=x[z],v=g[z],y=F.computeGWlambda(),f=h*(u-y-F.eps*v),v+f<F.minForce?f=F.minForce-v:v+f>F.maxForce&&(f=F.maxForce-v),g[z]+=f,p+=f>0?f:-f,F.addToWlambda(f)}if(p*p<i)break}for(let z=0;z!==l;z++){let F=a[z],_=F.velocity,R=F.angularVelocity;F.vlambda.vmul(F.linearFactor,F.vlambda),_.vadd(F.vlambda,_),F.wlambda.vmul(F.angularFactor,F.wlambda),R.vadd(F.wlambda,R)}let b=o.length,B=1/d;for(;b--;)o[b].multiplier=g[b]*B}return s}},Ps=[],qs=[],Ls=[];var go=q.STATIC;var Kt=class{constructor(){this.objects=[],this.type=Object}release(){let t=arguments.length;for(let e=0;e!==t;e++)this.objects.push(e<0||arguments.length<=e?void 0:arguments[e]);return this}get(){return this.objects.length===0?this.constructObject():this.objects.pop()}constructObject(){throw new Error("constructObject() not implemented in this Pool subclass yet!")}resize(t){let e=this.objects;for(;e.length>t;)e.pop();for(;e.length<t;)e.push(this.constructObject());return this}},Qt=class extends Kt{constructor(){super(...arguments),this.type=c}constructObject(){return new c}},j={sphereSphere:N.types.SPHERE,spherePlane:N.types.SPHERE|N.types.PLANE,boxBox:N.types.BOX|N.types.BOX,sphereBox:N.types.SPHERE|N.types.BOX,planeBox:N.types.PLANE|N.types.BOX,convexConvex:N.types.CONVEXPOLYHEDRON,sphereConvex:N.types.SPHERE|N.types.CONVEXPOLYHEDRON,planeConvex:N.types.PLANE|N.types.CONVEXPOLYHEDRON,boxConvex:N.types.BOX|N.types.CONVEXPOLYHEDRON,sphereHeightfield:N.types.SPHERE|N.types.HEIGHTFIELD,boxHeightfield:N.types.BOX|N.types.HEIGHTFIELD,convexHeightfield:N.types.CONVEXPOLYHEDRON|N.types.HEIGHTFIELD,sphereParticle:N.types.PARTICLE|N.types.SPHERE,planeParticle:N.types.PLANE|N.types.PARTICLE,boxParticle:N.types.BOX|N.types.PARTICLE,convexParticle:N.types.PARTICLE|N.types.CONVEXPOLYHEDRON,cylinderCylinder:N.types.CYLINDER,sphereCylinder:N.types.SPHERE|N.types.CYLINDER,planeCylinder:N.types.PLANE|N.types.CYLINDER,boxCylinder:N.types.BOX|N.types.CYLINDER,convexCylinder:N.types.CONVEXPOLYHEDRON|N.types.CYLINDER,heightfieldCylinder:N.types.HEIGHTFIELD|N.types.CYLINDER,particleCylinder:N.types.PARTICLE|N.types.CYLINDER,sphereTrimesh:N.types.SPHERE|N.types.TRIMESH,planeTrimesh:N.types.PLANE|N.types.TRIMESH},Jt=class{get[j.sphereSphere](){return this.sphereSphere}get[j.spherePlane](){return this.spherePlane}get[j.boxBox](){return this.boxBox}get[j.sphereBox](){return this.sphereBox}get[j.planeBox](){return this.planeBox}get[j.convexConvex](){return this.convexConvex}get[j.sphereConvex](){return this.sphereConvex}get[j.planeConvex](){return this.planeConvex}get[j.boxConvex](){return this.boxConvex}get[j.sphereHeightfield](){return this.sphereHeightfield}get[j.boxHeightfield](){return this.boxHeightfield}get[j.convexHeightfield](){return this.convexHeightfield}get[j.sphereParticle](){return this.sphereParticle}get[j.planeParticle](){return this.planeParticle}get[j.boxParticle](){return this.boxParticle}get[j.convexParticle](){return this.convexParticle}get[j.cylinderCylinder](){return this.convexConvex}get[j.sphereCylinder](){return this.sphereConvex}get[j.planeCylinder](){return this.planeConvex}get[j.boxCylinder](){return this.boxConvex}get[j.convexCylinder](){return this.convexConvex}get[j.heightfieldCylinder](){return this.heightfieldCylinder}get[j.particleCylinder](){return this.particleCylinder}get[j.sphereTrimesh](){return this.sphereTrimesh}get[j.planeTrimesh](){return this.planeTrimesh}constructor(t){this.contactPointPool=[],this.frictionEquationPool=[],this.result=[],this.frictionResult=[],this.v3pool=new Qt,this.world=t,this.currentContactMaterial=t.defaultContactMaterial,this.enableFrictionReduction=!1}createContactEquation(t,e,s,n,i,o){let r;this.contactPointPool.length?(r=this.contactPointPool.pop(),r.bi=t,r.bj=e):r=new Xt(t,e),r.enabled=t.collisionResponse&&e.collisionResponse&&s.collisionResponse&&n.collisionResponse;let a=this.currentContactMaterial;r.restitution=a.restitution,r.setSpookParams(a.contactEquationStiffness,a.contactEquationRelaxation,this.world.dt);let l=s.material||t.material,d=n.material||e.material;return l&&d&&l.restitution>=0&&d.restitution>=0&&(r.restitution=l.restitution*d.restitution),r.si=i||s,r.sj=o||n,r}createFrictionEquationsFromContact(t,e){let s=t.bi,n=t.bj,i=t.si,o=t.sj,r=this.world,a=this.currentContactMaterial,l=a.friction,d=i.material||s.material,u=o.material||n.material;if(d&&u&&d.friction>=0&&u.friction>=0&&(l=d.friction*u.friction),l>0){let h=l*(r.frictionGravity||r.gravity).length(),f=s.invMass+n.invMass;f>0&&(f=1/f);let p=this.frictionEquationPool,y=p.length?p.pop():new It(s,n,h*f),v=p.length?p.pop():new It(s,n,h*f);return y.bi=v.bi=s,y.bj=v.bj=n,y.minForce=v.minForce=-h*f,y.maxForce=v.maxForce=h*f,y.ri.copy(t.ri),y.rj.copy(t.rj),v.ri.copy(t.ri),v.rj.copy(t.rj),t.ni.tangents(y.t,v.t),y.setSpookParams(a.frictionEquationStiffness,a.frictionEquationRelaxation,r.dt),v.setSpookParams(a.frictionEquationStiffness,a.frictionEquationRelaxation,r.dt),y.enabled=v.enabled=t.enabled,e.push(y,v),!0}return!1}createFrictionFromAverage(t){let e=this.result[this.result.length-1];if(!this.createFrictionEquationsFromContact(e,this.frictionResult)||t===1)return;let s=this.frictionResult[this.frictionResult.length-2],n=this.frictionResult[this.frictionResult.length-1];rt.setZero(),lt.setZero(),ht.setZero();let i=e.bi;e.bj;for(let r=0;r!==t;r++)e=this.result[this.result.length-1-r],e.bi!==i?(rt.vadd(e.ni,rt),lt.vadd(e.ri,lt),ht.vadd(e.rj,ht)):(rt.vsub(e.ni,rt),lt.vadd(e.rj,lt),ht.vadd(e.ri,ht));let o=1/t;lt.scale(o,s.ri),ht.scale(o,s.rj),n.ri.copy(s.ri),n.rj.copy(s.rj),rt.normalize(),rt.tangents(s.t,n.t)}getContacts(t,e,s,n,i,o,r){this.contactPointPool=i,this.frictionEquationPool=r,this.result=n,this.frictionResult=o;let a=js,l=ks,d=Ws,u=Vs;for(let h=0,f=t.length;h!==f;h++){let p=t[h],y=e[h],v=null;p.material&&y.material&&(v=s.getContactMaterial(p.material,y.material)||null);let x=p.type&q.KINEMATIC&&y.type&q.STATIC||p.type&q.STATIC&&y.type&q.KINEMATIC||p.type&q.KINEMATIC&&y.type&q.KINEMATIC;for(let m=0;m<p.shapes.length;m++){p.quaternion.mult(p.shapeOrientations[m],a),p.quaternion.vmult(p.shapeOffsets[m],d),d.vadd(p.position,d);let g=p.shapes[m];for(let b=0;b<y.shapes.length;b++){y.quaternion.mult(y.shapeOrientations[b],l),y.quaternion.vmult(y.shapeOffsets[b],u),u.vadd(y.position,u);let B=y.shapes[b];if(!(g.collisionFilterMask&B.collisionFilterGroup&&B.collisionFilterMask&g.collisionFilterGroup)||d.distanceTo(u)>g.boundingSphereRadius+B.boundingSphereRadius)continue;let z=null;g.material&&B.material&&(z=s.getContactMaterial(g.material,B.material)||null),this.currentContactMaterial=z||v||s.defaultContactMaterial;let F=g.type|B.type,_=this[F];if(_){let R=!1;g.type<B.type?R=_.call(this,g,B,d,u,a,l,p,y,g,B,x):R=_.call(this,B,g,u,d,l,a,y,p,g,B,x),R&&x&&(s.shapeOverlapKeeper.set(g.id,B.id),s.bodyOverlapKeeper.set(p.id,y.id))}}}}}sphereSphere(t,e,s,n,i,o,r,a,l,d,u){if(u)return s.distanceSquared(n)<(t.radius+e.radius)**2;let h=this.createContactEquation(r,a,t,e,l,d);n.vsub(s,h.ni),h.ni.normalize(),h.ri.copy(h.ni),h.rj.copy(h.ni),h.ri.scale(t.radius,h.ri),h.rj.scale(-e.radius,h.rj),h.ri.vadd(s,h.ri),h.ri.vsub(r.position,h.ri),h.rj.vadd(n,h.rj),h.rj.vsub(a.position,h.rj),this.result.push(h),this.createFrictionEquationsFromContact(h,this.frictionResult)}spherePlane(t,e,s,n,i,o,r,a,l,d,u){let h=this.createContactEquation(r,a,t,e,l,d);if(h.ni.set(0,0,1),o.vmult(h.ni,h.ni),h.ni.negate(h.ni),h.ni.normalize(),h.ni.scale(t.radius,h.ri),s.vsub(n,At),h.ni.scale(h.ni.dot(At),ve),At.vsub(ve,h.rj),-At.dot(h.ni)<=t.radius){if(u)return!0;let f=h.ri,p=h.rj;f.vadd(s,f),f.vsub(r.position,f),p.vadd(n,p),p.vsub(a.position,p),this.result.push(h),this.createFrictionEquationsFromContact(h,this.frictionResult)}}boxBox(t,e,s,n,i,o,r,a,l,d,u){return t.convexPolyhedronRepresentation.material=t.material,e.convexPolyhedronRepresentation.material=e.material,t.convexPolyhedronRepresentation.collisionResponse=t.collisionResponse,e.convexPolyhedronRepresentation.collisionResponse=e.collisionResponse,this.convexConvex(t.convexPolyhedronRepresentation,e.convexPolyhedronRepresentation,s,n,i,o,r,a,t,e,u)}sphereBox(t,e,s,n,i,o,r,a,l,d,u){let h=this.v3pool,f=fn;s.vsub(n,Bt),e.getSideNormals(f,o);let p=t.radius,y=!1,v=vn,x=yn,m=wn,g=null,b=0,B=0,z=0,F=null;for(let E=0,k=f.length;E!==k&&y===!1;E++){let P=dn;P.copy(f[E]);let W=P.length();P.normalize();let D=Bt.dot(P);if(D<W+p&&D>0){let G=un,M=pn;G.copy(f[(E+1)%3]),M.copy(f[(E+2)%3]);let at=G.length(),wt=M.length();G.normalize(),M.normalize();let qt=Bt.dot(G),Lt=Bt.dot(M);if(qt<at&&qt>-at&&Lt<wt&&Lt>-wt){let ie=Math.abs(D-W-p);if((F===null||ie<F)&&(F=ie,B=qt,z=Lt,g=W,v.copy(P),x.copy(G),m.copy(M),b++,u))return!0}}}if(b){y=!0;let E=this.createContactEquation(r,a,t,e,l,d);v.scale(-p,E.ri),E.ni.copy(v),E.ni.negate(E.ni),v.scale(g,v),x.scale(B,x),v.vadd(x,v),m.scale(z,m),v.vadd(m,E.rj),E.ri.vadd(s,E.ri),E.ri.vsub(r.position,E.ri),E.rj.vadd(n,E.rj),E.rj.vsub(a.position,E.rj),this.result.push(E),this.createFrictionEquationsFromContact(E,this.frictionResult)}let _=h.get(),R=mn;for(let E=0;E!==2&&!y;E++)for(let k=0;k!==2&&!y;k++)for(let P=0;P!==2&&!y;P++)if(_.set(0,0,0),E?_.vadd(f[0],_):_.vsub(f[0],_),k?_.vadd(f[1],_):_.vsub(f[1],_),P?_.vadd(f[2],_):_.vsub(f[2],_),n.vadd(_,R),R.vsub(s,R),R.lengthSquared()<p*p){if(u)return!0;y=!0;let W=this.createContactEquation(r,a,t,e,l,d);W.ri.copy(R),W.ri.normalize(),W.ni.copy(W.ri),W.ri.scale(p,W.ri),W.rj.copy(_),W.ri.vadd(s,W.ri),W.ri.vsub(r.position,W.ri),W.rj.vadd(n,W.rj),W.rj.vsub(a.position,W.rj),this.result.push(W),this.createFrictionEquationsFromContact(W,this.frictionResult)}h.release(_),_=null;let I=h.get(),T=h.get(),L=h.get(),A=h.get(),S=h.get(),C=f.length;for(let E=0;E!==C&&!y;E++)for(let k=0;k!==C&&!y;k++)if(E%3!==k%3){f[k].cross(f[E],I),I.normalize(),f[E].vadd(f[k],T),L.copy(s),L.vsub(T,L),L.vsub(n,L);let P=L.dot(I);I.scale(P,A);let W=0;for(;W===E%3||W===k%3;)W++;S.copy(s),S.vsub(A,S),S.vsub(T,S),S.vsub(n,S);let D=Math.abs(P),G=S.length();if(D<f[W].length()&&G<p){if(u)return!0;y=!0;let M=this.createContactEquation(r,a,t,e,l,d);T.vadd(A,M.rj),M.rj.copy(M.rj),S.negate(M.ni),M.ni.normalize(),M.ri.copy(M.rj),M.ri.vadd(n,M.ri),M.ri.vsub(s,M.ri),M.ri.normalize(),M.ri.scale(p,M.ri),M.ri.vadd(s,M.ri),M.ri.vsub(r.position,M.ri),M.rj.vadd(n,M.rj),M.rj.vsub(a.position,M.rj),this.result.push(M),this.createFrictionEquationsFromContact(M,this.frictionResult)}}h.release(I,T,L,A,S)}planeBox(t,e,s,n,i,o,r,a,l,d,u){return e.convexPolyhedronRepresentation.material=e.material,e.convexPolyhedronRepresentation.collisionResponse=e.collisionResponse,e.convexPolyhedronRepresentation.id=e.id,this.planeConvex(t,e.convexPolyhedronRepresentation,s,n,i,o,r,a,t,e,u)}convexConvex(t,e,s,n,i,o,r,a,l,d,u,h,f){let p=Tn;if(!(s.distanceTo(n)>t.boundingSphereRadius+e.boundingSphereRadius)&&t.findSeparatingAxis(e,s,i,n,o,p,h,f)){let y=[],v=Rn;t.clipAgainstHull(s,i,e,n,o,p,-100,100,y);let x=0;for(let m=0;m!==y.length;m++){if(u)return!0;let g=this.createContactEquation(r,a,t,e,l,d),b=g.ri,B=g.rj;p.negate(g.ni),y[m].normal.negate(v),v.scale(y[m].depth,v),y[m].point.vadd(v,b),B.copy(y[m].point),b.vsub(s,b),B.vsub(n,B),b.vadd(s,b),b.vsub(r.position,b),B.vadd(n,B),B.vsub(a.position,B),this.result.push(g),x++,this.enableFrictionReduction||this.createFrictionEquationsFromContact(g,this.frictionResult)}this.enableFrictionReduction&&x&&this.createFrictionFromAverage(x)}}sphereConvex(t,e,s,n,i,o,r,a,l,d,u){let h=this.v3pool;s.vsub(n,xn);let f=e.faceNormals,p=e.faces,y=e.vertices,v=t.radius,x=!1;for(let m=0;m!==y.length;m++){let g=y[m],b=Bn;o.vmult(g,b),n.vadd(b,b);let B=An;if(b.vsub(s,B),B.lengthSquared()<v*v){if(u)return!0;x=!0;let z=this.createContactEquation(r,a,t,e,l,d);z.ri.copy(B),z.ri.normalize(),z.ni.copy(z.ri),z.ri.scale(v,z.ri),b.vsub(n,z.rj),z.ri.vadd(s,z.ri),z.ri.vsub(r.position,z.ri),z.rj.vadd(n,z.rj),z.rj.vsub(a.position,z.rj),this.result.push(z),this.createFrictionEquationsFromContact(z,this.frictionResult);return}}for(let m=0,g=p.length;m!==g&&x===!1;m++){let b=f[m],B=p[m],z=En;o.vmult(b,z);let F=zn;o.vmult(y[B[0]],F),F.vadd(n,F);let _=Cn;z.scale(-v,_),s.vadd(_,_);let R=Sn;_.vsub(F,R);let I=R.dot(z),T=Fn;if(s.vsub(F,T),I<0&&T.dot(z)>0){let L=[];for(let A=0,S=B.length;A!==S;A++){let C=h.get();o.vmult(y[B[A]],C),n.vadd(C,C),L.push(C)}if(hn(L,z,s)){if(u)return!0;x=!0;let A=this.createContactEquation(r,a,t,e,l,d);z.scale(-v,A.ri),z.negate(A.ni);let S=h.get();z.scale(-I,S);let C=h.get();z.scale(-v,C),s.vsub(n,A.rj),A.rj.vadd(C,A.rj),A.rj.vadd(S,A.rj),A.rj.vadd(n,A.rj),A.rj.vsub(a.position,A.rj),A.ri.vadd(s,A.ri),A.ri.vsub(r.position,A.ri),h.release(S),h.release(C),this.result.push(A),this.createFrictionEquationsFromContact(A,this.frictionResult);for(let E=0,k=L.length;E!==k;E++)h.release(L[E]);return}else for(let A=0;A!==B.length;A++){let S=h.get(),C=h.get();o.vmult(y[B[(A+1)%B.length]],S),o.vmult(y[B[(A+2)%B.length]],C),n.vadd(S,S),n.vadd(C,C);let E=gn;C.vsub(S,E);let k=bn;E.unit(k);let P=h.get(),W=h.get();s.vsub(S,W);let D=W.dot(k);k.scale(D,P),P.vadd(S,P);let G=h.get();if(P.vsub(s,G),D>0&&D*D<E.lengthSquared()&&G.lengthSquared()<v*v){if(u)return!0;let M=this.createContactEquation(r,a,t,e,l,d);P.vsub(n,M.rj),P.vsub(s,M.ni),M.ni.normalize(),M.ni.scale(v,M.ri),M.rj.vadd(n,M.rj),M.rj.vsub(a.position,M.rj),M.ri.vadd(s,M.ri),M.ri.vsub(r.position,M.ri),this.result.push(M),this.createFrictionEquationsFromContact(M,this.frictionResult);for(let at=0,wt=L.length;at!==wt;at++)h.release(L[at]);h.release(S),h.release(C),h.release(P),h.release(G),h.release(W);return}h.release(S),h.release(C),h.release(P),h.release(G),h.release(W)}for(let A=0,S=L.length;A!==S;A++)h.release(L[A])}}}planeConvex(t,e,s,n,i,o,r,a,l,d,u){let h=Nn,f=In;f.set(0,0,1),i.vmult(f,f);let p=0,y=_n;for(let v=0;v!==e.vertices.length;v++)if(h.copy(e.vertices[v]),o.vmult(h,h),n.vadd(h,h),h.vsub(s,y),f.dot(y)<=0){if(u)return!0;let m=this.createContactEquation(r,a,t,e,l,d),g=Mn;f.scale(f.dot(y),g),h.vsub(g,g),g.vsub(s,m.ri),m.ni.copy(f),h.vsub(n,m.rj),m.ri.vadd(s,m.ri),m.ri.vsub(r.position,m.ri),m.rj.vadd(n,m.rj),m.rj.vsub(a.position,m.rj),this.result.push(m),p++,this.enableFrictionReduction||this.createFrictionEquationsFromContact(m,this.frictionResult)}this.enableFrictionReduction&&p&&this.createFrictionFromAverage(p)}boxConvex(t,e,s,n,i,o,r,a,l,d,u){return t.convexPolyhedronRepresentation.material=t.material,t.convexPolyhedronRepresentation.collisionResponse=t.collisionResponse,this.convexConvex(t.convexPolyhedronRepresentation,e,s,n,i,o,r,a,t,e,u)}sphereHeightfield(t,e,s,n,i,o,r,a,l,d,u){let h=e.data,f=t.radius,p=e.elementSize,y=Un,v=Dn;V.pointToLocalFrame(n,o,s,v);let x=Math.floor((v.x-f)/p)-1,m=Math.ceil((v.x+f)/p)+1,g=Math.floor((v.y-f)/p)-1,b=Math.ceil((v.y+f)/p)+1;if(m<0||b<0||x>h.length||g>h[0].length)return;x<0&&(x=0),m<0&&(m=0),g<0&&(g=0),b<0&&(b=0),x>=h.length&&(x=h.length-1),m>=h.length&&(m=h.length-1),b>=h[0].length&&(b=h[0].length-1),g>=h[0].length&&(g=h[0].length-1);let B=[];e.getRectMinMax(x,g,m,b,B);let z=B[0],F=B[1];if(v.z-f>F||v.z+f<z)return;let _=this.result;for(let R=x;R<m;R++)for(let I=g;I<b;I++){let T=_.length,L=!1;if(e.getConvexTrianglePillar(R,I,!1),V.pointToWorldFrame(n,o,e.pillarOffset,y),s.distanceTo(y)<e.pillarConvex.boundingSphereRadius+t.boundingSphereRadius&&(L=this.sphereConvex(t,e.pillarConvex,s,y,i,o,r,a,t,e,u)),u&&L||(e.getConvexTrianglePillar(R,I,!0),V.pointToWorldFrame(n,o,e.pillarOffset,y),s.distanceTo(y)<e.pillarConvex.boundingSphereRadius+t.boundingSphereRadius&&(L=this.sphereConvex(t,e.pillarConvex,s,y,i,o,r,a,t,e,u)),u&&L))return!0;if(_.length-T>2)return}}boxHeightfield(t,e,s,n,i,o,r,a,l,d,u){return t.convexPolyhedronRepresentation.material=t.material,t.convexPolyhedronRepresentation.collisionResponse=t.collisionResponse,this.convexHeightfield(t.convexPolyhedronRepresentation,e,s,n,i,o,r,a,t,e,u)}convexHeightfield(t,e,s,n,i,o,r,a,l,d,u){let h=e.data,f=e.elementSize,p=t.boundingSphereRadius,y=Hn,v=Gn,x=On;V.pointToLocalFrame(n,o,s,x);let m=Math.floor((x.x-p)/f)-1,g=Math.ceil((x.x+p)/f)+1,b=Math.floor((x.y-p)/f)-1,B=Math.ceil((x.y+p)/f)+1;if(g<0||B<0||m>h.length||b>h[0].length)return;m<0&&(m=0),g<0&&(g=0),b<0&&(b=0),B<0&&(B=0),m>=h.length&&(m=h.length-1),g>=h.length&&(g=h.length-1),B>=h[0].length&&(B=h[0].length-1),b>=h[0].length&&(b=h[0].length-1);let z=[];e.getRectMinMax(m,b,g,B,z);let F=z[0],_=z[1];if(!(x.z-p>_||x.z+p<F))for(let R=m;R<g;R++)for(let I=b;I<B;I++){let T=!1;if(e.getConvexTrianglePillar(R,I,!1),V.pointToWorldFrame(n,o,e.pillarOffset,y),s.distanceTo(y)<e.pillarConvex.boundingSphereRadius+t.boundingSphereRadius&&(T=this.convexConvex(t,e.pillarConvex,s,y,i,o,r,a,null,null,u,v,null)),u&&T||(e.getConvexTrianglePillar(R,I,!0),V.pointToWorldFrame(n,o,e.pillarOffset,y),s.distanceTo(y)<e.pillarConvex.boundingSphereRadius+t.boundingSphereRadius&&(T=this.convexConvex(t,e.pillarConvex,s,y,i,o,r,a,null,null,u,v,null)),u&&T))return!0}}sphereParticle(t,e,s,n,i,o,r,a,l,d,u){let h=Wn;if(h.set(0,0,1),n.vsub(s,h),h.lengthSquared()<=t.radius*t.radius){if(u)return!0;let p=this.createContactEquation(a,r,e,t,l,d);h.normalize(),p.rj.copy(h),p.rj.scale(t.radius,p.rj),p.ni.copy(h),p.ni.negate(p.ni),p.ri.set(0,0,0),this.result.push(p),this.createFrictionEquationsFromContact(p,this.frictionResult)}}planeParticle(t,e,s,n,i,o,r,a,l,d,u){let h=Pn;h.set(0,0,1),r.quaternion.vmult(h,h);let f=qn;if(n.vsub(r.position,f),h.dot(f)<=0){if(u)return!0;let y=this.createContactEquation(a,r,e,t,l,d);y.ni.copy(h),y.ni.negate(y.ni),y.ri.set(0,0,0);let v=Ln;h.scale(h.dot(n),v),n.vsub(v,v),y.rj.copy(v),this.result.push(y),this.createFrictionEquationsFromContact(y,this.frictionResult)}}boxParticle(t,e,s,n,i,o,r,a,l,d,u){return t.convexPolyhedronRepresentation.material=t.material,t.convexPolyhedronRepresentation.collisionResponse=t.collisionResponse,this.convexParticle(t.convexPolyhedronRepresentation,e,s,n,i,o,r,a,t,e,u)}convexParticle(t,e,s,n,i,o,r,a,l,d,u){let h=-1,f=jn,p=kn,y=null,v=Vn;if(v.copy(n),v.vsub(s,v),i.conjugate(ye),ye.vmult(v,v),t.pointIsInside(v)){t.worldVerticesNeedsUpdate&&t.computeWorldVertices(s,i),t.worldFaceNormalsNeedsUpdate&&t.computeWorldFaceNormals(i);for(let x=0,m=t.faces.length;x!==m;x++){let g=[t.worldVertices[t.faces[x][0]]],b=t.worldFaceNormals[x];n.vsub(g[0],we);let B=-b.dot(we);if(y===null||Math.abs(B)<Math.abs(y)){if(u)return!0;y=B,h=x,f.copy(b)}}if(h!==-1){let x=this.createContactEquation(a,r,e,t,l,d);f.scale(y,p),p.vadd(n,p),p.vsub(s,p),x.rj.copy(p),f.negate(x.ni),x.ri.set(0,0,0);let m=x.ri,g=x.rj;m.vadd(n,m),m.vsub(a.position,m),g.vadd(s,g),g.vsub(r.position,g),this.result.push(x),this.createFrictionEquationsFromContact(x,this.frictionResult)}else console.warn("Point found inside convex, but did not find penetrating face!")}}heightfieldCylinder(t,e,s,n,i,o,r,a,l,d,u){return this.convexHeightfield(e,t,n,s,o,i,a,r,l,d,u)}particleCylinder(t,e,s,n,i,o,r,a,l,d,u){return this.convexParticle(e,t,n,s,o,i,a,r,l,d,u)}sphereTrimesh(t,e,s,n,i,o,r,a,l,d,u){let h=$s,f=Zs,p=Ks,y=Qs,v=Js,x=tn,m=on,g=Xs,b=Us,B=rn;V.pointToLocalFrame(n,o,s,v);let z=t.radius;m.lowerBound.set(v.x-z,v.y-z,v.z-z),m.upperBound.set(v.x+z,v.y+z,v.z+z),e.getTrianglesInAABB(m,B);let F=Ys,_=t.radius*t.radius;for(let A=0;A<B.length;A++)for(let S=0;S<3;S++)if(e.getVertex(e.indices[B[A]*3+S],F),F.vsub(v,b),b.lengthSquared()<=_){if(g.copy(F),V.pointToWorldFrame(n,o,g,F),F.vsub(s,b),u)return!0;let C=this.createContactEquation(r,a,t,e,l,d);C.ni.copy(b),C.ni.normalize(),C.ri.copy(C.ni),C.ri.scale(t.radius,C.ri),C.ri.vadd(s,C.ri),C.ri.vsub(r.position,C.ri),C.rj.copy(F),C.rj.vsub(a.position,C.rj),this.result.push(C),this.createFrictionEquationsFromContact(C,this.frictionResult)}for(let A=0;A<B.length;A++)for(let S=0;S<3;S++){e.getVertex(e.indices[B[A]*3+S],h),e.getVertex(e.indices[B[A]*3+(S+1)%3],f),f.vsub(h,p),v.vsub(f,x);let C=x.dot(p);v.vsub(h,x);let E=x.dot(p);if(E>0&&C<0&&(v.vsub(h,x),y.copy(p),y.normalize(),E=x.dot(y),y.scale(E,x),x.vadd(h,x),x.distanceTo(v)<t.radius)){if(u)return!0;let P=this.createContactEquation(r,a,t,e,l,d);x.vsub(v,P.ni),P.ni.normalize(),P.ni.scale(t.radius,P.ri),P.ri.vadd(s,P.ri),P.ri.vsub(r.position,P.ri),V.pointToWorldFrame(n,o,x,x),x.vsub(a.position,P.rj),V.vectorToWorldFrame(o,P.ni,P.ni),V.vectorToWorldFrame(o,P.ri,P.ri),this.result.push(P),this.createFrictionEquationsFromContact(P,this.frictionResult)}}let R=en,I=sn,T=nn,L=Ds;for(let A=0,S=B.length;A!==S;A++){e.getTriangleVertices(B[A],R,I,T),e.getNormal(B[A],L),v.vsub(R,x);let C=x.dot(L);if(L.scale(C,x),v.vsub(x,x),C=x.distanceTo(v),X.pointInTriangle(x,R,I,T)&&C<t.radius){if(u)return!0;let E=this.createContactEquation(r,a,t,e,l,d);x.vsub(v,E.ni),E.ni.normalize(),E.ni.scale(t.radius,E.ri),E.ri.vadd(s,E.ri),E.ri.vsub(r.position,E.ri),V.pointToWorldFrame(n,o,x,x),x.vsub(a.position,E.rj),V.vectorToWorldFrame(o,E.ni,E.ni),V.vectorToWorldFrame(o,E.ri,E.ri),this.result.push(E),this.createFrictionEquationsFromContact(E,this.frictionResult)}}B.length=0}planeTrimesh(t,e,s,n,i,o,r,a,l,d,u){let h=new c,f=Os;f.set(0,0,1),i.vmult(f,f);for(let p=0;p<e.vertices.length/3;p++){e.getVertex(p,h);let y=new c;y.copy(h),V.pointToWorldFrame(n,o,y,h);let v=Hs;if(h.vsub(s,v),f.dot(v)<=0){if(u)return!0;let m=this.createContactEquation(r,a,t,e,l,d);m.ni.copy(f);let g=Gs;f.scale(v.dot(f),g),h.vsub(g,g),m.ri.copy(g),m.ri.vsub(r.position,m.ri),m.rj.copy(h),m.rj.vsub(a.position,m.rj),this.result.push(m),this.createFrictionEquationsFromContact(m,this.frictionResult)}}}},rt=new c,lt=new c,ht=new c,Ws=new c,Vs=new c,js=new H,ks=new H,Os=new c,Hs=new c,Gs=new c,Ds=new c,Us=new c;new c;var Ys=new c,Xs=new c,$s=new c,Zs=new c,Ks=new c,Qs=new c,Js=new c,tn=new c,en=new c,sn=new c,nn=new c,on=new Y,rn=[],At=new c,ve=new c,cn=new c,an=new c,ln=new c;function hn(w,t,e){let s=null,n=w.length;for(let i=0;i!==n;i++){let o=w[i],r=cn;w[(i+1)%n].vsub(o,r);let a=an;r.cross(t,a);let l=ln;e.vsub(o,l);let d=a.dot(l);if(s===null||d>0&&s===!0||d<=0&&s===!1){s===null&&(s=d>0);continue}else return!1}return!0}var Bt=new c,dn=new c,un=new c,pn=new c,fn=[new c,new c,new c,new c,new c,new c],mn=new c,vn=new c,yn=new c,wn=new c,xn=new c,gn=new c,bn=new c,An=new c,Bn=new c,En=new c,zn=new c,Cn=new c,Sn=new c,Fn=new c;new c;new c;var Nn=new c,In=new c,_n=new c,Mn=new c,Tn=new c,Rn=new c,Pn=new c,qn=new c,Ln=new c,Wn=new c,ye=new H,Vn=new c;new c;var jn=new c,we=new c,kn=new c,On=new c,Hn=new c,Gn=[0],Dn=new c,Un=new c,Rt=class{constructor(){this.current=[],this.previous=[]}getKey(t,e){if(e<t){let s=e;e=t,t=s}return t<<16|e}set(t,e){let s=this.getKey(t,e),n=this.current,i=0;for(;s>n[i];)i++;if(s!==n[i]){for(let o=n.length-1;o>=i;o--)n[o+1]=n[o];n[i]=s}}tick(){let t=this.current;this.current=this.previous,this.previous=t,this.current.length=0}getDiff(t,e){let s=this.current,n=this.previous,i=s.length,o=n.length,r=0;for(let a=0;a<i;a++){let l=!1,d=s[a];for(;d>n[r];)r++;l=d===n[r],l||xe(t,d)}r=0;for(let a=0;a<o;a++){let l=!1,d=n[a];for(;d>s[r];)r++;l=s[r]===d,l||xe(e,d)}}};function xe(w,t){w.push((t&4294901760)>>16,t&65535)}var Ht=(w,t)=>w<t?`${w}-${t}`:`${t}-${w}`,te=class{constructor(){this.data={keys:[]}}get(t,e){let s=Ht(t,e);return this.data[s]}set(t,e,s){let n=Ht(t,e);this.get(t,e)||this.data.keys.push(n),this.data[n]=s}delete(t,e){let s=Ht(t,e),n=this.data.keys.indexOf(s);n!==-1&&this.data.keys.splice(n,1),delete this.data[s]}reset(){let t=this.data,e=t.keys;for(;e.length>0;){let s=e.pop();delete t[s]}}},Pt=class extends zt{constructor(t){t===void 0&&(t={}),super(),this.dt=-1,this.allowSleep=!!t.allowSleep,this.contacts=[],this.frictionEquations=[],this.quatNormalizeSkip=t.quatNormalizeSkip!==void 0?t.quatNormalizeSkip:0,this.quatNormalizeFast=t.quatNormalizeFast!==void 0?t.quatNormalizeFast:!1,this.time=0,this.stepnumber=0,this.default_dt=1/60,this.nextId=0,this.gravity=new c,t.gravity&&this.gravity.copy(t.gravity),t.frictionGravity&&(this.frictionGravity=new c,this.frictionGravity.copy(t.frictionGravity)),this.broadphase=t.broadphase!==void 0?t.broadphase:new Ut,this.bodies=[],this.hasActiveBodies=!1,this.solver=t.solver!==void 0?t.solver:new Zt,this.constraints=[],this.narrowphase=new Jt(this),this.collisionMatrix=new Et,this.collisionMatrixPrevious=new Et,this.bodyOverlapKeeper=new Rt,this.shapeOverlapKeeper=new Rt,this.contactmaterials=[],this.contactMaterialTable=new te,this.defaultMaterial=new Mt("default"),this.defaultContactMaterial=new _t(this.defaultMaterial,this.defaultMaterial,{friction:.3,restitution:0}),this.doProfiling=!1,this.profile={solve:0,makeContactConstraints:0,broadphase:0,integrate:0,narrowphase:0},this.accumulator=0,this.subsystems=[],this.addBodyEvent={type:"addBody",body:null},this.removeBodyEvent={type:"removeBody",body:null},this.idToBodyMap={},this.broadphase.setWorld(this)}getContactMaterial(t,e){return this.contactMaterialTable.get(t.id,e.id)}collisionMatrixTick(){let t=this.collisionMatrixPrevious;this.collisionMatrixPrevious=this.collisionMatrix,this.collisionMatrix=t,this.collisionMatrix.reset(),this.bodyOverlapKeeper.tick(),this.shapeOverlapKeeper.tick()}addConstraint(t){this.constraints.push(t)}removeConstraint(t){let e=this.constraints.indexOf(t);e!==-1&&this.constraints.splice(e,1)}rayTest(t,e,s){s instanceof dt?this.raycastClosest(t,e,{skipBackfaces:!0},s):this.raycastAll(t,e,{skipBackfaces:!0},s)}raycastAll(t,e,s,n){return s===void 0&&(s={}),s.mode=X.ALL,s.from=t,s.to=e,s.callback=n,Gt.intersectWorld(this,s)}raycastAny(t,e,s,n){return s===void 0&&(s={}),s.mode=X.ANY,s.from=t,s.to=e,s.result=n,Gt.intersectWorld(this,s)}raycastClosest(t,e,s,n){return s===void 0&&(s={}),s.mode=X.CLOSEST,s.from=t,s.to=e,s.result=n,Gt.intersectWorld(this,s)}addBody(t){this.bodies.includes(t)||(t.index=this.bodies.length,this.bodies.push(t),t.world=this,t.initPosition.copy(t.position),t.initVelocity.copy(t.velocity),t.timeLastSleepy=this.time,t instanceof q&&(t.initAngularVelocity.copy(t.angularVelocity),t.initQuaternion.copy(t.quaternion)),this.collisionMatrix.setNumObjects(this.bodies.length),this.addBodyEvent.body=t,this.idToBodyMap[t.id]=t,this.dispatchEvent(this.addBodyEvent))}removeBody(t){t.world=null;let e=this.bodies.length-1,s=this.bodies,n=s.indexOf(t);if(n!==-1){s.splice(n,1);for(let i=0;i!==s.length;i++)s[i].index=i;this.collisionMatrix.setNumObjects(e),this.removeBodyEvent.body=t,delete this.idToBodyMap[t.id],this.dispatchEvent(this.removeBodyEvent)}}getBodyById(t){return this.idToBodyMap[t]}getShapeById(t){let e=this.bodies;for(let s=0;s<e.length;s++){let n=e[s].shapes;for(let i=0;i<n.length;i++){let o=n[i];if(o.id===t)return o}}return null}addContactMaterial(t){this.contactmaterials.push(t),this.contactMaterialTable.set(t.materials[0].id,t.materials[1].id,t)}removeContactMaterial(t){let e=this.contactmaterials.indexOf(t);e!==-1&&(this.contactmaterials.splice(e,1),this.contactMaterialTable.delete(t.materials[0].id,t.materials[1].id))}fixedStep(t,e){t===void 0&&(t=1/60),e===void 0&&(e=10);let s=O.now()/1e3;if(!this.lastCallTime)this.step(t,void 0,e);else{let n=s-this.lastCallTime;this.step(t,n,e)}this.lastCallTime=s}step(t,e,s){if(s===void 0&&(s=10),e===void 0)this.internalStep(t),this.time+=t;else{this.accumulator+=e;let n=O.now(),i=0;for(;this.accumulator>=t&&i<s&&(this.internalStep(t),this.accumulator-=t,i++,!(O.now()-n>t*1e3)););this.accumulator=this.accumulator%t;let o=this.accumulator/t;for(let r=0;r!==this.bodies.length;r++){let a=this.bodies[r];a.previousPosition.lerp(a.position,o,a.interpolatedPosition),a.previousQuaternion.slerp(a.quaternion,o,a.interpolatedQuaternion),a.previousQuaternion.normalize()}this.time+=e}}internalStep(t){this.dt=t;let e=this.contacts,s=Kn,n=Qn,i=this.bodies.length,o=this.bodies,r=this.solver,a=this.gravity,l=this.doProfiling,d=this.profile,u=q.DYNAMIC,h=-1/0,f=this.constraints,p=Zn;a.length();let y=a.x,v=a.y,x=a.z,m=0;for(l&&(h=O.now()),m=0;m!==i;m++){let A=o[m];if(A.type===u){let S=A.force,C=A.mass;S.x+=C*y,S.y+=C*v,S.z+=C*x}}for(let A=0,S=this.subsystems.length;A!==S;A++)this.subsystems[A].update();l&&(h=O.now()),s.length=0,n.length=0,this.broadphase.collisionPairs(this,s,n),l&&(d.broadphase=O.now()-h);let g=f.length;for(m=0;m!==g;m++){let A=f[m];if(!A.collideConnected)for(let S=s.length-1;S>=0;S-=1)(A.bodyA===s[S]&&A.bodyB===n[S]||A.bodyB===s[S]&&A.bodyA===n[S])&&(s.splice(S,1),n.splice(S,1))}this.collisionMatrixTick(),l&&(h=O.now());let b=$n,B=e.length;for(m=0;m!==B;m++)b.push(e[m]);e.length=0;let z=this.frictionEquations.length;for(m=0;m!==z;m++)p.push(this.frictionEquations[m]);for(this.frictionEquations.length=0,this.narrowphase.getContacts(s,n,this,e,b,this.frictionEquations,p),l&&(d.narrowphase=O.now()-h),l&&(h=O.now()),m=0;m<this.frictionEquations.length;m++)r.addEquation(this.frictionEquations[m]);let F=e.length;for(let A=0;A!==F;A++){let S=e[A],C=S.bi,E=S.bj,k=S.si,P=S.sj,W;if(C.material&&E.material?W=this.getContactMaterial(C.material,E.material)||this.defaultContactMaterial:W=this.defaultContactMaterial,W.friction,C.material&&E.material&&(C.material.friction>=0&&E.material.friction>=0&&C.material.friction*E.material.friction,C.material.restitution>=0&&E.material.restitution>=0&&(S.restitution=C.material.restitution*E.material.restitution)),r.addEquation(S),C.allowSleep&&C.type===q.DYNAMIC&&C.sleepState===q.SLEEPING&&E.sleepState===q.AWAKE&&E.type!==q.STATIC){let D=E.velocity.lengthSquared()+E.angularVelocity.lengthSquared(),G=E.sleepSpeedLimit**2;D>=G*2&&(C.wakeUpAfterNarrowphase=!0)}if(E.allowSleep&&E.type===q.DYNAMIC&&E.sleepState===q.SLEEPING&&C.sleepState===q.AWAKE&&C.type!==q.STATIC){let D=C.velocity.lengthSquared()+C.angularVelocity.lengthSquared(),G=C.sleepSpeedLimit**2;D>=G*2&&(E.wakeUpAfterNarrowphase=!0)}this.collisionMatrix.set(C,E,!0),this.collisionMatrixPrevious.get(C,E)||(pt.body=E,pt.contact=S,C.dispatchEvent(pt),pt.body=C,E.dispatchEvent(pt)),this.bodyOverlapKeeper.set(C.id,E.id),this.shapeOverlapKeeper.set(k.id,P.id)}for(this.emitContactEvents(),l&&(d.makeContactConstraints=O.now()-h,h=O.now()),m=0;m!==i;m++){let A=o[m];A.wakeUpAfterNarrowphase&&(A.wakeUp(),A.wakeUpAfterNarrowphase=!1)}for(g=f.length,m=0;m!==g;m++){let A=f[m];A.update();for(let S=0,C=A.equations.length;S!==C;S++){let E=A.equations[S];r.addEquation(E)}}r.solve(t,this),l&&(d.solve=O.now()-h),r.removeAllEquations();let _=Math.pow;for(m=0;m!==i;m++){let A=o[m];if(A.type&u){let S=_(1-A.linearDamping,t),C=A.velocity;C.scale(S,C);let E=A.angularVelocity;if(E){let k=_(1-A.angularDamping,t);E.scale(k,E)}}}this.dispatchEvent(Xn),l&&(h=O.now());let I=this.stepnumber%(this.quatNormalizeSkip+1)===0,T=this.quatNormalizeFast;for(m=0;m!==i;m++)o[m].integrate(t,I,T);this.clearForces(),this.broadphase.dirty=!0,l&&(d.integrate=O.now()-h),this.stepnumber+=1,this.dispatchEvent(Yn);let L=!0;if(this.allowSleep)for(L=!1,m=0;m!==i;m++){let A=o[m];A.sleepTick(this.time),A.sleepState!==q.SLEEPING&&(L=!0)}this.hasActiveBodies=L}emitContactEvents(){let t=this.hasAnyEventListener("beginContact"),e=this.hasAnyEventListener("endContact");if((t||e)&&this.bodyOverlapKeeper.getDiff(tt,et),t){for(let i=0,o=tt.length;i<o;i+=2)ft.bodyA=this.getBodyById(tt[i]),ft.bodyB=this.getBodyById(tt[i+1]),this.dispatchEvent(ft);ft.bodyA=ft.bodyB=null}if(e){for(let i=0,o=et.length;i<o;i+=2)mt.bodyA=this.getBodyById(et[i]),mt.bodyB=this.getBodyById(et[i+1]),this.dispatchEvent(mt);mt.bodyA=mt.bodyB=null}tt.length=et.length=0;let s=this.hasAnyEventListener("beginShapeContact"),n=this.hasAnyEventListener("endShapeContact");if((s||n)&&this.shapeOverlapKeeper.getDiff(tt,et),s){for(let i=0,o=tt.length;i<o;i+=2){let r=this.getShapeById(tt[i]),a=this.getShapeById(tt[i+1]);st.shapeA=r,st.shapeB=a,r&&(st.bodyA=r.body),a&&(st.bodyB=a.body),this.dispatchEvent(st)}st.bodyA=st.bodyB=st.shapeA=st.shapeB=null}if(n){for(let i=0,o=et.length;i<o;i+=2){let r=this.getShapeById(et[i]),a=this.getShapeById(et[i+1]);nt.shapeA=r,nt.shapeB=a,r&&(nt.bodyA=r.body),a&&(nt.bodyB=a.body),this.dispatchEvent(nt)}nt.bodyA=nt.bodyB=nt.shapeA=nt.shapeB=null}}clearForces(){let t=this.bodies,e=t.length;for(let s=0;s!==e;s++){let n=t[s];n.force,n.torque,n.force.set(0,0,0),n.torque.set(0,0,0)}}};new Y;var Gt=new X,O=globalThis.performance||{};if(!O.now){let w=Date.now();O.timing&&O.timing.navigationStart&&(w=O.timing.navigationStart),O.now=()=>Date.now()-w}new c;var Yn={type:"postStep"},Xn={type:"preStep"},pt={type:q.COLLIDE_EVENT_NAME,body:null,contact:null},$n=[],Zn=[],Kn=[],Qn=[],tt=[],et=[],ft={type:"beginContact",bodyA:null,bodyB:null},mt={type:"endContact",bodyA:null,bodyB:null},st={type:"beginShapeContact",bodyA:null,bodyB:null,shapeA:null,shapeB:null},nt={type:"endShapeContact",bodyA:null,bodyB:null,shapeA:null,shapeB:null};return Me(Jn);})();